[{"user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","status":"public","title":"Robust multi-property combiners for hash functions","month":"07","abstract":[{"lang":"eng","text":"A robust combiner for hash functions takes two candidate implementations and constructs a hash function which is secure as long as at least one of the candidates is secure. So far, hash function combiners only aim at preserving a single property such as collision-resistance or pseudorandomness. However, when hash functions are used in protocols like TLS they are often required to provide several properties simultaneously. We therefore put forward the notion of robust multi-property combiners and elaborate on different definitions for such combiners. We then propose a combiner that provably preserves (target) collision-resistance, pseudorandomness, and being a secure message authentication code. This combiner satisfies the strongest notion we propose, which requires that the combined function satisfies every security property which is satisfied by at least one of the underlying hash function. If the underlying hash functions have output length n, the combiner has output length 2 n. This basically matches a known lower bound for black-box combiners for collision-resistance only, thus the other properties can be achieved without penalizing the length of the hash values. We then propose a combiner which also preserves the property of being indifferentiable from a random oracle, slightly increasing the output length to 2 n+ω(log n). Moreover, we show how to augment our constructions in order to make them also robust for the one-wayness property, but in this case require an a priory upper bound on the input length."}],"issue":"3","date_updated":"2023-02-23T11:17:53Z","year":"2014","day":"01","author":[{"full_name":"Fischlin, Marc","last_name":"Fischlin","first_name":"Marc"},{"first_name":"Anja","last_name":"Lehmann","full_name":"Lehmann, Anja"},{"orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","last_name":"Pietrzak","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","full_name":"Pietrzak, Krzysztof Z"}],"_id":"2852","scopus_import":1,"publist_id":"3940","intvolume":"        27","citation":{"ama":"Fischlin M, Lehmann A, Pietrzak KZ. Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. 2014;27(3):397-428. doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>","ieee":"M. Fischlin, A. Lehmann, and K. Z. Pietrzak, “Robust multi-property combiners for hash functions,” <i>Journal of Cryptology</i>, vol. 27, no. 3. Springer, pp. 397–428, 2014.","short":"M. Fischlin, A. Lehmann, K.Z. Pietrzak, Journal of Cryptology 27 (2014) 397–428.","chicago":"Fischlin, Marc, Anja Lehmann, and Krzysztof Z Pietrzak. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>. Springer, 2014. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>.","apa":"Fischlin, M., Lehmann, A., &#38; Pietrzak, K. Z. (2014). Robust multi-property combiners for hash functions. <i>Journal of Cryptology</i>. Springer. <a href=\"https://doi.org/10.1007/s00145-013-9148-7\">https://doi.org/10.1007/s00145-013-9148-7</a>","ista":"Fischlin M, Lehmann A, Pietrzak KZ. 2014. Robust multi-property combiners for hash functions. Journal of Cryptology. 27(3), 397–428.","mla":"Fischlin, Marc, et al. “Robust Multi-Property Combiners for Hash Functions.” <i>Journal of Cryptology</i>, vol. 27, no. 3, Springer, 2014, pp. 397–428, doi:<a href=\"https://doi.org/10.1007/s00145-013-9148-7\">10.1007/s00145-013-9148-7</a>."},"quality_controlled":"1","volume":27,"related_material":{"record":[{"id":"3225","relation":"earlier_version","status":"public"}]},"doi":"10.1007/s00145-013-9148-7","publication_status":"published","publication":"Journal of Cryptology","date_created":"2018-12-11T11:59:56Z","page":"397 - 428","oa_version":"None","type":"journal_article","date_published":"2014-07-01T00:00:00Z","department":[{"_id":"KrPi"}],"language":[{"iso":"eng"}]},{"citation":{"ista":"Edelsbrunner H, Morozovy D. 2014. Persistent homology: Theory and practice. ECM: European Congress of Mathematics, 31–50.","apa":"Edelsbrunner, H., &#38; Morozovy, D. (2014). Persistent homology: Theory and practice (pp. 31–50). Presented at the ECM: European Congress of Mathematics, Kraków, Poland: European Mathematical Society Publishing House. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>","mla":"Edelsbrunner, Herbert, and Dmitriy Morozovy. <i>Persistent Homology: Theory and Practice</i>. European Mathematical Society Publishing House, 2014, pp. 31–50, doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>.","chicago":"Edelsbrunner, Herbert, and Dmitriy Morozovy. “Persistent Homology: Theory and Practice,” 31–50. European Mathematical Society Publishing House, 2014. <a href=\"https://doi.org/10.4171/120-1/3\">https://doi.org/10.4171/120-1/3</a>.","short":"H. Edelsbrunner, D. Morozovy, in:, European Mathematical Society Publishing House, 2014, pp. 31–50.","ieee":"H. Edelsbrunner and D. Morozovy, “Persistent homology: Theory and practice,” presented at the ECM: European Congress of Mathematics, Kraków, Poland, 2014, pp. 31–50.","ama":"Edelsbrunner H, Morozovy D. Persistent homology: Theory and practice. In: European Mathematical Society Publishing House; 2014:31-50. doi:<a href=\"https://doi.org/10.4171/120-1/3\">10.4171/120-1/3</a>"},"ddc":["000"],"file_date_updated":"2020-07-14T12:45:52Z","date_published":"2014-01-01T00:00:00Z","oa_version":"Submitted Version","doi":"10.4171/120-1/3","publication_status":"published","conference":{"location":"Kraków, Poland","end_date":"2012-07-07","name":"ECM: European Congress of Mathematics","start_date":"2012-07-02"},"month":"01","oa":1,"status":"public","_id":"2905","year":"2014","abstract":[{"text":"Persistent homology is a recent grandchild of homology that has found use in\r\nscience and engineering as well as in mathematics. This paper surveys the method as well\r\nas the applications, neglecting completeness in favor of highlighting ideas and directions.","lang":"eng"}],"date_updated":"2021-01-12T07:00:36Z","quality_controlled":"1","pubrep_id":"544","article_processing_charge":"No","publist_id":"3842","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"type":"conference","page":"31 - 50","date_created":"2018-12-11T12:00:16Z","has_accepted_license":"1","title":"Persistent homology: Theory and practice","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"European Mathematical Society Publishing House","file":[{"relation":"main_file","content_type":"application/pdf","file_size":435320,"file_name":"IST-2016-544-v1+1_2012-P-11-PHTheoryPractice.pdf","date_updated":"2020-07-14T12:45:52Z","date_created":"2018-12-12T10:16:43Z","checksum":"1d4a046f1af945c407c5c4d411d4c5e4","creator":"system","file_id":"5232","access_level":"open_access"}],"author":[{"full_name":"Edelsbrunner, Herbert","orcid":"0000-0002-9823-6833","first_name":"Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","last_name":"Edelsbrunner"},{"full_name":"Morozovy, Dmitriy","last_name":"Morozovy","first_name":"Dmitriy"}],"day":"01","acknowledgement":"This research is partially supported by NSF under grant DBI-0820624, by ESF under the Research Networking Programme, and by the Russian Government Project 11.G34.31.0053."},{"date_updated":"2021-01-12T07:42:14Z","abstract":[{"lang":"eng","text":"Adaptation in the retina is thought to optimize the encoding of natural light signals into sequences of spikes sent to the brain. While adaptive changes in retinal processing to the variations of the mean luminance level and second-order stimulus statistics have been documented before, no such measurements have been performed when higher-order moments of the light distribution change. We therefore measured the ganglion cell responses in the tiger salamander retina to controlled changes in the second (contrast), third (skew) and fourth (kurtosis) moments of the light intensity distribution of spatially uniform temporally independent stimuli. The skew and kurtosis of the stimuli were chosen to cover the range observed in natural scenes. We quantified adaptation in ganglion cells by studying linear-nonlinear models that capture well the retinal encoding properties across all stimuli. We found that the encoding properties of retinal ganglion cells change only marginally when higher-order statistics change, compared to the changes observed in response to the variation in contrast. By analyzing optimal coding in LN-type models, we showed that neurons can maintain a high information rate without large dynamic adaptation to changes in skew or kurtosis. This is because, for uncorrelated stimuli, spatio-temporal summation within the receptive field averages away non-gaussian aspects of the light intensity distribution."}],"issue":"1","year":"2014","article_number":"e85841","_id":"3263","status":"public","oa":1,"month":"01","publication_status":"published","doi":"10.1371/journal.pone.0085841","oa_version":"Published Version","date_published":"2014-01-21T00:00:00Z","file_date_updated":"2020-07-14T12:46:06Z","scopus_import":1,"ddc":["570"],"citation":{"apa":"Tkačik, G., Ghosh, A., Schneidman, E., &#38; Segev, R. (2014). Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>","ista":"Tkačik G, Ghosh A, Schneidman E, Segev R. 2014. Adaptation to changes in higher-order stimulus statistics in the salamander retina. PLoS One. 9(1), e85841.","mla":"Tkačik, Gašper, et al. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>, vol. 9, no. 1, e85841, Public Library of Science, 2014, doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>.","chicago":"Tkačik, Gašper, Anandamohan Ghosh, Elad Schneidman, and Ronen Segev. “Adaptation to Changes in Higher-Order Stimulus Statistics in the Salamander Retina.” <i>PLoS One</i>. Public Library of Science, 2014. <a href=\"https://doi.org/10.1371/journal.pone.0085841\">https://doi.org/10.1371/journal.pone.0085841</a>.","ama":"Tkačik G, Ghosh A, Schneidman E, Segev R. Adaptation to changes in higher-order stimulus statistics in the salamander retina. <i>PLoS One</i>. 2014;9(1). doi:<a href=\"https://doi.org/10.1371/journal.pone.0085841\">10.1371/journal.pone.0085841</a>","ieee":"G. Tkačik, A. Ghosh, E. Schneidman, and R. Segev, “Adaptation to changes in higher-order stimulus statistics in the salamander retina,” <i>PLoS One</i>, vol. 9, no. 1. Public Library of Science, 2014.","short":"G. Tkačik, A. Ghosh, E. Schneidman, R. Segev, PLoS One 9 (2014)."},"intvolume":"         9","acknowledgement":"This work was supported by The Israel Science Foundation and The Human Frontiers Science Program.\r\nWe thank the referees for helping significantly improve this paper. We also thank Vijay Balasubramanian, Kristina Simmons, and Jason Prentice for stimulating discussions. GT wishes to thank the faculty and students of the “Methods in Computational Neuroscience” course at Marine Biological Laboratory, Woods Hole.\r\n","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"21","author":[{"full_name":"Tkacik, Gasper","orcid":"0000-0002-6699-1455","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","last_name":"Tkacik"},{"full_name":"Ghosh, Anandamohan","last_name":"Ghosh","first_name":"Anandamohan"},{"last_name":"Schneidman","first_name":"Elad","full_name":"Schneidman, Elad"},{"full_name":"Segev, Ronen","last_name":"Segev","first_name":"Ronen"}],"file":[{"relation":"main_file","content_type":"application/pdf","file_size":1568524,"creator":"system","file_id":"5011","checksum":"1d5816b343abe5eadc3eb419bcece971","access_level":"open_access","date_updated":"2020-07-14T12:46:06Z","file_name":"IST-2016-432-v1+1_journal.pone.0085841.pdf","date_created":"2018-12-12T10:13:28Z"}],"publisher":"Public Library of Science","user_id":"3FFCCD3A-F248-11E8-B48F-1D18A9856A87","title":"Adaptation to changes in higher-order stimulus statistics in the salamander retina","has_accepted_license":"1","date_created":"2018-12-11T12:02:20Z","publication":"PLoS One","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"publist_id":"3385","pubrep_id":"432","quality_controlled":"1","volume":9},{"volume":8871,"quality_controlled":"1","external_id":{"arxiv":["1305.4519"]},"related_material":{"record":[{"relation":"later_version","status":"public","id":"1642"}]},"article_processing_charge":"No","type":"conference","department":[{"_id":"UlWa"}],"language":[{"iso":"eng"}],"publication":"International Symposium on Graph Drawing","page":"428-436","date_created":"2022-02-25T10:32:14Z","alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","title":"Clustered planarity testing revisited","author":[{"id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87","last_name":"Fulek","orcid":"0000-0001-8485-1774","first_name":"Radoslav","full_name":"Fulek, Radoslav"},{"full_name":"Kynčl, Jan","first_name":"Jan","last_name":"Kynčl"},{"last_name":"Malinović","first_name":"Igor","full_name":"Malinović, Igor"},{"full_name":"Pálvölgyi, Dömötör","first_name":"Dömötör","last_name":"Pálvölgyi"}],"day":"01","intvolume":"      8871","citation":{"ieee":"R. Fulek, J. Kynčl, I. Malinović, and D. Pálvölgyi, “Clustered planarity testing revisited,” in <i>International Symposium on Graph Drawing</i>, 2014, vol. 8871, pp. 428–436.","ama":"Fulek R, Kynčl J, Malinović I, Pálvölgyi D. Clustered planarity testing revisited. In: <i>International Symposium on Graph Drawing</i>. Vol 8871. Cham: Springer Nature; 2014:428-436. doi:<a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">10.1007/978-3-662-45803-7_36</a>","short":"R. Fulek, J. Kynčl, I. Malinović, D. Pálvölgyi, in:, International Symposium on Graph Drawing, Springer Nature, Cham, 2014, pp. 428–436.","chicago":"Fulek, Radoslav, Jan Kynčl, Igor Malinović, and Dömötör Pálvölgyi. “Clustered Planarity Testing Revisited.” In <i>International Symposium on Graph Drawing</i>, 8871:428–36. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">https://doi.org/10.1007/978-3-662-45803-7_36</a>.","apa":"Fulek, R., Kynčl, J., Malinović, I., &#38; Pálvölgyi, D. (2014). Clustered planarity testing revisited. In <i>International Symposium on Graph Drawing</i> (Vol. 8871, pp. 428–436). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">https://doi.org/10.1007/978-3-662-45803-7_36</a>","mla":"Fulek, Radoslav, et al. “Clustered Planarity Testing Revisited.” <i>International Symposium on Graph Drawing</i>, vol. 8871, Springer Nature, 2014, pp. 428–36, doi:<a href=\"https://doi.org/10.1007/978-3-662-45803-7_36\">10.1007/978-3-662-45803-7_36</a>.","ista":"Fulek R, Kynčl J, Malinović I, Pálvölgyi D. 2014. Clustered planarity testing revisited. International Symposium on Graph Drawing. , LNCS, vol. 8871, 428–436."},"scopus_import":"1","oa_version":"Preprint","date_published":"2014-01-01T00:00:00Z","doi":"10.1007/978-3-662-45803-7_36","publication_status":"published","month":"01","status":"public","publication_identifier":{"issn":["0302-9743"]},"place":"Cham","_id":"10793","abstract":[{"text":"The Hanani–Tutte theorem is a classical result proved for the first time in the 1930s that characterizes planar graphs as graphs that admit a drawing in the plane in which every pair of edges not sharing a vertex cross an even number of times. We generalize this classical result to clustered graphs with two disjoint clusters, and show that a straightforward extension of our result to flat clustered graphs with three or more disjoint clusters is not possible.\r\n\r\nWe also give a new and short proof for a related result by Di Battista and Frati based on the matroid intersection algorithm.","lang":"eng"}],"arxiv":1,"date_updated":"2023-02-23T10:08:04Z","year":"2014"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","edition":"1","status":"public","publisher":"Springer Nature","publication_identifier":{"eisbn":["9783709115268"],"isbn":["9783709115251"]},"title":"Auxin and Its Role in Plant Development","month":"04","abstract":[{"lang":"eng","text":"Auxin is an important signaling compound in plants and vital for plant development and growth. The present book, Auxin and its Role in Plant Development, provides the reader with detailed and comprehensive insight into the functioning of the molecule on the whole and specifically in plant development. In the first part, the functioning, metabolism and signaling pathways of auxin in plants are explained, the second part depicts the specific role of auxin in plant development and the third part describes the interaction and functioning of the signaling compound  upon stimuli of the environment. Each chapter is written by international experts in the respective field and designed for scientists and researchers in plant biology, plant development and cell biology to summarize the recent progress in understanding the role of auxin and suggest future perspectives for auxin research."}],"date_updated":"2022-03-04T07:38:15Z","year":"2014","day":"01","place":"Vienna","_id":"10811","article_processing_charge":"No","scopus_import":"1","citation":{"ista":"Zažímalová E, Petrášek J, Benková E eds. 2014. Auxin and Its Role in Plant Development 1st ed., Vienna: Springer Nature, 444p.","mla":"Zažímalová, Eva, et al., editors. <i>Auxin and Its Role in Plant Development</i>. 1st ed., Springer Nature, 2014, doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8\">10.1007/978-3-7091-1526-8</a>.","apa":"Zažímalová, E., Petrášek, J., &#38; Benková, E. (Eds.). (2014). <i>Auxin and Its Role in Plant Development</i> (1st ed.). Vienna: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8\">https://doi.org/10.1007/978-3-7091-1526-8</a>","chicago":"Zažímalová, Eva, Jan Petrášek, and Eva Benková, eds. <i>Auxin and Its Role in Plant Development</i>. 1st ed. Vienna: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-7091-1526-8\">https://doi.org/10.1007/978-3-7091-1526-8</a>.","short":"E. Zažímalová, J. Petrášek, E. Benková, eds., Auxin and Its Role in Plant Development, 1st ed., Springer Nature, Vienna, 2014.","ieee":"E. Zažímalová, J. Petrášek, and E. Benková, Eds., <i>Auxin and Its Role in Plant Development</i>, 1st ed. Vienna: Springer Nature, 2014.","ama":"Zažímalová E, Petrášek J, Benková E, eds. <i>Auxin and Its Role in Plant Development</i>. 1st ed. Vienna: Springer Nature; 2014. doi:<a href=\"https://doi.org/10.1007/978-3-7091-1526-8\">10.1007/978-3-7091-1526-8</a>"},"quality_controlled":"1","editor":[{"last_name":"Zažímalová","first_name":"Eva","full_name":"Zažímalová, Eva"},{"last_name":"Petrášek","first_name":"Jan","full_name":"Petrášek, Jan"},{"last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","orcid":"0000-0002-8510-9739","full_name":"Benková, Eva"}],"doi":"10.1007/978-3-7091-1526-8","publication_status":"published","date_created":"2022-03-03T11:52:44Z","page":"444","type":"book_editor","oa_version":"None","date_published":"2014-04-01T00:00:00Z","department":[{"_id":"EvBe"}],"language":[{"iso":"eng"}]},{"intvolume":"       116","citation":{"apa":"Seiringer, R. (2014). The excitation spectrum for Bose fluids with weak interactions. <i>Jahresbericht Der Deutschen Mathematiker-Vereinigung</i>. Springer Nature. <a href=\"https://doi.org/10.1365/s13291-014-0083-9\">https://doi.org/10.1365/s13291-014-0083-9</a>","mla":"Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.” <i>Jahresbericht Der Deutschen Mathematiker-Vereinigung</i>, vol. 116, Springer Nature, 2014, pp. 21–41, doi:<a href=\"https://doi.org/10.1365/s13291-014-0083-9\">10.1365/s13291-014-0083-9</a>.","ista":"Seiringer R. 2014. The excitation spectrum for Bose fluids with weak interactions. Jahresbericht der Deutschen Mathematiker-Vereinigung. 116, 21–41.","chicago":"Seiringer, Robert. “The Excitation Spectrum for Bose Fluids with Weak Interactions.” <i>Jahresbericht Der Deutschen Mathematiker-Vereinigung</i>. Springer Nature, 2014. <a href=\"https://doi.org/10.1365/s13291-014-0083-9\">https://doi.org/10.1365/s13291-014-0083-9</a>.","short":"R. Seiringer, Jahresbericht Der Deutschen Mathematiker-Vereinigung 116 (2014) 21–41.","ieee":"R. Seiringer, “The excitation spectrum for Bose fluids with weak interactions,” <i>Jahresbericht der Deutschen Mathematiker-Vereinigung</i>, vol. 116. Springer Nature, pp. 21–41, 2014.","ama":"Seiringer R. The excitation spectrum for Bose fluids with weak interactions. <i>Jahresbericht der Deutschen Mathematiker-Vereinigung</i>. 2014;116:21-41. doi:<a href=\"https://doi.org/10.1365/s13291-014-0083-9\">10.1365/s13291-014-0083-9</a>"},"keyword":["General Medicine"],"volume":116,"quality_controlled":"1","scopus_import":"1","article_type":"original","article_processing_charge":"No","language":[{"iso":"eng"}],"date_published":"2014-03-01T00:00:00Z","department":[{"_id":"RoSe"}],"oa_version":"None","type":"journal_article","date_created":"2022-03-04T07:54:39Z","page":"21-41","publication":"Jahresbericht der Deutschen Mathematiker-Vereinigung","publication_status":"published","doi":"10.1365/s13291-014-0083-9","month":"03","title":"The excitation spectrum for Bose fluids with weak interactions","publication_identifier":{"issn":["0012-0456"],"eissn":["1869-7135"]},"publisher":"Springer Nature","status":"public","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","_id":"10814","author":[{"first_name":"Robert","orcid":"0000-0002-6781-0521","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","full_name":"Seiringer, Robert"}],"day":"01","year":"2014","date_updated":"2023-09-05T14:19:47Z","abstract":[{"lang":"eng","text":"We review recent progress towards a rigorous understanding of the excitation spectrum of bosonic quantum many-body systems. In particular, we explain how one can rigorously establish the predictions resulting from the Bogoliubov approximation in the mean field limit. The latter predicts that the spectrum is made up of elementary excitations, whose energy behaves linearly in the momentum for small momentum. This property is crucial for the superfluid behavior of the system. We also discuss a list of open problems in this field."}]},{"date_published":"2014-02-01T00:00:00Z","oa_version":"None","doi":"10.1111/cga.12039","publication_status":"published","citation":{"ista":"Hashimoto M, Morita H, Ueno N. 2014. Molecular and cellular mechanisms of development underlying congenital diseases. Congenital Anomalies. 54(1), 1–7.","apa":"Hashimoto, M., Morita, H., &#38; Ueno, N. (2014). Molecular and cellular mechanisms of development underlying congenital diseases. <i>Congenital Anomalies</i>. Wiley. <a href=\"https://doi.org/10.1111/cga.12039\">https://doi.org/10.1111/cga.12039</a>","mla":"Hashimoto, Masakazu, et al. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” <i>Congenital Anomalies</i>, vol. 54, no. 1, Wiley, 2014, pp. 1–7, doi:<a href=\"https://doi.org/10.1111/cga.12039\">10.1111/cga.12039</a>.","chicago":"Hashimoto, Masakazu, Hitoshi Morita, and Naoto Ueno. “Molecular and Cellular Mechanisms of Development Underlying Congenital Diseases.” <i>Congenital Anomalies</i>. Wiley, 2014. <a href=\"https://doi.org/10.1111/cga.12039\">https://doi.org/10.1111/cga.12039</a>.","ieee":"M. Hashimoto, H. Morita, and N. Ueno, “Molecular and cellular mechanisms of development underlying congenital diseases,” <i>Congenital Anomalies</i>, vol. 54, no. 1. Wiley, pp. 1–7, 2014.","ama":"Hashimoto M, Morita H, Ueno N. Molecular and cellular mechanisms of development underlying congenital diseases. <i>Congenital Anomalies</i>. 2014;54(1):1-7. doi:<a href=\"https://doi.org/10.1111/cga.12039\">10.1111/cga.12039</a>","short":"M. Hashimoto, H. Morita, N. Ueno, Congenital Anomalies 54 (2014) 1–7."},"intvolume":"        54","main_file_link":[{"url":"https://doi.org/10.1111/cga.12039","open_access":"1"}],"scopus_import":"1","_id":"10815","year":"2014","issue":"1","abstract":[{"lang":"eng","text":"In the last several decades, developmental biology has clarified the molecular mechanisms of embryogenesis and organogenesis. In particular, it has demonstrated that the “tool-kit genes” essential for regulating developmental processes are not only highly conserved among species, but are also used as systems at various times and places in an organism to control distinct developmental events. Therefore, mutations in many of these tool-kit genes may cause congenital diseases involving morphological abnormalities. This link between genes and abnormal morphological phenotypes underscores the importance of understanding how cells behave and contribute to morphogenesis as a result of gene function. Recent improvements in live imaging and in quantitative analyses of cellular dynamics will advance our understanding of the cellular pathogenesis of congenital diseases associated with aberrant morphologies. In these studies, it is critical to select an appropriate model organism for the particular phenomenon of interest."}],"date_updated":"2022-03-04T08:26:05Z","month":"02","publication_identifier":{"issn":["0914-3505"]},"oa":1,"status":"public","department":[{"_id":"CaHe"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Congenital Anomalies","page":"1-7","date_created":"2022-03-04T08:17:25Z","volume":54,"keyword":["Developmental Biology","Embryology","General Medicine","Pediatrics","Perinatology","and Child Health"],"quality_controlled":"1","external_id":{"pmid":["24666178"]},"article_processing_charge":"No","article_type":"original","author":[{"first_name":"Masakazu","last_name":"Hashimoto","full_name":"Hashimoto, Masakazu"},{"full_name":"Morita, Hitoshi","first_name":"Hitoshi","last_name":"Morita","id":"4C6E54C6-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Ueno","first_name":"Naoto","full_name":"Ueno, Naoto"}],"day":"01","acknowledgement":"The authors thank all the members of the Division of Morphogenesis, National Institute for Basic Biology, for their contributions to the research, their encouragement, and helpful discussions, particularly Dr M. Suzuki for his critical reading of the manuscript. We also thank the Model Animal Research and Spectrography and Bioimaging Facilities, NIBB Core Research Facilities, for technical support. M.H. was supported by a research fellowship from the Japan Society for the Promotion of Science (JSPS). Our work introduced in this review was supported by a Grant-in-Aid for Scientific Research on Innovative Areas from the Ministry of Education, Culture, Sports, Science, and Technology (MEXT), Japan, to N.U.","pmid":1,"title":"Molecular and cellular mechanisms of development underlying congenital diseases","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Wiley"},{"citation":{"short":"D. Günther, J. Reininghaus, H.-P. Seidel, T. Weinkauf, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III., Springer Nature, Cham, 2014, pp. 135–150.","ieee":"D. Günther, J. Reininghaus, H.-P. Seidel, and T. Weinkauf, “Notes on the simplification of the Morse-Smale complex,” in <i>Topological Methods in Data Analysis and Visualization III.</i>, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer Nature, 2014, pp. 135–150.","ama":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. Notes on the simplification of the Morse-Smale complex. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III.</i> Mathematics and Visualization. Cham: Springer Nature; 2014:135-150. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">10.1007/978-3-319-04099-8_9</a>","chicago":"Günther, David, Jan Reininghaus, Hans-Peter Seidel, and Tino Weinkauf. “Notes on the Simplification of the Morse-Smale Complex.” In <i>Topological Methods in Data Analysis and Visualization III.</i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 135–50. Mathematics and Visualization. Cham: Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">https://doi.org/10.1007/978-3-319-04099-8_9</a>.","mla":"Günther, David, et al. “Notes on the Simplification of the Morse-Smale Complex.” <i>Topological Methods in Data Analysis and Visualization III.</i>, edited by Peer-Timo Bremer et al., Springer Nature, 2014, pp. 135–50, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">10.1007/978-3-319-04099-8_9</a>.","ista":"Günther D, Reininghaus J, Seidel H-P, Weinkauf T. 2014.Notes on the simplification of the Morse-Smale complex. In: Topological Methods in Data Analysis and Visualization III. , 135–150.","apa":"Günther, D., Reininghaus, J., Seidel, H.-P., &#38; Weinkauf, T. (2014). Notes on the simplification of the Morse-Smale complex. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III.</i> (pp. 135–150). Cham: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_9\">https://doi.org/10.1007/978-3-319-04099-8_9</a>"},"scopus_import":"1","date_published":"2014-03-19T00:00:00Z","oa_version":"None","doi":"10.1007/978-3-319-04099-8_9","publication_status":"published","ec_funded":1,"month":"03","publication_identifier":{"issn":["1612-3786"],"isbn":["9783319040981"],"eissn":["2197-666X"],"eisbn":["9783319040998"]},"status":"public","_id":"10817","place":"Cham","year":"2014","abstract":[{"text":"The Morse-Smale complex can be either explicitly or implicitly represented. Depending on the type of representation, the simplification of the Morse-Smale complex works differently. In the explicit representation, the Morse-Smale complex is directly simplified by explicitly reconnecting the critical points during the simplification. In the implicit representation, on the other hand, the Morse-Smale complex is given by a combinatorial gradient field. In this setting, the simplification changes the combinatorial flow, which yields an indirect simplification of the Morse-Smale complex. The topological complexity of the Morse-Smale complex is reduced in both representations. However, the simplifications generally yield different results. In this chapter, we emphasize properties of the two representations that cause these differences. We also provide a complexity analysis of the two schemes with respect to running time and memory consumption.","lang":"eng"}],"date_updated":"2023-09-05T15:33:45Z","quality_controlled":"1","editor":[{"last_name":"Bremer","first_name":"Peer-Timo","full_name":"Bremer, Peer-Timo"},{"full_name":"Hotz, Ingrid","last_name":"Hotz","first_name":"Ingrid"},{"first_name":"Valerio","last_name":"Pascucci","full_name":"Pascucci, Valerio"},{"full_name":"Peikert, Ronald","last_name":"Peikert","first_name":"Ronald"}],"article_processing_charge":"No","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"type":"book_chapter","publication":"Topological Methods in Data Analysis and Visualization III.","page":"135-150","date_created":"2022-03-04T08:33:57Z","series_title":"Mathematics and Visualization","title":"Notes on the simplification of the Morse-Smale complex","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer Nature","author":[{"first_name":"David","last_name":"Günther","full_name":"Günther, David"},{"full_name":"Reininghaus, Jan","first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus"},{"full_name":"Seidel, Hans-Peter","first_name":"Hans-Peter","last_name":"Seidel"},{"first_name":"Tino","last_name":"Weinkauf","full_name":"Weinkauf, Tino"}],"project":[{"name":"Topological Complex Systems","call_identifier":"FP7","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"day":"19","acknowledgement":"This research is supported and funded by the Digiteo unTopoVis project, the TOPOSYS project FP7-ICT-318493-STREP, and MPC-VCC."},{"date_published":"2014-01-30T00:00:00Z","oa_version":"Preprint","doi":"10.1007/978-3-642-54013-4_15","publication_status":"published","conference":{"start_date":"2014-01-19","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","end_date":"2014-01-21","location":"San Diego, CA, United States"},"citation":{"chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In <i>Verification, Model Checking, and Abstract Interpretation</i>, 8318:262–81. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” <i>Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>.","apa":"Aminof, B., Jacobs, S., Khalimov, A., &#38; Rubin, S. (2014). Parameterized model checking of token-passing systems. In <i>Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">https://doi.org/10.1007/978-3-642-54013-4_15</a>","ista":"Aminof B, Jacobs S, Khalimov A, Rubin S. 2014. Parameterized model checking of token-passing systems. Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 262–281.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in <i>Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: <i>Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:262-281. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_15\">10.1007/978-3-642-54013-4_15</a>","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281."},"intvolume":"      8318","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1311.4425"}],"scopus_import":"1","_id":"10884","year":"2014","arxiv":1,"abstract":[{"text":"We revisit the parameterized model checking problem for token-passing systems and specifications in indexed CTL  ∗ \\X. Emerson and Namjoshi (1995, 2003) have shown that parameterized model checking of indexed CTL  ∗ \\X in uni-directional token rings can be reduced to checking rings up to some cutoff size. Clarke et al. (2004) have shown a similar result for general topologies and indexed LTL \\X, provided processes cannot choose the directions for sending or receiving the token.\r\nWe unify and substantially extend these results by systematically exploring fragments of indexed CTL  ∗ \\X with respect to general topologies. For each fragment we establish whether a cutoff exists, and for some concrete topologies, such as rings, cliques and stars, we infer small cutoffs. Finally, we show that the problem becomes undecidable, and thus no cutoffs exist, if processes are allowed to choose the directions in which they send or from which they receive the token.","lang":"eng"}],"date_updated":"2022-05-17T08:36:01Z","ec_funded":1,"month":"01","oa":1,"publication_identifier":{"eisbn":["9783642540134"],"eissn":["1611-3349"],"isbn":["9783642540127"],"issn":["0302-9743"]},"status":"public","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"type":"conference","publication":"Verification, Model Checking, and Abstract Interpretation","page":"262-281","date_created":"2022-03-18T13:01:22Z","volume":8318,"quality_controlled":"1","external_id":{"arxiv":["1311.4425"]},"article_processing_charge":"No","author":[{"full_name":"Aminof, Benjamin","last_name":"Aminof","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","first_name":"Benjamin"},{"first_name":"Swen","last_name":"Jacobs","full_name":"Jacobs, Swen"},{"full_name":"Khalimov, Ayrat","last_name":"Khalimov","first_name":"Ayrat"},{"last_name":"Rubin","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha","full_name":"Rubin, Sasha"}],"project":[{"call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"name":"Game Theory","call_identifier":"FWF","grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"day":"30","acknowledgement":"This work was supported by the Austrian Science Fund through grant P23499-N23\r\nand through the RiSE network (S11403, S11405, S11406, S11407-N23); ERC Starting Grant (279307: Graph Games); Vienna Science and Technology Fund (WWTF)\r\ngrants PROSEED, ICT12-059, and VRG11-005.","alternative_title":["LNCS"],"title":"Parameterized model checking of token-passing systems","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature"},{"alternative_title":["LNCS"],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer Nature","title":"Doomsday equilibria for omega-regular games","author":[{"full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Doyen","first_name":"Laurent","full_name":"Doyen, Laurent"},{"last_name":"Filiot","first_name":"Emmanuel","full_name":"Filiot, Emmanuel"},{"first_name":"Jean-François","last_name":"Raskin","full_name":"Raskin, Jean-François"}],"project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"acknowledgement":" Supported by Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No\r\nS11407-N23 (RiSE), ERC Start grant (279307: Graph Games), and Microsoft faculty fellows award.","day":"30","quality_controlled":"1","volume":8318,"external_id":{"arxiv":["1311.3238"]},"related_material":{"record":[{"id":"681","status":"public","relation":"later_version"}]},"article_processing_charge":"No","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","date_created":"2022-03-18T13:03:15Z","page":"78-97","month":"01","ec_funded":1,"status":"public","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783642540134"],"isbn":["9783642540127"],"issn":["0302-9743"]},"_id":"10885","abstract":[{"lang":"eng","text":"Two-player games on graphs provide the theoretical framework for many important problems such as reactive synthesis. While the traditional study of two-player zero-sum games has been extended to multi-player games with several notions of equilibria, they are decidable only for perfect-information games, whereas several applications require imperfect-information games.\r\nIn this paper we propose a new notion of equilibria, called doomsday equilibria, which is a strategy profile such that all players satisfy their own objective, and if any coalition of players deviates and violates even one of the players objective, then the objective of every player is violated.\r\nWe present algorithms and complexity results for deciding the existence of doomsday equilibria for various classes of ω-regular objectives, both for imperfect-information games, and for perfect-information games.We provide optimal complexity bounds for imperfect-information games, and in most cases for perfect-information games."}],"arxiv":1,"date_updated":"2023-02-23T12:52:24Z","year":"2014","citation":{"ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>. Vol 8318. Springer Nature; 2014:78-97. doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, San Diego, CA, United States, 2014, vol. 8318, pp. 78–97.","short":"K. Chatterjee, L. Doyen, E. Filiot, J.-F. Raskin, in:, VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 78–97.","ista":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. 2014. Doomsday equilibria for omega-regular games. VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. VMCAI: Verifcation, Model Checking, and Abstract Interpretation, LNCS, vol. 8318, 78–97.","apa":"Chatterjee, K., Doyen, L., Filiot, E., &#38; Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i> (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>","mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:<a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">10.1007/978-3-642-54013-4_5</a>.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In <i>VMCAI 2014: Verification, Model Checking, and Abstract Interpretation</i>, 8318:78–97. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-642-54013-4_5\">https://doi.org/10.1007/978-3-642-54013-4_5</a>."},"intvolume":"      8318","scopus_import":"1","oa_version":"Preprint","date_published":"2014-01-30T00:00:00Z","doi":"10.1007/978-3-642-54013-4_5","conference":{"location":"San Diego, CA, United States","end_date":"2014-01-21","name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2014-01-19"},"publication_status":"published"},{"author":[{"full_name":"Zobel, Valentin","first_name":"Valentin","last_name":"Zobel"},{"first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","last_name":"Reininghaus","full_name":"Reininghaus, Jan"},{"last_name":"Hotz","first_name":"Ingrid","full_name":"Hotz, Ingrid"}],"_id":"10886","abstract":[{"text":"We propose a method for visualizing two-dimensional symmetric positive definite tensor fields using the Heat Kernel Signature (HKS). The HKS is derived from the heat kernel and was originally introduced as an isometry invariant shape signature. Each positive definite tensor field defines a Riemannian manifold by considering the tensor field as a Riemannian metric. On this Riemmanian manifold we can apply the definition of the HKS. The resulting scalar quantity is used for the visualization of tensor fields. The HKS is closely related to the Gaussian curvature of the Riemannian manifold and the time parameter of the heat kernel allows a multiscale analysis in a natural way. In this way, the HKS represents field related scale space properties, enabling a level of detail analysis of tensor fields. This makes the HKS an interesting new scalar quantity for tensor fields, which differs significantly from usual tensor invariants like the trace or the determinant. A method for visualization and a numerical realization of the HKS for tensor fields is proposed in this chapter. To validate the approach we apply it to some illustrating simple examples as isolated critical points and to a medical diffusion tensor data set.","lang":"eng"}],"acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","date_updated":"2023-09-05T14:13:16Z","year":"2014","day":"19","alternative_title":["Mathematics and Visualization"],"month":"03","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","status":"public","publisher":"Springer","publication_identifier":{"eisbn":["9783319040998"],"eissn":["2197-666X"],"isbn":["9783319040981"],"issn":["1612-3786"]},"title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","type":"conference","oa_version":"None","date_published":"2014-03-19T00:00:00Z","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-04099-8_16","publication_status":"published","publication":"Topological Methods in Data Analysis and Visualization III ","page":"249-262","date_created":"2022-03-18T13:05:39Z","citation":{"mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” <i>Topological Methods in Data Analysis and Visualization III </i>, Springer, 2014, pp. 249–62, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>.","ista":"Zobel V, Reininghaus J, Hotz I. 2014. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. Topological Methods in Data Analysis and Visualization III . , Mathematics and Visualization, , 249–262.","apa":"Zobel, V., Reininghaus, J., &#38; Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In <i>Topological Methods in Data Analysis and Visualization III </i> (pp. 249–262). Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>","chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In <i>Topological Methods in Data Analysis and Visualization III </i>, 249–62. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">https://doi.org/10.1007/978-3-319-04099-8_16</a>.","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: <i>Topological Methods in Data Analysis and Visualization III </i>. Springer; 2014:249-262. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_16\">10.1007/978-3-319-04099-8_16</a>","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in <i>Topological Methods in Data Analysis and Visualization III </i>, 2014, pp. 249–262.","short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262."},"quality_controlled":"1","article_processing_charge":"No","scopus_import":"1"},{"_id":"10892","date_updated":"2023-02-23T12:20:55Z","abstract":[{"lang":"eng","text":"In this paper, we introduce planar matchings on directed pseudo-line arrangements, which yield a planar set of pseudo-line segments such that only matching-partners are adjacent. By translating the planar matching problem into a corresponding stable roommates problem we show that such matchings always exist.\r\nUsing our new framework, we establish, for the first time, a complete, rigorous definition of weighted straight skeletons, which are based on a so-called wavefront propagation process. We present a generalized and unified approach to treat structural changes in the wavefront that focuses on the restoration of weak planarity by finding planar matchings."}],"year":"2014","month":"11","status":"public","publication_identifier":{"issn":["0302-9743"],"isbn":["9783319130743"],"eisbn":["9783319130750"],"eissn":["1611-3349"]},"oa_version":"None","date_published":"2014-11-08T00:00:00Z","conference":{"end_date":"2014-12-17","location":"Jeonju, Korea","start_date":"2014-12-15","name":"ISAAC: International Symposium on Algorithms and Computation"},"publication_status":"published","doi":"10.1007/978-3-319-13075-0_10","citation":{"mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” <i>25th International Symposium, ISAAC 2014</i>, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>.","apa":"Biedl, T., Huber, S., &#38; Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In <i>25th International Symposium, ISAAC 2014</i> (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>","ista":"Biedl T, Huber S, Palfrader P. 2014. Planar matchings for weighted straight skeletons. 25th International Symposium, ISAAC 2014. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 8889, 117–127.","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In <i>25th International Symposium, ISAAC 2014</i>, 8889:117–27. Springer Nature, 2014. <a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">https://doi.org/10.1007/978-3-319-13075-0_10</a>.","ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: <i>25th International Symposium, ISAAC 2014</i>. Vol 8889. Springer Nature; 2014:117-127. doi:<a href=\"https://doi.org/10.1007/978-3-319-13075-0_10\">10.1007/978-3-319-13075-0_10</a>","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in <i>25th International Symposium, ISAAC 2014</i>, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127."},"intvolume":"      8889","scopus_import":"1","author":[{"last_name":"Biedl","first_name":"Therese","full_name":"Biedl, Therese"},{"id":"4700A070-F248-11E8-B48F-1D18A9856A87","last_name":"Huber","orcid":"0000-0002-8871-5814","first_name":"Stefan","full_name":"Huber, Stefan"},{"first_name":"Peter","last_name":"Palfrader","full_name":"Palfrader, Peter"}],"acknowledgement":"T. Biedl was supported by NSERC and the Ross and Muriel Cheriton Fellowship. P. Palfrader was supported by Austrian Science Fund (FWF): P25816-N15.","day":"08","alternative_title":["LNCS"],"publisher":"Springer Nature","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Planar matchings for weighted straight skeletons","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"page":"117-127","date_created":"2022-03-21T07:09:03Z","publication":"25th International Symposium, ISAAC 2014","quality_controlled":"1","volume":8889,"related_material":{"record":[{"id":"481","status":"public","relation":"later_version"}]},"article_processing_charge":"No"},{"place":"Cham","_id":"10893","abstract":[{"text":"Saddle periodic orbits are an essential and stable part of the topological skeleton of a 3D vector field. Nevertheless, there is currently no efficient algorithm to robustly extract these features. In this chapter, we present a novel technique to extract saddle periodic orbits. Exploiting the analytic properties of such an orbit, we propose a scalar measure based on the finite-time Lyapunov exponent (FTLE) that indicates its presence. Using persistent homology, we can then extract the robust cycles of this field. These cycles thereby represent the saddle periodic orbits of the given vector field. We discuss the different existing FTLE approximation schemes regarding their applicability to this specific problem and propose an adapted version of FTLE called Normalized Velocity Separation. Finally, we evaluate our method using simple analytic vector field data.","lang":"eng"}],"date_updated":"2022-06-21T12:01:47Z","year":"2014","month":"03","ec_funded":1,"status":"public","publication_identifier":{"isbn":["9783319040981"],"eisbn":["9783319040998"],"eissn":["2197-666X"],"issn":["1612-3786"]},"oa_version":"None","date_published":"2014-03-19T00:00:00Z","doi":"10.1007/978-3-319-04099-8_4","publication_status":"published","citation":{"chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>.","ista":"Kasten J, Reininghaus J, Reich W, Scheuermann G. 2014.Toward the extraction of saddle periodic orbits. In: Topological Methods in Data Analysis and Visualization III . vol. 1, 55–69.","apa":"Kasten, J., Reininghaus, J., Reich, W., &#38; Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, &#38; R. Peikert (Eds.), <i>Topological Methods in Data Analysis and Visualization III </i> (Vol. 1, pp. 55–69). Cham: Springer. <a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">https://doi.org/10.1007/978-3-319-04099-8_4</a>","mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” <i>Topological Methods in Data Analysis and Visualization III </i>, edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in <i>Topological Methods in Data Analysis and Visualization III </i>, vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","ama":"Kasten J, Reininghaus J, Reich W, Scheuermann G. Toward the extraction of saddle periodic orbits. In: Bremer P-T, Hotz I, Pascucci V, Peikert R, eds. <i>Topological Methods in Data Analysis and Visualization III </i>. Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:<a href=\"https://doi.org/10.1007/978-3-319-04099-8_4\">10.1007/978-3-319-04099-8_4</a>","short":"J. Kasten, J. Reininghaus, W. Reich, G. Scheuermann, in:, P.-T. Bremer, I. Hotz, V. Pascucci, R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III , Springer, Cham, 2014, pp. 55–69."},"intvolume":"         1","scopus_import":"1","author":[{"full_name":"Kasten, Jens","first_name":"Jens","last_name":"Kasten"},{"full_name":"Reininghaus, Jan","first_name":"Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Wieland","last_name":"Reich","full_name":"Reich, Wieland"},{"full_name":"Scheuermann, Gerik","first_name":"Gerik","last_name":"Scheuermann"}],"project":[{"call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425","grant_number":"318493"}],"acknowledgement":"First, we thank the reviewers of this paper for their ideas and critical comments. In addition, we thank Ronny Peikert and Filip Sadlo for a fruitful discussions. This research is supported by the European Commission under the TOPOSYS project FP7-ICT-318493-STREP, the European Social Fund (ESF App. No. 100098251), and the European Science Foundation under the ACAT Research Network Program.","day":"19","series_title":"Mathematics and Visualization","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Springer","title":"Toward the extraction of saddle periodic orbits","type":"book_chapter","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publication":"Topological Methods in Data Analysis and Visualization III ","page":"55-69","date_created":"2022-03-21T07:11:23Z","volume":1,"editor":[{"full_name":"Bremer, Peer-Timo","last_name":"Bremer","first_name":"Peer-Timo"},{"full_name":"Hotz, Ingrid","first_name":"Ingrid","last_name":"Hotz"},{"last_name":"Pascucci","first_name":"Valerio","full_name":"Pascucci, Valerio"},{"full_name":"Peikert, Ronald","last_name":"Peikert","first_name":"Ronald"}],"quality_controlled":"1","article_processing_charge":"No"},{"series_title":"LNCS","title":"PHAT – Persistent Homology Algorithms Toolbox","publisher":"Springer Berlin Heidelberg","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","author":[{"id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","last_name":"Bauer","orcid":"0000-0002-9683-0724","first_name":"Ulrich","full_name":"Bauer, Ulrich"},{"last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael"},{"full_name":"Reininghaus, Jan","first_name":"Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wagner, Hubert","first_name":"Hubert","last_name":"Wagner"}],"day":"01","related_material":{"record":[{"id":"1433","status":"public","relation":"later_version"}]},"volume":8592,"quality_controlled":"1","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"type":"conference","date_created":"2022-03-21T07:12:16Z","page":"137-143","publication":"ICMS 2014: International Congress on Mathematical Software","month":"09","publication_identifier":{"isbn":["9783662441985"],"eissn":["1611-3349"],"eisbn":["9783662441992"],"issn":["0302-9743"]},"status":"public","_id":"10894","place":"Berlin, Heidelberg","year":"2014","date_updated":"2023-09-20T09:42:40Z","abstract":[{"text":"PHAT is a C++ library for the computation of persistent homology by matrix reduction. We aim for a simple generic design that decouples algorithms from data structures without sacrificing efficiency or user-friendliness. This makes PHAT a versatile platform for experimenting with algorithmic ideas and comparing them to state of the art implementations.","lang":"eng"}],"intvolume":"      8592","citation":{"short":"U. Bauer, M. Kerber, J. Reininghaus, H. Wagner, in:, ICMS 2014: International Congress on Mathematical Software, Springer Berlin Heidelberg, Berlin, Heidelberg, 2014, pp. 137–143.","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: <i>ICMS 2014: International Congress on Mathematical Software</i>. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in <i>ICMS 2014: International Congress on Mathematical Software</i>, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In <i>ICMS 2014: International Congress on Mathematical Software</i>, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>.","ista":"Bauer U, Kerber M, Reininghaus J, Wagner H. 2014. PHAT – Persistent Homology Algorithms Toolbox. ICMS 2014: International Congress on Mathematical Software. ICMS: International Congress on Mathematical SoftwareLNCS vol. 8592, 137–143.","apa":"Bauer, U., Kerber, M., Reininghaus, J., &#38; Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In <i>ICMS 2014: International Congress on Mathematical Software</i> (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. <a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">https://doi.org/10.1007/978-3-662-44199-2_24</a>","mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” <i>ICMS 2014: International Congress on Mathematical Software</i>, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:<a href=\"https://doi.org/10.1007/978-3-662-44199-2_24\">10.1007/978-3-662-44199-2_24</a>."},"scopus_import":"1","date_published":"2014-09-01T00:00:00Z","oa_version":"None","conference":{"start_date":"2014-08-05","name":"ICMS: International Congress on Mathematical Software","end_date":"2014-08-09","location":"Seoul, South Korea"},"publication_status":"published","doi":"10.1007/978-3-662-44199-2_24"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"International Congress of Mathematicians","oa":1,"publication_identifier":{"isbn":["9788961058063"]},"title":"Structure of the excitation spectrum for many-body quantum systems","month":"08","abstract":[{"lang":"eng","text":"Many questions concerning models in quantum mechanics require a detailed analysis of the spectrum of the corresponding Hamiltonian, a linear operator on a suitable Hilbert space. Of particular relevance for an understanding of the low-temperature properties of a system is the structure of the excitation spectrum, which is the part of the spectrum close to the spectral bottom. We present recent progress on this question for bosonic many-body quantum systems with weak two-body interactions. Such system are currently of great interest, due to their experimental realization in ultra-cold atomic gases. We investigate the accuracy of the Bogoliubov approximations, which predicts that the low-energy spectrum is made up of sums of elementary excitations, with linear dispersion law at low momentum. The latter property is crucial for the superfluid behavior the system."}],"date_updated":"2023-10-17T11:12:33Z","year":"2014","day":"01","author":[{"full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","first_name":"Robert"}],"_id":"8044","article_processing_charge":"No","main_file_link":[{"url":"http://www.icm2014.org/en/vod/proceedings.html","open_access":"1"}],"scopus_import":"1","volume":3,"intvolume":"         3","quality_controlled":"1","citation":{"chicago":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” In <i>Proceeding of the International Congress of Mathematicans</i>, 3:1175–94. International Congress of Mathematicians, 2014.","ista":"Seiringer R. 2014. Structure of the excitation spectrum for many-body quantum systems. Proceeding of the International Congress of Mathematicans. ICM: International Congress of Mathematicans vol. 3, 1175–1194.","apa":"Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum systems. In <i>Proceeding of the International Congress of Mathematicans</i> (Vol. 3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.","mla":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” <i>Proceeding of the International Congress of Mathematicans</i>, vol. 3, International Congress of Mathematicians, 2014, pp. 1175–94.","short":"R. Seiringer, in:, Proceeding of the International Congress of Mathematicans, International Congress of Mathematicians, 2014, pp. 1175–1194.","ama":"Seiringer R. Structure of the excitation spectrum for many-body quantum systems. In: <i>Proceeding of the International Congress of Mathematicans</i>. Vol 3. International Congress of Mathematicians; 2014:1175-1194.","ieee":"R. Seiringer, “Structure of the excitation spectrum for many-body quantum systems,” in <i>Proceeding of the International Congress of Mathematicans</i>, Seoul, South Korea, 2014, vol. 3, pp. 1175–1194."},"publication_status":"published","conference":{"end_date":"2014-08-21","location":"Seoul, South Korea","start_date":"2014-08-13","name":"ICM: International Congress of Mathematicans"},"publication":"Proceeding of the International Congress of Mathematicans","page":"1175-1194","date_created":"2020-06-29T07:59:35Z","oa_version":"Published Version","type":"conference","department":[{"_id":"RoSe"}],"date_published":"2014-08-01T00:00:00Z","language":[{"iso":"eng"}]},{"publist_id":"5526","pubrep_id":"577","volume":33,"quality_controlled":"1","has_accepted_license":"1","date_created":"2018-12-11T11:53:08Z","publication":"ACM Transactions on Graphics","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"ChWo"}],"publisher":"ACM","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Edit propagation using geometric relationship functions","day":"01","author":[{"full_name":"Guerrero, Paul","last_name":"Guerrero","first_name":"Paul"},{"first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87","last_name":"Jeschke","full_name":"Jeschke, Stefan"},{"full_name":"Wimmer, Michael","first_name":"Michael","last_name":"Wimmer"},{"full_name":"Wonka, Peter","last_name":"Wonka","first_name":"Peter"}],"file":[{"file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","date_updated":"2020-07-14T12:45:07Z","date_created":"2018-12-12T10:11:22Z","file_id":"4876","checksum":"7f91e588a4e888610313b98271e6418e","creator":"system","access_level":"open_access","content_type":"application/pdf","relation":"main_file","file_size":9832561}],"file_date_updated":"2020-07-14T12:45:07Z","ddc":["000"],"citation":{"chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>. ACM, 2014. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2014). Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/2591010\">https://doi.org/10.1145/2591010</a>","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2, 15, ACM, 2014, doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>.","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15.","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” <i>ACM Transactions on Graphics</i>, vol. 33, no. 2. ACM, 2014.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. <i>ACM Transactions on Graphics</i>. 2014;33(2). doi:<a href=\"https://doi.org/10.1145/2591010\">10.1145/2591010</a>","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014)."},"intvolume":"        33","publication_status":"published","doi":"10.1145/2591010","oa_version":"Submitted Version","date_published":"2014-03-01T00:00:00Z","status":"public","oa":1,"month":"03","date_updated":"2021-01-12T06:52:06Z","abstract":[{"text":"We propose a method for propagating edit operations in 2D vector graphics, based on geometric relationship functions. These functions quantify the geometric relationship of a point to a polygon, such as the distance to the boundary or the direction to the closest corner vertex. The level sets of the relationship functions describe points with the same relationship to a polygon. For a given query point, we first determine a set of relationships to local features, construct all level sets for these relationships, and accumulate them. The maxima of the resulting distribution are points with similar geometric relationships. We show extensions to handle mirror symmetries, and discuss the use of relationship functions as local coordinate systems. Our method can be applied, for example, to interactive floorplan editing, and it is especially useful for large layouts, where individual edits would be cumbersome. We demonstrate populating 2D layouts with tens to hundreds of objects by propagating relatively few edit operations.","lang":"eng"}],"issue":"2","year":"2014","article_number":"15","_id":"1629"},{"conference":{"end_date":"2014-09-05","location":"Amalfi, Italy","start_date":"2014-09-03","name":"SCN: Security and Cryptography for Networks"},"publication_status":"published","doi":"10.1007/978-3-319-10879-7_7","oa_version":"Submitted Version","date_published":"2014-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"scopus_import":1,"intvolume":"      8642","citation":{"short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114.","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in <i>SCN 2014</i>, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. <i>SCN 2014</i>. Vol 8642. Springer; 2014:95-114. doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla &#38; R. De Prisco (Eds.), <i>SCN 2014</i> (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>","mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:<a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">10.1007/978-3-319-10879-7_7</a>.","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In <i>SCN 2014</i>, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. <a href=\"https://doi.org/10.1007/978-3-319-10879-7_7\">https://doi.org/10.1007/978-3-319-10879-7_7</a>."},"date_updated":"2021-01-12T06:52:12Z","abstract":[{"text":"We extend the notion of verifiable random functions (VRF) to constrained VRFs, which generalize the concept of constrained pseudorandom functions, put forward by Boneh and Waters (Asiacrypt’13), and independently by Kiayias et al. (CCS’13) and Boyle et al. (PKC’14), who call them delegatable PRFs and functional PRFs, respectively. In a standard VRF the secret key sk allows one to evaluate a pseudorandom function at any point of its domain; in addition, it enables computation of a non-interactive proof that the function value was computed correctly. In a constrained VRF from the key sk one can derive constrained keys skS for subsets S of the domain, which allow computation of function values and proofs only at points in S. After formally defining constrained VRFs, we derive instantiations from the multilinear-maps-based constrained PRFs by Boneh and Waters, yielding a VRF with constrained keys for any set that can be decided by a polynomial-size circuit. Our VRFs have the same function values as the Boneh-Waters PRFs and are proved secure under the same hardness assumption, showing that verifiability comes at no cost. Constrained (functional) VRFs were stated as an open problem by Boyle et al.","lang":"eng"}],"year":"2014","_id":"1643","status":"public","oa":1,"month":"01","ec_funded":1,"page":"95 - 114","date_created":"2018-12-11T11:53:13Z","publication":"SCN 2014","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"publist_id":"5509","editor":[{"last_name":"Abdalla","first_name":"Michel","full_name":"Abdalla, Michel"},{"first_name":"Roberto","last_name":"De Prisco","full_name":"De Prisco, Roberto"}],"volume":8642,"day":"01","project":[{"_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668","name":"Provable Security for Physical Cryptography","call_identifier":"FP7"}],"author":[{"first_name":"Georg","last_name":"Fuchsbauer","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg"}],"publisher":"Springer","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Constrained Verifiable Random Functions ","alternative_title":["LNCS"]},{"author":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh","full_name":"Gupta, Ashutosh"},{"last_name":"Popeea","first_name":"Corneliu","full_name":"Popeea, Corneliu"},{"full_name":"Rybalchenko, Andrey","first_name":"Andrey","last_name":"Rybalchenko"}],"_id":"1702","abstract":[{"lang":"eng","text":"In this paper we present INTERHORN, a solver for recursion-free Horn clauses. The main application domain of INTERHORN lies in solving interpolation problems arising in software verification. We show how a range of interpolation problems, including path, transition, nested, state/transition and well-founded interpolation can be handled directly by INTERHORN. By detailing these interpolation problems and their Horn clause representations, we hope to encourage the emergence of a common back-end interpolation interface useful for diverse verification tools."}],"date_updated":"2021-01-12T06:52:38Z","year":"2014","day":"02","alternative_title":["EPTCS"],"month":"12","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","status":"public","publisher":"Open Publishing","oa":1,"title":"Generalised interpolation by solving recursion free-horn clauses","type":"conference","oa_version":"Submitted Version","date_published":"2014-12-02T00:00:00Z","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"doi":"10.4204/EPTCS.169.5","conference":{"name":"HCVS: Horn Clauses for Verification and Synthesis","start_date":"2014-07-17","location":"Vienna, Austria","end_date":"2014-07-17"},"publication_status":"published","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS","page":"31 - 38","date_created":"2018-12-11T11:53:33Z","citation":{"mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, vol. 169, Open Publishing, 2014, pp. 31–38, doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>.","ista":"Gupta A, Popeea C, Rybalchenko A. 2014. Generalised interpolation by solving recursion free-horn clauses. Electronic Proceedings in Theoretical Computer Science, EPTCS. HCVS: Horn Clauses for Verification and Synthesis, EPTCS, vol. 169, 31–38.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i> (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, 169:31–38. Open Publishing, 2014. <a href=\"https://doi.org/10.4204/EPTCS.169.5\">https://doi.org/10.4204/EPTCS.169.5</a>.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>, Vienna, Austria, 2014, vol. 169, pp. 31–38.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: <i>Electronic Proceedings in Theoretical Computer Science, EPTCS</i>. Vol 169. Open Publishing; 2014:31-38. doi:<a href=\"https://doi.org/10.4204/EPTCS.169.5\">10.4204/EPTCS.169.5</a>","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38."},"intvolume":"       169","quality_controlled":"1","volume":169,"main_file_link":[{"url":"http://arxiv.org/abs/1303.7378v2","open_access":"1"}],"publist_id":"5435"},{"quality_controlled":"1","volume":3,"intvolume":"         3","citation":{"short":"C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, pp. 2024–2032.","ieee":"C. Savin and S. Denève, “Spatio-temporal representations of uncertainty in spiking neural networks,” presented at the NIPS: Neural Information Processing Systems, Montreal, Canada, 2014, vol. 3, no. January, pp. 2024–2032.","ama":"Savin C, Denève S. Spatio-temporal representations of uncertainty in spiking neural networks. In: Vol 3. Neural Information Processing Systems; 2014:2024-2032.","chicago":"Savin, Cristina, and Sophie Denève. “Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks,” 3:2024–32. Neural Information Processing Systems, 2014.","apa":"Savin, C., &#38; Denève, S. (2014). Spatio-temporal representations of uncertainty in spiking neural networks (Vol. 3, pp. 2024–2032). Presented at the NIPS: Neural Information Processing Systems, Montreal, Canada: Neural Information Processing Systems.","ista":"Savin C, Denève S. 2014. Spatio-temporal representations of uncertainty in spiking neural networks. NIPS: Neural Information Processing Systems vol. 3, 2024–2032.","mla":"Savin, Cristina, and Sophie Denève. <i>Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks</i>. Vol. 3, no. January, Neural Information Processing Systems, 2014, pp. 2024–32."},"main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf"}],"scopus_import":1,"publist_id":"5427","type":"conference","oa_version":"None","language":[{"iso":"eng"}],"department":[{"_id":"GaTk"}],"date_published":"2014-01-01T00:00:00Z","conference":{"start_date":"2014-12-08","name":"NIPS: Neural Information Processing Systems","end_date":"2014-12-13","location":"Montreal, Canada"},"publication_status":"published","date_created":"2018-12-11T11:53:35Z","page":"2024 - 2032","month":"01","publisher":"Neural Information Processing Systems","status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Spatio-temporal representations of uncertainty in spiking neural networks","author":[{"full_name":"Savin, Cristina","first_name":"Cristina","last_name":"Savin","id":"3933349E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Denève, Sophie","first_name":"Sophie","last_name":"Denève"}],"_id":"1708","date_updated":"2021-01-12T06:52:40Z","abstract":[{"text":"It has been long argued that, because of inherent ambiguity and noise, the brain needs to represent uncertainty in the form of probability distributions. The neural encoding of such distributions remains however highly controversial. Here we present a novel circuit model for representing multidimensional real-valued distributions using a spike based spatio-temporal code. Our model combines the computational advantages of the currently competing models for probabilistic codes and exhibits realistic neural responses along a variety of classic measures. Furthermore, the model highlights the challenges associated with interpreting neural activity in relation to behavioral uncertainty and points to alternative population-level approaches for the experimental validation of distributed representations.","lang":"eng"}],"issue":"January","day":"01","year":"2014"},{"_id":"1733","abstract":[{"text":"The classical (boolean) notion of refinement for behavioral interfaces of system components is the alternating refinement preorder. In this paper, we define a distance for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intuitively, tolerating errors (while counting them) in the alternating simulation game. We show that the interface simulation distance satisfies the triangle inequality, that the distance between two interfaces does not increase under parallel composition with a third interface, that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces, and how to synthesize an interface from incompatible requirements. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}],"issue":"3","date_updated":"2023-02-23T11:04:00Z","year":"2014","month":"12","ec_funded":1,"status":"public","oa":1,"oa_version":"Submitted Version","date_published":"2014-12-04T00:00:00Z","doi":"10.1016/j.tcs.2014.08.019","publication_status":"published","citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>. Elsevier, 2014. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2014). Interface simulation distances. <i>Theoretical Computer Science</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">https://doi.org/10.1016/j.tcs.2014.08.019</a>","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Theoretical Computer Science</i>, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” <i>Theoretical Computer Science</i>, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. <i>Theoretical Computer Science</i>. 2014;560(3):348-363. doi:<a href=\"https://doi.org/10.1016/j.tcs.2014.08.019\">10.1016/j.tcs.2014.08.019</a>","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363."},"intvolume":"       560","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"scopus_import":1,"author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","full_name":"Chmelik, Martin"},{"last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","full_name":"Henzinger, Thomas A"},{"full_name":"Radhakrishna, Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","first_name":"Arjun"}],"project":[{"call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"},{"call_identifier":"FWF","name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407"},{"_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"day":"04","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publisher":"Elsevier","title":"Interface simulation distances","type":"journal_article","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"language":[{"iso":"eng"}],"publication":"Theoretical Computer Science","date_created":"2018-12-11T11:53:43Z","page":"348 - 363","volume":560,"quality_controlled":"1","related_material":{"record":[{"id":"2916","status":"public","relation":"earlier_version"}]},"publist_id":"5392"}]