[{"abstract":[{"text":"Verification of programs with procedures, multi-threaded programs, and higher-order functional programs can be effectively au- tomated using abstraction and refinement schemes that rely on spurious counterexamples for abstraction discovery. The analysis of counterexam- ples can be automated by a series of interpolation queries, or, alterna- tively, as a constraint solving query expressed by a set of recursion free Horn clauses. (A set of interpolation queries can be formulated as a single constraint over Horn clauses with linear dependency structure between the unknown relations.) In this paper we present an algorithm for solving recursion free Horn clauses over a combined theory of linear real/rational arithmetic and uninterpreted functions. Our algorithm performs resolu- tion to deal with the clausal structure and relies on partial solutions to deal with (non-local) instances of functionality axioms.","lang":"eng"}],"month":"12","publication_status":"published","volume":7078,"title":"Solving recursion-free Horn clauses over LI+UIF","language":[{"iso":"eng"}],"publisher":"Springer","date_published":"2011-12-05T00:00:00Z","citation":{"mla":"Gupta, Ashutosh, et al. <i>Solving Recursion-Free Horn Clauses over LI+UIF</i>. Edited by Hongseok Yang, vol. 7078, Springer, 2011, pp. 188–203, doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>.","short":"A. Gupta, C. Popeea, A. Rybalchenko, in:, H. Yang (Ed.), Springer, 2011, pp. 188–203.","ieee":"A. Gupta, C. Popeea, and A. Rybalchenko, “Solving recursion-free Horn clauses over LI+UIF,” presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan, 2011, vol. 7078, pp. 188–203.","apa":"Gupta, A., Popeea, C., &#38; Rybalchenko, A. (2011). Solving recursion-free Horn clauses over LI+UIF. In H. Yang (Ed.) (Vol. 7078, pp. 188–203). Presented at the APLAS: Asian Symposium on Programming Languages and Systems, Kenting, Taiwan: Springer. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>","ama":"Gupta A, Popeea C, Rybalchenko A. Solving recursion-free Horn clauses over LI+UIF. In: Yang H, ed. Vol 7078. Springer; 2011:188-203. doi:<a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">10.1007/978-3-642-25318-8_16</a>","chicago":"Gupta, Ashutosh, Corneliu Popeea, and Andrey Rybalchenko. “Solving Recursion-Free Horn Clauses over LI+UIF.” edited by Hongseok Yang, 7078:188–203. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25318-8_16\">https://doi.org/10.1007/978-3-642-25318-8_16</a>.","ista":"Gupta A, Popeea C, Rybalchenko A. 2011. Solving recursion-free Horn clauses over LI+UIF. APLAS: Asian Symposium on Programming Languages and Systems, LNCS, vol. 7078, 188–203."},"oa_version":"None","date_updated":"2021-01-12T07:42:15Z","project":[{"_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF"},{"call_identifier":"FP7","grant_number":"267989","_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling"}],"department":[{"_id":"ToHe"}],"quality_controlled":"1","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"author":[{"full_name":"Gupta, Ashutosh","id":"335E5684-F248-11E8-B48F-1D18A9856A87","last_name":"Gupta","first_name":"Ashutosh"},{"full_name":"Popeea, Corneliu","first_name":"Corneliu","last_name":"Popeea"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"editor":[{"full_name":"Yang, Hongseok","last_name":"Yang","first_name":"Hongseok"}],"intvolume":"      7078","ec_funded":1,"conference":{"name":"APLAS: Asian Symposium on Programming Languages and Systems","location":"Kenting, Taiwan","end_date":"2011-12-07","start_date":"2011-12-05"},"publist_id":"3383","type":"conference","_id":"3264","date_created":"2018-12-11T12:02:20Z","doi":"10.1007/978-3-642-25318-8_16","status":"public","page":"188 - 203","year":"2011","day":"05"},{"date_published":"2011-12-01T00:00:00Z","publisher":"Neural Information Processing Systems Foundation","language":[{"iso":"eng"}],"title":"Probabilistic joint image segmentation and labeling","volume":24,"abstract":[{"lang":"eng","text":"We present a joint image segmentation and labeling model (JSL) which, given a bag of figure-ground segment hypotheses extracted at multiple image locations and scales, constructs a joint probability distribution over both the compatible image interpretations (tilings or image segmentations) composed from those segments, and over their labeling into categories. The process of drawing samples from the joint distribution can be interpreted as first sampling tilings, modeled as maximal cliques, from a graph connecting spatially non-overlapping segments in the bag [1], followed by sampling labels for those segments, conditioned on the choice of a particular tiling. We learn the segmentation and labeling parameters jointly, based on Maximum Likelihood with a novel Incremental Saddle Point estimation procedure. The partition function over tilings and labelings is increasingly more accurately approximated by including incorrect configurations that a not-yet-competent model rates probable during learning. We show that the proposed methodologymatches the current state of the art in the Stanford dataset [2], as well as in VOC2010, where 41.7% accuracy on the test set is achieved."}],"month":"12","publication_status":"published","author":[{"full_name":"Ion, Adrian","id":"29F89302-F248-11E8-B48F-1D18A9856A87","last_name":"Ion","first_name":"Adrian"},{"full_name":"Carreira, Joao","last_name":"Carreira","first_name":"Joao"},{"last_name":"Sminchisescu","first_name":"Cristian","full_name":"Sminchisescu, Cristian"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:15Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"citation":{"ama":"Ion A, Carreira J, Sminchisescu C. Probabilistic joint image segmentation and labeling. In: <i>NIPS Proceedings</i>. Vol 24. Neural Information Processing Systems Foundation; 2011:1827-1835.","ista":"Ion A, Carreira J, Sminchisescu C. 2011. Probabilistic joint image segmentation and labeling. NIPS Proceedings. NIPS: Neural Information Processing Systems vol. 24, 1827–1835.","chicago":"Ion, Adrian, Joao Carreira, and Cristian Sminchisescu. “Probabilistic Joint Image Segmentation and Labeling.” In <i>NIPS Proceedings</i>, 24:1827–35. Neural Information Processing Systems Foundation, 2011.","apa":"Ion, A., Carreira, J., &#38; Sminchisescu, C. (2011). Probabilistic joint image segmentation and labeling. In <i>NIPS Proceedings</i> (Vol. 24, pp. 1827–1835). Granada, Spain: Neural Information Processing Systems Foundation.","ieee":"A. Ion, J. Carreira, and C. Sminchisescu, “Probabilistic joint image segmentation and labeling,” in <i>NIPS Proceedings</i>, Granada, Spain, 2011, vol. 24, pp. 1827–1835.","short":"A. Ion, J. Carreira, C. Sminchisescu, in:, NIPS Proceedings, Neural Information Processing Systems Foundation, 2011, pp. 1827–1835.","mla":"Ion, Adrian, et al. “Probabilistic Joint Image Segmentation and Labeling.” <i>NIPS Proceedings</i>, vol. 24, Neural Information Processing Systems Foundation, 2011, pp. 1827–35."},"oa_version":"None","intvolume":"        24","publist_id":"3381","conference":{"end_date":"2011-12-14","start_date":"2011-12-12","name":"NIPS: Neural Information Processing Systems","location":"Granada, Spain"},"publication":"NIPS Proceedings","scopus_import":1,"day":"01","page":"1827 - 1835","status":"public","year":"2011","date_created":"2018-12-11T12:02:21Z","_id":"3266","type":"conference"},{"publication_status":"published","month":"01","abstract":[{"text":"We address the problem of localizing homology classes, namely, finding the cycle representing a given class with the most concise geometric measure. We study the problem with different measures: volume, diameter and radius. For volume, that is, the 1-norm of a cycle, two main results are presented. First, we prove that the problem is NP-hard to approximate within any constant factor. Second, we prove that for homology of dimension two or higher, the problem is NP-hard to approximate even when the Betti number is O(1). The latter result leads to the inapproximability of the problem of computing the nonbounding cycle with the smallest volume and computing cycles representing a homology basis with the minimal total volume. As for the other two measures defined by pairwise geodesic distance, diameter and radius, we show that the localization problem is NP-hard for diameter but is polynomial for radius. Our work is restricted to homology over the ℤ2 field.","lang":"eng"}],"issue":"3","publisher":"Springer","date_published":"2011-01-14T00:00:00Z","language":[{"iso":"eng"}],"volume":45,"title":"Hardness results for homology localization","department":[{"_id":"HeEd"}],"quality_controlled":"1","date_updated":"2023-02-21T16:07:10Z","citation":{"ieee":"C. Chen and D. Freedman, “Hardness results for homology localization,” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 3. Springer, pp. 425–448, 2011.","ista":"Chen C, Freedman D. 2011. Hardness results for homology localization. Discrete &#38; Computational Geometry. 45(3), 425–448.","chicago":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00454-010-9322-8\">https://doi.org/10.1007/s00454-010-9322-8</a>.","ama":"Chen C, Freedman D. Hardness results for homology localization. <i>Discrete &#38; Computational Geometry</i>. 2011;45(3):425-448. doi:<a href=\"https://doi.org/10.1007/s00454-010-9322-8\">10.1007/s00454-010-9322-8</a>","apa":"Chen, C., &#38; Freedman, D. (2011). Hardness results for homology localization. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-010-9322-8\">https://doi.org/10.1007/s00454-010-9322-8</a>","short":"C. Chen, D. Freedman, Discrete &#38; Computational Geometry 45 (2011) 425–448.","mla":"Chen, Chao, and Daniel Freedman. “Hardness Results for Homology Localization.” <i>Discrete &#38; Computational Geometry</i>, vol. 45, no. 3, Springer, 2011, pp. 425–48, doi:<a href=\"https://doi.org/10.1007/s00454-010-9322-8\">10.1007/s00454-010-9322-8</a>."},"oa_version":"None","author":[{"first_name":"Chao","last_name":"Chen","full_name":"Chen, Chao","id":"3E92416E-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Daniel","last_name":"Freedman","full_name":"Freedman, Daniel"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","scopus_import":1,"related_material":{"record":[{"status":"public","id":"10909","relation":"earlier_version"}]},"publist_id":"3379","intvolume":"        45","publication":"Discrete & Computational Geometry","date_created":"2018-12-11T12:02:21Z","type":"journal_article","_id":"3267","doi":"10.1007/s00454-010-9322-8","page":"425 - 448","year":"2011","status":"public","day":"14"},{"language":[{"iso":"eng"}],"volume":30,"article_processing_charge":"No","month":"07","issue":"4","author":[{"last_name":"Sheng","first_name":"Yu","full_name":"Sheng, Yu"},{"first_name":"Barbara","last_name":"Cutler","full_name":"Cutler, Barbara"},{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao"},{"full_name":"Nasman, Joshua","last_name":"Nasman","first_name":"Joshua"}],"quality_controlled":"1","oa_version":"Published Version","status":"public","main_file_link":[{"url":"http://www.cs.cmu.edu/%7Eshengyu/download/egsr2011_paper.pdf","open_access":"1"}],"date_created":"2018-12-11T12:02:22Z","article_type":"original","_id":"3269","type":"journal_article","date_published":"2011-07-19T00:00:00Z","publisher":"Wiley-Blackwell","title":"Perceptual global illumination cancellation in complex projection environments","publication_status":"published","abstract":[{"lang":"eng","text":"The unintentional scattering of light between neighboring surfaces in complex projection environments increases the brightness and decreases the contrast, disrupting the appearance of the desired imagery. To achieve satisfactory projection results, the inverse problem of global illumination must be solved to cancel this secondary scattering. In this paper, we propose a global illumination cancellation method that minimizes the perceptual difference between the desired imagery and the actual total illumination in the resulting physical environment. Using Gauss-Newton and active set methods, we design a fast solver for the bound constrained nonlinear least squares problem raised by the perceptual error metrics. Our solver is further accelerated with a CUDA implementation and multi-resolution method to achieve 1–2 fps for problems with approximately 3000 variables. We demonstrate the global illumination cancellation algorithm with our multi-projector system. Results show that our method preserves the color fidelity of the desired imagery significantly better than previous methods."}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:42:16Z","citation":{"ista":"Sheng Y, Cutler B, Chen C, Nasman J. 2011. Perceptual global illumination cancellation in complex projection environments. Computer Graphics Forum. 30(4), 1261–1268.","chicago":"Sheng, Yu, Barbara Cutler, Chao Chen, and Joshua Nasman. “Perceptual Global Illumination Cancellation in Complex Projection Environments.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">https://doi.org/10.1111/j.1467-8659.2011.01985.x</a>.","ama":"Sheng Y, Cutler B, Chen C, Nasman J. Perceptual global illumination cancellation in complex projection environments. <i>Computer Graphics Forum</i>. 2011;30(4):1261-1268. doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">10.1111/j.1467-8659.2011.01985.x</a>","apa":"Sheng, Y., Cutler, B., Chen, C., &#38; Nasman, J. (2011). Perceptual global illumination cancellation in complex projection environments. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">https://doi.org/10.1111/j.1467-8659.2011.01985.x</a>","ieee":"Y. Sheng, B. Cutler, C. Chen, and J. Nasman, “Perceptual global illumination cancellation in complex projection environments,” <i>Computer Graphics Forum</i>, vol. 30, no. 4. Wiley-Blackwell, pp. 1261–1268, 2011.","short":"Y. Sheng, B. Cutler, C. Chen, J. Nasman, Computer Graphics Forum 30 (2011) 1261–1268.","mla":"Sheng, Yu, et al. “Perceptual Global Illumination Cancellation in Complex Projection Environments.” <i>Computer Graphics Forum</i>, vol. 30, no. 4, Wiley-Blackwell, 2011, pp. 1261–68, doi:<a href=\"https://doi.org/10.1111/j.1467-8659.2011.01985.x\">10.1111/j.1467-8659.2011.01985.x</a>."},"publist_id":"3377","intvolume":"        30","publication":"Computer Graphics Forum","scopus_import":1,"year":"2011","day":"19","doi":"10.1111/j.1467-8659.2011.01985.x","page":"1261 - 1268","oa":1},{"department":[{"_id":"HeEd"}],"quality_controlled":"1","date_updated":"2021-01-12T07:42:17Z","citation":{"ama":"Chen C, Kerber M. Persistent homology computation with a twist. In: TU Dortmund; 2011:197-200.","ista":"Chen C, Kerber M. 2011. Persistent homology computation with a twist. EuroCG: European Workshop on Computational Geometry, 197–200.","chicago":"Chen, Chao, and Michael Kerber. “Persistent Homology Computation with a Twist,” 197–200. TU Dortmund, 2011.","apa":"Chen, C., &#38; Kerber, M. (2011). Persistent homology computation with a twist (pp. 197–200). Presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland: TU Dortmund.","ieee":"C. Chen and M. Kerber, “Persistent homology computation with a twist,” presented at the EuroCG: European Workshop on Computational Geometry, Morschach, Switzerland, 2011, pp. 197–200.","mla":"Chen, Chao, and Michael Kerber. <i>Persistent Homology Computation with a Twist</i>. TU Dortmund, 2011, pp. 197–200.","short":"C. Chen, M. Kerber, in:, TU Dortmund, 2011, pp. 197–200."},"oa_version":"None","author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","last_name":"Chen","first_name":"Chao"},{"orcid":"0000-0002-8030-9299","last_name":"Kerber","first_name":"Michael","full_name":"Kerber, Michael","id":"36E4574A-F248-11E8-B48F-1D18A9856A87"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","month":"01","publication_status":"published","abstract":[{"text":"The persistence diagram of a filtered simplicial com- plex is usually computed by reducing the boundary matrix of the complex. We introduce a simple op- timization technique: by processing the simplices of the complex in decreasing dimension, we can “kill” columns (i.e., set them to zero) without reducing them. This technique completely avoids reduction on roughly half of the columns. We demonstrate that this idea significantly improves the running time of the reduction algorithm in practice. We also give an output-sensitive complexity analysis for the new al- gorithm which yields to sub-cubic asymptotic bounds under certain assumptions.","lang":"eng"}],"publisher":"TU Dortmund","date_published":"2011-01-01T00:00:00Z","language":[{"iso":"eng"}],"title":"Persistent homology computation with a twist","date_created":"2018-12-11T12:02:22Z","_id":"3270","type":"conference","year":"2011","status":"public","day":"01","page":"197 - 200","publist_id":"3376","conference":{"location":"Morschach, Switzerland","name":"EuroCG: European Workshop on Computational Geometry","end_date":"2011-03-30","start_date":"2011-03-28"}},{"language":[{"iso":"eng"}],"publisher":"Springer","date_published":"2011-11-14T00:00:00Z","title":"Efficient computation of persistent homology for cubical data","publication_status":"published","month":"11","abstract":[{"lang":"eng","text":"In this paper we present an efficient framework for computation of persis- tent homology of cubical data in arbitrary dimensions. An existing algorithm using simplicial complexes is adapted to the setting of cubical complexes. The proposed approach enables efficient application of persistent homology in domains where the data is naturally given in a cubical form. By avoiding triangulation of the data, we significantly reduce the size of the complex. We also present a data-structure de- signed to compactly store and quickly manipulate cubical complexes. By means of numerical experiments, we show high speed and memory efficiency of our ap- proach. We compare our framework to other available implementations, showing its superiority. Finally, we report performance on selected 3D and 4D data-sets."}],"author":[{"last_name":"Wagner","first_name":"Hubert","full_name":"Wagner, Hubert"},{"first_name":"Chao","last_name":"Chen","id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao"},{"first_name":"Erald","last_name":"Vuçini","full_name":"Vuçini, Erald"}],"alternative_title":["Theory, Algorithms, and Applications"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","quality_controlled":"1","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:42:18Z","citation":{"apa":"Wagner, H., Chen, C., &#38; Vuçini, E. (2011). Efficient computation of persistent homology for cubical data. In R. Peikert, H. Hauser, H. Carr, &#38; R. Fuchs (Eds.), <i>Topological Methods in Data Analysis and Visualization II</i> (pp. 91–106). Springer. <a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">https://doi.org/10.1007/978-3-642-23175-9_7</a>","ista":"Wagner H, Chen C, Vuçini E. 2011.Efficient computation of persistent homology for cubical data. In: Topological Methods in Data Analysis and Visualization II. Theory, Algorithms, and Applications, , 91–106.","ama":"Wagner H, Chen C, Vuçini E. Efficient computation of persistent homology for cubical data. In: Peikert R, Hauser H, Carr H, Fuchs R, eds. <i>Topological Methods in Data Analysis and Visualization II</i>. Springer; 2011:91-106. doi:<a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">10.1007/978-3-642-23175-9_7</a>","chicago":"Wagner, Hubert, Chao Chen, and Erald Vuçini. “Efficient Computation of Persistent Homology for Cubical Data.” In <i>Topological Methods in Data Analysis and Visualization II</i>, edited by Ronald Peikert, Helwig Hauser, Hamish Carr, and Raphael Fuchs, 91–106. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">https://doi.org/10.1007/978-3-642-23175-9_7</a>.","ieee":"H. Wagner, C. Chen, and E. Vuçini, “Efficient computation of persistent homology for cubical data,” in <i>Topological Methods in Data Analysis and Visualization II</i>, R. Peikert, H. Hauser, H. Carr, and R. Fuchs, Eds. Springer, 2011, pp. 91–106.","mla":"Wagner, Hubert, et al. “Efficient Computation of Persistent Homology for Cubical Data.” <i>Topological Methods in Data Analysis and Visualization II</i>, edited by Ronald Peikert et al., Springer, 2011, pp. 91–106, doi:<a href=\"https://doi.org/10.1007/978-3-642-23175-9_7\">10.1007/978-3-642-23175-9_7</a>.","short":"H. Wagner, C. Chen, E. Vuçini, in:, R. Peikert, H. Hauser, H. Carr, R. Fuchs (Eds.), Topological Methods in Data Analysis and Visualization II, Springer, 2011, pp. 91–106."},"oa_version":"None","publist_id":"3375","publication":"Topological Methods in Data Analysis and Visualization II","scopus_import":1,"editor":[{"full_name":"Peikert, Ronald","first_name":"Ronald","last_name":"Peikert"},{"first_name":"Helwig","last_name":"Hauser","full_name":"Hauser, Helwig"},{"full_name":"Carr, Hamish","first_name":"Hamish","last_name":"Carr"},{"last_name":"Fuchs","first_name":"Raphael","full_name":"Fuchs, Raphael"}],"status":"public","year":"2011","page":"91 - 106","day":"14","doi":"10.1007/978-3-642-23175-9_7","date_created":"2018-12-11T12:02:23Z","_id":"3271","type":"book_chapter"},{"date_published":"2011-12-12T00:00:00Z","publisher":"Institute of Science and Technology Austria","language":[{"iso":"eng"}],"title":"Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors","article_processing_charge":"No","publication_status":"published","month":"12","author":[{"id":"48F1E0D8-F248-11E8-B48F-1D18A9856A87","full_name":"Maître, Jean-Léon","last_name":"Maître","first_name":"Jean-Léon","orcid":"0000-0002-3688-1474"}],"degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"CaHe"}],"date_updated":"2023-09-07T11:30:16Z","oa_version":"None","citation":{"ista":"Maître J-L. 2011. Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors. Institute of Science and Technology Austria.","ama":"Maître J-L. Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors. 2011.","chicago":"Maître, Jean-Léon. “Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors.” Institute of Science and Technology Austria, 2011.","apa":"Maître, J.-L. (2011). <i>Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors</i>. Institute of Science and Technology Austria.","ieee":"J.-L. Maître, “Mechanics of adhesion and de‐adhesion in zebrafish germ layer progenitors,” Institute of Science and Technology Austria, 2011.","mla":"Maître, Jean-Léon. <i>Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors</i>. Institute of Science and Technology Austria, 2011.","short":"J.-L. Maître, Mechanics of Adhesion and De‐adhesion in Zebrafish Germ Layer Progenitors, Institute of Science and Technology Austria, 2011."},"publist_id":"3373","supervisor":[{"orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg","full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"day":"12","status":"public","year":"2011","publication_identifier":{"issn":["2663-337X"]},"date_created":"2018-12-11T12:02:23Z","type":"dissertation","_id":"3273"},{"oa_version":"Published Version","author":[{"id":"F44D762E-4F9D-11E9-B64C-9EB26CEFFB5F","full_name":"Schumann, Kathrin","first_name":"Kathrin","last_name":"Schumann"}],"month":"03","has_accepted_license":"1","file":[{"file_name":"2011_Thesis_Kathrin_Schumann.pdf","content_type":"application/pdf","date_created":"2019-03-26T08:12:21Z","date_updated":"2020-07-14T12:46:06Z","file_id":"6177","checksum":"e69eee6252660f0b694a2ea8923ddc72","creator":"dernst","access_level":"closed","file_size":4487708,"relation":"main_file"},{"file_name":"2011_Thesis_Schumann_noS.pdf","date_updated":"2021-02-22T11:24:30Z","date_created":"2021-02-22T11:24:30Z","content_type":"application/pdf","file_size":4313127,"access_level":"open_access","creator":"dernst","checksum":"71727d63f424b5b446f68f4b87ecadc0","file_id":"9175","success":1,"relation":"main_file"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","date_created":"2018-12-11T12:02:24Z","type":"dissertation","_id":"3275","status":"public","publication_identifier":{"issn":["2663-337X"]},"pubrep_id":"11","department":[{"_id":"MiSi"}],"date_updated":"2023-09-07T11:31:48Z","citation":{"short":"K. Schumann, The Role of Chemotactic Gradients in Dendritic Cell Migration, Institute of Science and Technology Austria, 2011.","mla":"Schumann, Kathrin. <i>The Role of Chemotactic Gradients in Dendritic Cell Migration</i>. Institute of Science and Technology Austria, 2011.","ieee":"K. Schumann, “The role of chemotactic gradients in dendritic cell migration,” Institute of Science and Technology Austria, 2011.","chicago":"Schumann, Kathrin. “The Role of Chemotactic Gradients in Dendritic Cell Migration.” Institute of Science and Technology Austria, 2011.","ista":"Schumann K. 2011. The role of chemotactic gradients in dendritic cell migration. Institute of Science and Technology Austria.","ama":"Schumann K. The role of chemotactic gradients in dendritic cell migration. 2011.","apa":"Schumann, K. (2011). <i>The role of chemotactic gradients in dendritic cell migration</i>. Institute of Science and Technology Austria."},"degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publication_status":"published","abstract":[{"lang":"eng","text":"Chemokines organize immune cell trafficking by inducing either directed (tactic) or random (kinetic) migration and by activating integrins in order to support surface adhesion (haptic). Beyond that the same chemokines can establish clearly defined functional areas in secondary lymphoid organs. Until now it is unclear how chemokines can fulfill such diverse functions. One decisive prerequisite to explain these capacities is to know how chemokines are presented in tissue. In theory chemokines could occur either soluble or immobilized, and could be distributed either homogenously or as a concentration gradient. To dissect if and how the presenting mode of chemokines influences immune cells, I tested the response of dendritic cells (DCs) to differentially displayed chemokines. DCs are antigen presenting cells that reside in the periphery and migrate into draining lymph nodes (LNs) once exposed to inflammatory stimuli to activate naïve T cells. DCs are guided to and within the LN by the chemokine receptor CCR7, which has two ligands, the chemokines CCL19 and CCL21. Both CCR7 ligands are expressed by fibroblastic reticular cells in the LN, but differ in their ability to bind to heparan sulfate residues. CCL21 has a highly charged C-terminal extension, which mediates binding to anionic surfaces, whereas CCL19 is lacking such residues and likely distributes as a soluble molecule. This study shows that surface-bound CCL21 causes random, haptokinetic DC motility, which is confined to the chemokine coated area by insideout activation of β2 integrins that mediate cell binding to the surface. CCL19 on the other hand forms concentration gradients which trigger directional, chemotactic movement, but no surface adhesion. In addition DCs can actively manipulate this system by recruiting and activating serine proteases on their surfaces, which create - by proteolytically removing the adhesive C-terminus - a solubilized variant of CCL21 that functionally resembles CCL19. By generating a CCL21 concentration gradient DCs establish a positive feedback loop to recruit further DCs from the periphery to the CCL21 coated region. In addition DCs can sense chemotactic gradients as well as immobilized haptokinetic fields at the same time and integrate these signals. The result is chemotactically biased haptokinesis - directional migration confined to a chemokine coated track or area - which could explain the dynamic but spatially tightly controlled swarming leukocyte locomotion patterns that have been observed in lymphatic organs by intravital microscopists. The finding that DCs can approach soluble cues in a non-adhesive manner while they attach to surfaces coated with immobilized cues raises the question how these cells transmit intracellular forces to the environment, especially in the non-adherent migration mode. In order to migrate, cells have to generate and transmit force to the extracellular substrate. Force transmission is the prerequisite to procure an expansion of the leading edge and a forward motion of the whole cell body. In the current conceptions actin polymerization at the leading edge is coupled to extracellular ligands via the integrin family of transmembrane receptors, which allows the transmission of intracellular force. Against the paradigm of force transmission during migration, leukocytes, like DCs, are able to migrate in threedimensional environments without using integrin transmembrane receptors (Lämmermann et al., 2008). This reflects the biological function of leukocytes, as they can invade almost all tissues, whereby their migration has to be independent from the extracellular environment. How the cells can achieve this is unclear. For this study I examined DC migration in a defined threedimensional environment and highlighted actin-dynamics with the probe Lifeact-GFP. The result was that chemotactic DCs can switch between integrin-dependent and integrin- independent locomotion and can thereby adapt to the adhesive properties of their environment. If the cells are able to couple their actin cytoskeleton to the substrate, actin polymerization is entirely converted into protrusion. Without coupling the actin cortex undergoes slippage and retrograde actin flow can be observed. But retrograde actin flow can be completely compensated by higher actin polymerization rate keeping the migration velocity and the shape of the cells unaltered. Mesenchymal cells like fibroblast cannot balance the loss of adhesive interaction, cannot protrude into open space and, therefore, strictly depend on integrinmediated force coupling. This leukocyte specific phenomenon of “adaptive force transmission” endows these cells with the unique ability to transit and invade almost every type of tissue. "}],"ddc":["570","579"],"file_date_updated":"2021-02-22T11:24:30Z","publisher":"Institute of Science and Technology Austria","date_published":"2011-03-01T00:00:00Z","title":"The role of chemotactic gradients in dendritic cell migration","oa":1,"acknowledgement":"I would like to express my sincere gratitude to the following people who made with their continuous support and encouragement this thesis possible: First, I want to thank Prof. Dr. Michael Sixt for his excellent supervision and mentoring, especially for the nice, relaxed working atmosphere, a lot of brilliant ideas and the freedom to work in my own way.\r\n\r\nProf. Dr. Reinhard Fässler for his constant support of the Sixt lab and for providing excellent working conditions. \r\n\r\nProf. Dr. Sanjiv Luther and Prof. Dr. Tobias Bollenbach for agreeing to be member of my thesis committee and to evaluate my work.\r\n\r\nDr. Walther Göhring, Carmen Schmitz, the Recombinant Protein Production core facility and the animal care takers for providing the “infrastructure” for this thesis. \r\n\r\nProf. Dr. Daniel Legler, Markus Bruckner and Dr. Julien Polleux for very fruitful collaborations and discussions.\r\n\r\nMy labmates for their help, a lot of discussions and to make the Sixt lab to a convenient place to work : Karin Hirsch, Tim Lämmeramnn, Holger Pflicke, Jörg Renkawitz, Michele Weber and Alexander Eichner All members of the Department of Molecular Medicine for their help. Especially I want to thank Sarah Schmidt, Karin Hirsch and Raphael Ruppert for their friendship, nice chats and their uncensored point of view. ","year":"2011","day":"01","page":"141","supervisor":[{"last_name":"Sixt","first_name":"Michael K","orcid":"0000-0002-6620-9179","id":"41E9FBEA-F248-11E8-B48F-1D18A9856A87","full_name":"Sixt, Michael K"}],"publist_id":"3371"},{"doi":"10.2174/138920311798841753","page":"714 - 724","status":"public","year":"2011","day":"01","type":"journal_article","_id":"3287","date_created":"2018-12-11T12:02:28Z","publication":"Current Protein & Peptide Science","publist_id":"3358","intvolume":"        12","scopus_import":1,"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Ruprecht, Verena","id":"4D71A03A-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4088-8633","last_name":"Ruprecht","first_name":"Verena"},{"full_name":"Axmann, Markus","first_name":"Markus","last_name":"Axmann"},{"orcid":"0000-0002-2670-2217","last_name":"Wieser","first_name":"Stefan","full_name":"Wieser, Stefan","id":"355AA5A0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Schuetz, Gerhard","first_name":"Gerhard","last_name":"Schuetz"}],"citation":{"mla":"Ruprecht, Verena, et al. “What Can We Learn from Single Molecule Trajectories?” <i>Current Protein &#38; Peptide Science</i>, vol. 12, no. 8, Bentham Science Publishers, 2011, pp. 714–24, doi:<a href=\"https://doi.org/10.2174/138920311798841753\">10.2174/138920311798841753</a>.","short":"V. Ruprecht, M. Axmann, S. Wieser, G. Schuetz, Current Protein &#38; Peptide Science 12 (2011) 714–724.","ieee":"V. Ruprecht, M. Axmann, S. Wieser, and G. Schuetz, “What can we learn from single molecule trajectories?,” <i>Current Protein &#38; Peptide Science</i>, vol. 12, no. 8. Bentham Science Publishers, pp. 714–724, 2011.","apa":"Ruprecht, V., Axmann, M., Wieser, S., &#38; Schuetz, G. (2011). What can we learn from single molecule trajectories? <i>Current Protein &#38; Peptide Science</i>. Bentham Science Publishers. <a href=\"https://doi.org/10.2174/138920311798841753\">https://doi.org/10.2174/138920311798841753</a>","ama":"Ruprecht V, Axmann M, Wieser S, Schuetz G. What can we learn from single molecule trajectories? <i>Current Protein &#38; Peptide Science</i>. 2011;12(8):714-724. doi:<a href=\"https://doi.org/10.2174/138920311798841753\">10.2174/138920311798841753</a>","chicago":"Ruprecht, Verena, Markus Axmann, Stefan Wieser, and Gerhard Schuetz. “What Can We Learn from Single Molecule Trajectories?” <i>Current Protein &#38; Peptide Science</i>. Bentham Science Publishers, 2011. <a href=\"https://doi.org/10.2174/138920311798841753\">https://doi.org/10.2174/138920311798841753</a>.","ista":"Ruprecht V, Axmann M, Wieser S, Schuetz G. 2011. What can we learn from single molecule trajectories? Current Protein &#38; Peptide Science. 12(8), 714–724."},"oa_version":"None","department":[{"_id":"CaHe"},{"_id":"MiSi"}],"quality_controlled":"1","date_updated":"2021-01-12T07:42:24Z","volume":12,"title":"What can we learn from single molecule trajectories?","date_published":"2011-12-01T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Bentham Science Publishers","issue":"8","publication_status":"published","month":"12","abstract":[{"lang":"eng","text":"Diffusing membrane constituents are constantly exposed to a variety of forces that influence their stochastic path. Single molecule experiments allow for resolving trajectories at extremely high spatial and temporal accuracy, thereby offering insights into en route interactions of the tracer. In this review we discuss approaches to derive information about the underlying processes, based on single molecule tracking experiments. In particular, we focus on a new versatile way to analyze single molecule diffusion in the absence of a full analytical treatment. The method is based on comprehensive comparison of an experimental data set against the hypothetical outcome of multiple experiments performed on the computer. Since Monte Carlo simulations can be easily and rapidly performed even on state-of-the-art PCs, our method provides a simple way for testing various - even complicated - diffusion models. We describe the new method in detail, and show the applicability on two specific examples: firstly, kinetic rate constants can be derived for the transient interaction of mobile membrane proteins; secondly, residence time and corral size can be extracted for confined diffusion."}]},{"publication":"PLoS One","publist_id":"3357","intvolume":"         6","doi":"10.1371/journal.pone.0022458","year":"2011","day":"22","acknowledgement":"his work was funded by the National Health and Medical Research Council (NHMRC) of Australia. M.S. was an Erwin Schroedinger postdoctoral fellow of the Austrian Science Fund (FWF), S.K.W. is supported by a UQ International Research Tuition Award and Research Scholarship, S.M .by an ANZ Trustees PhD Scholarship. A.S.Y. is a Research Fellow of the NHMRC. Confocal imaging was performed at the Australian Cancer Research Foundation (ACRF) Cancer Biology Imaging Centre at the Institute for Molecular Bioscience, established with the generous support of the ACRF.","oa":1,"title":"Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens","file_date_updated":"2020-07-14T12:46:06Z","publisher":"Public Library of Science","date_published":"2011-07-22T00:00:00Z","ddc":["570"],"publication_status":"published","abstract":[{"text":"The zonula adherens (ZA) of epithelial cells is a site of cell-cell adhesion where cellular forces are exerted and resisted. Increasing evidence indicates that E-cadherin adhesion molecules at the ZA serve to sense force applied on the junctions and coordinate cytoskeletal responses to those forces. Efforts to understand the role that cadherins play in mechanotransduction have been limited by the lack of assays to measure the impact of forces on the ZA. In this study we used 4D imaging of GFP-tagged E-cadherin to analyse the movement of the ZA. Junctions in confluent epithelial monolayers displayed prominent movements oriented orthogonal (perpendicular) to the ZA itself. Two components were identified in these movements: a relatively slow unidirectional (translational) component that could be readily fitted by least-squares regression analysis, upon which were superimposed more rapid oscillatory movements. Myosin IIB was a dominant factor responsible for driving the unilateral translational movements. In contrast, frequency spectrum analysis revealed that depletion of Myosin IIA increased the power of the oscillatory movements. This implies that Myosin IIA may serve to dampen oscillatory movements of the ZA. This extends our recent analysis of Myosin II at the ZA to demonstrate that Myosin IIA and Myosin IIB make distinct contributions to junctional movement at the ZA.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)"},"citation":{"short":"M. Smutny, S. Wu, G. Gomez, S. Mangold, A. Yap, N. Hamilton, PLoS One 6 (2011).","mla":"Smutny, Michael, et al. “Multicomponent Analysis of Junctional Movements Regulated by Myosin II Isoforms at the Epithelial Zonula Adherens.” <i>PLoS One</i>, vol. 6, no. 7, Public Library of Science, 2011, doi:<a href=\"https://doi.org/10.1371/journal.pone.0022458\">10.1371/journal.pone.0022458</a>.","ama":"Smutny M, Wu S, Gomez G, Mangold S, Yap A, Hamilton N. Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens. <i>PLoS One</i>. 2011;6(7). doi:<a href=\"https://doi.org/10.1371/journal.pone.0022458\">10.1371/journal.pone.0022458</a>","ista":"Smutny M, Wu S, Gomez G, Mangold S, Yap A, Hamilton N. 2011. Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens. PLoS One. 6(7).","chicago":"Smutny, Michael, Selwin Wu, Guillermo Gomez, Sabine Mangold, Alpha Yap, and Nicholas Hamilton. “Multicomponent Analysis of Junctional Movements Regulated by Myosin II Isoforms at the Epithelial Zonula Adherens.” <i>PLoS One</i>. Public Library of Science, 2011. <a href=\"https://doi.org/10.1371/journal.pone.0022458\">https://doi.org/10.1371/journal.pone.0022458</a>.","apa":"Smutny, M., Wu, S., Gomez, G., Mangold, S., Yap, A., &#38; Hamilton, N. (2011). Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens. <i>PLoS One</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pone.0022458\">https://doi.org/10.1371/journal.pone.0022458</a>","ieee":"M. Smutny, S. Wu, G. Gomez, S. Mangold, A. Yap, and N. Hamilton, “Multicomponent analysis of junctional movements regulated by Myosin II isoforms at the epithelial zonula adherens,” <i>PLoS One</i>, vol. 6, no. 7. Public Library of Science, 2011."},"department":[{"_id":"CaHe"}],"date_updated":"2021-01-12T07:42:25Z","status":"public","type":"journal_article","_id":"3288","date_created":"2018-12-11T12:02:28Z","volume":6,"language":[{"iso":"eng"}],"file":[{"file_name":"2011_PLOS_Smutny.PDF","content_type":"application/pdf","date_created":"2019-05-10T10:51:43Z","date_updated":"2020-07-14T12:46:06Z","file_id":"6399","checksum":"57a5eb11dd05241c48c44f492b3ec3ac","creator":"dernst","access_level":"open_access","file_size":1984567,"relation":"main_file"}],"issue":"7","month":"07","has_accepted_license":"1","author":[{"last_name":"Smutny","first_name":"Michael","orcid":"0000-0002-5920-9090","id":"3FE6E4E8-F248-11E8-B48F-1D18A9856A87","full_name":"Smutny, Michael"},{"full_name":"Wu, Selwin","last_name":"Wu","first_name":"Selwin"},{"full_name":"Gomez, Guillermo","last_name":"Gomez","first_name":"Guillermo"},{"full_name":"Mangold, Sabine","first_name":"Sabine","last_name":"Mangold"},{"last_name":"Yap","first_name":"Alpha","full_name":"Yap, Alpha"},{"last_name":"Hamilton","first_name":"Nicholas","full_name":"Hamilton, Nicholas"}],"oa_version":"Published Version","quality_controlled":"1"},{"language":[{"iso":"eng"}],"volume":189,"month":"11","issue":"3","author":[{"first_name":"Konrad","last_name":"Lohse","full_name":"Lohse, Konrad"},{"first_name":"Richard","last_name":"Harrison","full_name":"Harrison, Richard"},{"first_name":"Nicholas H","last_name":"Barton","orcid":"0000-0002-8548-5240","id":"4880FE40-F248-11E8-B48F-1D18A9856A87","full_name":"Barton, Nicholas H"}],"quality_controlled":"1","project":[{"name":"Limits to selection in biology and in evolutionary computation","grant_number":"250152","_id":"25B07788-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"oa_version":"Submitted Version","ec_funded":1,"status":"public","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3213358/","open_access":"1"}],"date_created":"2018-12-11T12:02:29Z","_id":"3290","type":"journal_article","date_published":"2011-11-01T00:00:00Z","publisher":"Genetics Society of America","title":"A general method for calculating likelihoods under the coalescent process","abstract":[{"text":"Analysis of genomic data requires an efficient way to calculate likelihoods across very large numbers of loci. We describe a general method for finding the distribution of genealogies: we allow migration between demes, splitting of demes [as in the isolation-with-migration (IM) model], and recombination between linked loci. These processes are described by a set of linear recursions for the generating function of branch lengths. Under the infinite-sites model, the probability of any configuration of mutations can be found by differentiating this generating function. Such calculations are feasible for small numbers of sampled genomes: as an example, we show how the generating function can be derived explicitly for three genes under the two-deme IM model. This derivation is done automatically, using Mathematica. Given data from a large number of unlinked and nonrecombining blocks of sequence, these results can be used to find maximum-likelihood estimates of model parameters by tabulating the probabilities of all relevant mutational configurations and then multiplying across loci. The feasibility of the method is demonstrated by applying it to simulated data and to a data set previously analyzed by Wang and Hey (2010) consisting of 26,141 loci sampled from Drosophila simulans and D. melanogaster. Our results suggest that such likelihood calculations are scalable to genomic data as long as the numbers of sampled individuals and mutations per sequence block are small.","lang":"eng"}],"publication_status":"published","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","date_updated":"2021-01-12T07:42:26Z","department":[{"_id":"NiBa"}],"citation":{"mla":"Lohse, Konrad, et al. “A General Method for Calculating Likelihoods under the Coalescent Process.” <i>Genetics</i>, vol. 189, no. 3, Genetics Society of America, 2011, pp. 977–87, doi:<a href=\"https://doi.org/10.1534/genetics.111.129569\">10.1534/genetics.111.129569</a>.","short":"K. Lohse, R. Harrison, N.H. Barton, Genetics 189 (2011) 977–987.","ista":"Lohse K, Harrison R, Barton NH. 2011. A general method for calculating likelihoods under the coalescent process. Genetics. 189(3), 977–987.","chicago":"Lohse, Konrad, Richard Harrison, and Nicholas H Barton. “A General Method for Calculating Likelihoods under the Coalescent Process.” <i>Genetics</i>. Genetics Society of America, 2011. <a href=\"https://doi.org/10.1534/genetics.111.129569\">https://doi.org/10.1534/genetics.111.129569</a>.","ama":"Lohse K, Harrison R, Barton NH. A general method for calculating likelihoods under the coalescent process. <i>Genetics</i>. 2011;189(3):977-987. doi:<a href=\"https://doi.org/10.1534/genetics.111.129569\">10.1534/genetics.111.129569</a>","apa":"Lohse, K., Harrison, R., &#38; Barton, N. H. (2011). A general method for calculating likelihoods under the coalescent process. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.111.129569\">https://doi.org/10.1534/genetics.111.129569</a>","ieee":"K. Lohse, R. Harrison, and N. H. Barton, “A general method for calculating likelihoods under the coalescent process,” <i>Genetics</i>, vol. 189, no. 3. Genetics Society of America, pp. 977–987, 2011."},"intvolume":"       189","publist_id":"3355","publication":"Genetics","scopus_import":1,"page":"977 - 987","day":"01","year":"2011","doi":"10.1534/genetics.111.129569","oa":1},{"citation":{"ieee":"C. Wojtan, M. Müller Fischer, and T. Brochu, “Liquid simulation with mesh-based surface tracking,” presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada, 2011.","chicago":"Wojtan, Chris, Matthias Müller Fischer, and Tyson Brochu. “Liquid Simulation with Mesh-Based Surface Tracking.” ACM, 2011. <a href=\"https://doi.org/10.1145/2037636.2037644\">https://doi.org/10.1145/2037636.2037644</a>.","ista":"Wojtan C, Müller Fischer M, Brochu T. 2011. Liquid simulation with mesh-based surface tracking. SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, 8.","ama":"Wojtan C, Müller Fischer M, Brochu T. Liquid simulation with mesh-based surface tracking. In: ACM; 2011. doi:<a href=\"https://doi.org/10.1145/2037636.2037644\">10.1145/2037636.2037644</a>","apa":"Wojtan, C., Müller Fischer, M., &#38; Brochu, T. (2011). Liquid simulation with mesh-based surface tracking. Presented at the SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques, Vancouver, BC, Canada: ACM. <a href=\"https://doi.org/10.1145/2037636.2037644\">https://doi.org/10.1145/2037636.2037644</a>","mla":"Wojtan, Chris, et al. <i>Liquid Simulation with Mesh-Based Surface Tracking</i>. 8, ACM, 2011, doi:<a href=\"https://doi.org/10.1145/2037636.2037644\">10.1145/2037636.2037644</a>.","short":"C. Wojtan, M. Müller Fischer, T. Brochu, in:, ACM, 2011."},"date_updated":"2023-02-23T11:21:02Z","department":[{"_id":"ChWo"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"abstract":[{"lang":"eng","text":"Animating detailed liquid surfaces has always been a challenge for computer graphics researchers and visual effects artists. Over the past few years, researchers in this field have focused on mesh-based surface tracking to synthesize extremely detailed liquid surfaces as efficiently as possible. This course provides a solid understanding of the steps required to create a fluid simulator with a mesh-based liquid surface.\r\n\r\nThe course begins with an overview of several existing liquid-surface-tracking techniques and the pros and cons of each method. Then it explains how to embed a triangle mesh into a finite-difference-based fluid simulator and describes several methods for allowing the liquid surface to merge together or break apart. The final section showcases the benefits and further applications of a mesh-based liquid surface, highlighting state-of-the-art methods for tracking colors and textures, maintaining liquid volume, preserving small surface features, and simulating realistic surface-tension waves."}],"publication_status":"published","title":"Liquid simulation with mesh-based surface tracking","publisher":"ACM","file_date_updated":"2020-07-14T12:46:06Z","date_published":"2011-08-07T00:00:00Z","oa":1,"day":"07","doi":"10.1145/2037636.2037644","year":"2011","scopus_import":1,"publist_id":"3344","oa_version":"Published Version","quality_controlled":"1","author":[{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"},{"full_name":"Müller Fischer, Matthias","first_name":"Matthias","last_name":"Müller Fischer"},{"last_name":"Brochu","first_name":"Tyson","full_name":"Brochu, Tyson"}],"article_number":"8","file":[{"file_name":"IST-2016-599-v1+1_meshyFluidsCourseSIGGRAPH2011.pdf","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:13:34Z","content_type":"application/pdf","file_size":34672096,"access_level":"open_access","creator":"system","checksum":"8d508ad7c82f50978acbaa4170ee0a75","file_id":"5018","relation":"main_file"}],"month":"08","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"3297","type":"conference","date_created":"2018-12-11T12:02:31Z","status":"public","pubrep_id":"599","conference":{"location":"Vancouver, BC, Canada","name":"SIGGRAPH: Special Interest Group on Computer Graphics and Interactive Techniques","start_date":"2011-08-07","end_date":"2011-08-11"}},{"year":"2011","day":"05","doi":"10.1145/2019406.2019411","page":"33 - 42","oa":1,"publist_id":"3343","scopus_import":1,"editor":[{"first_name":"Stephen","last_name":"Spencer","full_name":"Spencer, Stephen"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Raveendran, Karthik, et al. <i>Hybrid Smoothed Particle Hydrodynamics</i>. Edited by Stephen Spencer, ACM, 2011, pp. 33–42, doi:<a href=\"https://doi.org/10.1145/2019406.2019411\">10.1145/2019406.2019411</a>.","short":"K. Raveendran, C. Wojtan, G. Turk, in:, S. Spencer (Ed.), ACM, 2011, pp. 33–42.","ieee":"K. Raveendran, C. Wojtan, and G. Turk, “Hybrid smoothed particle hydrodynamics,” presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada, 2011, pp. 33–42.","ama":"Raveendran K, Wojtan C, Turk G. Hybrid smoothed particle hydrodynamics. In: Spencer S, ed. ACM; 2011:33-42. doi:<a href=\"https://doi.org/10.1145/2019406.2019411\">10.1145/2019406.2019411</a>","ista":"Raveendran K, Wojtan C, Turk G. 2011. Hybrid smoothed particle hydrodynamics. SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, 33–42.","chicago":"Raveendran, Karthik, Chris Wojtan, and Greg Turk. “Hybrid Smoothed Particle Hydrodynamics.” edited by Stephen Spencer, 33–42. ACM, 2011. <a href=\"https://doi.org/10.1145/2019406.2019411\">https://doi.org/10.1145/2019406.2019411</a>.","apa":"Raveendran, K., Wojtan, C., &#38; Turk, G. (2011). Hybrid smoothed particle hydrodynamics. In S. Spencer (Ed.) (pp. 33–42). Presented at the SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation, Vancouver, Canada: ACM. <a href=\"https://doi.org/10.1145/2019406.2019411\">https://doi.org/10.1145/2019406.2019411</a>"},"date_updated":"2023-02-23T11:21:05Z","department":[{"_id":"ChWo"}],"title":"Hybrid smoothed particle hydrodynamics","file_date_updated":"2020-07-14T12:46:06Z","date_published":"2011-08-05T00:00:00Z","publisher":"ACM","ddc":["000"],"abstract":[{"lang":"eng","text":"We present a new algorithm for enforcing incompressibility for Smoothed Particle Hydrodynamics (SPH) by preserving uniform density across the domain. We propose a hybrid method that uses a Poisson solve on a coarse grid to enforce a divergence free velocity field, followed by a local density correction of the particles. This avoids typical grid artifacts and maintains the Lagrangian nature of SPH by directly transferring pressures onto particles. Our method can be easily integrated with existing SPH techniques such as the incompressible PCISPH method as well as weakly compressible SPH by adding an additional force term. We show that this hybrid method accelerates convergence towards uniform density and permits a significantly larger time step compared to earlier approaches while producing similar results. We demonstrate our approach in a variety of scenarios with significant pressure gradients such as splashing liquids."}],"publication_status":"published","status":"public","_id":"3298","type":"conference","date_created":"2018-12-11T12:02:32Z","conference":{"end_date":"2011-08-07","start_date":"2011-08-05","location":"Vancouver, Canada","name":"SCA: ACM SIGGRAPH/Eurographics Symposium on Computer animation"},"pubrep_id":"598","author":[{"full_name":"Raveendran, Karthik","first_name":"Karthik","last_name":"Raveendran"},{"last_name":"Wojtan","first_name":"Christopher J","orcid":"0000-0001-6646-5546","id":"3C61F1D2-F248-11E8-B48F-1D18A9856A87","full_name":"Wojtan, Christopher J"},{"full_name":"Turk, Greg","first_name":"Greg","last_name":"Turk"}],"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"relation":"main_file","creator":"system","checksum":"6579d27709946e0eefbfa60a456b4913","file_id":"4769","file_size":2536216,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:09:44Z","file_name":"IST-2016-598-v1+1_HybridSPH_Preprint.pdf"}],"has_accepted_license":"1","month":"08"},{"publist_id":"3341","scopus_import":1,"day":"21","year":"2011","doi":"10.1145/2037509.2037510","page":"1 - 3","oa":1,"title":"Propagation models for computing biochemical reaction networks","file_date_updated":"2020-07-14T12:46:06Z","publisher":"Springer","date_published":"2011-09-21T00:00:00Z","ddc":["000","004"],"publication_status":"published","abstract":[{"lang":"eng","text":"We introduce propagation models, a formalism designed to support general and efficient data structures for the transient analysis of biochemical reaction networks. We give two use cases for propagation abstract data types: the uniformization method and numerical integration. We also sketch an implementation of a propagation abstract data type, which uses abstraction to approximate states."}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"mla":"Henzinger, Thomas A., and Maria Mateescu. <i>Propagation Models for Computing Biochemical Reaction Networks</i>. Springer, 2011, pp. 1–3, doi:<a href=\"https://doi.org/10.1145/2037509.2037510\">10.1145/2037509.2037510</a>.","short":"T.A. Henzinger, M. Mateescu, in:, Springer, 2011, pp. 1–3.","apa":"Henzinger, T. A., &#38; Mateescu, M. (2011). Propagation models for computing biochemical reaction networks (pp. 1–3). Presented at the CMSB: Computational Methods in Systems Biology, Paris, France: Springer. <a href=\"https://doi.org/10.1145/2037509.2037510\">https://doi.org/10.1145/2037509.2037510</a>","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Propagation Models for Computing Biochemical Reaction Networks,” 1–3. Springer, 2011. <a href=\"https://doi.org/10.1145/2037509.2037510\">https://doi.org/10.1145/2037509.2037510</a>.","ista":"Henzinger TA, Mateescu M. 2011. Propagation models for computing biochemical reaction networks. CMSB: Computational Methods in Systems Biology, 1–3.","ama":"Henzinger TA, Mateescu M. Propagation models for computing biochemical reaction networks. In: Springer; 2011:1-3. doi:<a href=\"https://doi.org/10.1145/2037509.2037510\">10.1145/2037509.2037510</a>","ieee":"T. A. Henzinger and M. Mateescu, “Propagation models for computing biochemical reaction networks,” presented at the CMSB: Computational Methods in Systems Biology, Paris, France, 2011, pp. 1–3."},"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:29Z","conference":{"start_date":"2011-09-21","end_date":"2011-09-23","location":"Paris, France","name":"CMSB: Computational Methods in Systems Biology"},"pubrep_id":"92","status":"public","type":"conference","_id":"3299","date_created":"2018-12-11T12:02:32Z","language":[{"iso":"eng"}],"file":[{"relation":"main_file","file_size":255780,"access_level":"open_access","creator":"system","file_id":"4649","checksum":"7f5c65509db1a9fb049abedd9663ed06","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:07:50Z","content_type":"application/pdf","file_name":"IST-2012-92-v1+1_Propagation_models_for_computing_biochemical_reaction_networks.pdf"}],"month":"09","has_accepted_license":"1","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Mateescu, Maria","first_name":"Maria","last_name":"Mateescu"}],"oa_version":"Submitted Version","quality_controlled":"1"},{"type":"conference","_id":"3301","oa":1,"date_created":"2018-12-11T12:02:33Z","year":"2011","day":"01","status":"public","pubrep_id":"91","publist_id":"3339","conference":{"name":"WCSB: Workshop on Computational Systems Biology (TICSP)"},"oa_version":"Submitted Version","citation":{"apa":"Henzinger, T. A., &#38; Mateescu, M. (2011). Tail approximation for the chemical master equation. Presented at the WCSB: Workshop on Computational Systems Biology (TICSP), Tampere International Center for Signal Processing.","chicago":"Henzinger, Thomas A, and Maria Mateescu. “Tail Approximation for the Chemical Master Equation.” Tampere International Center for Signal Processing, 2011.","ama":"Henzinger TA, Mateescu M. Tail approximation for the chemical master equation. In: Tampere International Center for Signal Processing; 2011.","ista":"Henzinger TA, Mateescu M. 2011. Tail approximation for the chemical master equation. WCSB: Workshop on Computational Systems Biology (TICSP).","ieee":"T. A. Henzinger and M. Mateescu, “Tail approximation for the chemical master equation,” presented at the WCSB: Workshop on Computational Systems Biology (TICSP), 2011.","short":"T.A. Henzinger, M. Mateescu, in:, Tampere International Center for Signal Processing, 2011.","mla":"Henzinger, Thomas A., and Maria Mateescu. <i>Tail Approximation for the Chemical Master Equation</i>. Tampere International Center for Signal Processing, 2011."},"date_updated":"2021-01-12T07:42:30Z","quality_controlled":"1","department":[{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"}],"file":[{"access_level":"open_access","file_size":240820,"file_id":"5331","checksum":"aa4d7a832a5419e6c0090650ebff2b9a","creator":"system","relation":"main_file","file_name":"IST-2012-91-v1+1_Tail_approximation_for_the_chemical_master_equation.pdf","date_created":"2018-12-12T10:18:12Z","date_updated":"2020-07-14T12:46:06Z","content_type":"application/pdf"}],"ddc":["005","570"],"abstract":[{"text":"The chemical master equation is a differential equation describing the time evolution of the probability distribution over the possible “states” of a biochemical system. The solution of this equation is of interest within the systems biology field ever since the importance of the molec- ular noise has been acknowledged. Unfortunately, most of the systems do not have analytical solutions, and numerical solutions suffer from the course of dimensionality and therefore need to be approximated. Here, we introduce the concept of tail approximation, which retrieves an approximation of the probabilities in the tail of a distribution from the total probability of the tail and its conditional expectation. This approximation method can then be used to numerically compute the solution of the chemical master equation on a subset of the state space, thus fighting the explosion of the state space, for which this problem is renowned.","lang":"eng"}],"month":"01","publication_status":"published","has_accepted_license":"1","title":"Tail approximation for the chemical master equation","file_date_updated":"2020-07-14T12:46:06Z","publisher":"Tampere International Center for Signal Processing","language":[{"iso":"eng"}],"date_published":"2011-01-01T00:00:00Z"},{"publist_id":"3338","conference":{"name":"HotCloud: Workshop on Hot Topics in Cloud Computing","start_date":"2011-06-14","end_date":"2011-06-15"},"pubrep_id":"90","day":"14","page":"1 - 6","status":"public","year":"2011","type":"conference","_id":"3302","oa":1,"date_created":"2018-12-11T12:02:33Z","title":"Static scheduling in clouds","language":[{"iso":"eng"}],"file_date_updated":"2020-07-14T12:46:06Z","publisher":"USENIX","date_published":"2011-06-14T00:00:00Z","file":[{"relation":"main_file","creator":"system","file_id":"5333","checksum":"21a461ac004bb535c83320fe79b30375","file_size":232770,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:06Z","date_created":"2018-12-12T10:18:14Z","file_name":"IST-2012-90-v1+1_Static_scheduling_in_clouds.pdf"}],"ddc":["000","005"],"has_accepted_license":"1","month":"06","publication_status":"published","abstract":[{"text":"Cloud computing aims to give users virtually unlimited pay-per-use computing resources without the burden of managing the underlying infrastructure. We present a new job execution environment Flextic that exploits scal- able static scheduling techniques to provide the user with a flexible pricing model, such as a tradeoff between dif- ferent degrees of execution speed and execution price, and at the same time, reduce scheduling overhead for the cloud provider. We have evaluated a prototype of Flextic on Amazon EC2 and compared it against Hadoop. For various data parallel jobs from machine learning, im- age processing, and gene sequencing that we considered, Flextic has low scheduling overhead and reduces job du- ration by up to 15% compared to Hadoop, a dynamic cloud scheduler.","lang":"eng"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Singh","first_name":"Anmol","id":"72A86902-E99F-11E9-9F62-915534D1B916","full_name":"Singh, Anmol"},{"full_name":"Singh, Vasu","id":"4DAE2708-F248-11E8-B48F-1D18A9856A87","first_name":"Vasu","last_name":"Singh"},{"last_name":"Wies","first_name":"Thomas","full_name":"Wies, Thomas","id":"447BFB88-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Zufferey, Damien","id":"4397AC76-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3197-8736","last_name":"Zufferey","first_name":"Damien"}],"oa_version":"Submitted Version","citation":{"ieee":"T. A. Henzinger, A. Singh, V. Singh, T. Wies, and D. Zufferey, “Static scheduling in clouds,” presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, 2011, pp. 1–6.","apa":"Henzinger, T. A., Singh, A., Singh, V., Wies, T., &#38; Zufferey, D. (2011). Static scheduling in clouds (pp. 1–6). Presented at the HotCloud: Workshop on Hot Topics in Cloud Computing, USENIX.","ista":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. 2011. Static scheduling in clouds. HotCloud: Workshop on Hot Topics in Cloud Computing, 1–6.","ama":"Henzinger TA, Singh A, Singh V, Wies T, Zufferey D. Static scheduling in clouds. In: USENIX; 2011:1-6.","chicago":"Henzinger, Thomas A, Anmol Singh, Vasu Singh, Thomas Wies, and Damien Zufferey. “Static Scheduling in Clouds,” 1–6. USENIX, 2011.","short":"T.A. Henzinger, A. Singh, V. Singh, T. Wies, D. Zufferey, in:, USENIX, 2011, pp. 1–6.","mla":"Henzinger, Thomas A., et al. <i>Static Scheduling in Clouds</i>. USENIX, 2011, pp. 1–6."},"quality_controlled":"1","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:42:31Z"},{"editor":[{"full_name":"van de Weygaert, R","last_name":"van de Weygaert","first_name":"R"},{"full_name":"Vegter, G","first_name":"G","last_name":"Vegter"},{"full_name":"Ritzerveld, J","first_name":"J","last_name":"Ritzerveld"},{"full_name":"Icke, V","last_name":"Icke","first_name":"V"}],"publist_id":"3329","publication":"Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings","oa":1,"date_created":"2018-12-11T12:02:36Z","type":"book_chapter","_id":"3311","status":"public","day":"31","year":"2011","has_accepted_license":"1","month":"12","publication_status":"inpress","abstract":[{"lang":"eng","text":"Alpha shapes have been conceived in 1981 as an attempt to define the shape of a finite set of point in the plane. Since then, connections to diverse areas in the sciences and engineering have developed, including to pattern recognition, digital shape sampling and processing, and structural molecular biology. This survey begins with a historical account and discusses geometric, algorithmic, topological, and combinatorial aspects of alpha shapes in this sequence."}],"file":[{"creator":"dernst","file_id":"11408","checksum":"a592ea438351e7280eea993a7713ab8f","file_size":475254,"access_level":"open_access","relation":"main_file","success":1,"file_name":"2010_AlphaShapes.pdf","content_type":"application/pdf","date_updated":"2022-05-24T07:55:05Z","date_created":"2022-05-24T07:55:05Z"}],"ddc":["510"],"language":[{"iso":"eng"}],"date_published":"2011-12-31T00:00:00Z","publisher":"Springer","file_date_updated":"2022-05-24T07:55:05Z","title":"Alpha shapes - a survey","article_processing_charge":"No","department":[{"_id":"HeEd"}],"quality_controlled":"1","date_updated":"2022-05-24T07:56:30Z","oa_version":"Submitted Version","citation":{"short":"H. Edelsbrunner, in:, R. van de Weygaert, G. Vegter, J. Ritzerveld, V. Icke (Eds.), Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings, Springer, n.d.","mla":"Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” <i>Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings</i>, edited by R van de Weygaert et al., Springer.","ieee":"H. Edelsbrunner, “Alpha shapes - a survey,” in <i>Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings</i>, R. van de Weygaert, G. Vegter, J. Ritzerveld, and V. Icke, Eds. Springer.","chicago":"Edelsbrunner, Herbert. “Alpha Shapes - a Survey.” In <i>Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings</i>, edited by R van de Weygaert, G Vegter, J Ritzerveld, and V Icke. Springer, n.d.","ista":"Edelsbrunner H.Alpha shapes - a survey. In: Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings. .","ama":"Edelsbrunner H. Alpha shapes - a survey. In: van de Weygaert R, Vegter G, Ritzerveld J, Icke V, eds. <i>Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings</i>. Springer.","apa":"Edelsbrunner, H. (n.d.). Alpha shapes - a survey. In R. van de Weygaert, G. Vegter, J. Ritzerveld, &#38; V. Icke (Eds.), <i>Tessellations in the Sciences: Virtues, Techniques and Applications of Geometric Tilings</i>. Springer."},"author":[{"full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"oa_version":"Submitted Version","quality_controlled":"1","author":[{"full_name":"Zheng, Ying","last_name":"Zheng","first_name":"Ying"},{"first_name":"Steve","last_name":"Gu","full_name":"Gu, Steve"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833"},{"full_name":"Tomasi, Carlo","first_name":"Carlo","last_name":"Tomasi"},{"last_name":"Benfey","first_name":"Philip","full_name":"Benfey, Philip"}],"file":[{"relation":"main_file","creator":"system","file_id":"4727","checksum":"30a33564b7b45a7ee31610898267fd0e","file_size":5622728,"access_level":"open_access","content_type":"application/pdf","date_updated":"2020-07-14T12:46:07Z","date_created":"2018-12-12T10:09:04Z","file_name":"IST-2016-541-v1+1_2011-P-07-RootReconstruction.pdf"}],"article_number":"6126475","has_accepted_license":"1","month":"12","article_processing_charge":"No","language":[{"iso":"eng"}],"_id":"3312","type":"conference_poster","date_created":"2018-12-11T12:02:36Z","status":"public","pubrep_id":"541","conference":{"end_date":"2011-11-13","start_date":"2011-11-06","location":"Barcelona, Spain","name":"ICCV: International Conference on Computer Vision"},"citation":{"ama":"Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. <i>Detailed Reconstruction of 3D Plant Root Shape</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126475\">10.1109/ICCV.2011.6126475</a>","chicago":"Zheng, Ying, Steve Gu, Herbert Edelsbrunner, Carlo Tomasi, and Philip Benfey. <i>Detailed Reconstruction of 3D Plant Root Shape</i>. <i>Proceedings of the IEEE International Conference on Computer Vision</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/ICCV.2011.6126475\">https://doi.org/10.1109/ICCV.2011.6126475</a>.","ista":"Zheng Y, Gu S, Edelsbrunner H, Tomasi C, Benfey P. 2011. Detailed reconstruction of 3D plant root shape, IEEE,p.","apa":"Zheng, Y., Gu, S., Edelsbrunner, H., Tomasi, C., &#38; Benfey, P. (2011). <i>Detailed reconstruction of 3D plant root shape</i>. <i>Proceedings of the IEEE International Conference on Computer Vision</i>. Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126475\">https://doi.org/10.1109/ICCV.2011.6126475</a>","ieee":"Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, and P. Benfey, <i>Detailed reconstruction of 3D plant root shape</i>. IEEE, 2011.","mla":"Zheng, Ying, et al. “Detailed Reconstruction of 3D Plant Root Shape.” <i>Proceedings of the IEEE International Conference on Computer Vision</i>, 6126475, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126475\">10.1109/ICCV.2011.6126475</a>.","short":"Y. Zheng, S. Gu, H. Edelsbrunner, C. Tomasi, P. Benfey, Detailed Reconstruction of 3D Plant Root Shape, IEEE, 2011."},"date_updated":"2020-07-14T23:03:43Z","department":[{"_id":"HeEd"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","ddc":["000"],"abstract":[{"lang":"eng","text":"We study the 3D reconstruction of plant roots from multiple 2D images. To meet the challenge caused by the delicate nature of thin branches, we make three innovations to cope with the sensitivity to image quality and calibration. First, we model the background as a harmonic function to improve the segmentation of the root in each 2D image. Second, we develop the concept of the regularized visual hull which reduces the effect of jittering and refraction by ensuring consistency with one 2D image. Third, we guarantee connectedness through adjustments to the 3D reconstruction that minimize global error. Our software is part of a biological phenotype/genotype study of agricultural root systems. It has been tested on more than 40 plant roots and results are promising in terms of reconstruction quality and efficiency."}],"publication_status":"published","title":"Detailed reconstruction of 3D plant root shape","file_date_updated":"2020-07-14T12:46:07Z","date_published":"2011-12-31T00:00:00Z","publisher":"IEEE","oa":1,"year":"2011","doi":"10.1109/ICCV.2011.6126475","day":"31","acknowledgement":"This research is supported by the National Science Foundation (NSF) under grant DBI-0820624.","publication":"Proceedings of the IEEE International Conference on Computer Vision","publist_id":"3328"},{"conference":{"name":"ICCV: International Conference on Computer Vision","location":"Barcelona, Spain","end_date":"2011-11-13","start_date":"2011-11-06"},"pubrep_id":"540","status":"public","date_created":"2018-12-11T12:02:37Z","_id":"3313","type":"conference","language":[{"iso":"eng"}],"has_accepted_license":"1","month":"11","file":[{"file_name":"IST-2016-540-v1+1_2011-P-08-RunEmpty.pdf","date_updated":"2020-07-14T12:46:07Z","date_created":"2018-12-12T10:17:28Z","content_type":"application/pdf","file_size":614050,"access_level":"open_access","creator":"system","file_id":"5282","checksum":"6984684081ba123808b344f9f2e64a8f","relation":"main_file"}],"article_number":"6126271","author":[{"id":"3E92416E-F248-11E8-B48F-1D18A9856A87","full_name":"Chen, Chao","first_name":"Chao","last_name":"Chen"},{"first_name":"Herbert","last_name":"Edelsbrunner","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"}],"quality_controlled":"1","oa_version":"Submitted Version","publist_id":"3327","publication":"Proceedings of the IEEE International Conference on Computer Vision","scopus_import":1,"doi":"10.1109/ICCV.2011.6126271","day":"06","year":"2011","oa":1,"file_date_updated":"2020-07-14T12:46:07Z","publisher":"IEEE","date_published":"2011-11-06T00:00:00Z","title":"Diffusion runs low on persistence fast","publication_status":"published","abstract":[{"lang":"eng","text":"Interpreting an image as a function on a compact sub- set of the Euclidean plane, we get its scale-space by diffu- sion, spreading the image over the entire plane. This gener- ates a 1-parameter family of functions alternatively defined as convolutions with a progressively wider Gaussian ker- nel. We prove that the corresponding 1-parameter family of persistence diagrams have norms that go rapidly to zero as time goes to infinity. This result rationalizes experimental observations about scale-space. We hope this will lead to targeted improvements of related computer vision methods."}],"ddc":["000"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:42:35Z","citation":{"short":"C. Chen, H. Edelsbrunner, in:, Proceedings of the IEEE International Conference on Computer Vision, IEEE, 2011.","mla":"Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” <i>Proceedings of the IEEE International Conference on Computer Vision</i>, 6126271, IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126271\">10.1109/ICCV.2011.6126271</a>.","ieee":"C. Chen and H. Edelsbrunner, “Diffusion runs low on persistence fast,” in <i>Proceedings of the IEEE International Conference on Computer Vision</i>, Barcelona, Spain, 2011.","chicago":"Chen, Chao, and Herbert Edelsbrunner. “Diffusion Runs Low on Persistence Fast.” In <i>Proceedings of the IEEE International Conference on Computer Vision</i>. IEEE, 2011. <a href=\"https://doi.org/10.1109/ICCV.2011.6126271\">https://doi.org/10.1109/ICCV.2011.6126271</a>.","ista":"Chen C, Edelsbrunner H. 2011. Diffusion runs low on persistence fast. Proceedings of the IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision, 6126271.","ama":"Chen C, Edelsbrunner H. Diffusion runs low on persistence fast. In: <i>Proceedings of the IEEE International Conference on Computer Vision</i>. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ICCV.2011.6126271\">10.1109/ICCV.2011.6126271</a>","apa":"Chen, C., &#38; Edelsbrunner, H. (2011). Diffusion runs low on persistence fast. In <i>Proceedings of the IEEE International Conference on Computer Vision</i>. Barcelona, Spain: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2011.6126271\">https://doi.org/10.1109/ICCV.2011.6126271</a>"}},{"date_created":"2018-12-11T12:02:37Z","_id":"3315","type":"journal_article","status":"public","pubrep_id":"506","ec_funded":1,"project":[{"call_identifier":"FP7","_id":"25EFB36C-B435-11E9-9278-68D0E5697425","grant_number":"215543","name":"COMponent-Based Embedded Systems design Techniques"}],"quality_controlled":"1","oa_version":"Published Version","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Vinayak","last_name":"Prabhu","full_name":"Prabhu, Vinayak"}],"has_accepted_license":"1","month":"12","issue":"4","file":[{"file_name":"IST-2016-86-v2+1_1011.0688_3_.pdf","date_updated":"2020-07-14T12:46:07Z","date_created":"2018-12-12T10:16:42Z","content_type":"application/pdf","file_size":588863,"access_level":"open_access","creator":"system","file_id":"5231","checksum":"3480e1594bbef25ff7462fa93a8a814e","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":7,"oa":1,"doi":"10.2168/LMCS-7(4:8)2011","year":"2011","day":"14","related_material":{"record":[{"status":"public","id":"3876","relation":"earlier_version"}]},"scopus_import":1,"intvolume":"         7","publist_id":"3324","publication":"Logical Methods in Computer Science","date_updated":"2023-02-23T11:46:35Z","department":[{"_id":"KrCh"},{"_id":"ToHe"}],"citation":{"apa":"Chatterjee, K., Henzinger, T. A., &#38; Prabhu, V. (2011). Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>","chicago":"Chatterjee, Krishnendu, Thomas A Henzinger, and Vinayak Prabhu. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>. International Federation of Computational Logic, 2011. <a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">https://doi.org/10.2168/LMCS-7(4:8)2011</a>.","ista":"Chatterjee K, Henzinger TA, Prabhu V. 2011. Timed parity games: Complexity and robustness. Logical Methods in Computer Science. 7(4).","ama":"Chatterjee K, Henzinger TA, Prabhu V. Timed parity games: Complexity and robustness. <i>Logical Methods in Computer Science</i>. 2011;7(4). doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>","ieee":"K. Chatterjee, T. A. Henzinger, and V. Prabhu, “Timed parity games: Complexity and robustness,” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4. International Federation of Computational Logic, 2011.","short":"K. Chatterjee, T.A. Henzinger, V. Prabhu, Logical Methods in Computer Science 7 (2011).","mla":"Chatterjee, Krishnendu, et al. “Timed Parity Games: Complexity and Robustness.” <i>Logical Methods in Computer Science</i>, vol. 7, no. 4, International Federation of Computational Logic, 2011, doi:<a href=\"https://doi.org/10.2168/LMCS-7(4:8)2011\">10.2168/LMCS-7(4:8)2011</a>."},"tmp":{"short":"CC BY-ND (4.0)","name":"Creative Commons Attribution-NoDerivatives 4.0 International (CC BY-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nd/4.0/legalcode","image":"/image/cc_by_nd.png"},"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","abstract":[{"text":"We consider two-player games played in real time on game structures with clocks where the objectives of players are described using parity conditions. The games are concurrent in that at each turn, both players independently propose a time delay and an action, and the action with the shorter delay is chosen. To prevent a player from winning by blocking time, we restrict each player to play strategies that ensure that the player cannot be responsible for causing a zeno run. First, we present an efficient reduction of these games to turn-based (i.e., not concurrent) finite-state (i.e., untimed) parity games. Our reduction improves the best known complexity for solving timed parity games. Moreover, the rich class of algorithms for classical parity games can now be applied to timed parity games. The states of the resulting game are based on clock regions of the original game, and the state space of the finite game is linear in the size of the region graph. Second, we consider two restricted classes of strategies for the player that represents the controller in a real-time synthesis problem, namely, limit-robust and bounded-robust winning strategies. Using a limit-robust winning strategy, the controller cannot choose an exact real-valued time delay but must allow for some nonzero jitter in each of its actions. If there is a given lower bound on the jitter, then the strategy is bounded-robust winning. We show that exact strategies are more powerful than limit-robust strategies, which are more powerful than bounded-robust winning strategies for any bound. For both kinds of robust strategies, we present efficient reductions to standard timed automaton games. These reductions provide algorithms for the synthesis of robust real-time controllers.","lang":"eng"}],"publication_status":"published","ddc":["000","005"],"file_date_updated":"2020-07-14T12:46:07Z","publisher":"International Federation of Computational Logic","date_published":"2011-12-14T00:00:00Z","title":"Timed parity games: Complexity and robustness"}]