[{"oa_version":"None","citation":{"short":"A. Klopper, G. Krens, S. Grill, C.-P.J. Heisenberg, The European Physical Journal E: Soft Matter and Biological Physics 33 (2010) 99–103.","mla":"Klopper, Abigail, et al. “Finite-Size Corrections to Scaling Behavior in Sorted Cell Aggregates.” <i>The European Physical Journal E: Soft Matter and Biological Physics</i>, vol. 33, no. 2, Springer, 2010, pp. 99–103, doi:<a href=\"https://doi.org/10.1140/epje/i2010-10642-y\">10.1140/epje/i2010-10642-y</a>.","ieee":"A. Klopper, G. Krens, S. Grill, and C.-P. J. Heisenberg, “Finite-size corrections to scaling behavior in sorted cell aggregates,” <i>The European Physical Journal E: Soft Matter and Biological Physics</i>, vol. 33, no. 2. Springer, pp. 99–103, 2010.","ista":"Klopper A, Krens G, Grill S, Heisenberg C-PJ. 2010. Finite-size corrections to scaling behavior in sorted cell aggregates. The European Physical Journal E: Soft Matter and Biological Physics. 33(2), 99–103.","chicago":"Klopper, Abigail, Gabriel Krens, Stephan Grill, and Carl-Philipp J Heisenberg. “Finite-Size Corrections to Scaling Behavior in Sorted Cell Aggregates.” <i>The European Physical Journal E: Soft Matter and Biological Physics</i>. Springer, 2010. <a href=\"https://doi.org/10.1140/epje/i2010-10642-y\">https://doi.org/10.1140/epje/i2010-10642-y</a>.","ama":"Klopper A, Krens G, Grill S, Heisenberg C-PJ. Finite-size corrections to scaling behavior in sorted cell aggregates. <i>The European Physical Journal E: Soft Matter and Biological Physics</i>. 2010;33(2):99-103. doi:<a href=\"https://doi.org/10.1140/epje/i2010-10642-y\">10.1140/epje/i2010-10642-y</a>","apa":"Klopper, A., Krens, G., Grill, S., &#38; Heisenberg, C.-P. J. (2010). Finite-size corrections to scaling behavior in sorted cell aggregates. <i>The European Physical Journal E: Soft Matter and Biological Physics</i>. Springer. <a href=\"https://doi.org/10.1140/epje/i2010-10642-y\">https://doi.org/10.1140/epje/i2010-10642-y</a>"},"date_updated":"2021-01-12T07:52:12Z","department":[{"_id":"CaHe"}],"user_id":"2EBD1598-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Klopper, Abigail","first_name":"Abigail","last_name":"Klopper"},{"full_name":"Krens, Gabriel","id":"2B819732-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4761-5996","first_name":"Gabriel","last_name":"Krens"},{"first_name":"Stephan","last_name":"Grill","full_name":"Grill, Stephan"},{"first_name":"Carl-Philipp J","last_name":"Heisenberg","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"issue":"2","abstract":[{"text":"Cell sorting is a widespread phenomenon pivotal to the early development of multicellular organisms. In vitro cell sorting studies have been instrumental in revealing the cellular properties driving this process. However, these studies have as yet been limited to two-dimensional analysis of three-dimensional cell sorting events. Here we describe a method to record the sorting of primary zebrafish ectoderm and mesoderm germ layer progenitor cells in three dimensions over time, and quantitatively analyze their sorting behavior using an order parameter related to heterotypic interface length. We investigate the cell population size dependence of sorted aggregates and find that the germ layer progenitor cells engulfed in the final configuration display a relationship between total interfacial length and system size according to a simple geometrical argument, subject to a finite-size effect.","lang":"eng"}],"month":"09","publication_status":"published","title":"Finite-size corrections to scaling behavior in sorted cell aggregates","volume":33,"date_published":"2010-09-18T00:00:00Z","language":[{"iso":"eng"}],"publisher":"Springer","type":"journal_article","_id":"3788","date_created":"2018-12-11T12:05:10Z","doi":"10.1140/epje/i2010-10642-y","page":"99 - 103","day":"18","status":"public","year":"2010","scopus_import":1,"publication":"The European Physical Journal E: Soft Matter and Biological Physics","intvolume":"        33","publist_id":"2439"},{"date_updated":"2021-01-12T07:52:12Z","quality_controlled":"1","department":[{"_id":"CaHe"}],"oa_version":"None","citation":{"mla":"Quesada-Hernández, Elena, et al. “Stereotypical Cell Division Orientation Controls Neural Rod Midline Formation in Zebrafish.” <i>Current Biology</i>, vol. 20, no. 21, Cell Press, 2010, pp. 1966–72, doi:<a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">10.1016/j.cub.2010.10.009</a>.","short":"E. Quesada-Hernández, L. Caneparo, S. Schneider, S. Winkler, M. Liebling, S. Fraser, C.-P.J. Heisenberg, Current Biology 20 (2010) 1966–1972.","ama":"Quesada-Hernández E, Caneparo L, Schneider S, et al. Stereotypical cell division orientation controls neural rod midline formation in zebrafish. <i>Current Biology</i>. 2010;20(21):1966-1972. doi:<a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">10.1016/j.cub.2010.10.009</a>","ista":"Quesada-Hernández E, Caneparo L, Schneider S, Winkler S, Liebling M, Fraser S, Heisenberg C-PJ. 2010. Stereotypical cell division orientation controls neural rod midline formation in zebrafish. Current Biology. 20(21), 1966–1972.","chicago":"Quesada-Hernández, Elena, Luca Caneparo, Sylvia Schneider, Sylke Winkler, Michael Liebling, Scott Fraser, and Carl-Philipp J Heisenberg. “Stereotypical Cell Division Orientation Controls Neural Rod Midline Formation in Zebrafish.” <i>Current Biology</i>. Cell Press, 2010. <a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">https://doi.org/10.1016/j.cub.2010.10.009</a>.","apa":"Quesada-Hernández, E., Caneparo, L., Schneider, S., Winkler, S., Liebling, M., Fraser, S., &#38; Heisenberg, C.-P. J. (2010). Stereotypical cell division orientation controls neural rod midline formation in zebrafish. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2010.10.009\">https://doi.org/10.1016/j.cub.2010.10.009</a>","ieee":"E. Quesada-Hernández <i>et al.</i>, “Stereotypical cell division orientation controls neural rod midline formation in zebrafish,” <i>Current Biology</i>, vol. 20, no. 21. Cell Press, pp. 1966–1972, 2010."},"author":[{"id":"EA35229E-E909-11E9-8DF8-C90C5D5AF86E","full_name":"Quesada-Hernández, Elena","first_name":"Elena","last_name":"Quesada-Hernández"},{"full_name":"Caneparo, Luca","first_name":"Luca","last_name":"Caneparo"},{"last_name":"Schneider","first_name":"Sylvia","id":"1FAC36B0-E90A-11E9-9D2F-EF31CE0C9C2F","full_name":"Schneider, Sylvia"},{"first_name":"Sylke","last_name":"Winkler","full_name":"Winkler, Sylke"},{"full_name":"Liebling, Michael","last_name":"Liebling","first_name":"Michael"},{"full_name":"Fraser, Scott","last_name":"Fraser","first_name":"Scott"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","abstract":[{"lang":"eng","text":"The development of multicellular organisms is dependent on the tight coordination between tissue growth and morphogenesis. The stereotypical orientation of cell divisions has been proposed to be a fundamental mechanism by which proliferating and growing tissues take shape. However, the actual contribution of stereotypical division orientation (SDO) to tissue morphogenesis is unclear. In zebrafish, cell divisions with stereotypical orientation have been implicated in both body-axis elongation and neural rod formation [1, 2], although there is little direct evidence for a critical function of SDO in either of these processes. Here we show that SDO is required for formation of the neural rod midline during neurulation but dispensable for elongation of the body axis during gastrulation. Our data indicate that SDO during both gastrulation and neurulation is dependent on the noncanonical Wnt receptor Frizzled 7 (Fz7) and that interfering with cell division orientation leads to severe defects in neural rod midline formation but not body-axis elongation. These findings suggest a novel function for Fz7-controlled cell division orientation in neural rod midline formation during neurulation. "}],"publication_status":"published","month":"11","issue":"21","publisher":"Cell Press","date_published":"2010-11-09T00:00:00Z","language":[{"iso":"eng"}],"title":"Stereotypical cell division orientation controls neural rod midline formation in zebrafish","volume":20,"date_created":"2018-12-11T12:05:11Z","_id":"3789","type":"journal_article","acknowledgement":"This work was supported by grants from the Fundacion Caja Madrid to E.Q.H. and the Institute of Science and Technology Austria, the Max-Planck-Society, and the Deutsche Forschungsgemeinschaft to C.P.H.\r\nWe are grateful to Jon Clarke, Andy Oates, and Garrett Greenan for reading earlier versions of this manuscript. We thank J. Peychl, H. Ibarra, and P. Pitrone for excellent assistance and advice in multi-photon microscopy and D. White for assistance during the image-processing steps. We also thank D. Panhans for technical assistance, the whole Heisenberg laboratory for useful comments and discussions, and E. Lehmann, J. Hückmann, and G. Junghans for excellent fish care. ","doi":"10.1016/j.cub.2010.10.009","status":"public","page":"1966 - 1972","year":"2010","day":"09","scopus_import":1,"intvolume":"        20","publist_id":"2438","publication":"Current Biology"},{"pubrep_id":"365","status":"public","date_created":"2018-12-11T12:05:11Z","_id":"3790","type":"journal_article","language":[{"iso":"eng"}],"volume":8,"month":"11","has_accepted_license":"1","issue":"11","article_number":"e1000544","file":[{"date_created":"2018-12-12T10:08:24Z","date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","file_name":"IST-2015-365-v1+1_journal.pbio.1000544.pdf","relation":"main_file","access_level":"open_access","file_size":799506,"file_id":"4685","checksum":"52d18c90ca6b02234cea5e8b399b7f46","creator":"system"}],"author":[{"first_name":"Alba","last_name":"Diz Muñoz","full_name":"Diz Muñoz, Alba"},{"first_name":"Michael","last_name":"Krieg","full_name":"Krieg, Michael"},{"last_name":"Bergert","first_name":"Martin","full_name":"Bergert, Martin"},{"full_name":"Ibarlucea Benitez, Itziar","first_name":"Itziar","last_name":"Ibarlucea Benitez"},{"last_name":"Müller","first_name":"Daniel","full_name":"Müller, Daniel"},{"full_name":"Paluch, Ewa","last_name":"Paluch","first_name":"Ewa"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"quality_controlled":"1","oa_version":"Published Version","intvolume":"         8","publist_id":"2437","publication":"PLoS Biology","scopus_import":1,"acknowledgement":"We would like to thank A. G. Clark, S. Grill, A. Oates, E. Raz, L. Rohde, and M. Zerial for reading earlier versions of the manuscript. We are grateful to W. Zachariae, Y. Arboleda-Estudillo, S. Schneider, P. Stockinger, D. Panhans, M. Biro, J. C. Olaya, and the BIOTEC/MPI-CBG zebrafish and imaging facilities for help and advice at various stages of this project and to J. Helenius for help with programming. This work was supported by grants from the Boehringer Ingelheim Fonds to MK, the Polish Ministry of Science and Higher Education to E. P., and the Deutsche Forschungsgemeinschaft (HE 3231/6-1 and PA 1590/1-1) to CPH and EP.\r\n","doi":"10.1371/journal.pbio.1000544","day":"30","year":"2010","oa":1,"publisher":"Public Library of Science","date_published":"2010-11-30T00:00:00Z","file_date_updated":"2020-07-14T12:46:16Z","title":"Control of directed cell migration in vivo by membrane-to-cortex attachment","abstract":[{"text":"Cell shape and motility are primarily controlled by cellular mechanics. The attachment of the plasma membrane to the underlying actomyosin cortex has been proposed to be important for cellular processes involving membrane deformation. However, little is known about the actual function of membrane-to-cortex attachment (MCA) in cell protrusion formation and migration, in particular in the context of the developing embryo. Here, we use a multidisciplinary approach to study MCA in zebrafish mesoderm and endoderm (mesendoderm) germ layer progenitor cells, which migrate using a combination of different protrusion types, namely, lamellipodia, filopodia, and blebs, during zebrafish gastrulation. By interfering with the activity of molecules linking the cortex to the membrane and measuring resulting changes in MCA by atomic force microscopy, we show that reducing MCA in mesendoderm progenitors increases the proportion of cellular blebs and reduces the directionality of cell migration. We propose that MCA is a key parameter controlling the relative proportions of different cell protrusion types in mesendoderm progenitors, and thus is key in controlling directed migration during gastrulation.","lang":"eng"}],"publication_status":"published","ddc":["576"],"user_id":"3E5EF7F0-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)"},"date_updated":"2021-01-12T07:52:13Z","department":[{"_id":"CaHe"}],"citation":{"short":"A. Diz Muñoz, M. Krieg, M. Bergert, I. Ibarlucea Benitez, D. Müller, E. Paluch, C.-P.J. Heisenberg, PLoS Biology 8 (2010).","mla":"Diz Muñoz, Alba, et al. “Control of Directed Cell Migration in Vivo by Membrane-to-Cortex Attachment.” <i>PLoS Biology</i>, vol. 8, no. 11, e1000544, Public Library of Science, 2010, doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000544\">10.1371/journal.pbio.1000544</a>.","ama":"Diz Muñoz A, Krieg M, Bergert M, et al. Control of directed cell migration in vivo by membrane-to-cortex attachment. <i>PLoS Biology</i>. 2010;8(11). doi:<a href=\"https://doi.org/10.1371/journal.pbio.1000544\">10.1371/journal.pbio.1000544</a>","ista":"Diz Muñoz A, Krieg M, Bergert M, Ibarlucea Benitez I, Müller D, Paluch E, Heisenberg C-PJ. 2010. Control of directed cell migration in vivo by membrane-to-cortex attachment. PLoS Biology. 8(11), e1000544.","chicago":"Diz Muñoz, Alba, Michael Krieg, Martin Bergert, Itziar Ibarlucea Benitez, Daniel Müller, Ewa Paluch, and Carl-Philipp J Heisenberg. “Control of Directed Cell Migration in Vivo by Membrane-to-Cortex Attachment.” <i>PLoS Biology</i>. Public Library of Science, 2010. <a href=\"https://doi.org/10.1371/journal.pbio.1000544\">https://doi.org/10.1371/journal.pbio.1000544</a>.","apa":"Diz Muñoz, A., Krieg, M., Bergert, M., Ibarlucea Benitez, I., Müller, D., Paluch, E., &#38; Heisenberg, C.-P. J. (2010). Control of directed cell migration in vivo by membrane-to-cortex attachment. <i>PLoS Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.1000544\">https://doi.org/10.1371/journal.pbio.1000544</a>","ieee":"A. Diz Muñoz <i>et al.</i>, “Control of directed cell migration in vivo by membrane-to-cortex attachment,” <i>PLoS Biology</i>, vol. 8, no. 11. Public Library of Science, 2010."}},{"ddc":["000"],"abstract":[{"lang":"eng","text":"Recent progress in per-pixel object class labeling of natural images can be attributed to the use of multiple types of image features and sound statistical learning approaches. Within the latter, Conditional Random Fields (CRF) are prominently used for their ability to represent interactions between random variables. Despite their popularity in computer vision, parameter learning for CRFs has remained difficult, popular approaches being cross-validation and piecewise training.\r\nIn this work, we propose a simple yet expressive tree-structured CRF based on a recent hierarchical image segmentation method. Our model combines and weights multiple image features within a hierarchical representation and allows simple and efficient globally-optimal learning of ≈ 105 parameters. The tractability of our model allows us to pose and answer some of the open questions regarding parameter learning applying to CRF-based approaches. The key findings for learning CRF models are, from the obvious to the surprising, i) multiple image features always help, ii) the limiting dimension with respect to current models is the amount of training data, iii) piecewise training is competitive, iv) current methods for max-margin training fail for models with many parameters.\r\n"}],"publication_status":"published","title":"On parameter learning in CRF-based approaches to object class image segmentation","file_date_updated":"2020-07-14T12:46:16Z","publisher":"Springer","date_published":"2010-11-04T00:00:00Z","citation":{"short":"S. Nowozin, P. Gehler, C. Lampert, in:, Springer, 2010, pp. 98–111.","mla":"Nowozin, Sebastian, et al. <i>On Parameter Learning in CRF-Based Approaches to Object Class Image Segmentation</i>. Vol. 6316, Springer, 2010, pp. 98–111, doi:<a href=\"https://doi.org/10.1007/978-3-642-15567-3_8\">10.1007/978-3-642-15567-3_8</a>.","chicago":"Nowozin, Sebastian, Peter Gehler, and Christoph Lampert. “On Parameter Learning in CRF-Based Approaches to Object Class Image Segmentation,” 6316:98–111. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15567-3_8\">https://doi.org/10.1007/978-3-642-15567-3_8</a>.","ama":"Nowozin S, Gehler P, Lampert C. On parameter learning in CRF-based approaches to object class image segmentation. In: Vol 6316. Springer; 2010:98-111. doi:<a href=\"https://doi.org/10.1007/978-3-642-15567-3_8\">10.1007/978-3-642-15567-3_8</a>","ista":"Nowozin S, Gehler P, Lampert C. 2010. On parameter learning in CRF-based approaches to object class image segmentation. ECCV: European Conference on Computer Vision, LNCS, vol. 6316, 98–111.","apa":"Nowozin, S., Gehler, P., &#38; Lampert, C. (2010). On parameter learning in CRF-based approaches to object class image segmentation (Vol. 6316, pp. 98–111). Presented at the ECCV: European Conference on Computer Vision, Heraklion, Crete, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15567-3_8\">https://doi.org/10.1007/978-3-642-15567-3_8</a>","ieee":"S. Nowozin, P. Gehler, and C. Lampert, “On parameter learning in CRF-based approaches to object class image segmentation,” presented at the ECCV: European Conference on Computer Vision, Heraklion, Crete, Greece, 2010, vol. 6316, pp. 98–111."},"date_updated":"2021-01-12T07:52:14Z","department":[{"_id":"ChLa"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"scopus_import":1,"intvolume":"      6316","publist_id":"2431","oa":1,"page":"98 - 111","year":"2010","doi":"10.1007/978-3-642-15567-3_8","day":"04","file":[{"date_created":"2020-05-19T16:27:34Z","date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","file_name":"2010_ECCV_Nowozin.pdf","relation":"main_file","access_level":"open_access","file_size":4087332,"checksum":"3716e10e161f7c714fd17ec193a223c3","file_id":"7871","creator":"dernst"}],"has_accepted_license":"1","month":"11","article_processing_charge":"No","volume":6316,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","quality_controlled":"1","author":[{"first_name":"Sebastian","last_name":"Nowozin","full_name":"Nowozin, Sebastian"},{"full_name":"Gehler, Peter","last_name":"Gehler","first_name":"Peter"},{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"}],"conference":{"end_date":"2010-09-11","start_date":"2010-09-05","location":"Heraklion, Crete, Greece","name":"ECCV: European Conference on Computer Vision"},"_id":"3793","type":"conference","date_created":"2018-12-11T12:05:12Z","status":"public"},{"scopus_import":1,"publist_id":"2433","conference":{"start_date":"2010-09-05","end_date":"2010-09-11","name":"ECCV: European Conference on Computer Vision","location":"Heraklion, Crete, Greece"},"intvolume":"      6312","type":"conference","_id":"3794","date_created":"2018-12-11T12:05:12Z","main_file_link":[{"url":"http://www.ics.forth.gr/eccv2010/intro.php"}],"doi":"10.1007/978-3-642-15552-9_41","page":"566 - 579","status":"public","day":"10","year":"2010","month":"11","publication_status":"published","abstract":[{"lang":"eng","text":"We study the problem of multimodal dimensionality reduction assuming that data samples can be missing at training time, and not all data modalities may be present at application time. Maximum covariance analysis, as a generalization of PCA, has many desirable properties, but its application to practical problems is limited by its need for perfectly paired data. We overcome this limitation by a latent variable approach that allows working with weakly paired data and is still able to efficiently process large datasets using standard numerical routines. The resulting weakly paired maximum covariance analysis often finds better representations than alternative methods, as we show in two exemplary tasks: texture discrimination and transfer learning."}],"title":"Weakly-paired maximum covariance analysis for multimodal dimensionality reduction and transfer learning","volume":6312,"publisher":"Springer","date_published":"2010-11-10T00:00:00Z","language":[{"iso":"eng"}],"oa_version":"None","citation":{"mla":"Lampert, Christoph, and Oliver Krömer. <i>Weakly-Paired Maximum Covariance Analysis for Multimodal Dimensionality Reduction and Transfer Learning</i>. Vol. 6312, Springer, 2010, pp. 566–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_41\">10.1007/978-3-642-15552-9_41</a>.","short":"C. Lampert, O. Krömer, in:, Springer, 2010, pp. 566–579.","ama":"Lampert C, Krömer O. Weakly-paired maximum covariance analysis for multimodal dimensionality reduction and transfer learning. In: Vol 6312. Springer; 2010:566-579. doi:<a href=\"https://doi.org/10.1007/978-3-642-15552-9_41\">10.1007/978-3-642-15552-9_41</a>","chicago":"Lampert, Christoph, and Oliver Krömer. “Weakly-Paired Maximum Covariance Analysis for Multimodal Dimensionality Reduction and Transfer Learning,” 6312:566–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_41\">https://doi.org/10.1007/978-3-642-15552-9_41</a>.","ista":"Lampert C, Krömer O. 2010. Weakly-paired maximum covariance analysis for multimodal dimensionality reduction and transfer learning. ECCV: European Conference on Computer Vision, LNCS, vol. 6312, 566–579.","apa":"Lampert, C., &#38; Krömer, O. (2010). Weakly-paired maximum covariance analysis for multimodal dimensionality reduction and transfer learning (Vol. 6312, pp. 566–579). Presented at the ECCV: European Conference on Computer Vision, Heraklion, Crete, Greece: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15552-9_41\">https://doi.org/10.1007/978-3-642-15552-9_41</a>","ieee":"C. Lampert and O. Krömer, “Weakly-paired maximum covariance analysis for multimodal dimensionality reduction and transfer learning,” presented at the ECCV: European Conference on Computer Vision, Heraklion, Crete, Greece, 2010, vol. 6312, pp. 566–579."},"department":[{"_id":"ChLa"}],"quality_controlled":"1","date_updated":"2021-01-12T07:52:14Z","alternative_title":["LNCS"],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887","last_name":"Lampert","first_name":"Christoph"},{"full_name":"Krömer, Oliver","first_name":"Oliver","last_name":"Krömer"}]},{"oa_version":"Submitted Version","quality_controlled":"1","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert"},{"first_name":"Dmitriy","last_name":"Morozov","full_name":"Morozov, Dmitriy"},{"first_name":"Amit","last_name":"Patel","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87"}],"file":[{"date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:11:40Z","content_type":"application/pdf","file_name":"IST-2016-538-v1+1_2011-B-02-ApparentContour.pdf","relation":"main_file","file_size":210710,"access_level":"open_access","creator":"system","checksum":"f03a44c3d1c3e2d4fedb3b94404f3fd5","file_id":"4896"}],"month":"12","has_accepted_license":"1","language":[{"iso":"eng"}],"_id":"3795","type":"book_chapter","date_created":"2018-12-11T12:05:13Z","status":"public","pubrep_id":"538","citation":{"ieee":"H. Edelsbrunner, D. Morozov, and A. Patel, “The stability of the apparent contour of an orientable 2-manifold,” in <i>Topological Data Analysis and Visualization: Theory, Algorithms and Applications</i>, Springer, 2010, pp. 27–42.","apa":"Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2010). The stability of the apparent contour of an orientable 2-manifold. In <i>Topological Data Analysis and Visualization: Theory, Algorithms and Applications</i> (pp. 27–42). Springer. <a href=\"https://doi.org/10.1007/978-3-642-15014-2_3\">https://doi.org/10.1007/978-3-642-15014-2_3</a>","ista":"Edelsbrunner H, Morozov D, Patel A. 2010.The stability of the apparent contour of an orientable 2-manifold. In: Topological Data Analysis and Visualization: Theory, Algorithms and Applications. Mathematics and Visualization, , 27–42.","ama":"Edelsbrunner H, Morozov D, Patel A. The stability of the apparent contour of an orientable 2-manifold. In: <i>Topological Data Analysis and Visualization: Theory, Algorithms and Applications</i>. Springer; 2010:27-42. doi:<a href=\"https://doi.org/10.1007/978-3-642-15014-2_3\">10.1007/978-3-642-15014-2_3</a>","chicago":"Edelsbrunner, Herbert, Dmitriy Morozov, and Amit Patel. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” In <i>Topological Data Analysis and Visualization: Theory, Algorithms and Applications</i>, 27–42. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15014-2_3\">https://doi.org/10.1007/978-3-642-15014-2_3</a>.","mla":"Edelsbrunner, Herbert, et al. “The Stability of the Apparent Contour of an Orientable 2-Manifold.” <i>Topological Data Analysis and Visualization: Theory, Algorithms and Applications</i>, Springer, 2010, pp. 27–42, doi:<a href=\"https://doi.org/10.1007/978-3-642-15014-2_3\">10.1007/978-3-642-15014-2_3</a>.","short":"H. Edelsbrunner, D. Morozov, A. Patel, in:, Topological Data Analysis and Visualization: Theory, Algorithms and Applications, Springer, 2010, pp. 27–42."},"date_updated":"2021-01-12T07:52:15Z","department":[{"_id":"HeEd"}],"user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["Mathematics and Visualization"],"ddc":["000"],"abstract":[{"lang":"eng","text":"The (apparent) contour of a smooth mapping from a 2-manifold to the plane, f: M → R2 , is the set of critical values, that is, the image of the points at which the gradients of the two component functions are linearly dependent. Assuming M is compact and orientable and measuring difference with the erosion distance, we prove that the contour is stable."}],"publication_status":"published","title":"The stability of the apparent contour of an orientable 2-manifold","date_published":"2010-12-22T00:00:00Z","publisher":"Springer","file_date_updated":"2020-07-14T12:46:16Z","oa":1,"day":"22","page":"27 - 42","doi":"10.1007/978-3-642-15014-2_3","year":"2010","acknowledgement":"This research is partially supported by the Defense Advanced Research Projects Agency (DARPA) under grants HR0011-05-1-0007 and HR0011-05-1-0057.","scopus_import":1,"publication":"Topological Data Analysis and Visualization: Theory, Algorithms and Applications","publist_id":"2428"},{"publication":"Neuron","intvolume":"        66","publist_id":"2377","scopus_import":1,"day":"15","page":"8 - 10","year":"2010","doi":"10.1016/j.neuron.2010.04.003","oa":1,"title":"Beyond TARPs: The growing list of auxiliary AMPAR subunits","date_published":"2010-04-15T00:00:00Z","publisher":"Elsevier","pmid":1,"abstract":[{"text":"A recent paper by von Engelhardt et al. identifies a novel auxiliary subunit of native AMPARs, termedCKAMP44. Unlike other auxiliary subunits, CKAMP44 accelerates desensitization and prolongs recovery from desensitization. CKAMP44 is highly expressed in hippocampal dentate gyrus granule cells and decreases the paired-pulse ratio at perforant path input synapses. Thus, both principal and auxiliary AMPAR subunits control the time course of signaling at glutamatergic synapses.","lang":"eng"}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","external_id":{"pmid":["20399724"]},"citation":{"ieee":"J. Guzmán and P. M. Jonas, “Beyond TARPs: The growing list of auxiliary AMPAR subunits,” <i>Neuron</i>, vol. 66, no. 1. Elsevier, pp. 8–10, 2010.","chicago":"Guzmán, José, and Peter M Jonas. “Beyond TARPs: The Growing List of Auxiliary AMPAR Subunits.” <i>Neuron</i>. Elsevier, 2010. <a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">https://doi.org/10.1016/j.neuron.2010.04.003</a>.","ista":"Guzmán J, Jonas PM. 2010. Beyond TARPs: The growing list of auxiliary AMPAR subunits. Neuron. 66(1), 8–10.","ama":"Guzmán J, Jonas PM. Beyond TARPs: The growing list of auxiliary AMPAR subunits. <i>Neuron</i>. 2010;66(1):8-10. doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">10.1016/j.neuron.2010.04.003</a>","apa":"Guzmán, J., &#38; Jonas, P. M. (2010). Beyond TARPs: The growing list of auxiliary AMPAR subunits. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">https://doi.org/10.1016/j.neuron.2010.04.003</a>","mla":"Guzmán, José, and Peter M. Jonas. “Beyond TARPs: The Growing List of Auxiliary AMPAR Subunits.” <i>Neuron</i>, vol. 66, no. 1, Elsevier, 2010, pp. 8–10, doi:<a href=\"https://doi.org/10.1016/j.neuron.2010.04.003\">10.1016/j.neuron.2010.04.003</a>.","short":"J. Guzmán, P.M. Jonas, Neuron 66 (2010) 8–10."},"date_updated":"2021-01-12T07:52:31Z","department":[{"_id":"PeJo"}],"status":"public","main_file_link":[{"url":"https://www.ncbi.nlm.nih.gov/pubmed/20399724","open_access":"1"}],"type":"journal_article","_id":"3832","date_created":"2018-12-11T12:05:25Z","article_processing_charge":"No","volume":66,"language":[{"iso":"eng"}],"issue":"1","month":"04","author":[{"full_name":"Guzmán, José","id":"30CC5506-F248-11E8-B48F-1D18A9856A87","last_name":"Guzmán","first_name":"José"},{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","first_name":"Peter M","last_name":"Jonas"}],"oa_version":"Published Version","quality_controlled":"1"},{"article_processing_charge":"No","title":"GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &amp; Todorova)","volume":31,"publisher":"Wiley-Blackwell","language":[{"iso":"eng"}],"date_published":"2010-03-19T00:00:00Z","issue":"7","month":"03","publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Jonas, Peter M","id":"353C1B58-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-5001-4804","last_name":"Jonas","first_name":"Peter M"},{"full_name":"Hefft, Stefan","first_name":"Stefan","last_name":"Hefft"}],"citation":{"short":"P.M. Jonas, S. Hefft, The European Journal of Neuroscience 31 (2010) 1194–1195.","mla":"Jonas, Peter M., and Stefan Hefft. “GABA Release at Terminals of CCK-Interneurons: Synchrony, Asynchrony and Modulation by Cannabinoid Receptors (Commentary on Ali &#38;amp; Todorova).” <i>The European Journal of Neuroscience</i>, vol. 31, no. 7, Wiley-Blackwell, 2010, pp. 1194–95, doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">10.1111/j.1460-9568.2010.07189.x</a>.","ieee":"P. M. Jonas and S. Hefft, “GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova),” <i>The European Journal of Neuroscience</i>, vol. 31, no. 7. Wiley-Blackwell, pp. 1194–1195, 2010.","chicago":"Jonas, Peter M, and Stefan Hefft. “GABA Release at Terminals of CCK-Interneurons: Synchrony, Asynchrony and Modulation by Cannabinoid Receptors (Commentary on Ali &#38;amp; Todorova).” <i>The European Journal of Neuroscience</i>. Wiley-Blackwell, 2010. <a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">https://doi.org/10.1111/j.1460-9568.2010.07189.x</a>.","ista":"Jonas PM, Hefft S. 2010. GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). The European Journal of Neuroscience. 31(7), 1194–1195.","ama":"Jonas PM, Hefft S. GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). <i>The European Journal of Neuroscience</i>. 2010;31(7):1194-1195. doi:<a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">10.1111/j.1460-9568.2010.07189.x</a>","apa":"Jonas, P. M., &#38; Hefft, S. (2010). GABA release at terminals of CCK-interneurons: synchrony, asynchrony and modulation by cannabinoid receptors (commentary on Ali &#38;amp; Todorova). <i>The European Journal of Neuroscience</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1460-9568.2010.07189.x\">https://doi.org/10.1111/j.1460-9568.2010.07189.x</a>"},"oa_version":"None","date_updated":"2021-01-12T07:52:31Z","department":[{"_id":"PeJo"}],"quality_controlled":"1","publication":"The European Journal of Neuroscience","intvolume":"        31","publist_id":"2378","scopus_import":1,"day":"19","status":"public","year":"2010","page":"1194 - 1195","doi":"10.1111/j.1460-9568.2010.07189.x","type":"journal_article","_id":"3833","date_created":"2018-12-11T12:05:25Z"},{"month":"04","has_accepted_license":"1","file":[{"file_name":"IST-2012-72-v1+1_Solving_the_chemical_master_equation_using_sliding_windows.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:16:29Z","date_updated":"2020-07-14T12:46:16Z","file_id":"5217","checksum":"220239fae76f7b03c4d7f05d74ef426f","creator":"system","access_level":"open_access","file_size":1919130,"relation":"main_file"}],"issue":"42","language":[{"iso":"eng"}],"volume":4,"quality_controlled":"1","oa_version":"Published Version","author":[{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"},{"last_name":"Goel","first_name":"Rushil","full_name":"Goel, Rushil"},{"full_name":"Mateescu, Maria","id":"3B43276C-F248-11E8-B48F-1D18A9856A87","last_name":"Mateescu","first_name":"Maria"},{"orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87"}],"pubrep_id":"72","date_created":"2018-12-11T12:05:25Z","type":"journal_article","_id":"3834","status":"public","publication_status":"published","abstract":[{"text":"Background\r\n\r\nThe chemical master equation (CME) is a system of ordinary differential equations that describes the evolution of a network of chemical reactions as a stochastic process. Its solution yields the probability density vector of the system at each point in time. Solving the CME numerically is in many cases computationally expensive or even infeasible as the number of reachable states can be very large or infinite. We introduce the sliding window method, which computes an approximate solution of the CME by performing a sequence of local analysis steps. In each step, only a manageable subset of states is considered, representing a &quot;window&quot; into the state space. In subsequent steps, the window follows the direction in which the probability mass moves, until the time period of interest has elapsed. We construct the window based on a deterministic approximation of the future behavior of the system by estimating upper and lower bounds on the populations of the chemical species.\r\nResults\r\n\r\nIn order to show the effectiveness of our approach, we apply it to several examples previously described in the literature. The experimental results show that the proposed method speeds up the analysis considerably, compared to a global analysis, while still providing high accuracy.\r\n\r\n\r\nConclusions\r\n\r\nThe sliding window method is a novel approach to address the performance problems of numerical algorithms for the solution of the chemical master equation. The method efficiently approximates the probability distributions at the time points of interest for a variety of chemically reacting systems, including systems for which no upper bound on the population sizes of the chemical species is known a priori.","lang":"eng"}],"ddc":["005"],"date_published":"2010-04-08T00:00:00Z","file_date_updated":"2020-07-14T12:46:16Z","publisher":"BioMed Central","title":"Solving the chemical master equation using sliding windows","department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:52:32Z","citation":{"chicago":"Wolf, Verena, Rushil Goel, Maria Mateescu, and Thomas A Henzinger. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>. BioMed Central, 2010. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>.","ista":"Wolf V, Goel R, Mateescu M, Henzinger TA. 2010. Solving the chemical master equation using sliding windows. BMC Systems Biology. 4(42), 1–19.","ama":"Wolf V, Goel R, Mateescu M, Henzinger TA. Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. 2010;4(42):1-19. doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>","apa":"Wolf, V., Goel, R., Mateescu, M., &#38; Henzinger, T. A. (2010). Solving the chemical master equation using sliding windows. <i>BMC Systems Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1752-0509-4-42\">https://doi.org/10.1186/1752-0509-4-42</a>","ieee":"V. Wolf, R. Goel, M. Mateescu, and T. A. Henzinger, “Solving the chemical master equation using sliding windows,” <i>BMC Systems Biology</i>, vol. 4, no. 42. BioMed Central, pp. 1–19, 2010.","short":"V. Wolf, R. Goel, M. Mateescu, T.A. Henzinger, BMC Systems Biology 4 (2010) 1–19.","mla":"Wolf, Verena, et al. “Solving the Chemical Master Equation Using Sliding Windows.” <i>BMC Systems Biology</i>, vol. 4, no. 42, BioMed Central, 2010, pp. 1–19, doi:<a href=\"https://doi.org/10.1186/1752-0509-4-42\">10.1186/1752-0509-4-42</a>."},"user_id":"3E5EF7F0-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)"},"scopus_import":1,"publist_id":"2374","intvolume":"         4","publication":"BMC Systems Biology","oa":1,"acknowledgement":"This research has been partially funded by the Swiss National Science Foundation under grant 205321-111840 and by the Cluster of Excellence on Multimodal Computing and Interaction at Saarland University.","year":"2010","day":"08","page":"1 - 19","doi":"10.1186/1752-0509-4-42"},{"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"},{"first_name":"Linar","last_name":"Mikeev","full_name":"Mikeev, Linar"},{"first_name":"Verena","last_name":"Wolf","full_name":"Wolf, Verena"}],"oa_version":"Submitted Version","quality_controlled":"1","language":[{"iso":"eng"}],"file":[{"checksum":"81cb6f0babd97151b171d1ce86582831","file_id":"5179","creator":"system","access_level":"open_access","file_size":671790,"relation":"main_file","file_name":"IST-2012-68-v1+1_Hybrid_Numerical_Solution_of_the_Chemical_Master_Equation.pdf","content_type":"application/pdf","date_created":"2018-12-12T10:15:55Z","date_updated":"2020-07-14T12:46:16Z"}],"has_accepted_license":"1","month":"09","status":"public","type":"conference","_id":"3838","date_created":"2018-12-11T12:05:27Z","conference":{"location":"Trento, Italy","name":"CMSB: Computational Methods in Systems Biology","start_date":"2010-09-29","end_date":"2010-10-01"},"pubrep_id":"68","user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"ieee":"T. A. Henzinger, M. Mateescu, L. Mikeev, and V. Wolf, “Hybrid numerical solution of the chemical master equation,” presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy, 2010, pp. 55–65.","chicago":"Henzinger, Thomas A, Maria Mateescu, Linar Mikeev, and Verena Wolf. “Hybrid Numerical Solution of the Chemical Master Equation,” 55–65. Springer, 2010. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>.","ama":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. Hybrid numerical solution of the chemical master equation. In: Springer; 2010:55-65. doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>","ista":"Henzinger TA, Mateescu M, Mikeev L, Wolf V. 2010. Hybrid numerical solution of the chemical master equation. CMSB: Computational Methods in Systems Biology, 55–65.","apa":"Henzinger, T. A., Mateescu, M., Mikeev, L., &#38; Wolf, V. (2010). Hybrid numerical solution of the chemical master equation (pp. 55–65). Presented at the CMSB: Computational Methods in Systems Biology, Trento, Italy: Springer. <a href=\"https://doi.org/10.1145/1839764.1839772\">https://doi.org/10.1145/1839764.1839772</a>","short":"T.A. Henzinger, M. Mateescu, L. Mikeev, V. Wolf, in:, Springer, 2010, pp. 55–65.","mla":"Henzinger, Thomas A., et al. <i>Hybrid Numerical Solution of the Chemical Master Equation</i>. Springer, 2010, pp. 55–65, doi:<a href=\"https://doi.org/10.1145/1839764.1839772\">10.1145/1839764.1839772</a>."},"date_updated":"2021-01-12T07:52:33Z","department":[{"_id":"ToHe"}],"title":"Hybrid numerical solution of the chemical master equation","date_published":"2010-09-29T00:00:00Z","file_date_updated":"2020-07-14T12:46:16Z","publisher":"Springer","ddc":["004"],"abstract":[{"lang":"eng","text":"We present a numerical approximation technique for the analysis of continuous-time Markov chains that describe net- works of biochemical reactions and play an important role in the stochastic modeling of biological systems. Our approach is based on the construction of a stochastic hybrid model in which certain discrete random variables of the original Markov chain are approximated by continuous deterministic variables. We compute the solution of the stochastic hybrid model using a numerical algorithm that discretizes time and in each step performs a mutual update of the transient prob- ability distribution of the discrete stochastic variables and the values of the continuous deterministic variables. We im- plemented the algorithm and we demonstrate its usefulness and efficiency on several case studies from systems biology."}],"publication_status":"published","day":"29","page":"55 - 65","doi":"10.1145/1839764.1839772","year":"2010","oa":1,"publist_id":"2356","scopus_import":1},{"volume":5944,"language":[{"iso":"eng"}],"file":[{"date_created":"2018-12-12T10:13:09Z","date_updated":"2020-07-14T12:46:16Z","content_type":"application/pdf","file_name":"IST-2012-69-v1+1_Invariant_and_type_inference_for_matrices.pdf","relation":"main_file","access_level":"open_access","file_size":251265,"file_id":"4989","checksum":"da69b13a2d9a7a316c909e09c1090cef","creator":"system"}],"has_accepted_license":"1","month":"01","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"},{"last_name":"Hottelier","first_name":"Thibaud","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","first_name":"Laura","last_name":"Kovács"},{"full_name":"Voronkov, Andrei","first_name":"Andrei","last_name":"Voronkov"}],"oa_version":"Submitted Version","quality_controlled":"1","conference":{"name":"VMCAI: Verification, Model Checking and Abstract Interpretation","location":"Madrid, Spain","start_date":"2010-01-17","end_date":"2010-01-19"},"pubrep_id":"69","status":"public","_id":"3839","type":"conference","date_created":"2018-12-11T12:05:27Z","title":"Invariant and type inference for matrices","publisher":"Springer","date_published":"2010-01-01T00:00:00Z","file_date_updated":"2020-07-14T12:46:16Z","ddc":["005"],"abstract":[{"lang":"eng","text":"We present a loop property generation method for loops iterating over multi-dimensional arrays. When used on matrices, our method is able to infer their shapes (also called types), such as upper-triangular, diagonal, etc. To gen- erate loop properties, we first transform a nested loop iterating over a multi- dimensional array into an equivalent collection of unnested loops. Then, we in- fer quantified loop invariants for each unnested loop using a generalization of a recurrence-based invariant generation technique. These loop invariants give us conditions on matrices from which we can derive matrix types automatically us- ing theorem provers. Invariant generation is implemented in the software package Aligator and types are derived by theorem provers and SMT solvers, including Vampire and Z3. When run on the Java matrix package JAMA, our tool was able to infer automatically all matrix types describing the matrix shapes guaranteed by JAMA’s API."}],"publication_status":"published","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"citation":{"mla":"Henzinger, Thomas A., et al. <i>Invariant and Type Inference for Matrices</i>. Vol. 5944, Springer, 2010, pp. 163–79, doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Voronkov, in:, Springer, 2010, pp. 163–179.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Voronkov, A. (2010). Invariant and type inference for matrices (Vol. 5944, pp. 163–179). Presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain: Springer. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrei Voronkov. “Invariant and Type Inference for Matrices,” 5944:163–79. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">https://doi.org/10.1007/978-3-642-11319-2_14</a>.","ama":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. Invariant and type inference for matrices. In: Vol 5944. Springer; 2010:163-179. doi:<a href=\"https://doi.org/10.1007/978-3-642-11319-2_14\">10.1007/978-3-642-11319-2_14</a>","ista":"Henzinger TA, Hottelier T, Kovács L, Voronkov A. 2010. Invariant and type inference for matrices. VMCAI: Verification, Model Checking and Abstract Interpretation, LNCS, vol. 5944, 163–179.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Voronkov, “Invariant and type inference for matrices,” presented at the VMCAI: Verification, Model Checking and Abstract Interpretation, Madrid, Spain, 2010, vol. 5944, pp. 163–179."},"date_updated":"2021-01-12T07:52:33Z","department":[{"_id":"ToHe"}],"intvolume":"      5944","publist_id":"2357","scopus_import":1,"day":"01","doi":"10.1007/978-3-642-11319-2_14","page":"163 - 179","year":"2010","acknowledgement":"The research was supported by the Swiss NSF.","oa":1},{"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","first_name":"Thomas A","last_name":"Henzinger"}],"citation":{"ama":"Henzinger TA. From boolean to quantitative notions of correctness. In: Vol 45. ACM; 2010:157-158. doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>","ista":"Henzinger TA. 2010. From boolean to quantitative notions of correctness. POPL: Principles of Programming Languages vol. 45, 157–158.","chicago":"Henzinger, Thomas A. “From Boolean to Quantitative Notions of Correctness,” 45:157–58. ACM, 2010. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>.","apa":"Henzinger, T. A. (2010). From boolean to quantitative notions of correctness (Vol. 45, pp. 157–158). Presented at the POPL: Principles of Programming Languages, Madrid, Spain: ACM. <a href=\"https://doi.org/10.1145/1706299.1706319\">https://doi.org/10.1145/1706299.1706319</a>","ieee":"T. A. Henzinger, “From boolean to quantitative notions of correctness,” presented at the POPL: Principles of Programming Languages, Madrid, Spain, 2010, vol. 45, no. 1, pp. 157–158.","short":"T.A. Henzinger, in:, ACM, 2010, pp. 157–158.","mla":"Henzinger, Thomas A. <i>From Boolean to Quantitative Notions of Correctness</i>. Vol. 45, no. 1, ACM, 2010, pp. 157–58, doi:<a href=\"https://doi.org/10.1145/1706299.1706319\">10.1145/1706299.1706319</a>."},"oa_version":"None","date_updated":"2021-01-12T07:52:34Z","quality_controlled":"1","department":[{"_id":"ToHe"}],"title":"From boolean to quantitative notions of correctness","volume":45,"language":[{"iso":"eng"}],"publisher":"ACM","date_published":"2010-01-17T00:00:00Z","issue":"1","abstract":[{"lang":"eng","text":"Classical formalizations of systems and properties are boolean: given a system and a property, the property is either true or false of the system. Correspondingly, classical methods for system analysis determine the truth value of a property, preferably giving a proof if the property is true, and a counterexample if the property is false; classical methods for system synthesis construct a system for which a property is true; classical methods for system transformation, composition, and abstraction aim to preserve the truth of properties. The boolean view is prevalent even if the system, the property, or both refer to numerical quantities, such as the times or probabilities of events. For example, a timed automaton either satisfies or violates a formula of a real-time logic; a stochastic process either satisfies or violates a formula of a probabilistic logic. The classical black-and-white view partitions the world into \"correct\" and \"incorrect\" systems, offering few nuances. In reality, of several systems that satisfy a property in the boolean sense, often some are more desirable than others, and of the many systems that violate a property, usually some are less objectionable than others. For instance, among the systems that satisfy the response property that every request be granted, we may prefer systems that grant requests quickly (the quicker, the better), or we may prefer systems that issue few unnecessary grants (the fewer, the better); and among the systems that violate the response property, we may prefer systems that serve many initial requests (the more, the better), or we may prefer systems that serve many requests in the long run (the greater the fraction of served to unserved requests, the better). Formally, while a boolean notion of correctness is given by a preorder on systems and properties, a quantitative notion of correctness is defined by a directed metric on systems and properties, where the distance between a system and a property provides a measure of \"fit\" or \"desirability.\" There are many ways how such distances can be defined. In a linear-time framework, one assigns numerical values to individual behaviors before assigning values to systems and properties, which are sets of behaviors. For example, the value of a single behavior may be a discounted value, which is largely determined by a prefix of the behavior, e.g., by the number of requests that are granted before the first request that is not granted; or a limit value, which is independent of any finite prefix. A limit value may be an average, such as the average response time over an infinite sequence of requests and grants, or a supremum, such as the worst-case response time. Similarly, the value of a set of behaviors may be an extremum or an average across the values of all behaviors in the set: in this way one can measure the worst of all possible average-case response times, or the average of all possible worst-case response times, etc. Accordingly, the distance between two sets of behaviors may be defined as the worst or average difference between the values of corresponding behaviors. In summary, we propagate replacing boolean specifications for the correctness of systems with quantitative measures for the desirability of systems. In quantitative analysis, the aim is to compute the distance between a system and a property (or between two systems, or two properties); in quantitative synthesis, the objective is to construct a system that has minimal distance from a given property. Multiple quantitative measures can be prioritized (e.g., combined lexicographically into a single measure) or studied along the Pareto curve. Quantitative transformations, compositions, and abstractions of systems are useful if they allow us to bound the induced change in distance from a property. We present some initial results in some of these directions. We also give some potential applications, which not only generalize tradiditional correctness concerns in the functional, timed, and probabilistic domains, but also capture such system measures as resource use, performance, cost, reliability, and robustness."}],"month":"01","publication_status":"published","status":"public","doi":"10.1145/1706299.1706319","year":"2010","day":"17","page":"157 - 158","acknowledgement":"This talk surveys joint work with Roderick Bloem, Krishnendu Chatterjee, Laurent Doyen, and Barbara Jobstmann.","type":"conference","_id":"3840","date_created":"2018-12-11T12:05:27Z","intvolume":"        45","conference":{"location":"Madrid, Spain","name":"POPL: Principles of Programming Languages","end_date":"2010-01-23","start_date":"2010-01-17"},"publist_id":"2354","scopus_import":1},{"issue":"6","file":[{"relation":"main_file","file_size":222890,"access_level":"open_access","creator":"system","checksum":"9a3bde48f43203991a0b3c6a277c2f5b","file_id":"5254","date_updated":"2020-07-14T12:46:16Z","date_created":"2018-12-12T10:17:02Z","content_type":"application/pdf","file_name":"IST-2012-66-v1+1_Fast_adaptive_uniformization_of_the_chemical_master_equation.pdf"}],"month":"11","has_accepted_license":"1","volume":4,"language":[{"iso":"eng"}],"oa_version":"Submitted Version","quality_controlled":"1","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Maria","last_name":"Mateescu","full_name":"Mateescu, Maria"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"pubrep_id":"66","_id":"3842","type":"journal_article","date_created":"2018-12-11T12:05:28Z","status":"public","ddc":["570"],"abstract":[{"lang":"eng","text":"Within systems biology there is an increasing interest in the stochastic behavior of biochemical reaction networks. An appropriate stochastic description is provided by the chemical master equation, which represents a continuous-time Markov chain (CTMC). The uniformization technique is an efficient method to compute probability distributions of a CTMC if the number of states is manageable. However, the size of a CTMC that represents a biochemical reaction network is usually far beyond what is feasible. In this paper we present an on-the-fly variant of uniformization, where we improve the original algorithm at the cost of a small approximation error. By means of several examples, we show that our approach is particularly well-suited for biochemical reaction networks."}],"publication_status":"published","title":"Fast adaptive uniformization of the chemical master equation","publisher":"Institution of Engineering and Technology","date_published":"2010-11-15T00:00:00Z","file_date_updated":"2020-07-14T12:46:16Z","citation":{"mla":"Didier, Frédéric, et al. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>, vol. 4, no. 6, Institution of Engineering and Technology, 2010, pp. 441–52, doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>.","short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, IET Systems Biology 4 (2010) 441–452.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “Fast Adaptive Uniformization of the Chemical Master Equation.” <i>IET Systems Biology</i>. Institution of Engineering and Technology, 2010. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. Fast adaptive uniformization of the chemical master equation. IET Systems Biology. 4(6), 441–452.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. 2010;4(6):441-452. doi:<a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">10.1049/iet-syb.2010.0005</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). Fast adaptive uniformization of the chemical master equation. <i>IET Systems Biology</i>. Institution of Engineering and Technology. <a href=\"https://doi.org/10.1049/iet-syb.2010.0005\">https://doi.org/10.1049/iet-syb.2010.0005</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “Fast adaptive uniformization of the chemical master equation,” <i>IET Systems Biology</i>, vol. 4, no. 6. Institution of Engineering and Technology, pp. 441–452, 2010."},"date_updated":"2023-02-23T11:45:08Z","department":[{"_id":"ToHe"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","related_material":{"record":[{"id":"3843","relation":"earlier_version","status":"public"}]},"scopus_import":1,"publication":"IET Systems Biology","intvolume":"         4","publist_id":"2349","oa":1,"day":"15","year":"2010","page":"441 - 452","doi":"10.1049/iet-syb.2010.0005"},{"quality_controlled":"1","oa_version":"Submitted Version","author":[{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724"},{"first_name":"Thibaud","last_name":"Hottelier","full_name":"Hottelier, Thibaud"},{"full_name":"Kovács, Laura","last_name":"Kovács","first_name":"Laura"},{"last_name":"Rybalchenko","first_name":"Andrey","full_name":"Rybalchenko, Andrey"}],"has_accepted_license":"1","month":"10","file":[{"file_name":"IST-2012-64-v1+1_Aligators_for_arrays.pdf","date_created":"2018-12-12T10:10:05Z","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","access_level":"open_access","file_size":186143,"checksum":"913af269da6710f2174f470b48ab7a82","file_id":"4790","creator":"system","relation":"main_file"}],"language":[{"iso":"eng"}],"volume":6397,"date_created":"2018-12-11T12:05:29Z","_id":"3845","type":"conference","status":"public","pubrep_id":"64","conference":{"start_date":"2010-10-10","end_date":"2010-10-15","name":"LPAR: Logic for Programming, Artificial Intelligence, and Reasoning","location":"Yogyakarta, Indonesia"},"department":[{"_id":"ToHe"}],"date_updated":"2021-01-12T07:52:37Z","citation":{"mla":"Henzinger, Thomas A., et al. <i>Aligators for Arrays</i>. Vol. 6397, Springer, 2010, pp. 348–56, doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>.","short":"T.A. Henzinger, T. Hottelier, L. Kovács, A. Rybalchenko, in:, Springer, 2010, pp. 348–356.","ieee":"T. A. Henzinger, T. Hottelier, L. Kovács, and A. Rybalchenko, “Aligators for arrays,” presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia, 2010, vol. 6397, pp. 348–356.","ama":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. Aligators for arrays. In: Vol 6397. Springer; 2010:348-356. doi:<a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">10.1007/978-3-642-16242-8_25</a>","ista":"Henzinger TA, Hottelier T, Kovács L, Rybalchenko A. 2010. Aligators for arrays. LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, LNCS, vol. 6397, 348–356.","chicago":"Henzinger, Thomas A, Thibaud Hottelier, Laura Kovács, and Andrey Rybalchenko. “Aligators for Arrays,” 6397:348–56. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>.","apa":"Henzinger, T. A., Hottelier, T., Kovács, L., &#38; Rybalchenko, A. (2010). Aligators for arrays (Vol. 6397, pp. 348–356). Presented at the LPAR: Logic for Programming, Artificial Intelligence, and Reasoning, Yogyakarta, Indonesia: Springer. <a href=\"https://doi.org/10.1007/978-3-642-16242-8_25\">https://doi.org/10.1007/978-3-642-16242-8_25</a>"},"alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"text":"This paper presents Aligators, a tool for the generation of universally quantified array invariants. Aligators leverages recurrence solving and algebraic techniques to carry out inductive reasoning over array content. The Aligators’ loop extraction module allows treatment of multi-path loops by exploiting their commutativity and serializability properties. Our experience in applying Aligators on a collection of loops from open source software projects indicates the applicability of recurrence and algebraic solving techniques for reasoning about arrays.","lang":"eng"}],"ddc":["005"],"date_published":"2010-10-01T00:00:00Z","publisher":"Springer","file_date_updated":"2020-07-14T12:46:17Z","title":"Aligators for arrays","oa":1,"day":"01","page":"348 - 356","year":"2010","doi":"10.1007/978-3-642-16242-8_25","scopus_import":1,"publist_id":"2342","intvolume":"      6397"},{"date_created":"2018-12-11T12:05:29Z","_id":"3847","type":"conference","status":"public","pubrep_id":"63","conference":{"start_date":"2010-09-15","end_date":"2010-09-18","location":"Williamsburg, USA","name":"QEST: Quantitative Evaluation of Systems"},"quality_controlled":"1","oa_version":"Submitted Version","author":[{"last_name":"Didier","first_name":"Frédéric","full_name":"Didier, Frédéric"},{"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","last_name":"Mateescu","first_name":"Maria"},{"last_name":"Wolf","first_name":"Verena","full_name":"Wolf, Verena"}],"has_accepted_license":"1","month":"10","file":[{"date_created":"2018-12-12T10:09:03Z","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","file_name":"IST-2012-63-v1+1_SABRE-A_tool_for_the_stochastic_analysis_of_biochemical_reaction_networks.pdf","relation":"main_file","access_level":"open_access","file_size":433824,"file_id":"4726","checksum":"38707b149d2174f01be406e794ffa849","creator":"system"}],"language":[{"iso":"eng"}],"oa":1,"page":"193 - 194","day":"14","year":"2010","doi":"10.1109/QEST.2010.33","scopus_import":1,"publist_id":"2339","department":[{"_id":"ToHe"},{"_id":"CaGu"}],"date_updated":"2021-01-12T07:52:37Z","citation":{"short":"F. Didier, T.A. Henzinger, M. Mateescu, V. Wolf, in:, IEEE, 2010, pp. 193–194.","mla":"Didier, Frédéric, et al. <i>SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks</i>. IEEE, 2010, pp. 193–94, doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>.","ista":"Didier F, Henzinger TA, Mateescu M, Wolf V. 2010. SABRE: A tool for the stochastic analysis of biochemical reaction networks. QEST: Quantitative Evaluation of Systems, 193–194.","chicago":"Didier, Frédéric, Thomas A Henzinger, Maria Mateescu, and Verena Wolf. “SABRE: A Tool for the Stochastic Analysis of Biochemical Reaction Networks,” 193–94. IEEE, 2010. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>.","ama":"Didier F, Henzinger TA, Mateescu M, Wolf V. SABRE: A tool for the stochastic analysis of biochemical reaction networks. In: IEEE; 2010:193-194. doi:<a href=\"https://doi.org/10.1109/QEST.2010.33\">10.1109/QEST.2010.33</a>","apa":"Didier, F., Henzinger, T. A., Mateescu, M., &#38; Wolf, V. (2010). SABRE: A tool for the stochastic analysis of biochemical reaction networks (pp. 193–194). Presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA: IEEE. <a href=\"https://doi.org/10.1109/QEST.2010.33\">https://doi.org/10.1109/QEST.2010.33</a>","ieee":"F. Didier, T. A. Henzinger, M. Mateescu, and V. Wolf, “SABRE: A tool for the stochastic analysis of biochemical reaction networks,” presented at the QEST: Quantitative Evaluation of Systems, Williamsburg, USA, 2010, pp. 193–194."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","publication_status":"published","abstract":[{"lang":"eng","text":"The importance of stochasticity within biological systems has been shown repeatedly during the last years and has raised the need for efficient stochastic tools. We present SABRE, a tool for stochastic analysis of biochemical reaction networks. SABRE implements fast adaptive uniformization (FAU), a direct numerical approximation algorithm for computing transient solutions of biochemical reaction networks. Biochemical reactions networks represent biological systems studied at a molecular level and these reactions can be modeled as transitions of a Markov chain. SABRE accepts as input the formalism of guarded commands, which it interprets either as continuous-time or as discrete-time Markov chains. Besides operating in a stochastic mode, SABRE may also perform a deterministic analysis by directly computing a mean-field approximation of the system under study. We illustrate the different functionalities of SABRE by means of biological case studies."}],"ddc":["004"],"file_date_updated":"2020-07-14T12:46:17Z","date_published":"2010-10-14T00:00:00Z","publisher":"IEEE","title":"SABRE: A tool for the stochastic analysis of biochemical reaction networks"},{"conference":{"name":"ESA: European Symposium on Algorithms","location":"Liverpool, UK","start_date":"2010-09-06","end_date":"2010-09-08"},"publist_id":"2336","intvolume":"      6346","scopus_import":1,"year":"2010","page":"1 - 10","doi":"10.1007/978-3-642-15775-2_1","status":"public","day":"01","date_created":"2018-12-11T12:05:30Z","type":"conference","_id":"3848","date_published":"2010-09-01T00:00:00Z","publisher":"Springer","language":[{"iso":"eng"}],"title":"The robustness of level sets","volume":6346,"publication_status":"published","month":"09","abstract":[{"lang":"eng","text":"We define the robustness of a level set homology class of a function f:XR as the magnitude of a perturbation necessary to kill the class. Casting this notion into a group theoretic framework, we compute the robustness for each class, using a connection to extended persistent homology. The special case X=R3 has ramifications in medical imaging and scientific visualization."}],"author":[{"last_name":"Bendich","first_name":"Paul","full_name":"Bendich, Paul","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-9823-6833","last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Morozov","first_name":"Dmitriy","full_name":"Morozov, Dmitriy"},{"last_name":"Patel","first_name":"Amit","full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87"}],"alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"HeEd"}],"quality_controlled":"1","date_updated":"2021-01-12T07:52:38Z","oa_version":"None","citation":{"ista":"Bendich P, Edelsbrunner H, Morozov D, Patel A. 2010. The robustness of level sets. ESA: European Symposium on Algorithms, LNCS, vol. 6346, 1–10.","ama":"Bendich P, Edelsbrunner H, Morozov D, Patel A. The robustness of level sets. In: Vol 6346. Springer; 2010:1-10. doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>","chicago":"Bendich, Paul, Herbert Edelsbrunner, Dmitriy Morozov, and Amit Patel. “The Robustness of Level Sets,” 6346:1–10. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>.","apa":"Bendich, P., Edelsbrunner, H., Morozov, D., &#38; Patel, A. (2010). The robustness of level sets (Vol. 6346, pp. 1–10). Presented at the ESA: European Symposium on Algorithms, Liverpool, UK: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">https://doi.org/10.1007/978-3-642-15775-2_1</a>","ieee":"P. Bendich, H. Edelsbrunner, D. Morozov, and A. Patel, “The robustness of level sets,” presented at the ESA: European Symposium on Algorithms, Liverpool, UK, 2010, vol. 6346, pp. 1–10.","short":"P. Bendich, H. Edelsbrunner, D. Morozov, A. Patel, in:, Springer, 2010, pp. 1–10.","mla":"Bendich, Paul, et al. <i>The Robustness of Level Sets</i>. Vol. 6346, Springer, 2010, pp. 1–10, doi:<a href=\"https://doi.org/10.1007/978-3-642-15775-2_1\">10.1007/978-3-642-15775-2_1</a>."}},{"status":"public","_id":"3849","type":"conference","date_created":"2018-12-11T12:05:30Z","conference":{"name":"MFCS: Mathematical Foundations of Computer Science","location":"Brno, Czech Republic","start_date":"2010-08-23","end_date":"2010-08-27"},"pubrep_id":"537","author":[{"first_name":"Paul","last_name":"Bendich","id":"43F6EC54-F248-11E8-B48F-1D18A9856A87","full_name":"Bendich, Paul"},{"id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","full_name":"Edelsbrunner, Herbert","last_name":"Edelsbrunner","first_name":"Herbert","orcid":"0000-0002-9823-6833"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299"},{"full_name":"Patel, Amit","id":"34A254A0-F248-11E8-B48F-1D18A9856A87","first_name":"Amit","last_name":"Patel"}],"oa_version":"Submitted Version","quality_controlled":"1","volume":6281,"language":[{"iso":"eng"}],"file":[{"content_type":"application/pdf","date_created":"2018-12-12T10:13:13Z","date_updated":"2020-07-14T12:46:17Z","file_name":"IST-2016-537-v1+1_2010-P-05-NonuniformError.pdf","relation":"main_file","file_id":"4994","checksum":"af61e1c2bb42f3d556179d4692caeb1b","creator":"system","access_level":"open_access","file_size":142357}],"month":"08","has_accepted_license":"1","doi":"10.1007/978-3-642-15155-2_2","page":"12 - 23","day":"10","year":"2010","oa":1,"publist_id":"2333","intvolume":"      6281","scopus_import":1,"alternative_title":["LNCS"],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","citation":{"short":"P. Bendich, H. Edelsbrunner, M. Kerber, A. Patel, in:, Springer, 2010, pp. 12–23.","mla":"Bendich, Paul, et al. <i>Persistent Homology under Non-Uniform Error</i>. Vol. 6281, Springer, 2010, pp. 12–23, doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>.","apa":"Bendich, P., Edelsbrunner, H., Kerber, M., &#38; Patel, A. (2010). Persistent homology under non-uniform error (Vol. 6281, pp. 12–23). Presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic: Springer. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>","chicago":"Bendich, Paul, Herbert Edelsbrunner, Michael Kerber, and Amit Patel. “Persistent Homology under Non-Uniform Error,” 6281:12–23. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">https://doi.org/10.1007/978-3-642-15155-2_2</a>.","ista":"Bendich P, Edelsbrunner H, Kerber M, Patel A. 2010. Persistent homology under non-uniform error. MFCS: Mathematical Foundations of Computer Science, LNCS, vol. 6281, 12–23.","ama":"Bendich P, Edelsbrunner H, Kerber M, Patel A. Persistent homology under non-uniform error. In: Vol 6281. Springer; 2010:12-23. doi:<a href=\"https://doi.org/10.1007/978-3-642-15155-2_2\">10.1007/978-3-642-15155-2_2</a>","ieee":"P. Bendich, H. Edelsbrunner, M. Kerber, and A. Patel, “Persistent homology under non-uniform error,” presented at the MFCS: Mathematical Foundations of Computer Science, Brno, Czech Republic, 2010, vol. 6281, pp. 12–23."},"department":[{"_id":"HeEd"}],"date_updated":"2021-01-12T07:52:38Z","title":"Persistent homology under non-uniform error","file_date_updated":"2020-07-14T12:46:17Z","publisher":"Springer","date_published":"2010-08-10T00:00:00Z","ddc":["000"],"publication_status":"published","abstract":[{"text":"Using ideas from persistent homology, the robustness of a level set of a real-valued function is defined in terms of the magnitude of the perturbation necessary to kill the classes. Prior work has shown that the homology and robustness information can be read off the extended persistence diagram of the function. This paper extends these results to a non-uniform error model in which perturbations vary in their magnitude across the domain.","lang":"eng"}]},{"publist_id":"2334","conference":{"location":"Dortmund, Germany","name":"EuroCG: European Workshop on Computational Geometry","start_date":"2010-03-22","end_date":"2010-03-24"},"date_created":"2018-12-11T12:05:30Z","_id":"3850","type":"conference","day":"01","page":"12 - 23","year":"2010","status":"public","abstract":[{"text":"Given a polygonal shape Q with n vertices, can it be expressed, up to a tolerance ε in Hausdorff distance, as the Minkowski sum of another polygonal shape with a disk of fixed radius? If it does, we also seek a preferably simple solution shape P;P’s offset constitutes an accurate, vertex-reduced, and smoothened approximation of Q. We give a decision algorithm for fixed radius in O(nlogn) time that handles any polygonal shape. For convex shapes, the complexity drops to O(n), which is also the time required to compute a solution shape P with at most one more vertex than a vertex-minimal one.","lang":"eng"}],"publication_status":"published","month":"01","language":[{"iso":"eng"}],"date_published":"2010-01-01T00:00:00Z","publisher":"TU Dortmund","title":"Polygonal reconstruction from approximate offsets","date_updated":"2021-01-12T07:52:39Z","quality_controlled":"1","department":[{"_id":"HeEd"}],"oa_version":"None","citation":{"ieee":"E. Berberich, D. Halperin, M. Kerber, and R. Pogalnikova, “Polygonal reconstruction from approximate offsets,” presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany, 2010, pp. 12–23.","apa":"Berberich, E., Halperin, D., Kerber, M., &#38; Pogalnikova, R. (2010). Polygonal reconstruction from approximate offsets (pp. 12–23). Presented at the EuroCG: European Workshop on Computational Geometry, Dortmund, Germany: TU Dortmund.","ama":"Berberich E, Halperin D, Kerber M, Pogalnikova R. Polygonal reconstruction from approximate offsets. In: TU Dortmund; 2010:12-23.","ista":"Berberich E, Halperin D, Kerber M, Pogalnikova R. 2010. Polygonal reconstruction from approximate offsets. EuroCG: European Workshop on Computational Geometry, 12–23.","chicago":"Berberich, Eric, Dan Halperin, Michael Kerber, and Roza Pogalnikova. “Polygonal Reconstruction from Approximate Offsets,” 12–23. TU Dortmund, 2010.","short":"E. Berberich, D. Halperin, M. Kerber, R. Pogalnikova, in:, TU Dortmund, 2010, pp. 12–23.","mla":"Berberich, Eric, et al. <i>Polygonal Reconstruction from Approximate Offsets</i>. TU Dortmund, 2010, pp. 12–23."},"author":[{"full_name":"Berberich, Eric","first_name":"Eric","last_name":"Berberich"},{"first_name":"Dan","last_name":"Halperin","full_name":"Halperin, Dan"},{"id":"36E4574A-F248-11E8-B48F-1D18A9856A87","full_name":"Kerber, Michael","last_name":"Kerber","first_name":"Michael","orcid":"0000-0002-8030-9299"},{"first_name":"Roza","last_name":"Pogalnikova","full_name":"Pogalnikova, Roza"}],"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87"},{"quality_controlled":"1","oa_version":"Preprint","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"}],"month":"09","language":[{"iso":"eng"}],"volume":6199,"date_created":"2018-12-11T12:05:31Z","_id":"3851","type":"conference","main_file_link":[{"url":"http://arxiv.org/abs/1001.5183","open_access":"1"}],"status":"public","conference":{"start_date":"2010-07-06","end_date":"2010-07-10","name":" ICALP: Automata, Languages and Programming, 37th International Colloquium","location":"Bordeaux, France"},"date_updated":"2023-02-23T11:06:35Z","department":[{"_id":"KrCh"}],"citation":{"ieee":"K. Chatterjee and L. Doyen, “Energy parity games,” presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France, 2010, vol. 6199, pp. 599–610.","ista":"Chatterjee K, Doyen L. 2010. Energy parity games.  ICALP: Automata, Languages and Programming, 37th International Colloquium, LNCS, vol. 6199, 599–610.","chicago":"Chatterjee, Krishnendu, and Laurent Doyen. “Energy Parity Games,” 6199:599–610. Springer, 2010. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>.","ama":"Chatterjee K, Doyen L. Energy parity games. In: Vol 6199. Springer; 2010:599-610. doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>","apa":"Chatterjee, K., &#38; Doyen, L. (2010). Energy parity games (Vol. 6199, pp. 599–610). Presented at the  ICALP: Automata, Languages and Programming, 37th International Colloquium, Bordeaux, France: Springer. <a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">https://doi.org/10.1007/978-3-642-14162-1_50</a>","mla":"Chatterjee, Krishnendu, and Laurent Doyen. <i>Energy Parity Games</i>. Vol. 6199, Springer, 2010, pp. 599–610, doi:<a href=\"https://doi.org/10.1007/978-3-642-14162-1_50\">10.1007/978-3-642-14162-1_50</a>.","short":"K. Chatterjee, L. Doyen, in:, Springer, 2010, pp. 599–610."},"user_id":"4435EBFC-F248-11E8-B48F-1D18A9856A87","alternative_title":["LNCS"],"external_id":{"arxiv":["1001.5183"]},"abstract":[{"text":"Energy parity games are infinite two-player turn-based games played on weighted graphs. The objective of the game combines a (qualitative) parity condition with the (quantitative) requirement that the sum of the weights (i.e., the level of energy in the game) must remain positive. Beside their own interest in the design and synthesis of resource-constrained omega-regular specifications, energy parity games provide one of the simplest model of games with combined qualitative and quantitative objective. Our main results are as follows: (a) exponential memory is sufficient and may be necessary for winning strategies in energy parity games; (b) the problem of deciding the winner in energy parity games can be solved in NP ∩ coNP; and (c) we give an algorithm to solve energy parity by reduction to energy games. We also show that the problem of deciding the winner in energy parity games is polynomially equivalent to the problem of deciding the winner in mean-payoff parity games, which can thus be solved in NP ∩ coNP. As a consequence we also obtain a conceptually simple algorithm to solve mean-payoff parity games.","lang":"eng"}],"publication_status":"published","publisher":"Springer","date_published":"2010-09-10T00:00:00Z","title":"Energy parity games","oa":1,"page":"599 - 610","doi":"10.1007/978-3-642-14162-1_50","year":"2010","day":"10","related_material":{"record":[{"id":"2972","relation":"later_version","status":"public"}]},"scopus_import":1,"intvolume":"      6199","publist_id":"2330","arxiv":1},{"intvolume":"        25","publist_id":"2329","arxiv":1,"scopus_import":"1","day":"08","doi":"10.4204/EPTCS.25.6","year":"2010","page":"22 - 29","oa":1,"title":"Discounting in games across time scales","file_date_updated":"2020-07-14T12:46:17Z","publisher":"EPTCS","date_published":"2010-06-08T00:00:00Z","ddc":["000"],"abstract":[{"text":"We introduce two-level discounted games played by two players on a perfect-information stochastic game graph. The upper level game is a discounted game and the lower level game is an undiscounted reachability game. Two-level games model hierarchical and sequential decision making under uncertainty across different time scales. We show the existence of pure memoryless optimal strategies for both players and an ordered field property for such games. We show that if there is only one player (Markov decision processes), then the values can be computed in polynomial time. It follows that whether the value of a player is equal to a given rational constant in two-level discounted games can be decided in NP intersected coNP. We also give an alternate strategy improvement algorithm to compute the value. ","lang":"eng"}],"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","external_id":{"arxiv":["1006.1403"]},"alternative_title":["EPTCS"],"citation":{"ieee":"K. Chatterjee and R. Majumdar, “Discounting in games across time scales,” presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy, 2010, vol. 25, pp. 22–29.","ista":"Chatterjee K, Majumdar R. 2010. Discounting in games across time scales. GandALF: Games, Automata, Logic, and Formal Verification, EPTCS, vol. 25, 22–29.","ama":"Chatterjee K, Majumdar R. Discounting in games across time scales. In: Vol 25. EPTCS; 2010:22-29. doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>","chicago":"Chatterjee, Krishnendu, and Ritankar Majumdar. “Discounting in Games across Time Scales,” 25:22–29. EPTCS, 2010. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>.","apa":"Chatterjee, K., &#38; Majumdar, R. (2010). Discounting in games across time scales (Vol. 25, pp. 22–29). Presented at the GandALF: Games, Automata, Logic, and Formal Verification, Minori, Italy: EPTCS. <a href=\"https://doi.org/10.4204/EPTCS.25.6\">https://doi.org/10.4204/EPTCS.25.6</a>","mla":"Chatterjee, Krishnendu, and Ritankar Majumdar. <i>Discounting in Games across Time Scales</i>. Vol. 25, EPTCS, 2010, pp. 22–29, doi:<a href=\"https://doi.org/10.4204/EPTCS.25.6\">10.4204/EPTCS.25.6</a>.","short":"K. Chatterjee, R. Majumdar, in:, EPTCS, 2010, pp. 22–29."},"date_updated":"2023-09-04T11:47:04Z","department":[{"_id":"KrCh"}],"conference":{"location":"Minori, Italy","name":"GandALF: Games, Automata, Logic, and Formal Verification","start_date":"2010-06-17","end_date":"2010-06-18"},"pubrep_id":"491","status":"public","_id":"3852","type":"conference","date_created":"2018-12-11T12:05:31Z","article_processing_charge":"No","volume":25,"language":[{"iso":"eng"}],"file":[{"file_name":"IST-2016-491-v1+1_1006.1403v1.pdf","date_created":"2018-12-12T10:12:19Z","date_updated":"2020-07-14T12:46:17Z","content_type":"application/pdf","access_level":"open_access","file_size":74598,"checksum":"2bdf1e9103710555c6251ca4153cb5e9","file_id":"4937","creator":"system","relation":"main_file"}],"month":"06","has_accepted_license":"1","author":[{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4561-241X","last_name":"Chatterjee","first_name":"Krishnendu"},{"first_name":"Ritankar","last_name":"Majumdar","full_name":"Majumdar, Ritankar"}],"oa_version":"Published Version","quality_controlled":"1"}]