[{"day":"18","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"access_level":"open_access","file_id":"5310","checksum":"6dca832f575d6b3f0ea9dff56f579142","creator":"system","date_created":"2018-12-12T10:17:53Z","file_name":"IST-2018-1010-v1+1_space-time_interpolants.pdf","date_updated":"2020-07-14T12:44:50Z","file_size":563710,"relation":"main_file","content_type":"application/pdf"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F5A88A-B435-11E9-9278-68D0E5697425","grant_number":"S11402-N23","call_identifier":"FWF","name":"Moderne Concurrency Paradigms"}],"isi":1,"author":[{"last_name":"Frehse","first_name":"Goran","full_name":"Frehse, Goran"},{"full_name":"Giacobbe, Mirco","first_name":"Mirco","orcid":"0000-0001-8180-0904","last_name":"Giacobbe","id":"3444EA5E-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","last_name":"Henzinger","first_name":"Thomas A","orcid":"0000−0002−2985−7724"}],"title":"Space-time interpolants","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","license":"https://creativecommons.org/licenses/by/4.0/","alternative_title":["LNCS"],"page":"468 - 486","date_created":"2018-12-11T11:44:50Z","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"type":"conference","publist_id":"7783","article_processing_charge":"No","pubrep_id":"1010","related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6894"}]},"external_id":{"isi":["000491481600025"]},"quality_controlled":"1","volume":10981,"year":"2018","date_updated":"2023-09-19T09:30:43Z","abstract":[{"text":"Reachability analysis is difficult for hybrid automata with affine differential equations, because the reach set needs to be approximated. Promising abstraction techniques usually employ interval methods or template polyhedra. Interval methods account for dense time and guarantee soundness, and there are interval-based tools that overapproximate affine flowpipes. But interval methods impose bounded and rigid shapes, which make refinement expensive and fixpoint detection difficult. Template polyhedra, on the other hand, can be adapted flexibly and can be unbounded, but sound template refinement for unbounded reachability analysis has been implemented only for systems with piecewise constant dynamics. We capitalize on the advantages of both techniques, combining interval arithmetic and template polyhedra, using the former to abstract time and the latter to abstract space. During a CEGAR loop, whenever a spurious error trajectory is found, we compute additional space constraints and split time intervals, and use these space-time interpolants to eliminate the counterexample. Space-time interpolation offers a lazy, flexible framework for increasing precision while guaranteeing soundness, both for error avoidance and fixpoint detection. To the best of out knowledge, this is the first abstraction refinement scheme for the reachability analysis over unbounded and dense time of affine hybrid systems, which is both sound and automatic. We demonstrate the effectiveness of our algorithm with several benchmark examples, which cannot be handled by other tools.","lang":"eng"}],"_id":"140","oa":1,"publication_identifier":{"issn":["03029743"]},"status":"public","month":"07","conference":{"name":"CAV: Computer Aided Verification","start_date":"2018-07-14","location":"Oxford, United Kingdom","end_date":"2018-07-17"},"publication_status":"published","doi":"10.1007/978-3-319-96145-3_25","date_published":"2018-07-18T00:00:00Z","oa_version":"Published Version","ddc":["005"],"scopus_import":"1","file_date_updated":"2020-07-14T12:44:50Z","intvolume":"     10981","citation":{"short":"G. Frehse, M. Giacobbe, T.A. Henzinger, in:, Springer, 2018, pp. 468–486.","ama":"Frehse G, Giacobbe M, Henzinger TA. Space-time interpolants. In: Vol 10981. Springer; 2018:468-486. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>","ieee":"G. Frehse, M. Giacobbe, and T. A. Henzinger, “Space-time interpolants,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 468–486.","mla":"Frehse, Goran, et al. <i>Space-Time Interpolants</i>. Vol. 10981, Springer, 2018, pp. 468–86, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">10.1007/978-3-319-96145-3_25</a>.","apa":"Frehse, G., Giacobbe, M., &#38; Henzinger, T. A. (2018). Space-time interpolants (Vol. 10981, pp. 468–486). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>","ista":"Frehse G, Giacobbe M, Henzinger TA. 2018. Space-time interpolants. CAV: Computer Aided Verification, LNCS, vol. 10981, 468–486.","chicago":"Frehse, Goran, Mirco Giacobbe, and Thomas A Henzinger. “Space-Time Interpolants,” 10981:468–86. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_25\">https://doi.org/10.1007/978-3-319-96145-3_25</a>."}},{"language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"type":"conference","date_created":"2018-12-11T11:44:51Z","page":"178-197","has_accepted_license":"1","related_material":{"record":[{"id":"10199","relation":"dissertation_contains","status":"public"}]},"external_id":{"isi":["000491469700013"]},"volume":10982,"quality_controlled":"1","publist_id":"7782","article_processing_charge":"No","file":[{"file_size":675606,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","file_id":"5737","creator":"dernst","checksum":"1a6ffa4febe8bb8ac28be3adb3eafebc","date_created":"2018-12-18T08:52:38Z","date_updated":"2020-07-14T12:44:53Z","file_name":"2018_LNCS_Chatterjee.pdf"}],"project":[{"grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","grant_number":"ICT15-003","name":"Efficient Algorithms for Computer Aided Verification"},{"name":"Rigorous Systems Engineering","call_identifier":"FWF","grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"grant_number":"665385","_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program"}],"author":[{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"orcid":"0000-0002-5008-6530","first_name":"Monika H","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Loitzenbauer, Veronika","last_name":"Loitzenbauer","first_name":"Veronika"},{"full_name":"Oraee, Simin","last_name":"Oraee","first_name":"Simin"},{"first_name":"Viktor","orcid":"0000-0001-9036-063X","id":"3AF3DA7C-F248-11E8-B48F-1D18A9856A87","last_name":"Toman","full_name":"Toman, Viktor"}],"isi":1,"day":"18","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"acknowledgement":"Acknowledgements. K. C. and M. H. are partially supported by the Vienna Science and Technology Fund (WWTF) grant ICT15-003. K. C. is partially supported by the Austrian Science Fund (FWF): S11407-N23 (RiSE/SHiNE), and an ERC Start Grant (279307: Graph Games). V. T. is partially supported by the European Union’s Horizon 2020 research and innovation programme under the Marie Sk lodowska-Curie Grant Agreement No. 665385.","alternative_title":["LNCS"],"title":"Symbolic algorithms for graphs and Markov decision processes with fairness objectives","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_published":"2018-07-18T00:00:00Z","oa_version":"Published Version","conference":{"end_date":"2018-07-17","location":"Oxford, United Kingdom","start_date":"2018-07-14","name":"CAV: Computer Aided Verification"},"publication_status":"published","doi":"10.1007/978-3-319-96142-2_13","citation":{"short":"K. Chatterjee, M.H. Henzinger, V. Loitzenbauer, S. Oraee, V. Toman, in:, Springer, 2018, pp. 178–197.","ieee":"K. Chatterjee, M. H. Henzinger, V. Loitzenbauer, S. Oraee, and V. Toman, “Symbolic algorithms for graphs and Markov decision processes with fairness objectives,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10982, pp. 178–197.","ama":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. In: Vol 10982. Springer; 2018:178-197. doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>","apa":"Chatterjee, K., Henzinger, M. H., Loitzenbauer, V., Oraee, S., &#38; Toman, V. (2018). Symbolic algorithms for graphs and Markov decision processes with fairness objectives (Vol. 10982, pp. 178–197). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>","mla":"Chatterjee, Krishnendu, et al. <i>Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives</i>. Vol. 10982, Springer, 2018, pp. 178–97, doi:<a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">10.1007/978-3-319-96142-2_13</a>.","ista":"Chatterjee K, Henzinger MH, Loitzenbauer V, Oraee S, Toman V. 2018. Symbolic algorithms for graphs and Markov decision processes with fairness objectives. CAV: Computer Aided Verification, LNCS, vol. 10982, 178–197.","chicago":"Chatterjee, Krishnendu, Monika H Henzinger, Veronika Loitzenbauer, Simin Oraee, and Viktor Toman. “Symbolic Algorithms for Graphs and Markov Decision Processes with Fairness Objectives,” 10982:178–97. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96142-2_13\">https://doi.org/10.1007/978-3-319-96142-2_13</a>."},"intvolume":"     10982","ddc":["000"],"scopus_import":"1","file_date_updated":"2020-07-14T12:44:53Z","_id":"141","year":"2018","date_updated":"2025-07-14T09:10:15Z","abstract":[{"text":"Given a model and a specification, the fundamental model-checking problem asks for algorithmic verification of whether the model satisfies the specification. We consider graphs and Markov decision processes (MDPs), which are fundamental models for reactive systems. One of the very basic specifications that arise in verification of reactive systems is the strong fairness (aka Streett) objective. Given different types of requests and corresponding grants, the objective requires that for each type, if the request event happens infinitely often, then the corresponding grant event must also happen infinitely often. All ω -regular objectives can be expressed as Streett objectives and hence they are canonical in verification. To handle the state-space explosion, symbolic algorithms are required that operate on a succinct implicit representation of the system rather than explicitly accessing the system. While explicit algorithms for graphs and MDPs with Streett objectives have been widely studied, there has been no improvement of the basic symbolic algorithms. The worst-case numbers of symbolic steps required for the basic symbolic algorithms are as follows: quadratic for graphs and cubic for MDPs. In this work we present the first sub-quadratic symbolic algorithm for graphs with Streett objectives, and our algorithm is sub-quadratic even for MDPs. Based on our algorithmic insights we present an implementation of the new symbolic approach and show that it improves the existing approach on several academic benchmark examples.","lang":"eng"}],"ec_funded":1,"month":"07","oa":1,"status":"public"},{"day":"06","extern":"1","year":"2018","date_updated":"2023-09-13T06:35:12Z","abstract":[{"lang":"eng","text":"High-dimensional time series are common in many domains. Since human\r\ncognition is not optimized to work well in high-dimensional spaces, these areas\r\ncould benefit from interpretable low-dimensional representations. However, most\r\nrepresentation learning algorithms for time series data are difficult to\r\ninterpret. This is due to non-intuitive mappings from data features to salient\r\nproperties of the representation and non-smoothness over time. To address this\r\nproblem, we propose a new representation learning framework building on ideas\r\nfrom interpretable discrete dimensionality reduction and deep generative\r\nmodeling. This framework allows us to learn discrete representations of time\r\nseries, which give rise to smooth and interpretable embeddings with superior\r\nclustering performance. We introduce a new way to overcome the\r\nnon-differentiability in discrete representation learning and present a\r\ngradient-based version of the traditional self-organizing map algorithm that is\r\nmore performant than the original. Furthermore, to allow for a probabilistic\r\ninterpretation of our method, we integrate a Markov model in the representation\r\nspace. This model uncovers the temporal transition structure, improves\r\nclustering performance even further and provides additional explanatory\r\ninsights as well as a natural representation of uncertainty. We evaluate our\r\nmodel in terms of clustering performance and interpretability on static\r\n(Fashion-)MNIST data, a time series of linearly interpolated (Fashion-)MNIST\r\nimages, a chaotic Lorenz attractor system with two macro states, as well as on\r\na challenging real world medical time series application on the eICU data set.\r\nOur learned representations compare favorably with competitor methods and\r\nfacilitate downstream tasks on the real world data."}],"arxiv":1,"_id":"14198","author":[{"first_name":"Vincent","last_name":"Fortuin","full_name":"Fortuin, Vincent"},{"last_name":"Hüser","first_name":"Matthias","full_name":"Hüser, Matthias"},{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"first_name":"Heiko","last_name":"Strathmann","full_name":"Strathmann, Heiko"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"}],"title":"SOM-VAE: Interpretable discrete representation learning on time series","oa":1,"status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"06","date_created":"2023-08-22T14:12:48Z","publication":"International Conference on Learning Representations","conference":{"name":"ICLR: International Conference on Learning Representations","start_date":"2019-05-06","location":"New Orleans, LA, United States","end_date":"2019-05-09"},"publication_status":"published","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"date_published":"2018-06-06T00:00:00Z","type":"conference","oa_version":"Preprint","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.02199"}],"article_processing_charge":"No","external_id":{"arxiv":["1806.02199"]},"quality_controlled":"1","citation":{"chicago":"Fortuin, Vincent, Matthias Hüser, Francesco Locatello, Heiko Strathmann, and Gunnar Rätsch. “SOM-VAE: Interpretable Discrete Representation Learning on Time Series.” In <i>International Conference on Learning Representations</i>, 2018.","apa":"Fortuin, V., Hüser, M., Locatello, F., Strathmann, H., &#38; Rätsch, G. (2018). SOM-VAE: Interpretable discrete representation learning on time series. In <i>International Conference on Learning Representations</i>. New Orleans, LA, United States.","mla":"Fortuin, Vincent, et al. “SOM-VAE: Interpretable Discrete Representation Learning on Time Series.” <i>International Conference on Learning Representations</i>, 2018.","ista":"Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. 2018. SOM-VAE: Interpretable discrete representation learning on time series. International Conference on Learning Representations. ICLR: International Conference on Learning Representations.","short":"V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, G. Rätsch, in:, International Conference on Learning Representations, 2018.","ama":"Fortuin V, Hüser M, Locatello F, Strathmann H, Rätsch G. SOM-VAE: Interpretable discrete representation learning on time series. In: <i>International Conference on Learning Representations</i>. ; 2018.","ieee":"V. Fortuin, M. Hüser, F. Locatello, H. Strathmann, and G. Rätsch, “SOM-VAE: Interpretable discrete representation learning on time series,” in <i>International Conference on Learning Representations</i>, New Orleans, LA, United States, 2018."}},{"external_id":{"isi":["000491481600024"]},"quality_controlled":"1","volume":10981,"publist_id":"7781","article_processing_charge":"No","language":[{"iso":"eng"}],"department":[{"_id":"ToHe"}],"type":"conference","page":"449 - 467","date_created":"2018-12-11T11:44:51Z","has_accepted_license":"1","alternative_title":["LNCS"],"title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"content_type":"application/pdf","relation":"main_file","file_size":5591566,"file_name":"2018_LNCS_Kong.pdf","date_updated":"2020-07-14T12:44:53Z","date_created":"2018-12-17T15:57:06Z","checksum":"fd95e8026deacef3dc752a733bb9355f","file_id":"5718","creator":"dernst","access_level":"open_access"}],"project":[{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"},{"_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize","call_identifier":"FWF"}],"isi":1,"author":[{"full_name":"Kong, Hui","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","orcid":"0000-0002-3066-6941","first_name":"Hui"},{"last_name":"Bartocci","first_name":"Ezio","full_name":"Bartocci, Ezio"},{"first_name":"Thomas A","orcid":"0000−0002−2985−7724","last_name":"Henzinger","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"18","acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","citation":{"mla":"Kong, Hui, et al. <i>Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes</i>. Vol. 10981, Springer, 2018, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>.","apa":"Kong, H., Bartocci, E., &#38; Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>","ista":"Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467.","chicago":"Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>.","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.","ieee":"H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.","ama":"Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>"},"intvolume":"     10981","ddc":["000"],"scopus_import":"1","file_date_updated":"2020-07-14T12:44:53Z","date_published":"2018-07-18T00:00:00Z","oa_version":"Published Version","publication_status":"published","conference":{"start_date":"2018-07-14","name":"CAV: Computer Aided Verification","end_date":"2018-07-17","location":"Oxford, United Kingdom"},"doi":"10.1007/978-3-319-96145-3_24","month":"07","oa":1,"status":"public","_id":"142","year":"2018","date_updated":"2023-09-15T12:12:08Z","abstract":[{"lang":"eng","text":"We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective."}]},{"main_file_link":[{"url":"https://arxiv.org/abs/1708.01733","open_access":"1"}],"scopus_import":"1","intvolume":"        84","citation":{"chicago":"Locatello, Francesco, Rajiv Khanna, Joydeep Ghosh, and Gunnar Rätsch. “Boosting Variational Inference: An Optimization Perspective.” In <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i>, 84:464–72. ML Research Press, 2018.","ista":"Locatello F, Khanna R, Ghosh J, Rätsch G. 2018. Boosting variational inference: An optimization perspective. Proceedings of the 21st International Conference on Artificial Intelligence and Statistics. AISTATS: Conference on Artificial Intelligence and Statistics, PMLR, vol. 84, 464–472.","apa":"Locatello, F., Khanna, R., Ghosh, J., &#38; Rätsch, G. (2018). Boosting variational inference: An optimization perspective. In <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i> (Vol. 84, pp. 464–472). Playa Blanca, Lanzarote: ML Research Press.","mla":"Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization Perspective.” <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i>, vol. 84, ML Research Press, 2018, pp. 464–72.","short":"F. Locatello, R. Khanna, J. Ghosh, G. Rätsch, in:, Proceedings of the 21st International Conference on Artificial Intelligence and Statistics, ML Research Press, 2018, pp. 464–472.","ama":"Locatello F, Khanna R, Ghosh J, Rätsch G. Boosting variational inference: An optimization perspective. In: <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i>. Vol 84. ML Research Press; 2018:464-472.","ieee":"F. Locatello, R. Khanna, J. Ghosh, and G. Rätsch, “Boosting variational inference: An optimization perspective,” in <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i>, Playa Blanca, Lanzarote, 2018, vol. 84, pp. 464–472."},"publication_status":"published","conference":{"start_date":"2018-04-09","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2018-04-11","location":"Playa Blanca, Lanzarote"},"oa_version":"Preprint","date_published":"2018-04-15T00:00:00Z","status":"public","oa":1,"month":"04","date_updated":"2023-09-13T07:52:40Z","abstract":[{"lang":"eng","text":"Variational inference is a popular technique to approximate a possibly\r\nintractable Bayesian posterior with a more tractable one. Recently, boosting\r\nvariational inference has been proposed as a new paradigm to approximate the\r\nposterior by a mixture of densities by greedily adding components to the\r\nmixture. However, as is the case with many other variational inference\r\nalgorithms, its theoretical properties have not been studied. In the present\r\nwork, we study the convergence properties of this approach from a modern\r\noptimization viewpoint by establishing connections to the classic Frank-Wolfe\r\nalgorithm. Our analyses yields novel theoretical insights regarding the\r\nsufficient conditions for convergence, explicit rates, and algorithmic\r\nsimplifications. Since a lot of focus in previous works for variational\r\ninference has been on tractability, our work is especially important as a much\r\nneeded attempt to bridge the gap between probabilistic models and their\r\ncorresponding theoretical properties."}],"arxiv":1,"year":"2018","_id":"14201","article_processing_charge":"No","external_id":{"arxiv":["1708.01733"]},"quality_controlled":"1","volume":84,"date_created":"2023-08-22T14:15:20Z","page":"464-472","publication":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Boosting variational inference: An optimization perspective","alternative_title":["PMLR"],"day":"15","extern":"1","author":[{"last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"full_name":"Khanna, Rajiv","first_name":"Rajiv","last_name":"Khanna"},{"first_name":"Joydeep","last_name":"Ghosh","full_name":"Ghosh, Joydeep"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"}]},{"language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"type":"conference","date_created":"2023-08-22T14:15:40Z","publication":"Advances in Neural Information Processing Systems","external_id":{"arxiv":["1806.02185"]},"quality_controlled":"1","volume":31,"article_processing_charge":"No","author":[{"last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco","full_name":"Locatello, Francesco"},{"full_name":"Dresdner, Gideon","last_name":"Dresdner","first_name":"Gideon"},{"last_name":"Khanna","first_name":"Rajiv","full_name":"Khanna, Rajiv"},{"first_name":"Isabel","last_name":"Valera","full_name":"Valera, Isabel"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"}],"day":"06","extern":"1","title":"Boosting black box variational inference","publisher":"Neural Information Processing Systems Foundation","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2018-06-06T00:00:00Z","oa_version":"Preprint","publication_status":"published","conference":{"end_date":"2018-12-08","location":"Montreal, Canada","start_date":"2018-12-03","name":"NeurIPS: Neural Information Processing Systems"},"citation":{"ama":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box variational inference. In: <i>Advances in Neural Information Processing Systems</i>. Vol 31. Neural Information Processing Systems Foundation; 2018.","ieee":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting black box variational inference,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2018, vol. 31.","short":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018.","chicago":"Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and Gunnar Rätsch. “Boosting Black Box Variational Inference.” In <i>Advances in Neural Information Processing Systems</i>, Vol. 31. Neural Information Processing Systems Foundation, 2018.","ista":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black box variational inference. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 31.","apa":"Locatello, F., Dresdner, G., Khanna, R., Valera, I., &#38; Rätsch, G. (2018). Boosting black box variational inference. In <i>Advances in Neural Information Processing Systems</i> (Vol. 31). Montreal, Canada: Neural Information Processing Systems Foundation.","mla":"Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” <i>Advances in Neural Information Processing Systems</i>, vol. 31, Neural Information Processing Systems Foundation, 2018."},"intvolume":"        31","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.02185"}],"scopus_import":"1","_id":"14202","year":"2018","date_updated":"2023-09-13T07:38:24Z","abstract":[{"lang":"eng","text":"Approximating a probability density in a tractable manner is a central task\r\nin Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves tractability by choosing a relatively simple variational family.\r\nBorrowing ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost} VI by replacing the selection of a single density with a\r\ngreedily constructed mixture of densities. In order to guarantee convergence,\r\nprevious works impose stringent assumptions that require significant effort for\r\npractitioners. Specifically, they require a custom implementation of the greedy\r\nstep (called the LMO) for every probabilistic model with respect to an\r\nunnatural variational family of truncated distributions. Our work fixes these\r\nissues with novel theoretical and algorithmic insights. On the theoretical\r\nside, we show that boosting VI satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow for black box implementation of the boosting\r\nsubroutine. Finally, we present a stopping criterion drawn from the duality gap\r\nin the classic FW analyses and exhaustive experiments to illustrate the\r\nusefulness of our theoretical and algorithmic contributions."}],"arxiv":1,"month":"06","publication_identifier":{"eissn":["1049-5258"],"isbn":["9781510884472"]},"oa":1,"status":"public"},{"_id":"14203","date_updated":"2023-09-13T08:13:39Z","arxiv":1,"abstract":[{"lang":"eng","text":"We propose a conditional gradient framework for a composite convex minimization template with broad applications. Our approach combines smoothing and homotopy techniques under the CGM framework, and provably achieves the optimal O(1/k−−√) convergence rate. We demonstrate that the same rate holds if the linear subproblems are solved approximately with additive or multiplicative error. In contrast with the relevant work, we are able to characterize the convergence when the non-smooth term is an indicator function. Specific applications of our framework include the non-smooth minimization, semidefinite programming, and minimization with linear inclusion constraints over a compact domain. Numerical evidence demonstrates the benefits of our framework."}],"year":"2018","month":"07","status":"public","oa":1,"oa_version":"Preprint","date_published":"2018-07-15T00:00:00Z","conference":{"location":"Stockholm, Sweden","end_date":"2018-07-15","name":"ICML: International Conference on Machine Learning","start_date":"2018-07-10"},"publication_status":"published","citation":{"ama":"Yurtsever A, Fercoq O, Locatello F, Cevher V. A conditional gradient framework for composite convex minimization with applications to semidefinite programming. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:5727-5736.","ieee":"A. Yurtsever, O. Fercoq, F. Locatello, and V. Cevher, “A conditional gradient framework for composite convex minimization with applications to semidefinite programming,” in <i>Proceedings of the 35th International Conference on Machine Learning</i>, Stockholm, Sweden, 2018, vol. 80, pp. 5727–5736.","short":"A. Yurtsever, O. Fercoq, F. Locatello, V. Cevher, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 5727–5736.","chicago":"Yurtsever, Alp, Olivier Fercoq, Francesco Locatello, and Volkan Cevher. “A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:5727–36. ML Research Press, 2018.","apa":"Yurtsever, A., Fercoq, O., Locatello, F., &#38; Cevher, V. (2018). A conditional gradient framework for composite convex minimization with applications to semidefinite programming. In <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol. 80, pp. 5727–5736). Stockholm, Sweden: ML Research Press.","ista":"Yurtsever A, Fercoq O, Locatello F, Cevher V. 2018. A conditional gradient framework for composite convex minimization with applications to semidefinite programming. Proceedings of the 35th International Conference on Machine Learning. ICML: International Conference on Machine Learning, PMLR, vol. 80, 5727–5736.","mla":"Yurtsever, Alp, et al. “A Conditional Gradient Framework for Composite Convex Minimization with Applications to Semidefinite Programming.” <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 5727–36."},"intvolume":"        80","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.08544"}],"author":[{"first_name":"Alp","last_name":"Yurtsever","full_name":"Yurtsever, Alp"},{"first_name":"Olivier","last_name":"Fercoq","full_name":"Fercoq, Olivier"},{"full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","orcid":"0000-0002-4850-0683","first_name":"Francesco"},{"first_name":"Volkan","last_name":"Cevher","full_name":"Cevher, Volkan"}],"day":"15","extern":"1","alternative_title":["PMLR"],"publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"date_created":"2023-08-22T14:16:01Z","page":"5727-5736","publication":"Proceedings of the 35th International Conference on Machine Learning","external_id":{"arxiv":["1804.08544"]},"quality_controlled":"1","volume":80,"article_processing_charge":"No"},{"oa":1,"status":"public","month":"07","year":"2018","date_updated":"2023-09-13T08:19:05Z","abstract":[{"lang":"eng","text":"Two popular examples of first-order optimization methods over linear spaces are coordinate descent and matching pursuit algorithms, with their randomized variants. While the former targets the optimization by moving along coordinates, the latter considers a generalized notion of directions. Exploiting the connection between the two algorithms, we present a unified analysis of both, providing affine invariant sublinear O(1/t) rates on smooth objectives and linear convergence on strongly convex objectives. As a byproduct of our affine invariant analysis of matching pursuit, our rates for steepest coordinate descent are the tightest known. Furthermore, we show the first accelerated convergence rate O(1/t2) for matching pursuit and steepest coordinate descent on convex objectives."}],"arxiv":1,"_id":"14204","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.09539"}],"scopus_import":"1","citation":{"ista":"Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.","mla":"Locatello, Francesco, et al. “On Matching Pursuit and Coordinate Descent.” <i>Proceedings of the 35th International Conference on Machine Learning</i>, vol. 80, ML Research Press, 2018, pp. 3198–207.","apa":"Locatello, F., Raj, A., Karimireddy, S. P., Rätsch, G., Schölkopf, B., Stich, S. U., &#38; Jaggi, M. (2018). On matching pursuit and coordinate descent. In <i>Proceedings of the 35th International Conference on Machine Learning</i> (Vol. 80, pp. 3198–3207). ML Research Press.","chicago":"Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch, Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit and Coordinate Descent.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:3198–3207. ML Research Press, 2018.","short":"F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich, M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 3198–3207.","ama":"Locatello F, Raj A, Karimireddy SP, et al. On matching pursuit and coordinate descent. In: <i>Proceedings of the 35th International Conference on Machine Learning</i>. Vol 80. ML Research Press; 2018:3198-3207.","ieee":"F. Locatello <i>et al.</i>, “On matching pursuit and coordinate descent,” in <i>Proceedings of the 35th International Conference on Machine Learning</i>, 2018, vol. 80, pp. 3198–3207."},"intvolume":"        80","publication_status":"published","date_published":"2018-07-01T00:00:00Z","oa_version":"Preprint","title":"On matching pursuit and coordinate descent","publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","alternative_title":["PMLR"],"day":"01","extern":"1","author":[{"orcid":"0000-0002-4850-0683","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","last_name":"Locatello","full_name":"Locatello, Francesco"},{"full_name":"Raj, Anant","last_name":"Raj","first_name":"Anant"},{"last_name":"Karimireddy","first_name":"Sai Praneeth","full_name":"Karimireddy, Sai Praneeth"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"full_name":"Stich, Sebastian U.","first_name":"Sebastian U.","last_name":"Stich"},{"full_name":"Jaggi, Martin","first_name":"Martin","last_name":"Jaggi"}],"article_processing_charge":"No","external_id":{"arxiv":["1803.09539"]},"volume":80,"quality_controlled":"1","date_created":"2023-08-22T14:16:25Z","page":"3198-3207","publication":"Proceedings of the 35th International Conference on Machine Learning","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"type":"conference"},{"month":"05","status":"public","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"Clustering meets implicit generative models","oa":1,"author":[{"full_name":"Locatello, Francesco","first_name":"Francesco","orcid":"0000-0002-4850-0683","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"first_name":"Damien","last_name":"Vincent","full_name":"Vincent, Damien"},{"first_name":"Ilya","last_name":"Tolstikhin","full_name":"Tolstikhin, Ilya"},{"full_name":"Ratsch, Gunnar","first_name":"Gunnar","last_name":"Ratsch"},{"full_name":"Gelly, Sylvain","last_name":"Gelly","first_name":"Sylvain"},{"first_name":"Bernhard","last_name":"Scholkopf","full_name":"Scholkopf, Bernhard"}],"_id":"14224","date_updated":"2023-09-13T09:08:24Z","abstract":[{"lang":"eng","text":"Clustering is a cornerstone of unsupervised learning which can be thought as disentangling multiple generative mechanisms underlying the data. In this paper we introduce an algorithmic framework to train mixtures of implicit generative models which we particularize for variational autoencoders. Relying on an additional set of discriminators, we propose a competitive procedure in which the models only need to approximate the portion of the data distribution from which they can produce realistic samples. As a byproduct, each model is simpler to train, and a clustering interpretation arises naturally from the partitioning of the training points among the models. We empirically show that our approach splits the training distribution in a reasonable way and increases the quality of the generated samples."}],"arxiv":1,"day":"01","year":"2018","extern":"1","external_id":{"arxiv":["1804.11130"]},"citation":{"ieee":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf, “Clustering meets implicit generative models,” in <i>6th International Conference on Learning Representations</i>, Vancouver, Canada, 2018.","ama":"Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering meets implicit generative models. In: <i>6th International Conference on Learning Representations</i>. ; 2018.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf, in:, 6th International Conference on Learning Representations, 2018.","ista":"Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. 2018. Clustering meets implicit generative models. 6th International Conference on Learning Representations. International Conference on Machine Learning.","mla":"Locatello, Francesco, et al. “Clustering Meets Implicit Generative Models.” <i>6th International Conference on Learning Representations</i>, 2018.","apa":"Locatello, F., Vincent, D., Tolstikhin, I., Ratsch, G., Gelly, S., &#38; Scholkopf, B. (2018). Clustering meets implicit generative models. In <i>6th International Conference on Learning Representations</i>. Vancouver, Canada.","chicago":"Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Ratsch, Sylvain Gelly, and Bernhard Scholkopf. “Clustering Meets Implicit Generative Models.” In <i>6th International Conference on Learning Representations</i>, 2018."},"quality_controlled":"1","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.11130","open_access":"1"}],"article_processing_charge":"No","oa_version":"Preprint","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"date_published":"2018-05-01T00:00:00Z","conference":{"name":"International Conference on Machine Learning","start_date":"2018-04-30","location":"Vancouver, Canada","end_date":"2018-05-03"},"publication_status":"published","date_created":"2023-08-22T14:25:34Z","publication":"6th International Conference on Learning Representations"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","title":"Efficient algorithms for asymptotic bounds on termination time in VASS","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"day":"09","isi":1,"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"orcid":"0000-0002-4561-241X","first_name":"Krishnendu","last_name":"Chatterjee","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","full_name":"Chatterjee, Krishnendu"},{"full_name":"Kučera, Antonín","last_name":"Kučera","first_name":"Antonín"},{"full_name":"Novotny, Petr","first_name":"Petr","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","last_name":"Novotny"},{"full_name":"Velan, Dominik","last_name":"Velan","first_name":"Dominik"},{"last_name":"Zuleger","first_name":"Florian","full_name":"Zuleger, Florian"}],"project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7","grant_number":"279307","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","name":"Rigorous Systems Engineering","_id":"25832EC2-B435-11E9-9278-68D0E5697425","grant_number":"S 11407_N23"}],"article_processing_charge":"No","publist_id":"7780","quality_controlled":"1","volume":"F138033","external_id":{"isi":["000545262800020"]},"page":"185 - 194","date_created":"2018-12-11T11:44:51Z","type":"conference","department":[{"_id":"KrCh"}],"language":[{"iso":"eng"}],"status":"public","oa":1,"publication_identifier":{"isbn":["978-1-4503-5583-4"]},"month":"07","ec_funded":1,"abstract":[{"text":"Vector Addition Systems with States (VASS) provide a well-known and fundamental model for the analysis of concurrent processes, parameterized systems, and are also used as abstract models of programs in resource bound analysis. In this paper we study the problem of obtaining asymptotic bounds on the termination time of a given VASS. In particular, we focus on the practically important case of obtaining polynomial bounds on termination time. Our main contributions are as follows: First, we present a polynomial-time algorithm for deciding whether a given VASS has a linear asymptotic complexity. We also show that if the complexity of a VASS is not linear, it is at least quadratic. Second, we classify VASS according to quantitative properties of their cycles. We show that certain singularities in these properties are the key reason for non-polynomial asymptotic complexity of VASS. In absence of singularities, we show that the asymptotic complexity is always polynomial and of the form Θ(nk), for some integer k d, where d is the dimension of the VASS. We present a polynomial-time algorithm computing the optimal k. For general VASS, the same algorithm, which is based on a complete technique for the construction of ranking functions in VASS, produces a valid lower bound, i.e., a k such that the termination complexity is (nk). Our results are based on new insights into the geometry of VASS dynamics, which hold the potential for further applicability to VASS analysis.","lang":"eng"}],"date_updated":"2025-06-02T08:53:48Z","year":"2018","_id":"143","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1804.10985","open_access":"1"}],"citation":{"chicago":"Brázdil, Tomáš, Krishnendu Chatterjee, Antonín Kučera, Petr Novotný, Dominik Velan, and Florian Zuleger. “Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS,” F138033:185–94. IEEE, 2018. <a href=\"https://doi.org/10.1145/3209108.3209191\">https://doi.org/10.1145/3209108.3209191</a>.","ista":"Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. 2018. Efficient algorithms for asymptotic bounds on termination time in VASS. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. F138033, 185–194.","apa":"Brázdil, T., Chatterjee, K., Kučera, A., Novotný, P., Velan, D., &#38; Zuleger, F. (2018). Efficient algorithms for asymptotic bounds on termination time in VASS (Vol. F138033, pp. 185–194). Presented at the LICS: Logic in Computer Science, Oxford, United Kingdom: IEEE. <a href=\"https://doi.org/10.1145/3209108.3209191\">https://doi.org/10.1145/3209108.3209191</a>","mla":"Brázdil, Tomáš, et al. <i>Efficient Algorithms for Asymptotic Bounds on Termination Time in VASS</i>. Vol. F138033, IEEE, 2018, pp. 185–94, doi:<a href=\"https://doi.org/10.1145/3209108.3209191\">10.1145/3209108.3209191</a>.","short":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194.","ama":"Brázdil T, Chatterjee K, Kučera A, Novotný P, Velan D, Zuleger F. Efficient algorithms for asymptotic bounds on termination time in VASS. In: Vol F138033. IEEE; 2018:185-194. doi:<a href=\"https://doi.org/10.1145/3209108.3209191\">10.1145/3209108.3209191</a>","ieee":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, and F. Zuleger, “Efficient algorithms for asymptotic bounds on termination time in VASS,” presented at the LICS: Logic in Computer Science, Oxford, United Kingdom, 2018, vol. F138033, pp. 185–194."},"doi":"10.1145/3209108.3209191","conference":{"start_date":"2018-07-09","name":"LICS: Logic in Computer Science","end_date":"2018-07-12","location":"Oxford, United Kingdom"},"publication_status":"published","oa_version":"Preprint","date_published":"2018-07-09T00:00:00Z"},{"intvolume":"       131","citation":{"apa":"Tejos, R., Rodríguez Furlán, C., Adamowski, M., Sauer, M., Norambuena, L., &#38; Friml, J. (2018). PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.204198\">https://doi.org/10.1242/jcs.204198</a>","mla":"Tejos, Ricardo, et al. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>, vol. 131, no. 2, jcs. 204198, Company of Biologists, 2018, doi:<a href=\"https://doi.org/10.1242/jcs.204198\">10.1242/jcs.204198</a>.","ista":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. 2018. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. Journal of Cell Science. 131(2), jcs. 204198.","chicago":"Tejos, Ricardo, Cecilia Rodríguez Furlán, Maciek Adamowski, Michael Sauer, Lorena Norambuena, and Jiří Friml. “PATELLINS Are Regulators of Auxin Mediated PIN1 Relocation and Plant Development in Arabidopsis Thaliana.” <i>Journal of Cell Science</i>. Company of Biologists, 2018. <a href=\"https://doi.org/10.1242/jcs.204198\">https://doi.org/10.1242/jcs.204198</a>.","short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018).","ama":"Tejos R, Rodríguez Furlán C, Adamowski M, Sauer M, Norambuena L, Friml J. PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana. <i>Journal of Cell Science</i>. 2018;131(2). doi:<a href=\"https://doi.org/10.1242/jcs.204198\">10.1242/jcs.204198</a>","ieee":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, and J. Friml, “PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana,” <i>Journal of Cell Science</i>, vol. 131, no. 2. Company of Biologists, 2018."},"ddc":["581"],"scopus_import":"1","file_date_updated":"2020-07-14T12:48:15Z","date_published":"2018-01-29T00:00:00Z","oa_version":"Published Version","publication_status":"published","doi":"10.1242/jcs.204198","ec_funded":1,"month":"01","publication_identifier":{"issn":["00219533"]},"oa":1,"status":"public","_id":"913","article_number":"jcs.204198","year":"2018","date_updated":"2025-05-07T11:12:29Z","issue":"2","abstract":[{"text":"Coordinated cell polarization in developing tissues is a recurrent theme in multicellular organisms. In plants, a directional distribution of the plant hormone auxin is at the core of many developmental programs. A feedback regulation of auxin on the polarized localization of PIN auxin transporters in individual cells has been proposed as a self-organizing mechanism for coordinated tissue polarization, but the molecular mechanisms linking auxin signalling to PIN-dependent auxin transport remain unknown. We performed a microarray-based approach to find regulators of the auxin-induced PIN relocation in the Arabidopsis thaliana root. We identified a subset of a family of phosphatidylinositol transfer proteins (PITP), the PATELLINs (PATL). Here, we show that PATLs are expressed in partially overlapping cells types in different tissues going through mitosis or initiating differentiation programs. PATLs are plasma membrane-associated proteins accumulated in Arabidopsis embryos, primary roots, lateral root primordia, and developing stomata. Higher order patl mutants display reduced PIN1 repolarization in response to auxin, shorter root apical meristem, and drastic defects in embryo and seedling development. This suggests PATLs redundantly play a crucial role in polarity and patterning in Arabidopsis.","lang":"eng"}],"external_id":{"isi":["000424842400019"]},"quality_controlled":"1","volume":131,"publist_id":"6530","article_processing_charge":"No","pubrep_id":"988","language":[{"iso":"eng"}],"department":[{"_id":"JiFr"}],"type":"journal_article","date_created":"2018-12-11T11:49:10Z","publication":"Journal of Cell Science","has_accepted_license":"1","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","publisher":"Company of Biologists","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","file":[{"content_type":"application/pdf","relation":"main_file","file_size":14925985,"date_updated":"2020-07-14T12:48:15Z","file_name":"2017_adamowski_PATELLINS_are.pdf","date_created":"2019-04-12T08:46:32Z","file_id":"6299","creator":"dernst","checksum":"bf156c20a4f117b4b932370d54cbac8c","access_level":"open_access"}],"project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425","grant_number":"282300"}],"author":[{"full_name":"Tejos, Ricardo","first_name":"Ricardo","last_name":"Tejos"},{"first_name":"Cecilia","last_name":"Rodríguez Furlán","full_name":"Rodríguez Furlán, Cecilia"},{"last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87","first_name":"Maciek","orcid":"0000-0001-6463-5257","full_name":"Adamowski, Maciek"},{"first_name":"Michael","last_name":"Sauer","full_name":"Sauer, Michael"},{"first_name":"Lorena","last_name":"Norambuena","full_name":"Norambuena, Lorena"},{"full_name":"Friml, Jirí","first_name":"Jirí","orcid":"0000-0002-8302-7596","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"day":"29"},{"date_created":"2021-03-07T23:01:25Z","page":"11","publication":"Opera Medica et Physiologica","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JoDa"}],"article_type":"letter_note","article_processing_charge":"No","quality_controlled":"1","volume":4,"day":"30","author":[{"full_name":"Danzl, Johann G","orcid":"0000-0001-8559-3973","first_name":"Johann G","last_name":"Danzl","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87"}],"publisher":"Lobachevsky State University of Nizhny Novgorod","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"Diffraction-unlimited optical imaging for synaptic physiology","alternative_title":["Molecular and cellular neuroscience"],"publication_status":"published","doi":"10.20388/omp2018.00s1.001","oa_version":"Published Version","date_published":"2018-06-30T00:00:00Z","main_file_link":[{"url":"http://operamedphys.org/content/molecular-and-cellular-neuroscience","open_access":"1"}],"scopus_import":"1","citation":{"ama":"Danzl JG. Diffraction-unlimited optical imaging for synaptic physiology. <i>Opera Medica et Physiologica</i>. 2018;4(S1):11. doi:<a href=\"https://doi.org/10.20388/omp2018.00s1.001\">10.20388/omp2018.00s1.001</a>","ieee":"J. G. Danzl, “Diffraction-unlimited optical imaging for synaptic physiology,” <i>Opera Medica et Physiologica</i>, vol. 4, no. S1. Lobachevsky State University of Nizhny Novgorod, p. 11, 2018.","short":"J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.","chicago":"Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” <i>Opera Medica et Physiologica</i>. Lobachevsky State University of Nizhny Novgorod, 2018. <a href=\"https://doi.org/10.20388/omp2018.00s1.001\">https://doi.org/10.20388/omp2018.00s1.001</a>.","apa":"Danzl, J. G. (2018). Diffraction-unlimited optical imaging for synaptic physiology. <i>Opera Medica et Physiologica</i>. Lobachevsky State University of Nizhny Novgorod. <a href=\"https://doi.org/10.20388/omp2018.00s1.001\">https://doi.org/10.20388/omp2018.00s1.001</a>","mla":"Danzl, Johann G. “Diffraction-Unlimited Optical Imaging for Synaptic Physiology.” <i>Opera Medica et Physiologica</i>, vol. 4, no. S1, Lobachevsky State University of Nizhny Novgorod, 2018, p. 11, doi:<a href=\"https://doi.org/10.20388/omp2018.00s1.001\">10.20388/omp2018.00s1.001</a>.","ista":"Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. 4(S1), 11."},"intvolume":"         4","date_updated":"2021-12-03T07:31:05Z","issue":"S1","year":"2018","_id":"9229","status":"public","publication_identifier":{"eissn":["2500-2295"],"issn":["2500-2287"]},"oa":1,"month":"06"},{"status":"public","oa":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"month":"05","date_updated":"2021-12-14T07:53:40Z","issue":"20","abstract":[{"text":"The DEMETER (DME) DNA glycosylase catalyzes genome-wide DNA demethylation and is required for endosperm genomic imprinting and embryo viability. Targets of DME-mediated DNA demethylation reside in small, euchromatic, AT-rich transposons and at the boundaries of large transposons, but how DME interacts with these diverse chromatin states is unknown. The STRUCTURE SPECIFIC RECOGNITION PROTEIN 1 (SSRP1) subunit of the chromatin remodeler FACT (facilitates chromatin transactions), was previously shown to be involved in the DME-dependent regulation of genomic imprinting in Arabidopsis endosperm. Therefore, to investigate the interaction between DME and chromatin, we focused on the activity of the two FACT subunits, SSRP1 and SUPPRESSOR of TY16 (SPT16), during reproduction in Arabidopsis. We found that FACT colocalizes with nuclear DME in vivo, and that DME has two classes of target sites, the first being euchromatic and accessible to DME, but the second, representing over half of DME targets, requiring the action of FACT for DME-mediated DNA demethylation genome-wide. Our results show that the FACT-dependent DME targets are GC-rich heterochromatin domains with high nucleosome occupancy enriched with H3K9me2 and H3K27me1. Further, we demonstrate that heterochromatin-associated linker histone H1 specifically mediates the requirement for FACT at a subset of DME-target loci. Overall, our results demonstrate that FACT is required for DME targeting by facilitating its access to heterochromatin.","lang":"eng"}],"year":"2018","_id":"9471","scopus_import":"1","file_date_updated":"2021-06-07T06:16:38Z","ddc":["580"],"intvolume":"       115","citation":{"ieee":"J. M. Frost <i>et al.</i>, “FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis,” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20. National Academy of Sciences, pp. E4720–E4729, 2018.","ama":"Frost JM, Kim MY, Park GT, et al. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. 2018;115(20):E4720-E4729. doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>","short":"J.M. Frost, M.Y. Kim, G.T. Park, P.-H. Hsieh, M. Nakamura, S.J.H. Lin, H. Yoo, J. Choi, Y. Ikeda, T. Kinoshita, Y. Choi, D. Zilberman, R.L. Fischer, Proceedings of the National Academy of Sciences 115 (2018) E4720–E4729.","chicago":"Frost, Jennifer M., M. Yvonne Kim, Guen Tae Park, Ping-Hung Hsieh, Miyuki Nakamura, Samuel J. H. Lin, Hyunjin Yoo, et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>.","mla":"Frost, Jennifer M., et al. “FACT Complex Is Required for DNA Demethylation at Heterochromatin during Reproduction in Arabidopsis.” <i>Proceedings of the National Academy of Sciences</i>, vol. 115, no. 20, National Academy of Sciences, 2018, pp. E4720–29, doi:<a href=\"https://doi.org/10.1073/pnas.1713333115\">10.1073/pnas.1713333115</a>.","ista":"Frost JM, Kim MY, Park GT, Hsieh P-H, Nakamura M, Lin SJH, Yoo H, Choi J, Ikeda Y, Kinoshita T, Choi Y, Zilberman D, Fischer RL. 2018. FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. Proceedings of the National Academy of Sciences. 115(20), E4720–E4729.","apa":"Frost, J. M., Kim, M. Y., Park, G. T., Hsieh, P.-H., Nakamura, M., Lin, S. J. H., … Fischer, R. L. (2018). FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis. <i>Proceedings of the National Academy of Sciences</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1713333115\">https://doi.org/10.1073/pnas.1713333115</a>"},"publication_status":"published","doi":"10.1073/pnas.1713333115","oa_version":"Published Version","date_published":"2018-05-15T00:00:00Z","publisher":"National Academy of Sciences","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","title":"FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis","license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","pmid":1,"day":"15","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivatives 4.0 International (CC BY-NC-ND 4.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/4.0/legalcode","short":"CC BY-NC-ND (4.0)","image":"/images/cc_by_nc_nd.png"},"extern":"1","author":[{"full_name":"Frost, Jennifer M.","last_name":"Frost","first_name":"Jennifer M."},{"first_name":"M. Yvonne","last_name":"Kim","full_name":"Kim, M. Yvonne"},{"first_name":"Guen Tae","last_name":"Park","full_name":"Park, Guen Tae"},{"last_name":"Hsieh","first_name":"Ping-Hung","full_name":"Hsieh, Ping-Hung"},{"full_name":"Nakamura, Miyuki","first_name":"Miyuki","last_name":"Nakamura"},{"full_name":"Lin, Samuel J. H.","last_name":"Lin","first_name":"Samuel J. H."},{"last_name":"Yoo","first_name":"Hyunjin","full_name":"Yoo, Hyunjin"},{"last_name":"Choi","first_name":"Jaemyung","full_name":"Choi, Jaemyung"},{"last_name":"Ikeda","first_name":"Yoko","full_name":"Ikeda, Yoko"},{"first_name":"Tetsu","last_name":"Kinoshita","full_name":"Kinoshita, Tetsu"},{"last_name":"Choi","first_name":"Yeonhee","full_name":"Choi, Yeonhee"},{"first_name":"Daniel","orcid":"0000-0002-0123-8649","last_name":"Zilberman","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","full_name":"Zilberman, Daniel"},{"last_name":"Fischer","first_name":"Robert L.","full_name":"Fischer, Robert L."}],"file":[{"date_updated":"2021-06-07T06:16:38Z","file_name":"2018_PNAS_Frost.pdf","date_created":"2021-06-07T06:16:38Z","checksum":"810260dc0e3cc3033e15c19ad0dc123e","file_id":"9472","creator":"asandaue","access_level":"open_access","relation":"main_file","content_type":"application/pdf","success":1,"file_size":3045260}],"article_processing_charge":"No","article_type":"original","external_id":{"pmid":["29712855"]},"quality_controlled":"1","volume":115,"keyword":["Multidisciplinary"],"related_material":{"link":[{"url":"https://doi.org/10.1101/187674 ","relation":"earlier_version"}]},"has_accepted_license":"1","page":"E4720-E4729","date_created":"2021-06-07T06:11:28Z","publication":"Proceedings of the National Academy of Sciences","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"DaZi"}]},{"citation":{"chicago":"Laukoter, Susanne. “Role of Genomic Imprinting in Cerebral Cortex Development.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>.","apa":"Laukoter, S. (2018). <i>Role of genomic imprinting in cerebral cortex development</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">https://doi.org/10.15479/AT:ISTA:th1057</a>","mla":"Laukoter, Susanne. <i>Role of Genomic Imprinting in Cerebral Cortex Development</i>. Institute of Science and Technology Austria, 2018, pp. 1–139, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>.","ista":"Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria.","ama":"Laukoter S. Role of genomic imprinting in cerebral cortex development. 2018:1-139. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th1057\">10.15479/AT:ISTA:th1057</a>","ieee":"S. Laukoter, “Role of genomic imprinting in cerebral cortex development,” Institute of Science and Technology Austria, 2018.","short":"S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute of Science and Technology Austria, 2018."},"file_date_updated":"2021-02-11T11:17:16Z","ddc":["570"],"oa_version":"Published Version","date_published":"2018-11-21T00:00:00Z","doi":"10.15479/AT:ISTA:th1057","publication_status":"published","month":"11","status":"public","oa":1,"publication_identifier":{"issn":["2663-337X"]},"_id":"10","abstract":[{"lang":"eng","text":"Genomic imprinting is an epigenetic process that leads to parent of origin-specific gene expression in a subset of genes. Imprinted genes are essential for brain development, and deregulation of imprinting is associated with neurodevelopmental diseases and the pathogenesis of psychiatric disorders. However, the cell-type specificity of imprinting at single cell resolution, and how imprinting and thus gene dosage regulates neuronal circuit assembly is still largely unknown. Here, MADM (Mosaic Analysis with Double Markers) technology was employed to assess genomic imprinting at single cell level. By visualizing MADM-induced uniparental disomies (UPDs) in distinct colors at single cell level in genetic mosaic animals, this experimental paradigm provides a unique quantitative platform to systematically assay the UPD-mediated imbalances in imprinted gene expression at unprecedented resolution. An experimental pipeline based on FACS, RNA-seq and bioinformatics analysis was established and applied to systematically map cell-type-specific ‘imprintomes’ in the mouse brain. The results revealed that parental-specific expression of imprinted genes per se is rarely cell-type-specific even at the individual cell level. Conversely, when we extended the comparison to downstream responses resulting from imbalanced imprinted gene expression, we discovered an unexpectedly high degree of cell-type specificity. Furthermore, we determined a novel function of genomic imprinting in cortical astrocyte production and in olfactory bulb (OB) granule cell generation. These results suggest important functional implication of genomic imprinting for generating cell-type diversity in the brain. In addition, MADM provides a powerful tool to study candidate genes by concomitant genetic manipulation and fluorescent labelling of single cells. MADM-based candidate gene approach was utilized to identify potential imprinted genes involved in the generation of cortical astrocytes and OB granule cells. We investigated p57Kip2, a maternally expressed gene and known cell cycle regulator. Although we found that p57Kip2 does not play a role in these processes, we detected an unexpected function of the paternal allele previously thought to be silent. Finally, we took advantage of a key property of MADM which is to allow unambiguous investigation of environmental impact on single cells. The experimental pipeline based on FACS and RNA-seq analysis of MADM-labeled cells was established to probe the functional differences of single cell loss of gene function compared to global loss of function on a transcriptional level. With this method, both common and distinct responses were isolated due to cell-autonomous and non-autonomous effects acting on genotypically identical cells. As a result, transcriptional changes were identified which result solely from the surrounding environment. Using the MADM technology to study genomic imprinting at single cell resolution, we have identified cell-type-specific gene expression, novel gene function and the impact of environment on single cell transcriptomes. Together, these provide important insights to the understanding of mechanisms regulating cell-type specificity and thus diversity in the brain."}],"date_updated":"2023-09-07T12:40:44Z","year":"2018","pubrep_id":"1057","article_processing_charge":"No","publist_id":"8046","type":"dissertation","department":[{"_id":"SiHi"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","date_created":"2018-12-11T11:44:08Z","page":"1 - 139","degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"supervisor":[{"orcid":"0000-0002-4579-8306","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","full_name":"Vicoso, Beatriz"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Institute of Science and Technology Austria","title":"Role of genomic imprinting in cerebral cortex development","author":[{"full_name":"Laukoter, Susanne","first_name":"Susanne","orcid":"0000-0002-7903-3010","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","last_name":"Laukoter"}],"file":[{"file_id":"6396","checksum":"41fdbf5fdce312802935d88a8ad9932c","creator":"dernst","access_level":"closed","date_updated":"2019-11-23T23:30:03Z","file_name":"Thesis_LaukoterSusanne_FINAL.docx","date_created":"2019-05-10T07:47:04Z","embargo_to":"open_access","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","file_size":17949175},{"access_level":"open_access","file_id":"6397","checksum":"53001a9a0c9e570e598d861bb0af28aa","creator":"dernst","date_created":"2019-05-10T07:47:04Z","file_name":"Thesis_LaukoterSusanne_FINAL.pdf","date_updated":"2021-02-11T11:17:16Z","embargo":"2019-11-21","file_size":21187245,"content_type":"application/pdf","relation":"main_file"}],"day":"21"},{"publication_identifier":{"issn":["10737928"]},"oa":1,"status":"public","ec_funded":1,"month":"05","year":"2018","arxiv":1,"issue":"10","abstract":[{"text":"We prove a new central limit theorem (CLT) for the difference of linear eigenvalue statistics of a Wigner random matrix H and its minor H and find that the fluctuation is much smaller than the fluctuations of the individual linear statistics, as a consequence of the strong correlation between the eigenvalues of H and H. In particular, our theorem identifies the fluctuation of Kerov's rectangular Young diagrams, defined by the interlacing eigenvalues ofH and H, around their asymptotic shape, the Vershik'Kerov'Logan'Shepp curve. Young diagrams equipped with the Plancherel measure follow the same limiting shape. For this, algebraically motivated, ensemble a CLT has been obtained in Ivanov and Olshanski [20] which is structurally similar to our result but the variance is different, indicating that the analogy between the two models has its limitations. Moreover, our theorem shows that Borodin's result [7] on the convergence of the spectral distribution of Wigner matrices to a Gaussian free field also holds in derivative sense.","lang":"eng"}],"date_updated":"2023-09-22T09:44:21Z","_id":"1012","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.05163"}],"scopus_import":"1","intvolume":"      2018","citation":{"apa":"Erdös, L., &#38; Schröder, D. J. (2018). Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. <i>International Mathematics Research Notices</i>. Oxford University Press. <a href=\"https://doi.org/10.1093/imrn/rnw330\">https://doi.org/10.1093/imrn/rnw330</a>","ista":"Erdös L, Schröder DJ. 2018. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. International Mathematics Research Notices. 2018(10), 3255–3298.","mla":"Erdös, László, and Dominik J. Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” <i>International Mathematics Research Notices</i>, vol. 2018, no. 10, Oxford University Press, 2018, pp. 3255–98, doi:<a href=\"https://doi.org/10.1093/imrn/rnw330\">10.1093/imrn/rnw330</a>.","chicago":"Erdös, László, and Dominik J Schröder. “Fluctuations of Rectangular Young Diagrams of Interlacing Wigner Eigenvalues.” <i>International Mathematics Research Notices</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1093/imrn/rnw330\">https://doi.org/10.1093/imrn/rnw330</a>.","ieee":"L. Erdös and D. J. Schröder, “Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues,” <i>International Mathematics Research Notices</i>, vol. 2018, no. 10. Oxford University Press, pp. 3255–3298, 2018.","ama":"Erdös L, Schröder DJ. Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues. <i>International Mathematics Research Notices</i>. 2018;2018(10):3255-3298. doi:<a href=\"https://doi.org/10.1093/imrn/rnw330\">10.1093/imrn/rnw330</a>","short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298."},"doi":"10.1093/imrn/rnw330","publication_status":"published","date_published":"2018-05-18T00:00:00Z","oa_version":"Preprint","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Oxford University Press","day":"18","isi":1,"author":[{"orcid":"0000-0001-5366-9603","first_name":"László","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","full_name":"Erdös, László"},{"full_name":"Schröder, Dominik J","orcid":"0000-0002-2904-1856","first_name":"Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder"}],"project":[{"name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7","_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804"}],"article_processing_charge":"No","publist_id":"6383","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6179"}]},"volume":2018,"quality_controlled":"1","external_id":{"arxiv":["1608.05163"],"isi":["000441668300009"]},"publication":"International Mathematics Research Notices","date_created":"2018-12-11T11:49:41Z","page":"3255-3298","department":[{"_id":"LaEr"}],"language":[{"iso":"eng"}],"type":"journal_article"},{"year":"2018","date_updated":"2021-11-15T10:48:49Z","abstract":[{"lang":"eng","text":"In this paper, we evaluate clock signals generated in ring oscillators and self-timed rings and the way their jitter can be transformed into random numbers. We show that counting the periods of the jittery clock signal produces random numbers of significantly better quality than the methods in which the jittery signal is simply sampled (the case in almost all current methods). Moreover, we use the counter values to characterize and continuously monitor the source of randomness. However, instead of using the widely used statistical variance, we propose to use Allan variance to do so. There are two main advantages: Allan variance is insensitive to low frequency noises such as flicker noise that are known to be autocorrelated and significantly less circuitry is required for its computation than that used to compute commonly used variance. We also show that it is essential to use a differential principle of randomness extraction from the jitter based on the use of two identical oscillators to avoid autocorrelations originating from external and internal global jitter sources and that this fact is valid for both kinds of rings. Last but not least, we propose a method of statistical testing based on high order Markov model to show the reduced dependencies when the proposed randomness extraction is applied."}],"issue":"3","_id":"10286","oa":1,"publication_identifier":{"eissn":["2569-2925"]},"status":"public","month":"01","publication_status":"published","doi":"10.13154/tches.v2018.i3.214-242","date_published":"2018-01-01T00:00:00Z","oa_version":"Published Version","ddc":["000"],"file_date_updated":"2021-11-15T10:27:29Z","scopus_import":"1","intvolume":"      2018","citation":{"mla":"Allini, Elie Noumon, et al. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3, International Association for Cryptologic Research, 2018, pp. 214–42, doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>.","apa":"Allini, E. N., Skórski, M., Petura, O., Bernard, F., Laban, M., &#38; Fischer, V. (2018). Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>","ista":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. 2018. Evaluation and monitoring of free running oscillators serving as source of randomness. IACR Transactions on Cryptographic Hardware and Embedded Systems. 2018(3), 214–242.","chicago":"Allini, Elie Noumon, Maciej Skórski, Oto Petura, Florent Bernard, Marek Laban, and Viktor Fischer. “Evaluation and Monitoring of Free Running Oscillators Serving as Source of Randomness.” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. International Association for Cryptologic Research, 2018. <a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">https://doi.org/10.13154/tches.v2018.i3.214-242</a>.","ieee":"E. N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, and V. Fischer, “Evaluation and monitoring of free running oscillators serving as source of randomness,” <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>, vol. 2018, no. 3. International Association for Cryptologic Research, pp. 214–242, 2018.","ama":"Allini EN, Skórski M, Petura O, Bernard F, Laban M, Fischer V. Evaluation and monitoring of free running oscillators serving as source of randomness. <i>IACR Transactions on Cryptographic Hardware and Embedded Systems</i>. 2018;2018(3):214-242. doi:<a href=\"https://doi.org/10.13154/tches.v2018.i3.214-242\">10.13154/tches.v2018.i3.214-242</a>","short":"E.N. Allini, M. Skórski, O. Petura, F. Bernard, M. Laban, V. Fischer, IACR Transactions on Cryptographic Hardware and Embedded Systems 2018 (2018) 214–242."},"day":"01","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"file":[{"success":1,"file_size":955755,"content_type":"application/pdf","relation":"main_file","access_level":"open_access","file_id":"10289","creator":"cchlebak","checksum":"b816b848f046c48a8357700d9305dce5","date_created":"2021-11-15T10:27:29Z","date_updated":"2021-11-15T10:27:29Z","file_name":"2018_IACR_Allini.pdf"}],"author":[{"full_name":"Allini, Elie Noumon","last_name":"Allini","first_name":"Elie Noumon"},{"id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","first_name":"Maciej","full_name":"Skórski, Maciej"},{"first_name":"Oto","last_name":"Petura","full_name":"Petura, Oto"},{"last_name":"Bernard","first_name":"Florent","full_name":"Bernard, Florent"},{"first_name":"Marek","last_name":"Laban","full_name":"Laban, Marek"},{"full_name":"Fischer, Viktor","last_name":"Fischer","first_name":"Viktor"}],"title":"Evaluation and monitoring of free running oscillators serving as source of randomness","publisher":"International Association for Cryptologic Research","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","page":"214-242","date_created":"2021-11-14T23:01:25Z","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"type":"journal_article","article_type":"original","article_processing_charge":"No","volume":2018,"quality_controlled":"1"},{"has_accepted_license":"1","publication":"Molecular Plant Pathology","date_created":"2018-12-11T11:44:39Z","page":"2277 - 2287","type":"journal_article","department":[{"_id":"GradSch"}],"language":[{"iso":"eng"}],"article_processing_charge":"No","publist_id":"7950","volume":19,"quality_controlled":"1","external_id":{"isi":["000445624100006"]},"acknowledgement":"the Austrian Science Fund (FWF): [P27429‐B22, P27818‐B22, I 3033‐B22], and the Austrian Academy of Science (OEAW).","tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","author":[{"last_name":"Seitner","first_name":"Denise","full_name":"Seitner, Denise"},{"first_name":"Simon","last_name":"Uhse","full_name":"Uhse, Simon"},{"full_name":"Gallei, Michelle C","last_name":"Gallei","id":"35A03822-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1286-7368","first_name":"Michelle C"},{"full_name":"Djamei, Armin","first_name":"Armin","last_name":"Djamei"}],"isi":1,"file":[{"creator":"dernst","file_id":"5740","access_level":"open_access","file_name":"2018_MolecPlantPath_Seitner.pdf","date_updated":"2018-12-18T09:46:00Z","date_created":"2018-12-18T09:46:00Z","content_type":"application/pdf","relation":"main_file","file_size":682335,"success":1}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Wiley","title":"The core effector Cce1 is required for early infection of maize by Ustilago maydis","doi":"10.1111/mpp.12698","publication_status":"published","oa_version":"Published Version","date_published":"2018-10-01T00:00:00Z","file_date_updated":"2018-12-18T09:46:00Z","scopus_import":"1","ddc":["580"],"intvolume":"        19","citation":{"chicago":"Seitner, Denise, Simon Uhse, Michelle C Gallei, and Armin Djamei. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>. Wiley, 2018. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>.","mla":"Seitner, Denise, et al. “The Core Effector Cce1 Is Required for Early Infection of Maize by Ustilago Maydis.” <i>Molecular Plant Pathology</i>, vol. 19, no. 10, Wiley, 2018, pp. 2277–87, doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>.","ista":"Seitner D, Uhse S, Gallei MC, Djamei A. 2018. The core effector Cce1 is required for early infection of maize by Ustilago maydis. Molecular Plant Pathology. 19(10), 2277–2287.","apa":"Seitner, D., Uhse, S., Gallei, M. C., &#38; Djamei, A. (2018). The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. Wiley. <a href=\"https://doi.org/10.1111/mpp.12698\">https://doi.org/10.1111/mpp.12698</a>","short":"D. Seitner, S. Uhse, M.C. Gallei, A. Djamei, Molecular Plant Pathology 19 (2018) 2277–2287.","ama":"Seitner D, Uhse S, Gallei MC, Djamei A. The core effector Cce1 is required for early infection of maize by Ustilago maydis. <i>Molecular Plant Pathology</i>. 2018;19(10):2277-2287. doi:<a href=\"https://doi.org/10.1111/mpp.12698\">10.1111/mpp.12698</a>","ieee":"D. Seitner, S. Uhse, M. C. Gallei, and A. Djamei, “The core effector Cce1 is required for early infection of maize by Ustilago maydis,” <i>Molecular Plant Pathology</i>, vol. 19, no. 10. Wiley, pp. 2277–2287, 2018."},"issue":"10","abstract":[{"text":"The biotrophic pathogen Ustilago maydis, the causative agent of corn smut disease, infects one of the most important crops worldwide – Zea mays. To successfully colonize its host, U. maydis secretes proteins, known as effectors, that suppress plant defense responses and facilitate the establishment of biotrophy. In this work, we describe the U. maydis effector protein Cce1. Cce1 is essential for virulence and is upregulated during infection. Through microscopic analysis and in vitro assays, we show that Cce1 is secreted from hyphae during filamentous growth of the fungus. Strikingly, Δcce1 mutants are blocked at early stages of infection and induce callose deposition as a plant defense response. Cce1 is highly conserved among smut fungi and the Ustilago bromivora ortholog complemented the virulence defect of the SG200Δcce1 deletion strain. These data indicate that Cce1 is a core effector with apoplastic localization that is essential for U. maydis to infect its host.","lang":"eng"}],"date_updated":"2023-09-19T10:06:42Z","year":"2018","_id":"104","status":"public","oa":1,"month":"10"},{"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","title":"Long geodesics on convex surfaces","author":[{"full_name":"Akopyan, Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","first_name":"Arseniy","orcid":"0000-0002-2548-617X"},{"full_name":"Petrunin, Anton","last_name":"Petrunin","first_name":"Anton"}],"isi":1,"day":"01","volume":40,"quality_controlled":"1","external_id":{"isi":["000444141200005"],"arxiv":["1702.05172"]},"article_processing_charge":"No","publist_id":"7948","type":"journal_article","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"publication":"Mathematical Intelligencer","page":"26 - 31","date_created":"2018-12-11T11:44:40Z","month":"09","status":"public","oa":1,"_id":"106","arxiv":1,"issue":"3","abstract":[{"text":"The goal of this article is to introduce the reader to the theory of intrinsic geometry of convex surfaces. We illustrate the power of the tools by proving a theorem on convex surfaces containing an arbitrarily long closed simple geodesic. Let us remind ourselves that a curve in a surface is called geodesic if every sufficiently short arc of the curve is length minimizing; if, in addition, it has no self-intersections, we call it simple geodesic. A tetrahedron with equal opposite edges is called isosceles. The axiomatic method of Alexandrov geometry allows us to work with the metrics of convex surfaces directly, without approximating it first by a smooth or polyhedral metric. Such approximations destroy the closed geodesics on the surface; therefore it is difficult (if at all possible) to apply approximations in the proof of our theorem. On the other hand, a proof in the smooth or polyhedral case usually admits a translation into Alexandrov’s language; such translation makes the result more general. In fact, our proof resembles a translation of the proof given by Protasov. Note that the main theorem implies in particular that a smooth convex surface does not have arbitrarily long simple closed geodesics. However we do not know a proof of this corollary that is essentially simpler than the one presented below.","lang":"eng"}],"date_updated":"2023-09-13T08:49:16Z","year":"2018","citation":{"ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","mla":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>, vol. 40, no. 3, Springer, 2018, pp. 26–31, doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>.","apa":"Akopyan, A., &#38; Petrunin, A. (2018). Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. Springer. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>","chicago":"Akopyan, Arseniy, and Anton Petrunin. “Long Geodesics on Convex Surfaces.” <i>Mathematical Intelligencer</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00283-018-9795-5\">https://doi.org/10.1007/s00283-018-9795-5</a>.","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","ama":"Akopyan A, Petrunin A. Long geodesics on convex surfaces. <i>Mathematical Intelligencer</i>. 2018;40(3):26-31. doi:<a href=\"https://doi.org/10.1007/s00283-018-9795-5\">10.1007/s00283-018-9795-5</a>","short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31."},"intvolume":"        40","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1702.05172"}],"scopus_import":"1","oa_version":"Preprint","date_published":"2018-09-01T00:00:00Z","doi":"10.1007/s00283-018-9795-5","publication_status":"published"},{"file":[{"content_type":"application/pdf","relation":"main_file","file_size":482518,"success":1,"file_id":"5844","creator":"dernst","access_level":"open_access","date_updated":"2019-01-18T09:27:36Z","file_name":"2018_DiscreteComp_Akopyan.pdf","date_created":"2019-01-18T09:27:36Z"}],"isi":1,"author":[{"full_name":"Akopyan, Arseniy","orcid":"0000-0002-2548-617X","first_name":"Arseniy","last_name":"Akopyan","id":"430D2C90-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Alexey","last_name":"Balitskiy","full_name":"Balitskiy, Alexey"},{"last_name":"Grigorev","first_name":"Mikhail","full_name":"Grigorev, Mikhail"}],"project":[{"_id":"25681D80-B435-11E9-9278-68D0E5697425","grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"tmp":{"short":"CC BY (4.0)","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"day":"01","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Springer","department":[{"_id":"HeEd"}],"language":[{"iso":"eng"}],"type":"journal_article","publication":"Discrete & Computational Geometry","date_created":"2018-12-11T11:49:57Z","page":"1001-1009","has_accepted_license":"1","volume":59,"quality_controlled":"1","external_id":{"isi":["000432205500011"]},"article_type":"original","article_processing_charge":"Yes (via OA deal)","publist_id":"6324","_id":"1064","year":"2018","abstract":[{"lang":"eng","text":"In 1945, A.W. Goodman and R.E. Goodman proved the following conjecture by P. Erdős: Given a family of (round) disks of radii r1, … , rn in the plane, it is always possible to cover them by a disk of radius R= ∑ ri, provided they cannot be separated into two subfamilies by a straight line disjoint from the disks. In this note we show that essentially the same idea may work for different analogues and generalizations of their result. In particular, we prove the following: Given a family of positive homothetic copies of a fixed convex body K⊂ Rd with homothety coefficients τ1, … , τn> 0 , it is always possible to cover them by a translate of d+12(∑τi)K, provided they cannot be separated into two subfamilies by a hyperplane disjoint from the homothets."}],"issue":"4","date_updated":"2023-09-20T12:08:51Z","ec_funded":1,"month":"06","oa":1,"publication_identifier":{"eissn":["14320444"],"issn":["01795376"]},"status":"public","date_published":"2018-06-01T00:00:00Z","oa_version":"Published Version","doi":"10.1007/s00454-017-9883-x","publication_status":"published","intvolume":"        59","citation":{"apa":"Akopyan, A., Balitskiy, A., &#38; Grigorev, M. (2018). On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>","ista":"Akopyan A, Balitskiy A, Grigorev M. 2018. On the circle covering theorem by A.W. Goodman and R.E. Goodman. Discrete &#38; Computational Geometry. 59(4), 1001–1009.","mla":"Akopyan, Arseniy, et al. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4, Springer, 2018, pp. 1001–09, doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>.","chicago":"Akopyan, Arseniy, Alexey Balitskiy, and Mikhail Grigorev. “On the Circle Covering Theorem by A.W. Goodman and R.E. Goodman.” <i>Discrete &#38; Computational Geometry</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00454-017-9883-x\">https://doi.org/10.1007/s00454-017-9883-x</a>.","short":"A. Akopyan, A. Balitskiy, M. Grigorev, Discrete &#38; Computational Geometry 59 (2018) 1001–1009.","ama":"Akopyan A, Balitskiy A, Grigorev M. On the circle covering theorem by A.W. Goodman and R.E. Goodman. <i>Discrete &#38; Computational Geometry</i>. 2018;59(4):1001-1009. doi:<a href=\"https://doi.org/10.1007/s00454-017-9883-x\">10.1007/s00454-017-9883-x</a>","ieee":"A. Akopyan, A. Balitskiy, and M. Grigorev, “On the circle covering theorem by A.W. Goodman and R.E. Goodman,” <i>Discrete &#38; Computational Geometry</i>, vol. 59, no. 4. Springer, pp. 1001–1009, 2018."},"ddc":["516","000"],"scopus_import":"1","file_date_updated":"2019-01-18T09:27:36Z"},{"date_published":"2018-08-04T00:00:00Z","oa_version":"Submitted Version","publication_status":"published","doi":"10.1145/3197517.3201341","intvolume":"        37","citation":{"short":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, B. Bickel, ACM Transaction on Graphics 37 (2018).","ama":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>","ieee":"K. Nakashima, T. Auzinger, E. Iarussi, R. Zhang, T. Igarashi, and B. Bickel, “CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds,” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4. ACM, 2018.","mla":"Nakashima, Kazutaka, et al. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>, vol. 37, no. 4, 135, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201341\">10.1145/3197517.3201341</a>.","apa":"Nakashima, K., Auzinger, T., Iarussi, E., Zhang, R., Igarashi, T., &#38; Bickel, B. (2018). CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. <i>ACM Transaction on Graphics</i>. ACM. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>","ista":"Nakashima K, Auzinger T, Iarussi E, Zhang R, Igarashi T, Bickel B. 2018. CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds. ACM Transaction on Graphics. 37(4), 135.","chicago":"Nakashima, Kazutaka, Thomas Auzinger, Emmanuel Iarussi, Ran Zhang, Takeo Igarashi, and Bernd Bickel. “CoreCavity: Interactive Shell Decomposition for Fabrication with Two-Piece Rigid Molds.” <i>ACM Transaction on Graphics</i>. ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201341\">https://doi.org/10.1145/3197517.3201341</a>."},"ddc":["004","516","670"],"file_date_updated":"2020-07-14T12:44:38Z","scopus_import":"1","_id":"12","article_number":"135","year":"2018","date_updated":"2023-09-11T12:48:09Z","abstract":[{"lang":"eng","text":"Molding is a popular mass production method, in which the initial expenses for the mold are offset by the low per-unit production cost. However, the physical fabrication constraints of the molding technique commonly restrict the shape of moldable objects. For a complex shape, a decomposition of the object into moldable parts is a common strategy to address these constraints, with plastic model kits being a popular and illustrative example. However, conducting such a decomposition requires considerable expertise, and it depends on the technical aspects of the fabrication technique, as well as aesthetic considerations. We present an interactive technique to create such decompositions for two-piece molding, in which each part of the object is cast between two rigid mold pieces. Given the surface description of an object, we decompose its thin-shell equivalent into moldable parts by first performing a coarse decomposition and then utilizing an active contour model for the boundaries between individual parts. Formulated as an optimization problem, the movement of the contours is guided by an energy reflecting fabrication constraints to ensure the moldability of each part. Simultaneously, the user is provided with editing capabilities to enforce aesthetic guidelines. Our interactive interface provides control of the contour positions by allowing, for example, the alignment of part boundaries with object features. Our technique enables a novel workflow, as it empowers novice users to explore the design space, and it generates fabrication-ready two-piece molds that can be used either for casting or industrial injection molding of free-form objects."}],"issue":"4","ec_funded":1,"month":"08","oa":1,"status":"public","language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"type":"journal_article","date_created":"2018-12-11T11:44:09Z","publication":"ACM Transaction on Graphics","has_accepted_license":"1","related_material":{"link":[{"url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/","description":"News on IST Homepage","relation":"press_release"}]},"external_id":{"isi":["000448185000096"]},"quality_controlled":"1","volume":37,"publist_id":"8044","pubrep_id":"1037","article_processing_charge":"No","file":[{"content_type":"application/pdf","relation":"main_file","file_size":104225664,"creator":"system","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","file_id":"5360","access_level":"open_access","file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-12T10:18:38Z"},{"file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-12T10:18:39Z","checksum":"3861e693ba47c51f3ec7b7867d573a61","file_id":"5361","creator":"system","access_level":"open_access","relation":"main_file","content_type":"application/zip","file_size":377743553},{"access_level":"open_access","checksum":"490040c685ed869536e2a18f5a906b94","file_id":"5362","creator":"system","date_created":"2018-12-12T10:18:41Z","date_updated":"2020-07-14T12:44:38Z","file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","file_size":162634396,"relation":"main_file","content_type":"video/vnd.objectvideo"},{"content_type":"image/jpeg","relation":"main_file","file_size":527972,"file_id":"5363","checksum":"be7fc8b229adda727419b6504b3b9352","creator":"system","access_level":"open_access","date_updated":"2020-07-14T12:44:38Z","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","date_created":"2018-12-12T10:18:42Z"}],"project":[{"call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","_id":"24F9549A-B435-11E9-9278-68D0E5697425","grant_number":"715767"},{"call_identifier":"H2020","name":"Distributed 3D Object Design","grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425"}],"author":[{"full_name":"Nakashima, Kazutaka","first_name":"Kazutaka","last_name":"Nakashima"},{"orcid":"0000-0002-1546-3265","first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","full_name":"Auzinger, Thomas"},{"full_name":"Iarussi, Emmanuel","first_name":"Emmanuel","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","last_name":"Iarussi"},{"full_name":"Zhang, Ran","last_name":"Zhang","id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-3808-281X","first_name":"Ran"},{"first_name":"Takeo","last_name":"Igarashi","full_name":"Igarashi, Takeo"},{"full_name":"Bickel, Bernd","orcid":"0000-0001-6511-9385","first_name":"Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87"}],"isi":1,"day":"04","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","publisher":"ACM","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1"}]