[{"isi":1,"month":"07","date_updated":"2025-09-23T13:50:55Z","year":"2015","scopus_import":"1","abstract":[{"text":"We propose a flexible exchange format for ω-automata, as typically used in formal verification, and implement support for it in a range of established tools. Our aim is to simplify the interaction of tools, helping the research community to build upon other people’s work. A key feature of the format is the use of very generic acceptance conditions, specified by Boolean combinations of acceptance primitives, rather than being limited to common cases such as Büchi, Streett, or Rabin. Such flexibility in the choice of acceptance conditions can be exploited in applications, for example in probabilistic model checking, and furthermore encourages the development of acceptance-agnostic tools for automata manipulations. The format allows acceptance conditions that are either state-based or transition-based, and also supports alternating automata.","lang":"eng"}],"alternative_title":["LNCS"],"publisher":"Springer","date_published":"2015-07-16T00:00:00Z","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"Z211"},{"_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","grant_number":"291734","call_identifier":"FP7"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"}],"article_processing_charge":"No","publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","date_created":"2020-05-15T08:38:12Z","relation":"main_file","file_id":"7850","file_size":1651779,"date_updated":"2020-07-14T12:45:04Z","content_type":"application/pdf","file_name":"2015_CAV_Babiak.pdf","checksum":"5885236fa88a439baba9ac6f3e801e93"}],"oa_version":"Submitted Version","doi":"10.1007/978-3-319-21690-4_31","type":"conference","citation":{"short":"T. Babiak, F. Blahoudek, A. Duret Lutz, J. Klein, J. Kretinsky, D. Mueller, D. Parker, J. Strejček, in:, Springer, 2015, pp. 479–486.","ama":"Babiak T, Blahoudek F, Duret Lutz A, et al. The Hanoi omega-automata format. In: Vol 9206. Springer; 2015:479-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">10.1007/978-3-319-21690-4_31</a>","mla":"Babiak, Tomáš, et al. <i>The Hanoi Omega-Automata Format</i>. Vol. 9206, Springer, 2015, pp. 479–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">10.1007/978-3-319-21690-4_31</a>.","apa":"Babiak, T., Blahoudek, F., Duret Lutz, A., Klein, J., Kretinsky, J., Mueller, D., … Strejček, J. (2015). The Hanoi omega-automata format (Vol. 9206, pp. 479–486). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">https://doi.org/10.1007/978-3-319-21690-4_31</a>","ista":"Babiak T, Blahoudek F, Duret Lutz A, Klein J, Kretinsky J, Mueller D, Parker D, Strejček J. 2015. The Hanoi omega-automata format. CAV: Computer Aided Verification, LNCS, vol. 9206, 479–486.","ieee":"T. Babiak <i>et al.</i>, “The Hanoi omega-automata format,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 479–486.","chicago":"Babiak, Tomáš, František Blahoudek, Alexandre Duret Lutz, Joachim Klein, Jan Kretinsky, Daniel Mueller, David Parker, and Jan Strejček. “The Hanoi Omega-Automata Format,” 9206:479–86. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_31\">https://doi.org/10.1007/978-3-319-21690-4_31</a>."},"department":[{"_id":"ToHe"},{"_id":"KrCh"}],"oa":1,"file_date_updated":"2020-07-14T12:45:04Z","publist_id":"5566","_id":"1601","day":"16","ec_funded":1,"volume":9206,"has_accepted_license":"1","ddc":["000"],"date_created":"2018-12-11T11:52:57Z","conference":{"name":"CAV: Computer Aided Verification","end_date":"2015-07-24","start_date":"2015-07-18","location":"San Francisco, CA, United States"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","intvolume":"      9206","author":[{"first_name":"Tomáš","full_name":"Babiak, Tomáš","last_name":"Babiak"},{"first_name":"František","full_name":"Blahoudek, František","last_name":"Blahoudek"},{"first_name":"Alexandre","full_name":"Duret Lutz, Alexandre","last_name":"Duret Lutz"},{"full_name":"Klein, Joachim","first_name":"Joachim","last_name":"Klein"},{"orcid":"0000-0002-8122-2881","last_name":"Kretinsky","full_name":"Kretinsky, Jan","first_name":"Jan","id":"44CEF464-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","full_name":"Mueller, Daniel","last_name":"Mueller"},{"full_name":"Parker, David","first_name":"David","last_name":"Parker"},{"last_name":"Strejček","full_name":"Strejček, Jan","first_name":"Jan"}],"external_id":{"isi":["000364182900031"]},"language":[{"iso":"eng"}],"title":"The Hanoi omega-automata format","quality_controlled":"1","page":"479 - 486"},{"status":"public","intvolume":"      9206","external_id":{"arxiv":["1502.02834"],"isi":["000364182900010"]},"author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"id":"3624234E-F248-11E8-B48F-1D18A9856A87","full_name":"Chmelik, Martin","first_name":"Martin","last_name":"Chmelik"},{"id":"42BABFB4-F248-11E8-B48F-1D18A9856A87","full_name":"Fellner, Andreas","first_name":"Andreas","last_name":"Fellner"},{"id":"44CEF464-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Kretinsky, Jan","orcid":"0000-0002-8122-2881","last_name":"Kretinsky"}],"language":[{"iso":"eng"}],"title":"Counterexample explanation by learning small strategies in Markov decision processes","quality_controlled":"1","page":"158 - 177","ec_funded":1,"related_material":{"record":[{"id":"5549","status":"public","relation":"research_paper"}]},"volume":9206,"date_created":"2018-12-11T11:52:58Z","corr_author":"1","conference":{"name":"CAV: Computer Aided Verification","end_date":"2015-07-24","start_date":"2015-07-18","location":"San Francisco, CA, United States"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","acknowledgement":"This research was funded in part by Austrian Science Fund (FWF) Grant No P 23499-N23, FWF NFN Grant No S11407-N23 (RiSE) and Z211-N23 (Wittgenstein Award), European Research Council (ERC) Grant No 279307 (Graph Games), ERC Grant No 267989 (QUAREM), the Czech Science Foundation Grant No P202/12/G061, and People Programme (Marie Curie Actions) of the European Union’s Seventh Framework Programme (FP7/2007–2013) REA Grant No 291734.","publication_identifier":{"eisbn":["978-3-319-21690-4"]},"doi":"10.1007/978-3-319-21690-4_10","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"ieee":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, and J. Kretinsky, “Counterexample explanation by learning small strategies in Markov decision processes,” presented at the CAV: Computer Aided Verification, San Francisco, CA, United States, 2015, vol. 9206, pp. 158–177.","chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Martin Chmelik, Andreas Fellner, and Jan Kretinsky. “Counterexample Explanation by Learning Small Strategies in Markov Decision Processes,” 9206:158–77. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">https://doi.org/10.1007/978-3-319-21690-4_10</a>.","mla":"Brázdil, Tomáš, et al. <i>Counterexample Explanation by Learning Small Strategies in Markov Decision Processes</i>. Vol. 9206, Springer, 2015, pp. 158–77, doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">10.1007/978-3-319-21690-4_10</a>.","ama":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. Counterexample explanation by learning small strategies in Markov decision processes. In: Vol 9206. Springer; 2015:158-177. doi:<a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">10.1007/978-3-319-21690-4_10</a>","short":"T. Brázdil, K. Chatterjee, M. Chmelik, A. Fellner, J. Kretinsky, in:, Springer, 2015, pp. 158–177.","ista":"Brázdil T, Chatterjee K, Chmelik M, Fellner A, Kretinsky J. 2015. Counterexample explanation by learning small strategies in Markov decision processes. CAV: Computer Aided Verification, LNCS, vol. 9206, 158–177.","apa":"Brázdil, T., Chatterjee, K., Chmelik, M., Fellner, A., &#38; Kretinsky, J. (2015). Counterexample explanation by learning small strategies in Markov decision processes (Vol. 9206, pp. 158–177). Presented at the CAV: Computer Aided Verification, San Francisco, CA, United States: Springer. <a href=\"https://doi.org/10.1007/978-3-319-21690-4_10\">https://doi.org/10.1007/978-3-319-21690-4_10</a>"},"type":"conference","oa":1,"publist_id":"5564","_id":"1603","day":"16","month":"07","isi":1,"date_updated":"2025-09-23T08:23:16Z","arxiv":1,"abstract":[{"text":"For deterministic systems, a counterexample to a property can simply be an error trace, whereas counterexamples in probabilistic systems are necessarily more complex. For instance, a set of erroneous traces with a sufficient cumulative probability mass can be used. Since these are too large objects to understand and manipulate, compact representations such as subchains have been considered. In the case of probabilistic systems with non-determinism, the situation is even more complex. While a subchain for a given strategy (or scheduler, resolving non-determinism) is a straightforward choice, we take a different approach. Instead, we focus on the strategy itself, and extract the most important decisions it makes, and present its succinct representation.\r\nThe key tools we employ to achieve this are (1) introducing a concept of importance of a state w.r.t. the strategy, and (2) learning using decision trees. There are three main consequent advantages of our approach. Firstly, it exploits the quantitative information on states, stressing the more important decisions. Secondly, it leads to a greater variability and degree of freedom in representing the strategies. Thirdly, the representation uses a self-explanatory data structure. In summary, our approach produces more succinct and more explainable strategies, as opposed to e.g. binary decision diagrams. Finally, our experimental results show that we can extract several rules describing the strategy even for very large systems that do not fit in memory, and based on the rules explain the erroneous behaviour.","lang":"eng"}],"scopus_import":"1","year":"2015","alternative_title":["LNCS"],"publisher":"Springer","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.02834"}],"date_published":"2015-07-16T00:00:00Z","project":[{"grant_number":"P 23499-N23","call_identifier":"FWF","name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"grant_number":"Z211","call_identifier":"FWF","name":"Formal methods for the design and analysis of complex systems","_id":"25F42A32-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications"},{"grant_number":"267989","call_identifier":"FP7","name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425"},{"name":"International IST Postdoc Fellowship Programme","_id":"25681D80-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"291734"}],"article_processing_charge":"No","publication_status":"published","oa_version":"Preprint"},{"doi":"10.1007/978-3-319-26287-1_2","acknowledgement":"This work was partly supported by the European Research Council (ERC) under grant 267989 (QUAREM), by the Austrian Science Fund (FWF) under grants S11402-N23, S11405-N23 and S11412-N23 (RiSE/SHiNE) and Z211-N23 (Wittgenstein Award), and by the German Research Foundation (DFG) as part of the Transregional Collaborative Research Center “Automatic Verification and Analysis of Complex Systems” (SFB/TR 14 AVACS, http://www.avacs.org/).","department":[{"_id":"ToHe"}],"type":"conference","citation":{"apa":"Bogomolov, S., Schilling, C., Bartocci, E., Batt, G., Kong, H., &#38; Grosu, R. (2015). Abstraction-based parameter synthesis for multiaffine systems (Vol. 9434, pp. 19–35). Presented at the HVC: Haifa Verification Conference, Haifa, Israel: Springer. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">https://doi.org/10.1007/978-3-319-26287-1_2</a>","ista":"Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. 2015. Abstraction-based parameter synthesis for multiaffine systems. HVC: Haifa Verification Conference, LNCS, vol. 9434, 19–35.","mla":"Bogomolov, Sergiy, et al. <i>Abstraction-Based Parameter Synthesis for Multiaffine Systems</i>. Vol. 9434, Springer, 2015, pp. 19–35, doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">10.1007/978-3-319-26287-1_2</a>.","ama":"Bogomolov S, Schilling C, Bartocci E, Batt G, Kong H, Grosu R. Abstraction-based parameter synthesis for multiaffine systems. In: Vol 9434. Springer; 2015:19-35. doi:<a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">10.1007/978-3-319-26287-1_2</a>","short":"S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, R. Grosu, in:, Springer, 2015, pp. 19–35.","chicago":"Bogomolov, Sergiy, Christian Schilling, Ezio Bartocci, Grégory Batt, Hui Kong, and Radu Grosu. “Abstraction-Based Parameter Synthesis for Multiaffine Systems,” 9434:19–35. Springer, 2015. <a href=\"https://doi.org/10.1007/978-3-319-26287-1_2\">https://doi.org/10.1007/978-3-319-26287-1_2</a>.","ieee":"S. Bogomolov, C. Schilling, E. Bartocci, G. Batt, H. Kong, and R. Grosu, “Abstraction-based parameter synthesis for multiaffine systems,” presented at the HVC: Haifa Verification Conference, Haifa, Israel, 2015, vol. 9434, pp. 19–35."},"oa":1,"file_date_updated":"2020-07-14T12:45:05Z","publist_id":"5561","_id":"1605","day":"28","date_updated":"2025-04-15T06:26:03Z","month":"11","alternative_title":["LNCS"],"year":"2015","abstract":[{"lang":"eng","text":"Multiaffine hybrid automata (MHA) represent a powerful formalism to model complex dynamical systems. This formalism is particularly suited for the representation of biological systems which often exhibit highly non-linear behavior. In this paper, we consider the problem of parameter identification for MHA. We present an abstraction of MHA based on linear hybrid automata, which can be analyzed by the SpaceEx model checker. This abstraction enables a precise handling of time-dependent properties. We demonstrate the potential of our approach on a model of a genetic regulatory network and a myocyte model."}],"scopus_import":1,"date_published":"2015-11-28T00:00:00Z","publisher":"Springer","article_processing_charge":"No","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","grant_number":"267989","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"},{"grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering"}],"publication_status":"published","file":[{"access_level":"open_access","creator":"dernst","date_created":"2020-05-15T08:43:19Z","relation":"main_file","file_id":"7851","file_size":1053207,"date_updated":"2020-07-14T12:45:05Z","content_type":"application/pdf","file_name":"2015_LNCS_Bogomolov.pdf","checksum":"3aab260f3f34641d622030ba22645b3e"}],"oa_version":"Submitted Version","status":"public","intvolume":"      9434","language":[{"iso":"eng"}],"author":[{"id":"369D9A44-F248-11E8-B48F-1D18A9856A87","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","full_name":"Bogomolov, Sergiy","first_name":"Sergiy"},{"id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87","full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling","orcid":"0000-0003-3658-1065"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"full_name":"Batt, Grégory","first_name":"Grégory","last_name":"Batt"},{"id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","first_name":"Hui","full_name":"Kong, Hui","last_name":"Kong","orcid":"0000-0002-3066-6941"},{"first_name":"Radu","full_name":"Grosu, Radu","last_name":"Grosu"}],"quality_controlled":"1","title":"Abstraction-based parameter synthesis for multiaffine systems","page":"19 - 35","ec_funded":1,"volume":9434,"has_accepted_license":"1","date_created":"2018-12-11T11:52:59Z","ddc":["000"],"corr_author":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","conference":{"location":"Haifa, Israel","name":"HVC: Haifa Verification Conference","end_date":"2015-11-19","start_date":"2015-11-17"}},{"language":[{"iso":"eng"}],"author":[{"first_name":"Luan","full_name":"Nguyen, Luan","last_name":"Nguyen"},{"full_name":"Schilling, Christian","first_name":"Christian","last_name":"Schilling"},{"full_name":"Bogomolov, Sergiy","first_name":"Sergiy","last_name":"Bogomolov","orcid":"0000-0002-0686-0365","id":"369D9A44-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Johnson, Taylor","first_name":"Taylor","last_name":"Johnson"}],"external_id":{"isi":["000370624400019"]},"intvolume":"      9333","status":"public","page":"281 - 286","quality_controlled":"1","title":"Runtime verification for hybrid analysis tools","volume":9333,"ec_funded":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"location":"Vienna, Austria","start_date":"2015-09-22","end_date":"2015-09-25","name":"RV: Runtime Verification"},"date_created":"2018-12-11T11:52:59Z","department":[{"_id":"ToHe"}],"citation":{"apa":"Nguyen, L., Schilling, C., Bogomolov, S., &#38; Johnson, T. (2015). Runtime verification for hybrid analysis tools. In <i>6th International Conference</i> (Vol. 9333, pp. 281–286). Vienna, Austria: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">https://doi.org/10.1007/978-3-319-23820-3_19</a>","ista":"Nguyen L, Schilling C, Bogomolov S, Johnson T. 2015. Runtime verification for hybrid analysis tools. 6th International Conference. RV: Runtime Verification, LNCS, vol. 9333, 281–286.","ama":"Nguyen L, Schilling C, Bogomolov S, Johnson T. Runtime verification for hybrid analysis tools. In: <i>6th International Conference</i>. Vol 9333. Springer Nature; 2015:281-286. doi:<a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">10.1007/978-3-319-23820-3_19</a>","mla":"Nguyen, Luan, et al. “Runtime Verification for Hybrid Analysis Tools.” <i>6th International Conference</i>, vol. 9333, Springer Nature, 2015, pp. 281–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">10.1007/978-3-319-23820-3_19</a>.","short":"L. Nguyen, C. Schilling, S. Bogomolov, T. Johnson, in:, 6th International Conference, Springer Nature, 2015, pp. 281–286.","chicago":"Nguyen, Luan, Christian Schilling, Sergiy Bogomolov, and Taylor Johnson. “Runtime Verification for Hybrid Analysis Tools.” In <i>6th International Conference</i>, 9333:281–86. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-319-23820-3_19\">https://doi.org/10.1007/978-3-319-23820-3_19</a>.","ieee":"L. Nguyen, C. Schilling, S. Bogomolov, and T. Johnson, “Runtime verification for hybrid analysis tools,” in <i>6th International Conference</i>, Vienna, Austria, 2015, vol. 9333, pp. 281–286."},"type":"conference","doi":"10.1007/978-3-319-23820-3_19","publication_identifier":{"isbn":["978-3-319-23819-7"]},"day":"15","_id":"1606","publist_id":"5562","publication":"6th International Conference","date_published":"2015-11-15T00:00:00Z","publisher":"Springer Nature","alternative_title":["LNCS"],"abstract":[{"lang":"eng","text":"In this paper, we present the first steps toward a runtime verification framework for monitoring hybrid and cyber-physical systems (CPS) development tools based on randomized differential testing. The development tools include hybrid systems reachability analysis tools, model-based development environments like Simulink/Stateflow (SLSF), etc. First, hybrid automaton models are randomly generated. Next, these hybrid automaton models are translated to a number of different tools (currently, SpaceEx, dReach, Flow*, HyCreate, and the MathWorks’ Simulink/Stateflow) using the HyST source transformation and translation tool. Then, the hybrid automaton models are executed in the different tools and their outputs are parsed. The final step is the differential comparison: the outputs of the different tools are compared. If the results do not agree (in the sense that an analysis or verification result from one tool does not match that of another tool, ignoring timeouts, etc.), a candidate bug is flagged and the model is saved for future analysis by the user. The process then repeats and the monitoring continues until the user terminates the process. We present preliminary results that have been useful in identifying a few bugs in the analysis methods of different development tools, and in an earlier version of HyST."}],"scopus_import":"1","year":"2015","date_updated":"2025-09-23T10:41:02Z","month":"11","isi":1,"oa_version":"None","publication_status":"published","article_processing_charge":"No","project":[{"name":"Quantitative Reactive Modeling","_id":"25EE3708-B435-11E9-9278-68D0E5697425","grant_number":"267989","call_identifier":"FP7"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","name":"Formal methods for the design and analysis of complex systems","call_identifier":"FWF","grant_number":"Z211"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF"}]},{"publisher":"Springer Nature","date_published":"2015-06-20T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1502.04844"}],"isi":1,"month":"06","date_updated":"2025-09-23T13:48:35Z","arxiv":1,"abstract":[{"text":"The synthesis problem asks for the automatic construction of a system from its specification. In the traditional setting, the system is “constructed from scratch” rather than composed from reusable components. However, this is rare in practice, and almost every non-trivial software system relies heavily on the use of libraries of reusable components. Recently, Lustig and Vardi introduced dataflow and controlflow synthesis from libraries of reusable components. They proved that dataflow synthesis is undecidable, while controlflow synthesis is decidable. The problem of controlflow synthesis from libraries of probabilistic components was considered by Nain, Lustig and Vardi, and was shown to be decidable for qualitative analysis (that asks that the specification be satisfied with probability 1). Our main contribution for controlflow synthesis from probabilistic components is to establish better complexity bounds for the qualitative analysis problem, and to show that the more general quantitative problem is undecidable. For the qualitative analysis, we show that the problem (i) is EXPTIME-complete when the specification is given as a deterministic parity word automaton, improving the previously known 2EXPTIME upper bound; and (ii) belongs to UP ∩ coUP and is parity-games hard, when the specification is given directly as a parity condition on the components, improving the previously known EXPTIME upper bound.","lang":"eng"}],"year":"2015","scopus_import":"1","alternative_title":["LNCS"],"oa_version":"Preprint","article_processing_charge":"No","project":[{"_id":"2584A770-B435-11E9-9278-68D0E5697425","name":"Modern Graph Algorithmic Techniques in Formal Verification","grant_number":"P 23499-N23","call_identifier":"FWF"},{"name":"Game Theory","_id":"25863FF4-B435-11E9-9278-68D0E5697425","grant_number":"S11407","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","type":"conference","citation":{"apa":"Chatterjee, K., Doyen, L., &#38; Vardi, M. (2015). The complexity of synthesis from probabilistic components. In <i>42nd International Colloquium</i> (Vol. 9135, pp. 108–120). Kyoto, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">https://doi.org/10.1007/978-3-662-47666-6_9</a>","ista":"Chatterjee K, Doyen L, Vardi M. 2015. The complexity of synthesis from probabilistic components. 42nd International Colloquium. ICALP: Automata, Languages and Programming, LNCS, vol. 9135, 108–120.","mla":"Chatterjee, Krishnendu, et al. “The Complexity of Synthesis from Probabilistic Components.” <i>42nd International Colloquium</i>, vol. 9135, Springer Nature, 2015, pp. 108–20, doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">10.1007/978-3-662-47666-6_9</a>.","ama":"Chatterjee K, Doyen L, Vardi M. The complexity of synthesis from probabilistic components. In: <i>42nd International Colloquium</i>. Vol 9135. Springer Nature; 2015:108-120. doi:<a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">10.1007/978-3-662-47666-6_9</a>","short":"K. Chatterjee, L. Doyen, M. Vardi, in:, 42nd International Colloquium, Springer Nature, 2015, pp. 108–120.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, and Moshe Vardi. “The Complexity of Synthesis from Probabilistic Components.” In <i>42nd International Colloquium</i>, 9135:108–20. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-47666-6_9\">https://doi.org/10.1007/978-3-662-47666-6_9</a>.","ieee":"K. Chatterjee, L. Doyen, and M. Vardi, “The complexity of synthesis from probabilistic components,” in <i>42nd International Colloquium</i>, Kyoto, Japan, 2015, vol. 9135, pp. 108–120."},"department":[{"_id":"KrCh"}],"oa":1,"acknowledgement":"This research was supported by Austrian Science Fund (FWF) Grant No P23499- N23, FWF NFN Grant No S11407-N23 (SHiNE), ERC Start grant (279307: Graph Games), EU FP7 Project Cassting, NSF grants CNS 1049862 and CCF-1139011, by NSF Expeditions in Computing project “ExCAPE: Expeditions in Computer Augmented Program Engineering”, by BSF grant 9800096, and by gift from Intel.","publication_identifier":{"isbn":["978-3-662-47665-9"]},"doi":"10.1007/978-3-662-47666-6_9","publist_id":"5557","day":"20","_id":"1609","publication":"42nd International Colloquium","ec_funded":1,"volume":9135,"conference":{"name":"ICALP: Automata, Languages and Programming","end_date":"2015-07-10","start_date":"2015-07-06","location":"Kyoto, Japan"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:00Z","corr_author":"1","external_id":{"arxiv":["1502.04844"],"isi":["000364317900009"]},"author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu"},{"first_name":"Laurent","full_name":"Doyen, Laurent","last_name":"Doyen"},{"first_name":"Moshe","full_name":"Vardi, Moshe","last_name":"Vardi"}],"language":[{"iso":"eng"}],"status":"public","intvolume":"      9135","page":"108 - 120","title":"The complexity of synthesis from probabilistic components","quality_controlled":"1"},{"oa_version":"Submitted Version","article_processing_charge":"No","project":[{"grant_number":"RGY0084/2012","_id":"255BFFFA-B435-11E9-9278-68D0E5697425","name":"In situ real-time imaging of neurotransmitter signaling using designer optical sensors"}],"publication_status":"published","publisher":"Wiley","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4570536/","open_access":"1"}],"date_published":"2015-09-01T00:00:00Z","isi":1,"month":"09","date_updated":"2025-09-23T08:21:28Z","scopus_import":"1","year":"2015","abstract":[{"text":"Biosensors for signaling molecules allow the study of physiological processes by bringing together the fields of protein engineering, fluorescence imaging, and cell biology. Construction of genetically encoded biosensors generally relies on the availability of a binding &quot;core&quot; that is both specific and stable, which can then be combined with fluorescent molecules to create a sensor. However, binding proteins with the desired properties are often not available in nature and substantial improvement to sensors can be required, particularly with regard to their durability. Ancestral protein reconstruction is a powerful protein-engineering tool able to generate highly stable and functional proteins. In this work, we sought to establish the utility of ancestral protein reconstruction to biosensor development, beginning with the construction of an l-arginine biosensor. l-arginine, as the immediate precursor to nitric oxide, is an important molecule in many physiological contexts including brain function. Using a combination of ancestral reconstruction and circular permutation, we constructed a Förster resonance energy transfer (FRET) biosensor for l-arginine (cpFLIPR). cpFLIPR displays high sensitivity and specificity, with a Kd of ∼14 μM and a maximal dynamic range of 35%. Importantly, cpFLIPR was highly robust, enabling accurate l-arginine measurement at physiological temperatures. We established that cpFLIPR is compatible with two-photon excitation fluorescence microscopy and report l-arginine concentrations in brain tissue.","lang":"eng"}],"publist_id":"5555","_id":"1611","day":"01","publication":"Protein Science","issue":"9","type":"journal_article","department":[{"_id":"HaJa"}],"citation":{"apa":"Whitfield, J., Zhang, W., Herde, M., Clifton, B., Radziejewski, J., Janovjak, H. L., … Jackson, C. (2015). Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. <i>Protein Science</i>. Wiley. <a href=\"https://doi.org/10.1002/pro.2721\">https://doi.org/10.1002/pro.2721</a>","ista":"Whitfield J, Zhang W, Herde M, Clifton B, Radziejewski J, Janovjak HL, Henneberger C, Jackson C. 2015. Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. Protein Science. 24(9), 1412–1422.","ama":"Whitfield J, Zhang W, Herde M, et al. Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction. <i>Protein Science</i>. 2015;24(9):1412-1422. doi:<a href=\"https://doi.org/10.1002/pro.2721\">10.1002/pro.2721</a>","mla":"Whitfield, Jason, et al. “Construction of a Robust and Sensitive Arginine Biosensor through Ancestral Protein Reconstruction.” <i>Protein Science</i>, vol. 24, no. 9, Wiley, 2015, pp. 1412–22, doi:<a href=\"https://doi.org/10.1002/pro.2721\">10.1002/pro.2721</a>.","short":"J. Whitfield, W. Zhang, M. Herde, B. Clifton, J. Radziejewski, H.L. Janovjak, C. Henneberger, C. Jackson, Protein Science 24 (2015) 1412–1422.","chicago":"Whitfield, Jason, William Zhang, Michel Herde, Ben Clifton, Johanna Radziejewski, Harald L Janovjak, Christian Henneberger, and Colin Jackson. “Construction of a Robust and Sensitive Arginine Biosensor through Ancestral Protein Reconstruction.” <i>Protein Science</i>. Wiley, 2015. <a href=\"https://doi.org/10.1002/pro.2721\">https://doi.org/10.1002/pro.2721</a>.","ieee":"J. Whitfield <i>et al.</i>, “Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction,” <i>Protein Science</i>, vol. 24, no. 9. Wiley, pp. 1412–1422, 2015."},"oa":1,"doi":"10.1002/pro.2721","pmid":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","date_created":"2018-12-11T11:53:01Z","volume":24,"page":"1412 - 1422","title":"Construction of a robust and sensitive arginine biosensor through ancestral protein reconstruction","quality_controlled":"1","external_id":{"isi":["000360380400008"],"pmid":["26061224"]},"author":[{"last_name":"Whitfield","full_name":"Whitfield, Jason","first_name":"Jason"},{"last_name":"Zhang","full_name":"Zhang, William","first_name":"William"},{"last_name":"Herde","first_name":"Michel","full_name":"Herde, Michel"},{"last_name":"Clifton","first_name":"Ben","full_name":"Clifton, Ben"},{"first_name":"Johanna","full_name":"Radziejewski, Johanna","last_name":"Radziejewski"},{"id":"33BA6C30-F248-11E8-B48F-1D18A9856A87","full_name":"Janovjak, Harald L","first_name":"Harald L","last_name":"Janovjak","orcid":"0000-0002-8023-9315"},{"full_name":"Henneberger, Christian","first_name":"Christian","last_name":"Henneberger"},{"last_name":"Jackson","full_name":"Jackson, Colin","first_name":"Colin"}],"language":[{"iso":"eng"}],"status":"public","intvolume":"        24"},{"title":"Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells","quality_controlled":"1","page":"1220 - 1225","status":"public","intvolume":"       112","author":[{"last_name":"Strüber","first_name":"Michael","full_name":"Strüber, Michael"},{"id":"353C1B58-F248-11E8-B48F-1D18A9856A87","last_name":"Jonas","orcid":"0000-0001-5001-4804","full_name":"Jonas, Peter M","first_name":"Peter M"},{"last_name":"Bartos","full_name":"Bartos, Marlene","first_name":"Marlene"}],"external_id":{"isi":["000348417000066"],"pmid":["25583495"]},"language":[{"iso":"eng"}],"ddc":["570"],"date_created":"2018-12-11T11:53:02Z","pmid":1,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ec_funded":1,"volume":112,"has_accepted_license":"1","publication":"PNAS","issue":"4","file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5552","day":"27","_id":"1614","doi":"10.1073/pnas.1412996112","citation":{"ieee":"M. Strüber, P. M. Jonas, and M. Bartos, “Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells,” <i>PNAS</i>, vol. 112, no. 4. National Academy of Sciences, pp. 1220–1225, 2015.","chicago":"Strüber, Michael, Peter M Jonas, and Marlene Bartos. “Strength and Duration of Perisomatic GABAergic Inhibition Depend on Distance between Synaptically Connected Cells.” <i>PNAS</i>. National Academy of Sciences, 2015. <a href=\"https://doi.org/10.1073/pnas.1412996112\">https://doi.org/10.1073/pnas.1412996112</a>.","short":"M. Strüber, P.M. Jonas, M. Bartos, PNAS 112 (2015) 1220–1225.","ama":"Strüber M, Jonas PM, Bartos M. Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. <i>PNAS</i>. 2015;112(4):1220-1225. doi:<a href=\"https://doi.org/10.1073/pnas.1412996112\">10.1073/pnas.1412996112</a>","mla":"Strüber, Michael, et al. “Strength and Duration of Perisomatic GABAergic Inhibition Depend on Distance between Synaptically Connected Cells.” <i>PNAS</i>, vol. 112, no. 4, National Academy of Sciences, 2015, pp. 1220–25, doi:<a href=\"https://doi.org/10.1073/pnas.1412996112\">10.1073/pnas.1412996112</a>.","ista":"Strüber M, Jonas PM, Bartos M. 2015. Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. PNAS. 112(4), 1220–1225.","apa":"Strüber, M., Jonas, P. M., &#38; Bartos, M. (2015). Strength and duration of perisomatic GABAergic inhibition depend on distance between synaptically connected cells. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1412996112\">https://doi.org/10.1073/pnas.1412996112</a>"},"department":[{"_id":"PeJo"}],"type":"journal_article","oa":1,"project":[{"call_identifier":"FWF","grant_number":"P24909-B24","name":"Mechanisms of transmitter release at GABAergic synapses","_id":"25C26B1E-B435-11E9-9278-68D0E5697425"},{"name":"Nanophysiology of fast-spiking, parvalbumin-expressing GABAergic interneurons","_id":"25C0F108-B435-11E9-9278-68D0E5697425","grant_number":"268548","call_identifier":"FP7"}],"article_processing_charge":"No","publication_status":"published","oa_version":"Published Version","file":[{"checksum":"6703309a1f58493cf5a704211fb6ebed","file_name":"2015_PNAS_Strueber.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_size":1280860,"file_id":"5838","relation":"main_file","date_created":"2019-01-17T07:52:40Z","creator":"dernst","access_level":"open_access"}],"month":"01","isi":1,"date_updated":"2025-09-23T10:49:39Z","scopus_import":"1","year":"2015","abstract":[{"lang":"eng","text":"GABAergic perisoma-inhibiting fast-spiking interneurons (PIIs) effectively control the activity of large neuron populations by their wide axonal arborizations. It is generally assumed that the output of one PII to its target cells is strong and rapid. Here, we show that, unexpectedly, both strength and time course of PII-mediated perisomatic inhibition change with distance between synaptically connected partners in the rodent hippocampus. Synaptic signals become weaker due to lower contact numbers and decay more slowly with distance, very likely resulting from changes in GABAA receptor subunit composition. When distance-dependent synaptic inhibition is introduced to a rhythmically active neuronal network model, randomly driven principal cell assemblies are strongly synchronized by the PIIs, leading to higher precision in principal cell spike times than in a network with uniform synaptic inhibition. "}],"publisher":"National Academy of Sciences","date_published":"2015-01-27T00:00:00Z"},{"volume":13,"has_accepted_license":"1","ddc":["570"],"date_created":"2018-12-11T11:53:02Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","status":"public","intvolume":"        13","author":[{"last_name":"Hammer","first_name":"Matthieu","full_name":"Hammer, Matthieu"},{"full_name":"Krueger Burg, Dilja","first_name":"Dilja","last_name":"Krueger Burg"},{"last_name":"Tuffy","full_name":"Tuffy, Liam","first_name":"Liam"},{"full_name":"Cooper, Benjamin","first_name":"Benjamin","last_name":"Cooper"},{"last_name":"Taschenberger","first_name":"Holger","full_name":"Taschenberger, Holger"},{"id":"3A578F32-F248-11E8-B48F-1D18A9856A87","first_name":"Sarit","full_name":"Goswami, Sarit","last_name":"Goswami"},{"full_name":"Ehrenreich, Hannelore","first_name":"Hannelore","last_name":"Ehrenreich"},{"first_name":"Peter M","full_name":"Jonas, Peter M","last_name":"Jonas","orcid":"0000-0001-5001-4804","id":"353C1B58-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Varoqueaux, Frederique","first_name":"Frederique","last_name":"Varoqueaux"},{"full_name":"Rhee, Jeong","first_name":"Jeong","last_name":"Rhee"},{"last_name":"Brose","first_name":"Nils","full_name":"Brose, Nils"}],"external_id":{"isi":["000363780000008"]},"language":[{"iso":"eng"}],"title":"Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism","quality_controlled":"1","page":"516 - 523","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"},"month":"10","isi":1,"date_updated":"2025-09-23T09:48:31Z","year":"2015","abstract":[{"text":"Loss-of-function mutations in the synaptic adhesion protein Neuroligin-4 are among the most common genetic abnormalities associated with autism spectrum disorders, but little is known about the function of Neuroligin-4 and the consequences of its loss. We assessed synaptic and network characteristics in Neuroligin-4 knockout mice, focusing on the hippocampus as a model brain region with a critical role in cognition and memory, and found that Neuroligin-4 deletion causes subtle defects of the protein composition and function of GABAergic synapses in the hippocampal CA3 region. Interestingly, these subtle synaptic changes are accompanied by pronounced perturbations of γ-oscillatory network activity, which has been implicated in cognitive function and is altered in multiple psychiatric and neurodevelopmental disorders. Our data provide important insights into the mechanisms by which Neuroligin-4-dependent GABAergic synapses may contribute to autism phenotypes and indicate new strategies for therapeutic approaches.","lang":"eng"}],"scopus_import":"1","pubrep_id":"470","publisher":"Cell Press","date_published":"2015-10-20T00:00:00Z","article_processing_charge":"No","publication_status":"published","file":[{"file_name":"IST-2016-470-v1+1_1-s2.0-S2211124715010220-main.pdf","checksum":"44d30fbb543774b076b4938bd36af9d7","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_size":2314406,"file_id":"5005","date_created":"2018-12-12T10:13:23Z","relation":"main_file","access_level":"open_access","creator":"system"}],"oa_version":"Published Version","acknowledgement":"This work was supported by the Max Planck Society (N.B. and H.E.), the European Commission (EU-AIMS FP7-115300, N.B. and H.E.; Marie Curie IRG, D.K.-B.), the German Research Foundation (CNMPB, N.B., H.E., and F.V.), the Alexander von Humboldt-Foundation (D.K.-B.), and the Austrian Fond zur Förderung der Wissenschaftlichen Forschung (P 24909-B24, P.J.). M.H. was a student of the doctoral program Molecular Physiology of the Brain. Dr. J.-M. Fritschy generously provided the GABAARγ2 antibody. We thank F. Benseler, I. Thanhäuser, D. Schwerdtfeger, A. Ronnenberg, and D. Winkler for valuable advice and excellent technical support. We are grateful to the staff at the animal facility of the Max Planck Institute of Experimental Medicine for mouse husbandry.","doi":"10.1016/j.celrep.2015.09.011","department":[{"_id":"PeJo"}],"type":"journal_article","citation":{"ieee":"M. Hammer <i>et al.</i>, “Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism,” <i>Cell Reports</i>, vol. 13, no. 3. Cell Press, pp. 516–523, 2015.","chicago":"Hammer, Matthieu, Dilja Krueger Burg, Liam Tuffy, Benjamin Cooper, Holger Taschenberger, Sarit Goswami, Hannelore Ehrenreich, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model of Autism.” <i>Cell Reports</i>. Cell Press, 2015. <a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">https://doi.org/10.1016/j.celrep.2015.09.011</a>.","mla":"Hammer, Matthieu, et al. “Perturbed Hippocampal Synaptic Inhibition and γ-Oscillations in a Neuroligin-4 Knockout Mouse Model of Autism.” <i>Cell Reports</i>, vol. 13, no. 3, Cell Press, 2015, pp. 516–23, doi:<a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">10.1016/j.celrep.2015.09.011</a>.","ama":"Hammer M, Krueger Burg D, Tuffy L, et al. Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. <i>Cell Reports</i>. 2015;13(3):516-523. doi:<a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">10.1016/j.celrep.2015.09.011</a>","short":"M. Hammer, D. Krueger Burg, L. Tuffy, B. Cooper, H. Taschenberger, S. Goswami, H. Ehrenreich, P.M. Jonas, F. Varoqueaux, J. Rhee, N. Brose, Cell Reports 13 (2015) 516–523.","ista":"Hammer M, Krueger Burg D, Tuffy L, Cooper B, Taschenberger H, Goswami S, Ehrenreich H, Jonas PM, Varoqueaux F, Rhee J, Brose N. 2015. Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. Cell Reports. 13(3), 516–523.","apa":"Hammer, M., Krueger Burg, D., Tuffy, L., Cooper, B., Taschenberger, H., Goswami, S., … Brose, N. (2015). Perturbed hippocampal synaptic inhibition and γ-oscillations in a neuroligin-4 knockout mouse model of autism. <i>Cell Reports</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.celrep.2015.09.011\">https://doi.org/10.1016/j.celrep.2015.09.011</a>"},"oa":1,"publication":"Cell Reports","issue":"3","file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5551","_id":"1615","day":"20"},{"publication_status":"published","article_processing_charge":"No","project":[{"grant_number":"281556","call_identifier":"FP7","name":"Cytoskeletal force generation and force transduction of migrating leukocytes","_id":"25A603A2-B435-11E9-9278-68D0E5697425"}],"oa_version":"Submitted Version","scopus_import":"1","year":"2015","abstract":[{"lang":"eng","text":"CCL19 and CCL21 are chemokines involved in the trafficking of immune cells, particularly within the lymphatic system, through activation of CCR7. Concurrent expression of PSGL-1 and CCR7 in naive T-cells enhances recruitment of these cells to secondary lymphoid organs by CCL19 and CCL21. Here the solution structure of CCL19 is reported. It contains a canonical chemokine domain. Chemical shift mapping shows the N-termini of PSGL-1 and CCR7 have overlapping binding sites for CCL19 and binding is competitive. Implications for the mechanism of PSGL-1's enhancement of resting T-cell recruitment are discussed."}],"month":"06","isi":1,"date_updated":"2025-09-23T10:47:25Z","publisher":"American Chemical Society","date_published":"2015-06-26T00:00:00Z","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC4809050/","open_access":"1"}],"issue":"27","publication":"Biochemistry","_id":"1618","day":"26","publist_id":"5548","doi":"10.1021/acs.biochem.5b00560","oa":1,"citation":{"short":"C. Veldkamp, E. Kiermaier, S. Gabel Eissens, M. Gillitzer, D. Lippner, F. Disilvio, C. Mueller, P. Wantuch, G. Chaffee, M. Famiglietti, D. Zgoba, A. Bailey, Y. Bah, S. Engebretson, D. Graupner, E. Lackner, V. Larosa, T. Medeiros, M. Olson, A. Phillips, H. Pyles, A. Richard, S. Schoeller, B. Touzeau, L. Williams, M.K. Sixt, F. Peterson, Biochemistry 54 (2015) 4163–4166.","ama":"Veldkamp C, Kiermaier E, Gabel Eissens S, et al. Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. <i>Biochemistry</i>. 2015;54(27):4163-4166. doi:<a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">10.1021/acs.biochem.5b00560</a>","mla":"Veldkamp, Christopher, et al. “Solution Structure of CCL19 and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” <i>Biochemistry</i>, vol. 54, no. 27, American Chemical Society, 2015, pp. 4163–66, doi:<a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">10.1021/acs.biochem.5b00560</a>.","apa":"Veldkamp, C., Kiermaier, E., Gabel Eissens, S., Gillitzer, M., Lippner, D., Disilvio, F., … Peterson, F. (2015). Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. <i>Biochemistry</i>. American Chemical Society. <a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">https://doi.org/10.1021/acs.biochem.5b00560</a>","ista":"Veldkamp C, Kiermaier E, Gabel Eissens S, Gillitzer M, Lippner D, Disilvio F, Mueller C, Wantuch P, Chaffee G, Famiglietti M, Zgoba D, Bailey A, Bah Y, Engebretson S, Graupner D, Lackner E, Larosa V, Medeiros T, Olson M, Phillips A, Pyles H, Richard A, Schoeller S, Touzeau B, Williams L, Sixt MK, Peterson F. 2015. Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites. Biochemistry. 54(27), 4163–4166.","ieee":"C. Veldkamp <i>et al.</i>, “Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites,” <i>Biochemistry</i>, vol. 54, no. 27. American Chemical Society, pp. 4163–4166, 2015.","chicago":"Veldkamp, Christopher, Eva Kiermaier, Skylar Gabel Eissens, Miranda Gillitzer, David Lippner, Frank Disilvio, Casey Mueller, et al. “Solution Structure of CCL19 and Identification of Overlapping CCR7 and PSGL-1 Binding Sites.” <i>Biochemistry</i>. American Chemical Society, 2015. <a href=\"https://doi.org/10.1021/acs.biochem.5b00560\">https://doi.org/10.1021/acs.biochem.5b00560</a>."},"department":[{"_id":"MiSi"}],"type":"journal_article","date_created":"2018-12-11T11:53:03Z","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","pmid":1,"volume":54,"ec_funded":1,"title":"Solution structure of CCL19 and identification of overlapping CCR7 and PSGL-1 binding sites","quality_controlled":"1","page":"4163 - 4166","intvolume":"        54","status":"public","author":[{"full_name":"Veldkamp, Christopher","first_name":"Christopher","last_name":"Veldkamp"},{"orcid":"0000-0001-6165-5738","last_name":"Kiermaier","first_name":"Eva","full_name":"Kiermaier, Eva","id":"3EB04B78-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Gabel Eissens","first_name":"Skylar","full_name":"Gabel Eissens, Skylar"},{"first_name":"Miranda","full_name":"Gillitzer, Miranda","last_name":"Gillitzer"},{"last_name":"Lippner","first_name":"David","full_name":"Lippner, David"},{"full_name":"Disilvio, Frank","first_name":"Frank","last_name":"Disilvio"},{"first_name":"Casey","full_name":"Mueller, Casey","last_name":"Mueller"},{"first_name":"Paeton","full_name":"Wantuch, Paeton","last_name":"Wantuch"},{"last_name":"Chaffee","full_name":"Chaffee, Gary","first_name":"Gary"},{"full_name":"Famiglietti, Michael","first_name":"Michael","last_name":"Famiglietti"},{"last_name":"Zgoba","full_name":"Zgoba, Danielle","first_name":"Danielle"},{"last_name":"Bailey","full_name":"Bailey, Asha","first_name":"Asha"},{"full_name":"Bah, Yaya","first_name":"Yaya","last_name":"Bah"},{"full_name":"Engebretson, Samantha","first_name":"Samantha","last_name":"Engebretson"},{"last_name":"Graupner","first_name":"David","full_name":"Graupner, David"},{"last_name":"Lackner","full_name":"Lackner, Emily","first_name":"Emily"},{"full_name":"Larosa, Vincent","first_name":"Vincent","last_name":"Larosa"},{"full_name":"Medeiros, Tysha","first_name":"Tysha","last_name":"Medeiros"},{"first_name":"Michael","full_name":"Olson, Michael","last_name":"Olson"},{"last_name":"Phillips","first_name":"Andrew","full_name":"Phillips, Andrew"},{"last_name":"Pyles","full_name":"Pyles, Harley","first_name":"Harley"},{"last_name":"Richard","full_name":"Richard, Amanda","first_name":"Amanda"},{"last_name":"Schoeller","first_name":"Scott","full_name":"Schoeller, Scott"},{"last_name":"Touzeau","full_name":"Touzeau, Boris","first_name":"Boris"},{"full_name":"Williams, Larry","first_name":"Larry","last_name":"Williams"},{"id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","first_name":"Michael K","full_name":"Sixt, Michael K","orcid":"0000-0002-6620-9179","last_name":"Sixt"},{"last_name":"Peterson","full_name":"Peterson, Francis","first_name":"Francis"}],"external_id":{"isi":["000358105100001"],"pmid":["26115234"]},"language":[{"iso":"eng"}]},{"article_number":"193","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","ddc":["570"],"date_created":"2018-12-11T11:53:05Z","has_accepted_license":"1","volume":8,"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"},"title":"Single-cell screening of photosynthetic growth and lactate production by cyanobacteria","quality_controlled":"1","author":[{"full_name":"Hammar, Petter","first_name":"Petter","last_name":"Hammar"},{"id":"4677C796-F248-11E8-B48F-1D18A9856A87","full_name":"Angermayr, Andreas","first_name":"Andreas","orcid":"0000-0001-8619-2223","last_name":"Angermayr"},{"first_name":"Staffan","full_name":"Sjostrom, Staffan","last_name":"Sjostrom"},{"last_name":"Van Der Meer","first_name":"Josefin","full_name":"Van Der Meer, Josefin"},{"last_name":"Hellingwerf","full_name":"Hellingwerf, Klaas","first_name":"Klaas"},{"last_name":"Hudson","first_name":"Elton","full_name":"Hudson, Elton"},{"first_name":"Hakaan","full_name":"Joensson, Hakaan","last_name":"Joensson"}],"external_id":{"isi":["000365784000009"]},"language":[{"iso":"eng"}],"intvolume":"         8","status":"public","file":[{"checksum":"172b0b6f4eb2e5c22b7cec1d57dc0107","file_name":"IST-2016-467-v1+1_s13068-015-0380-2.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_size":2914089,"file_id":"4796","relation":"main_file","date_created":"2018-12-12T10:10:11Z","creator":"system","access_level":"open_access"}],"oa_version":"Published Version","publication_status":"published","article_processing_charge":"No","publisher":"BioMed Central","date_published":"2015-11-25T00:00:00Z","pubrep_id":"467","scopus_import":"1","abstract":[{"lang":"eng","text":"Background\r\nPhotosynthetic cyanobacteria are attractive for a range of biotechnological applications including biofuel production. However, due to slow growth, screening of mutant libraries using microtiter plates is not feasible.\r\nResults\r\nWe present a method for high-throughput, single-cell analysis and sorting of genetically engineered l-lactate-producing strains of Synechocystis sp. PCC6803. A microfluidic device is used to encapsulate single cells in picoliter droplets, assay the droplets for l-lactate production, and sort strains with high productivity. We demonstrate the separation of low- and high-producing reference strains, as well as enrichment of a more productive l-lactate-synthesizing population after UV-induced mutagenesis. The droplet platform also revealed population heterogeneity in photosynthetic growth and lactate production, as well as the presence of metabolically stalled cells.\r\nConclusions\r\nThe workflow will facilitate metabolic engineering and directed evolution studies and will be useful in studies of cyanobacteria biochemistry and physiology.\r\n"}],"year":"2015","month":"11","isi":1,"date_updated":"2025-09-23T10:45:43Z","day":"25","_id":"1623","publist_id":"5537","issue":"1","file_date_updated":"2020-07-14T12:45:07Z","publication":"Biotechnology for Biofuels","oa":1,"department":[{"_id":"ToBo"}],"citation":{"ieee":"P. Hammar <i>et al.</i>, “Single-cell screening of photosynthetic growth and lactate production by cyanobacteria,” <i>Biotechnology for Biofuels</i>, vol. 8, no. 1. BioMed Central, 2015.","chicago":"Hammar, Petter, Andreas Angermayr, Staffan Sjostrom, Josefin Van Der Meer, Klaas Hellingwerf, Elton Hudson, and Hakaan Joensson. “Single-Cell Screening of Photosynthetic Growth and Lactate Production by Cyanobacteria.” <i>Biotechnology for Biofuels</i>. BioMed Central, 2015. <a href=\"https://doi.org/10.1186/s13068-015-0380-2\">https://doi.org/10.1186/s13068-015-0380-2</a>.","short":"P. Hammar, A. Angermayr, S. Sjostrom, J. Van Der Meer, K. Hellingwerf, E. Hudson, H. Joensson, Biotechnology for Biofuels 8 (2015).","ama":"Hammar P, Angermayr A, Sjostrom S, et al. Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. <i>Biotechnology for Biofuels</i>. 2015;8(1). doi:<a href=\"https://doi.org/10.1186/s13068-015-0380-2\">10.1186/s13068-015-0380-2</a>","mla":"Hammar, Petter, et al. “Single-Cell Screening of Photosynthetic Growth and Lactate Production by Cyanobacteria.” <i>Biotechnology for Biofuels</i>, vol. 8, no. 1, 193, BioMed Central, 2015, doi:<a href=\"https://doi.org/10.1186/s13068-015-0380-2\">10.1186/s13068-015-0380-2</a>.","ista":"Hammar P, Angermayr A, Sjostrom S, Van Der Meer J, Hellingwerf K, Hudson E, Joensson H. 2015. Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. Biotechnology for Biofuels. 8(1), 193.","apa":"Hammar, P., Angermayr, A., Sjostrom, S., Van Der Meer, J., Hellingwerf, K., Hudson, E., &#38; Joensson, H. (2015). Single-cell screening of photosynthetic growth and lactate production by cyanobacteria. <i>Biotechnology for Biofuels</i>. BioMed Central. <a href=\"https://doi.org/10.1186/s13068-015-0380-2\">https://doi.org/10.1186/s13068-015-0380-2</a>"},"type":"journal_article","doi":"10.1186/s13068-015-0380-2"},{"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"17147","corr_author":"1","date_created":"2018-12-11T11:53:06Z","ddc":["000"],"has_accepted_license":"1","volume":5,"ec_funded":1,"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"},"quality_controlled":"1","title":"Cellular cooperation with shift updating and repulsion","language":[{"iso":"eng"}],"external_id":{"isi":["000365299500001"]},"author":[{"orcid":"0000-0002-8943-0722","last_name":"Pavlogiannis","full_name":"Pavlogiannis, Andreas","first_name":"Andreas","id":"49704004-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Chatterjee, Krishnendu","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Adlam, Ben","first_name":"Ben","last_name":"Adlam"},{"first_name":"Martin","full_name":"Nowak, Martin","last_name":"Nowak"}],"intvolume":"         5","status":"public","file":[{"file_size":1021931,"date_updated":"2020-07-14T12:45:07Z","content_type":"application/pdf","file_name":"IST-2016-466-v1+1_srep17147.pdf","checksum":"38e06d8310d2087cae5f6d4d4bfe082b","access_level":"open_access","creator":"system","date_created":"2018-12-12T10:12:29Z","relation":"main_file","file_id":"4947"}],"oa_version":"Published Version","publication_status":"published","project":[{"name":"Modern Graph Algorithmic Techniques in Formal Verification","_id":"2584A770-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"P 23499-N23"},{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307"},{"name":"Microsoft Research Faculty Fellowship","_id":"2587B514-B435-11E9-9278-68D0E5697425"}],"article_processing_charge":"No","date_published":"2015-11-25T00:00:00Z","publisher":"Nature Publishing Group","pubrep_id":"466","scopus_import":"1","year":"2015","abstract":[{"lang":"eng","text":"Population structure can facilitate evolution of cooperation. In a structured population, cooperators can form clusters which resist exploitation by defectors. Recently, it was observed that a shift update rule is an extremely strong amplifier of cooperation in a one dimensional spatial model. For the shift update rule, an individual is chosen for reproduction proportional to fecundity; the offspring is placed next to the parent; a random individual dies. Subsequently, the population is rearranged (shifted) until all individual cells are again evenly spaced out. For large population size and a one dimensional population structure, the shift update rule favors cooperation for any benefit-to-cost ratio greater than one. But every attempt to generalize shift updating to higher dimensions while maintaining its strong effect has failed. The reason is that in two dimensions the clusters are fragmented by the movements caused by rearranging the cells. Here we introduce the natural phenomenon of a repulsive force between cells of different types. After a birth and death event, the cells are being rearranged minimizing the overall energy expenditure. If the repulsive force is sufficiently high, shift becomes a strong promoter of cooperation in two dimensions."}],"date_updated":"2025-09-23T08:13:52Z","month":"11","isi":1,"day":"25","_id":"1624","publist_id":"5536","file_date_updated":"2020-07-14T12:45:07Z","publication":"Scientific Reports","oa":1,"department":[{"_id":"KrCh"}],"type":"journal_article","citation":{"short":"A. Pavlogiannis, K. Chatterjee, B. Adlam, M. Nowak, Scientific Reports 5 (2015).","ama":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. Cellular cooperation with shift updating and repulsion. <i>Scientific Reports</i>. 2015;5. doi:<a href=\"https://doi.org/10.1038/srep17147\">10.1038/srep17147</a>","mla":"Pavlogiannis, Andreas, et al. “Cellular Cooperation with Shift Updating and Repulsion.” <i>Scientific Reports</i>, vol. 5, 17147, Nature Publishing Group, 2015, doi:<a href=\"https://doi.org/10.1038/srep17147\">10.1038/srep17147</a>.","apa":"Pavlogiannis, A., Chatterjee, K., Adlam, B., &#38; Nowak, M. (2015). Cellular cooperation with shift updating and repulsion. <i>Scientific Reports</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/srep17147\">https://doi.org/10.1038/srep17147</a>","ista":"Pavlogiannis A, Chatterjee K, Adlam B, Nowak M. 2015. Cellular cooperation with shift updating and repulsion. Scientific Reports. 5, 17147.","ieee":"A. Pavlogiannis, K. Chatterjee, B. Adlam, and M. Nowak, “Cellular cooperation with shift updating and repulsion,” <i>Scientific Reports</i>, vol. 5. Nature Publishing Group, 2015.","chicago":"Pavlogiannis, Andreas, Krishnendu Chatterjee, Ben Adlam, and Martin Nowak. “Cellular Cooperation with Shift Updating and Repulsion.” <i>Scientific Reports</i>. Nature Publishing Group, 2015. <a href=\"https://doi.org/10.1038/srep17147\">https://doi.org/10.1038/srep17147</a>."},"doi":"10.1038/srep17147","acknowledgement":"The research was supported by the Austrian Science Fund (FWF) Grant No P23499-N23, FWF NFN Grant No S11407-N23 (RiSE/SHiNE), ERC Start grant (279307: Graph Games), and Microsoft Faculty Fellows award. Support from the John Templeton foundation is gratefully acknowledged."},{"type":"conference","citation":{"chicago":"Bermano, Amit, Thabo Beeler, Yeara Kozlov, Derek Bradley, Bernd Bickel, and Markus Gross. “Detailed Spatio-Temporal Reconstruction of Eyelids,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766924\">https://doi.org/10.1145/2766924</a>.","ieee":"A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, and M. Gross, “Detailed spatio-temporal reconstruction of eyelids,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","apa":"Bermano, A., Beeler, T., Kozlov, Y., Bradley, D., Bickel, B., &#38; Gross, M. (2015). Detailed spatio-temporal reconstruction of eyelids (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766924\">https://doi.org/10.1145/2766924</a>","ista":"Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. 2015. Detailed spatio-temporal reconstruction of eyelids. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 44.","mla":"Bermano, Amit, et al. <i>Detailed Spatio-Temporal Reconstruction of Eyelids</i>. Vol. 34, no. 4, 44, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766924\">10.1145/2766924</a>.","ama":"Bermano A, Beeler T, Kozlov Y, Bradley D, Bickel B, Gross M. Detailed spatio-temporal reconstruction of eyelids. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766924\">10.1145/2766924</a>","short":"A. Bermano, T. Beeler, Y. Kozlov, D. Bradley, B. Bickel, M. Gross, in:, ACM, 2015."},"department":[{"_id":"BeBi"}],"doi":"10.1145/2766924","_id":"1625","day":"27","publist_id":"5535","issue":"4","date_published":"2015-07-27T00:00:00Z","publisher":"ACM","scopus_import":"1","year":"2015","abstract":[{"text":"In recent years we have seen numerous improvements on 3D scanning and tracking of human faces, greatly advancing the creation of digital doubles for film and video games. However, despite the high-resolution quality of the reconstruction approaches available, current methods are unable to capture one of the most important regions of the face - the eye region. In this work we present the first method for detailed spatio-temporal reconstruction of eyelids. Tracking and reconstructing eyelids is extremely challenging, as this region exhibits very complex and unique skin deformation where skin is folded under while opening the eye. Furthermore, eyelids are often only partially visible and obstructed due to selfocclusion and eyelashes. Our approach is to combine a geometric deformation model with image data, leveraging multi-view stereo, optical flow, contour tracking and wrinkle detection from local skin appearance. Our deformation model serves as a prior that enables reconstruction of eyelids even under strong self-occlusions caused by rolling and folding skin as the eye opens and closes. The output is a person-specific, time-varying eyelid reconstruction with anatomically plausible deformations. Our high-resolution detailed eyelids couple naturally with current facial performance capture approaches. As a result, our method can largely increase the fidelity of facial capture and the creation of digital doubles.","lang":"eng"}],"date_updated":"2025-09-23T08:25:37Z","month":"07","isi":1,"oa_version":"None","publication_status":"published","article_processing_charge":"No","language":[{"iso":"eng"}],"author":[{"first_name":"Amit","full_name":"Bermano, Amit","last_name":"Bermano"},{"last_name":"Beeler","first_name":"Thabo","full_name":"Beeler, Thabo"},{"last_name":"Kozlov","full_name":"Kozlov, Yeara","first_name":"Yeara"},{"full_name":"Bradley, Derek","first_name":"Derek","last_name":"Bradley"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"last_name":"Gross","first_name":"Markus","full_name":"Gross, Markus"}],"external_id":{"isi":["000358786600010"]},"intvolume":"        34","status":"public","quality_controlled":"1","title":"Detailed spatio-temporal reconstruction of eyelids","volume":34,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"44","conference":{"location":"Los Angeles, CA, United States","end_date":"2015-08-13","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2015-08-09"},"date_created":"2018-12-11T11:53:06Z"},{"article_processing_charge":"No","publication_status":"published","oa_version":"None","month":"07","isi":1,"date_updated":"2025-09-23T09:42:49Z","scopus_import":"1","abstract":[{"text":"This paper introduces &quot;OmniAD,&quot; a novel data-driven pipeline to model and acquire the aerodynamics of three-dimensional rigid objects. Traditionally, aerodynamics are examined through elaborate wind tunnel experiments or expensive fluid dynamics computations, and are only measured for a small number of discrete wind directions. OmniAD allows the evaluation of aerodynamic forces, such as drag and lift, for any incoming wind direction using a novel representation based on spherical harmonics. Our datadriven technique acquires the aerodynamic properties of an object simply by capturing its falling motion using a single camera. Once model parameters are estimated, OmniAD enables realistic realtime simulation of rigid bodies, such as the tumbling and gliding of leaves, without simulating the surrounding air. In addition, we propose an intuitive user interface based on OmniAD to interactively design three-dimensional kites that actually fly. Various nontraditional kites were designed to demonstrate the physical validity of our model.","lang":"eng"}],"year":"2015","alternative_title":["ACM Transactions on Graphics"],"publisher":"ACM","date_published":"2015-07-27T00:00:00Z","issue":"4","publist_id":"5532","day":"27","_id":"1626","doi":"10.1145/2766919","citation":{"chicago":"Martin, Tobias, Nobuyuki Umetani, and Bernd Bickel. “OmniAD: Data-Driven Omni-Directional Aerodynamics,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766919\">https://doi.org/10.1145/2766919</a>.","ieee":"T. Martin, N. Umetani, and B. Bickel, “OmniAD: Data-driven omni-directional aerodynamics,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","ista":"Martin T, Umetani N, Bickel B. 2015. OmniAD: Data-driven omni-directional aerodynamics. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 34, 113.","apa":"Martin, T., Umetani, N., &#38; Bickel, B. (2015). OmniAD: Data-driven omni-directional aerodynamics (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766919\">https://doi.org/10.1145/2766919</a>","short":"T. Martin, N. Umetani, B. Bickel, in:, ACM, 2015.","mla":"Martin, Tobias, et al. <i>OmniAD: Data-Driven Omni-Directional Aerodynamics</i>. Vol. 34, no. 4, 113, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766919\">10.1145/2766919</a>.","ama":"Martin T, Umetani N, Bickel B. OmniAD: Data-driven omni-directional aerodynamics. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766919\">10.1145/2766919</a>"},"type":"conference","department":[{"_id":"BeBi"}],"date_created":"2018-12-11T11:53:06Z","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2015-08-13","start_date":"2015-08-09","location":"Los Angeles, CA, United States"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"113","volume":34,"title":"OmniAD: Data-driven omni-directional aerodynamics","quality_controlled":"1","status":"public","intvolume":"        34","external_id":{"isi":["000358786600079"]},"author":[{"first_name":"Tobias","full_name":"Martin, Tobias","last_name":"Martin"},{"last_name":"Umetani","first_name":"Nobuyuki","full_name":"Umetani, Nobuyuki"},{"orcid":"0000-0001-6511-9385","last_name":"Bickel","first_name":"Bernd","full_name":"Bickel, Bernd","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}]},{"volume":34,"conference":{"location":"Los Angeles, CA, United States","end_date":"2015-08-13","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2015-08-09"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"138","date_created":"2018-12-11T11:53:07Z","external_id":{"isi":["000358786600104"]},"author":[{"last_name":"Pérez","full_name":"Pérez, Jesús","first_name":"Jesús"},{"last_name":"Thomaszewski","first_name":"Bernhard","full_name":"Thomaszewski, Bernhard"},{"full_name":"Coros, Stelian","first_name":"Stelian","last_name":"Coros"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","last_name":"Bickel","orcid":"0000-0001-6511-9385"},{"first_name":"José","full_name":"Canabal, José","last_name":"Canabal"},{"first_name":"Robert","full_name":"Sumner, Robert","last_name":"Sumner"},{"full_name":"Otaduy, Miguel","first_name":"Miguel","last_name":"Otaduy"}],"language":[{"iso":"eng"}],"intvolume":"        34","status":"public","title":"Design and fabrication of flexible rod meshes","quality_controlled":"1","publisher":"ACM","date_published":"2015-07-27T00:00:00Z","scopus_import":"1","year":"2015","abstract":[{"lang":"eng","text":"We present a computational tool for fabrication-oriented design of flexible rod meshes. Given a deformable surface and a set of deformed poses as input, our method automatically computes a printable rod mesh that, once manufactured, closely matches the input poses under the same boundary conditions. The core of our method is formed by an optimization scheme that adjusts the cross-sectional profiles of the rods and their rest centerline in order to best approximate the target deformations. This approach allows us to locally control the bending and stretching resistance of the surface with a single material, yielding high design flexibility and low fabrication cost."}],"isi":1,"month":"07","date_updated":"2025-09-23T08:24:55Z","oa_version":"None","publication_status":"published","article_processing_charge":"No","citation":{"ieee":"J. Pérez <i>et al.</i>, “Design and fabrication of flexible rod meshes,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","chicago":"Pérez, Jesús, Bernhard Thomaszewski, Stelian Coros, Bernd Bickel, José Canabal, Robert Sumner, and Miguel Otaduy. “Design and Fabrication of Flexible Rod Meshes,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766998\">https://doi.org/10.1145/2766998</a>.","short":"J. Pérez, B. Thomaszewski, S. Coros, B. Bickel, J. Canabal, R. Sumner, M. Otaduy, in:, ACM, 2015.","mla":"Pérez, Jesús, et al. <i>Design and Fabrication of Flexible Rod Meshes</i>. Vol. 34, no. 4, 138, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766998\">10.1145/2766998</a>.","ama":"Pérez J, Thomaszewski B, Coros S, et al. Design and fabrication of flexible rod meshes. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766998\">10.1145/2766998</a>","ista":"Pérez J, Thomaszewski B, Coros S, Bickel B, Canabal J, Sumner R, Otaduy M. 2015. Design and fabrication of flexible rod meshes. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 138.","apa":"Pérez, J., Thomaszewski, B., Coros, S., Bickel, B., Canabal, J., Sumner, R., &#38; Otaduy, M. (2015). Design and fabrication of flexible rod meshes (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766998\">https://doi.org/10.1145/2766998</a>"},"type":"conference","department":[{"_id":"BeBi"}],"acknowledgement":"This work was supported in part by grants from the Spanish Ministry of Economy (TIN2012-35840), and the European Research Council (ERC Starting Grant no. 280135 Animetrics).","doi":"10.1145/2766998","_id":"1627","day":"27","publist_id":"5530","issue":"4"},{"quality_controlled":"1","title":"Microstructures to control elasticity in 3D printing","status":"public","intvolume":"        34","language":[{"iso":"eng"}],"external_id":{"isi":["000358786600102"]},"author":[{"last_name":"Schumacher","full_name":"Schumacher, Christian","first_name":"Christian"},{"id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","last_name":"Bickel"},{"first_name":"Jan","full_name":"Rys, Jan","last_name":"Rys"},{"first_name":"Steve","full_name":"Marschner, Steve","last_name":"Marschner"},{"full_name":"Daraio, Chiara","first_name":"Chiara","last_name":"Daraio"},{"first_name":"Markus","full_name":"Gross, Markus","last_name":"Gross"}],"date_created":"2018-12-11T11:53:07Z","article_number":"136","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2015-08-13","start_date":"2015-08-09","location":"Los Angeles, CA, USA"},"volume":34,"issue":"4","publist_id":"5529","_id":"1628","day":"01","doi":"10.1145/2766926","department":[{"_id":"BeBi"}],"citation":{"ieee":"C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, and M. Gross, “Microstructures to control elasticity in 3D printing,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 2015, vol. 34, no. 4.","chicago":"Schumacher, Christian, Bernd Bickel, Jan Rys, Steve Marschner, Chiara Daraio, and Markus Gross. “Microstructures to Control Elasticity in 3D Printing,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766926\">https://doi.org/10.1145/2766926</a>.","mla":"Schumacher, Christian, et al. <i>Microstructures to Control Elasticity in 3D Printing</i>. Vol. 34, no. 4, 136, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766926\">10.1145/2766926</a>.","ama":"Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. Microstructures to control elasticity in 3D printing. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766926\">10.1145/2766926</a>","short":"C. Schumacher, B. Bickel, J. Rys, S. Marschner, C. Daraio, M. Gross, in:, ACM, 2015.","apa":"Schumacher, C., Bickel, B., Rys, J., Marschner, S., Daraio, C., &#38; Gross, M. (2015). Microstructures to control elasticity in 3D printing (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA: ACM. <a href=\"https://doi.org/10.1145/2766926\">https://doi.org/10.1145/2766926</a>","ista":"Schumacher C, Bickel B, Rys J, Marschner S, Daraio C, Gross M. 2015. Microstructures to control elasticity in 3D printing. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 136."},"type":"conference","oa":1,"article_processing_charge":"No","publication_status":"published","oa_version":"Published Version","date_updated":"2025-09-23T09:34:10Z","month":"08","isi":1,"scopus_import":"1","year":"2015","abstract":[{"text":"We propose a method for fabricating deformable objects with spatially varying elasticity using 3D printing. Using a single, relatively stiff printer material, our method designs an assembly of smallscale microstructures that have the effect of a softer material at the object scale, with properties depending on the microstructure used in each part of the object. We build on work in the area of metamaterials, using numerical optimization to design tiled microstructures with desired properties, but with the key difference that our method designs families of related structures that can be interpolated to smoothly vary the material properties over a wide range. To create an object with spatially varying elastic properties, we tile the object's interior with microstructures drawn from these families, generating a different microstructure for each cell using an efficient algorithm to select compatible structures for neighboring cells. We show results computed for both 2D and 3D objects, validating several 2D and 3D printed structures using standard material tests as well as demonstrating various example applications.","lang":"eng"}],"main_file_link":[{"open_access":"1","url":"https://doi.org/10.1145/2766926"}],"date_published":"2015-08-01T00:00:00Z","publisher":"ACM"},{"pubrep_id":"576","date_published":"2015-07-27T00:00:00Z","publisher":"ACM","date_updated":"2025-09-23T09:26:17Z","month":"07","isi":1,"year":"2015","scopus_import":"1","abstract":[{"text":"We present a method to learn and propagate shape placements in 2D polygonal scenes from a few examples provided by a user. The placement of a shape is modeled as an oriented bounding box. Simple geometric relationships between this bounding box and nearby scene polygons define a feature set for the placement. The feature sets of all example placements are then used to learn a probabilistic model over all possible placements and scenes. With this model, we can generate a new set of placements with similar geometric relationships in any given scene. We introduce extensions that enable propagation and generation of shapes in 3D    scenes, as well as the application of a learned modeling session to large scenes without additional user interaction. These concepts allow us to generate complex scenes with thousands of objects with relatively little user interaction.","lang":"eng"}],"oa_version":"Submitted Version","file":[{"file_id":"4647","creator":"system","access_level":"open_access","relation":"main_file","date_created":"2018-12-12T10:07:49Z","content_type":"application/pdf","checksum":"8b05a51e372c9b0b5af9a00098a9538b","file_name":"IST-2016-576-v1+1_guerrero-2015-lsp-paper.pdf","file_size":11902290,"date_updated":"2020-07-14T12:45:07Z"}],"article_processing_charge":"No","project":[{"call_identifier":"FWF","grant_number":"P 24352-N23","name":"Deep Pictures: Creating Visual and Haptic Vector Images","_id":"25357BD2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","department":[{"_id":"ChWo"}],"type":"conference","citation":{"ista":"Guerrero P, Jeschke S, Wimmer M, Wonka P. 2015. Learning shape placements by example. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 108.","apa":"Guerrero, P., Jeschke, S., Wimmer, M., &#38; Wonka, P. (2015). Learning shape placements by example (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2766933\">https://doi.org/10.1145/2766933</a>","mla":"Guerrero, Paul, et al. <i>Learning Shape Placements by Example</i>. Vol. 34, no. 4, 108, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766933\">10.1145/2766933</a>.","ama":"Guerrero P, Jeschke S, Wimmer M, Wonka P. Learning shape placements by example. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766933\">10.1145/2766933</a>","short":"P. Guerrero, S. Jeschke, M. Wimmer, P. Wonka, in:, ACM, 2015.","chicago":"Guerrero, Paul, Stefan Jeschke, Michael Wimmer, and Peter Wonka. “Learning Shape Placements by Example,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766933\">https://doi.org/10.1145/2766933</a>.","ieee":"P. Guerrero, S. Jeschke, M. Wimmer, and P. Wonka, “Learning shape placements by example,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4."},"oa":1,"doi":"10.1145/2766933","acknowledgement":"This publication is based upon work supported by the KAUST Office of Competitive Research Funds (OCRF) under Award No. 62140401, the KAUST Visual Computing Center and the Austrian Science Fund (FWF) projects DEEP PICTURES (no. P24352-N23) and Data-Driven Procedural Modeling of Interiors (no. P24600-N23).","publist_id":"5525","_id":"1630","day":"27","file_date_updated":"2020-07-14T12:45:07Z","issue":"4","has_accepted_license":"1","volume":34,"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"108","conference":{"location":"Los Angeles, CA, United States","start_date":"2015-08-09","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2015-08-13"},"date_created":"2018-12-11T11:53:08Z","ddc":["000"],"language":[{"iso":"eng"}],"author":[{"first_name":"Paul","full_name":"Guerrero, Paul","last_name":"Guerrero"},{"full_name":"Jeschke, Stefan","first_name":"Stefan","last_name":"Jeschke","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wimmer","full_name":"Wimmer, Michael","first_name":"Michael"},{"last_name":"Wonka","first_name":"Peter","full_name":"Wonka, Peter"}],"external_id":{"isi":["000358786600074"]},"status":"public","intvolume":"        34","quality_controlled":"1","title":"Learning shape placements by example"},{"volume":34,"has_accepted_license":"1","ddc":["000"],"date_created":"2018-12-11T11:53:09Z","conference":{"location":"Los Angeles, CA, USA","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2015-08-13","start_date":"2015-08-09"},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"53","status":"public","intvolume":"        34","external_id":{"isi":["000358786600019"]},"author":[{"last_name":"Ando","first_name":"Ryoichi","full_name":"Ando, Ryoichi"},{"last_name":"Thuerey","first_name":"Nils","full_name":"Thuerey, Nils"},{"full_name":"Wojtan, Christopher J","first_name":"Christopher J","orcid":"0000-0001-6646-5546","last_name":"Wojtan","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"}],"language":[{"iso":"eng"}],"title":"A stream function solver for liquid simulations","quality_controlled":"1","month":"07","isi":1,"date_updated":"2025-09-23T07:27:29Z","year":"2015","abstract":[{"lang":"eng","text":"This paper presents a liquid simulation technique that enforces the incompressibility condition using a stream function solve instead of a pressure projection. Previous methods have used stream function techniques for the simulation of detailed single-phase flows, but a formulation for liquid simulation has proved elusive in part due to the free surface boundary conditions. In this paper, we introduce a stream function approach to liquid simulations with novel boundary conditions for free surfaces, solid obstacles, and solid-fluid coupling.\r\n\r\nAlthough our approach increases the dimension of the linear system necessary to enforce incompressibility, it provides interesting and surprising benefits. First, the resulting flow is guaranteed to be divergence-free regardless of the accuracy of the solve. Second, our free-surface boundary conditions guarantee divergence-free motion even in the un-simulated air phase, which enables two-phase flow simulation by only computing a single phase. We implemented this method using a variant of FLIP simulation which only samples particles within a narrow band of the liquid surface, and we illustrate the effectiveness of our method for detailed two-phase flow simulations with complex boundaries, detailed bubble interactions, and two-way solid-fluid coupling."}],"scopus_import":"1","alternative_title":["ACM Transactions on Graphics"],"pubrep_id":"610","publisher":"ACM","date_published":"2015-07-27T00:00:00Z","article_processing_charge":"No","publication_status":"published","oa_version":"Submitted Version","file":[{"date_created":"2018-12-12T10:11:52Z","relation":"main_file","access_level":"open_access","creator":"system","file_id":"4909","date_updated":"2020-07-14T12:45:07Z","file_size":21831121,"file_name":"IST-2016-610-v1+1_vecpotential.pdf","checksum":"7a9afdfaba9209157ce19376e15bc90b","content_type":"application/pdf"}],"acknowledgement":"The first author was supported by a JSPS Postdoctoral Fellowship for Research Abroad. This work was also supported by the ERC projects ERC-2014-StG-637014 realFlow and ERC-2014- StG-638176 BigSplash.","doi":"10.1145/2766935","citation":{"apa":"Ando, R., Thuerey, N., &#38; Wojtan, C. (2015). A stream function solver for liquid simulations (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA: ACM. <a href=\"https://doi.org/10.1145/2766935\">https://doi.org/10.1145/2766935</a>","ista":"Ando R, Thuerey N, Wojtan C. 2015. A stream function solver for liquid simulations. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, ACM Transactions on Graphics, vol. 34, 53.","short":"R. Ando, N. Thuerey, C. Wojtan, in:, ACM, 2015.","mla":"Ando, Ryoichi, et al. <i>A Stream Function Solver for Liquid Simulations</i>. Vol. 34, no. 4, 53, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2766935\">10.1145/2766935</a>.","ama":"Ando R, Thuerey N, Wojtan C. A stream function solver for liquid simulations. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2766935\">10.1145/2766935</a>","chicago":"Ando, Ryoichi, Nils Thuerey, and Chris Wojtan. “A Stream Function Solver for Liquid Simulations,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2766935\">https://doi.org/10.1145/2766935</a>.","ieee":"R. Ando, N. Thuerey, and C. Wojtan, “A stream function solver for liquid simulations,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, USA, 2015, vol. 34, no. 4."},"type":"conference","department":[{"_id":"ChWo"}],"oa":1,"issue":"4","file_date_updated":"2020-07-14T12:45:07Z","publist_id":"5523","_id":"1632","day":"27"},{"_id":"1634","day":"27","publist_id":"5521","file_date_updated":"2020-07-14T12:45:07Z","issue":"4","oa":1,"type":"conference","department":[{"_id":"ChWo"}],"citation":{"ieee":"F. Da, C. Batty, C. Wojtan, and E. Grinspun, “Double bubbles sans toil and trouble: discrete circulation-preserving vortex sheets for soap films and foams,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States, 2015, vol. 34, no. 4.","chicago":"Da, Fang, Christopher Batty, Chris Wojtan, and Eitan Grinspun. “Double Bubbles sans Toil and Trouble: Discrete Circulation-Preserving Vortex Sheets for Soap Films and Foams,” Vol. 34. ACM, 2015. <a href=\"https://doi.org/10.1145/2767003\">https://doi.org/10.1145/2767003</a>.","ama":"Da F, Batty C, Wojtan C, Grinspun E. Double bubbles sans toil and trouble: discrete circulation-preserving vortex sheets for soap films and foams. In: Vol 34. ACM; 2015. doi:<a href=\"https://doi.org/10.1145/2767003\">10.1145/2767003</a>","mla":"Da, Fang, et al. <i>Double Bubbles sans Toil and Trouble: Discrete Circulation-Preserving Vortex Sheets for Soap Films and Foams</i>. Vol. 34, no. 4, 149, ACM, 2015, doi:<a href=\"https://doi.org/10.1145/2767003\">10.1145/2767003</a>.","short":"F. Da, C. Batty, C. Wojtan, E. Grinspun, in:, ACM, 2015.","ista":"Da F, Batty C, Wojtan C, Grinspun E. 2015. Double bubbles sans toil and trouble: discrete circulation-preserving vortex sheets for soap films and foams. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques vol. 34, 149.","apa":"Da, F., Batty, C., Wojtan, C., &#38; Grinspun, E. (2015). Double bubbles sans toil and trouble: discrete circulation-preserving vortex sheets for soap films and foams (Vol. 34). Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Los Angeles, CA, United States: ACM. <a href=\"https://doi.org/10.1145/2767003\">https://doi.org/10.1145/2767003</a>"},"doi":"10.1145/2767003","file":[{"file_id":"4867","relation":"main_file","date_created":"2018-12-12T10:11:14Z","creator":"system","access_level":"open_access","checksum":"57b07d78d2d612a8052744b37d4a71fa","file_name":"IST-2016-608-v1+1_doublebubbles.pdf","content_type":"application/pdf","date_updated":"2020-07-14T12:45:07Z","file_size":8973215}],"oa_version":"Submitted Version","publication_status":"published","article_processing_charge":"No","project":[{"_id":"2533E772-B435-11E9-9278-68D0E5697425","name":"Big Splash: Efficient Simulation of Natural Phenomena at Extremely Large Scales","grant_number":"638176","call_identifier":"H2020"}],"date_published":"2015-07-27T00:00:00Z","publisher":"ACM","pubrep_id":"608","abstract":[{"text":"Simulating the delightful dynamics of soap films, bubbles, and foams has traditionally required the use of a fully three-dimensional many-phase Navier-Stokes solver, even though their visual appearance is completely dominated by the thin liquid surface. We depart from earlier work on soap bubbles and foams by noting that their dynamics are naturally described by a Lagrangian vortex sheet model in which circulation is the primary variable. This leads us to derive a novel circulation-preserving surface-only discretization of foam dynamics driven by surface tension on a non-manifold triangle mesh. We represent the surface using a mesh-based multimaterial surface tracker which supports complex bubble topology changes, and evolve the surface according to the ambient air flow induced by a scalar circulation field stored on the mesh. Surface tension forces give rise to a simple update rule for circulation, even at non-manifold Plateau borders, based on a discrete measure of signed scalar mean curvature. We further incorporate vertex constraints to enable the interaction of soap films with wires. The result is a method that is at once simple, robust, and efficient, yet able to capture an array of soap films behaviors including foam rearrangement, catenoid collapse, blowing bubbles, and double bubbles being pulled apart.","lang":"eng"}],"year":"2015","scopus_import":"1","date_updated":"2025-09-23T08:28:56Z","month":"07","isi":1,"quality_controlled":"1","title":"Double bubbles sans toil and trouble: discrete circulation-preserving vortex sheets for soap films and foams","language":[{"iso":"eng"}],"author":[{"first_name":"Fang","full_name":"Da, Fang","last_name":"Da"},{"last_name":"Batty","first_name":"Christopher","full_name":"Batty, Christopher"},{"last_name":"Wojtan","orcid":"0000-0001-6646-5546","first_name":"Christopher J","full_name":"Wojtan, Christopher J","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Grinspun, Eitan","first_name":"Eitan","last_name":"Grinspun"}],"external_id":{"isi":["000358786600115"]},"intvolume":"        34","status":"public","user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","article_number":"149","conference":{"start_date":"2015-08-09","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","end_date":"2015-08-13","location":"Los Angeles, CA, United States"},"date_created":"2018-12-11T11:53:09Z","ddc":["000"],"has_accepted_license":"1","volume":34,"ec_funded":1},{"publist_id":"5520","day":"01","_id":"1635","publication":"Annales de la faculté des sciences de Toulouse","issue":"4","citation":{"chicago":"Erbar, Matthias, Jan Maas, and Prasad Tetali. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” <i>Annales de La Faculté Des Sciences de Toulouse</i>. Faculté des sciences de Toulouse, 2015. <a href=\"https://doi.org/10.5802/afst.1464\">https://doi.org/10.5802/afst.1464</a>.","ieee":"M. Erbar, J. Maas, and P. Tetali, “Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models,” <i>Annales de la faculté des sciences de Toulouse</i>, vol. 24, no. 4. Faculté des sciences de Toulouse, pp. 781–800, 2015.","apa":"Erbar, M., Maas, J., &#38; Tetali, P. (2015). Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. <i>Annales de La Faculté Des Sciences de Toulouse</i>. Faculté des sciences de Toulouse. <a href=\"https://doi.org/10.5802/afst.1464\">https://doi.org/10.5802/afst.1464</a>","ista":"Erbar M, Maas J, Tetali P. 2015. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. Annales de la faculté des sciences de Toulouse. 24(4), 781–800.","short":"M. Erbar, J. Maas, P. Tetali, Annales de La Faculté Des Sciences de Toulouse 24 (2015) 781–800.","ama":"Erbar M, Maas J, Tetali P. Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models. <i>Annales de la faculté des sciences de Toulouse</i>. 2015;24(4):781-800. doi:<a href=\"https://doi.org/10.5802/afst.1464\">10.5802/afst.1464</a>","mla":"Erbar, Matthias, et al. “Discrete Ricci Curvature Bounds for Bernoulli-Laplace and Random Transposition Models.” <i>Annales de La Faculté Des Sciences de Toulouse</i>, vol. 24, no. 4, Faculté des sciences de Toulouse, 2015, pp. 781–800, doi:<a href=\"https://doi.org/10.5802/afst.1464\">10.5802/afst.1464</a>."},"type":"journal_article","department":[{"_id":"JaMa"}],"oa":1,"doi":"10.5802/afst.1464","oa_version":"Preprint","article_processing_charge":"No","publication_status":"published","date_published":"2015-01-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1409.8605"}],"publisher":"Faculté des sciences de Toulouse","date_updated":"2024-10-09T20:56:07Z","arxiv":1,"month":"01","abstract":[{"lang":"eng","text":"We calculate a Ricci curvature lower bound for some classical examples of random walks, namely, a chain on a slice of the n-dimensional discrete cube (the so-called Bernoulli-Laplace model) and the random transposition shuffle of the symmetric group of permutations on n letters."}],"year":"2015","page":"781 - 800","quality_controlled":"1","title":"Discrete Ricci curvature bounds for Bernoulli-Laplace and random transposition models","language":[{"iso":"eng"}],"external_id":{"arxiv":["1409.8605"]},"author":[{"last_name":"Erbar","first_name":"Matthias","full_name":"Erbar, Matthias"},{"id":"4C5696CE-F248-11E8-B48F-1D18A9856A87","first_name":"Jan","full_name":"Maas, Jan","orcid":"0000-0002-0845-1338","last_name":"Maas"},{"full_name":"Tetali, Prasad","first_name":"Prasad","last_name":"Tetali"}],"status":"public","intvolume":"        24","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_created":"2018-12-11T11:53:10Z","corr_author":"1","article_type":"original","volume":24},{"oa_version":"Preprint","article_processing_charge":"No","project":[{"call_identifier":"FP7","grant_number":"616160","name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1504.07067"}],"date_published":"2015-12-01T00:00:00Z","publisher":"Springer Nature","arxiv":1,"date_updated":"2025-09-23T08:39:38Z","isi":1,"month":"12","alternative_title":["LNCS"],"year":"2015","abstract":[{"lang":"eng","text":"Constraint Satisfaction Problem (CSP) is a fundamental algorithmic problem that appears in many areas of Computer Science. It can be equivalently stated as computing a homomorphism R→ΓΓ between two relational structures, e.g. between two directed graphs. Analyzing its complexity has been a prominent research direction, especially for the fixed template CSPs where the right side ΓΓ is fixed and the left side R is unconstrained.\r\n\r\nFar fewer results are known for the hybrid setting that restricts both sides simultaneously. It assumes that R belongs to a certain class of relational structures (called a structural restriction in this paper). We study which structural restrictions are effective, i.e. there exists a fixed template ΓΓ (from a certain class of languages) for which the problem is tractable when R is restricted, and NP-hard otherwise. We provide a characterization for structural restrictions that are closed under inverse homomorphisms. The criterion is based on the chromatic number of a relational structure defined in this paper; it generalizes the standard chromatic number of a graph.\r\n\r\nAs our main tool, we use the algebraic machinery developed for fixed template CSPs. To apply it to our case, we introduce a new construction called a “lifted language”. We also give a characterization for structural restrictions corresponding to minor-closed families of graphs, extend results to certain Valued CSPs (namely conservative valued languages), and state implications for (valued) CSPs with ordered variables and for the maximum weight independent set problem on some restricted families of graphs."}],"scopus_import":"1","publist_id":"5519","_id":"1636","day":"01","publication":"26th International Symposium","citation":{"apa":"Kolmogorov, V., Rolinek, M., &#38; Takhanov, R. (2015). Effectiveness of structural restrictions for hybrid CSPs. In <i>26th International Symposium</i> (Vol. 9472, pp. 566–577). Nagoya, Japan: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">https://doi.org/10.1007/978-3-662-48971-0_48</a>","ista":"Kolmogorov V, Rolinek M, Takhanov R. 2015. Effectiveness of structural restrictions for hybrid CSPs. 26th International Symposium. ISAAC: International Symposium on Algorithms and Computation, LNCS, vol. 9472, 566–577.","ama":"Kolmogorov V, Rolinek M, Takhanov R. Effectiveness of structural restrictions for hybrid CSPs. In: <i>26th International Symposium</i>. Vol 9472. Springer Nature; 2015:566-577. doi:<a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">10.1007/978-3-662-48971-0_48</a>","mla":"Kolmogorov, Vladimir, et al. “Effectiveness of Structural Restrictions for Hybrid CSPs.” <i>26th International Symposium</i>, vol. 9472, Springer Nature, 2015, pp. 566–77, doi:<a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">10.1007/978-3-662-48971-0_48</a>.","short":"V. Kolmogorov, M. Rolinek, R. Takhanov, in:, 26th International Symposium, Springer Nature, 2015, pp. 566–577.","chicago":"Kolmogorov, Vladimir, Michal Rolinek, and Rustem Takhanov. “Effectiveness of Structural Restrictions for Hybrid CSPs.” In <i>26th International Symposium</i>, 9472:566–77. Springer Nature, 2015. <a href=\"https://doi.org/10.1007/978-3-662-48971-0_48\">https://doi.org/10.1007/978-3-662-48971-0_48</a>.","ieee":"V. Kolmogorov, M. Rolinek, and R. Takhanov, “Effectiveness of structural restrictions for hybrid CSPs,” in <i>26th International Symposium</i>, Nagoya, Japan, 2015, vol. 9472, pp. 566–577."},"department":[{"_id":"VlKo"}],"type":"conference","oa":1,"doi":"10.1007/978-3-662-48971-0_48","publication_identifier":{"isbn":["978-3-662-48970-3"]},"user_id":"317138e5-6ab7-11ef-aa6d-ffef3953e345","conference":{"end_date":"2015-12-11","name":"ISAAC: International Symposium on Algorithms and Computation","start_date":"2015-12-09","location":"Nagoya, Japan"},"date_created":"2018-12-11T11:53:10Z","ec_funded":1,"volume":9472,"page":"566 - 577","quality_controlled":"1","title":"Effectiveness of structural restrictions for hybrid CSPs","language":[{"iso":"eng"}],"external_id":{"arxiv":["1504.07067"],"isi":["000375151300048"]},"author":[{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir"},{"full_name":"Rolinek, Michal","first_name":"Michal","last_name":"Rolinek","id":"3CB3BC06-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Takhanov, Rustem","first_name":"Rustem","last_name":"Takhanov"}],"status":"public","intvolume":"      9472"}]