[{"scopus_import":"1","abstract":[{"text":"Three-dimensional (3D) super-resolution microscopy technique structured illumination microscopy (SIM) imaging of dendritic spines along the dendrite has not been previously performed in fixed tissues, mainly due to deterioration of the stripe pattern of the excitation laser induced by light scattering and optical aberrations. To address this issue and solve these optical problems, we applied a novel clearing reagent, LUCID, to fixed brains. In SIM imaging, the penetration depth and the spatial resolution were improved in LUCID-treated slices, and 160-nm spatial resolution was obtained in a large portion of the imaging volume on a single apical dendrite. Furthermore, in a morphological analysis of spine heads of layer V pyramidal neurons (L5PNs) in the medial prefrontal cortex (mPFC) of chronic dexamethasone (Dex)-treated mice, SIM imaging revealed an altered distribution of spine forms that could not be detected by high-NA confocal imaging. Thus, super-resolution SIM imaging represents a promising high-throughput method for revealing spine morphologies in single dendrites.","lang":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-19T09:58:40Z","author":[{"first_name":"Kazuaki","last_name":"Sawada","full_name":"Sawada, Kazuaki"},{"last_name":"Kawakami","full_name":"Kawakami, Ryosuke","first_name":"Ryosuke"},{"first_name":"Ryuichi","id":"499F3ABC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8761-9444","last_name":"Shigemoto","full_name":"Shigemoto, Ryuichi"},{"full_name":"Nemoto, Tomomi","last_name":"Nemoto","first_name":"Tomomi"}],"status":"public","license":"https://creativecommons.org/licenses/by-nc/4.0/","issue":"9","_id":"326","external_id":{"isi":["000431496400001"]},"publication_status":"published","oa_version":"Published Version","file":[{"date_created":"2018-12-17T16:16:50Z","file_size":4850261,"checksum":"98e901d8229e44aa8f3b51d248dedd09","date_updated":"2020-07-14T12:46:06Z","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_id":"5721","creator":"dernst","file_name":"2018_EJN_Sawada.pdf"}],"ddc":["570"],"type":"journal_article","publisher":"Wiley","department":[{"_id":"RySh"}],"month":"03","year":"2018","isi":1,"date_published":"2018-03-07T00:00:00Z","has_accepted_license":"1","intvolume":"        47","volume":47,"publication":"European Journal of Neuroscience","day":"07","article_processing_charge":"No","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"file_date_updated":"2020-07-14T12:46:06Z","doi":"10.1111/ejn.13901","quality_controlled":"1","date_created":"2018-12-11T11:45:50Z","acknowledged_ssus":[{"_id":"EM-Fac"}],"citation":{"chicago":"Sawada, Kazuaki, Ryosuke Kawakami, Ryuichi Shigemoto, and Tomomi Nemoto. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” <i>European Journal of Neuroscience</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/ejn.13901\">https://doi.org/10.1111/ejn.13901</a>.","apa":"Sawada, K., Kawakami, R., Shigemoto, R., &#38; Nemoto, T. (2018). Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. <i>European Journal of Neuroscience</i>. Wiley. <a href=\"https://doi.org/10.1111/ejn.13901\">https://doi.org/10.1111/ejn.13901</a>","mla":"Sawada, Kazuaki, et al. “Super Resolution Structural Analysis of Dendritic Spines Using Three-Dimensional Structured Illumination Microscopy in Cleared Mouse Brain Slices.” <i>European Journal of Neuroscience</i>, vol. 47, no. 9, Wiley, 2018, pp. 1033–42, doi:<a href=\"https://doi.org/10.1111/ejn.13901\">10.1111/ejn.13901</a>.","ista":"Sawada K, Kawakami R, Shigemoto R, Nemoto T. 2018. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. European Journal of Neuroscience. 47(9), 1033–1042.","short":"K. Sawada, R. Kawakami, R. Shigemoto, T. Nemoto, European Journal of Neuroscience 47 (2018) 1033–1042.","ieee":"K. Sawada, R. Kawakami, R. Shigemoto, and T. Nemoto, “Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices,” <i>European Journal of Neuroscience</i>, vol. 47, no. 9. Wiley, pp. 1033–1042, 2018.","ama":"Sawada K, Kawakami R, Shigemoto R, Nemoto T. Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices. <i>European Journal of Neuroscience</i>. 2018;47(9):1033-1042. doi:<a href=\"https://doi.org/10.1111/ejn.13901\">10.1111/ejn.13901</a>"},"oa":1,"title":"Super resolution structural analysis of dendritic spines using three-dimensional structured illumination microscopy in cleared mouse brain slices","publist_id":"7539","page":"1033 - 1042"},{"date_updated":"2023-09-18T09:31:46Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1706.05026","open_access":"1"}],"abstract":[{"text":"Many-body quantum systems typically display fast dynamics and ballistic spreading of information. Here we address the open problem of how slow the dynamics can be after a generic breaking of integrability by local interactions. We develop a method based on degenerate perturbation theory that reveals slow dynamical regimes and delocalization processes in general translation invariant models, along with accurate estimates of their delocalization time scales. Our results shed light on the fundamental questions of the robustness of quantum integrable systems and the possibility of many-body localization without disorder. As an example, we construct a large class of one-dimensional lattice models where, despite the absence of asymptotic localization, the transient dynamics is exceptionally slow, i.e., the dynamics is indistinguishable from that of many-body localized systems for the system sizes and time scales accessible in experiments and numerical simulations.","lang":"eng"}],"scopus_import":"1","status":"public","author":[{"orcid":"0000-0002-8443-1064","last_name":"Michailidis","full_name":"Michailidis, Alexios","id":"36EBAD38-F248-11E8-B48F-1D18A9856A87","first_name":"Alexios"},{"last_name":"Žnidarič","full_name":"Žnidarič, Marko","first_name":"Marko"},{"first_name":"Mariya","full_name":"Medvedyeva, Mariya","last_name":"Medvedyeva"},{"last_name":"Abanin","full_name":"Abanin, Dmitry","first_name":"Dmitry"},{"first_name":"Tomaž","last_name":"Prosen","full_name":"Prosen, Tomaž"},{"first_name":"Zlatko","last_name":"Papić","full_name":"Papić, Zlatko"}],"publisher":"American Physical Society","type":"journal_article","oa_version":"Preprint","publication_status":"published","external_id":{"isi":["000427798800005"]},"issue":"10","_id":"327","isi":1,"month":"03","year":"2018","department":[{"_id":"MaSe"}],"day":"19","acknowledgement":"We thank F. Huveneers for useful discussions. Z.P. and A.M. acknowledge support by EPSRC Grant No. EP/P009409/1 and and the Royal Society Research Grant No. RG160635. Statement of compliance with EPSRC policy framework on research data: This publication is theoretical work that does not require supporting research data. D.A. acknowledges support by the Swiss National Science Foundation. M.Z., M.M. and T.P. acknowledge Grants J1-7279 (M.Z.) and N1-0025 (M.M. and T.P.) of Slovenian Research Agency, and Advanced Grant of European Research Council, Grant No. 694544 - OMNES (T.P.).","publication":"Physical Review B","volume":97,"intvolume":"        97","date_published":"2018-03-19T00:00:00Z","doi":"10.1103/PhysRevB.97.104307","article_processing_charge":"No","oa":1,"article_number":"104307","citation":{"ama":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. Slow dynamics in translation-invariant quantum lattice models. <i>Physical Review B</i>. 2018;97(10). doi:<a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">10.1103/PhysRevB.97.104307</a>","ieee":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, and Z. Papić, “Slow dynamics in translation-invariant quantum lattice models,” <i>Physical Review B</i>, vol. 97, no. 10. American Physical Society, 2018.","ista":"Michailidis A, Žnidarič M, Medvedyeva M, Abanin D, Prosen T, Papić Z. 2018. Slow dynamics in translation-invariant quantum lattice models. Physical Review B. 97(10), 104307.","short":"A. Michailidis, M. Žnidarič, M. Medvedyeva, D. Abanin, T. Prosen, Z. Papić, Physical Review B 97 (2018).","mla":"Michailidis, Alexios, et al. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” <i>Physical Review B</i>, vol. 97, no. 10, 104307, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">10.1103/PhysRevB.97.104307</a>.","apa":"Michailidis, A., Žnidarič, M., Medvedyeva, M., Abanin, D., Prosen, T., &#38; Papić, Z. (2018). Slow dynamics in translation-invariant quantum lattice models. <i>Physical Review B</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">https://doi.org/10.1103/PhysRevB.97.104307</a>","chicago":"Michailidis, Alexios, Marko Žnidarič, Mariya Medvedyeva, Dmitry Abanin, Tomaž Prosen, and Zlatko Papić. “Slow Dynamics in Translation-Invariant Quantum Lattice Models.” <i>Physical Review B</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevB.97.104307\">https://doi.org/10.1103/PhysRevB.97.104307</a>."},"date_created":"2018-12-11T11:45:50Z","quality_controlled":"1","publist_id":"7538","title":"Slow dynamics in translation-invariant quantum lattice models"},{"doi":"10.1103/PhysRevLett.120.124501","ec_funded":1,"article_processing_charge":"No","volume":120,"publication":"Physical Review Letters","day":"19","acknowledgement":"The authors thank Philipp Maier and the IST Austria workshop for their dedicated technical support.","intvolume":"       120","date_published":"2018-03-19T00:00:00Z","publist_id":"7537","title":"Exceeding the asymptotic limit of polymer drag reduction","article_number":"124501","oa":1,"citation":{"ieee":"G. H. Choueiri, J. M. Lopez Alonso, and B. Hof, “Exceeding the asymptotic limit of polymer drag reduction,” <i>Physical Review Letters</i>, vol. 120, no. 12. American Physical Society, 2018.","ista":"Choueiri GH, Lopez Alonso JM, Hof B. 2018. Exceeding the asymptotic limit of polymer drag reduction. Physical Review Letters. 120(12), 124501.","short":"G.H. Choueiri, J.M. Lopez Alonso, B. Hof, Physical Review Letters 120 (2018).","ama":"Choueiri GH, Lopez Alonso JM, Hof B. Exceeding the asymptotic limit of polymer drag reduction. <i>Physical Review Letters</i>. 2018;120(12). doi:<a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">10.1103/PhysRevLett.120.124501</a>","mla":"Choueiri, George H., et al. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” <i>Physical Review Letters</i>, vol. 120, no. 12, 124501, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">10.1103/PhysRevLett.120.124501</a>.","chicago":"Choueiri, George H, Jose M Lopez Alonso, and Björn Hof. “Exceeding the Asymptotic Limit of Polymer Drag Reduction.” <i>Physical Review Letters</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">https://doi.org/10.1103/PhysRevLett.120.124501</a>.","apa":"Choueiri, G. H., Lopez Alonso, J. M., &#38; Hof, B. (2018). Exceeding the asymptotic limit of polymer drag reduction. <i>Physical Review Letters</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevLett.120.124501\">https://doi.org/10.1103/PhysRevLett.120.124501</a>"},"acknowledged_ssus":[{"_id":"SSU"}],"date_created":"2018-12-11T11:45:51Z","quality_controlled":"1","author":[{"full_name":"Choueiri, George H","last_name":"Choueiri","id":"448BD5BC-F248-11E8-B48F-1D18A9856A87","first_name":"George H"},{"first_name":"Jose M","id":"40770848-F248-11E8-B48F-1D18A9856A87","full_name":"Lopez Alonso, Jose M","last_name":"Lopez Alonso","orcid":"0000-0002-0384-2022"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754","last_name":"Hof","full_name":"Hof, Björn"}],"status":"public","date_updated":"2023-10-10T13:27:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"The drag of turbulent flows can be drastically decreased by adding small amounts of high molecular weight polymers. While drag reduction initially increases with polymer concentration, it eventually saturates to what is known as the maximum drag reduction (MDR) asymptote; this asymptote is generally attributed to the dynamics being reduced to a marginal yet persistent state of subdued turbulent motion. Contrary to this accepted view, we show that, for an appropriate choice of parameters, polymers can reduce the drag beyond the suggested asymptotic limit, eliminating turbulence and giving way to laminar flow. At higher polymer concentrations, however, the laminar state becomes unstable, resulting in a fluctuating flow with the characteristic drag of the MDR asymptote. Our findings indicate that the asymptotic state is hence dynamically disconnected from ordinary turbulence. © 2018 American Physical Society.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1703.06271"}],"scopus_import":"1","isi":1,"month":"03","year":"2018","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"},{"grant_number":"306589","name":"Decoding the complexity of turbulence at its origin","call_identifier":"FP7","_id":"25152F3A-B435-11E9-9278-68D0E5697425"}],"department":[{"_id":"BjHo"}],"publisher":"American Physical Society","type":"journal_article","oa_version":"Preprint","issue":"12","_id":"328","publication_status":"published","external_id":{"isi":["000427804000005"]}},{"year":"2018","month":"10","isi":1,"department":[{"_id":"NiBa"}],"publisher":"PeerJ","_id":"33","issue":"10","external_id":{"isi":["000447204400001"],"pmid":["30294507"]},"publication_status":"published","type":"journal_article","file":[{"file_name":"2018_PeerJ_Bertl.pdf","relation":"main_file","file_id":"5692","creator":"dernst","date_updated":"2020-07-14T12:46:06Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-17T10:46:06Z","file_size":1328344,"checksum":"3334886c4b39678db4c4b74299ca14ba"}],"ddc":["576"],"oa_version":"Published Version","author":[{"first_name":"Johanna","full_name":"Bertl, Johanna","last_name":"Bertl"},{"last_name":"Ringbauer","full_name":"Ringbauer, Harald","orcid":"0000-0002-4884-9682","id":"417FCFF4-F248-11E8-B48F-1D18A9856A87","first_name":"Harald"},{"first_name":"Michaël","full_name":"Blum, Michaël","last_name":"Blum"}],"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-10-17T12:24:43Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Secondary contact is the reestablishment of gene flow between sister populations that have diverged. For instance, at the end of the Quaternary glaciations in Europe, secondary contact occurred during the northward expansion of the populations which had found refugia in the southern peninsulas. With the advent of multi-locus markers, secondary contact can be investigated using various molecular signatures including gradients of allele frequency, admixture clines, and local increase of genetic differentiation. We use coalescent simulations to investigate if molecular data provide enough information to distinguish between secondary contact following range expansion and an alternative evolutionary scenario consisting of a barrier to gene flow in an isolation-by-distance model. We find that an excess of linkage disequilibrium and of genetic diversity at the suture zone is a unique signature of secondary contact. We also find that the directionality index ψ, which was proposed to study range expansion, is informative to distinguish between the two hypotheses. However, although evidence for secondary contact is usually conveyed by statistics related to admixture coefficients, we find that they can be confounded by isolation-by-distance. We recommend to account for the spatial repartition of individuals when investigating secondary contact in order to better reflect the complex spatio-temporal evolution of populations and species."}],"publist_id":"8022","title":"Can secondary contact following range expansion be distinguished from barriers to gene flow?","article_number":"e5325","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:44:16Z","citation":{"mla":"Bertl, Johanna, et al. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” <i>PeerJ</i>, vol. 2018, no. 10, e5325, PeerJ, 2018, doi:<a href=\"https://doi.org/10.7717/peerj.5325\">10.7717/peerj.5325</a>.","chicago":"Bertl, Johanna, Harald Ringbauer, and Michaël Blum. “Can Secondary Contact Following Range Expansion Be Distinguished from Barriers to Gene Flow?” <i>PeerJ</i>. PeerJ, 2018. <a href=\"https://doi.org/10.7717/peerj.5325\">https://doi.org/10.7717/peerj.5325</a>.","apa":"Bertl, J., Ringbauer, H., &#38; Blum, M. (2018). Can secondary contact following range expansion be distinguished from barriers to gene flow? <i>PeerJ</i>. PeerJ. <a href=\"https://doi.org/10.7717/peerj.5325\">https://doi.org/10.7717/peerj.5325</a>","ista":"Bertl J, Ringbauer H, Blum M. 2018. Can secondary contact following range expansion be distinguished from barriers to gene flow? PeerJ. 2018(10), e5325.","ieee":"J. Bertl, H. Ringbauer, and M. Blum, “Can secondary contact following range expansion be distinguished from barriers to gene flow?,” <i>PeerJ</i>, vol. 2018, no. 10. PeerJ, 2018.","short":"J. Bertl, H. Ringbauer, M. Blum, PeerJ 2018 (2018).","ama":"Bertl J, Ringbauer H, Blum M. Can secondary contact following range expansion be distinguished from barriers to gene flow? <i>PeerJ</i>. 2018;2018(10). doi:<a href=\"https://doi.org/10.7717/peerj.5325\">10.7717/peerj.5325</a>"},"file_date_updated":"2020-07-14T12:46:06Z","doi":"10.7717/peerj.5325","article_processing_charge":"No","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pmid":1,"volume":2018,"acknowledgement":"Johanna Bertl was supported by the Vienna Graduate School of Population Genetics (Austrian Science Fund (FWF): W1225-B20) and worked on this project while employed at the Department of Statistics and Operations Research, University of Vienna, Austria. This article was developed in the framework of the Grenoble Alpes Data Institute, which is supported by the French National Research Agency under the “Investissments d’avenir” program (ANR-15-IDEX-02).","publication":"PeerJ","day":"01","date_published":"2018-10-01T00:00:00Z","intvolume":"      2018","has_accepted_license":"1"},{"quality_controlled":"1","publication_status":"published","_id":"3300","oa_version":"None","type":"book","citation":{"apa":"Clarke, E. M., Henzinger, T. A., Veith, H., &#38; Bloem, R. (2018). <i>Handbook of Model Checking</i> (1st ed.). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>","chicago":"Clarke, Edmund M., Thomas A Henzinger, Helmut Veith, and Roderick Bloem. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-10575-8\">https://doi.org/10.1007/978-3-319-10575-8</a>.","mla":"Clarke, Edmund M., et al. <i>Handbook of Model Checking</i>. 1st ed., Springer Nature, 2018, doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>.","ama":"Clarke EM, Henzinger TA, Veith H, Bloem R. <i>Handbook of Model Checking</i>. 1st ed. Cham: Springer Nature; 2018. doi:<a href=\"https://doi.org/10.1007/978-3-319-10575-8\">10.1007/978-3-319-10575-8</a>","ista":"Clarke EM, Henzinger TA, Veith H, Bloem R. 2018. Handbook of Model Checking 1st ed., Cham: Springer Nature, XLVIII, 1212p.","short":"E.M. Clarke, T.A. Henzinger, H. Veith, R. Bloem, Handbook of Model Checking, 1st ed., Springer Nature, Cham, 2018.","ieee":"E. M. Clarke, T. A. Henzinger, H. Veith, and R. Bloem, <i>Handbook of Model Checking</i>, 1st ed. Cham: Springer Nature, 2018."},"date_created":"2018-12-11T12:02:32Z","publisher":"Springer Nature","edition":"1","department":[{"_id":"ToHe"}],"title":"Handbook of Model Checking","page":"XLVIII, 1212","publist_id":"3340","year":"2018","month":"06","publication_identifier":{"eisbn":["978-3-319-10575-8"],"isbn":["978-3-319-10574-1"]},"retracted":"1","date_published":"2018-06-08T00:00:00Z","scopus_import":"1","abstract":[{"text":"This book first explores the origins of this idea, grounded in theoretical work on temporal logic and automata. The editors and authors are among the world's leading researchers in this domain, and they contributed 32 chapters representing a thorough view of the development and application of the technique. Topics covered include binary decision diagrams, symbolic model checking, satisfiability modulo theories, partial-order reduction, abstraction, interpolation, concurrency, security protocols, games, probabilistic model checking, and process algebra, and chapters on the transfer of theory to industrial practice, property specification languages for hardware, and verification of real-time systems and hybrid systems.\r\n\r\nThe book will be valuable for researchers and graduate students engaged with the development of formal methods and verification tools.","lang":"eng"}],"language":[{"iso":"eng"}],"place":"Cham","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","day":"08","date_updated":"2025-07-24T09:25:31Z","status":"public","author":[{"first_name":"Edmund M.","last_name":"Clarke","full_name":"Clarke, Edmund M."},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A"},{"last_name":"Veith","full_name":"Veith, Helmut","first_name":"Helmut"},{"last_name":"Bloem","full_name":"Bloem, Roderick","first_name":"Roderick"}],"article_processing_charge":"No","doi":"10.1007/978-3-319-10575-8"},{"status":"public","author":[{"last_name":"Dziembowski","full_name":"Dziembowski, Stefan","first_name":"Stefan"},{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","full_name":"Wichs, Daniel","last_name":"Wichs"}],"main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2009/608"}],"abstract":[{"text":"We introduce the notion of “non-malleable codes” which relaxes the notion of error correction and error detection. Informally, a code is non-malleable if the message contained in a modified codeword is either the original message, or a completely unrelated value. In contrast to error correction and error detection, non-malleability can be achieved for very rich classes of modifications. We construct an efficient code that is non-malleable with respect to modifications that affect each bit of the codeword arbitrarily (i.e., leave it untouched, flip it, or set it to either 0 or 1), but independently of the value of the other bits of the codeword. Using the probabilistic method, we also show a very strong and general statement: there exists a non-malleable code for every “small enough” family F of functions via which codewords can be modified. Although this probabilistic method argument does not directly yield efficient constructions, it gives us efficient non-malleable codes in the random-oracle model for very general classes of tampering functions—e.g., functions where every bit in the tampered codeword can depend arbitrarily on any 99% of the bits in the original codeword. As an application of non-malleable codes, we show that they provide an elegant algorithmic solution to the task of protecting functionalities implemented in hardware (e.g., signature cards) against “tampering attacks.” In such attacks, the secret state of a physical system is tampered, in the hopes that future interaction with the modified system will reveal some secret information. This problem was previously studied in the work of Gennaro et al. in 2004 under the name “algorithmic tamper proof security” (ATP). We show that non-malleable codes can be used to achieve important improvements over the prior work. In particular, we show that any functionality can be made secure against a large class of tampering attacks, simply by encoding the secret state with a non-malleable code while it is stored in memory.","lang":"eng"}],"scopus_import":"1","date_updated":"2023-09-13T09:05:17Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"article_type":"original","isi":1,"project":[{"grant_number":"682815","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Teaching Old Crypto New Tricks"},{"grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425"}],"month":"08","year":"2018","type":"journal_article","oa_version":"Preprint","publication_status":"published","external_id":{"isi":["000442938200004"]},"issue":"4","_id":"107","publisher":"ACM","ec_funded":1,"article_processing_charge":"No","doi":"10.1145/3178432","intvolume":"        65","date_published":"2018-08-01T00:00:00Z","publication":"Journal of the ACM","day":"01","volume":65,"title":"Non-malleable codes","publist_id":"7947","date_created":"2018-12-11T11:44:40Z","citation":{"chicago":"Dziembowski, Stefan, Krzysztof Z Pietrzak, and Daniel Wichs. “Non-Malleable Codes.” <i>Journal of the ACM</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>.","apa":"Dziembowski, S., Pietrzak, K. Z., &#38; Wichs, D. (2018). Non-malleable codes. <i>Journal of the ACM</i>. ACM. <a href=\"https://doi.org/10.1145/3178432\">https://doi.org/10.1145/3178432</a>","mla":"Dziembowski, Stefan, et al. “Non-Malleable Codes.” <i>Journal of the ACM</i>, vol. 65, no. 4, 20, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>.","ista":"Dziembowski S, Pietrzak KZ, Wichs D. 2018. Non-malleable codes. Journal of the ACM. 65(4), 20.","short":"S. Dziembowski, K.Z. Pietrzak, D. Wichs, Journal of the ACM 65 (2018).","ieee":"S. Dziembowski, K. Z. Pietrzak, and D. Wichs, “Non-malleable codes,” <i>Journal of the ACM</i>, vol. 65, no. 4. ACM, 2018.","ama":"Dziembowski S, Pietrzak KZ, Wichs D. Non-malleable codes. <i>Journal of the ACM</i>. 2018;65(4). doi:<a href=\"https://doi.org/10.1145/3178432\">10.1145/3178432</a>"},"quality_controlled":"1","oa":1,"article_number":"20"},{"date_published":"2018-08-16T00:00:00Z","intvolume":"      2018","volume":2018,"day":"16","article_processing_charge":"No","doi":"10.1109/ISIT.2018.8437654","conference":{"name":"ISIT: International Symposium on Information Theory","start_date":"2018-06-17 ","location":"Vail, CO, USA","end_date":"2018-06-22"},"quality_controlled":"1","citation":{"ama":"Obremski M, Skórski M. Inverted leftover hash lemma. In: Vol 2018. IEEE; 2018. doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>","ieee":"M. Obremski and M. Skórski, “Inverted leftover hash lemma,” presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA, 2018, vol. 2018.","short":"M. Obremski, M. Skórski, in:, IEEE, 2018.","ista":"Obremski M, Skórski M. 2018. Inverted leftover hash lemma. ISIT: International Symposium on Information Theory, ISIT Proceedings, vol. 2018.","mla":"Obremski, Marciej, and Maciej Skórski. <i>Inverted Leftover Hash Lemma</i>. Vol. 2018, IEEE, 2018, doi:<a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">10.1109/ISIT.2018.8437654</a>.","apa":"Obremski, M., &#38; Skórski, M. (2018). Inverted leftover hash lemma (Vol. 2018). Presented at the ISIT: International Symposium on Information Theory, Vail, CO, USA: IEEE. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>","chicago":"Obremski, Marciej, and Maciej Skórski. “Inverted Leftover Hash Lemma,” Vol. 2018. IEEE, 2018. <a href=\"https://doi.org/10.1109/ISIT.2018.8437654\">https://doi.org/10.1109/ISIT.2018.8437654</a>."},"date_created":"2018-12-11T11:44:40Z","oa":1,"title":"Inverted leftover hash lemma","publist_id":"7946","scopus_import":"1","abstract":[{"lang":"eng","text":"Universal hashing found a lot of applications in computer science. In cryptography the most important fact about universal families is the so called Leftover Hash Lemma, proved by Impagliazzo, Levin and Luby. In the language of modern cryptography it states that almost universal families are good extractors. In this work we provide a somewhat surprising characterization in the opposite direction. Namely, every extractor with sufficiently good parameters yields a universal family on a noticeable fraction of its inputs. Our proof technique is based on tools from extremal graph theory applied to the \\'collision graph\\' induced by the extractor, and may be of independent interest. We discuss possible applications to the theory of randomness extractors and non-malleable codes."}],"main_file_link":[{"url":"https://eprint.iacr.org/2017/507","open_access":"1"}],"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-13T08:23:18Z","author":[{"last_name":"Obremski","full_name":"Obremski, Marciej","first_name":"Marciej"},{"full_name":"Skorski, Maciej","last_name":"Skorski","first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD"}],"status":"public","_id":"108","alternative_title":["ISIT Proceedings"],"external_id":{"isi":["000448139300368"]},"publication_status":"published","oa_version":"Submitted Version","type":"conference","publisher":"IEEE","department":[{"_id":"KrPi"}],"month":"08","year":"2018","isi":1},{"title":"Absorption and directed Jónsson terms","page":"203-220","quality_controlled":"1","arxiv":1,"date_created":"2022-03-18T10:30:32Z","citation":{"mla":"Kazda, Alexandr, et al. “Absorption and Directed Jónsson Terms.” <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, vol. 16, Springer Nature, 2018, pp. 203–20, doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>.","chicago":"Kazda, Alexandr, Marcin Kozik, Ralph McKenzie, and Matthew Moore. “Absorption and Directed Jónsson Terms.” In <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, edited by J Czelakowski, 16:203–20. OCTR. Cham: Springer Nature, 2018. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>.","apa":"Kazda, A., Kozik, M., McKenzie, R., &#38; Moore, M. (2018). Absorption and directed Jónsson terms. In J. Czelakowski (Ed.), <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i> (Vol. 16, pp. 203–220). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">https://doi.org/10.1007/978-3-319-74772-9_7</a>","ista":"Kazda A, Kozik M, McKenzie R, Moore M. 2018.Absorption and directed Jónsson terms. In: Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science. vol. 16, 203–220.","short":"A. Kazda, M. Kozik, R. McKenzie, M. Moore, in:, J. Czelakowski (Ed.), Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science, Springer Nature, Cham, 2018, pp. 203–220.","ieee":"A. Kazda, M. Kozik, R. McKenzie, and M. Moore, “Absorption and directed Jónsson terms,” in <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>, vol. 16, J. Czelakowski, Ed. Cham: Springer Nature, 2018, pp. 203–220.","ama":"Kazda A, Kozik M, McKenzie R, Moore M. Absorption and directed Jónsson terms. In: Czelakowski J, ed. <i>Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science</i>. Vol 16. OCTR. Cham: Springer Nature; 2018:203-220. doi:<a href=\"https://doi.org/10.1007/978-3-319-74772-9_7\">10.1007/978-3-319-74772-9_7</a>"},"oa":1,"article_processing_charge":"No","doi":"10.1007/978-3-319-74772-9_7","date_published":"2018-03-21T00:00:00Z","intvolume":"        16","editor":[{"first_name":"J","last_name":"Czelakowski","full_name":"Czelakowski, J"}],"place":"Cham","volume":16,"acknowledgement":"The second author was supported by National Science Center grant DEC-2011-/01/B/ST6/01006.","day":"21","publication":"Don Pigozzi on Abstract Algebraic Logic, Universal Algebra, and Computer Science","department":[{"_id":"VlKo"}],"month":"03","year":"2018","publication_identifier":{"isbn":["9783319747712"],"issn":["2211-2758"],"eisbn":["9783319747729"],"eissn":["2211-2766"]},"_id":"10864","publication_status":"published","external_id":{"arxiv":["1502.01072"]},"type":"book_chapter","oa_version":"Preprint","publisher":"Springer Nature","author":[{"last_name":"Kazda","full_name":"Kazda, Alexandr","first_name":"Alexandr","id":"3B32BAA8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Marcin","last_name":"Kozik","full_name":"Kozik, Marcin"},{"first_name":"Ralph","last_name":"McKenzie","full_name":"McKenzie, Ralph"},{"last_name":"Moore","full_name":"Moore, Matthew","first_name":"Matthew"}],"status":"public","scopus_import":"1","abstract":[{"lang":"eng","text":"We prove that every congruence distributive variety has directed Jónsson terms, and every congruence modular variety has directed Gumm terms. The directed terms we construct witness every case of absorption witnessed by the original Jónsson or Gumm terms. This result is equivalent to a pair of claims about absorption for admissible preorders in congruence distributive and congruence modular varieties, respectively. For finite algebras, these absorption theorems have already seen significant applications, but until now, it was not clear if the theorems hold for general algebras as well. Our method also yields a novel proof of a result by P. Lipparini about the existence of a chain of terms (which we call Pixley terms) in varieties that are at the same time congruence distributive and k-permutable for some k."}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1502.01072"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"series_title":"OCTR","date_updated":"2023-09-05T15:37:18Z"},{"doi":"10.1093/bfgp/ely007","article_processing_charge":"No","pmid":1,"volume":17,"acknowledgement":"This work was supported by JSPS overseas research fellowships (Y.M.) and SENSHIN Medical Research Foundation (K.K.T.).","day":"01","publication":"Briefings in Functional Genomics","date_published":"2018-09-01T00:00:00Z","intvolume":"        17","page":"329-338","title":"Significance of whole-genome duplications on the emergence of evolutionary novelties","oa":1,"quality_controlled":"1","citation":{"short":"M. Yuuta, K. Koshiba-Takeuchi, Briefings in Functional Genomics 17 (2018) 329–338.","ista":"Yuuta M, Koshiba-Takeuchi K. 2018. Significance of whole-genome duplications on the emergence of evolutionary novelties. Briefings in Functional Genomics. 17(5), 329–338.","ieee":"M. Yuuta and K. Koshiba-Takeuchi, “Significance of whole-genome duplications on the emergence of evolutionary novelties,” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5. Oxford University Press, pp. 329–338, 2018.","ama":"Yuuta M, Koshiba-Takeuchi K. Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. 2018;17(5):329-338. doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>","chicago":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>.","apa":"Yuuta, M., &#38; Koshiba-Takeuchi, K. (2018). Significance of whole-genome duplications on the emergence of evolutionary novelties. <i>Briefings in Functional Genomics</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/bfgp/ely007\">https://doi.org/10.1093/bfgp/ely007</a>","mla":"Yuuta, Moriyama, and Kazuko Koshiba-Takeuchi. “Significance of Whole-Genome Duplications on the Emergence of Evolutionary Novelties.” <i>Briefings in Functional Genomics</i>, vol. 17, no. 5, Oxford University Press, 2018, pp. 329–38, doi:<a href=\"https://doi.org/10.1093/bfgp/ely007\">10.1093/bfgp/ely007</a>."},"date_created":"2022-03-18T12:40:35Z","author":[{"first_name":"Moriyama","id":"4968E7C8-F248-11E8-B48F-1D18A9856A87","last_name":"Yuuta","full_name":"Yuuta, Moriyama","orcid":"0000-0002-2853-8051"},{"last_name":"Koshiba-Takeuchi","full_name":"Koshiba-Takeuchi, Kazuko","first_name":"Kazuko"}],"status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-19T15:11:22Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Acquisition of evolutionary novelties is a fundamental process for adapting to the external environment and invading new niches and results in the diversification of life, which we can see in the world today. How such novel phenotypic traits are acquired in the course of evolution and are built up in developing embryos has been a central question in biology. Whole-genome duplication (WGD) is a process of genome doubling that supplies raw genetic materials and increases genome complexity. Recently, it has been gradually revealed that WGD and subsequent fate changes of duplicated genes can facilitate phenotypic evolution. Here, we review the current understanding of the relationship between WGD and the acquisition of evolutionary novelties. We show some examples of this link and discuss how WGD and subsequent duplicated genes can facilitate phenotypic evolution as well as when such genomic doubling can be advantageous for adaptation."}],"keyword":["Genetics","Molecular Biology","Biochemistry","General Medicine"],"main_file_link":[{"url":"https://doi.org/10.1093/bfgp/ely007","open_access":"1"}],"month":"09","year":"2018","isi":1,"publication_identifier":{"issn":["2041-2649"],"eissn":["2041-2657"]},"article_type":"original","department":[{"_id":"CaHe"}],"publisher":"Oxford University Press","issue":"5","_id":"10880","publication_status":"published","external_id":{"isi":["000456054400004"],"pmid":["29579140"]},"oa_version":"Published Version","type":"journal_article"},{"date_created":"2022-03-18T12:43:22Z","citation":{"chicago":"Moturu, Taraka Ramji, Sravankumar Thula, Ravi Kumar Singh, Tomasz Nodzyński, Radka Svobodová Vařeková, Jiří Friml, and Sibu Simon. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>.","apa":"Moturu, T. R., Thula, S., Singh, R. K., Nodzyński, T., Vařeková, R. S., Friml, J., &#38; Simon, S. (2018). Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/jxb/ery097\">https://doi.org/10.1093/jxb/ery097</a>","mla":"Moturu, Taraka Ramji, et al. “Molecular Evolution and Diversification of the SMXL Gene Family.” <i>Journal of Experimental Botany</i>, vol. 69, no. 9, Oxford University Press, 2018, pp. 2367–78, doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>.","ista":"Moturu TR, Thula S, Singh RK, Nodzyński T, Vařeková RS, Friml J, Simon S. 2018. Molecular evolution and diversification of the SMXL gene family. Journal of Experimental Botany. 69(9), 2367–2378.","short":"T.R. Moturu, S. Thula, R.K. Singh, T. Nodzyński, R.S. Vařeková, J. Friml, S. Simon, Journal of Experimental Botany 69 (2018) 2367–2378.","ieee":"T. R. Moturu <i>et al.</i>, “Molecular evolution and diversification of the SMXL gene family,” <i>Journal of Experimental Botany</i>, vol. 69, no. 9. Oxford University Press, pp. 2367–2378, 2018.","ama":"Moturu TR, Thula S, Singh RK, et al. Molecular evolution and diversification of the SMXL gene family. <i>Journal of Experimental Botany</i>. 2018;69(9):2367-2378. doi:<a href=\"https://doi.org/10.1093/jxb/ery097\">10.1093/jxb/ery097</a>"},"quality_controlled":"1","page":"2367-2378","title":"Molecular evolution and diversification of the SMXL gene family","acknowledgement":"This project received funding from the European Union’s Horizon 2020 research and innovation programme under the Marie Skłodowska-Curie Actions and it is co-financed by the South Moravian Region under grant agreement No. 665860 (SS). Access to computing and storage facilities owned by parties and projects contributing to the national grid infrastructure, MetaCentrum, provided under the program ‘Projects of Large Infrastructure for Research, Development, and Innovations’ (LM2010005) was greatly appreciated (RSV). The project was funded by The Ministry of Education, Youth and Sports/MES of the Czech Republic under the project CEITEC 2020 (LQ1601) (TN, TRM). JF was supported by the European Research Council (project ERC-2011-StG 20101109-PSDP) and the Czech Science Foundation GAČR (GA13-40637S). We thank Dr Kamel Chibani for active discussions on the evolutionary analysis and Nandan Mysore Vardarajan for his critical comments on the manuscript. This article reflects\r\nonly the authors’ views, and the EU is not responsible for any use that may be made of the information it contains. ","publication":"Journal of Experimental Botany","day":"13","volume":69,"pmid":1,"intvolume":"        69","date_published":"2018-04-13T00:00:00Z","doi":"10.1093/jxb/ery097","article_processing_charge":"No","ec_funded":1,"publisher":"Oxford University Press","type":"journal_article","oa_version":"None","external_id":{"pmid":["29538714"],"isi":["000430727000016"]},"publication_status":"published","issue":"9","_id":"10881","publication_identifier":{"issn":["0022-0957"],"eissn":["1460-2431"]},"isi":1,"project":[{"_id":"25716A02-B435-11E9-9278-68D0E5697425","name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300"}],"month":"04","year":"2018","department":[{"_id":"JiFr"}],"article_type":"original","date_updated":"2025-05-07T11:12:33Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","keyword":["Plant Science","Physiology"],"abstract":[{"text":"Strigolactones (SLs) are a relatively recent addition to the list of plant hormones that control different aspects of plant development. SL signalling is perceived by an α/β hydrolase, DWARF 14 (D14). A close homolog of D14, KARRIKIN INSENSTIVE2 (KAI2), is involved in perception of an uncharacterized molecule called karrikin (KAR). Recent studies in Arabidopsis identified the SUPPRESSOR OF MAX2 1 (SMAX1) and SMAX1-LIKE 7 (SMXL7) to be potential SCF–MAX2 complex-mediated proteasome targets of KAI2 and D14, respectively. Genetic studies on SMXL7 and SMAX1 demonstrated distinct developmental roles for each, but very little is known about these repressors in terms of their sequence features. In this study, we performed an extensive comparative analysis of SMXLs and determined their phylogenetic and evolutionary history in the plant lineage. Our results show that SMXL family members can be sub-divided into four distinct phylogenetic clades/classes, with an ancient SMAX1. Further, we identified the clade-specific motifs that have evolved and that might act as determinants of SL-KAR signalling specificity. These specificities resulted from functional diversities among the clades. Our results suggest that a gradual co-evolution of SMXL members with their upstream receptors D14/KAI2 provided an increased specificity to both the SL perception and response in land plants.","lang":"eng"}],"scopus_import":"1","status":"public","author":[{"full_name":"Moturu, Taraka Ramji","last_name":"Moturu","first_name":"Taraka Ramji"},{"last_name":"Thula","full_name":"Thula, Sravankumar","first_name":"Sravankumar"},{"first_name":"Ravi Kumar","last_name":"Singh","full_name":"Singh, Ravi Kumar"},{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"last_name":"Vařeková","full_name":"Vařeková, Radka Svobodová","first_name":"Radka Svobodová"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří"},{"full_name":"Simon, Sibu","last_name":"Simon","first_name":"Sibu"}]},{"publication":"2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition","day":"17","date_published":"2018-12-17T00:00:00Z","doi":"10.1109/cvpr.2018.00956","article_processing_charge":"No","oa":1,"citation":{"apa":"Uijlings, J., Konyushkova, K., Lampert, C., &#38; Ferrari, V. (2018). Learning intelligent dialogs for bounding box annotation. In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i> (pp. 9175–9184). Salt Lake City, UT, United States: IEEE. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>","chicago":"Uijlings, Jasper, Ksenia Konyushkova, Christoph Lampert, and Vittorio Ferrari. “Learning Intelligent Dialogs for Bounding Box Annotation.” In <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, 9175–84. IEEE, 2018. <a href=\"https://doi.org/10.1109/cvpr.2018.00956\">https://doi.org/10.1109/cvpr.2018.00956</a>.","mla":"Uijlings, Jasper, et al. “Learning Intelligent Dialogs for Bounding Box Annotation.” <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, IEEE, 2018, pp. 9175–84, doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>.","ama":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. Learning intelligent dialogs for bounding box annotation. In: <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>. IEEE; 2018:9175-9184. doi:<a href=\"https://doi.org/10.1109/cvpr.2018.00956\">10.1109/cvpr.2018.00956</a>","ieee":"J. Uijlings, K. Konyushkova, C. Lampert, and V. Ferrari, “Learning intelligent dialogs for bounding box annotation,” in <i>2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition</i>, Salt Lake City, UT, United States, 2018, pp. 9175–9184.","ista":"Uijlings J, Konyushkova K, Lampert C, Ferrari V. 2018. Learning intelligent dialogs for bounding box annotation. 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition. CVF: Conference on Computer Vision and Pattern Recognition, 9175–9184.","short":"J. Uijlings, K. Konyushkova, C. Lampert, V. Ferrari, in:, 2018 IEEE/CVF Conference on Computer Vision and Pattern Recognition, IEEE, 2018, pp. 9175–9184."},"date_created":"2022-03-18T12:45:09Z","conference":{"location":"Salt Lake City, UT, United States","end_date":"2018-06-23","start_date":"2018-06-18","name":"CVF: Conference on Computer Vision and Pattern Recognition"},"quality_controlled":"1","arxiv":1,"page":"9175-9184","title":"Learning intelligent dialogs for bounding box annotation","date_updated":"2023-09-19T15:11:49Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"We introduce Intelligent Annotation Dialogs for bounding box annotation. We train an agent to automatically choose a sequence of actions for a human annotator to produce a bounding box in a minimal amount of time. Specifically, we consider two actions: box verification [34], where the annotator verifies a box generated by an object detector, and manual box drawing. We explore two kinds of agents, one based on predicting the probability that a box will be positively verified, and the other based on reinforcement learning. We demonstrate that (1) our agents are able to learn efficient annotation strategies in several scenarios, automatically adapting to the image difficulty, the desired quality of the boxes, and the detector strength; (2) in all scenarios the resulting annotation dialogs speed up annotation compared to manual box drawing alone and box verification alone, while also outperforming any fixed combination of verification and drawing in most scenarios; (3) in a realistic scenario where the detector is iteratively re-trained, our agents evolve a series of strategies that reflect the shifting trade-off between verification and drawing as the detector grows stronger."}],"main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1712.08087","open_access":"1"}],"scopus_import":"1","author":[{"first_name":"Jasper","full_name":"Uijlings, Jasper","last_name":"Uijlings"},{"first_name":"Ksenia","last_name":"Konyushkova","full_name":"Konyushkova, Ksenia"},{"orcid":"0000-0001-8622-7887","last_name":"Lampert","full_name":"Lampert, Christoph","first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vittorio","full_name":"Ferrari, Vittorio","last_name":"Ferrari"}],"status":"public","publisher":"IEEE","type":"conference","oa_version":"Preprint","_id":"10882","external_id":{"arxiv":["1712.08087"],"isi":["000457843609036"]},"publication_status":"published","isi":1,"publication_identifier":{"isbn":["9781538664209"],"eissn":["2575-7075"]},"year":"2018","month":"12","department":[{"_id":"ChLa"}]},{"page":"233-253","title":"Quasipolynomial set-based symbolic algorithms for parity games","oa":1,"arxiv":1,"quality_controlled":"1","conference":{"start_date":"2018-11-17","name":"LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning","end_date":"2018-11-21","location":"Awassa, Ethiopia"},"citation":{"apa":"Chatterjee, K., Dvořák, W., Henzinger, M. H., &#38; Svozil, A. (2018). Quasipolynomial set-based symbolic algorithms for parity games. In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i> (Vol. 57, pp. 233–253). Awassa, Ethiopia: EasyChair. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>","chicago":"Chatterjee, Krishnendu, Wolfgang Dvořák, Monika H Henzinger, and Alexander Svozil. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” In <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, 57:233–53. EasyChair, 2018. <a href=\"https://doi.org/10.29007/5z5k\">https://doi.org/10.29007/5z5k</a>.","mla":"Chatterjee, Krishnendu, et al. “Quasipolynomial Set-Based Symbolic Algorithms for Parity Games.” <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, vol. 57, EasyChair, 2018, pp. 233–53, doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>.","ama":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. Quasipolynomial set-based symbolic algorithms for parity games. In: <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>. Vol 57. EasyChair; 2018:233-253. doi:<a href=\"https://doi.org/10.29007/5z5k\">10.29007/5z5k</a>","ista":"Chatterjee K, Dvořák W, Henzinger MH, Svozil A. 2018. Quasipolynomial set-based symbolic algorithms for parity games. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning. LPAR: Conference on Logic for Programming, Artificial Intelligence and Reasoning, EPiC Series in Computing, vol. 57, 233–253.","short":"K. Chatterjee, W. Dvořák, M.H. Henzinger, A. Svozil, in:, 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning, EasyChair, 2018, pp. 233–253.","ieee":"K. Chatterjee, W. Dvořák, M. H. Henzinger, and A. Svozil, “Quasipolynomial set-based symbolic algorithms for parity games,” in <i>22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning</i>, Awassa, Ethiopia, 2018, vol. 57, pp. 233–253."},"date_created":"2022-03-18T12:46:32Z","file_date_updated":"2022-05-17T07:51:08Z","doi":"10.29007/5z5k","article_processing_charge":"No","ec_funded":1,"publication":"22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning","acknowledgement":"A. S. is fully supported by the Vienna Science and Technology Fund (WWTF) through project ICT15-003. K.C. is supported by the Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE) and an ERC Starting grant (279307: Graph Games). For M.H the research leading to these results has received funding from the European Research Council under the European Union’s Seventh Framework Programme (FP/2007-2013) /ERC Grant Agreement no. 340506.","day":"23","volume":57,"date_published":"2018-10-23T00:00:00Z","has_accepted_license":"1","intvolume":"        57","project":[{"name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"grant_number":"279307","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"year":"2018","month":"10","publication_identifier":{"issn":["2398-7340"]},"department":[{"_id":"KrCh"}],"publisher":"EasyChair","publication_status":"published","external_id":{"arxiv":["1909.04983"]},"alternative_title":["EPiC Series in Computing"],"_id":"10883","type":"conference","oa_version":"Published Version","ddc":["000"],"file":[{"creator":"dernst","file_id":"11392","relation":"main_file","file_name":"2018_EPiCs_Chatterjee.pdf","checksum":"1229aa8640bd6db610c85decf2265480","file_size":720893,"success":1,"date_created":"2022-05-17T07:51:08Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2022-05-17T07:51:08Z"}],"status":"public","author":[{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu"},{"first_name":"Wolfgang","full_name":"Dvořák, Wolfgang","last_name":"Dvořák"},{"first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"last_name":"Svozil","full_name":"Svozil, Alexander","first_name":"Alexander"}],"language":[{"iso":"eng"}],"user_id":"72615eeb-f1f3-11ec-aa25-d4573ddc34fd","date_updated":"2022-07-29T09:24:31Z","scopus_import":"1","abstract":[{"lang":"eng","text":"Solving parity games, which are equivalent to modal μ-calculus model checking, is a central algorithmic problem in formal methods, with applications in reactive synthesis, program repair, verification of branching-time properties, etc. Besides the standard compu- tation model with the explicit representation of games, another important theoretical model of computation is that of set-based symbolic algorithms. Set-based symbolic algorithms use basic set operations and one-step predecessor operations on the implicit description of games, rather than the explicit representation. The significance of symbolic algorithms is that they provide scalable algorithms for large finite-state systems, as well as for infinite-state systems with finite quotient. Consider parity games on graphs with n vertices and parity conditions with d priorities. While there is a rich literature of explicit algorithms for parity games, the main results for set-based symbolic algorithms are as follows: (a) the basic algorithm that requires O(nd) symbolic operations and O(d) symbolic space; and (b) an improved algorithm that requires O(nd/3+1) symbolic operations and O(n) symbolic space. In this work, our contributions are as follows: (1) We present a black-box set-based symbolic algorithm based on the explicit progress measure algorithm. Two important consequences of our algorithm are as follows: (a) a set-based symbolic algorithm for parity games that requires quasi-polynomially many symbolic operations and O(n) symbolic space; and (b) any future improvement in progress measure based explicit algorithms immediately imply an efficiency improvement in our set-based symbolic algorithm for parity games. (2) We present a set-based symbolic algorithm that requires quasi-polynomially many symbolic operations and O(d · log n) symbolic space. Moreover, for the important special case of d ≤ log n, our algorithm requires only polynomially many symbolic operations and poly-logarithmic symbolic space."}]},{"status":"public","author":[{"first_name":"Nikolai K","id":"4BC40BEC-F248-11E8-B48F-1D18A9856A87","full_name":"Leopold, Nikolai K","last_name":"Leopold","orcid":"0000-0002-0495-6822"},{"last_name":"Pickl","full_name":"Pickl, Peter","first_name":"Peter"}],"main_file_link":[{"url":"https://arxiv.org/abs/1806.10843","open_access":"1"}],"abstract":[{"text":"We report on a novel strategy to derive mean-field limits of quantum mechanical systems in which a large number of particles weakly couple to a second-quantized radiation field. The technique combines the method of counting and the coherent state approach to study the growth of the correlations among the particles and in the radiation field. As an instructional example, we derive the Schrödinger–Klein–Gordon system of equations from the Nelson model with ultraviolet cutoff and possibly massless scalar field. In particular, we prove the convergence of the reduced density matrices (of the nonrelativistic particles and the field bosons) associated with the exact time evolution to the projectors onto the solutions of the Schrödinger–Klein–Gordon equations in trace norm. Furthermore, we derive explicit bounds on the rate of convergence of the one-particle reduced density matrix of the nonrelativistic particles in Sobolev norm.","lang":"eng"}],"scopus_import":1,"date_updated":"2021-01-12T06:48:16Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"project":[{"_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems","grant_number":"694227"}],"year":"2018","month":"10","oa_version":"Preprint","type":"conference","publication_status":"published","external_id":{"arxiv":["1806.10843"]},"_id":"11","publisher":"Springer","ec_funded":1,"doi":"10.1007/978-3-030-01602-9_9","intvolume":"       270","date_published":"2018-10-27T00:00:00Z","day":"27","volume":270,"title":"Mean-field limits of particles in interaction with quantised radiation fields","page":"185 - 214","publist_id":"8045","citation":{"ama":"Leopold NK, Pickl P. Mean-field limits of particles in interaction with quantised radiation fields. In: Vol 270. Springer; 2018:185-214. doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>","ista":"Leopold NK, Pickl P. 2018. Mean-field limits of particles in interaction with quantised radiation fields. MaLiQS: Macroscopic Limits of Quantum Systems vol. 270, 185–214.","short":"N.K. Leopold, P. Pickl, in:, Springer, 2018, pp. 185–214.","ieee":"N. K. Leopold and P. Pickl, “Mean-field limits of particles in interaction with quantised radiation fields,” presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany, 2018, vol. 270, pp. 185–214.","apa":"Leopold, N. K., &#38; Pickl, P. (2018). Mean-field limits of particles in interaction with quantised radiation fields (Vol. 270, pp. 185–214). Presented at the MaLiQS: Macroscopic Limits of Quantum Systems, Munich, Germany: Springer. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>","chicago":"Leopold, Nikolai K, and Peter Pickl. “Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields,” 270:185–214. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">https://doi.org/10.1007/978-3-030-01602-9_9</a>.","mla":"Leopold, Nikolai K., and Peter Pickl. <i>Mean-Field Limits of Particles in Interaction with Quantised Radiation Fields</i>. Vol. 270, Springer, 2018, pp. 185–214, doi:<a href=\"https://doi.org/10.1007/978-3-030-01602-9_9\">10.1007/978-3-030-01602-9_9</a>."},"date_created":"2018-12-11T11:44:08Z","quality_controlled":"1","arxiv":1,"conference":{"location":"Munich, Germany","end_date":"2017-04-01","name":"MaLiQS: Macroscopic Limits of Quantum Systems","start_date":"2017-03-30"},"oa":1},{"day":"26","volume":11022,"intvolume":"     11022","has_accepted_license":"1","date_published":"2018-08-26T00:00:00Z","doi":"10.1007/978-3-030-00151-3_13","file_date_updated":"2020-07-14T12:48:03Z","article_processing_charge":"No","oa":1,"date_created":"2018-12-11T11:44:31Z","citation":{"ama":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. Online timed pattern matching using automata. In: Vol 11022. Springer; 2018:215-232. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>","short":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, E. Asarin, in:, Springer, 2018, pp. 215–232.","ista":"Bakhirkin A, Ferrere T, Nickovic D, Maler O, Asarin E. 2018. Online timed pattern matching using automata. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 215–232.","ieee":"A. Bakhirkin, T. Ferrere, D. Nickovic, O. Maler, and E. Asarin, “Online timed pattern matching using automata,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China, 2018, vol. 11022, pp. 215–232.","mla":"Bakhirkin, Alexey, et al. <i>Online Timed Pattern Matching Using Automata</i>. Vol. 11022, Springer, 2018, pp. 215–32, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">10.1007/978-3-030-00151-3_13</a>.","apa":"Bakhirkin, A., Ferrere, T., Nickovic, D., Maler, O., &#38; Asarin, E. (2018). Online timed pattern matching using automata (Vol. 11022, pp. 215–232). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Bejing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>","chicago":"Bakhirkin, Alexey, Thomas Ferrere, Dejan Nickovic, Oded Maler, and Eugene Asarin. “Online Timed Pattern Matching Using Automata,” 11022:215–32. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_13\">https://doi.org/10.1007/978-3-030-00151-3_13</a>."},"quality_controlled":"1","conference":{"end_date":"2018-09-06","location":"Bejing, China","start_date":"2018-09-04","name":"FORMATS: Formal Modeling and Analysis of Timed Systems"},"publist_id":"7976","page":"215 - 232","title":"Online timed pattern matching using automata","date_updated":"2023-09-13T09:35:46Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"We provide a procedure for detecting the sub-segments of an incrementally observed Boolean signal ω that match a given temporal pattern ϕ. As a pattern specification language, we use timed regular expressions, a formalism well-suited for expressing properties of concurrent asynchronous behaviors embedded in metric time. We construct a timed automaton accepting the timed language denoted by ϕ and modify it slightly for the purpose of matching. We then apply zone-based reachability computation to this automaton while it reads ω, and retrieve all the matching segments from the results. Since the procedure is automaton based, it can be applied to patterns specified by other formalisms such as timed temporal logics reducible to timed automata or directly encoded as timed automata. The procedure has been implemented and its performance on synthetic examples is demonstrated.","lang":"eng"}],"scopus_import":"1","status":"public","author":[{"last_name":"Bakhirkin","full_name":"Bakhirkin, Alexey","first_name":"Alexey"},{"first_name":"Thomas","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5199-3143","last_name":"Ferrere","full_name":"Ferrere, Thomas"},{"last_name":"Nickovic","full_name":"Nickovic, Dejan","first_name":"Dejan"},{"last_name":"Maler","full_name":"Maler, Oded","first_name":"Oded"},{"first_name":"Eugene","full_name":"Asarin, Eugene","last_name":"Asarin"}],"publisher":"Springer","file":[{"relation":"main_file","file_id":"7831","creator":"dernst","file_name":"2018_LNCS_Bakhirkin.pdf","date_created":"2020-05-14T11:34:34Z","file_size":374851,"checksum":"436b7574934324cfa7d1d3986fddc65b","date_updated":"2020-07-14T12:48:03Z","access_level":"open_access","content_type":"application/pdf"}],"oa_version":"Submitted Version","ddc":["000"],"type":"conference","alternative_title":["LNCS"],"external_id":{"isi":["000884993200013"]},"publication_status":"published","_id":"78","publication_identifier":{"isbn":["978-3-030-00150-6"]},"isi":1,"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"The Wittgenstein Prize","call_identifier":"FWF","grant_number":"Z211"}],"year":"2018","month":"08","department":[{"_id":"ToHe"}]},{"title":"Model compression via distillation and quantization","department":[{"_id":"DaAl"}],"year":"2018","month":"05","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2018-04-30","location":"Vancouver, Canada","end_date":"2018-05-03"},"_id":"7812","arxiv":1,"publication_status":"published","quality_controlled":"1","external_id":{"arxiv":["1802.05668"]},"date_created":"2020-05-10T22:00:51Z","citation":{"short":"A. Polino, R. Pascanu, D.-A. Alistarh, in:, 6th International Conference on Learning Representations, 2018.","ieee":"A. Polino, R. Pascanu, and D.-A. Alistarh, “Model compression via distillation and quantization,” in <i>6th International Conference on Learning Representations</i>, Vancouver, Canada, 2018.","ista":"Polino A, Pascanu R, Alistarh D-A. 2018. Model compression via distillation and quantization. 6th International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","ama":"Polino A, Pascanu R, Alistarh D-A. Model compression via distillation and quantization. In: <i>6th International Conference on Learning Representations</i>. ; 2018.","chicago":"Polino, Antonio, Razvan Pascanu, and Dan-Adrian Alistarh. “Model Compression via Distillation and Quantization.” In <i>6th International Conference on Learning Representations</i>, 2018.","apa":"Polino, A., Pascanu, R., &#38; Alistarh, D.-A. (2018). Model compression via distillation and quantization. In <i>6th International Conference on Learning Representations</i>. Vancouver, Canada.","mla":"Polino, Antonio, et al. “Model Compression via Distillation and Quantization.” <i>6th International Conference on Learning Representations</i>, 2018."},"file":[{"date_created":"2020-05-26T13:02:00Z","file_size":308339,"checksum":"a4336c167978e81891970e4e4517a8c3","date_updated":"2020-07-14T12:48:03Z","content_type":"application/pdf","access_level":"open_access","relation":"main_file","creator":"dernst","file_id":"7894","file_name":"2018_ICLR_Polino.pdf"}],"ddc":["000"],"type":"conference","oa_version":"Published Version","oa":1,"author":[{"first_name":"Antonio","full_name":"Polino, Antonio","last_name":"Polino"},{"last_name":"Pascanu","full_name":"Pascanu, Razvan","first_name":"Razvan"},{"first_name":"Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","full_name":"Alistarh, Dan-Adrian","last_name":"Alistarh"}],"article_processing_charge":"No","status":"public","file_date_updated":"2020-07-14T12:48:03Z","scopus_import":1,"date_published":"2018-05-01T00:00:00Z","abstract":[{"lang":"eng","text":"Deep neural networks (DNNs) continue to make significant advances, solving tasks from image classification to translation or reinforcement learning. One aspect of the field receiving considerable attention is efficiently executing deep models in resource-constrained environments, such as mobile or embedded devices. This paper focuses on this problem, and proposes two new compression methods, which jointly leverage weight quantization and distillation of larger teacher networks into smaller student networks. The first method we propose is called quantized distillation and leverages distillation during the training process, by incorporating distillation loss, expressed with respect to the teacher, into the training of a student network whose weights are quantized to a limited set of levels. The second method,  differentiable quantization, optimizes the location of quantization points through stochastic gradient descent, to better fit the behavior of the teacher model.  We validate both methods through experiments on convolutional and recurrent architectures. We show that quantized shallow students can reach similar accuracy levels to full-precision teacher models, while providing order of magnitude compression, and inference speedup that is linear in the depth reduction. In sum, our results enable DNNs for resource-constrained environments to leverage architecture and accuracy advances developed on more powerful devices."}],"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2023-02-23T13:18:41Z","publication":"6th International Conference on Learning Representations","day":"01"},{"status":"public","author":[{"last_name":"Arming","full_name":"Arming, Sebastian","first_name":"Sebastian"},{"full_name":"Bartocci, Ezio","last_name":"Bartocci","first_name":"Ezio"},{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee"},{"full_name":"Katoen, Joost P","last_name":"Katoen","first_name":"Joost P","id":"4524F760-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Ana","full_name":"Sokolova, Ana","last_name":"Sokolova"}],"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05126"}],"abstract":[{"text":"Markov Decision Processes (MDPs) are a popular class of models suitable for solving control decision problems in probabilistic reactive systems. We consider parametric MDPs (pMDPs) that include parameters in some of the transition probabilities to account for stochastic uncertainties of the environment such as noise or input disturbances. We study pMDPs with reachability objectives where the parameter values are unknown and impossible to measure directly during execution, but there is a probability distribution known over the parameter values. We study for the first time computing parameter-independent strategies that are expectation optimal, i.e., optimize the expected reachability probability under the probability distribution over the parameters. We present an encoding of our problem to partially observable MDPs (POMDPs), i.e., a reduction of our problem to computing optimal strategies in POMDPs. We evaluate our method experimentally on several benchmarks: a motivating (repeated) learner model; a series of benchmarks of varying configurations of a robot moving on a grid; and a consensus protocol.","lang":"eng"}],"scopus_import":"1","date_updated":"2023-09-13T09:38:28Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"isi":1,"month":"08","year":"2018","type":"conference","oa_version":"Preprint","alternative_title":["LNCS"],"external_id":{"arxiv":["1806.05126"],"isi":["000548912200004"]},"publication_status":"published","_id":"79","publisher":"Springer","article_processing_charge":"No","doi":"10.1007/978-3-319-99154-2_4","intvolume":"     11024","date_published":"2018-08-15T00:00:00Z","day":"15","volume":11024,"title":"Parameter-independent strategies for pMDPs via POMDPs","publist_id":"7975","page":"53-70","citation":{"ama":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. Parameter-independent strategies for pMDPs via POMDPs. In: Vol 11024. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>","short":"S. Arming, E. Bartocci, K. Chatterjee, J.P. Katoen, A. Sokolova, in:, Springer, 2018, pp. 53–70.","ista":"Arming S, Bartocci E, Chatterjee K, Katoen JP, Sokolova A. 2018. Parameter-independent strategies for pMDPs via POMDPs. QEST: Quantitative Evaluation of Systems, LNCS, vol. 11024, 53–70.","ieee":"S. Arming, E. Bartocci, K. Chatterjee, J. P. Katoen, and A. Sokolova, “Parameter-independent strategies for pMDPs via POMDPs,” presented at the QEST: Quantitative Evaluation of Systems, Beijing, China, 2018, vol. 11024, pp. 53–70.","mla":"Arming, Sebastian, et al. <i>Parameter-Independent Strategies for PMDPs via POMDPs</i>. Vol. 11024, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">10.1007/978-3-319-99154-2_4</a>.","apa":"Arming, S., Bartocci, E., Chatterjee, K., Katoen, J. P., &#38; Sokolova, A. (2018). Parameter-independent strategies for pMDPs via POMDPs (Vol. 11024, pp. 53–70). Presented at the QEST: Quantitative Evaluation of Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>","chicago":"Arming, Sebastian, Ezio Bartocci, Krishnendu Chatterjee, Joost P Katoen, and Ana Sokolova. “Parameter-Independent Strategies for PMDPs via POMDPs,” 11024:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-99154-2_4\">https://doi.org/10.1007/978-3-319-99154-2_4</a>."},"date_created":"2018-12-11T11:44:31Z","quality_controlled":"1","arxiv":1,"conference":{"location":"Beijing, China","end_date":"2018-09-07","name":"QEST: Quantitative Evaluation of Systems","start_date":"2018-09-04"},"oa":1},{"isi":1,"publication_identifier":{"issn":["1545-4487"]},"year":"2018","month":"01","department":[{"_id":"SyCr"}],"publisher":"Annual Reviews","type":"journal_article","oa_version":"None","_id":"806","publication_status":"published","external_id":{"isi":["000424633700008"]},"author":[{"first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia","last_name":"Cremer"},{"last_name":"Pull","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982","first_name":"Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Matthias","id":"393B1196-F248-11E8-B48F-1D18A9856A87","full_name":"Fürst, Matthias","last_name":"Fürst","orcid":"0000-0002-3712-925X"}],"status":"public","date_updated":"2023-09-19T09:29:45Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"text":"Social insect colonies have evolved many collectively performed adaptations that reduce the impact of infectious disease and that are expected to maximize their fitness. This colony-level protection is termed social immunity, and it enhances the health and survival of the colony. In this review, we address how social immunity emerges from its mechanistic components to produce colony-level disease avoidance, resistance, and tolerance. To understand the evolutionary causes and consequences of social immunity, we highlight the need for studies that evaluate the effects of social immunity on colony fitness. We discuss the role that host life history and ecology have on predicted eco-evolutionary dynamics, which differ among the social insect lineages. Throughout the review, we highlight current gaps in our knowledge and promising avenues for future research, which we hope will bring us closer to an integrated understanding of socio-eco-evo-immunology.","lang":"eng"}],"related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"819"}]},"scopus_import":"1","publist_id":"6844","page":"105 - 123","title":"Social immunity: Emergence and evolution of colony-level disease protection","date_created":"2018-12-11T11:48:36Z","citation":{"chicago":"Cremer, Sylvia, Christopher Pull, and Matthias Fürst. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>. Annual Reviews, 2018. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>.","apa":"Cremer, S., Pull, C., &#38; Fürst, M. (2018). Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. Annual Reviews. <a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">https://doi.org/10.1146/annurev-ento-020117-043110</a>","mla":"Cremer, Sylvia, et al. “Social Immunity: Emergence and Evolution of Colony-Level Disease Protection.” <i>Annual Review of Entomology</i>, vol. 63, Annual Reviews, 2018, pp. 105–23, doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>.","short":"S. Cremer, C. Pull, M. Fürst, Annual Review of Entomology 63 (2018) 105–123.","ista":"Cremer S, Pull C, Fürst M. 2018. Social immunity: Emergence and evolution of colony-level disease protection. Annual Review of Entomology. 63, 105–123.","ieee":"S. Cremer, C. Pull, and M. Fürst, “Social immunity: Emergence and evolution of colony-level disease protection,” <i>Annual Review of Entomology</i>, vol. 63. Annual Reviews, pp. 105–123, 2018.","ama":"Cremer S, Pull C, Fürst M. Social immunity: Emergence and evolution of colony-level disease protection. <i>Annual Review of Entomology</i>. 2018;63:105-123. doi:<a href=\"https://doi.org/10.1146/annurev-ento-020117-043110\">10.1146/annurev-ento-020117-043110</a>"},"quality_controlled":"1","doi":"10.1146/annurev-ento-020117-043110","article_processing_charge":"No","volume":63,"day":"07","publication":"Annual Review of Entomology","intvolume":"        63","date_published":"2018-01-07T00:00:00Z"},{"language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2023-09-13T08:58:34Z","scopus_import":"1","abstract":[{"text":"We solve the offline monitoring problem for timed propositional temporal logic (TPTL), interpreted over dense-time Boolean signals. The variant of TPTL we consider extends linear temporal logic (LTL) with clock variables and reset quantifiers, providing a mechanism to specify real-time constraints. We first describe a general monitoring algorithm based on an exhaustive computation of the set of satisfying clock assignments as a finite union of zones. We then propose a specialized monitoring algorithm for the one-variable case using a partition of the time domain based on the notion of region equivalence, whose complexity is linear in the length of the signal, thereby generalizing a known result regarding the monitoring of metric temporal logic (MTL). The region and zone representations of time constraints are known from timed automata verification and can also be used in the discrete-time case. Our prototype implementation appears to outperform previous discrete-time implementations of TPTL monitoring,","lang":"eng"}],"author":[{"full_name":"Elgyütt, Adrian","last_name":"Elgyütt","id":"4A2E9DBA-F248-11E8-B48F-1D18A9856A87","first_name":"Adrian"},{"full_name":"Ferrere, Thomas","last_name":"Ferrere","orcid":"0000-0001-5199-3143","id":"40960E6E-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas"},{"orcid":"0000−0002−2985−7724","last_name":"Henzinger","full_name":"Henzinger, Thomas A","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"status":"public","publisher":"Springer","_id":"81","alternative_title":["LNCS"],"publication_status":"published","external_id":{"isi":["000884993200004"]},"ddc":["000"],"type":"conference","file":[{"relation":"main_file","creator":"dernst","file_id":"8638","file_name":"2018_LNCS_Elgyuett.pdf","date_created":"2020-10-09T06:24:21Z","file_size":537219,"checksum":"e5d81c9b50a6bd9d8a2c16953aad7e23","success":1,"date_updated":"2020-10-09T06:24:21Z","content_type":"application/pdf","access_level":"open_access"}],"oa_version":"Submitted Version","year":"2018","month":"08","project":[{"grant_number":"S11402-N23","_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"name":"The Wittgenstein Prize","call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211"}],"isi":1,"department":[{"_id":"ToHe"}],"volume":11022,"day":"26","date_published":"2018-08-26T00:00:00Z","intvolume":"     11022","has_accepted_license":"1","file_date_updated":"2020-10-09T06:24:21Z","doi":"10.1007/978-3-030-00151-3_4","article_processing_charge":"No","oa":1,"conference":{"location":"Beijing, China","end_date":"2018-09-06","name":"FORMATS: Formal Modeling and Analysis of Timed Systems","start_date":"2018-09-04"},"quality_controlled":"1","date_created":"2018-12-11T11:44:31Z","citation":{"mla":"Elgyütt, Adrian, et al. <i>Monitoring Temporal Logic with Clock Variables</i>. Vol. 11022, Springer, 2018, pp. 53–70, doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>.","chicago":"Elgyütt, Adrian, Thomas Ferrere, and Thomas A Henzinger. “Monitoring Temporal Logic with Clock Variables,” 11022:53–70. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>.","apa":"Elgyütt, A., Ferrere, T., &#38; Henzinger, T. A. (2018). Monitoring temporal logic with clock variables (Vol. 11022, pp. 53–70). Presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China: Springer. <a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">https://doi.org/10.1007/978-3-030-00151-3_4</a>","ieee":"A. Elgyütt, T. Ferrere, and T. A. Henzinger, “Monitoring temporal logic with clock variables,” presented at the FORMATS: Formal Modeling and Analysis of Timed Systems, Beijing, China, 2018, vol. 11022, pp. 53–70.","ista":"Elgyütt A, Ferrere T, Henzinger TA. 2018. Monitoring temporal logic with clock variables. FORMATS: Formal Modeling and Analysis of Timed Systems, LNCS, vol. 11022, 53–70.","short":"A. Elgyütt, T. Ferrere, T.A. Henzinger, in:, Springer, 2018, pp. 53–70.","ama":"Elgyütt A, Ferrere T, Henzinger TA. Monitoring temporal logic with clock variables. In: Vol 11022. Springer; 2018:53-70. doi:<a href=\"https://doi.org/10.1007/978-3-030-00151-3_4\">10.1007/978-3-030-00151-3_4</a>"},"publist_id":"7973","page":"53 - 70","title":"Monitoring temporal logic with clock variables"},{"date_updated":"2023-09-13T08:45:41Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","abstract":[{"lang":"eng","text":"In experimental cultures, when bacteria are mixed with lytic (virulent) bacteriophage, bacterial cells resistant to the phage commonly emerge and become the dominant population of bacteria. Following the ascent of resistant mutants, the densities of bacteria in these simple communities become limited by resources rather than the phage. Despite the evolution of resistant hosts, upon which the phage cannot replicate, the lytic phage population is most commonly maintained in an apparently stable state with the resistant bacteria. Several mechanisms have been put forward to account for this result. Here we report the results of population dynamic/evolution experiments with a virulent mutant of phage Lambda, λVIR, and Escherichia coli in serial transfer cultures. We show that, following the ascent of λVIR-resistant bacteria, λVIRis maintained in the majority of cases in maltose-limited minimal media and in all cases in nutrient-rich broth. Using mathematical models and experiments, we show that the dominant mechanism responsible for maintenance of λVIRin these resource-limited populations dominated by resistant E. coli is a high rate of either phenotypic or genetic transition from resistance to susceptibility—a hitherto undemonstrated mechanism we term &quot;leaky resistance.&quot; We discuss the implications of leaky resistance to our understanding of the conditions for the maintenance of phage in populations of bacteria—their “existence conditions.”."}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9810"}]},"scopus_import":"1","author":[{"full_name":"Chaudhry, Waqas","last_name":"Chaudhry","first_name":"Waqas"},{"id":"4569785E-F248-11E8-B48F-1D18A9856A87","first_name":"Maros","full_name":"Pleska, Maros","last_name":"Pleska","orcid":"0000-0001-7460-7479"},{"first_name":"Nilang","full_name":"Shah, Nilang","last_name":"Shah"},{"full_name":"Weiss, Howard","last_name":"Weiss","first_name":"Howard"},{"first_name":"Ingrid","full_name":"Mccall, Ingrid","last_name":"Mccall"},{"last_name":"Meyer","full_name":"Meyer, Justin","first_name":"Justin"},{"full_name":"Gupta, Animesh","last_name":"Gupta","first_name":"Animesh"},{"first_name":"Calin C","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","last_name":"Guet","full_name":"Guet, Calin C","orcid":"0000-0001-6220-2052"},{"first_name":"Bruce","full_name":"Levin, Bruce","last_name":"Levin"}],"status":"public","publisher":"Public Library of Science","type":"journal_article","file":[{"file_name":"2018_Plos_Chaudhry.pdf","file_id":"5706","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:10Z","checksum":"527076f78265cd4ea192cd1569851587","file_size":4007095,"date_created":"2018-12-17T12:55:31Z"}],"ddc":["570"],"oa_version":"Published Version","_id":"82","issue":"8","publication_status":"published","external_id":{"isi":["000443383300024"]},"isi":1,"month":"08","year":"2018","department":[{"_id":"CaGu"}],"volume":16,"publication":"PLoS Biology","day":"16","has_accepted_license":"1","intvolume":"        16","date_published":"2018-08-16T00:00:00Z","doi":"10.1371/journal.pbio.2005971","file_date_updated":"2020-07-14T12:48:10Z","article_processing_charge":"Yes","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"article_number":"2005971","oa":1,"citation":{"mla":"Chaudhry, Waqas, et al. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>, vol. 16, no. 8, 2005971, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>.","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Leaky Resistance and the Conditions for the Existence of Lytic Bacteriophage.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971\">https://doi.org/10.1371/journal.pbio.2005971</a>.","ama":"Chaudhry W, Pleska M, Shah N, et al. Leaky resistance and the conditions for the existence of lytic bacteriophage. <i>PLoS Biology</i>. 2018;16(8). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971\">10.1371/journal.pbio.2005971</a>","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, PLoS Biology 16 (2018).","ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Leaky resistance and the conditions for the existence of lytic bacteriophage. PLoS Biology. 16(8), 2005971.","ieee":"W. Chaudhry <i>et al.</i>, “Leaky resistance and the conditions for the existence of lytic bacteriophage,” <i>PLoS Biology</i>, vol. 16, no. 8. Public Library of Science, 2018."},"date_created":"2018-12-11T11:44:32Z","quality_controlled":"1","publist_id":"7972","title":"Leaky resistance and the conditions for the existence of lytic bacteriophage"},{"title":"Proof systems for sustainable decentralized cryptocurrencies","publist_id":"7971","page":"59","citation":{"mla":"Abusalah, Hamza M. <i>Proof Systems for Sustainable Decentralized Cryptocurrencies</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>.","apa":"Abusalah, H. M. (2018). <i>Proof systems for sustainable decentralized cryptocurrencies</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>","chicago":"Abusalah, Hamza M. “Proof Systems for Sustainable Decentralized Cryptocurrencies.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">https://doi.org/10.15479/AT:ISTA:TH_1046</a>.","ama":"Abusalah HM. Proof systems for sustainable decentralized cryptocurrencies. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:TH_1046\">10.15479/AT:ISTA:TH_1046</a>","ista":"Abusalah HM. 2018. Proof systems for sustainable decentralized cryptocurrencies. Institute of Science and Technology Austria.","short":"H.M. Abusalah, Proof Systems for Sustainable Decentralized Cryptocurrencies, Institute of Science and Technology Austria, 2018.","ieee":"H. M. Abusalah, “Proof systems for sustainable decentralized cryptocurrencies,” Institute of Science and Technology Austria, 2018."},"date_created":"2018-12-11T11:44:32Z","oa":1,"article_processing_charge":"No","ec_funded":1,"doi":"10.15479/AT:ISTA:TH_1046","file_date_updated":"2020-07-14T12:48:11Z","degree_awarded":"PhD","has_accepted_license":"1","date_published":"2018-09-05T00:00:00Z","day":"05","department":[{"_id":"KrPi"}],"publication_identifier":{"issn":["2663-337X"]},"month":"09","year":"2018","project":[{"call_identifier":"FP7","name":"Provable Security for Physical Cryptography","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"},{"grant_number":"682815","name":"Teaching Old Crypto New Tricks","call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Published Version","ddc":["004"],"type":"dissertation","file":[{"file_name":"2018_Thesis_Abusalah.pdf","file_id":"6245","creator":"dernst","relation":"main_file","access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:48:11Z","checksum":"c4b5f7d111755d1396787f41886fc674","file_size":876241,"date_created":"2019-04-09T06:43:41Z"},{"file_name":"2018_Thesis_Abusalah_source.tar.gz","creator":"dernst","file_id":"6246","relation":"source_file","content_type":"application/x-gzip","access_level":"closed","date_updated":"2020-07-14T12:48:11Z","checksum":"0f382ac56b471c48fd907d63eb87dafe","file_size":2029190,"date_created":"2019-04-09T06:43:41Z"}],"_id":"83","alternative_title":["ISTA Thesis"],"publication_status":"published","pubrep_id":"1046","supervisor":[{"full_name":"Pietrzak, Krzysztof Z","last_name":"Pietrzak","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Institute of Science and Technology Austria","author":[{"full_name":"Abusalah, Hamza M","last_name":"Abusalah","first_name":"Hamza M","id":"40297222-F248-11E8-B48F-1D18A9856A87"}],"status":"public","abstract":[{"lang":"eng","text":"A proof system is a protocol between a prover and a verifier over a common input in which an honest prover convinces the verifier of the validity of true statements. Motivated by the success of decentralized cryptocurrencies, exemplified by Bitcoin, the focus of this thesis will be on proof systems which found applications in some sustainable alternatives to Bitcoin, such as the Spacemint and Chia cryptocurrencies. In particular, we focus on proofs of space and proofs of sequential work.\r\nProofs of space (PoSpace) were suggested as more ecological, economical, and egalitarian alternative to the energy-wasteful proof-of-work mining of Bitcoin. However, the state-of-the-art constructions of PoSpace are based on sophisticated graph pebbling lower bounds, and are therefore complex. Moreover, when these PoSpace are used in cryptocurrencies like Spacemint, miners can only start mining after ensuring that a commitment to their space is already added in a special transaction to the blockchain. Proofs of sequential work (PoSW) are proof systems in which a prover, upon receiving a statement x and a time parameter T, computes a proof which convinces the verifier that T time units had passed since x was received. Whereas Spacemint assumes synchrony to retain some interesting Bitcoin dynamics, Chia requires PoSW with unique proofs, i.e., PoSW in which it is hard to come up with more than one accepting proof for any true statement. In this thesis we construct simple and practically-efficient PoSpace and PoSW. When using our PoSpace in cryptocurrencies, miners can start mining on the fly, like in Bitcoin, and unlike current constructions of PoSW, which either achieve efficient verification of sequential work, or faster-than-recomputing verification of correctness of proofs, but not both at the same time, ours achieve the best of these two worlds."}],"related_material":{"record":[{"relation":"part_of_dissertation","status":"public","id":"1229"},{"id":"1235","relation":"part_of_dissertation","status":"public"},{"id":"1236","status":"public","relation":"part_of_dissertation"},{"id":"559","status":"public","relation":"part_of_dissertation"}]},"date_updated":"2023-09-07T12:30:23Z","language":[{"iso":"eng"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"}]