[{"year":"2018","main_file_link":[{"open_access":"1","url":"https://eprint.iacr.org/2018/183.pdf"}],"article_processing_charge":"No","volume":10821,"date_created":"2018-12-11T11:45:42Z","project":[{"call_identifier":"H2020","_id":"258AA5B2-B435-11E9-9278-68D0E5697425","grant_number":"682815","name":"Teaching Old Crypto New Tricks"}],"title":"Simple proofs of sequential work","date_published":"2018-05-29T00:00:00Z","quality_controlled":"1","conference":{"location":"Tel Aviv, Israel","start_date":"2018-04-29","end_date":"2018-05-03","name":"Eurocrypt: Advances in Cryptology"},"date_updated":"2023-09-18T09:29:33Z","oa_version":"Submitted Version","department":[{"_id":"KrPi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ieee":"B. Cohen and K. Z. Pietrzak, “Simple proofs of sequential work,” presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel, 2018, vol. 10821, pp. 451–467.","chicago":"Cohen, Bram, and Krzysztof Z Pietrzak. “Simple Proofs of Sequential Work,” 10821:451–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-78375-8_15\">https://doi.org/10.1007/978-3-319-78375-8_15</a>.","short":"B. Cohen, K.Z. Pietrzak, in:, Springer, 2018, pp. 451–467.","ama":"Cohen B, Pietrzak KZ. Simple proofs of sequential work. In: Vol 10821. Springer; 2018:451-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-78375-8_15\">10.1007/978-3-319-78375-8_15</a>","mla":"Cohen, Bram, and Krzysztof Z. Pietrzak. <i>Simple Proofs of Sequential Work</i>. Vol. 10821, Springer, 2018, pp. 451–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-78375-8_15\">10.1007/978-3-319-78375-8_15</a>.","apa":"Cohen, B., &#38; Pietrzak, K. Z. (2018). Simple proofs of sequential work (Vol. 10821, pp. 451–467). Presented at the Eurocrypt: Advances in Cryptology, Tel Aviv, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-78375-8_15\">https://doi.org/10.1007/978-3-319-78375-8_15</a>","ista":"Cohen B, Pietrzak KZ. 2018. Simple proofs of sequential work. Eurocrypt: Advances in Cryptology, LNCS, vol. 10821, 451–467."},"author":[{"full_name":"Cohen, Bram","first_name":"Bram","last_name":"Cohen"},{"full_name":"Pietrzak, Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","first_name":"Krzysztof Z","orcid":"0000-0002-9139-1654","last_name":"Pietrzak"}],"oa":1,"type":"conference","external_id":{"isi":["000517098700015"]},"scopus_import":"1","_id":"302","language":[{"iso":"eng"}],"intvolume":"     10821","page":"451 - 467","publisher":"Springer","publication_status":"published","day":"29","ec_funded":1,"alternative_title":["LNCS"],"isi":1,"month":"05","doi":"10.1007/978-3-319-78375-8_15","abstract":[{"lang":"eng","text":"At ITCS 2013, Mahmoody, Moran and Vadhan [MMV13] introduce and construct publicly verifiable proofs of sequential work, which is a protocol for proving that one spent sequential computational work related to some statement. The original motivation for such proofs included non-interactive time-stamping and universally verifiable CPU benchmarks. A more recent application, and our main motivation, are blockchain designs, where proofs of sequential work can be used – in combination with proofs of space – as a more ecological and economical substitute for proofs of work which are currently used to secure Bitcoin and other cryptocurrencies. The construction proposed by [MMV13] is based on a hash function and can be proven secure in the random oracle model, or assuming inherently sequential hash-functions, which is a new standard model assumption introduced in their work. In a proof of sequential work, a prover gets a “statement” χ, a time parameter N and access to a hash-function H, which for the security proof is modelled as a random oracle. Correctness requires that an honest prover can make a verifier accept making only N queries to H, while soundness requires that any prover who makes the verifier accept must have made (almost) N sequential queries to H. Thus a solution constitutes a proof that N time passed since χ was received. Solutions must be publicly verifiable in time at most polylogarithmic in N. The construction of [MMV13] is based on “depth-robust” graphs, and as a consequence has rather poor concrete parameters. But the major drawback is that the prover needs not just N time, but also N space to compute a proof. In this work we propose a proof of sequential work which is much simpler, more efficient and achieves much better concrete bounds. Most importantly, the space required can be as small as log (N) (but we get better soundness using slightly more memory than that). An open problem stated by [MMV13] that our construction does not solve either is achieving a “unique” proof, where even a cheating prover can only generate a single accepting proof. This property would be extremely useful for applications to blockchains."}],"publist_id":"7579","status":"public"},{"language":[{"iso":"eng"}],"arxiv":1,"page":"2827 - 2849","intvolume":"        38","publisher":"AIMS","day":"01","publication_status":"published","acknowledgement":"The first author, Nikita Kalinin, is funded by SNCF PostDoc.Mobility grant 168647. Support from the Basic Research Program of the National Research University Higher School of Economics is gratefully acknowledged. The second author, Mikhail Shkolnikov, is supported in part by the grant 159240 of the Swiss National Science Foundation as well as by the National Center of Competence in Research SwissMAP of the Swiss National Science Foundation.","isi":1,"month":"06","abstract":[{"text":"The theory of tropical series, that we develop here, firstly appeared in the study of the growth of pluriharmonic functions. Motivated by waves in sandpile models we introduce a dynamic on the set of tropical series, and it is experimentally observed that this dynamic obeys a power law. So, this paper serves as a compilation of results we need for other articles and also introduces several objects interesting by themselves.","lang":"eng"}],"doi":"10.3934/dcds.2018120","publist_id":"7576","issue":"6","status":"public","publication":"Discrete and Continuous Dynamical Systems- Series A","volume":38,"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1706.03062"}],"year":"2018","date_created":"2018-12-11T11:45:43Z","quality_controlled":"1","title":"Introduction to tropical series and wave dynamic on them","date_published":"2018-06-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Kalinin N, Shkolnikov M. 2018. Introduction to tropical series and wave dynamic on them. Discrete and Continuous Dynamical Systems- Series A. 38(6), 2827–2849.","mla":"Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 38, no. 6, AIMS, 2018, pp. 2827–49, doi:<a href=\"https://doi.org/10.3934/dcds.2018120\">10.3934/dcds.2018120</a>.","apa":"Kalinin, N., &#38; Shkolnikov, M. (2018). Introduction to tropical series and wave dynamic on them. <i>Discrete and Continuous Dynamical Systems- Series A</i>. AIMS. <a href=\"https://doi.org/10.3934/dcds.2018120\">https://doi.org/10.3934/dcds.2018120</a>","ieee":"N. Kalinin and M. Shkolnikov, “Introduction to tropical series and wave dynamic on them,” <i>Discrete and Continuous Dynamical Systems- Series A</i>, vol. 38, no. 6. AIMS, pp. 2827–2849, 2018.","short":"N. Kalinin, M. Shkolnikov, Discrete and Continuous Dynamical Systems- Series A 38 (2018) 2827–2849.","ama":"Kalinin N, Shkolnikov M. Introduction to tropical series and wave dynamic on them. <i>Discrete and Continuous Dynamical Systems- Series A</i>. 2018;38(6):2827-2849. doi:<a href=\"https://doi.org/10.3934/dcds.2018120\">10.3934/dcds.2018120</a>","chicago":"Kalinin, Nikita, and Mikhail Shkolnikov. “Introduction to Tropical Series and Wave Dynamic on Them.” <i>Discrete and Continuous Dynamical Systems- Series A</i>. AIMS, 2018. <a href=\"https://doi.org/10.3934/dcds.2018120\">https://doi.org/10.3934/dcds.2018120</a>."},"oa":1,"author":[{"first_name":"Nikita","full_name":"Kalinin, Nikita","last_name":"Kalinin"},{"id":"35084A62-F248-11E8-B48F-1D18A9856A87","first_name":"Mikhail","full_name":"Shkolnikov, Mikhail","orcid":"0000-0002-4310-178X","last_name":"Shkolnikov"}],"oa_version":"Submitted Version","date_updated":"2023-09-12T07:45:37Z","department":[{"_id":"TaHa"}],"type":"journal_article","scopus_import":"1","external_id":{"isi":["000438818400007"],"arxiv":["1706.03062"]},"_id":"303"},{"project":[{"_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","grant_number":"715767","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"}],"date_published":"2018-08-01T00:00:00Z","title":"Computational design of nanostructural color for additive manufacturing","quality_controlled":"1","ddc":["000","535","680"],"date_created":"2018-12-11T11:45:43Z","year":"2018","publication":"ACM Transactions on Graphics","volume":37,"article_processing_charge":"No","_id":"304","external_id":{"isi":["000448185000120"]},"file_date_updated":"2020-07-14T12:45:59Z","scopus_import":"1","pubrep_id":"1028","type":"journal_article","date_updated":"2023-09-11T12:46:13Z","oa_version":"Submitted Version","file":[{"relation":"main_file","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9","creator":"system","access_level":"open_access","date_created":"2018-12-12T10:18:14Z","file_id":"5334","file_name":"IST-2018-1024-v1+1_NanoStructColor-Auzinger-paper.pdf","file_size":10751684,"date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf"},{"creator":"system","checksum":"cae52b3a8d5e97be84771cd61ea2f75e","relation":"main_file","file_id":"5335","date_created":"2018-12-12T10:18:15Z","access_level":"open_access","date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf","file_size":20755095,"file_name":"IST-2018-1024-v1+2_NanoStructColor-Auzinger-supplemental.pdf"},{"date_created":"2018-12-12T10:18:16Z","file_id":"5336","access_level":"open_access","file_size":2186944,"content_type":"image/jpeg","date_updated":"2020-07-14T12:45:59Z","file_name":"IST-2018-1024-v1+3_NanoStructColor-Auzinger-image.jpg","creator":"system","relation":"main_file","checksum":"76dd90648f75779d3f64e324b6daaffe"},{"file_size":2734352,"content_type":"application/x-7z-compressed","date_updated":"2020-07-14T12:45:59Z","file_name":"IST-2018-1024-v1+4_NanoStructColor-Auzinger-blueprint.7z","date_created":"2018-12-12T10:18:17Z","file_id":"5337","access_level":"open_access","creator":"system","relation":"main_file","checksum":"c3a5b775a0ecdb20ccefb8d9646ec140"},{"file_name":"IST-2018-1024-v2+1_NanoStructColor-Auzinger-paper.pdf","date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf","file_size":10751684,"access_level":"open_access","file_id":"5338","date_created":"2018-12-12T10:18:18Z","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9","relation":"main_file","creator":"system"},{"file_id":"5339","date_created":"2018-12-12T10:18:19Z","access_level":"open_access","date_updated":"2020-07-14T12:45:59Z","content_type":"image/jpeg","file_size":2186944,"file_name":"IST-2018-1024-v2+3_NanoStructColor-Auzinger-image.jpg","creator":"system","checksum":"76dd90648f75779d3f64e324b6daaffe","relation":"main_file"},{"access_level":"open_access","date_created":"2018-12-12T10:18:20Z","file_id":"5340","file_name":"IST-2018-1024-v2+4_NanoStructColor-Auzinger-blueprint.7z","file_size":2734352,"date_updated":"2020-07-14T12:45:59Z","content_type":"application/x-7z-compressed","relation":"main_file","checksum":"c3a5b775a0ecdb20ccefb8d9646ec140","creator":"system"},{"checksum":"667e91b686db41e44d855a4fb2137402","relation":"main_file","creator":"system","access_level":"open_access","file_id":"5341","date_created":"2018-12-12T10:18:21Z","file_name":"IST-2018-1024-v2+5_NanoStructColor-Auzinger-supplemental.pdf","date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf","file_size":20755762},{"creator":"system","relation":"main_file","checksum":"dcdcc955a4c1c6d2599aeebb97d2e7b9","date_created":"2018-12-12T10:18:22Z","file_id":"5342","access_level":"open_access","file_size":10751684,"date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf","file_name":"IST-2018-1024-v3+1_NanoStructColor-Auzinger-paper.pdf"},{"relation":"main_file","checksum":"76dd90648f75779d3f64e324b6daaffe","creator":"system","file_name":"IST-2018-1024-v3+3_NanoStructColor-Auzinger-image.jpg","file_size":2186944,"content_type":"image/jpeg","date_updated":"2020-07-14T12:45:59Z","access_level":"open_access","date_created":"2018-12-12T10:18:22Z","file_id":"5343"},{"access_level":"open_access","file_id":"5344","date_created":"2018-12-12T10:18:23Z","file_name":"IST-2018-1024-v3+4_NanoStructColor-Auzinger-blueprint.7z","date_updated":"2020-07-14T12:45:59Z","content_type":"application/x-7z-compressed","file_size":2734352,"checksum":"c3a5b775a0ecdb20ccefb8d9646ec140","relation":"main_file","creator":"system"},{"access_level":"open_access","date_created":"2018-12-12T10:18:24Z","file_id":"5345","file_name":"IST-2018-1024-v3+5_NanoStructColor-Auzinger-supplemental.pdf","file_size":20755762,"content_type":"application/pdf","date_updated":"2020-07-14T12:45:59Z","relation":"main_file","checksum":"667e91b686db41e44d855a4fb2137402","creator":"system"},{"checksum":"72dce35388fb1aa7953df4d9ae3d02f1","relation":"main_file","creator":"system","file_name":"IST-2018-1024-v3+6_NanoStructColor-Auzinger-presentation.pptx","date_updated":"2020-07-14T12:45:59Z","content_type":"application/vnd.openxmlformats-officedocument.presentationml.presentation","file_size":69698068,"access_level":"open_access","file_id":"5346","date_created":"2018-12-12T10:18:25Z"}],"department":[{"_id":"BeBi"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Auzinger T, Heidrich W, Bickel B. 2018. Computational design of nanostructural color for additive manufacturing. ACM Transactions on Graphics. 37(4), 159.","apa":"Auzinger, T., Heidrich, W., &#38; Bickel, B. (2018). Computational design of nanostructural color for additive manufacturing. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201376\">https://doi.org/10.1145/3197517.3201376</a>","mla":"Auzinger, Thomas, et al. “Computational Design of Nanostructural Color for Additive Manufacturing.” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4, 159, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201376\">10.1145/3197517.3201376</a>.","ieee":"T. Auzinger, W. Heidrich, and B. Bickel, “Computational design of nanostructural color for additive manufacturing,” <i>ACM Transactions on Graphics</i>, vol. 37, no. 4. ACM, 2018.","short":"T. Auzinger, W. Heidrich, B. Bickel, ACM Transactions on Graphics 37 (2018).","ama":"Auzinger T, Heidrich W, Bickel B. Computational design of nanostructural color for additive manufacturing. <i>ACM Transactions on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201376\">10.1145/3197517.3201376</a>","chicago":"Auzinger, Thomas, Wolfgang Heidrich, and Bernd Bickel. “Computational Design of Nanostructural Color for Additive Manufacturing.” <i>ACM Transactions on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201376\">https://doi.org/10.1145/3197517.3201376</a>."},"has_accepted_license":"1","author":[{"orcid":"0000-0002-1546-3265","first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","full_name":"Auzinger, Thomas","last_name":"Auzinger"},{"full_name":"Heidrich, Wolfgang","first_name":"Wolfgang","last_name":"Heidrich"},{"last_name":"Bickel","orcid":"0000-0001-6511-9385","first_name":"Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87","full_name":"Bickel, Bernd"}],"oa":1,"publisher":"ACM","article_number":"159","intvolume":"        37","language":[{"iso":"eng"}],"status":"public","issue":"4","abstract":[{"lang":"eng","text":"Additive manufacturing has recently seen drastic improvements in resolution, making it now possible to fabricate features at scales of hundreds or even dozens of nanometers, which previously required very expensive lithographic methods.\r\nAs a result, additive manufacturing now seems poised for optical applications, including those relevant to computer graphics, such as material design, as well as display and imaging applications.\r\n \r\nIn this work, we explore the use of additive manufacturing for generating structural colors, where the structures are designed using a fabrication-aware optimization process.\r\nThis requires a combination of full-wave simulation, a feasible parameterization of the design space, and a tailored optimization procedure.\r\nMany of these components should be re-usable for the design of other optical structures at this scale.\r\n \r\nWe show initial results of material samples fabricated based on our designs.\r\nWhile these suffer from the prototype character of state-of-the-art fabrication hardware, we believe they clearly demonstrate the potential of additive nanofabrication for structural colors and other graphics applications."}],"doi":"10.1145/3197517.3201376","alternative_title":["ACM Transactions on Graphics"],"isi":1,"month":"08","related_material":{"link":[{"url":"https://ist.ac.at/en/news/color-effects-from-transparent-3d-printed-nanostructures/","relation":"press_release","description":"News on IST Homepage"}]},"acknowledgement":"This work was in part supported by King Abdullah University of Science and Technology Baseline Funding.","publication_status":"published","day":"01","ec_funded":1},{"publisher":"Springer","language":[{"iso":"eng"}],"page":"183 - 202","intvolume":"      1771","publist_id":"7574","abstract":[{"lang":"eng","text":"The hanging-drop network (HDN) is a technology platform based on a completely open microfluidic network at the bottom of an inverted, surface-patterned substrate. The platform is predominantly used for the formation, culturing, and interaction of self-assembled spherical microtissues (spheroids) under precisely controlled flow conditions. Here, we describe design, fabrication, and operation of microfluidic hanging-drop networks."}],"doi":"10.1007/978-1-4939-7792-5_15","status":"public","ec_funded":1,"day":"01","publication_status":"published","acknowledgement":"This work was financially supported by FP7 of the EU through the project “Body on a chip,” ICT-FET-296257, and the ERC Advanced Grant “NeuroCMOS” (contract 267351), as well as by an individual Ambizione Grant 142440 from the Swiss National Science Foundation for Olivier Frey. The research leading to these results also received funding from the People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007-2013) under REA grant agreement no. [291734]. We would like to thank Alexander Stettler, ETH Zurich for his expertise and support in the cleanroom, and we acknowledge the Single Cell Unit of D-BSSE, ETH Zurich for assistance in microscopy issues. M.L. is grateful to the members of the Guet and Tkačik groups, IST Austria, for valuable comments and support.","month":"01","alternative_title":["MIMB"],"quality_controlled":"1","title":"Fabrication and operation of microfluidic hanging drop networks","date_published":"2018-01-01T00:00:00Z","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"volume":1771,"publication":"Methods in Molecular Biology","year":"2018","date_created":"2018-12-11T11:45:43Z","scopus_import":1,"_id":"305","author":[{"last_name":"Misun","first_name":"Patrick","full_name":"Misun, Patrick"},{"full_name":"Birchler, Axel","first_name":"Axel","last_name":"Birchler"},{"last_name":"Lang","id":"29E0800A-F248-11E8-B48F-1D18A9856A87","full_name":"Lang, Moritz","first_name":"Moritz"},{"first_name":"Andreas","full_name":"Hierlemann, Andreas","last_name":"Hierlemann"},{"last_name":"Frey","full_name":"Frey, Olivier","first_name":"Olivier"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"ista":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. 2018. Fabrication and operation of microfluidic hanging drop networks. Methods in Molecular Biology. 1771, 183–202.","apa":"Misun, P., Birchler, A., Lang, M., Hierlemann, A., &#38; Frey, O. (2018). Fabrication and operation of microfluidic hanging drop networks. <i>Methods in Molecular Biology</i>. Springer. <a href=\"https://doi.org/10.1007/978-1-4939-7792-5_15\">https://doi.org/10.1007/978-1-4939-7792-5_15</a>","mla":"Misun, Patrick, et al. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” <i>Methods in Molecular Biology</i>, vol. 1771, Springer, 2018, pp. 183–202, doi:<a href=\"https://doi.org/10.1007/978-1-4939-7792-5_15\">10.1007/978-1-4939-7792-5_15</a>.","ieee":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, and O. Frey, “Fabrication and operation of microfluidic hanging drop networks,” <i>Methods in Molecular Biology</i>, vol. 1771. Springer, pp. 183–202, 2018.","short":"P. Misun, A. Birchler, M. Lang, A. Hierlemann, O. Frey, Methods in Molecular Biology 1771 (2018) 183–202.","ama":"Misun P, Birchler A, Lang M, Hierlemann A, Frey O. Fabrication and operation of microfluidic hanging drop networks. <i>Methods in Molecular Biology</i>. 2018;1771:183-202. doi:<a href=\"https://doi.org/10.1007/978-1-4939-7792-5_15\">10.1007/978-1-4939-7792-5_15</a>","chicago":"Misun, Patrick, Axel Birchler, Moritz Lang, Andreas Hierlemann, and Olivier Frey. “Fabrication and Operation of Microfluidic Hanging Drop Networks.” <i>Methods in Molecular Biology</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/978-1-4939-7792-5_15\">https://doi.org/10.1007/978-1-4939-7792-5_15</a>."},"department":[{"_id":"CaGu"},{"_id":"GaTk"}],"oa_version":"None","date_updated":"2021-01-12T07:40:42Z","type":"journal_article"},{"year":"2018","publication":"Heliyon","volume":4,"ddc":["530"],"date_created":"2018-12-11T11:45:44Z","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_published":"2018-04-01T00:00:00Z","title":"An introduction to the maximum entropy approach and its application to inference problems in biology","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"oa_version":"Published Version","date_updated":"2021-01-12T07:40:46Z","file":[{"date_created":"2019-02-06T07:36:24Z","file_id":"5929","access_level":"open_access","file_size":994490,"date_updated":"2020-07-14T12:45:59Z","content_type":"application/pdf","file_name":"2018_Heliyon_DeMartino.pdf","creator":"dernst","relation":"main_file","checksum":"67010cf5e3b3e0637c659371714a715a"}],"department":[{"_id":"GaTk"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” <i>Heliyon</i>, vol. 4, no. 4, e00596, Elsevier, 2018, doi:<a href=\"https://doi.org/10.1016/j.heliyon.2018.e00596\">10.1016/j.heliyon.2018.e00596</a>.","apa":"De Martino, A., &#38; De Martino, D. (2018). An introduction to the maximum entropy approach and its application to inference problems in biology. <i>Heliyon</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.heliyon.2018.e00596\">https://doi.org/10.1016/j.heliyon.2018.e00596</a>","ista":"De Martino A, De Martino D. 2018. An introduction to the maximum entropy approach and its application to inference problems in biology. Heliyon. 4(4), e00596.","chicago":"De Martino, Andrea, and Daniele De Martino. “An Introduction to the Maximum Entropy Approach and Its Application to Inference Problems in Biology.” <i>Heliyon</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.heliyon.2018.e00596\">https://doi.org/10.1016/j.heliyon.2018.e00596</a>.","ama":"De Martino A, De Martino D. An introduction to the maximum entropy approach and its application to inference problems in biology. <i>Heliyon</i>. 2018;4(4). doi:<a href=\"https://doi.org/10.1016/j.heliyon.2018.e00596\">10.1016/j.heliyon.2018.e00596</a>","short":"A. De Martino, D. De Martino, Heliyon 4 (2018).","ieee":"A. De Martino and D. De Martino, “An introduction to the maximum entropy approach and its application to inference problems in biology,” <i>Heliyon</i>, vol. 4, no. 4. Elsevier, 2018."},"has_accepted_license":"1","author":[{"full_name":"De Martino, Andrea","first_name":"Andrea","last_name":"De Martino"},{"first_name":"Daniele","full_name":"De Martino, Daniele","id":"3FF5848A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5214-4706","last_name":"De Martino"}],"oa":1,"type":"journal_article","file_date_updated":"2020-07-14T12:45:59Z","scopus_import":1,"_id":"306","language":[{"iso":"eng"}],"article_number":"e00596","intvolume":"         4","publisher":"Elsevier","publication_status":"published","day":"01","ec_funded":1,"month":"04","issue":"4","abstract":[{"lang":"eng","text":"A cornerstone of statistical inference, the maximum entropy framework is being increasingly applied to construct descriptive and predictive models of biological systems, especially complex biological networks, from large experimental data sets. Both its broad applicability and the success it obtained in different contexts hinge upon its conceptual simplicity and mathematical soundness. Here we try to concisely review the basic elements of the maximum entropy principle, starting from the notion of ‘entropy’, and describe its usefulness for the analysis of biological systems. As examples, we focus specifically on the problem of reconstructing gene interaction networks from expression data and on recent work attempting to expand our system-level understanding of bacterial metabolism. Finally, we highlight some extensions and potential limitations of the maximum entropy approach, and point to more recent developments that are likely to play a key role in the upcoming challenges of extracting structures and information from increasingly rich, high-throughput biological data."}],"doi":"10.1016/j.heliyon.2018.e00596","status":"public"},{"type":"journal_article","citation":{"short":"E. Redchenko, A. Makarov, V. Yudson,  Physical Review A - Atomic, Molecular, and Optical Physics 97 (2018).","ama":"Redchenko E, Makarov A, Yudson V. Nanoscopy of pairs of atoms by fluorescence in a magnetic field. <i> Physical Review A - Atomic, Molecular, and Optical Physics</i>. 2018;97(4). doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">10.1103/PhysRevA.97.043812</a>","chicago":"Redchenko, Elena, Alexander Makarov, and Vladimir Yudson. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” <i> Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">https://doi.org/10.1103/PhysRevA.97.043812</a>.","ieee":"E. Redchenko, A. Makarov, and V. Yudson, “Nanoscopy of pairs of atoms by fluorescence in a magnetic field,” <i> Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 97, no. 4. American Physical Society, 2018.","ista":"Redchenko E, Makarov A, Yudson V. 2018. Nanoscopy of pairs of atoms by fluorescence in a magnetic field.  Physical Review A - Atomic, Molecular, and Optical Physics. 97(4), 043812.","mla":"Redchenko, Elena, et al. “Nanoscopy of Pairs of Atoms by Fluorescence in a Magnetic Field.” <i> Physical Review A - Atomic, Molecular, and Optical Physics</i>, vol. 97, no. 4, 043812, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">10.1103/PhysRevA.97.043812</a>.","apa":"Redchenko, E., Makarov, A., &#38; Yudson, V. (2018). Nanoscopy of pairs of atoms by fluorescence in a magnetic field. <i> Physical Review A - Atomic, Molecular, and Optical Physics</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevA.97.043812\">https://doi.org/10.1103/PhysRevA.97.043812</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Redchenko","full_name":"Redchenko, Elena","id":"2C21D6E8-F248-11E8-B48F-1D18A9856A87","first_name":"Elena"},{"last_name":"Makarov","full_name":"Makarov, Alexander","first_name":"Alexander"},{"last_name":"Yudson","full_name":"Yudson, Vladimir","first_name":"Vladimir"}],"oa":1,"date_updated":"2023-09-13T09:00:41Z","oa_version":"Submitted Version","department":[{"_id":"JoFi"}],"_id":"307","scopus_import":"1","external_id":{"arxiv":["1712.10127"],"isi":["000429454000015"]},"date_created":"2018-12-11T11:45:44Z","publication":" Physical Review A - Atomic, Molecular, and Optical Physics","volume":97,"article_processing_charge":"No","year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1712.10127","open_access":"1"}],"quality_controlled":"1","title":"Nanoscopy of pairs of atoms by fluorescence in a magnetic field","date_published":"2018-04-09T00:00:00Z","isi":1,"month":"04","day":"09","publication_status":"published","acknowledgement":"The work was partially supported by Russian Foundation for Basic Research (Grant No. 15-02-05657a) and by the Basic research program of Higher School of Economics (HSE).","status":"public","abstract":[{"lang":"eng","text":"Spontaneous emission spectra of two initially excited closely spaced identical atoms are very sensitive to the strength and the direction of the applied magnetic field. We consider the relevant schemes that ensure the determination of the mutual spatial orientation of the atoms and the distance between them by entirely optical means. A corresponding theoretical description is given accounting for the dipole-dipole interaction between the two atoms in the presence of a magnetic field and for polarizations of the quantum field interacting with magnetic sublevels of the two-atom system. "}],"publist_id":"7572","doi":"10.1103/PhysRevA.97.043812","issue":"4","article_type":"original","article_number":" 043812 ","intvolume":"        97","language":[{"iso":"eng"}],"arxiv":1,"publisher":"American Physical Society"},{"scopus_import":"1","external_id":{"pmid":["29738712"],"isi":["000432461400009"]},"_id":"308","oa":1,"author":[{"id":"2F064CFE-F248-11E8-B48F-1D18A9856A87","full_name":"Ratheesh, Aparna","first_name":"Aparna","orcid":"0000-0001-7190-0776","last_name":"Ratheesh"},{"last_name":"Biebl","full_name":"Biebl, Julia","first_name":"Julia","id":"3CCBB46E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Smutny","full_name":"Smutny, Michael","first_name":"Michael"},{"last_name":"Veselá","first_name":"Jana","id":"433253EE-F248-11E8-B48F-1D18A9856A87","full_name":"Veselá, Jana"},{"full_name":"Papusheva, Ekaterina","first_name":"Ekaterina","id":"41DB591E-F248-11E8-B48F-1D18A9856A87","last_name":"Papusheva"},{"last_name":"Krens","first_name":"Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87","full_name":"Krens, Gabriel","orcid":"0000-0003-4761-5996"},{"last_name":"Kaufmann","full_name":"Kaufmann, Walter","first_name":"Walter","id":"3F99E422-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-9735-5315"},{"last_name":"György","first_name":"Attila","full_name":"György, Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-1819-198X"},{"first_name":"Alessandra M","full_name":"Casano, Alessandra M","id":"3DBA3F4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6009-6804","last_name":"Casano"},{"last_name":"Siekhaus","full_name":"Siekhaus, Daria E","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8323-8353"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"short":"A. Ratheesh, J. Bicher, M. Smutny, J. Veselá, E. Papusheva, G. Krens, W. Kaufmann, A. György, A.M. Casano, D.E. Siekhaus, Developmental Cell 45 (2018) 331–346.","ama":"Ratheesh A, Bicher J, Smutny M, et al. Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage invasive migration. <i>Developmental Cell</i>. 2018;45(3):331-346. doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.04.002\">10.1016/j.devcel.2018.04.002</a>","chicago":"Ratheesh, Aparna, Julia Bicher, Michael Smutny, Jana Veselá, Ekaterina Papusheva, Gabriel Krens, Walter Kaufmann, Attila György, Alessandra M Casano, and Daria E Siekhaus. “Drosophila TNF Modulates Tissue Tension in the Embryo to Facilitate Macrophage Invasive Migration.” <i>Developmental Cell</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.devcel.2018.04.002\">https://doi.org/10.1016/j.devcel.2018.04.002</a>.","ieee":"A. Ratheesh <i>et al.</i>, “Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage invasive migration,” <i>Developmental Cell</i>, vol. 45, no. 3. Elsevier, pp. 331–346, 2018.","ista":"Ratheesh A, Bicher J, Smutny M, Veselá J, Papusheva E, Krens G, Kaufmann W, György A, Casano AM, Siekhaus DE. 2018. Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage invasive migration. Developmental Cell. 45(3), 331–346.","mla":"Ratheesh, Aparna, et al. “Drosophila TNF Modulates Tissue Tension in the Embryo to Facilitate Macrophage Invasive Migration.” <i>Developmental Cell</i>, vol. 45, no. 3, Elsevier, 2018, pp. 331–46, doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.04.002\">10.1016/j.devcel.2018.04.002</a>.","apa":"Ratheesh, A., Bicher, J., Smutny, M., Veselá, J., Papusheva, E., Krens, G., … Siekhaus, D. E. (2018). Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage invasive migration. <i>Developmental Cell</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.devcel.2018.04.002\">https://doi.org/10.1016/j.devcel.2018.04.002</a>"},"department":[{"_id":"DaSi"},{"_id":"CaHe"},{"_id":"Bio"},{"_id":"EM-Fac"},{"_id":"MiSi"}],"date_updated":"2023-09-11T13:22:13Z","oa_version":"Published Version","type":"journal_article","quality_controlled":"1","date_published":"2018-05-07T00:00:00Z","title":"Drosophila TNF modulates tissue tension in the embryo to facilitate macrophage invasive migration","project":[{"_id":"253B6E48-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Drosophila TNFa´s Funktion in Immunzellen","grant_number":"P29638"},{"_id":"2536F660-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"334077","name":"Investigating the role of transporters in invasive migration through junctions"}],"volume":45,"article_processing_charge":"No","publication":"Developmental Cell","main_file_link":[{"open_access":"1","url":"https://doi.org/10.1016/j.devcel.2018.04.002"}],"year":"2018","date_created":"2018-12-11T11:45:44Z","doi":"10.1016/j.devcel.2018.04.002","abstract":[{"text":"Migrating cells penetrate tissue barriers during development, inflammatory responses, and tumor metastasis. We study if migration in vivo in such three-dimensionally confined environments requires changes in the mechanical properties of the surrounding cells using embryonic Drosophila melanogaster hemocytes, also called macrophages, as a model. We find that macrophage invasion into the germband through transient separation of the apposing ectoderm and mesoderm requires cell deformations and reductions in apical tension in the ectoderm. Interestingly, the genetic pathway governing these mechanical shifts acts downstream of the only known tumor necrosis factor superfamily member in Drosophila, Eiger, and its receptor, Grindelwald. Eiger-Grindelwald signaling reduces levels of active Myosin in the germband ectodermal cortex through the localization of a Crumbs complex component, Patj (Pals-1-associated tight junction protein). We therefore elucidate a distinct molecular pathway that controls tissue tension and demonstrate the importance of such regulation for invasive migration in vivo.","lang":"eng"}],"acknowledged_ssus":[{"_id":"SSU"}],"issue":"3","status":"public","pmid":1,"ec_funded":1,"day":"07","publication_status":"published","related_material":{"link":[{"url":"https://ist.ac.at/en/news/cells-change-tension-to-make-tissue-barriers-easier-to-get-through/","relation":"press_release","description":"News on IST Homepage"}]},"month":"05","isi":1,"publisher":"Elsevier","language":[{"iso":"eng"}],"article_type":"original","page":"331 - 346","intvolume":"        45"},{"status":"public","publist_id":"7556","abstract":[{"lang":"eng","text":"We present an efficient algorithm for a problem in the interface between clustering and graph embeddings. An embedding ' : G ! M of a graph G into a 2manifold M maps the vertices in V (G) to distinct points and the edges in E(G) to interior-disjoint Jordan arcs between the corresponding vertices. In applications in clustering, cartography, and visualization, nearby vertices and edges are often bundled to a common node or arc, due to data compression or low resolution. This raises the computational problem of deciding whether a given map ' : G ! M comes from an embedding. A map ' : G ! M is a weak embedding if it can be perturbed into an embedding ψ: G ! M with k' \"k < \" for every &quot; &gt; 0. A polynomial-time algorithm for recognizing weak embeddings was recently found by Fulek and Kyncl [14], which reduces to solving a system of linear equations over Z2. It runs in O(n2!) O(n4:75) time, where 2:373 is the matrix multiplication exponent and n is the number of vertices and edges of G. We improve the running time to O(n log n). Our algorithm is also conceptually simpler than [14]: We perform a sequence of local operations that gradually &quot;untangles&quot; the image '(G) into an embedding (G), or reports that ' is not a weak embedding. It generalizes a recent technique developed for the case that G is a cycle and the embedding is a simple polygon [1], and combines local constraints on the orientation of subgraphs directly, thereby eliminating the need for solving large systems of linear equations."}],"doi":"10.1137/1.9781611975031.20","isi":1,"month":"01","related_material":{"record":[{"status":"public","id":"6982","relation":"later_version"}]},"day":"01","acknowledgement":"∗Research supported in part by the NSF awards CCF-1422311 and CCF-1423615, and the Science Without Borders program. The second author gratefully acknowledges support from Austrian Science Fund (FWF): M2281-N35.","publication_status":"published","publisher":"ACM","page":"274 - 292","arxiv":1,"language":[{"iso":"eng"}],"_id":"309","scopus_import":"1","external_id":{"isi":["000483921200021"],"arxiv":["1709.09209"]},"type":"conference","citation":{"apa":"Akitaya, H., Fulek, R., &#38; Tóth, C. (2018). Recognizing weak embeddings of graphs (pp. 274–292). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.20\">https://doi.org/10.1137/1.9781611975031.20</a>","mla":"Akitaya, Hugo, et al. <i>Recognizing Weak Embeddings of Graphs</i>. ACM, 2018, pp. 274–92, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.20\">10.1137/1.9781611975031.20</a>.","ista":"Akitaya H, Fulek R, Tóth C. 2018. Recognizing weak embeddings of graphs. SODA: Symposium on Discrete Algorithms, 274–292.","chicago":"Akitaya, Hugo, Radoslav Fulek, and Csaba Tóth. “Recognizing Weak Embeddings of Graphs,” 274–92. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.20\">https://doi.org/10.1137/1.9781611975031.20</a>.","short":"H. Akitaya, R. Fulek, C. Tóth, in:, ACM, 2018, pp. 274–292.","ama":"Akitaya H, Fulek R, Tóth C. Recognizing weak embeddings of graphs. In: ACM; 2018:274-292. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.20\">10.1137/1.9781611975031.20</a>","ieee":"H. Akitaya, R. Fulek, and C. Tóth, “Recognizing weak embeddings of graphs,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, LA, USA, 2018, pp. 274–292."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"last_name":"Akitaya","full_name":"Akitaya, Hugo","first_name":"Hugo"},{"full_name":"Fulek, Radoslav","first_name":"Radoslav","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8485-1774","last_name":"Fulek"},{"last_name":"Tóth","full_name":"Tóth, Csaba","first_name":"Csaba"}],"oa":1,"oa_version":"Preprint","date_updated":"2023-09-15T12:19:32Z","department":[{"_id":"UlWa"}],"conference":{"end_date":"2018-01-10","location":"New Orleans, LA, USA","start_date":"2018-01-07","name":"SODA: Symposium on Discrete Algorithms"},"quality_controlled":"1","project":[{"name":"Eliminating intersections in drawings of graphs","grant_number":"M02281","call_identifier":"FWF","_id":"261FA626-B435-11E9-9278-68D0E5697425"}],"date_published":"2018-01-01T00:00:00Z","title":"Recognizing weak embeddings of graphs","date_created":"2018-12-11T11:45:45Z","article_processing_charge":"No","year":"2018","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1709.09209"}]},{"article_type":"original","intvolume":"        98","article_number":"042410","language":[{"iso":"eng"}],"publisher":"American Physical Society","month":"10","isi":1,"ec_funded":1,"day":"17","publication_status":"published","acknowledgement":"This work was supported by ANR Trajectory, the French State program Investissements d’Avenir managed by the Agence Nationale de la Recherche (LIFESENSES; ANR-10-LABX-65), EC Grant No. H2020-785907 from the Human Brain Project, NIH Grant No. U01NS090501, and an AVIESAN-UNADEV grant to O.M. M.C. was supported by the Agence Nationale de la Recherche Jeune Chercheur/Jeune Chercheuse grant (ANR-17-CE37-0013).","publication_identifier":{"issn":["24700045"]},"status":"public","publist_id":"8024","doi":"10.1103/PhysRevE.98.042410","abstract":[{"text":"Correlations in sensory neural networks have both extrinsic and intrinsic origins. Extrinsic or stimulus correlations arise from shared inputs to the network and, thus, depend strongly on the stimulus ensemble. Intrinsic or noise correlations reflect biophysical mechanisms of interactions between neurons, which are expected to be robust to changes in the stimulus ensemble. Despite the importance of this distinction for understanding how sensory networks encode information collectively, no method exists to reliably separate intrinsic interactions from extrinsic correlations in neural activity data, limiting our ability to build predictive models of the network response. In this paper we introduce a general strategy to infer population models of interacting neurons that collectively encode stimulus information. The key to disentangling intrinsic from extrinsic correlations is to infer the couplings between neurons separately from the encoding model and to combine the two using corrections calculated in a mean-field approximation. We demonstrate the effectiveness of this approach in retinal recordings. The same coupling network is inferred from responses to radically different stimulus ensembles, showing that these couplings indeed reflect stimulus-independent interactions between neurons. The inferred model predicts accurately the collective response of retinal ganglion cell populations as a function of the stimulus.","lang":"eng"}],"issue":"4","date_created":"2018-12-11T11:44:15Z","volume":98,"article_processing_charge":"No","publication":"Physical Review E","year":"2018","main_file_link":[{"url":"https://www.biorxiv.org/content/10.1101/243816v2.full","open_access":"1"}],"quality_controlled":"1","date_published":"2018-10-17T00:00:00Z","title":"Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons","project":[{"name":"Human Brain Project Specific Grant Agreement 2 (HBP SGA 2)","grant_number":"785907","_id":"26436750-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"type":"journal_article","author":[{"last_name":"Ferrari","full_name":"Ferrari, Ulisse","first_name":"Ulisse"},{"last_name":"Deny","full_name":"Deny, Stephane","first_name":"Stephane"},{"last_name":"Chalk","full_name":"Chalk, Matthew J","first_name":"Matthew J"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","first_name":"Gasper","full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","last_name":"Tkacik"},{"last_name":"Marre","first_name":"Olivier","full_name":"Marre, Olivier"},{"first_name":"Thierry","full_name":"Mora, Thierry","last_name":"Mora"}],"oa":1,"citation":{"short":"U. Ferrari, S. Deny, M.J. Chalk, G. Tkačik, O. Marre, T. Mora, Physical Review E 98 (2018).","ama":"Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. <i>Physical Review E</i>. 2018;98(4). doi:<a href=\"https://doi.org/10.1103/PhysRevE.98.042410\">10.1103/PhysRevE.98.042410</a>","chicago":"Ferrari, Ulisse, Stephane Deny, Matthew J Chalk, Gašper Tkačik, Olivier Marre, and Thierry Mora. “Separating Intrinsic Interactions from Extrinsic Correlations in a Network of Sensory Neurons.” <i>Physical Review E</i>. American Physical Society, 2018. <a href=\"https://doi.org/10.1103/PhysRevE.98.042410\">https://doi.org/10.1103/PhysRevE.98.042410</a>.","ieee":"U. Ferrari, S. Deny, M. J. Chalk, G. Tkačik, O. Marre, and T. Mora, “Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons,” <i>Physical Review E</i>, vol. 98, no. 4. American Physical Society, 2018.","ista":"Ferrari U, Deny S, Chalk MJ, Tkačik G, Marre O, Mora T. 2018. Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. Physical Review E. 98(4), 042410.","apa":"Ferrari, U., Deny, S., Chalk, M. J., Tkačik, G., Marre, O., &#38; Mora, T. (2018). Separating intrinsic interactions from extrinsic correlations in a network of sensory neurons. <i>Physical Review E</i>. American Physical Society. <a href=\"https://doi.org/10.1103/PhysRevE.98.042410\">https://doi.org/10.1103/PhysRevE.98.042410</a>","mla":"Ferrari, Ulisse, et al. “Separating Intrinsic Interactions from Extrinsic Correlations in a Network of Sensory Neurons.” <i>Physical Review E</i>, vol. 98, no. 4, 042410, American Physical Society, 2018, doi:<a href=\"https://doi.org/10.1103/PhysRevE.98.042410\">10.1103/PhysRevE.98.042410</a>."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"GaTk"}],"oa_version":"Preprint","date_updated":"2023-09-18T09:18:44Z","_id":"31","scopus_import":"1","external_id":{"isi":["000447486100004"]}},{"publisher":"ACM","arxiv":1,"language":[{"iso":"eng"}],"page":"2341 - 2356","abstract":[{"lang":"eng","text":"A model of computation that is widely used in the formal analysis of reactive systems is symbolic algorithms. In this model the access to the input graph is restricted to consist of symbolic operations, which are expensive in comparison to the standard RAM operations. We give lower bounds on the number of symbolic operations for basic graph problems such as the computation of the strongly connected components and of the approximate diameter as well as for fundamental problems in model checking such as safety, liveness, and coliveness. Our lower bounds are linear in the number of vertices of the graph, even for constant-diameter graphs. For none of these problems lower bounds on the number of symbolic operations were known before. The lower bounds show an interesting separation of these problems from the reachability problem, which can be solved with O(D) symbolic operations, where D is the diameter of the graph. Additionally we present an approximation algorithm for the graph diameter which requires Õ(n/D) symbolic steps to achieve a (1 +ϵ)-approximation for any constant &gt; 0. This compares to O(n/D) symbolic steps for the (naive) exact algorithm and O(D) symbolic steps for a 2-approximation. Finally we also give a refined analysis of the strongly connected components algorithms of [15], showing that it uses an optimal number of symbolic steps that is proportional to the sum of the diameters of the strongly connected components."}],"doi":"10.1137/1.9781611975031.151","publist_id":"7555","status":"public","publication_status":"published","day":"01","ec_funded":1,"isi":1,"month":"01","project":[{"call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"}],"title":"Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter","date_published":"2018-01-01T00:00:00Z","quality_controlled":"1","conference":{"name":"SODA: Symposium on Discrete Algorithms","end_date":"2018-01-10","location":"New Orleans, Louisiana, United States","start_date":"2018-01-07"},"year":"2018","main_file_link":[{"url":"https://arxiv.org/abs/1711.09148","open_access":"1"}],"article_processing_charge":"No","date_created":"2018-12-11T11:45:45Z","external_id":{"arxiv":["1711.09148"],"isi":["000483921200152"]},"scopus_import":"1","_id":"310","date_updated":"2025-06-02T08:53:40Z","oa_version":"Preprint","department":[{"_id":"KrCh"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"mla":"Chatterjee, Krishnendu, et al. <i>Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter</i>. ACM, 2018, pp. 2341–56, doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>.","apa":"Chatterjee, K., Dvorák, W., Henzinger, M. H., &#38; Loitzenbauer, V. (2018). Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter (pp. 2341–2356). Presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States: ACM. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>","ista":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. 2018. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. SODA: Symposium on Discrete Algorithms, 2341–2356.","ieee":"K. Chatterjee, W. Dvorák, M. H. Henzinger, and V. Loitzenbauer, “Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter,” presented at the SODA: Symposium on Discrete Algorithms, New Orleans, Louisiana, United States, 2018, pp. 2341–2356.","chicago":"Chatterjee, Krishnendu, Wolfgang Dvorák, Monika H Henzinger, and Veronika Loitzenbauer. “Lower Bounds for Symbolic Computation on Graphs: Strongly Connected Components, Liveness, Safety, and Diameter,” 2341–56. ACM, 2018. <a href=\"https://doi.org/10.1137/1.9781611975031.151\">https://doi.org/10.1137/1.9781611975031.151</a>.","ama":"Chatterjee K, Dvorák W, Henzinger MH, Loitzenbauer V. Lower bounds for symbolic computation on graphs: Strongly connected components, liveness, safety, and diameter. In: ACM; 2018:2341-2356. doi:<a href=\"https://doi.org/10.1137/1.9781611975031.151\">10.1137/1.9781611975031.151</a>","short":"K. Chatterjee, W. Dvorák, M.H. Henzinger, V. Loitzenbauer, in:, ACM, 2018, pp. 2341–2356."},"oa":1,"author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee"},{"first_name":"Wolfgang","full_name":"Dvorák, Wolfgang","last_name":"Dvorák"},{"last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","first_name":"Monika H","full_name":"Henzinger, Monika H","orcid":"0000-0002-5008-6530"},{"first_name":"Veronika","full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer"}],"type":"conference"},{"publisher":"Springer","intvolume":"     10801","page":"739 - 767","language":[{"iso":"eng"}],"status":"public","publist_id":"7554","abstract":[{"text":"Smart contracts are computer programs that are executed by a network of mutually distrusting agents, without the need of an external trusted authority. Smart contracts handle and transfer assets of considerable value (in the form of crypto-currency like Bitcoin). Hence, it is crucial that their implementation is bug-free. We identify the utility (or expected payoff) of interacting with such smart contracts as the basic and canonical quantitative property for such contracts. We present a framework for such quantitative analysis of smart contracts. Such a formal framework poses new and novel research challenges in programming languages, as it requires modeling of game-theoretic aspects to analyze incentives for deviation from honest behavior and modeling utilities which are not specified as standard temporal properties such as safety and termination. While game-theoretic incentives have been analyzed in the security community, their analysis has been restricted to the very special case of stateless games. However, to analyze smart contracts, stateful analysis is required as it must account for the different program states of the protocol. Our main contributions are as follows: we present (i)~a simplified programming language for smart contracts; (ii)~an automatic translation of the programs to state-based games; (iii)~an abstraction-refinement approach to solve such games; and (iv)~experimental results on real-world-inspired smart contracts.","lang":"eng"}],"doi":"10.1007/978-3-319-89884-1_26","alternative_title":["LNCS"],"month":"04","related_material":{"record":[{"relation":"dissertation_contains","id":"8934","status":"public"}]},"acknowledgement":"The research was partially supported by Vienna Science and Technology Fund (WWTF) Project ICT15-003, Austrian Science Fund (FWF) NFN Grant No S11407-N23 (RiSE/SHiNE), and ERC Starting grant (279307: Graph Games).","publication_status":"published","ec_funded":1,"day":"01","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"conference":{"name":"ESOP: European Symposium on Programming","end_date":"2018-04-19","start_date":"2018-04-16","location":"Thessaloniki, Greece"},"date_published":"2018-04-01T00:00:00Z","title":"Quantitative analysis of smart contracts","project":[{"grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications"}],"quality_controlled":"1","date_created":"2018-12-11T11:45:45Z","ddc":["000"],"year":"2018","volume":10801,"article_processing_charge":"No","_id":"311","scopus_import":"1","file_date_updated":"2020-07-14T12:46:00Z","type":"conference","file":[{"checksum":"9c8a8338c571903b599b6ca93abd2cce","relation":"main_file","creator":"dernst","file_name":"2018_ESOP_Chatterjee.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:00Z","file_size":1394993,"access_level":"open_access","file_id":"5716","date_created":"2018-12-17T15:45:49Z"}],"department":[{"_id":"KrCh"}],"oa_version":"Published Version","date_updated":"2025-06-02T08:53:41Z","author":[{"last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X"},{"last_name":"Goharshady","id":"391365CE-F248-11E8-B48F-1D18A9856A87","first_name":"Amir","full_name":"Goharshady, Amir","orcid":"0000-0003-1702-6584"},{"last_name":"Velner","full_name":"Velner, Yaron","first_name":"Yaron"}],"oa":1,"citation":{"chicago":"Chatterjee, Krishnendu, Amir Kafshdar Goharshady, and Yaron Velner. “Quantitative Analysis of Smart Contracts,” 10801:739–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>.","short":"K. Chatterjee, A.K. Goharshady, Y. Velner, in:, Springer, 2018, pp. 739–767.","ama":"Chatterjee K, Goharshady AK, Velner Y. Quantitative analysis of smart contracts. In: Vol 10801. Springer; 2018:739-767. doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>","ieee":"K. Chatterjee, A. K. Goharshady, and Y. Velner, “Quantitative analysis of smart contracts,” presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece, 2018, vol. 10801, pp. 739–767.","mla":"Chatterjee, Krishnendu, et al. <i>Quantitative Analysis of Smart Contracts</i>. Vol. 10801, Springer, 2018, pp. 739–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">10.1007/978-3-319-89884-1_26</a>.","apa":"Chatterjee, K., Goharshady, A. K., &#38; Velner, Y. (2018). Quantitative analysis of smart contracts (Vol. 10801, pp. 739–767). Presented at the ESOP: European Symposium on Programming, Thessaloniki, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-319-89884-1_26\">https://doi.org/10.1007/978-3-319-89884-1_26</a>","ista":"Chatterjee K, Goharshady AK, Velner Y. 2018. Quantitative analysis of smart contracts. ESOP: European Symposium on Programming, LNCS, vol. 10801, 739–767."},"has_accepted_license":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"publisher":"Society for Industrial and Applied Mathematics ","language":[{"iso":"eng"}],"intvolume":"        32","page":"750 - 782","article_type":"original","issue":"1","doi":"10.1137/16M1097201","publist_id":"7553","abstract":[{"text":"Motivated by biological questions, we study configurations of equal spheres that neither pack nor cover. Placing their centers on a lattice, we define the soft density of the configuration by penalizing multiple overlaps. Considering the 1-parameter family of diagonally distorted 3-dimensional integer lattices, we show that the soft density is maximized at the FCC lattice.","lang":"eng"}],"status":"public","publication_identifier":{"issn":["08954801"]},"acknowledgement":"This work was partially supported by the DFG Collaborative Research Center TRR 109, “Discretization in Geometry and Dynamics,” through grant I02979-N35 of the Austrian Science Fund (FWF).","publication_status":"published","day":"29","isi":1,"month":"03","project":[{"name":"Persistence and stability of geometric complexes","grant_number":"I02979-N35","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"title":"On the optimality of the FCC lattice for soft sphere packing","date_published":"2018-03-29T00:00:00Z","quality_controlled":"1","main_file_link":[{"url":"http://pdfs.semanticscholar.org/d2d5/6da00fbc674e6a8b1bb9d857167e54200dc6.pdf","open_access":"1"}],"year":"2018","publication":"SIAM J Discrete Math","article_processing_charge":"No","volume":32,"date_created":"2018-12-11T11:45:46Z","external_id":{"isi":["000428958900038"]},"scopus_import":"1","_id":"312","date_updated":"2023-09-13T09:34:38Z","oa_version":"Submitted Version","department":[{"_id":"HeEd"}],"citation":{"ieee":"H. Edelsbrunner and M. Iglesias Ham, “On the optimality of the FCC lattice for soft sphere packing,” <i>SIAM J Discrete Math</i>, vol. 32, no. 1. Society for Industrial and Applied Mathematics , pp. 750–782, 2018.","ama":"Edelsbrunner H, Iglesias Ham M. On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. 2018;32(1):750-782. doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>","short":"H. Edelsbrunner, M. Iglesias Ham, SIAM J Discrete Math 32 (2018) 750–782.","chicago":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics , 2018. <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>.","ista":"Edelsbrunner H, Iglesias Ham M. 2018. On the optimality of the FCC lattice for soft sphere packing. SIAM J Discrete Math. 32(1), 750–782.","mla":"Edelsbrunner, Herbert, and Mabel Iglesias Ham. “On the Optimality of the FCC Lattice for Soft Sphere Packing.” <i>SIAM J Discrete Math</i>, vol. 32, no. 1, Society for Industrial and Applied Mathematics , 2018, pp. 750–82, doi:<a href=\"https://doi.org/10.1137/16M1097201\">10.1137/16M1097201</a>.","apa":"Edelsbrunner, H., &#38; Iglesias Ham, M. (2018). On the optimality of the FCC lattice for soft sphere packing. <i>SIAM J Discrete Math</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/16M1097201\">https://doi.org/10.1137/16M1097201</a>"},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Mabel","id":"41B58C0C-F248-11E8-B48F-1D18A9856A87","full_name":"Iglesias Ham, Mabel","last_name":"Iglesias Ham"}],"type":"journal_article"},{"day":"25","publication_status":"published","month":"04","isi":1,"doi":"10.1016/j.cels.2018.04.003","publist_id":"7551","abstract":[{"lang":"eng","text":"The interface of physics and biology pro-vides a fruitful environment for generatingnew concepts and exciting ways forwardto understanding living matter. Examplesof successful studies include the estab-lishment and readout of morphogen gra-dients during development, signal pro-cessing in protein and genetic networks,the role of fluctuations in determining thefates of cells and tissues, and collectiveeffects in proteins and in tissues. It is nothard to envision that significant further ad-vances will translate to societal benefitsby initiating the development of new de-vices and strategies for curing disease.However, research at the interface posesvarious challenges, in particular for youngscientists, and current institutions arerarely designed to facilitate such scientificprograms. In this Letter, we propose aninternational initiative that addressesthese challenges through the establish-ment of a worldwide network of platformsfor cross-disciplinary training and incuba-tors for starting new collaborations."}],"issue":"4","publication_identifier":{"eissn":["2405-4712"]},"status":"public","pmid":1,"language":[{"iso":"eng"}],"page":"400 - 402","article_type":"letter_note","intvolume":"         6","publisher":"Cell Press","oa":1,"author":[{"last_name":"Bauer","full_name":"Bauer, Guntram","first_name":"Guntram"},{"last_name":"Fakhri","first_name":"Nikta","full_name":"Fakhri, Nikta"},{"last_name":"Kicheva","orcid":"0000-0003-4509-4998","id":"3959A2A0-F248-11E8-B48F-1D18A9856A87","full_name":"Kicheva, Anna","first_name":"Anna"},{"first_name":"Jané","full_name":"Kondev, Jané","last_name":"Kondev"},{"full_name":"Kruse, Karsten","first_name":"Karsten","last_name":"Kruse"},{"last_name":"Noji","first_name":"Hiroyuki","full_name":"Noji, Hiroyuki"},{"first_name":"Daniel","full_name":"Riveline, Daniel","last_name":"Riveline"},{"last_name":"Saunders","full_name":"Saunders, Timothy","first_name":"Timothy"},{"last_name":"Thatta","full_name":"Thatta, Mukund","first_name":"Mukund"},{"first_name":"Eric","full_name":"Wieschaus, Eric","last_name":"Wieschaus"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Bauer, Guntram, Nikta Fakhri, Anna Kicheva, Jané Kondev, Karsten Kruse, Hiroyuki Noji, Daniel Riveline, Timothy Saunders, Mukund Thatta, and Eric Wieschaus. “The Science of Living Matter for Tomorrow.” <i>Cell Systems</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">https://doi.org/10.1016/j.cels.2018.04.003</a>.","short":"G. Bauer, N. Fakhri, A. Kicheva, J. Kondev, K. Kruse, H. Noji, D. Riveline, T. Saunders, M. Thatta, E. Wieschaus, Cell Systems 6 (2018) 400–402.","ama":"Bauer G, Fakhri N, Kicheva A, et al. The science of living matter for tomorrow. <i>Cell Systems</i>. 2018;6(4):400-402. doi:<a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">10.1016/j.cels.2018.04.003</a>","ieee":"G. Bauer <i>et al.</i>, “The science of living matter for tomorrow,” <i>Cell Systems</i>, vol. 6, no. 4. Cell Press, pp. 400–402, 2018.","mla":"Bauer, Guntram, et al. “The Science of Living Matter for Tomorrow.” <i>Cell Systems</i>, vol. 6, no. 4, Cell Press, 2018, pp. 400–02, doi:<a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">10.1016/j.cels.2018.04.003</a>.","apa":"Bauer, G., Fakhri, N., Kicheva, A., Kondev, J., Kruse, K., Noji, H., … Wieschaus, E. (2018). The science of living matter for tomorrow. <i>Cell Systems</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cels.2018.04.003\">https://doi.org/10.1016/j.cels.2018.04.003</a>","ista":"Bauer G, Fakhri N, Kicheva A, Kondev J, Kruse K, Noji H, Riveline D, Saunders T, Thatta M, Wieschaus E. 2018. The science of living matter for tomorrow. Cell Systems. 6(4), 400–402."},"department":[{"_id":"AnKi"}],"date_updated":"2023-09-19T10:11:25Z","oa_version":"Published Version","type":"journal_article","scopus_import":"1","external_id":{"isi":["000432192100003"],"pmid":["29698645"]},"_id":"314","volume":6,"article_processing_charge":"No","publication":"Cell Systems","main_file_link":[{"url":"https://doi.org/10.1016/j.cels.2018.04.003","open_access":"1"}],"year":"2018","date_created":"2018-12-11T11:45:46Z","quality_controlled":"1","title":"The science of living matter for tomorrow","date_published":"2018-04-25T00:00:00Z"},{"department":[{"_id":"NiBa"}],"file":[{"relation":"main_file","checksum":"908c52751bba30c55ed36789e5e4c84d","creator":"dernst","access_level":"open_access","date_created":"2019-01-22T08:30:03Z","file_id":"5870","file_name":"2017_PLOS_Polechova.pdf","file_size":6968201,"date_updated":"2020-07-14T12:46:01Z","content_type":"application/pdf"}],"oa_version":"Published Version","date_updated":"2023-02-23T14:10:16Z","oa":1,"author":[{"orcid":"0000-0003-0951-3112","id":"3BBFB084-F248-11E8-B48F-1D18A9856A87","first_name":"Jitka","full_name":"Polechova, Jitka","last_name":"Polechova"}],"citation":{"ista":"Polechova J. 2018. Is the sky the limit? On the expansion threshold of a species’ range. PLoS Biology. 16(6), e2005372.","mla":"Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” <i>PLoS Biology</i>, vol. 16, no. 6, e2005372, Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005372\">10.1371/journal.pbio.2005372</a>.","apa":"Polechova, J. (2018). Is the sky the limit? On the expansion threshold of a species’ range. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005372\">https://doi.org/10.1371/journal.pbio.2005372</a>","ieee":"J. Polechova, “Is the sky the limit? On the expansion threshold of a species’ range,” <i>PLoS Biology</i>, vol. 16, no. 6. Public Library of Science, 2018.","ama":"Polechova J. Is the sky the limit? On the expansion threshold of a species’ range. <i>PLoS Biology</i>. 2018;16(6). doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005372\">10.1371/journal.pbio.2005372</a>","short":"J. Polechova, PLoS Biology 16 (2018).","chicago":"Polechova, Jitka. “Is the Sky the Limit? On the Expansion Threshold of a Species’ Range.” <i>PLoS Biology</i>. Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005372\">https://doi.org/10.1371/journal.pbio.2005372</a>."},"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","has_accepted_license":"1","type":"journal_article","scopus_import":1,"file_date_updated":"2020-07-14T12:46:01Z","_id":"315","year":"2018","volume":16,"publication":"PLoS Biology","date_created":"2018-12-11T11:45:46Z","ddc":["576"],"title":"Is the sky the limit? On the expansion threshold of a species’ range","date_published":"2018-06-15T00:00:00Z","quality_controlled":"1","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"publication_status":"published","day":"15","related_material":{"record":[{"status":"public","relation":"research_data","id":"9839"}]},"month":"06","issue":"6","abstract":[{"text":"More than 100 years after Grigg’s influential analysis of species’ borders, the causes of limits to species’ ranges still represent a puzzle that has never been understood with clarity. The topic has become especially important recently as many scientists have become interested in the potential for species’ ranges to shift in response to climate change—and yet nearly all of those studies fail to recognise or incorporate evolutionary genetics in a way that relates to theoretical developments. I show that range margins can be understood based on just two measurable parameters: (i) the fitness cost of dispersal—a measure of environmental heterogeneity—and (ii) the strength of genetic drift, which reduces genetic diversity. Together, these two parameters define an ‘expansion threshold’: adaptation fails when genetic drift reduces genetic diversity below that required for adaptation to a heterogeneous environment. When the key parameters drop below this expansion threshold locally, a sharp range margin forms. When they drop below this threshold throughout the species’ range, adaptation collapses everywhere, resulting in either extinction or formation of a fragmented metapopulation. Because the effects of dispersal differ fundamentally with dimension, the second parameter—the strength of genetic drift—is qualitatively different compared to a linear habitat. In two-dimensional habitats, genetic drift becomes effectively independent of selection. It decreases with ‘neighbourhood size’—the number of individuals accessible by dispersal within one generation. Moreover, in contrast to earlier predictions, which neglected evolution of genetic variance and/or stochasticity in two dimensions, dispersal into small marginal populations aids adaptation. This is because the reduction of both genetic and demographic stochasticity has a stronger effect than the cost of dispersal through increased maladaptation. The expansion threshold thus provides a novel, theoretically justified, and testable prediction for formation of the range margin and collapse of the species’ range.","lang":"eng"}],"publist_id":"7550","doi":"10.1371/journal.pbio.2005372","status":"public","publication_identifier":{"issn":["15449173"]},"language":[{"iso":"eng"}],"intvolume":"        16","article_number":"e2005372","publisher":"Public Library of Science"},{"publication":"Genetics","volume":209,"article_processing_charge":"No","main_file_link":[{"url":"https://www.biorxiv.org/node/80098.abstract","open_access":"1"}],"year":"2018","date_created":"2018-12-11T11:45:47Z","quality_controlled":"1","project":[{"grant_number":"329960","name":"Mating system and the evolutionary dynamics of hybrid zones","_id":"25B36484-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"},{"call_identifier":"FP7","_id":"25B07788-B435-11E9-9278-68D0E5697425","grant_number":"250152","name":"Limits to selection in biology and in evolutionary computation"},{"call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme"}],"date_published":"2018-07-01T00:00:00Z","title":"Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system","citation":{"apa":"Bodova, K., Priklopil, T., Field, D., Barton, N. H., &#38; Pickup, M. (2018). Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.118.300748\">https://doi.org/10.1534/genetics.118.300748</a>","mla":"Bodova, Katarina, et al. “Evolutionary Pathways for the Generation of New Self-Incompatibility Haplotypes in a Non-Self Recognition System.” <i>Genetics</i>, vol. 209, no. 3, Genetics Society of America, 2018, pp. 861–83, doi:<a href=\"https://doi.org/10.1534/genetics.118.300748\">10.1534/genetics.118.300748</a>.","ista":"Bodova K, Priklopil T, Field D, Barton NH, Pickup M. 2018. Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. Genetics. 209(3), 861–883.","chicago":"Bodova, Katarina, Tadeas Priklopil, David Field, Nicholas H Barton, and Melinda Pickup. “Evolutionary Pathways for the Generation of New Self-Incompatibility Haplotypes in a Non-Self Recognition System.” <i>Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/genetics.118.300748\">https://doi.org/10.1534/genetics.118.300748</a>.","ama":"Bodova K, Priklopil T, Field D, Barton NH, Pickup M. Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system. <i>Genetics</i>. 2018;209(3):861-883. doi:<a href=\"https://doi.org/10.1534/genetics.118.300748\">10.1534/genetics.118.300748</a>","short":"K. Bodova, T. Priklopil, D. Field, N.H. Barton, M. Pickup, Genetics 209 (2018) 861–883.","ieee":"K. Bodova, T. Priklopil, D. Field, N. H. Barton, and M. Pickup, “Evolutionary pathways for the generation of new self-incompatibility haplotypes in a non-self recognition system,” <i>Genetics</i>, vol. 209, no. 3. Genetics Society of America, pp. 861–883, 2018."},"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa":1,"author":[{"last_name":"Bodova","full_name":"Bodova, Katarina","id":"2BA24EA0-F248-11E8-B48F-1D18A9856A87","first_name":"Katarina","orcid":"0000-0002-7214-0171"},{"last_name":"Priklopil","id":"3C869AA0-F248-11E8-B48F-1D18A9856A87","first_name":"Tadeas","full_name":"Priklopil, Tadeas"},{"last_name":"Field","orcid":"0000-0002-4014-8478","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","full_name":"Field, David"},{"last_name":"Barton","orcid":"0000-0002-8548-5240","full_name":"Barton, Nicholas H","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","first_name":"Nicholas H"},{"last_name":"Pickup","orcid":"0000-0001-6118-0541","first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","full_name":"Pickup, Melinda"}],"date_updated":"2025-05-28T11:42:44Z","oa_version":"Preprint","department":[{"_id":"NiBa"},{"_id":"GaTk"}],"type":"journal_article","scopus_import":"1","external_id":{"isi":["000437171700017"]},"_id":"316","language":[{"iso":"eng"}],"page":"861-883","article_type":"original","intvolume":"       209","publisher":"Genetics Society of America","day":"01","ec_funded":1,"publication_status":"published","isi":1,"related_material":{"record":[{"status":"public","id":"9813","relation":"research_data"}],"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/recognizing-others-but-not-yourself-new-insights-into-the-evolution-of-plant-mating/","relation":"press_release"}]},"month":"07","doi":"10.1534/genetics.118.300748","abstract":[{"text":"Self-incompatibility (SI) is a genetically based recognition system that functions to prevent self-fertilization and mating among related plants. An enduring puzzle in SI is how the high diversity observed in nature arises and is maintained. Based on the underlying recognition mechanism, SI can be classified into two main groups: self- and non-self recognition. Most work has focused on diversification within self-recognition systems despite expected differences between the two groups in the evolutionary pathways and outcomes of diversification. Here, we use a deterministic population genetic model and stochastic simulations to investigate how novel S-haplotypes evolve in a gametophytic non-self recognition (SRNase/S Locus F-box (SLF)) SI system. For this model the pathways for diversification involve either the maintenance or breakdown of SI and can vary in the order of mutations of the female (SRNase) and male (SLF) components. We show analytically that diversification can occur with high inbreeding depression and self-pollination, but this varies with evolutionary pathway and level of completeness (which determines the number of potential mating partners in the population), and in general is more likely for lower haplotype number. The conditions for diversification are broader in stochastic simulations of finite population size. However, the number of haplotypes observed under high inbreeding and moderate to high self-pollination is less than that commonly observed in nature. Diversification was observed through pathways that maintain SI as well as through self-compatible intermediates. Yet the lifespan of diversified haplotypes was sensitive to their level of completeness. By examining diversification in a non-self recognition SI system, this model extends our understanding of the evolution and maintenance of haplotype diversity observed in a self recognition system common in flowering plants.","lang":"eng"}],"issue":"3","status":"public"},{"type":"journal_article","pubrep_id":"1016","author":[{"last_name":"Brauns","first_name":"Matthias","id":"33F94E3C-F248-11E8-B48F-1D18A9856A87","full_name":"Brauns, Matthias"},{"full_name":"Amitonov, Sergey","first_name":"Sergey","last_name":"Amitonov"},{"last_name":"Spruijtenburg","full_name":"Spruijtenburg, Paul","first_name":"Paul"},{"first_name":"Floris","full_name":"Zwanenburg, Floris","last_name":"Zwanenburg"}],"oa":1,"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"chicago":"Brauns, Matthias, Sergey Amitonov, Paul Spruijtenburg, and Floris Zwanenburg. “Palladium Gates for Reproducible Quantum Dots in Silicon.” <i>Scientific Reports</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41598-018-24004-y\">https://doi.org/10.1038/s41598-018-24004-y</a>.","ama":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. Palladium gates for reproducible quantum dots in silicon. <i>Scientific Reports</i>. 2018;8(1). doi:<a href=\"https://doi.org/10.1038/s41598-018-24004-y\">10.1038/s41598-018-24004-y</a>","short":"M. Brauns, S. Amitonov, P. Spruijtenburg, F. Zwanenburg, Scientific Reports 8 (2018).","ieee":"M. Brauns, S. Amitonov, P. Spruijtenburg, and F. Zwanenburg, “Palladium gates for reproducible quantum dots in silicon,” <i>Scientific Reports</i>, vol. 8, no. 1. Nature Publishing Group, 2018.","mla":"Brauns, Matthias, et al. “Palladium Gates for Reproducible Quantum Dots in Silicon.” <i>Scientific Reports</i>, vol. 8, no. 1, 5690, Nature Publishing Group, 2018, doi:<a href=\"https://doi.org/10.1038/s41598-018-24004-y\">10.1038/s41598-018-24004-y</a>.","apa":"Brauns, M., Amitonov, S., Spruijtenburg, P., &#38; Zwanenburg, F. (2018). Palladium gates for reproducible quantum dots in silicon. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41598-018-24004-y\">https://doi.org/10.1038/s41598-018-24004-y</a>","ista":"Brauns M, Amitonov S, Spruijtenburg P, Zwanenburg F. 2018. Palladium gates for reproducible quantum dots in silicon. Scientific Reports. 8(1), 5690."},"department":[{"_id":"GeKa"}],"file":[{"creator":"system","relation":"main_file","checksum":"20af238ca4ba6491b77270be8d826bf5","file_size":1850530,"content_type":"application/pdf","date_updated":"2020-07-14T12:46:02Z","file_name":"IST-2018-1016-v1+1_2018_Brauns_Palladium_gates.pdf","date_created":"2018-12-12T10:17:04Z","file_id":"5256","access_level":"open_access"}],"oa_version":"Published Version","date_updated":"2023-09-13T09:38:00Z","_id":"317","scopus_import":"1","file_date_updated":"2020-07-14T12:46:02Z","external_id":{"isi":["000429404300013"]},"date_created":"2018-12-11T11:45:47Z","ddc":["539"],"volume":8,"article_processing_charge":"No","publication":"Scientific Reports","year":"2018","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"quality_controlled":"1","date_published":"2018-04-09T00:00:00Z","title":"Palladium gates for reproducible quantum dots in silicon","month":"04","isi":1,"day":"09","publication_status":"published","status":"public","publist_id":"7548","abstract":[{"lang":"eng","text":"We replace the established aluminium gates for the formation of quantum dots in silicon with gates made from palladium. We study the morphology of both aluminium and palladium gates with transmission electron microscopy. The native aluminium oxide is found to be formed all around the aluminium gates, which could lead to the formation of unintentional dots. Therefore, we report on a novel fabrication route that replaces aluminium and its native oxide by palladium with atomic-layer-deposition-grown aluminium oxide. Using this approach, we show the formation of low-disorder gate-defined quantum dots, which are reproducibly fabricated. Furthermore, palladium enables us to further shrink the gate design, allowing us to perform electron transport measurements in the few-electron regime in devices comprising only two gate layers, a major technological advancement. It remains to be seen, whether the introduction of palladium gates can improve the excellent results on electron and nuclear spin qubits defined with an aluminium gate stack."}],"doi":"10.1038/s41598-018-24004-y","issue":"1","intvolume":"         8","article_number":"5690","language":[{"iso":"eng"}],"publisher":"Nature Publishing Group"},{"type":"journal_article","oa":1,"author":[{"last_name":"Casano","first_name":"Alessandra M","full_name":"Casano, Alessandra M","id":"3DBA3F4E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6009-6804"},{"first_name":"Michael K","full_name":"Sixt, Michael K","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6620-9179","last_name":"Sixt"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"ista":"Casano AM, Sixt MK. 2018. A fat lot of good for wound healing. Developmental Cell. 44(4), 405–406.","apa":"Casano, A. M., &#38; Sixt, M. K. (2018). A fat lot of good for wound healing. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">https://doi.org/10.1016/j.devcel.2018.02.009</a>","mla":"Casano, Alessandra M., and Michael K. Sixt. “A Fat Lot of Good for Wound Healing.” <i>Developmental Cell</i>, vol. 44, no. 4, Cell Press, 2018, pp. 405–06, doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">10.1016/j.devcel.2018.02.009</a>.","ieee":"A. M. Casano and M. K. Sixt, “A fat lot of good for wound healing,” <i>Developmental Cell</i>, vol. 44, no. 4. Cell Press, pp. 405–406, 2018.","ama":"Casano AM, Sixt MK. A fat lot of good for wound healing. <i>Developmental Cell</i>. 2018;44(4):405-406. doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">10.1016/j.devcel.2018.02.009</a>","short":"A.M. Casano, M.K. Sixt, Developmental Cell 44 (2018) 405–406.","chicago":"Casano, Alessandra M, and Michael K Sixt. “A Fat Lot of Good for Wound Healing.” <i>Developmental Cell</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.devcel.2018.02.009\">https://doi.org/10.1016/j.devcel.2018.02.009</a>."},"department":[{"_id":"MiSi"}],"oa_version":"Published Version","date_updated":"2023-09-08T11:42:28Z","_id":"318","scopus_import":"1","external_id":{"pmid":["29486189"],"isi":["000426150700002"]},"date_created":"2018-12-11T11:45:47Z","article_processing_charge":"No","volume":44,"publication":"Developmental Cell","main_file_link":[{"open_access":"1","url":"https://www.ncbi.nlm.nih.gov/pubmed/29486189"}],"year":"2018","quality_controlled":"1","date_published":"2018-02-26T00:00:00Z","title":"A fat lot of good for wound healing","month":"02","isi":1,"day":"26","publication_status":"published","acknowledgement":"Short Survey","pmid":1,"status":"public","publist_id":"7547","abstract":[{"text":"The insect’s fat body combines metabolic and immunological functions. In this issue of Developmental Cell, Franz et al. (2018) show that in Drosophila, cells of the fat body are not static, but can actively “swim” toward sites of epithelial injury, where they physically clog the wound and locally secrete antimicrobial peptides.","lang":"eng"}],"doi":"10.1016/j.devcel.2018.02.009","issue":"4","page":"405 - 406","intvolume":"        44","language":[{"iso":"eng"}],"publisher":"Cell Press"},{"tmp":{"image":"/images/cc_by_nc_nd.png","short":"CC BY-NC-ND (4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)"},"title":"In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2","date_published":"2018-10-23T00:00:00Z","quality_controlled":"1","ddc":["570"],"date_created":"2018-12-11T11:44:16Z","year":"2018","publication":"Cell Reports","volume":25,"article_processing_charge":"No","_id":"32","external_id":{"isi":["000448219500005"]},"file_date_updated":"2020-07-14T12:46:03Z","scopus_import":"1","type":"journal_article","date_updated":"2023-09-11T14:13:32Z","oa_version":"Published Version","department":[{"_id":"SaSi"}],"file":[{"file_size":4461997,"date_updated":"2020-07-14T12:46:03Z","content_type":"application/pdf","file_name":"2018_CellReports_Chen.pdf","date_created":"2018-12-17T12:42:57Z","file_id":"5703","access_level":"open_access","creator":"dernst","relation":"main_file","checksum":"d9f74277fd57176e04732707d575cf08"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ista":"Chen T, Kula B, Nagy B, Barzan R, Gall A, Ehrlich I, Kukley M. 2018. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. Cell Reports. 25(4), 852–861.e7.","mla":"Chen, Ting, et al. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” <i>Cell Reports</i>, vol. 25, no. 4, Elsevier, 2018, p. 852–861.e7, doi:<a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">10.1016/j.celrep.2018.09.066</a>.","apa":"Chen, T., Kula, B., Nagy, B., Barzan, R., Gall, A., Ehrlich, I., &#38; Kukley, M. (2018). In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. <i>Cell Reports</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">https://doi.org/10.1016/j.celrep.2018.09.066</a>","ieee":"T. Chen <i>et al.</i>, “In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2,” <i>Cell Reports</i>, vol. 25, no. 4. Elsevier, p. 852–861.e7, 2018.","short":"T. Chen, B. Kula, B. Nagy, R. Barzan, A. Gall, I. Ehrlich, M. Kukley, Cell Reports 25 (2018) 852–861.e7.","ama":"Chen T, Kula B, Nagy B, et al. In Vivo regulation of Oligodendrocyte processor cell proliferation and differentiation by the AMPA-receptor Subunit GluA2. <i>Cell Reports</i>. 2018;25(4):852-861.e7. doi:<a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">10.1016/j.celrep.2018.09.066</a>","chicago":"Chen, Ting, Bartosz Kula, Balint Nagy, Ruxandra Barzan, Andrea Gall, Ingrid Ehrlich, and Maria Kukley. “In Vivo Regulation of Oligodendrocyte Processor Cell Proliferation and Differentiation by the AMPA-Receptor Subunit GluA2.” <i>Cell Reports</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.celrep.2018.09.066\">https://doi.org/10.1016/j.celrep.2018.09.066</a>."},"oa":1,"author":[{"last_name":"Chen","full_name":"Chen, Ting","first_name":"Ting"},{"first_name":"Bartosz","full_name":"Kula, Bartosz","last_name":"Kula"},{"last_name":"Nagy","first_name":"Balint","id":"30F830CE-02D1-11E9-9BAA-DAF4881429F2","full_name":"Nagy, Balint","orcid":"0000-0002-4002-4686"},{"first_name":"Ruxandra","full_name":"Barzan, Ruxandra","last_name":"Barzan"},{"last_name":"Gall","first_name":"Andrea","full_name":"Gall, Andrea"},{"last_name":"Ehrlich","first_name":"Ingrid","full_name":"Ehrlich, Ingrid"},{"last_name":"Kukley","first_name":"Maria","full_name":"Kukley, Maria"}],"publisher":"Elsevier","intvolume":"        25","page":"852 - 861.e7","language":[{"iso":"eng"}],"status":"public","issue":"4","abstract":[{"text":"The functional role of AMPA receptor (AMPAR)-mediated synaptic signaling between neurons and oligodendrocyte precursor cells (OPCs) remains enigmatic. We modified the properties of AMPARs at axon-OPC synapses in the mouse corpus callosum in vivo during the peak of myelination by targeting the GluA2 subunit. Expression of the unedited (Ca2+ permeable) or the pore-dead GluA2 subunit of AMPARs triggered proliferation of OPCs and reduced their differentiation into oligodendrocytes. Expression of the cytoplasmic C-terminal (GluA2(813-862)) of the GluA2 subunit (C-tail), a modification designed to affect the interaction between GluA2 and AMPAR-binding proteins and to perturb trafficking of GluA2-containing AMPARs, decreased the differentiation of OPCs without affecting their proliferation. These findings suggest that ionotropic and non-ionotropic properties of AMPARs in OPCs, as well as specific aspects of AMPAR-mediated signaling at axon-OPC synapses in the mouse corpus callosum, are important for balancing the response of OPCs to proliferation and differentiation cues. In the brain, oligodendrocyte precursor cells (OPCs) receive glutamatergic AMPA-receptor-mediated synaptic input from neurons. Chen et al. show that modifying AMPA-receptor properties at axon-OPC synapses alters proliferation and differentiation of OPCs. This expands the traditional view of synaptic transmission by suggesting neurons also use synapses to modulate behavior of glia.","lang":"eng"}],"doi":"10.1016/j.celrep.2018.09.066","publist_id":"8023","isi":1,"month":"10","acknowledgement":"This work was supported by Deutsche Forschungsgemeinschaft (DFG) grant KU2569/1-1 (to M.K.); DFG project EXC307Centre for Integrative Neuroscience (CIN), including grant Pool Project 2011-12 (jointly to M.K. and I.E.); and the Charitable Hertie Foundation (to I.E.). CIN is an Excellence Cluster funded by the DFG within the framework of the Excellence Initiative for 2008–2018. M.K. is supported by the Tistou & Charlotte Kerstan Foundation.","publication_status":"published","day":"23"},{"day":"04","ec_funded":1,"publication_status":"published","isi":1,"related_material":{"link":[{"description":"News on IST Homepage","relation":"press_release","url":"https://ist.ac.at/en/news/a-certain-type-of-neurons-is-more-energy-efficient-than-previously-assumed/"}]},"month":"04","doi":"10.1016/j.neuron.2018.02.024","publist_id":"7545","abstract":[{"lang":"eng","text":"Fast-spiking, parvalbumin-expressing GABAergic interneurons (PV+-BCs) express a complex machinery of rapid signaling mechanisms, including specialized voltage-gated ion channels to generate brief action potentials (APs). However, short APs are associated with overlapping Na+ and K+ fluxes and are therefore energetically expensive. How the potentially vicious combination of high AP frequency and inefficient spike generation can be reconciled with limited energy supply is presently unclear. To address this question, we performed direct recordings from the PV+-BC axon, the subcellular structure where active conductances for AP initiation and propagation are located. Surprisingly, the energy required for the AP was, on average, only ∼1.6 times the theoretical minimum. High energy efficiency emerged from the combination of fast inactivation of Na+ channels and delayed activation of Kv3-type K+ channels, which minimized ion flux overlap during APs. Thus, the complementary tuning of axonal Na+ and K+ channel gating optimizes both fast signaling properties and metabolic efficiency. Hu et al. demonstrate that action potentials in parvalbumin-expressing GABAergic interneuron axons are energetically efficient, which is highly unexpected given their brief duration. High energy efficiency emerges from the combination of fast inactivation of voltage-gated Na+ channels and delayed activation of Kv3 channels in the axon. "}],"issue":"1","status":"public","language":[{"iso":"eng"}],"page":"156 - 165","intvolume":"        98","publisher":"Elsevier","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","has_accepted_license":"1","citation":{"ieee":"H. Hu, F. Roth, D. H. Vandael, and P. M. Jonas, “Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons,” <i>Neuron</i>, vol. 98, no. 1. Elsevier, pp. 156–165, 2018.","chicago":"Hu, Hua, Fabian Roth, David H Vandael, and Peter M Jonas. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” <i>Neuron</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">https://doi.org/10.1016/j.neuron.2018.02.024</a>.","ama":"Hu H, Roth F, Vandael DH, Jonas PM. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. <i>Neuron</i>. 2018;98(1):156-165. doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">10.1016/j.neuron.2018.02.024</a>","short":"H. Hu, F. Roth, D.H. Vandael, P.M. Jonas, Neuron 98 (2018) 156–165.","apa":"Hu, H., Roth, F., Vandael, D. H., &#38; Jonas, P. M. (2018). Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">https://doi.org/10.1016/j.neuron.2018.02.024</a>","mla":"Hu, Hua, et al. “Complementary Tuning of Na+ and K+ Channel Gating Underlies Fast and Energy-Efficient Action Potentials in GABAergic Interneuron Axons.” <i>Neuron</i>, vol. 98, no. 1, Elsevier, 2018, pp. 156–65, doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.02.024\">10.1016/j.neuron.2018.02.024</a>.","ista":"Hu H, Roth F, Vandael DH, Jonas PM. 2018. Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons. Neuron. 98(1), 156–165."},"author":[{"full_name":"Hu, Hua","first_name":"Hua","id":"4AC0145C-F248-11E8-B48F-1D18A9856A87","last_name":"Hu"},{"full_name":"Roth, Fabian","first_name":"Fabian","last_name":"Roth"},{"first_name":"David H","full_name":"Vandael, David H","id":"3AE48E0A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7577-1676","last_name":"Vandael"},{"orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","first_name":"Peter M","last_name":"Jonas"}],"oa":1,"oa_version":"Published Version","date_updated":"2023-09-11T12:45:10Z","file":[{"checksum":"76070f3729f9c603e1080d0151aa2b11","relation":"main_file","creator":"dernst","access_level":"open_access","file_id":"5690","date_created":"2018-12-17T10:37:50Z","file_name":"2018_Neuron_Hu.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:46:03Z","file_size":3180444}],"department":[{"_id":"PeJo"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:03Z","scopus_import":"1","external_id":{"isi":["000429192100016"]},"_id":"320","publication":"Neuron","volume":98,"article_processing_charge":"Yes (in subscription journal)","year":"2018","ddc":["570"],"date_created":"2018-12-11T11:45:48Z","quality_controlled":"1","project":[{"grant_number":"268548","name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","call_identifier":"FP7","_id":"25C0F108-B435-11E9-9278-68D0E5697425"},{"call_identifier":"H2020","_id":"25B7EB9E-B435-11E9-9278-68D0E5697425","name":"Biophysics and circuit function of a giant cortical glumatergic synapse","grant_number":"692692"},{"call_identifier":"FWF","_id":"25C26B1E-B435-11E9-9278-68D0E5697425","grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses"},{"call_identifier":"FWF","_id":"25C5A090-B435-11E9-9278-68D0E5697425","grant_number":"Z00312","name":"The Wittgenstein Prize"}],"title":"Complementary tuning of Na+ and K+ channel gating underlies fast and energy-efficient action potentials in GABAergic interneuron axons","date_published":"2018-04-04T00:00:00Z","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"}},{"publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","article_processing_charge":"No","volume":40,"year":"2018","ddc":["000"],"date_created":"2018-12-11T11:45:48Z","quality_controlled":"1","title":"Guest editors' introduction to the special section on learning with Shared information for computer vision and multimedia analysis","date_published":"2018-05-01T00:00:00Z","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","citation":{"chicago":"Darrell, Trevor, Christoph Lampert, Nico Sebe, Ying Wu, and Yan Yan. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2018. <a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">https://doi.org/10.1109/TPAMI.2018.2804998</a>.","ama":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2018;40(5):1029-1031. doi:<a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">10.1109/TPAMI.2018.2804998</a>","short":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, Y. Yan, IEEE Transactions on Pattern Analysis and Machine Intelligence 40 (2018) 1029–1031.","ieee":"T. Darrell, C. Lampert, N. Sebe, Y. Wu, and Y. Yan, “Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 5. IEEE, pp. 1029–1031, 2018.","mla":"Darrell, Trevor, et al. “Guest Editors’ Introduction to the Special Section on Learning with Shared Information for Computer Vision and Multimedia Analysis.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 40, no. 5, IEEE, 2018, pp. 1029–31, doi:<a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">10.1109/TPAMI.2018.2804998</a>.","apa":"Darrell, T., Lampert, C., Sebe, N., Wu, Y., &#38; Yan, Y. (2018). Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2018.2804998\">https://doi.org/10.1109/TPAMI.2018.2804998</a>","ista":"Darrell T, Lampert C, Sebe N, Wu Y, Yan Y. 2018. Guest editors’ introduction to the special section on learning with Shared information for computer vision and multimedia analysis. IEEE Transactions on Pattern Analysis and Machine Intelligence. 40(5), 1029–1031."},"has_accepted_license":"1","oa":1,"author":[{"last_name":"Darrell","first_name":"Trevor","full_name":"Darrell, Trevor"},{"last_name":"Lampert","orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","first_name":"Christoph","full_name":"Lampert, Christoph"},{"last_name":"Sebe","full_name":"Sebe, Nico","first_name":"Nico"},{"last_name":"Wu","full_name":"Wu, Ying","first_name":"Ying"},{"last_name":"Yan","first_name":"Yan","full_name":"Yan, Yan"}],"date_updated":"2023-09-11T14:07:54Z","oa_version":"Published Version","file":[{"date_updated":"2020-07-14T12:46:03Z","content_type":"application/pdf","file_size":141724,"file_name":"2018_IEEE_Darrell.pdf","file_id":"7835","date_created":"2020-05-14T12:50:48Z","access_level":"open_access","creator":"dernst","checksum":"b19c75da06faf3291a3ca47dfa50ef63","relation":"main_file"}],"department":[{"_id":"ChLa"}],"type":"journal_article","file_date_updated":"2020-07-14T12:46:03Z","scopus_import":"1","external_id":{"isi":["000428901200001"]},"_id":"321","language":[{"iso":"eng"}],"article_type":"original","page":"1029 - 1031","intvolume":"        40","publisher":"IEEE","day":"01","publication_status":"published","isi":1,"month":"05","publist_id":"7544","doi":"10.1109/TPAMI.2018.2804998","abstract":[{"lang":"eng","text":"The twelve papers in this special section focus on learning systems with shared information for computer vision and multimedia communication analysis. In the real world, a realistic setting for computer vision or multimedia recognition problems is that we have some classes containing lots of training data and many classes containing a small amount of training data. Therefore, how to use frequent classes to help learning rare classes for which it is harder to collect the training data is an open question. Learning with shared information is an emerging topic in machine learning, computer vision and multimedia analysis. There are different levels of components that can be shared during concept modeling and machine learning stages, such as sharing generic object parts, sharing attributes, sharing transformations, sharing regularization parameters and sharing training examples, etc. Regarding the specific methods, multi-task learning, transfer learning and deep learning can be seen as using different strategies to share information. These learning with shared information methods are very effective in solving real-world large-scale problems."}],"issue":"5","status":"public"}]