[{"publication_status":"published","external_id":{"arxiv":["1311.4425"]},"alternative_title":["LNCS"],"_id":"10884","oa_version":"Preprint","type":"conference","publisher":"Springer Nature","department":[{"_id":"KrCh"}],"project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","_id":"25863FF4-B435-11E9-9278-68D0E5697425","name":"Game Theory","call_identifier":"FWF"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"}],"month":"01","year":"2014","publication_identifier":{"isbn":["9783642540127"],"issn":["0302-9743"],"eisbn":["9783642540134"],"eissn":["1611-3349"]},"scopus_import":"1","main_file_link":[{"open_access":"1","url":" https://doi.org/10.48550/arXiv.1311.4425"}],"abstract":[{"lang":"eng","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."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2022-05-17T08:36:01Z","status":"public","author":[{"first_name":"Benjamin","id":"4A55BD00-F248-11E8-B48F-1D18A9856A87","full_name":"Aminof, Benjamin","last_name":"Aminof"},{"full_name":"Jacobs, Swen","last_name":"Jacobs","first_name":"Swen"},{"first_name":"Ayrat","full_name":"Khalimov, Ayrat","last_name":"Khalimov"},{"last_name":"Rubin","full_name":"Rubin, Sasha","id":"2EC51194-F248-11E8-B48F-1D18A9856A87","first_name":"Sasha"}],"arxiv":1,"quality_controlled":"1","conference":{"name":"VMCAI: Verifcation, Model Checking, and Abstract Interpretation","start_date":"2014-01-19","location":"San Diego, CA, United States","end_date":"2014-01-21"},"date_created":"2022-03-18T13:01:22Z","citation":{"apa":"Aminof, B., Jacobs, S., Khalimov, A., & Rubin, S. (2014). Parameterized model checking of token-passing systems. In Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 262–281). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_15","chicago":"Aminof, Benjamin, Swen Jacobs, Ayrat Khalimov, and Sasha Rubin. “Parameterized Model Checking of Token-Passing Systems.” In Verification, Model Checking, and Abstract Interpretation, 8318:262–81. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_15.","mla":"Aminof, Benjamin, et al. “Parameterized Model Checking of Token-Passing Systems.” Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 262–81, doi:10.1007/978-3-642-54013-4_15.","ama":"Aminof B, Jacobs S, Khalimov A, Rubin S. Parameterized model checking of token-passing systems. In: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:262-281. doi:10.1007/978-3-642-54013-4_15","short":"B. Aminof, S. Jacobs, A. Khalimov, S. Rubin, in:, Verification, Model Checking, and Abstract Interpretation, Springer Nature, 2014, pp. 262–281.","ieee":"B. Aminof, S. Jacobs, A. Khalimov, and S. Rubin, “Parameterized model checking of token-passing systems,” in Verification, Model Checking, and Abstract Interpretation, San Diego, CA, United States, 2014, vol. 8318, pp. 262–281.","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."},"oa":1,"title":"Parameterized model checking of token-passing systems","page":"262-281","date_published":"2014-01-30T00:00:00Z","intvolume":" 8318","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.","day":"30","publication":"Verification, Model Checking, and Abstract Interpretation","volume":8318,"article_processing_charge":"No","ec_funded":1,"doi":"10.1007/978-3-642-54013-4_15"},{"oa_version":"Preprint","type":"conference","_id":"10885","alternative_title":["LNCS"],"publication_status":"published","external_id":{"arxiv":["1311.3238"]},"publisher":"Springer Nature","department":[{"_id":"KrCh"}],"publication_identifier":{"isbn":["9783642540127"],"issn":["0302-9743"],"eisbn":["9783642540134"],"eissn":["1611-3349"]},"month":"01","year":"2014","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","call_identifier":"FWF","_id":"2584A770-B435-11E9-9278-68D0E5697425","grant_number":"P 23499-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"abstract":[{"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.","lang":"eng"}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"681"}]},"scopus_import":"1","date_updated":"2023-02-23T12:52:24Z","language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"first_name":"Emmanuel","last_name":"Filiot","full_name":"Filiot, Emmanuel"},{"first_name":"Jean-François","full_name":"Raskin, Jean-François","last_name":"Raskin"}],"status":"public","citation":{"mla":"Chatterjee, Krishnendu, et al. “Doomsday Equilibria for Omega-Regular Games.” VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, vol. 8318, Springer Nature, 2014, pp. 78–97, doi:10.1007/978-3-642-54013-4_5.","apa":"Chatterjee, K., Doyen, L., Filiot, E., & Raskin, J.-F. (2014). Doomsday equilibria for omega-regular games. In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation (Vol. 8318, pp. 78–97). San Diego, CA, United States: Springer Nature. https://doi.org/10.1007/978-3-642-54013-4_5","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Emmanuel Filiot, and Jean-François Raskin. “Doomsday Equilibria for Omega-Regular Games.” In VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 8318:78–97. Springer Nature, 2014. https://doi.org/10.1007/978-3-642-54013-4_5.","ama":"Chatterjee K, Doyen L, Filiot E, Raskin J-F. Doomsday equilibria for omega-regular games. In: VMCAI 2014: Verification, Model Checking, and Abstract Interpretation. Vol 8318. Springer Nature; 2014:78-97. doi:10.1007/978-3-642-54013-4_5","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.","ieee":"K. Chatterjee, L. Doyen, E. Filiot, and J.-F. Raskin, “Doomsday equilibria for omega-regular games,” in VMCAI 2014: Verification, Model Checking, and Abstract Interpretation, 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."},"date_created":"2022-03-18T13:03:15Z","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"},"quality_controlled":"1","arxiv":1,"title":"Doomsday equilibria for omega-regular games","page":"78-97","intvolume":" 8318","date_published":"2014-01-30T00:00:00Z","volume":8318,"publication":"VMCAI 2014: Verification, Model Checking, and Abstract Interpretation","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","ec_funded":1,"article_processing_charge":"No","doi":"10.1007/978-3-642-54013-4_5"},{"publisher":"Springer","_id":"10886","quality_controlled":"1","alternative_title":["Mathematics and Visualization"],"publication_status":"published","citation":{"chicago":"Zobel, Valentin, Jan Reininghaus, and Ingrid Hotz. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” In Topological Methods in Data Analysis and Visualization III , 249–62. Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_16.","apa":"Zobel, V., Reininghaus, J., & Hotz, I. (2014). Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In Topological Methods in Data Analysis and Visualization III (pp. 249–262). Springer. https://doi.org/10.1007/978-3-319-04099-8_16","mla":"Zobel, Valentin, et al. “Visualization of Two-Dimensional Symmetric Positive Definite Tensor Fields Using the Heat Kernel Signature.” Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–62, doi:10.1007/978-3-319-04099-8_16.","short":"V. Zobel, J. Reininghaus, I. Hotz, in:, Topological Methods in Data Analysis and Visualization III , Springer, 2014, pp. 249–262.","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.","ieee":"V. Zobel, J. Reininghaus, and I. Hotz, “Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature,” in Topological Methods in Data Analysis and Visualization III , 2014, pp. 249–262.","ama":"Zobel V, Reininghaus J, Hotz I. Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature. In: Topological Methods in Data Analysis and Visualization III . Springer; 2014:249-262. doi:10.1007/978-3-319-04099-8_16"},"date_created":"2022-03-18T13:05:39Z","type":"conference","oa_version":"None","year":"2014","month":"03","page":"249-262","publication_identifier":{"eisbn":["9783319040998"],"eissn":["2197-666X"],"issn":["1612-3786"],"isbn":["9783319040981"]},"title":"Visualization of two-dimensional symmetric positive definite tensor fields using the heat kernel signature","department":[{"_id":"HeEd"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-05T14:13:16Z","day":"19","publication":"Topological Methods in Data Analysis and Visualization III ","acknowledgement":"This research is partially supported by the TOPOSYS project FP7-ICT-318493-STREP.","date_published":"2014-03-19T00:00:00Z","scopus_import":"1","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"}],"doi":"10.1007/978-3-319-04099-8_16","author":[{"first_name":"Valentin","full_name":"Zobel, Valentin","last_name":"Zobel"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"last_name":"Hotz","full_name":"Hotz, Ingrid","first_name":"Ingrid"}],"article_processing_charge":"No","status":"public"},{"scopus_import":"1","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."}],"related_material":{"record":[{"relation":"later_version","status":"public","id":"481"}]},"language":[{"iso":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T12:20:55Z","author":[{"first_name":"Therese","last_name":"Biedl","full_name":"Biedl, Therese"},{"orcid":"0000-0002-8871-5814","last_name":"Huber","full_name":"Huber, Stefan","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Palfrader","full_name":"Palfrader, Peter","first_name":"Peter"}],"status":"public","_id":"10892","publication_status":"published","alternative_title":["LNCS"],"type":"conference","oa_version":"None","publisher":"Springer Nature","department":[{"_id":"HeEd"}],"year":"2014","month":"11","publication_identifier":{"isbn":["9783319130743"],"issn":["0302-9743"],"eissn":["1611-3349"],"eisbn":["9783319130750"]},"date_published":"2014-11-08T00:00:00Z","intvolume":" 8889","volume":8889,"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.","publication":"25th International Symposium, ISAAC 2014","day":"08","article_processing_charge":"No","doi":"10.1007/978-3-319-13075-0_10","conference":{"name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2014-12-15","end_date":"2014-12-17","location":"Jeonju, Korea"},"quality_controlled":"1","date_created":"2022-03-21T07:09:03Z","citation":{"ama":"Biedl T, Huber S, Palfrader P. Planar matchings for weighted straight skeletons. In: 25th International Symposium, ISAAC 2014. Vol 8889. Springer Nature; 2014:117-127. doi:10.1007/978-3-319-13075-0_10","short":"T. Biedl, S. Huber, P. Palfrader, in:, 25th International Symposium, ISAAC 2014, Springer Nature, 2014, pp. 117–127.","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.","ieee":"T. Biedl, S. Huber, and P. Palfrader, “Planar matchings for weighted straight skeletons,” in 25th International Symposium, ISAAC 2014, Jeonju, Korea, 2014, vol. 8889, pp. 117–127.","mla":"Biedl, Therese, et al. “Planar Matchings for Weighted Straight Skeletons.” 25th International Symposium, ISAAC 2014, vol. 8889, Springer Nature, 2014, pp. 117–27, doi:10.1007/978-3-319-13075-0_10.","apa":"Biedl, T., Huber, S., & Palfrader, P. (2014). Planar matchings for weighted straight skeletons. In 25th International Symposium, ISAAC 2014 (Vol. 8889, pp. 117–127). Jeonju, Korea: Springer Nature. https://doi.org/10.1007/978-3-319-13075-0_10","chicago":"Biedl, Therese, Stefan Huber, and Peter Palfrader. “Planar Matchings for Weighted Straight Skeletons.” In 25th International Symposium, ISAAC 2014, 8889:117–27. Springer Nature, 2014. https://doi.org/10.1007/978-3-319-13075-0_10."},"title":"Planar matchings for weighted straight skeletons","page":"117-127"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"series_title":"Mathematics and Visualization","date_updated":"2022-06-21T12:01:47Z","scopus_import":"1","abstract":[{"lang":"eng","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."}],"author":[{"first_name":"Jens","last_name":"Kasten","full_name":"Kasten, Jens"},{"full_name":"Reininghaus, Jan","last_name":"Reininghaus","id":"4505473A-F248-11E8-B48F-1D18A9856A87","first_name":"Jan"},{"first_name":"Wieland","last_name":"Reich","full_name":"Reich, Wieland"},{"full_name":"Scheuermann, Gerik","last_name":"Scheuermann","first_name":"Gerik"}],"status":"public","publisher":"Springer","_id":"10893","publication_status":"published","type":"book_chapter","oa_version":"None","month":"03","year":"2014","project":[{"grant_number":"318493","call_identifier":"FP7","name":"Topological Complex Systems","_id":"255D761E-B435-11E9-9278-68D0E5697425"}],"publication_identifier":{"issn":["1612-3786"],"isbn":["9783319040981"],"eissn":["2197-666X"],"eisbn":["9783319040998"]},"department":[{"_id":"HeEd"}],"place":"Cham","volume":1,"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.","publication":"Topological Methods in Data Analysis and Visualization III ","day":"19","date_published":"2014-03-19T00:00:00Z","intvolume":" 1","editor":[{"last_name":"Bremer","full_name":"Bremer, Peer-Timo","first_name":"Peer-Timo"},{"first_name":"Ingrid","last_name":"Hotz","full_name":"Hotz, Ingrid"},{"full_name":"Pascucci, Valerio","last_name":"Pascucci","first_name":"Valerio"},{"first_name":"Ronald","last_name":"Peikert","full_name":"Peikert, Ronald"}],"doi":"10.1007/978-3-319-04099-8_4","article_processing_charge":"No","ec_funded":1,"quality_controlled":"1","citation":{"mla":"Kasten, Jens, et al. “Toward the Extraction of Saddle Periodic Orbits.” Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer et al., vol. 1, Springer, 2014, pp. 55–69, doi:10.1007/978-3-319-04099-8_4.","chicago":"Kasten, Jens, Jan Reininghaus, Wieland Reich, and Gerik Scheuermann. “Toward the Extraction of Saddle Periodic Orbits.” In Topological Methods in Data Analysis and Visualization III , edited by Peer-Timo Bremer, Ingrid Hotz, Valerio Pascucci, and Ronald Peikert, 1:55–69. Mathematics and Visualization. Cham: Springer, 2014. https://doi.org/10.1007/978-3-319-04099-8_4.","apa":"Kasten, J., Reininghaus, J., Reich, W., & Scheuermann, G. (2014). Toward the extraction of saddle periodic orbits. In P.-T. Bremer, I. Hotz, V. Pascucci, & R. Peikert (Eds.), Topological Methods in Data Analysis and Visualization III (Vol. 1, pp. 55–69). Cham: Springer. https://doi.org/10.1007/978-3-319-04099-8_4","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.","ieee":"J. Kasten, J. Reininghaus, W. Reich, and G. Scheuermann, “Toward the extraction of saddle periodic orbits,” in Topological Methods in Data Analysis and Visualization III , vol. 1, P.-T. Bremer, I. Hotz, V. Pascucci, and R. Peikert, Eds. Cham: Springer, 2014, pp. 55–69.","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.","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. Topological Methods in Data Analysis and Visualization III . Vol 1. Mathematics and Visualization. Cham: Springer; 2014:55-69. doi:10.1007/978-3-319-04099-8_4"},"date_created":"2022-03-21T07:11:23Z","page":"55-69","title":"Toward the extraction of saddle periodic orbits"},{"place":"Berlin, Heidelberg","volume":8592,"publication":"ICMS 2014: International Congress on Mathematical Software","day":"01","date_published":"2014-09-01T00:00:00Z","intvolume":" 8592","doi":"10.1007/978-3-662-44199-2_24","article_processing_charge":"No","conference":{"name":"ICMS: International Congress on Mathematical Software","start_date":"2014-08-05","location":"Seoul, South Korea","end_date":"2014-08-09"},"quality_controlled":"1","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.","ieee":"U. Bauer, M. Kerber, J. Reininghaus, and H. Wagner, “PHAT – Persistent Homology Algorithms Toolbox,” in ICMS 2014: International Congress on Mathematical Software, Seoul, South Korea, 2014, vol. 8592, pp. 137–143.","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.","ama":"Bauer U, Kerber M, Reininghaus J, Wagner H. PHAT – Persistent Homology Algorithms Toolbox. In: ICMS 2014: International Congress on Mathematical Software. Vol 8592. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg; 2014:137-143. doi:10.1007/978-3-662-44199-2_24","mla":"Bauer, Ulrich, et al. “PHAT – Persistent Homology Algorithms Toolbox.” ICMS 2014: International Congress on Mathematical Software, vol. 8592, Springer Berlin Heidelberg, 2014, pp. 137–43, doi:10.1007/978-3-662-44199-2_24.","chicago":"Bauer, Ulrich, Michael Kerber, Jan Reininghaus, and Hubert Wagner. “PHAT – Persistent Homology Algorithms Toolbox.” In ICMS 2014: International Congress on Mathematical Software, 8592:137–43. LNCS. Berlin, Heidelberg: Springer Berlin Heidelberg, 2014. https://doi.org/10.1007/978-3-662-44199-2_24.","apa":"Bauer, U., Kerber, M., Reininghaus, J., & Wagner, H. (2014). PHAT – Persistent Homology Algorithms Toolbox. In ICMS 2014: International Congress on Mathematical Software (Vol. 8592, pp. 137–143). Berlin, Heidelberg: Springer Berlin Heidelberg. https://doi.org/10.1007/978-3-662-44199-2_24"},"date_created":"2022-03-21T07:12:16Z","page":"137-143","title":"PHAT – Persistent Homology Algorithms Toolbox","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","language":[{"iso":"eng"}],"date_updated":"2023-09-20T09:42:40Z","series_title":"LNCS","scopus_import":"1","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"}],"related_material":{"record":[{"status":"public","relation":"later_version","id":"1433"}]},"author":[{"first_name":"Ulrich","id":"2ADD483A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9683-0724","full_name":"Bauer, Ulrich","last_name":"Bauer"},{"first_name":"Michael","last_name":"Kerber","full_name":"Kerber, Michael"},{"first_name":"Jan","id":"4505473A-F248-11E8-B48F-1D18A9856A87","full_name":"Reininghaus, Jan","last_name":"Reininghaus"},{"full_name":"Wagner, Hubert","last_name":"Wagner","first_name":"Hubert"}],"status":"public","publisher":"Springer Berlin Heidelberg","_id":"10894","publication_status":"published","type":"conference","oa_version":"None","month":"09","year":"2014","publication_identifier":{"eissn":["1611-3349"],"eisbn":["9783662441992"],"isbn":["9783662441985"],"issn":["0302-9743"]},"department":[{"_id":"HeEd"}]},{"type":"conference","oa_version":"Published Version","citation":{"ama":"Seiringer R. Structure of the excitation spectrum for many-body quantum systems. In: Proceeding of the International Congress of Mathematicans. Vol 3. International Congress of Mathematicians; 2014:1175-1194.","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.","short":"R. Seiringer, in:, Proceeding of the International Congress of Mathematicans, International Congress of Mathematicians, 2014, pp. 1175–1194.","ieee":"R. Seiringer, “Structure of the excitation spectrum for many-body quantum systems,” in Proceeding of the International Congress of Mathematicans, Seoul, South Korea, 2014, vol. 3, pp. 1175–1194.","mla":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” Proceeding of the International Congress of Mathematicans, vol. 3, International Congress of Mathematicians, 2014, pp. 1175–94.","apa":"Seiringer, R. (2014). Structure of the excitation spectrum for many-body quantum systems. In Proceeding of the International Congress of Mathematicans (Vol. 3, pp. 1175–1194). Seoul, South Korea: International Congress of Mathematicians.","chicago":"Seiringer, Robert. “Structure of the Excitation Spectrum for Many-Body Quantum Systems.” In Proceeding of the International Congress of Mathematicans, 3:1175–94. International Congress of Mathematicians, 2014."},"date_created":"2020-06-29T07:59:35Z","quality_controlled":"1","publication_status":"published","conference":{"start_date":"2014-08-13","name":"ICM: International Congress of Mathematicans","end_date":"2014-08-21","location":"Seoul, South Korea"},"_id":"8044","publisher":"International Congress of Mathematicians","oa":1,"department":[{"_id":"RoSe"}],"title":"Structure of the excitation spectrum for many-body quantum systems","publication_identifier":{"isbn":["9788961058063"]},"page":"1175-1194","month":"08","year":"2014","intvolume":" 3","main_file_link":[{"open_access":"1","url":"http://www.icm2014.org/en/vod/proceedings.html"}],"abstract":[{"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.","lang":"eng"}],"date_published":"2014-08-01T00:00:00Z","scopus_import":"1","day":"01","publication":"Proceeding of the International Congress of Mathematicans","volume":3,"date_updated":"2023-10-17T11:12:33Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"status":"public","article_processing_charge":"No","author":[{"full_name":"Seiringer, Robert","last_name":"Seiringer","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}]},{"date_updated":"2021-01-12T06:52:06Z","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","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"}],"status":"public","author":[{"first_name":"Paul","full_name":"Guerrero, Paul","last_name":"Guerrero"},{"id":"44D6411A-F248-11E8-B48F-1D18A9856A87","first_name":"Stefan","last_name":"Jeschke","full_name":"Jeschke, Stefan"},{"last_name":"Wimmer","full_name":"Wimmer, Michael","first_name":"Michael"},{"first_name":"Peter","full_name":"Wonka, Peter","last_name":"Wonka"}],"publisher":"ACM","pubrep_id":"577","file":[{"creator":"system","file_id":"4876","relation":"main_file","file_name":"IST-2016-577-v1+1_2014.TOG.Paul.EditingPropagation.final.pdf","checksum":"7f91e588a4e888610313b98271e6418e","file_size":9832561,"date_created":"2018-12-12T10:11:22Z","content_type":"application/pdf","access_level":"open_access","date_updated":"2020-07-14T12:45:07Z"}],"ddc":["000"],"type":"journal_article","oa_version":"Submitted Version","publication_status":"published","issue":"2","_id":"1629","year":"2014","month":"03","department":[{"_id":"ChWo"}],"day":"01","publication":"ACM Transactions on Graphics","volume":33,"intvolume":" 33","has_accepted_license":"1","date_published":"2014-03-01T00:00:00Z","doi":"10.1145/2591010","file_date_updated":"2020-07-14T12:45:07Z","oa":1,"article_number":"15","date_created":"2018-12-11T11:53:08Z","citation":{"apa":"Guerrero, P., Jeschke, S., Wimmer, M., & Wonka, P. (2014). Edit propagation using geometric relationship functions. ACM Transactions on Graphics. ACM. https://doi.org/10.1145/2591010","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Edit Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics. ACM, 2014. https://doi.org/10.1145/2591010.","mla":"Guerrero, Paul, et al. “Edit Propagation Using Geometric Relationship Functions.” ACM Transactions on Graphics, vol. 33, no. 2, 15, ACM, 2014, doi:10.1145/2591010.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 2014;33(2). doi:10.1145/2591010","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Edit propagation using geometric relationship functions,” ACM Transactions on Graphics, vol. 33, no. 2. ACM, 2014.","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, ACM Transactions on Graphics 33 (2014).","ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2014. Edit propagation using geometric relationship functions. ACM Transactions on Graphics. 33(2), 15."},"quality_controlled":"1","publist_id":"5526","title":"Edit propagation using geometric relationship functions"},{"doi":"10.1007/978-3-319-10879-7_7","ec_funded":1,"volume":8642,"publication":"SCN 2014","day":"01","date_published":"2014-01-01T00:00:00Z","intvolume":" 8642","editor":[{"first_name":"Michel","full_name":"Abdalla, Michel","last_name":"Abdalla"},{"last_name":"De Prisco","full_name":"De Prisco, Roberto","first_name":"Roberto"}],"page":"95 - 114","publist_id":"5509","title":"Constrained Verifiable Random Functions ","oa":1,"conference":{"location":"Amalfi, Italy","end_date":"2014-09-05","name":"SCN: Security and Cryptography for Networks","start_date":"2014-09-03"},"citation":{"mla":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” SCN 2014, edited by Michel Abdalla and Roberto De Prisco, vol. 8642, Springer, 2014, pp. 95–114, doi:10.1007/978-3-319-10879-7_7.","apa":"Fuchsbauer, G. (2014). Constrained Verifiable Random Functions . In M. Abdalla & R. De Prisco (Eds.), SCN 2014 (Vol. 8642, pp. 95–114). Amalfi, Italy: Springer. https://doi.org/10.1007/978-3-319-10879-7_7","chicago":"Fuchsbauer, Georg. “Constrained Verifiable Random Functions .” In SCN 2014, edited by Michel Abdalla and Roberto De Prisco, 8642:95–114. Springer, 2014. https://doi.org/10.1007/978-3-319-10879-7_7.","ama":"Fuchsbauer G. Constrained Verifiable Random Functions . In: Abdalla M, De Prisco R, eds. SCN 2014. Vol 8642. Springer; 2014:95-114. doi:10.1007/978-3-319-10879-7_7","ista":"Fuchsbauer G. 2014. Constrained Verifiable Random Functions . SCN 2014. SCN: Security and Cryptography for Networks, LNCS, vol. 8642, 95–114.","ieee":"G. Fuchsbauer, “Constrained Verifiable Random Functions ,” in SCN 2014, Amalfi, Italy, 2014, vol. 8642, pp. 95–114.","short":"G. Fuchsbauer, in:, M. Abdalla, R. De Prisco (Eds.), SCN 2014, Springer, 2014, pp. 95–114."},"date_created":"2018-12-11T11:53:13Z","author":[{"first_name":"Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","full_name":"Fuchsbauer, Georg","last_name":"Fuchsbauer"}],"status":"public","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:52:12Z","scopus_import":1,"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"}],"main_file_link":[{"open_access":"1","url":"http://eprint.iacr.org/2014/537"}],"year":"2014","month":"01","project":[{"name":"Provable Security for Physical Cryptography","call_identifier":"FP7","_id":"258C570E-B435-11E9-9278-68D0E5697425","grant_number":"259668"}],"department":[{"_id":"KrPi"}],"publisher":"Springer","_id":"1643","publication_status":"published","alternative_title":["LNCS"],"type":"conference","oa_version":"Submitted Version"},{"title":"Generalised interpolation by solving recursion free-horn clauses","department":[{"_id":"ToHe"}],"year":"2014","month":"12","publist_id":"5435","page":"31 - 38","conference":{"start_date":"2014-07-17","name":"HCVS: Horn Clauses for Verification and Synthesis","location":"Vienna, Austria","end_date":"2014-07-17"},"_id":"1702","publication_status":"published","quality_controlled":"1","alternative_title":["EPTCS"],"citation":{"short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, Electronic Proceedings in Theoretical Computer Science, EPTCS, Open Publishing, 2014, pp. 31–38.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Generalised interpolation by solving recursion free-horn clauses,” in Electronic Proceedings in Theoretical Computer Science, EPTCS, Vienna, Austria, 2014, vol. 169, pp. 31–38.","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.","ama":"Gupta A, Popeea C, Rybalchenko A. Generalised interpolation by solving recursion free-horn clauses. In: Electronic Proceedings in Theoretical Computer Science, EPTCS. Vol 169. Open Publishing; 2014:31-38. doi:10.4204/EPTCS.169.5","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” In Electronic Proceedings in Theoretical Computer Science, EPTCS, 169:31–38. Open Publishing, 2014. https://doi.org/10.4204/EPTCS.169.5.","apa":"Gupta, A., Popeea, C., & Rybalchenko, A. (2014). Generalised interpolation by solving recursion free-horn clauses. In Electronic Proceedings in Theoretical Computer Science, EPTCS (Vol. 169, pp. 31–38). Vienna, Austria: Open Publishing. https://doi.org/10.4204/EPTCS.169.5","mla":"Gupta, Ashutosh, et al. “Generalised Interpolation by Solving Recursion Free-Horn Clauses.” Electronic Proceedings in Theoretical Computer Science, EPTCS, vol. 169, Open Publishing, 2014, pp. 31–38, doi:10.4204/EPTCS.169.5."},"date_created":"2018-12-11T11:53:33Z","oa_version":"Submitted Version","type":"conference","oa":1,"publisher":"Open Publishing","author":[{"full_name":"Gupta, Ashutosh","last_name":"Gupta","id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh"},{"last_name":"Popeea","full_name":"Popeea, Corneliu","first_name":"Corneliu"},{"first_name":"Andrey","full_name":"Rybalchenko, Andrey","last_name":"Rybalchenko"}],"status":"public","doi":"10.4204/EPTCS.169.5","date_published":"2014-12-02T00:00:00Z","abstract":[{"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.","lang":"eng"}],"intvolume":" 169","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1303.7378v2"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:52:38Z","volume":169,"day":"02","publication":"Electronic Proceedings in Theoretical Computer Science, EPTCS"},{"publisher":"Neural Information Processing Systems","publication_status":"published","quality_controlled":"1","_id":"1708","conference":{"name":"NIPS: Neural Information Processing Systems","start_date":"2014-12-08","location":"Montreal, Canada","end_date":"2014-12-13"},"issue":"January","oa_version":"None","type":"conference","date_created":"2018-12-11T11:53:35Z","citation":{"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.","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.","short":"C. Savin, S. Denève, in:, Neural Information Processing Systems, 2014, 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., & 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.","mla":"Savin, Cristina, and Sophie Denève. Spatio-Temporal Representations of Uncertainty in Spiking Neural Networks. Vol. 3, no. January, Neural Information Processing Systems, 2014, pp. 2024–32."},"publist_id":"5427","page":"2024 - 2032","year":"2014","month":"01","department":[{"_id":"GaTk"}],"title":"Spatio-temporal representations of uncertainty in spiking neural networks","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"day":"01","date_updated":"2021-01-12T06:52:40Z","volume":3,"date_published":"2014-01-01T00:00:00Z","scopus_import":1,"intvolume":" 3","main_file_link":[{"url":"http://papers.nips.cc/paper/5343-spatio-temporal-representations-of-uncertainty-in-spiking-neural-networks.pdf"}],"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"}],"status":"public","author":[{"id":"3933349E-F248-11E8-B48F-1D18A9856A87","first_name":"Cristina","last_name":"Savin","full_name":"Savin, Cristina"},{"last_name":"Denève","full_name":"Denève, Sophie","first_name":"Sophie"}]},{"type":"journal_article","oa_version":"Submitted Version","_id":"1733","issue":"3","publication_status":"published","publisher":"Elsevier","department":[{"_id":"ToHe"},{"_id":"KrCh"}],"month":"12","year":"2014","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Reactive Modeling","grant_number":"267989"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","name":"Moderne Concurrency Paradigms","grant_number":"S11402-N23"},{"grant_number":"S11407","name":"Game Theory","call_identifier":"FWF","_id":"25863FF4-B435-11E9-9278-68D0E5697425"},{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307"},{"_id":"2587B514-B435-11E9-9278-68D0E5697425","name":"Microsoft Research Faculty Fellowship"}],"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"}],"related_material":{"record":[{"id":"2916","status":"public","relation":"earlier_version"}]},"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1210.2450"}],"scopus_import":1,"date_updated":"2023-02-23T11:04:00Z","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"first_name":"Pavol","last_name":"Cerny","full_name":"Cerny, Pavol"},{"full_name":"Chmelik, Martin","last_name":"Chmelik","id":"3624234E-F248-11E8-B48F-1D18A9856A87","first_name":"Martin"},{"full_name":"Henzinger, Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Arjun","id":"3B51CAC4-F248-11E8-B48F-1D18A9856A87","last_name":"Radhakrishna","full_name":"Radhakrishna, Arjun"}],"status":"public","date_created":"2018-12-11T11:53:43Z","citation":{"chicago":"Cerny, Pavol, Martin Chmelik, Thomas A Henzinger, and Arjun Radhakrishna. “Interface Simulation Distances.” Theoretical Computer Science. Elsevier, 2014. https://doi.org/10.1016/j.tcs.2014.08.019.","apa":"Cerny, P., Chmelik, M., Henzinger, T. A., & Radhakrishna, A. (2014). Interface simulation distances. Theoretical Computer Science. Elsevier. https://doi.org/10.1016/j.tcs.2014.08.019","mla":"Cerny, Pavol, et al. “Interface Simulation Distances.” Theoretical Computer Science, vol. 560, no. 3, Elsevier, 2014, pp. 348–63, doi:10.1016/j.tcs.2014.08.019.","ieee":"P. Cerny, M. Chmelik, T. A. Henzinger, and A. Radhakrishna, “Interface simulation distances,” Theoretical Computer Science, vol. 560, no. 3. Elsevier, pp. 348–363, 2014.","short":"P. Cerny, M. Chmelik, T.A. Henzinger, A. Radhakrishna, Theoretical Computer Science 560 (2014) 348–363.","ista":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. 2014. Interface simulation distances. Theoretical Computer Science. 560(3), 348–363.","ama":"Cerny P, Chmelik M, Henzinger TA, Radhakrishna A. Interface simulation distances. Theoretical Computer Science. 2014;560(3):348-363. doi:10.1016/j.tcs.2014.08.019"},"quality_controlled":"1","oa":1,"title":"Interface simulation distances","publist_id":"5392","page":"348 - 363","intvolume":" 560","date_published":"2014-12-04T00:00:00Z","volume":560,"day":"04","publication":"Theoretical Computer Science","ec_funded":1,"doi":"10.1016/j.tcs.2014.08.019"},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:53:19Z","day":"01","publication":"Auxin and Its Role in Plant Development","scopus_import":1,"date_published":"2014-04-01T00:00:00Z","abstract":[{"text":"The generation of asymmetry, at both cellular and tissue level, is one of the most essential capabilities of all eukaryotic organisms. It mediates basically all multicellular development ranging from embryogenesis and de novo organ formation till responses to various environmental stimuli. In plants, the awe-inspiring number of such processes is regulated by phytohormone auxin and its directional, cell-to-cell transport. The mediators of this transport, PIN auxin transporters, are asymmetrically localized at the plasma membrane, and this polar localization determines the directionality of intercellular auxin flow. Thus, auxin transport contributes crucially to the generation of local auxin gradients or maxima, which instruct given cell to change its developmental program. Here, we introduce and discuss the molecular components and cellular mechanisms regulating the generation and maintenance of cellular PIN polarity, as the general hallmarks of cell polarity in plants.","lang":"eng"}],"editor":[{"first_name":"Eva","last_name":"Zažímalová","full_name":"Zažímalová, Eva"},{"first_name":"Jan","last_name":"Petrášek","full_name":"Petrášek, Jan"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","first_name":"Eva","last_name":"Benková","full_name":"Benková, Eva","orcid":"0000-0002-8510-9739"}],"doi":"10.1007/978-3-7091-1526-8_8","author":[{"last_name":"Baster","full_name":"Baster, Pawel","id":"3028BD74-F248-11E8-B48F-1D18A9856A87","first_name":"Pawel"},{"id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jiří","orcid":"0000-0002-8302-7596","full_name":"Friml, Jiří","last_name":"Friml"}],"status":"public","publisher":"Springer","_id":"1806","publication_status":"published","quality_controlled":"1","date_created":"2018-12-11T11:54:07Z","citation":{"chicago":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” In Auxin and Its Role in Plant Development, edited by Eva Zažímalová, Jan Petrášek, and Eva Benková, 143–70. Springer, 2014. https://doi.org/10.1007/978-3-7091-1526-8_8.","apa":"Baster, P., & Friml, J. (2014). Auxin on the road navigated by cellular PIN polarity. In E. Zažímalová, J. Petrášek, & E. Benková (Eds.), Auxin and Its Role in Plant Development (pp. 143–170). Springer. https://doi.org/10.1007/978-3-7091-1526-8_8","mla":"Baster, Pawel, and Jiří Friml. “Auxin on the Road Navigated by Cellular PIN Polarity.” Auxin and Its Role in Plant Development, edited by Eva Zažímalová et al., Springer, 2014, pp. 143–70, doi:10.1007/978-3-7091-1526-8_8.","ieee":"P. Baster and J. Friml, “Auxin on the road navigated by cellular PIN polarity,” in Auxin and Its Role in Plant Development, E. Zažímalová, J. Petrášek, and E. Benková, Eds. Springer, 2014, pp. 143–170.","short":"P. Baster, J. Friml, in:, E. Zažímalová, J. Petrášek, E. Benková (Eds.), Auxin and Its Role in Plant Development, Springer, 2014, pp. 143–170.","ista":"Baster P, Friml J. 2014.Auxin on the road navigated by cellular PIN polarity. In: Auxin and Its Role in Plant Development. , 143–170.","ama":"Baster P, Friml J. Auxin on the road navigated by cellular PIN polarity. In: Zažímalová E, Petrášek J, Benková E, eds. Auxin and Its Role in Plant Development. Springer; 2014:143-170. doi:10.1007/978-3-7091-1526-8_8"},"oa_version":"None","type":"book_chapter","month":"04","year":"2014","page":"143 - 170","publist_id":"5304","title":"Auxin on the road navigated by cellular PIN polarity","department":[{"_id":"JiFr"}]},{"oa":1,"citation":{"ama":"Huber S, Held M, Meerwald P, Kwitt R. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 2014;24(1):61-86. doi:10.1142/S0218195914500034","ieee":"S. Huber, M. Held, P. Meerwald, and R. Kwitt, “Topology-preserving watermarking of vector graphics,” International Journal of Computational Geometry and Applications, vol. 24, no. 1. World Scientific Publishing, pp. 61–86, 2014.","ista":"Huber S, Held M, Meerwald P, Kwitt R. 2014. Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. 24(1), 61–86.","short":"S. Huber, M. Held, P. Meerwald, R. Kwitt, International Journal of Computational Geometry and Applications 24 (2014) 61–86.","apa":"Huber, S., Held, M., Meerwald, P., & Kwitt, R. (2014). Topology-preserving watermarking of vector graphics. International Journal of Computational Geometry and Applications. World Scientific Publishing. https://doi.org/10.1142/S0218195914500034","chicago":"Huber, Stefan, Martin Held, Peter Meerwald, and Roland Kwitt. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications. World Scientific Publishing, 2014. https://doi.org/10.1142/S0218195914500034.","mla":"Huber, Stefan, et al. “Topology-Preserving Watermarking of Vector Graphics.” International Journal of Computational Geometry and Applications, vol. 24, no. 1, World Scientific Publishing, 2014, pp. 61–86, doi:10.1142/S0218195914500034."},"date_created":"2018-12-11T11:54:10Z","quality_controlled":"1","page":"61 - 86","publist_id":"5290","title":"Topology-preserving watermarking of vector graphics","volume":24,"acknowledgement":"Work by Martin Held and Stefan Huber was supported by Austrian Science Fund (FWF): L367-N15 and P25816-N15.","day":"16","publication":"International Journal of Computational Geometry and Applications","intvolume":" 24","has_accepted_license":"1","date_published":"2014-03-16T00:00:00Z","doi":"10.1142/S0218195914500034","file_date_updated":"2020-07-14T12:45:17Z","tmp":{"short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"pubrep_id":"443","publisher":"World Scientific Publishing","file":[{"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:45:17Z","file_size":991734,"checksum":"be45c133ab4d43351260e21beaa8f4b1","date_created":"2018-12-12T10:08:43Z","file_name":"IST-2016-443-v1+1_S0218195914500034.pdf","file_id":"4704","creator":"system","relation":"main_file"}],"oa_version":"Published Version","type":"journal_article","ddc":["000"],"issue":"1","_id":"1816","publication_status":"published","year":"2014","month":"03","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T06:53:23Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"abstract":[{"text":"Watermarking techniques for vector graphics dislocate vertices in order to embed imperceptible, yet detectable, statistical features into the input data. The embedding process may result in a change of the topology of the input data, e.g., by introducing self-intersections, which is undesirable or even disastrous for many applications. In this paper we present a watermarking framework for two-dimensional vector graphics that employs conventional watermarking techniques but still provides the guarantee that the topology of the input data is preserved. The geometric part of this framework computes so-called maximum perturbation regions (MPR) of vertices. We propose two efficient algorithms to compute MPRs based on Voronoi diagrams and constrained triangulations. Furthermore, we present two algorithms to conditionally correct the watermarked data in order to increase the watermark embedding capacity and still guarantee topological correctness. While we focus on the watermarking of input formed by straight-line segments, one of our approaches can also be extended to circular arcs. We conclude the paper by demonstrating and analyzing the applicability of our framework in conjunction with two well-known watermarking techniques.","lang":"eng"}],"scopus_import":1,"author":[{"last_name":"Huber","full_name":"Huber, Stefan","orcid":"0000-0002-8871-5814","first_name":"Stefan","id":"4700A070-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Martin","full_name":"Held, Martin","last_name":"Held"},{"full_name":"Meerwald, Peter","last_name":"Meerwald","first_name":"Peter"},{"last_name":"Kwitt","full_name":"Kwitt, Roland","first_name":"Roland"}],"status":"public"},{"author":[{"orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","first_name":"Robert"}],"status":"public","scopus_import":1,"abstract":[{"lang":"eng","text":"We review recent progress towards a rigorous understanding of the Bogoliubov approximation for bosonic quantum many-body systems. We focus, in particular, on the excitation spectrum of a Bose gas in the mean-field (Hartree) limit. A list of open problems will be discussed at the end."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:53:25Z","department":[{"_id":"RoSe"}],"year":"2014","month":"06","project":[{"name":"NSERC Postdoctoral fellowship","_id":"26450934-B435-11E9-9278-68D0E5697425"}],"_id":"1821","issue":"7","publication_status":"published","file":[{"file_name":"IST-2016-532-v1+1_J._Mathematical_Phys._2014_Seiringer.pdf","relation":"main_file","file_id":"5172","creator":"system","date_updated":"2020-07-14T12:45:17Z","access_level":"open_access","content_type":"application/pdf","date_created":"2018-12-12T10:15:49Z","checksum":"ed0efc93c10f1341155f0316af617b82","file_size":269171}],"type":"journal_article","oa_version":"Submitted Version","ddc":["510","530"],"pubrep_id":"532","publisher":"American Institute of Physics","file_date_updated":"2020-07-14T12:45:17Z","doi":"10.1063/1.4881536","date_published":"2014-06-26T00:00:00Z","intvolume":" 55","has_accepted_license":"1","volume":55,"day":"26","publication":"Journal of Mathematical Physics","title":"Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation","publist_id":"5285","quality_controlled":"1","date_created":"2018-12-11T11:54:11Z","citation":{"short":"R. Seiringer, Journal of Mathematical Physics 55 (2014).","ieee":"R. Seiringer, “Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation,” Journal of Mathematical Physics, vol. 55, no. 7. American Institute of Physics, 2014.","ista":"Seiringer R. 2014. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. 55(7), 1.4881536.","ama":"Seiringer R. Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. 2014;55(7). doi:10.1063/1.4881536","mla":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” Journal of Mathematical Physics, vol. 55, no. 7, 1.4881536, American Institute of Physics, 2014, doi:10.1063/1.4881536.","chicago":"Seiringer, Robert. “Bose Gases, Bose-Einstein Condensation, and the Bogoliubov Approximation.” Journal of Mathematical Physics. American Institute of Physics, 2014. https://doi.org/10.1063/1.4881536.","apa":"Seiringer, R. (2014). Bose gases, Bose-Einstein condensation, and the Bogoliubov approximation. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4881536"},"article_number":"1.4881536","oa":1},{"status":"public","author":[{"first_name":"Vojkan","last_name":"Jakšić","full_name":"Jakšić, Vojkan"},{"first_name":"Claude","last_name":"Pillet","full_name":"Pillet, Claude"},{"last_name":"Seiringer","full_name":"Seiringer, Robert","orcid":"0000-0002-6781-0521","first_name":"Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87"}],"doi":"10.1063/1.4884877","scopus_import":1,"date_published":"2014-07-01T00:00:00Z","intvolume":" 55","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication":"Journal of Mathematical Physics","day":"01","date_updated":"2021-01-12T06:53:25Z","volume":55,"department":[{"_id":"RoSe"}],"title":"Introduction","publist_id":"5284","month":"07","year":"2014","quality_controlled":"1","publication_status":"published","_id":"1822","issue":"7","oa_version":"None","type":"journal_article","citation":{"short":"V. Jakšić, C. Pillet, R. Seiringer, Journal of Mathematical Physics 55 (2014).","ieee":"V. Jakšić, C. Pillet, and R. Seiringer, “Introduction,” Journal of Mathematical Physics, vol. 55, no. 7. American Institute of Physics, 2014.","ista":"Jakšić V, Pillet C, Seiringer R. 2014. Introduction. Journal of Mathematical Physics. 55(7), 075101.","ama":"Jakšić V, Pillet C, Seiringer R. Introduction. Journal of Mathematical Physics. 2014;55(7). doi:10.1063/1.4884877","chicago":"Jakšić, Vojkan, Claude Pillet, and Robert Seiringer. “Introduction.” Journal of Mathematical Physics. American Institute of Physics, 2014. https://doi.org/10.1063/1.4884877.","apa":"Jakšić, V., Pillet, C., & Seiringer, R. (2014). Introduction. Journal of Mathematical Physics. American Institute of Physics. https://doi.org/10.1063/1.4884877","mla":"Jakšić, Vojkan, et al. “Introduction.” Journal of Mathematical Physics, vol. 55, no. 7, 075101, American Institute of Physics, 2014, doi:10.1063/1.4884877."},"date_created":"2018-12-11T11:54:12Z","article_number":"075101","publisher":"American Institute of Physics"},{"author":[{"full_name":"Muelling, Katharina","last_name":"Muelling","first_name":"Katharina"},{"full_name":"Kroemer, Oliver","last_name":"Kroemer","first_name":"Oliver"},{"first_name":"Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","orcid":"0000-0001-8622-7887"},{"full_name":"Schölkopf, Bernhard","last_name":"Schölkopf","first_name":"Bernhard"}],"status":"public","doi":"10.1007/978-3-319-03194-1_3","abstract":[{"text":"Hitting and batting tasks, such as tennis forehands, ping-pong strokes, or baseball batting, depend on predictions where the ball can be intercepted and how it can properly be returned to the opponent. These predictions get more accurate over time, hence the behaviors need to be continuously modified. As a result, movement templates with a learned global shape need to be adapted during the execution so that the racket reaches a target position and velocity that will return the ball over to the other side of the net or court. It requires altering learned movements to hit a varying target with the necessary velocity at a specific instant in time. Such a task cannot be incorporated straightforwardly in most movement representations suitable for learning. For example, the standard formulation of the dynamical system based motor primitives (introduced by Ijspeert et al (2002b)) does not satisfy this property despite their flexibility which has allowed learning tasks ranging from locomotion to kendama. In order to fulfill this requirement, we reformulate the Ijspeert framework to incorporate the possibility of specifying a desired hitting point and a desired hitting velocity while maintaining all advantages of the original formulation.We show that the proposed movement template formulation works well in two scenarios, i.e., for hitting a ball on a string with a table tennis racket at a specified velocity and for returning balls launched by a ball gun successfully over the net using forehand movements.","lang":"eng"}],"intvolume":" 97","editor":[{"first_name":"Jens","full_name":"Kober, Jens","last_name":"Kober"},{"full_name":"Peters, Jan","last_name":"Peters","first_name":"Jan"}],"date_published":"2014-01-01T00:00:00Z","scopus_import":1,"volume":97,"date_updated":"2021-01-12T06:53:28Z","series_title":"From Algorithms to Robot Experiments","day":"01","publication":"Learning Motor Skills","language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","title":"Movement templates for learning of hitting and batting","department":[{"_id":"ChLa"}],"month":"01","year":"2014","page":"69 - 82","publist_id":"5274","date_created":"2018-12-11T11:54:14Z","citation":{"mla":"Muelling, Katharina, et al. “Movement Templates for Learning of Hitting and Batting.” Learning Motor Skills, edited by Jens Kober and Jan Peters, vol. 97, Springer, 2014, pp. 69–82, doi:10.1007/978-3-319-03194-1_3.","chicago":"Muelling, Katharina, Oliver Kroemer, Christoph Lampert, and Bernhard Schölkopf. “Movement Templates for Learning of Hitting and Batting.” In Learning Motor Skills, edited by Jens Kober and Jan Peters, 97:69–82. From Algorithms to Robot Experiments. Springer, 2014. https://doi.org/10.1007/978-3-319-03194-1_3.","apa":"Muelling, K., Kroemer, O., Lampert, C., & Schölkopf, B. (2014). Movement templates for learning of hitting and batting. In J. Kober & J. Peters (Eds.), Learning Motor Skills (Vol. 97, pp. 69–82). Springer. https://doi.org/10.1007/978-3-319-03194-1_3","short":"K. Muelling, O. Kroemer, C. Lampert, B. Schölkopf, in:, J. Kober, J. Peters (Eds.), Learning Motor Skills, Springer, 2014, pp. 69–82.","ieee":"K. Muelling, O. Kroemer, C. Lampert, and B. Schölkopf, “Movement templates for learning of hitting and batting,” in Learning Motor Skills, vol. 97, J. Kober and J. Peters, Eds. Springer, 2014, pp. 69–82.","ista":"Muelling K, Kroemer O, Lampert C, Schölkopf B. 2014.Movement templates for learning of hitting and batting. In: Learning Motor Skills. Springer Tracts in Advanced Robotics, vol. 97, 69–82.","ama":"Muelling K, Kroemer O, Lampert C, Schölkopf B. Movement templates for learning of hitting and batting. In: Kober J, Peters J, eds. Learning Motor Skills. Vol 97. From Algorithms to Robot Experiments. Springer; 2014:69-82. doi:10.1007/978-3-319-03194-1_3"},"type":"book_chapter","oa_version":"None","_id":"1829","quality_controlled":"1","publication_status":"published","alternative_title":["Springer Tracts in Advanced Robotics"],"publisher":"Springer"},{"abstract":[{"lang":"eng","text":"We prove polynomial upper bounds of geometric Ramsey numbers of pathwidth-2 outerplanar triangulations in both convex and general cases. We also prove that the geometric Ramsey numbers of the ladder graph on 2n vertices are bounded by O(n3) and O(n10), in the convex and general case, respectively. We then apply similar methods to prove an (Formula presented.) upper bound on the Ramsey number of a path with n ordered vertices."}],"main_file_link":[{"url":"http://arxiv.org/abs/1310.7004","open_access":"1"}],"intvolume":" 53","scopus_import":1,"date_published":"2014-11-14T00:00:00Z","volume":53,"date_updated":"2021-01-12T06:53:33Z","day":"14","publication":"Discrete & Computational Geometry","acknowledgement":"Marek Krčál was supported by the ERC Advanced Grant No. 267165.","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"author":[{"full_name":"Cibulka, Josef","last_name":"Cibulka","first_name":"Josef"},{"full_name":"Gao, Pu","last_name":"Gao","first_name":"Pu"},{"first_name":"Marek","id":"33E21118-F248-11E8-B48F-1D18A9856A87","last_name":"Krcál","full_name":"Krcál, Marek"},{"last_name":"Valla","full_name":"Valla, Tomáš","first_name":"Tomáš"},{"first_name":"Pavel","full_name":"Valtr, Pavel","last_name":"Valtr"}],"status":"public","doi":"10.1007/s00454-014-9646-x","date_created":"2018-12-11T11:54:18Z","citation":{"ista":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. 2014. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 53(1), 64–79.","short":"J. Cibulka, P. Gao, M. Krcál, T. Valla, P. Valtr, Discrete & Computational Geometry 53 (2014) 64–79.","ieee":"J. Cibulka, P. Gao, M. Krcál, T. Valla, and P. Valtr, “On the geometric ramsey number of outerplanar graphs,” Discrete & Computational Geometry, vol. 53, no. 1. Springer, pp. 64–79, 2014.","ama":"Cibulka J, Gao P, Krcál M, Valla T, Valtr P. On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. 2014;53(1):64-79. doi:10.1007/s00454-014-9646-x","chicago":"Cibulka, Josef, Pu Gao, Marek Krcál, Tomáš Valla, and Pavel Valtr. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry. Springer, 2014. https://doi.org/10.1007/s00454-014-9646-x.","apa":"Cibulka, J., Gao, P., Krcál, M., Valla, T., & Valtr, P. (2014). On the geometric ramsey number of outerplanar graphs. Discrete & Computational Geometry. Springer. https://doi.org/10.1007/s00454-014-9646-x","mla":"Cibulka, Josef, et al. “On the Geometric Ramsey Number of Outerplanar Graphs.” Discrete & Computational Geometry, vol. 53, no. 1, Springer, 2014, pp. 64–79, doi:10.1007/s00454-014-9646-x."},"oa_version":"Submitted Version","type":"journal_article","issue":"1","_id":"1842","publication_status":"published","publisher":"Springer","oa":1,"title":"On the geometric ramsey number of outerplanar graphs","department":[{"_id":"UlWa"},{"_id":"HeEd"}],"year":"2014","month":"11","publist_id":"5260","page":"64 - 79"},{"oa":1,"quality_controlled":"1","citation":{"apa":"Risso, V., Manssour Triedo, F., Delgado Delgado, A., Arco, R., Barroso Deljesús, A., Inglés Prieto, Á., … Sánchez Ruiz, J. (2014). Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. Oxford University Press. https://doi.org/10.1093/molbev/msu312","chicago":"Risso, Valeria, Fadia Manssour Triedo, Asuncion Delgado Delgado, Rocio Arco, Alicia Barroso Deljesús, Álvaro Inglés Prieto, Raquel Godoy Ruiz, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” Molecular Biology and Evolution. Oxford University Press, 2014. https://doi.org/10.1093/molbev/msu312.","mla":"Risso, Valeria, et al. “Mutational Studies on Resurrected Ancestral Proteins Reveal Conservation of Site-Specific Amino Acid Preferences throughout Evolutionary History.” Molecular Biology and Evolution, vol. 32, no. 2, Oxford University Press, 2014, pp. 440–55, doi:10.1093/molbev/msu312.","ama":"Risso V, Manssour Triedo F, Delgado Delgado A, et al. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 2014;32(2):440-455. doi:10.1093/molbev/msu312","ieee":"V. Risso et al., “Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history,” Molecular Biology and Evolution, vol. 32, no. 2. Oxford University Press, pp. 440–455, 2014.","short":"V. Risso, F. Manssour Triedo, A. Delgado Delgado, R. Arco, A. Barroso Deljesús, Á. Inglés Prieto, R. Godoy Ruiz, J. Gavira, E. Gaucher, B. Ibarra Molero, J. Sánchez Ruiz, Molecular Biology and Evolution 32 (2014) 440–455.","ista":"Risso V, Manssour Triedo F, Delgado Delgado A, Arco R, Barroso Deljesús A, Inglés Prieto Á, Godoy Ruiz R, Gavira J, Gaucher E, Ibarra Molero B, Sánchez Ruiz J. 2014. Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history. Molecular Biology and Evolution. 32(2), 440–455."},"date_created":"2018-12-11T11:54:19Z","page":"440 - 455","publist_id":"5257","title":"Mutational studies on resurrected ancestral proteins reveal conservation of site-specific amino acid preferences throughout evolutionary history","publication":"Molecular Biology and Evolution","day":"12","volume":32,"date_published":"2014-11-12T00:00:00Z","has_accepted_license":"1","intvolume":" 32","file_date_updated":"2020-07-14T12:45:19Z","doi":"10.1093/molbev/msu312","tmp":{"name":"Creative Commons Attribution-NonCommercial 4.0 International (CC BY-NC 4.0)","image":"/images/cc_by_nc.png","legal_code_url":"https://creativecommons.org/licenses/by-nc/4.0/legalcode","short":"CC BY-NC (4.0)"},"publisher":"Oxford University Press","pubrep_id":"430","publication_status":"published","_id":"1844","issue":"2","file":[{"date_updated":"2020-07-14T12:45:19Z","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:16:56Z","checksum":"06215318e66be8f3e0c33abb07e9d3da","file_size":1545246,"file_name":"IST-2016-430-v1+1_Mol_Biol_Evol-2015-Risso-440-55.pdf","relation":"main_file","creator":"system","file_id":"5247"}],"type":"journal_article","oa_version":"Published Version","ddc":["571"],"year":"2014","month":"11","department":[{"_id":"HaJa"}],"language":[{"iso":"eng"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T06:53:34Z","scopus_import":1,"abstract":[{"text":"Local protein interactions ("molecular context" effects) dictate amino acid replacements and can be described in terms of site-specific, energetic preferences for any different amino acid. It has been recently debated whether these preferences remain approximately constant during evolution or whether, due to coevolution of sites, they change strongly. Such research highlights an unresolved and fundamental issue with far-reaching implications for phylogenetic analysis and molecular evolution modeling. Here, we take advantage of the recent availability of phenotypically supported laboratory resurrections of Precambrian thioredoxins and β-lactamases to experimentally address the change of site-specific amino acid preferences over long geological timescales. Extensive mutational analyses support the notion that evolutionary adjustment to a new amino acid may occur, but to a large extent this is insufficient to erase the primitive preference for amino acid replacements. Generally, site-specific amino acid preferences appear to remain conserved throughout evolutionary history despite local sequence divergence. We show such preference conservation to be readily understandable in molecular terms and we provide crystallographic evidence for an intriguing structural-switch mechanism: Energetic preference for an ancestral amino acid in a modern protein can be linked to reorganization upon mutation to the ancestral local structure around the mutated site. Finally, we point out that site-specific preference conservation naturally leads to one plausible evolutionary explanation for the existence of intragenic global suppressor mutations.","lang":"eng"}],"status":"public","author":[{"full_name":"Risso, Valeria","last_name":"Risso","first_name":"Valeria"},{"last_name":"Manssour Triedo","full_name":"Manssour Triedo, Fadia","first_name":"Fadia"},{"first_name":"Asuncion","full_name":"Delgado Delgado, Asuncion","last_name":"Delgado Delgado"},{"first_name":"Rocio","last_name":"Arco","full_name":"Arco, Rocio"},{"full_name":"Barroso Deljesús, Alicia","last_name":"Barroso Deljesús","first_name":"Alicia"},{"id":"2A9DB292-F248-11E8-B48F-1D18A9856A87","first_name":"Álvaro","orcid":"0000-0002-5409-8571","full_name":"Inglés Prieto, Álvaro","last_name":"Inglés Prieto"},{"full_name":"Godoy Ruiz, Raquel","last_name":"Godoy Ruiz","first_name":"Raquel"},{"first_name":"Josè","full_name":"Gavira, Josè","last_name":"Gavira"},{"last_name":"Gaucher","full_name":"Gaucher, Eric","first_name":"Eric"},{"first_name":"Beatriz","full_name":"Ibarra Molero, Beatriz","last_name":"Ibarra Molero"},{"full_name":"Sánchez Ruiz, Jose","last_name":"Sánchez Ruiz","first_name":"Jose"}]},{"year":"2014","month":"10","department":[{"_id":"JiFr"}],"publisher":"Cell Press","issue":"19","_id":"1852","publication_status":"published","type":"journal_article","oa_version":"Submitted Version","author":[{"first_name":"Massimiliano","last_name":"Sassi","full_name":"Sassi, Massimiliano"},{"first_name":"Olivier","last_name":"Ali","full_name":"Ali, Olivier"},{"first_name":"Frédéric","last_name":"Boudon","full_name":"Boudon, Frédéric"},{"first_name":"Gladys","last_name":"Cloarec","full_name":"Cloarec, Gladys"},{"first_name":"Ursula","full_name":"Abad, Ursula","last_name":"Abad"},{"first_name":"Coralie","full_name":"Cellier, Coralie","last_name":"Cellier"},{"full_name":"Chen, Xu","last_name":"Chen","first_name":"Xu","id":"4E5ADCAA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gilles","full_name":"Gilles, Benjamin","first_name":"Benjamin"},{"first_name":"Pascale","full_name":"Milani, Pascale","last_name":"Milani"},{"orcid":"0000-0002-8302-7596","last_name":"Friml","full_name":"Friml, Jirí","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Teva","full_name":"Vernoux, Teva","last_name":"Vernoux"},{"first_name":"Christophe","full_name":"Godin, Christophe","last_name":"Godin"},{"first_name":"Olivier","last_name":"Hamant","full_name":"Hamant, Olivier"},{"first_name":"Jan","full_name":"Traas, Jan","last_name":"Traas"}],"status":"public","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"date_updated":"2021-01-12T06:53:37Z","scopus_import":1,"abstract":[{"lang":"eng","text":"To control morphogenesis, molecular regulatory networks have to interfere with the mechanical properties of the individual cells of developing organs and tissues, but how this is achieved is not well known. We study this issue here in the shoot meristem of higher plants, a group of undifferentiated cells where complex changes in growth rates and directions lead to the continuous formation of new organs [1, 2]. Here, we show that the plant hormone auxin plays an important role in this process via a dual, local effect on the extracellular matrix, the cell wall, which determines cell shape. Our study reveals that auxin not only causes a limited reduction in wall stiffness but also directly interferes with wall anisotropy via the regulation of cortical microtubule dynamics. We further show that to induce growth isotropy and organ outgrowth, auxin somehow interferes with the cortical microtubule-ordering activity of a network of proteins, including AUXIN BINDING PROTEIN 1 and KATANIN 1. Numerical simulations further indicate that the induced isotropy is sufficient to amplify the effects of the relatively minor changes in wall stiffness to promote organogenesis and the establishment of new growth axes in a robust manner."}],"main_file_link":[{"open_access":"1","url":"https://hal.archives-ouvertes.fr/hal-01074821"}],"publist_id":"5248","page":"2335 - 2342","title":"An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis","oa":1,"quality_controlled":"1","date_created":"2018-12-11T11:54:22Z","citation":{"ama":"Sassi M, Ali O, Boudon F, et al. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. 2014;24(19):2335-2342. doi:10.1016/j.cub.2014.08.036","ista":"Sassi M, Ali O, Boudon F, Cloarec G, Abad U, Cellier C, Chen X, Gilles B, Milani P, Friml J, Vernoux T, Godin C, Hamant O, Traas J. 2014. An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. 24(19), 2335–2342.","short":"M. Sassi, O. Ali, F. Boudon, G. Cloarec, U. Abad, C. Cellier, X. Chen, B. Gilles, P. Milani, J. Friml, T. Vernoux, C. Godin, O. Hamant, J. Traas, Current Biology 24 (2014) 2335–2342.","ieee":"M. Sassi et al., “An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis,” Current Biology, vol. 24, no. 19. Cell Press, pp. 2335–2342, 2014.","mla":"Sassi, Massimiliano, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” Current Biology, vol. 24, no. 19, Cell Press, 2014, pp. 2335–42, doi:10.1016/j.cub.2014.08.036.","apa":"Sassi, M., Ali, O., Boudon, F., Cloarec, G., Abad, U., Cellier, C., … Traas, J. (2014). An auxin-mediated shift toward growth isotropy promotes organ formation at the shoot meristem in Arabidopsis. Current Biology. Cell Press. https://doi.org/10.1016/j.cub.2014.08.036","chicago":"Sassi, Massimiliano, Olivier Ali, Frédéric Boudon, Gladys Cloarec, Ursula Abad, Coralie Cellier, Xu Chen, et al. “An Auxin-Mediated Shift toward Growth Isotropy Promotes Organ Formation at the Shoot Meristem in Arabidopsis.” Current Biology. Cell Press, 2014. https://doi.org/10.1016/j.cub.2014.08.036."},"doi":"10.1016/j.cub.2014.08.036","volume":24,"acknowledgement":"This work was funded by grants from EraSysBio+ (iSAM) and ERC (Morphodynamics). ","day":"06","publication":"Current Biology","date_published":"2014-10-06T00:00:00Z","intvolume":" 24"}]