[{"date_created":"2018-12-11T12:00:06Z","issue":"4","year":"2012","citation":{"ama":"Guenot B, Bayer E, Kierzkowski D, et al. Pin1 independent leaf initiation in Arabidopsis. <i>Plant Physiology</i>. 2012;159(4):1501-1510. doi:<a href=\"https://doi.org/10.1104/pp.112.200402\">10.1104/pp.112.200402</a>","chicago":"Guenot, Bernadette, Emmanuelle Bayer, Daniel Kierzkowski, Richard Smith, Therese Mandel, Petra Žádníková, Eva Benková, and Cris Kuhlemeier. “Pin1 Independent Leaf Initiation in Arabidopsis.” <i>Plant Physiology</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1104/pp.112.200402\">https://doi.org/10.1104/pp.112.200402</a>.","apa":"Guenot, B., Bayer, E., Kierzkowski, D., Smith, R., Mandel, T., Žádníková, P., … Kuhlemeier, C. (2012). Pin1 independent leaf initiation in Arabidopsis. <i>Plant Physiology</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1104/pp.112.200402\">https://doi.org/10.1104/pp.112.200402</a>","short":"B. Guenot, E. Bayer, D. Kierzkowski, R. Smith, T. Mandel, P. Žádníková, E. Benková, C. Kuhlemeier, Plant Physiology 159 (2012) 1501–1510.","ieee":"B. Guenot <i>et al.</i>, “Pin1 independent leaf initiation in Arabidopsis,” <i>Plant Physiology</i>, vol. 159, no. 4. American Society of Plant Biologists, pp. 1501–1510, 2012.","mla":"Guenot, Bernadette, et al. “Pin1 Independent Leaf Initiation in Arabidopsis.” <i>Plant Physiology</i>, vol. 159, no. 4, American Society of Plant Biologists, 2012, pp. 1501–10, doi:<a href=\"https://doi.org/10.1104/pp.112.200402\">10.1104/pp.112.200402</a>.","ista":"Guenot B, Bayer E, Kierzkowski D, Smith R, Mandel T, Žádníková P, Benková E, Kuhlemeier C. 2012. Pin1 independent leaf initiation in Arabidopsis. Plant Physiology. 159(4), 1501–1510."},"month":"08","publication":"Plant Physiology","title":"Pin1 independent leaf initiation in Arabidopsis","volume":159,"date_published":"2012-08-01T00:00:00Z","abstract":[{"lang":"eng","text":"Phyllotaxis, the regular arrangement of leaves and flowers around the stem, is a key feature of plant architecture. Current models propose that the spatiotemporal regulation of organ initiation is controlled by a positive feedback loop between the plant hormone auxin and its efflux carrier PIN-FORMED1 (PIN1). Consequently, pin1 mutants give rise to naked inflorescence stalks with few or no flowers, indicating that PIN1 plays a crucial role in organ initiation. However, pin1 mutants do produce leaves. In order to understand the regulatory mechanisms controlling leaf initiation in Arabidopsis (Arabidopsis thaliana) rosettes, we have characterized the vegetative pin1 phenotype in detail. We show that although the timing of leaf initiation in vegetative pin1 mutants is variable and divergence angles clearly deviate from the canonical 137° value, leaves are not positioned at random during early developmental stages. Our data further indicate that other PIN proteins are unlikely to explain the persistence of leaf initiation and positioning during pin1 vegetative development. Thus, phyllotaxis appears to be more complex than suggested by current mechanistic models."}],"day":"01","extern":1,"publication_status":"published","date_updated":"2021-01-12T07:00:26Z","type":"journal_article","publisher":"American Society of Plant Biologists","doi":"10.1104/pp.112.200402","intvolume":"       159","_id":"2878","page":"1501 - 1510","author":[{"first_name":"Bernadette","full_name":"Guenot, Bernadette","last_name":"Guenot"},{"full_name":"Bayer, Emmanuelle","first_name":"Emmanuelle","last_name":"Bayer"},{"last_name":"Kierzkowski","full_name":"Kierzkowski, Daniel","first_name":"Daniel"},{"last_name":"Smith","first_name":"Richard","full_name":"Smith, Richard S"},{"full_name":"Mandel, Therese","first_name":"Therese","last_name":"Mandel"},{"last_name":"Žádníková","full_name":"Žádníková, Petra","first_name":"Petra"},{"orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","full_name":"Eva Benková"},{"full_name":"Kuhlemeier, Cris","first_name":"Cris","last_name":"Kuhlemeier"}],"quality_controlled":0,"status":"public","publist_id":"3884","fulldoi":"https://doi.org/10.1104/pp.112.200402"},{"fulldoi":"https://doi.org/10.1105/tpc.112.100164","publist_id":"3885","doi":"10.1105/tpc.112.100164","intvolume":"        24","author":[{"last_name":"Bencivenga","full_name":"Bencivenga, Stefano","first_name":"Stefano"},{"full_name":"Simonini, Sara","first_name":"Sara","last_name":"Simonini"},{"orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva","full_name":"Eva Benková"},{"last_name":"Colombo","full_name":"Colombo, Lucia","first_name":"Lucia"}],"_id":"2879","status":"public","page":"2886 - 2897","quality_controlled":0,"type":"journal_article","publisher":"American Society of Plant Biologists","date_updated":"2021-01-12T07:00:26Z","publication_status":"published","day":"01","extern":1,"abstract":[{"lang":"eng","text":"Hormones, such as auxin and cytokinin, are involved in the complex molecular network that regulates the coordinated development of plant organs. Genes controlling ovule patterning have been identified and studied in detail; however, the roles of auxin and cytokinin in ovule development are largely unknown. Here we show that key cytokinin pathway genes, such as isopentenyltransferase and cytokinin receptors, are expressed during ovule development. Also, in a cre1-12 ahk2-2 ahk3-3 triple mutant with severely reduced cytokinin perception, expression of the auxin efflux facilitator PIN-FORMED 1 (PIN1) was severely reduced. In sporocyteless/nozzle (spl/nzz) mutants, which show a similar phenotype to the cre1-12 ahk2-2 ahk3-3 triple mutant, PIN1 expression is also reduced. Treatment with the exogenous cytokinin N6-benzylaminopurine also altered both auxin distribution and patterning of the ovule; this process required the homeodomain transcription factor BELL1 (BEL1). Thus, this article shows that cytokinin regulates ovule development through the regulation of PIN1. Furthermore, the transcription factors BEL1 and SPL/NZZ, previously described as key regulators of ovule development, are needed for the auxin and cytokinin signaling pathways for the correct patterning of the ovule."}],"date_published":"2012-07-01T00:00:00Z","volume":24,"publication":"Plant Cell","title":"The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis","month":"07","citation":{"ieee":"S. Bencivenga, S. Simonini, E. Benková, and L. Colombo, “The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis,” <i>Plant Cell</i>, vol. 24, no. 7. American Society of Plant Biologists, pp. 2886–2897, 2012.","apa":"Bencivenga, S., Simonini, S., Benková, E., &#38; Colombo, L. (2012). The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>","short":"S. Bencivenga, S. Simonini, E. Benková, L. Colombo, Plant Cell 24 (2012) 2886–2897.","ama":"Bencivenga S, Simonini S, Benková E, Colombo L. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. <i>Plant Cell</i>. 2012;24(7):2886-2897. doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>","chicago":"Bencivenga, Stefano, Sara Simonini, Eva Benková, and Lucia Colombo. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>. American Society of Plant Biologists, 2012. <a href=\"https://doi.org/10.1105/tpc.112.100164\">https://doi.org/10.1105/tpc.112.100164</a>.","ista":"Bencivenga S, Simonini S, Benková E, Colombo L. 2012. The transcription factors BEL1 and SPL are required for cytokinin and auxin signaling during ovule development in Arabidopsis. Plant Cell. 24(7), 2886–2897.","mla":"Bencivenga, Stefano, et al. “The Transcription Factors BEL1 and SPL Are Required for Cytokinin and Auxin Signaling during Ovule Development in Arabidopsis.” <i>Plant Cell</i>, vol. 24, no. 7, American Society of Plant Biologists, 2012, pp. 2886–97, doi:<a href=\"https://doi.org/10.1105/tpc.112.100164\">10.1105/tpc.112.100164</a>."},"year":"2012","date_created":"2018-12-11T12:00:06Z","issue":"7"},{"scopus_import":"1","article_processing_charge":"No","conference":{"end_date":"2012-10-05","location":"Innsbruck, Austria","start_date":"2012-09-30","name":"MODELS: Model-driven Engineering Languages and Systems"},"fulldoi":"https://doi.org/10.1007/978-3-642-33666-9_1","publist_id":"3870","corr_author":"1","oa_version":"None","doi":"10.1007/978-3-642-33666-9_1","intvolume":"      7590","_id":"2888","quality_controlled":"1","author":[{"orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","full_name":"Henzinger, Thomas A"}],"status":"public","month":"09","citation":{"chicago":"Henzinger, Thomas A. “Quantitative Reactive Models.” In <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, 7590:1–2. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>.","ama":"Henzinger TA. Quantitative reactive models. In: <i>15th International Conference on Model Driven Engineering Languages and Systems</i>. Vol 7590. Springer; 2012:1-2. doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>","ieee":"T. A. Henzinger, “Quantitative reactive models,” in <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, Innsbruck, Austria, 2012, vol. 7590, pp. 1–2.","short":"T.A. Henzinger, in:, 15th International Conference on Model Driven Engineering Languages and Systems, Springer, 2012, pp. 1–2.","apa":"Henzinger, T. A. (2012). Quantitative reactive models. In <i>15th International Conference on Model Driven Engineering Languages and Systems</i> (Vol. 7590, pp. 1–2). Innsbruck, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">https://doi.org/10.1007/978-3-642-33666-9_1</a>","ista":"Henzinger TA. 2012. Quantitative reactive models. 15th International Conference on Model Driven Engineering Languages and Systems. MODELS: Model-driven Engineering Languages and Systems, LNCS, vol. 7590, 1–2.","mla":"Henzinger, Thomas A. “Quantitative Reactive Models.” <i>15th International Conference on Model Driven Engineering Languages and Systems</i>, vol. 7590, Springer, 2012, pp. 1–2, doi:<a href=\"https://doi.org/10.1007/978-3-642-33666-9_1\">10.1007/978-3-642-33666-9_1</a>."},"title":"Quantitative reactive models","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"Formal verification aims to improve the quality of hardware and software by detecting errors before they do harm. At the basis of formal verification lies the logical notion of correctness, which purports to capture whether or not a circuit or program behaves as desired. We suggest that the boolean partition into correct and incorrect systems falls short of the practical need to assess the behavior of hardware and software in a more nuanced fashion against multiple criteria.","lang":"eng"}],"date_published":"2012-09-01T00:00:00Z","year":"2012","department":[{"_id":"ToHe"}],"publication_status":"published","OA_type":"closed access","language":[{"iso":"eng"}],"day":"01","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","call_identifier":"FWF"}],"date_updated":"2025-05-20T07:30:56Z","publication_identifier":{"eisbn":["9783642336669"],"eissn":["1611-3349"]},"type":"conference","publisher":"Springer","page":"1 - 2","publication":"15th International Conference on Model Driven Engineering Languages and Systems","ec_funded":1,"volume":7590,"alternative_title":["LNCS"],"date_created":"2018-12-11T12:00:09Z"},{"publication_status":"published","department":[{"_id":"ToHe"}],"day":"01","language":[{"iso":"eng"}],"project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ec_funded":1,"abstract":[{"text":"Systems are often specified using multiple requirements on their behavior. In practice, these requirements can be contradictory. The classical approach to specification, verification, and synthesis demands more detailed specifications that resolve any contradictions in the requirements. These detailed specifications are usually large, cumbersome, and hard to maintain or modify. In contrast, quantitative frameworks allow the formalization of the intuitive idea that what is desired is an implementation that comes &quot;closest&quot; to satisfying the mutually incompatible requirements, according to a measure of fit that can be defined by the requirements engineer. One flexible framework for quantifying how &quot;well&quot; an implementation satisfies a specification is offered by simulation distances that are parameterized by an error model. We introduce this framework, study its properties, and provide an algorithmic solution for the following quantitative synthesis question: given two (or more) behavioral requirements specified by possibly incompatible finite-state machines, and an error model, find the finite-state implementation that minimizes the maximal simulation distance to the given requirements. Furthermore, we generalize the framework to handle infinite alphabets (for example, realvalued domains). We also demonstrate how quantitative specifications based on simulation distances might lead to smaller and easier to modify specifications. Finally, we illustrate our approach using case studies on error correcting codes and scheduler synthesis.","lang":"eng"}],"date_published":"2012-10-01T00:00:00Z","citation":{"mla":"Cerny, Pavol, et al. “Synthesis from Incompatible Specifications.” <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, ACM, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>.","ista":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. 2012. Synthesis from incompatible specifications. Proceedings of the tenth ACM international conference on Embedded software. EMSOFT: Embedded Software , 53–62.","ama":"Cerny P, Gopi S, Henzinger TA, Radhakrishna A, Totla N. Synthesis from incompatible specifications. In: <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>. ACM; 2012:53-62. doi:<a href=\"https://doi.org/10.1145/2380356.2380371\">10.1145/2380356.2380371</a>","chicago":"Cerny, Pavol, Sivakanth Gopi, Thomas A Henzinger, Arjun Radhakrishna, and Nishant Totla. “Synthesis from Incompatible Specifications.” In <i>Proceedings of the Tenth ACM International Conference on Embedded Software</i>, 53–62. ACM, 2012. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>.","apa":"Cerny, P., Gopi, S., Henzinger, T. A., Radhakrishna, A., &#38; Totla, N. (2012). Synthesis from incompatible specifications. In <i>Proceedings of the tenth ACM international conference on Embedded software</i> (pp. 53–62). Tampere, Finland: ACM. <a href=\"https://doi.org/10.1145/2380356.2380371\">https://doi.org/10.1145/2380356.2380371</a>","short":"P. Cerny, S. Gopi, T.A. Henzinger, A. Radhakrishna, N. Totla, in:, Proceedings of the Tenth ACM International Conference on Embedded Software, ACM, 2012, pp. 53–62.","ieee":"P. Cerny, S. Gopi, T. A. Henzinger, A. Radhakrishna, and N. Totla, “Synthesis from incompatible specifications,” in <i>Proceedings of the tenth ACM international conference on Embedded software</i>, Tampere, Finland, 2012, pp. 53–62."},"title":"Synthesis from incompatible specifications","publication":"Proceedings of the tenth ACM international conference on Embedded software","month":"10","year":"2012","date_created":"2018-12-11T12:00:10Z","fulldoi":"https://doi.org/10.1145/2380356.2380371","publist_id":"3868","doi":"10.1145/2380356.2380371","status":"public","_id":"2890","quality_controlled":"1","page":"53 - 62","author":[{"first_name":"Pavol","full_name":"Cerny, Pavol","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","last_name":"Cerny"},{"full_name":"Gopi, Sivakanth","first_name":"Sivakanth","last_name":"Gopi"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","full_name":"Radhakrishna, Arjun","first_name":"Arjun"},{"last_name":"Totla","first_name":"Nishant","full_name":"Totla, Nishant"}],"type":"conference","publisher":"ACM","oa_version":"None","date_updated":"2021-01-12T07:00:30Z","scopus_import":1,"conference":{"name":"EMSOFT: Embedded Software ","start_date":"2012-10-07","end_date":"2012-10-12","location":"Tampere, Finland"}},{"publication":"Modeling and Analysis of Information Systems","volume":19,"issue":"6","date_created":"2018-12-11T12:00:15Z","main_file_link":[{"open_access":"1","url":"http://mi.mathnet.ru/eng/mais280"}],"oa":1,"date_updated":"2026-06-18T18:37:14Z","article_type":"original","publisher":"Russian Academy of Sciences","type":"journal_article","page":"152 - 160","month":"12","title":"Fractal and computational geometry for generalizing cartographic objects","citation":{"ama":"Edelsbrunner H, Musin O, Ukhalov A, et al. Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. 2012;19(6):152-160.","chicago":"Edelsbrunner, Herbert, Oleg Musin, Alexey Ukhalov, Olga Yakimova, Vladislav Alexeev, Victoriya Bogaevskaya, Andrey Gorohov, and Margarita Preobrazhenskaya. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences, 2012.","ieee":"H. Edelsbrunner <i>et al.</i>, “Fractal and computational geometry for generalizing cartographic objects,” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6. Russian Academy of Sciences, pp. 152–160, 2012.","short":"H. Edelsbrunner, O. Musin, A. Ukhalov, O. Yakimova, V. Alexeev, V. Bogaevskaya, A. Gorohov, M. Preobrazhenskaya, Modeling and Analysis of Information Systems 19 (2012) 152–160.","apa":"Edelsbrunner, H., Musin, O., Ukhalov, A., Yakimova, O., Alexeev, V., Bogaevskaya, V., … Preobrazhenskaya, M. (2012). Fractal and computational geometry for generalizing cartographic objects. <i>Modeling and Analysis of Information Systems</i>. Russian Academy of Sciences.","mla":"Edelsbrunner, Herbert, et al. “Fractal and computational geometry for generalizing cartographic objects.” <i>Modeling and Analysis of Information Systems</i>, vol. 19, no. 6, Russian Academy of Sciences, 2012, pp. 152–60.","ista":"Edelsbrunner H, Musin O, Ukhalov A, Yakimova O, Alexeev V, Bogaevskaya V, Gorohov A, Preobrazhenskaya M. 2012. Fractal and computational geometry for generalizing cartographic objects. Modeling and Analysis of Information Systems. 19(6), 152–160."},"date_published":"2012-12-01T00:00:00Z","abstract":[{"lang":"eng","text":"We present an algorithm for simplifying linear cartographic objects and results obtained with a computer program implementing this algorithm. "}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","year":"2012","department":[{"_id":"HeEd"}],"publication_status":"published","language":[{"iso":"rus"}],"day":"01","article_processing_charge":"No","publist_id":"3845","ddc":["500"],"oa_version":"Published Version","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Oleg","full_name":"Musin, Oleg","last_name":"Musin"},{"last_name":"Ukhalov","full_name":"Ukhalov, Alexey","first_name":"Alexey"},{"last_name":"Yakimova","full_name":"Yakimova, Olga","first_name":"Olga"},{"full_name":"Alexeev, Vladislav","first_name":"Vladislav","last_name":"Alexeev"},{"full_name":"Bogaevskaya, Victoriya","first_name":"Victoriya","last_name":"Bogaevskaya"},{"full_name":"Gorohov, Andrey","first_name":"Andrey","last_name":"Gorohov"},{"first_name":"Margarita","full_name":"Preobrazhenskaya, Margarita","last_name":"Preobrazhenskaya"}],"quality_controlled":"1","status":"public","_id":"2902","intvolume":"        19"},{"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In order to enjoy a digital version of the Jordan Curve Theorem, it is common to use the closed topology for the foreground and the open topology for the background of a 2-dimensional binary image. In this paper, we introduce a single topology that enjoys this theorem for all thresholds decomposing a real-valued image into foreground and background. This topology is easy to construct and it generalizes to n-dimensional images."}],"date_published":"2012-08-06T00:00:00Z","citation":{"mla":"Edelsbrunner, Herbert, and Olga Symonova. <i>The Adaptive Topology of a Digital Image</i>. IEEE, 2012, pp. 41–48, doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>.","ista":"Edelsbrunner H, Symonova O. 2012. The adaptive topology of a digital image. ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, 41–48.","apa":"Edelsbrunner, H., &#38; Symonova, O. (2012). The adaptive topology of a digital image (pp. 41–48). Presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA : IEEE. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>","ieee":"H. Edelsbrunner and O. Symonova, “The adaptive topology of a digital image,” presented at the ISVD: International Symposium on Voronoi Diagrams in Science and Engineering, New Brunswick, NJ, USA , 2012, pp. 41–48.","short":"H. Edelsbrunner, O. Symonova, in:, IEEE, 2012, pp. 41–48.","ama":"Edelsbrunner H, Symonova O. The adaptive topology of a digital image. In: IEEE; 2012:41-48. doi:<a href=\"https://doi.org/10.1109/ISVD.2012.11\">10.1109/ISVD.2012.11</a>","chicago":"Edelsbrunner, Herbert, and Olga Symonova. “The Adaptive Topology of a Digital Image,” 41–48. IEEE, 2012. <a href=\"https://doi.org/10.1109/ISVD.2012.11\">https://doi.org/10.1109/ISVD.2012.11</a>."},"month":"08","title":"The adaptive topology of a digital image","year":"2012","publication_status":"published","department":[{"_id":"HeEd"},{"_id":"MaJö"}],"file_date_updated":"2020-07-14T12:45:52Z","language":[{"iso":"eng"}],"day":"06","scopus_import":1,"conference":{"end_date":"2012-06-29","location":"New Brunswick, NJ, USA ","name":"ISVD: International Symposium on Voronoi Diagrams in Science and Engineering","start_date":"2012-06-27"},"ddc":["000"],"fulldoi":"https://doi.org/10.1109/ISVD.2012.11","publist_id":"3844","doi":"10.1109/ISVD.2012.11","_id":"2903","status":"public","quality_controlled":"1","author":[{"full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Olga","full_name":"Symonova, Olga","id":"3C0C7BC6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2012-9947","last_name":"Symonova"}],"corr_author":"1","oa_version":"Submitted Version","has_accepted_license":"1","date_created":"2018-12-11T12:00:15Z","pubrep_id":"545","oa":1,"date_updated":"2024-10-09T20:54:57Z","file":[{"date_created":"2018-12-12T10:09:41Z","date_updated":"2020-07-14T12:45:52Z","file_id":"4765","file_name":"IST-2016-545-v1+1_2012-P-10-AdaptiveTopology.pdf","creator":"system","relation":"main_file","checksum":"444869a4e8abf07834f88b6e5cb5e9c3","file_size":760548,"content_type":"application/pdf","access_level":"open_access"}],"page":"41 - 48","type":"conference","publisher":"IEEE"},{"date_published":"2012-01-01T00:00:00Z","abstract":[{"lang":"eng","text":"Generalized van der Corput sequences are onedimensional, infinite sequences in the unit interval. They are generated from permutations in integer base b and are the building blocks of the multi-dimensional Halton sequences. Motivated by recent progress of Atanassov on the uniform distribution behavior of Halton sequences, we study, among others, permutations of the form P(i) = ai (mod b) for coprime integers a and b. We show that multipliers a that either divide b - 1 or b + 1 generate van der Corput sequences with weak distribution properties. We give explicit lower bounds for the asymptotic distribution behavior of these sequences and relate them to sequences generated from the identity permutation in smaller bases, which are, due to Faure, the weakest distributed generalized van der Corput sequences."},{"text":"Les suites de Van der Corput généralisées sont dessuites unidimensionnelles et infinies dans l’intervalle de l’unité.Elles sont générées par permutations des entiers de la basebetsont les éléments constitutifs des suites multi-dimensionnelles deHalton. Suites aux progrès récents d’Atanassov concernant le com-portement de distribution uniforme des suites de Halton nous nousintéressons aux permutations de la formuleP(i)  =ai(modb)pour les entiers premiers entre euxaetb. Dans cet article nousidentifions des multiplicateursagénérant des suites de Van derCorput ayant une mauvaise distribution. Nous donnons les bornesinférieures explicites pour cette distribution asymptotique asso-ciée à ces suites et relions ces dernières aux suites générées parpermutation d’identité, qui sont, selon Faure, les moins bien dis-tribuées des suites généralisées de Van der Corput dans une basedonnée.","lang":"fre"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","month":"01","title":"Weak multipliers for generalized van der Corput sequences","citation":{"apa":"Pausinger, F. (2012). Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>","short":"F. Pausinger, Journal de Theorie Des Nombres Des Bordeaux 24 (2012) 729–749.","ieee":"F. Pausinger, “Weak multipliers for generalized van der Corput sequences,” <i>Journal de Theorie des Nombres des Bordeaux</i>, vol. 24, no. 3. Université de Bordeaux, pp. 729–749, 2012.","chicago":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>. Université de Bordeaux, 2012. <a href=\"https://doi.org/10.5802/jtnb.819\">https://doi.org/10.5802/jtnb.819</a>.","ama":"Pausinger F. Weak multipliers for generalized van der Corput sequences. <i>Journal de Theorie des Nombres des Bordeaux</i>. 2012;24(3):729-749. doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>","mla":"Pausinger, Florian. “Weak Multipliers for Generalized van Der Corput Sequences.” <i>Journal de Theorie Des Nombres Des Bordeaux</i>, vol. 24, no. 3, Université de Bordeaux, 2012, pp. 729–49, doi:<a href=\"https://doi.org/10.5802/jtnb.819\">10.5802/jtnb.819</a>.","ista":"Pausinger F. 2012. Weak multipliers for generalized van der Corput sequences. Journal de Theorie des Nombres des Bordeaux. 24(3), 729–749."},"year":"2012","publication_status":"published","file_date_updated":"2020-07-14T12:45:52Z","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"day":"01","article_processing_charge":"No","scopus_import":"1","external_id":{"isi":["000315243100011"]},"ddc":["510"],"publist_id":"3843","fulldoi":"https://doi.org/10.5802/jtnb.819","author":[{"last_name":"Pausinger","id":"2A77D7A2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8379-3768","full_name":"Pausinger, Florian","first_name":"Florian"}],"_id":"2904","status":"public","quality_controlled":"1","doi":"10.5802/jtnb.819","intvolume":"        24","oa_version":"Published Version","volume":24,"has_accepted_license":"1","publication":"Journal de Theorie des Nombres des Bordeaux","issue":"3","date_created":"2018-12-11T12:00:15Z","oa":1,"date_updated":"2025-09-30T08:18:15Z","file":[{"relation":"main_file","creator":"dernst","checksum":"6954bfe9d7f4119fbdda7a11cf0f5c67","file_size":819275,"content_type":"application/pdf","access_level":"open_access","date_created":"2020-05-11T12:40:39Z","date_updated":"2020-07-14T12:45:52Z","file_id":"7819","file_name":"JTNB_2012__24_3_729_0.pdf"}],"article_type":"original","isi":1,"publication_identifier":{"eissn":["2118-8572"],"issn":["1246-7405"]},"page":"729 - 749","publisher":"Université de Bordeaux","type":"journal_article"},{"extern":1,"day":"01","publication_status":"published","year":"2012","date_created":"2018-12-11T12:00:18Z","abstract":[{"lang":"eng","text":"We have selected problems that may not yet be well known, but have the\npotential to push the research in interesting directions. In particular, we state\nproblems that do not require specific knowledge outside the standard circle of ideas\nin discrete geometry. Despite the relatively simple statements, these problems are\nrelated to current research and their solutions are likely to require new ideas and\napproaches. We have chosen problems from different fields to make this short paper\nattractive to a wide range of specialists."}],"date_published":"2012-01-01T00:00:00Z","volume":"in print","citation":{"ista":"Edelsbrunner H, Ivanov A, Karasev R. 2012. Open problems in discrete and computational geometry. Automatic Control and Computer Sciences. in print.","mla":"Edelsbrunner, Herbert, et al. “Open Problems in Discrete and Computational Geometry.” <i>Automatic Control and Computer Sciences</i>, vol. in print, Springer, 2012.","chicago":"Edelsbrunner, Herbert, Alexander Ivanov, and Roman Karasev. “Open Problems in Discrete and Computational Geometry.” <i>Automatic Control and Computer Sciences</i>. Springer, 2012.","ama":"Edelsbrunner H, Ivanov A, Karasev R. Open problems in discrete and computational geometry. <i>Automatic Control and Computer Sciences</i>. 2012;in print.","apa":"Edelsbrunner, H., Ivanov, A., &#38; Karasev, R. (2012). Open problems in discrete and computational geometry. <i>Automatic Control and Computer Sciences</i>. Springer.","ieee":"H. Edelsbrunner, A. Ivanov, and R. Karasev, “Open problems in discrete and computational geometry,” <i>Automatic Control and Computer Sciences</i>, vol. in print. Springer, 2012.","short":"H. Edelsbrunner, A. Ivanov, R. Karasev, Automatic Control and Computer Sciences in print (2012)."},"publication":"Automatic Control and Computer Sciences","title":"Open problems in discrete and computational geometry","month":"01","author":[{"full_name":"Herbert Edelsbrunner","first_name":"Herbert","last_name":"Edelsbrunner","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"first_name":"Alexander","full_name":"Ivanov, Alexander","last_name":"Ivanov"},{"last_name":"Karasev","first_name":"Roman","full_name":"Karasev, Roman"}],"_id":"2911","quality_controlled":0,"status":"public","publisher":"Springer","type":"journal_article","publist_id":"3832","date_updated":"2021-01-12T07:00:38Z"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2012-10-01T00:00:00Z","volume":67,"month":"10","publication":"Russian Mathematical Surveys","title":"On the configuration space for the shortest networks","citation":{"mla":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6, Russian Academy of Sciences, 2012, pp. 1167–1168, doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>.","ista":"Edelsbrunner H, Strelkova N. 2012. On the configuration space for the shortest networks. Russian Mathematical Surveys. 67(6), 1167–1168.","chicago":"Edelsbrunner, Herbert, and Nataliya Strelkova. “On the Configuration Space for the Shortest Networks.” <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences, 2012. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>.","ama":"Edelsbrunner H, Strelkova N. On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. 2012;67(6):1167–1168. doi:<a href=\"https://doi.org/10.4213/rm9503\">10.4213/rm9503</a>","short":"H. Edelsbrunner, N. Strelkova, Russian Mathematical Surveys 67 (2012) 1167–1168.","ieee":"H. Edelsbrunner and N. Strelkova, “On the configuration space for the shortest networks,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 6. Russian Academy of Sciences, pp. 1167–1168, 2012.","apa":"Edelsbrunner, H., &#38; Strelkova, N. (2012). On the configuration space for the shortest networks. <i>Russian Mathematical Surveys</i>. Russian Academy of Sciences. <a href=\"https://doi.org/10.4213/rm9503\">https://doi.org/10.4213/rm9503</a>"},"year":"2012","date_created":"2018-12-11T12:00:18Z","issue":"6","publication_status":"published","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"day":"01","article_processing_charge":"No","date_updated":"2023-10-17T11:40:39Z","fulldoi":"https://doi.org/10.4213/rm9503","publist_id":"3831","intvolume":"        67","doi":"10.4213/rm9503","status":"public","_id":"2912","page":"1167–1168","quality_controlled":"1","author":[{"last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert"},{"last_name":"Strelkova","first_name":"Nataliya","full_name":"Strelkova, Nataliya"}],"type":"journal_article","publisher":"Russian Academy of Sciences","oa_version":"None"},{"publication_status":"published","department":[{"_id":"ChLa"}],"day":"11","language":[{"iso":"eng"}],"date_published":"2012-10-11T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","acknowledgement":"The project receives funding from the European Community’s Seventh Framework Programme under grant agreement\r\nno. ICT- 248273 GeRT.","month":"10","title":"Multi-modal learning for dynamic tactile sensing","citation":{"mla":"Kroemer, Oliver, et al. <i>Multi-Modal Learning for Dynamic Tactile Sensing</i>. Deutsches Zentrum für Luft und Raumfahrt, 2012.","ista":"Kroemer O, Lampert C, Peters J. 2012. Multi-modal learning for dynamic tactile sensing","ieee":"O. Kroemer, C. Lampert, and J. Peters, “Multi-modal learning for dynamic tactile sensing,” 2012.","short":"O. Kroemer, C. Lampert, J. Peters, in:, Deutsches Zentrum für Luft und Raumfahrt, 2012.","apa":"Kroemer, O., Lampert, C., &#38; Peters, J. (2012). Multi-modal learning for dynamic tactile sensing. Deutsches Zentrum für Luft und Raumfahrt.","chicago":"Kroemer, Oliver, Christoph Lampert, and Jan Peters. “Multi-Modal Learning for Dynamic Tactile Sensing.” Deutsches Zentrum für Luft und Raumfahrt, 2012.","ama":"Kroemer O, Lampert C, Peters J. Multi-modal learning for dynamic tactile sensing. In: Deutsches Zentrum für Luft und Raumfahrt; 2012."},"year":"2012","date_created":"2018-12-11T12:00:19Z","publist_id":"3828","quality_controlled":"1","_id":"2915","author":[{"full_name":"Kroemer, Oliver","first_name":"Oliver","last_name":"Kroemer"},{"full_name":"Lampert, Christoph","first_name":"Christoph","last_name":"Lampert","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"full_name":"Peters, Jan","first_name":"Jan","last_name":"Peters"}],"status":"public","publisher":"Deutsches Zentrum für Luft und Raumfahrt","oa_version":"None","type":"conference","article_processing_charge":"No","date_updated":"2023-10-17T07:58:59Z"},{"date_updated":"2025-09-29T13:14:24Z","page":"29 - 42","related_material":{"record":[{"status":"public","id":"1733","relation":"later_version"}]},"publisher":"EPTCS","type":"conference","volume":96,"ec_funded":1,"publication":"Electronic Proceedings in Theoretical Computer Science","date_created":"2018-12-11T12:00:19Z","main_file_link":[{"url":"http://arxiv.org/abs/1210.2450","open_access":"1"}],"oa":1,"arxiv":1,"scopus_import":1,"conference":{"location":"Napoli, Italy","end_date":"2012-09-08","start_date":"2012-09-06","name":"GandALF: Games, Automata, Logic, and Formal Verification"},"external_id":{"arxiv":["1210.2450"]},"fulldoi":"https://doi.org/10.4204/EPTCS.96.3","publist_id":"3827","_id":"2916","author":[{"last_name":"Cerny","id":"4DCBEFFE-F248-11E8-B48F-1D18A9856A87","full_name":"Cerny, Pavol","first_name":"Pavol"},{"first_name":"Martin","full_name":"Chmelik, Martin","id":"3624234E-F248-11E8-B48F-1D18A9856A87","last_name":"Chmelik"},{"last_name":"Henzinger","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A"},{"full_name":"Radhakrishna, Arjun","first_name":"Arjun","last_name":"Radhakrishna","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87"}],"status":"public","quality_controlled":"1","doi":"10.4204/EPTCS.96.3","intvolume":"        96","oa_version":"Submitted Version","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 quantitative measure for interfaces, called interface simulation distance. It makes the alternating refinement preorder quantitative by, intu- itively, 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, and that the distance between two interfaces can be bounded from above and below by distances between abstractions of the two interfaces. We illustrate the framework, and the properties of the distances under composition of interfaces, with two case studies.","lang":"eng"}],"date_published":"2012-10-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","title":"Interface Simulation Distances","citation":{"ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2012. Interface Simulation Distances. Electronic Proceedings in Theoretical Computer Science. GandALF: Games, Automata, Logic, and Formal Verification vol. 96, 29–42.","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” <i>Electronic Proceedings in Theoretical Computer Science</i>, vol. 96, EPTCS, 2012, pp. 29–42, doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>.","chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” In <i>Electronic Proceedings in Theoretical Computer Science</i>, 96:29–42. EPTCS, 2012. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface Simulation Distances. In: <i>Electronic Proceedings in Theoretical Computer Science</i>. Vol 96. EPTCS; 2012:29-42. doi:<a href=\"https://doi.org/10.4204/EPTCS.96.3\">10.4204/EPTCS.96.3</a>","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface Simulation Distances,” in <i>Electronic Proceedings in Theoretical Computer Science</i>, Napoli, Italy, 2012, vol. 96, pp. 29–42.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, 2012, pp. 29–42.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., &#38; Radhakrishna, A. (2012). Interface Simulation Distances. In <i>Electronic Proceedings in Theoretical Computer Science</i> (Vol. 96, pp. 29–42). Napoli, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.96.3\">https://doi.org/10.4204/EPTCS.96.3</a>"},"year":"2012","publication_status":"published","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"project":[{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"day":"07","language":[{"iso":"eng"}]},{"date_updated":"2025-09-29T13:28:52Z","isi":1,"type":"journal_article","publisher":"Cambridge University Press","page":"53 - 62","publication":"International Journal of Astrobiology","volume":12,"date_created":"2018-12-11T12:00:19Z","issue":"1","scopus_import":"1","article_processing_charge":"No","external_id":{"isi":["000312526700008"]},"fulldoi":"https://doi.org/10.1017/S1473550412000407","publist_id":"3821","corr_author":"1","oa_version":"None","doi":"10.1017/S1473550412000407","intvolume":"        12","_id":"2917","quality_controlled":"1","status":"public","author":[{"last_name":"Vladar","orcid":"0000-0002-5985-7653","id":"2A181218-F248-11E8-B48F-1D18A9856A87","full_name":"Vladar, Harold","first_name":"Harold"}],"citation":{"ista":"de Vladar H. 2012. The game of active search for extra terrestrial intelligence Breaking the Great Silence . International Journal of Astrobiology. 12(1), 53–62.","mla":"de Vladar, Harold. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” <i>International Journal of Astrobiology</i>, vol. 12, no. 1, Cambridge University Press, 2012, pp. 53–62, doi:<a href=\"https://doi.org/10.1017/S1473550412000407\">10.1017/S1473550412000407</a>.","ieee":"H. de Vladar, “The game of active search for extra terrestrial intelligence Breaking the Great Silence ,” <i>International Journal of Astrobiology</i>, vol. 12, no. 1. Cambridge University Press, pp. 53–62, 2012.","apa":"de Vladar, H. (2012). The game of active search for extra terrestrial intelligence Breaking the Great Silence . <i>International Journal of Astrobiology</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/S1473550412000407\">https://doi.org/10.1017/S1473550412000407</a>","short":"H. de Vladar, International Journal of Astrobiology 12 (2012) 53–62.","chicago":"Vladar, Harold de. “The Game of Active Search for Extra Terrestrial Intelligence Breaking the Great Silence .” <i>International Journal of Astrobiology</i>. Cambridge University Press, 2012. <a href=\"https://doi.org/10.1017/S1473550412000407\">https://doi.org/10.1017/S1473550412000407</a>.","ama":"de Vladar H. The game of active search for extra terrestrial intelligence Breaking the Great Silence . <i>International Journal of Astrobiology</i>. 2012;12(1):53-62. doi:<a href=\"https://doi.org/10.1017/S1473550412000407\">10.1017/S1473550412000407</a>"},"title":"The game of active search for extra terrestrial intelligence Breaking the Great Silence ","month":"11","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"lang":"eng","text":"The search for extra-terrestrial intelligence (SETI) has been performed principally as a one-way survey, listening of radio frequencies across the Milky Way and other galaxies. However, scientists have engaged in an active messaging only rarely. This suggests the simple rationale that if other civilizations exist and take a similar approach to ours, namely listening but not broadcasting, the result is a silent universe. A simple game theoretical model, the prisoner's dilemma, explains this situation: each player (civilization) can passively search (defect), or actively search and broadcast (cooperate). In order to maximize the payoff (or, equivalently, minimize the risks) the best strategy is not to broadcast. In fact, the active search has been opposed on the basis that it might be dangerous to expose ourselves. However, most of these ideas have not been based on objective arguments, and ignore accounting of the possible gains and losses. Thus, the question stands: should we perform an active search? I develop a game-theoretical framework where civilizations can be of different types, and explicitly apply it to a situation where societies are either interested in establishing a two-way communication or belligerent and in urge to exploit ours. The framework gives a quantitative solution (a mixed-strategy), which is how frequent we should perform the active SETI. This frequency is roughly proportional to the inverse of the risk, and can be extremely small. However, given the immense amount of stars being scanned, it supports active SETI. The model is compared with simulations, and the possible actions are evaluated through the San Marino scale, measuring the risks of messaging."}],"date_published":"2012-11-06T00:00:00Z","year":"2012","department":[{"_id":"NiBa"}],"publication_status":"published","day":"06","language":[{"iso":"eng"}]},{"date_updated":"2025-07-08T07:19:42Z","article_processing_charge":"No","arxiv":1,"external_id":{"arxiv":["1205.6352"]},"article_number":"1205.6352","fulldoi":"https://doi.org/10.48550/arXiv.1205.6352","publist_id":"3809","corr_author":"1","type":"preprint","oa_version":"Preprint","doi":"10.48550/arXiv.1205.6352","author":[{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"first_name":"Thomas","full_name":"Schoenemann, Thomas","last_name":"Schoenemann"}],"_id":"2928","status":"public","citation":{"ieee":"V. Kolmogorov and T. Schoenemann, “Generalized sequential tree-reweighted message passing,” <i>arXiv</i>. .","apa":"Kolmogorov, V., &#38; Schoenemann, T. (n.d.). Generalized sequential tree-reweighted message passing. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>","short":"V. Kolmogorov, T. Schoenemann, ArXiv (n.d.).","ama":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>","chicago":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1205.6352\">https://doi.org/10.48550/arXiv.1205.6352</a>.","mla":"Kolmogorov, Vladimir, and Thomas Schoenemann. “Generalized Sequential Tree-Reweighted Message Passing.” <i>ArXiv</i>, 1205.6352, doi:<a href=\"https://doi.org/10.48550/arXiv.1205.6352\">10.48550/arXiv.1205.6352</a>.","ista":"Kolmogorov V, Schoenemann T. Generalized sequential tree-reweighted message passing. arXiv, 1205.6352."},"title":"Generalized sequential tree-reweighted message passing","month":"05","publication":"arXiv","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"     This paper addresses the problem of approximate MAP-MRF inference in general graphical models. Following [36], we consider a family of linear programming relaxations of the problem where each relaxation is specified by a set of nested pairs of factors for which the marginalization constraint needs to be enforced. We develop a generalization of the TRW-S algorithm [9] for this problem, where we use a decomposition into junction chains, monotonic w.r.t. some ordering on the nodes. This generalizes the monotonic chains in [9] in a natural way. We also show how to deal with nested factors in an efficient way. Experiments show an improvement over min-sum diffusion, MPLP and subgradient ascent algorithms on a number of computer vision and natural language processing problems. ","lang":"eng"}],"date_published":"2012-05-29T00:00:00Z","date_created":"2018-12-11T12:00:23Z","year":"2012","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1205.6352"}],"department":[{"_id":"VlKo"}],"publication_status":"submitted","day":"29","language":[{"iso":"eng"}],"oa":1},{"year":"2012","date_created":"2018-12-11T12:00:24Z","date_published":"2012-01-01T00:00:00Z","title":"The power of linear programming for valued CSPs: a constructive characterization","citation":{"ama":"Kolmogorov V. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown; 2012.","chicago":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","short":"V. Kolmogorov, The Power of Linear Programming for Valued CSPs: A Constructive Characterization, Unknown, 2012.","apa":"Kolmogorov, V. (2012). <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown.","ieee":"V. Kolmogorov, <i>The power of linear programming for valued CSPs: a constructive characterization</i>. Unknown, 2012.","mla":"Kolmogorov, Vladimir. <i>The Power of Linear Programming for Valued CSPs: A Constructive Characterization</i>. Unknown, 2012.","ista":"Kolmogorov V. 2012. The power of linear programming for valued CSPs: a constructive characterization, Unknown,p."},"month":"01","extern":1,"oa":1,"day":"01","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1207.7213","open_access":"1"}],"date_updated":"2019-04-26T07:22:21Z","author":[{"first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"_id":"2929","quality_controlled":0,"status":"public","publisher":"Unknown","type":"report","publist_id":"3807"},{"date_updated":"2025-06-11T08:08:15Z","page":"451 - 462","type":"conference","publisher":"Springer","volume":7422,"alternative_title":["LNCS"],"acknowledgement":"We would like to thank Andrei Krokhin for encourag- ing our cooperation, for helpful discussions, and for his critical reading of the manuscript.\r\n","date_created":"2018-12-11T12:00:24Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1309.5469"}],"oa":1,"article_processing_charge":"No","arxiv":1,"scopus_import":"1","conference":{"end_date":"2012-04-21","location":"Athens, Greece","name":"ISCO: International Symposium on Combinatorial Optimization","start_date":"2012-04-19"},"external_id":{"arxiv":["1309.5469"]},"fulldoi":"https://doi.org/10.1007/978-3-642-32147-4_40","publist_id":"3806","doi":"10.1007/978-3-642-32147-4_40","intvolume":"      7422","_id":"2930","status":"public","quality_controlled":"1","author":[{"full_name":"Huber, Anna","first_name":"Anna","last_name":"Huber"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"}],"oa_version":"Preprint","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"In this paper we investigate k-submodular functions. This natural family of discrete functions includes submodular and bisubmodular functions as the special cases k = 1 and k = 2 respectively.\r\n\r\nIn particular we generalize the known Min-Max-Theorem for submodular and bisubmodular functions. This theorem asserts that the minimum of the (bi)submodular function can be found by solving a maximization problem over a (bi)submodular polyhedron. We define a k-submodular polyhedron, prove a Min-Max-Theorem for k-submodular functions, and give a greedy algorithm to construct the vertices of the polyhedron.\r\n"}],"date_published":"2012-04-01T00:00:00Z","title":"Towards minimizing k-submodular functions","month":"04","citation":{"apa":"Huber, A., &#38; Kolmogorov, V. (2012). Towards minimizing k-submodular functions (Vol. 7422, pp. 451–462). Presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>","short":"A. Huber, V. Kolmogorov, in:, Springer, 2012, pp. 451–462.","ieee":"A. Huber and V. Kolmogorov, “Towards minimizing k-submodular functions,” presented at the ISCO: International Symposium on Combinatorial Optimization, Athens, Greece, 2012, vol. 7422, pp. 451–462.","ama":"Huber A, Kolmogorov V. Towards minimizing k-submodular functions. In: Vol 7422. Springer; 2012:451-462. doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>","chicago":"Huber, Anna, and Vladimir Kolmogorov. “Towards Minimizing K-Submodular Functions,” 7422:451–62. Springer, 2012. <a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">https://doi.org/10.1007/978-3-642-32147-4_40</a>.","mla":"Huber, Anna, and Vladimir Kolmogorov. <i>Towards Minimizing K-Submodular Functions</i>. Vol. 7422, Springer, 2012, pp. 451–62, doi:<a href=\"https://doi.org/10.1007/978-3-642-32147-4_40\">10.1007/978-3-642-32147-4_40</a>.","ista":"Huber A, Kolmogorov V. 2012. Towards minimizing k-submodular functions. ISCO: International Symposium on Combinatorial Optimization, LNCS, vol. 7422, 451–462."},"year":"2012","publication_status":"published","department":[{"_id":"VlKo"}],"day":"01","language":[{"iso":"eng"}]},{"day":"08","language":[{"iso":"eng"}],"project":[{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"department":[{"_id":"VlKo"}],"publication_status":"published","year":"2012","title":"A dual decomposition approach to feature correspondence","month":"05","citation":{"short":"L. Torresani, V. Kolmogorov, C. Rother, IEEE Transactions on Pattern Analysis and Machine Intelligence 35 (2012) 259–271.","apa":"Torresani, L., Kolmogorov, V., &#38; Rother, C. (2012). A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>","ieee":"L. Torresani, V. Kolmogorov, and C. Rother, “A dual decomposition approach to feature correspondence,” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2. IEEE, pp. 259–271, 2012.","ama":"Torresani L, Kolmogorov V, Rother C. A dual decomposition approach to feature correspondence. <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. 2012;35(2):259-271. doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>","chicago":"Torresani, Lorenzo, Vladimir Kolmogorov, and Carsten Rother. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>. IEEE, 2012. <a href=\"https://doi.org/10.1109/TPAMI.2012.105\">https://doi.org/10.1109/TPAMI.2012.105</a>.","mla":"Torresani, Lorenzo, et al. “A Dual Decomposition Approach to Feature Correspondence.” <i>IEEE Transactions on Pattern Analysis and Machine Intelligence</i>, vol. 35, no. 2, IEEE, 2012, pp. 259–71, doi:<a href=\"https://doi.org/10.1109/TPAMI.2012.105\">10.1109/TPAMI.2012.105</a>.","ista":"Torresani L, Kolmogorov V, Rother C. 2012. A dual decomposition approach to feature correspondence. IEEE Transactions on Pattern Analysis and Machine Intelligence. 35(2), 259–271."},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2012-05-08T00:00:00Z","abstract":[{"lang":"eng","text":"In this paper, we present a new approach for establishing correspondences between sparse image features related by an unknown nonrigid mapping and corrupted by clutter and occlusion, such as points extracted from images of different instances of the same object category. We formulate this matching task as an energy minimization problem by defining an elaborate objective function of the appearance and the spatial arrangement of the features. Optimization of this energy is an instance of graph matching, which is in general an NP-hard problem. We describe a novel graph matching optimization technique, which we refer to as dual decomposition (DD), and demonstrate on a variety of examples that this method outperforms existing graph matching algorithms. In the majority of our examples, DD is able to find the global minimum within a minute. The ability to globally optimize the objective allows us to accurately learn the parameters of our matching model from training examples. We show on several matching tasks that our learned model yields results superior to those of state-of-the-art methods.\r\n"}],"oa_version":"None","doi":"10.1109/TPAMI.2012.105","intvolume":"        35","_id":"2931","status":"public","quality_controlled":"1","author":[{"full_name":"Torresani, Lorenzo","first_name":"Lorenzo","last_name":"Torresani"},{"first_name":"Vladimir","full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"}],"publist_id":"3805","fulldoi":"https://doi.org/10.1109/TPAMI.2012.105","external_id":{"isi":["000312560600002"]},"scopus_import":"1","article_processing_charge":"No","date_created":"2018-12-11T12:00:24Z","issue":"2","publication":"IEEE Transactions on Pattern Analysis and Machine Intelligence","acknowledgement":"This research was funded in part by Microsoft Research.","volume":35,"type":"journal_article","publisher":"IEEE","page":"259 - 271","isi":1,"date_updated":"2025-09-30T08:15:06Z"},{"date_updated":"2025-07-10T11:52:23Z","publisher":"ACM","type":"conference","page":"488 - 500","date_created":"2018-12-11T12:00:26Z","acknowledgement":"This work was partially funded by National Funds through the FCT - Fundação para a Ciência e a Tecnologia (Portuguese Foundation for Science and Technology) within project ENI-AC/2224/2009, by ENIAC Joint Undertaking under grant agreement number 120224, European Projects FP7-256980 NESSoS and FP7-229599 AMAROUT, Spanish National project TIN2009-14599 DESAFIOS 10, and Madrid Regional project S2009TIC-1465 PROMETIDOS.","publication":"Proceedings of the 2012 ACM conference on Computer and communications security","oa":1,"main_file_link":[{"url":"https://eprint.iacr.org/2012/258","open_access":"1"}],"conference":{"end_date":"2012-10-18","location":"Raleigh, NC, USA","name":"CCS: Conference on Computer and Communications Security","start_date":"2012-10-16"},"scopus_import":"1","article_processing_charge":"No","oa_version":"Submitted Version","author":[{"first_name":"José","full_name":"Almeida, José","last_name":"Almeida"},{"full_name":"Barbosa, Manuel","first_name":"Manuel","last_name":"Barbosa"},{"last_name":"Bangerter","full_name":"Bangerter, Endre","first_name":"Endre"},{"first_name":"Gilles","full_name":"Barthe, Gilles","last_name":"Barthe"},{"orcid":"0000-0003-2835-9093","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","last_name":"Krenn","first_name":"Stephan","full_name":"Krenn, Stephan"},{"last_name":"Béguelin","first_name":"Santiago","full_name":"Béguelin, Santiago"}],"quality_controlled":"1","status":"public","_id":"2937","doi":"10.1145/2382196.2382249","publist_id":"3798","fulldoi":"https://doi.org/10.1145/2382196.2382249","year":"2012","citation":{"ista":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. 2012. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. Proceedings of the 2012 ACM conference on Computer and communications security. CCS: Conference on Computer and Communications Security, 488–500.","mla":"Almeida, José, et al. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, ACM, 2012, pp. 488–500, doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>.","apa":"Almeida, J., Barbosa, M., Bangerter, E., Barthe, G., Krenn, S., &#38; Béguelin, S. (2012). Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In <i>Proceedings of the 2012 ACM conference on Computer and communications security</i> (pp. 488–500). Raleigh, NC, USA: ACM. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>","ieee":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, and S. Béguelin, “Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols,” in <i>Proceedings of the 2012 ACM conference on Computer and communications security</i>, Raleigh, NC, USA, 2012, pp. 488–500.","short":"J. Almeida, M. Barbosa, E. Bangerter, G. Barthe, S. Krenn, S. Béguelin, in:, Proceedings of the 2012 ACM Conference on Computer and Communications Security, ACM, 2012, pp. 488–500.","chicago":"Almeida, José, Manuel Barbosa, Endre Bangerter, Gilles Barthe, Stephan Krenn, and Santiago Béguelin. “Full Proof Cryptography: Verifiable Compilation of Efficient Zero-Knowledge Protocols.” In <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>, 488–500. ACM, 2012. <a href=\"https://doi.org/10.1145/2382196.2382249\">https://doi.org/10.1145/2382196.2382249</a>.","ama":"Almeida J, Barbosa M, Bangerter E, Barthe G, Krenn S, Béguelin S. Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols. In: <i>Proceedings of the 2012 ACM Conference on Computer and Communications Security</i>. ACM; 2012:488-500. doi:<a href=\"https://doi.org/10.1145/2382196.2382249\">10.1145/2382196.2382249</a>"},"month":"10","title":"Full proof cryptography: Verifiable compilation of efficient zero-knowledge protocols","abstract":[{"text":"Developers building cryptography into security-sensitive applications face a daunting task. Not only must they understand the security guarantees delivered by the constructions they choose, they must also implement and combine them correctly and efficiently. Cryptographic compilers free developers from this task by turning high-level specifications of security goals into efficient implementations. Yet, trusting such tools is hard as they rely on complex mathematical machinery and claim security properties that are subtle and difficult to verify. In this paper we present ZKCrypt, an optimizing cryptographic compiler achieving an unprecedented level of assurance without sacrificing practicality for a comprehensive class of cryptographic protocols, known as Zero-Knowledge Proofs of Knowledge. The pipeline of ZKCrypt integrates purpose-built verified compilers and verifying compilers producing formal proofs in the CertiCrypt framework. By combining the guarantees delivered by each stage, ZKCrypt provides assurance that the output implementation securely realizes the abstract proof goal given as input. We report on the main characteristics of ZKCrypt, highlight new definitions and concepts at its foundations, and illustrate its applicability through a representative example of an anonymous credential system.","lang":"eng"}],"date_published":"2012-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"day":"01","department":[{"_id":"KrPi"}],"publication_status":"published"},{"year":"2012","citation":{"ista":"Ugelvig LV, Cremer S. 2012. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. Functional Ecology. 26(6), 1300–1312.","mla":"Ugelvig, Line V., and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>, vol. 26, no. 6, Wiley-Blackwell, 2012, pp. 1300–12, doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>.","chicago":"Ugelvig, Line V, and Sylvia Cremer. “Effects of Social Immunity and Unicoloniality on Host Parasite Interactions in Invasive Insect Societies.” <i>Functional Ecology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>.","ama":"Ugelvig LV, Cremer S. Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. 2012;26(6):1300-1312. doi:<a href=\"https://doi.org/10.1111/1365-2435.12013\">10.1111/1365-2435.12013</a>","apa":"Ugelvig, L. V., &#38; Cremer, S. (2012). Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies. <i>Functional Ecology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/1365-2435.12013\">https://doi.org/10.1111/1365-2435.12013</a>","ieee":"L. V. Ugelvig and S. Cremer, “Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies,” <i>Functional Ecology</i>, vol. 26, no. 6. Wiley-Blackwell, pp. 1300–1312, 2012.","short":"L.V. Ugelvig, S. Cremer, Functional Ecology 26 (2012) 1300–1312."},"title":"Effects of social immunity and unicoloniality on host parasite interactions in invasive insect societies","month":"01","date_published":"2012-01-01T00:00:00Z","abstract":[{"text":"Social insects have a very high potential to become invasive pest species. Here, we explore how their social lifestyle and their interaction with parasites may contribute to this invasive success. Similar to solitary species, parasite release followed by the evolution of increased competitive ability can promote establishment of introduced social insect hosts in their introduced range. Genetic bottlenecks during introduction of low numbers of founder individuals decrease the genetic diversity at three levels: the population, the colony and the individual, with the colony level being specific to social insects. Reduced genetic diversity can affect both the individual immune system and the collective colony-level disease defences (social immunity). Still, the dual immune system is likely to make social insects more robust to parasite attack. Changes in social structure from small, family-based, territorially aggressive societies in native populations towards huge networks of cooperating nests (unicoloniality) occur in some invasive social insects, for example, most invasive ants and some termites. Unicoloniality is likely to affect disease dynamics in multiple ways. The free exchange of individuals within the population leads to an increased genetic heterogeneity among individuals of a single nest, thereby decreasing disease transmission. However, the multitude of reproductively active queens per colony buffers the effect of individual diseased queens and their offspring, which may result in a higher level of vertical disease transmission in unicolonial societies. Lastly, unicoloniality provides a competitive advantage over native species, allowing them to quickly become the dominant species in the habitat, which in turn selects for parasite adaptation to this common host genotype and thus eventually a high parasite pressure. Overall, invasions by insect societies are characterized by general features applying to all introduced species, as well as idiosyncrasies that emerge from their social lifestyle. It is important to study these effects in concert to be able to develop efficient management and biocontrol strategies. © 2012 British Ecological Society.","lang":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","language":[{"iso":"eng"}],"day":"01","department":[{"_id":"SyCr"}],"publication_status":"published","external_id":{"isi":["000311433600008"]},"scopus_import":"1","article_processing_charge":"No","oa_version":"None","corr_author":"1","_id":"2938","status":"public","quality_controlled":"1","author":[{"first_name":"Line V","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883","id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","last_name":"Ugelvig"},{"first_name":"Sylvia","full_name":"Cremer, Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","last_name":"Cremer"}],"intvolume":"        26","doi":"10.1111/1365-2435.12013","publist_id":"3797","fulldoi":"https://doi.org/10.1111/1365-2435.12013","issue":"6","date_created":"2018-12-11T12:00:27Z","acknowledgement":"We thank Mark Brown, Christopher Pull, Meghan L. Vyleta, Miriam Stock, Barbara Casillas-Perez and three anonymous reviewers for valuable comments on the manuscript and Eva Sixt for ant drawings. Funding was obtained from the German Science Foundation (DFG, by an Individual Research Grant to S.C.) and the European Research Council (ERC, by an ERC-Starting Grant to SC and an Individual Marie Curie EIF fellowship to L.desU.). The authors declare no conflict of interests.","publication":"Functional Ecology","volume":26,"date_updated":"2025-09-30T08:14:20Z","publisher":"Wiley-Blackwell","type":"journal_article","page":"1300 - 1312","isi":1},{"date_created":"2018-12-11T12:00:28Z","issue":"4","volume":67,"publication":"Russian Mathematical Surveys","has_accepted_license":"1","oa":1,"pubrep_id":"132","file":[{"date_created":"2018-12-12T10:16:49Z","date_updated":"2020-07-14T12:45:55Z","file_id":"5239","file_name":"IST-2013-132-v1+1_2012-J-04-Functional-E.pdf","relation":"main_file","creator":"system","checksum":"389a5ae53d6347de36c3468034f2821d","content_type":"application/pdf","file_size":253816,"access_level":"open_access"}],"date_updated":"2025-09-30T08:13:48Z","page":"781 - 783","type":"journal_article","publisher":"IOP Publishing","isi":1,"year":"2012","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_published":"2012-11-01T00:00:00Z","citation":{"chicago":"Dolbilin, Nikolai, Herbert Edelsbrunner, and Oleg Musin. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>. IOP Publishing, 2012. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>.","ama":"Dolbilin N, Edelsbrunner H, Musin O. On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. 2012;67(4):781-783. doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>","ieee":"N. Dolbilin, H. Edelsbrunner, and O. Musin, “On the optimality of functionals over triangulations of Delaunay sets,” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4. IOP Publishing, pp. 781–783, 2012.","short":"N. Dolbilin, H. Edelsbrunner, O. Musin, Russian Mathematical Surveys 67 (2012) 781–783.","apa":"Dolbilin, N., Edelsbrunner, H., &#38; Musin, O. (2012). On the optimality of functionals over triangulations of Delaunay sets. <i>Russian Mathematical Surveys</i>. IOP Publishing. <a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">https://doi.org/10.1070/RM2012v067n04ABEH004807</a>","ista":"Dolbilin N, Edelsbrunner H, Musin O. 2012. On the optimality of functionals over triangulations of Delaunay sets. Russian Mathematical Surveys. 67(4), 781–783.","mla":"Dolbilin, Nikolai, et al. “On the Optimality of Functionals over Triangulations of Delaunay Sets.” <i>Russian Mathematical Surveys</i>, vol. 67, no. 4, IOP Publishing, 2012, pp. 781–83, doi:<a href=\"https://doi.org/10.1070/RM2012v067n04ABEH004807\">10.1070/RM2012v067n04ABEH004807</a>."},"month":"11","title":"On the optimality of functionals over triangulations of Delaunay sets","day":"01","language":[{"iso":"eng"}],"publication_status":"published","department":[{"_id":"HeEd"}],"file_date_updated":"2020-07-14T12:45:55Z","external_id":{"isi":["000310789000005"]},"article_processing_charge":"No","scopus_import":"1","doi":"10.1070/RM2012v067n04ABEH004807","intvolume":"        67","_id":"2941","status":"public","quality_controlled":"1","author":[{"full_name":"Dolbilin, Nikolai","first_name":"Nikolai","last_name":"Dolbilin"},{"first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner"},{"last_name":"Musin","first_name":"Oleg","full_name":"Musin, Oleg"}],"oa_version":"Submitted Version","ddc":["510"],"fulldoi":"https://doi.org/10.1070/RM2012v067n04ABEH004807","publist_id":"3792"},{"isi":1,"page":"1318 - 1333","type":"journal_article","publisher":"Wiley-Blackwell","date_updated":"2025-09-30T08:13:13Z","main_file_link":[{"url":"http://europepmc.org/articles/pmc3524407","open_access":"1"}],"oa":1,"volume":86,"publication":"Molecular Microbiology","acknowledgement":"We thank Professor Philippe Cluzel and Mr Lance Min for providing advice and materials. Jeannette Chau provided technical support. Work at NU was supported by NSF Grants DMR-0715099, MCB-1022117, DMR-1206868, DMR-0520513 and DMR-1121262 (NU-MRSEC), by NIH-NCI Grant U54CA143869-01 (NU-PS-OC) and by the Chicago Biomedical Consortium with support from the Searle Funds at the Chicago Community Trust. Work at UCLA was supported by NIH Grant GM038509.","date_created":"2018-12-11T12:00:28Z","issue":"6","publist_id":"3790","fulldoi":"https://doi.org/10.1111/mmi.12071","doi":"10.1111/mmi.12071","intvolume":"        86","status":"public","_id":"2943","quality_controlled":"1","author":[{"first_name":"Nastaran","full_name":"Hadizadeh Yazdi, Nastaran","last_name":"Hadizadeh Yazdi"},{"full_name":"Guet, Calin C","first_name":"Calin C","last_name":"Guet","orcid":"0000-0001-6220-2052","id":"47F8433E-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Johnson","full_name":"Johnson, Reid","first_name":"Reid"},{"full_name":"Marko, John","first_name":"John","last_name":"Marko"}],"oa_version":"Submitted Version","article_processing_charge":"No","scopus_import":"1","external_id":{"isi":["000312557000005"]},"publication_status":"published","department":[{"_id":"CaGu"}],"day":"09","language":[{"iso":"eng"}],"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","abstract":[{"text":"We examine whether the Escherichia coli chromosome is folded into a self-adherent nucleoprotein complex, or alternately is a confined but otherwise unconstrained self-avoiding polymer. We address this through in vivo visualization, using an inducible GFP fusion to the nucleoid-associated protein Fis to non-specifically decorate the entire chromosome. For a range of different growth conditions, the chromosome is a compact structure that does not fill the volume of the cell, and which moves from the new pole to the cell centre. During rapid growth, chromosome segregation occurs well before cell division, with daughter chromosomes coupled by a thin inter-daughter filament before complete segregation, whereas during slow growth chromosomes stay adjacent until cell division occurs. Image correlation analysis indicates that sub-nucleoid structure is stable on a 1min timescale, comparable to the timescale for redistribution time measured for GFP-Fis after photobleaching. Optical deconvolution and writhe calculation analysis indicate that the nucleoid has a large-scale coiled organization rather than being an amorphous mass. Our observations are consistent with the chromosome having a self-adherent filament organization.","lang":"eng"}],"date_published":"2012-11-09T00:00:00Z","citation":{"chicago":"Hadizadeh Yazdi, Nastaran, Calin C Guet, Reid Johnson, and John Marko. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>. Wiley-Blackwell, 2012. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>.","ama":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. 2012;86(6):1318-1333. doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>","ieee":"N. Hadizadeh Yazdi, C. C. Guet, R. Johnson, and J. Marko, “Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions,” <i>Molecular Microbiology</i>, vol. 86, no. 6. Wiley-Blackwell, pp. 1318–1333, 2012.","apa":"Hadizadeh Yazdi, N., Guet, C. C., Johnson, R., &#38; Marko, J. (2012). Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. <i>Molecular Microbiology</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/mmi.12071\">https://doi.org/10.1111/mmi.12071</a>","short":"N. Hadizadeh Yazdi, C.C. Guet, R. Johnson, J. Marko, Molecular Microbiology 86 (2012) 1318–1333.","ista":"Hadizadeh Yazdi N, Guet CC, Johnson R, Marko J. 2012. Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions. Molecular Microbiology. 86(6), 1318–1333.","mla":"Hadizadeh Yazdi, Nastaran, et al. “Variation of the Folding and Dynamics of the Escherichia Coli Chromosome with Growth Conditions.” <i>Molecular Microbiology</i>, vol. 86, no. 6, Wiley-Blackwell, 2012, pp. 1318–33, doi:<a href=\"https://doi.org/10.1111/mmi.12071\">10.1111/mmi.12071</a>."},"month":"11","title":"Variation of the folding and dynamics of the Escherichia coli chromosome with growth conditions","year":"2012"}]