[{"author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","first_name":"Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Khanna","first_name":"Rajiv","full_name":"Khanna, Rajiv"},{"first_name":"Joydeep","last_name":"Ghosh","full_name":"Ghosh, Joydeep"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"}],"day":"15","extern":"1","alternative_title":["PMLR"],"title":"Boosting variational inference: An optimization perspective","publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"type":"conference","page":"464-472","date_created":"2023-08-22T14:15:20Z","publication":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics","external_id":{"arxiv":["1708.01733"]},"quality_controlled":"1","volume":84,"article_processing_charge":"No","_id":"14201","year":"2018","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,"month":"04","oa":1,"status":"public","date_published":"2018-04-15T00:00:00Z","oa_version":"Preprint","conference":{"start_date":"2018-04-09","name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2018-04-11","location":"Playa Blanca, Lanzarote"},"publication_status":"published","intvolume":"        84","citation":{"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.","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.","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.","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.","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."},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1708.01733","open_access":"1"}]},{"status":"public","publication_identifier":{"isbn":["9781510884472"],"eissn":["1049-5258"]},"oa":1,"month":"06","arxiv":1,"abstract":[{"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.","lang":"eng"}],"date_updated":"2023-09-13T07:38:24Z","year":"2018","_id":"14202","scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1806.02185","open_access":"1"}],"citation":{"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.","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.","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.","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.","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.","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.","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."},"intvolume":"        31","conference":{"location":"Montreal, Canada","end_date":"2018-12-08","name":"NeurIPS: Neural Information Processing Systems","start_date":"2018-12-03"},"publication_status":"published","oa_version":"Preprint","date_published":"2018-06-06T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"Neural Information Processing Systems Foundation","title":"Boosting black box variational inference","extern":"1","day":"06","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco"},{"full_name":"Dresdner, Gideon","first_name":"Gideon","last_name":"Dresdner"},{"first_name":"Rajiv","last_name":"Khanna","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"}],"article_processing_charge":"No","quality_controlled":"1","volume":31,"external_id":{"arxiv":["1806.02185"]},"publication":"Advances in Neural Information Processing Systems","date_created":"2023-08-22T14:15:40Z","type":"conference","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}]},{"status":"public","oa":1,"month":"07","date_updated":"2023-09-13T08:13:39Z","arxiv":1,"abstract":[{"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.","lang":"eng"}],"year":"2018","_id":"14203","main_file_link":[{"url":"https://arxiv.org/abs/1804.08544","open_access":"1"}],"citation":{"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.","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.","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.","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."},"intvolume":"        80","conference":{"start_date":"2018-07-10","name":"ICML: International Conference on Machine Learning","end_date":"2018-07-15","location":"Stockholm, Sweden"},"publication_status":"published","oa_version":"Preprint","date_published":"2018-07-15T00:00:00Z","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","alternative_title":["PMLR"],"day":"15","extern":"1","author":[{"full_name":"Yurtsever, Alp","last_name":"Yurtsever","first_name":"Alp"},{"last_name":"Fercoq","first_name":"Olivier","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"},{"full_name":"Cevher, Volkan","first_name":"Volkan","last_name":"Cevher"}],"article_processing_charge":"No","external_id":{"arxiv":["1804.08544"]},"volume":80,"quality_controlled":"1","page":"5727-5736","date_created":"2023-08-22T14:16:01Z","publication":"Proceedings of the 35th International Conference on Machine Learning","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}]},{"date_created":"2023-08-22T14:16:25Z","page":"3198-3207","publication":"Proceedings of the 35th International Conference on Machine Learning","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"article_processing_charge":"No","external_id":{"arxiv":["1803.09539"]},"volume":80,"quality_controlled":"1","day":"01","extern":"1","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco"},{"first_name":"Anant","last_name":"Raj","full_name":"Raj, Anant"},{"first_name":"Sai Praneeth","last_name":"Karimireddy","full_name":"Karimireddy, Sai Praneeth"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"},{"last_name":"Schölkopf","first_name":"Bernhard","full_name":"Schölkopf, Bernhard"},{"full_name":"Stich, Sebastian U.","last_name":"Stich","first_name":"Sebastian U."},{"full_name":"Jaggi, Martin","first_name":"Martin","last_name":"Jaggi"}],"publisher":"ML Research Press","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","title":"On matching pursuit and coordinate descent","alternative_title":["PMLR"],"publication_status":"published","oa_version":"Preprint","date_published":"2018-07-01T00:00:00Z","scopus_import":"1","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.09539"}],"intvolume":"        80","citation":{"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.","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.","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.","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.","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."},"date_updated":"2023-09-13T08:19:05Z","arxiv":1,"abstract":[{"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.","lang":"eng"}],"year":"2018","_id":"14204","status":"public","oa":1,"month":"07"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","status":"public","oa":1,"title":"Clustering meets implicit generative models","month":"05","arxiv":1,"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."}],"date_updated":"2023-09-13T09:08:24Z","year":"2018","extern":"1","day":"01","author":[{"full_name":"Locatello, Francesco","last_name":"Locatello","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","first_name":"Francesco"},{"full_name":"Vincent, Damien","last_name":"Vincent","first_name":"Damien"},{"full_name":"Tolstikhin, Ilya","last_name":"Tolstikhin","first_name":"Ilya"},{"full_name":"Ratsch, Gunnar","first_name":"Gunnar","last_name":"Ratsch"},{"full_name":"Gelly, Sylvain","first_name":"Sylvain","last_name":"Gelly"},{"first_name":"Bernhard","last_name":"Scholkopf","full_name":"Scholkopf, Bernhard"}],"_id":"14224","article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.11130"}],"scopus_import":"1","citation":{"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.","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.","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.","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.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf, in:, 6th International Conference on Learning Representations, 2018."},"quality_controlled":"1","external_id":{"arxiv":["1804.11130"]},"conference":{"end_date":"2018-05-03","location":"Vancouver, Canada","start_date":"2018-04-30","name":"International Conference on Machine Learning"},"publication_status":"published","publication":"6th International Conference on Learning Representations","date_created":"2023-08-22T14:25:34Z","oa_version":"Preprint","type":"conference","date_published":"2018-05-01T00:00:00Z","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}]},{"status":"public","oa":1,"publication_identifier":{"isbn":["978-1-4503-5583-4"]},"month":"07","ec_funded":1,"date_updated":"2025-06-02T08:53:48Z","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"}],"year":"2018","_id":"143","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10985"}],"scopus_import":"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>.","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.","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>","short":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194."},"publication_status":"published","conference":{"start_date":"2018-07-09","name":"LICS: Logic in Computer Science","end_date":"2018-07-12","location":"Oxford, United Kingdom"},"doi":"10.1145/3209108.3209191","oa_version":"Preprint","date_published":"2018-07-09T00:00:00Z","publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Efficient algorithms for asymptotic bounds on termination time in VASS","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"day":"09","project":[{"name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003","_id":"25892FC0-B435-11E9-9278-68D0E5697425"},{"_id":"2581B60A-B435-11E9-9278-68D0E5697425","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","call_identifier":"FP7"},{"grant_number":"S 11407_N23","_id":"25832EC2-B435-11E9-9278-68D0E5697425","name":"Rigorous Systems Engineering","call_identifier":"FWF"}],"isi":1,"author":[{"last_name":"Brázdil","first_name":"Tomáš","full_name":"Brázdil, Tomáš"},{"full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"},{"full_name":"Novotny, Petr","first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Dominik","last_name":"Velan","full_name":"Velan, Dominik"},{"last_name":"Zuleger","first_name":"Florian","full_name":"Zuleger, Florian"}],"publist_id":"7780","article_processing_charge":"No","external_id":{"isi":["000545262800020"]},"quality_controlled":"1","volume":"F138033","date_created":"2018-12-11T11:44:51Z","page":"185 - 194","type":"conference","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}]},{"type":"journal_article","department":[{"_id":"JiFr"}],"language":[{"iso":"eng"}],"has_accepted_license":"1","publication":"Journal of Cell Science","date_created":"2018-12-11T11:49:10Z","volume":131,"quality_controlled":"1","external_id":{"isi":["000424842400019"]},"pubrep_id":"988","article_processing_charge":"No","publist_id":"6530","isi":1,"author":[{"full_name":"Tejos, Ricardo","last_name":"Tejos","first_name":"Ricardo"},{"full_name":"Rodríguez Furlán, Cecilia","first_name":"Cecilia","last_name":"Rodríguez Furlán"},{"full_name":"Adamowski, Maciek","orcid":"0000-0001-6463-5257","first_name":"Maciek","last_name":"Adamowski","id":"45F536D2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sauer, Michael","first_name":"Michael","last_name":"Sauer"},{"last_name":"Norambuena","first_name":"Lorena","full_name":"Norambuena, Lorena"},{"orcid":"0000-0002-8302-7596","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","full_name":"Friml, Jirí"}],"project":[{"name":"Polarity and subcellular dynamics in plants","call_identifier":"FP7","grant_number":"282300","_id":"25716A02-B435-11E9-9278-68D0E5697425"}],"file":[{"checksum":"bf156c20a4f117b4b932370d54cbac8c","creator":"dernst","file_id":"6299","access_level":"open_access","date_updated":"2020-07-14T12:48:15Z","file_name":"2017_adamowski_PATELLINS_are.pdf","date_created":"2019-04-12T08:46:32Z","content_type":"application/pdf","relation":"main_file","file_size":14925985}],"day":"29","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Company of Biologists","title":"PATELLINS are regulators of auxin mediated PIN1 relocation and plant development in Arabidopsis thaliana","oa_version":"Published Version","date_published":"2018-01-29T00:00:00Z","doi":"10.1242/jcs.204198","publication_status":"published","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>.","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.","short":"R. Tejos, C. Rodríguez Furlán, M. Adamowski, M. Sauer, L. Norambuena, J. Friml, Journal of Cell Science 131 (2018)."},"scopus_import":"1","file_date_updated":"2020-07-14T12:48:15Z","ddc":["581"],"article_number":"jcs.204198","_id":"913","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"}],"issue":"2","date_updated":"2025-05-07T11:12:29Z","year":"2018","month":"01","ec_funded":1,"status":"public","oa":1,"publication_identifier":{"issn":["00219533"]}},{"day":"30","author":[{"orcid":"0000-0001-8559-3973","first_name":"Johann G","id":"42EFD3B6-F248-11E8-B48F-1D18A9856A87","last_name":"Danzl","full_name":"Danzl, Johann G"}],"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"],"page":"11","date_created":"2021-03-07T23:01:25Z","publication":"Opera Medica et Physiologica","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"JoDa"}],"article_processing_charge":"No","article_type":"letter_note","quality_controlled":"1","volume":4,"date_updated":"2021-12-03T07:31:05Z","issue":"S1","year":"2018","_id":"9229","status":"public","oa":1,"publication_identifier":{"eissn":["2500-2295"],"issn":["2500-2287"]},"month":"06","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":{"short":"J.G. Danzl, Opera Medica et Physiologica 4 (2018) 11.","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.","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>","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>","ista":"Danzl JG. 2018. Diffraction-unlimited optical imaging for synaptic physiology. Opera Medica et Physiologica. 4(S1), 11.","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>.","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>."},"intvolume":"         4"},{"_id":"9471","year":"2018","date_updated":"2021-12-14T07:53:40Z","issue":"20","abstract":[{"lang":"eng","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."}],"month":"05","oa":1,"publication_identifier":{"eissn":["1091-6490"],"issn":["0027-8424"]},"status":"public","date_published":"2018-05-15T00:00:00Z","oa_version":"Published Version","publication_status":"published","doi":"10.1073/pnas.1713333115","intvolume":"       115","citation":{"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.","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>","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>.","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.","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>.","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>"},"ddc":["580"],"file_date_updated":"2021-06-07T06:16:38Z","scopus_import":"1","file":[{"file_size":3045260,"success":1,"relation":"main_file","content_type":"application/pdf","access_level":"open_access","checksum":"810260dc0e3cc3033e15c19ad0dc123e","file_id":"9472","creator":"asandaue","date_created":"2021-06-07T06:16:38Z","date_updated":"2021-06-07T06:16:38Z","file_name":"2018_PNAS_Frost.pdf"}],"author":[{"last_name":"Frost","first_name":"Jennifer M.","full_name":"Frost, Jennifer M."},{"full_name":"Kim, M. Yvonne","first_name":"M. Yvonne","last_name":"Kim"},{"full_name":"Park, Guen Tae","first_name":"Guen Tae","last_name":"Park"},{"first_name":"Ping-Hung","last_name":"Hsieh","full_name":"Hsieh, Ping-Hung"},{"first_name":"Miyuki","last_name":"Nakamura","full_name":"Nakamura, Miyuki"},{"full_name":"Lin, Samuel J. H.","last_name":"Lin","first_name":"Samuel J. H."},{"full_name":"Yoo, Hyunjin","first_name":"Hyunjin","last_name":"Yoo"},{"first_name":"Jaemyung","last_name":"Choi","full_name":"Choi, Jaemyung"},{"full_name":"Ikeda, Yoko","first_name":"Yoko","last_name":"Ikeda"},{"last_name":"Kinoshita","first_name":"Tetsu","full_name":"Kinoshita, Tetsu"},{"last_name":"Choi","first_name":"Yeonhee","full_name":"Choi, Yeonhee"},{"full_name":"Zilberman, Daniel","first_name":"Daniel","orcid":"0000-0002-0123-8649","id":"6973db13-dd5f-11ea-814e-b3e5455e9ed1","last_name":"Zilberman"},{"full_name":"Fischer, Robert L.","last_name":"Fischer","first_name":"Robert L."}],"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"},"day":"15","extern":"1","pmid":1,"license":"https://creativecommons.org/licenses/by-nc-nd/4.0/","title":"FACT complex is required for DNA demethylation at heterochromatin during reproduction in Arabidopsis","publisher":"National Academy of Sciences","user_id":"8b945eb4-e2f2-11eb-945a-df72226e66a9","language":[{"iso":"eng"}],"department":[{"_id":"DaZi"}],"type":"journal_article","date_created":"2021-06-07T06:11:28Z","page":"E4720-E4729","publication":"Proceedings of the National Academy of Sciences","has_accepted_license":"1","related_material":{"link":[{"relation":"earlier_version","url":"https://doi.org/10.1101/187674 "}]},"external_id":{"pmid":["29712855"]},"keyword":["Multidisciplinary"],"volume":115,"quality_controlled":"1","article_processing_charge":"No","article_type":"original"},{"publication_identifier":{"issn":["2663-337X"]},"oa":1,"status":"public","month":"11","year":"2018","date_updated":"2023-09-07T12:40:44Z","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."}],"_id":"10","ddc":["570"],"file_date_updated":"2021-02-11T11:17:16Z","citation":{"ieee":"S. Laukoter, “Role of genomic imprinting in cerebral cortex development,” Institute of Science and Technology Austria, 2018.","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>","short":"S. Laukoter, Role of Genomic Imprinting in Cerebral Cortex Development, Institute of Science and Technology Austria, 2018.","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>.","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>","ista":"Laukoter S. 2018. Role of genomic imprinting in cerebral cortex development. Institute of Science and Technology Austria.","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>."},"publication_status":"published","doi":"10.15479/AT:ISTA:th1057","date_published":"2018-11-21T00:00:00Z","oa_version":"Published Version","title":"Role of genomic imprinting in cerebral cortex development","publisher":"Institute of Science and Technology Austria","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","supervisor":[{"orcid":"0000-0002-4579-8306","first_name":"Beatriz","id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","last_name":"Vicoso","full_name":"Vicoso, Beatriz"}],"degree_awarded":"PhD","alternative_title":["ISTA Thesis"],"day":"21","file":[{"content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","relation":"source_file","file_size":17949175,"embargo_to":"open_access","file_name":"Thesis_LaukoterSusanne_FINAL.docx","date_updated":"2019-11-23T23:30:03Z","date_created":"2019-05-10T07:47:04Z","file_id":"6396","creator":"dernst","checksum":"41fdbf5fdce312802935d88a8ad9932c","access_level":"closed"},{"content_type":"application/pdf","relation":"main_file","embargo":"2019-11-21","file_size":21187245,"file_name":"Thesis_LaukoterSusanne_FINAL.pdf","date_updated":"2021-02-11T11:17:16Z","date_created":"2019-05-10T07:47:04Z","file_id":"6397","checksum":"53001a9a0c9e570e598d861bb0af28aa","creator":"dernst","access_level":"open_access"}],"author":[{"full_name":"Laukoter, Susanne","first_name":"Susanne","orcid":"0000-0002-7903-3010","id":"2D6B7A9A-F248-11E8-B48F-1D18A9856A87","last_name":"Laukoter"}],"publist_id":"8046","article_processing_charge":"No","pubrep_id":"1057","page":"1 - 139","date_created":"2018-12-11T11:44:08Z","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"SiHi"}],"type":"dissertation"},{"oa_version":"Preprint","date_published":"2018-05-18T00:00:00Z","publication_status":"published","doi":"10.1093/imrn/rnw330","intvolume":"      2018","citation":{"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>.","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>.","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.","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>","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>","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.","short":"L. Erdös, D.J. Schröder, International Mathematics Research Notices 2018 (2018) 3255–3298."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1608.05163"}],"scopus_import":"1","_id":"1012","date_updated":"2023-09-22T09:44:21Z","arxiv":1,"issue":"10","abstract":[{"lang":"eng","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."}],"year":"2018","month":"05","ec_funded":1,"status":"public","publication_identifier":{"issn":["10737928"]},"oa":1,"type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"LaEr"}],"page":"3255-3298","date_created":"2018-12-11T11:49:41Z","publication":"International Mathematics Research Notices","external_id":{"arxiv":["1608.05163"],"isi":["000441668300009"]},"quality_controlled":"1","volume":2018,"related_material":{"record":[{"status":"public","relation":"dissertation_contains","id":"6179"}]},"publist_id":"6383","article_processing_charge":"No","project":[{"_id":"258DCDE6-B435-11E9-9278-68D0E5697425","grant_number":"338804","name":"Random matrices, universality and disordered quantum systems","call_identifier":"FP7"}],"author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","last_name":"Erdös","orcid":"0000-0001-5366-9603","first_name":"László","full_name":"Erdös, László"},{"full_name":"Schröder, Dominik J","id":"408ED176-F248-11E8-B48F-1D18A9856A87","last_name":"Schröder","first_name":"Dominik J","orcid":"0000-0002-2904-1856"}],"isi":1,"day":"18","publisher":"Oxford University Press","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Fluctuations of rectangular young diagrams of interlacing wigner eigenvalues"},{"publication_status":"published","doi":"10.13154/tches.v2018.i3.214-242","date_published":"2018-01-01T00:00:00Z","oa_version":"Published Version","ddc":["000"],"scopus_import":"1","file_date_updated":"2021-11-15T10:27:29Z","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>.","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.","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>","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."},"year":"2018","date_updated":"2021-11-15T10:48:49Z","abstract":[{"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.","lang":"eng"}],"issue":"3","_id":"10286","oa":1,"publication_identifier":{"eissn":["2569-2925"]},"status":"public","month":"01","date_created":"2021-11-14T23:01:25Z","page":"214-242","publication":"IACR Transactions on Cryptographic Hardware and Embedded Systems","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"KrPi"}],"type":"journal_article","article_processing_charge":"No","article_type":"original","quality_controlled":"1","volume":2018,"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","file":[{"creator":"cchlebak","file_id":"10289","checksum":"b816b848f046c48a8357700d9305dce5","access_level":"open_access","file_name":"2018_IACR_Allini.pdf","date_updated":"2021-11-15T10:27:29Z","date_created":"2021-11-15T10:27:29Z","relation":"main_file","content_type":"application/pdf","success":1,"file_size":955755}],"author":[{"first_name":"Elie Noumon","last_name":"Allini","full_name":"Allini, Elie Noumon"},{"first_name":"Maciej","id":"EC09FA6A-02D0-11E9-8223-86B7C91467DD","last_name":"Skórski","full_name":"Skórski, Maciej"},{"full_name":"Petura, Oto","last_name":"Petura","first_name":"Oto"},{"full_name":"Bernard, Florent","first_name":"Florent","last_name":"Bernard"},{"first_name":"Marek","last_name":"Laban","full_name":"Laban, Marek"},{"first_name":"Viktor","last_name":"Fischer","full_name":"Fischer, 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"},{"external_id":{"arxiv":["1702.05172"],"isi":["000444141200005"]},"volume":40,"quality_controlled":"1","publist_id":"7948","article_processing_charge":"No","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"date_created":"2018-12-11T11:44:40Z","page":"26 - 31","publication":"Mathematical Intelligencer","publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"Long geodesics on convex surfaces","isi":1,"author":[{"orcid":"0000-0002-2548-617X","first_name":"Arseniy","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan","full_name":"Akopyan, Arseniy"},{"full_name":"Petrunin, Anton","last_name":"Petrunin","first_name":"Anton"}],"day":"01","intvolume":"        40","citation":{"short":"A. Akopyan, A. Petrunin, Mathematical Intelligencer 40 (2018) 26–31.","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>","ieee":"A. Akopyan and A. Petrunin, “Long geodesics on convex surfaces,” <i>Mathematical Intelligencer</i>, vol. 40, no. 3. Springer, pp. 26–31, 2018.","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>.","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>.","ista":"Akopyan A, Petrunin A. 2018. Long geodesics on convex surfaces. Mathematical Intelligencer. 40(3), 26–31.","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>"},"scopus_import":"1","main_file_link":[{"url":"https://arxiv.org/abs/1702.05172","open_access":"1"}],"oa_version":"Preprint","date_published":"2018-09-01T00:00:00Z","publication_status":"published","doi":"10.1007/s00283-018-9795-5","month":"09","status":"public","oa":1,"_id":"106","date_updated":"2023-09-13T08:49:16Z","issue":"3","arxiv":1,"abstract":[{"lang":"eng","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."}],"year":"2018"},{"publisher":"Springer","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"On the circle covering theorem by A.W. Goodman and R.E. Goodman","project":[{"grant_number":"291734","_id":"25681D80-B435-11E9-9278-68D0E5697425","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7"}],"isi":1,"author":[{"full_name":"Akopyan, Arseniy","first_name":"Arseniy","orcid":"0000-0002-2548-617X","id":"430D2C90-F248-11E8-B48F-1D18A9856A87","last_name":"Akopyan"},{"full_name":"Balitskiy, Alexey","last_name":"Balitskiy","first_name":"Alexey"},{"first_name":"Mikhail","last_name":"Grigorev","full_name":"Grigorev, Mikhail"}],"file":[{"access_level":"open_access","file_id":"5844","creator":"dernst","date_created":"2019-01-18T09:27:36Z","date_updated":"2019-01-18T09:27:36Z","file_name":"2018_DiscreteComp_Akopyan.pdf","file_size":482518,"success":1,"content_type":"application/pdf","relation":"main_file"}],"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","external_id":{"isi":["000432205500011"]},"volume":59,"quality_controlled":"1","publist_id":"6324","article_type":"original","article_processing_charge":"Yes (via OA deal)","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"HeEd"}],"has_accepted_license":"1","page":"1001-1009","date_created":"2018-12-11T11:49:57Z","publication":"Discrete & Computational Geometry","month":"06","ec_funded":1,"status":"public","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"oa":1,"_id":"1064","date_updated":"2023-09-20T12:08:51Z","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","year":"2018","citation":{"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.","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>.","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.","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>."},"intvolume":"        59","scopus_import":"1","file_date_updated":"2019-01-18T09:27:36Z","ddc":["516","000"],"oa_version":"Published Version","date_published":"2018-06-01T00:00:00Z","publication_status":"published","doi":"10.1007/s00454-017-9883-x"},{"publisher":"ACM","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","title":"CoreCavity: Interactive shell decomposition for fabrication with two-piece rigid molds","day":"04","project":[{"grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling"},{"name":"Distributed 3D Object Design","call_identifier":"H2020","grant_number":"642841","_id":"2508E324-B435-11E9-9278-68D0E5697425"}],"author":[{"first_name":"Kazutaka","last_name":"Nakashima","full_name":"Nakashima, Kazutaka"},{"id":"4718F954-F248-11E8-B48F-1D18A9856A87","last_name":"Auzinger","first_name":"Thomas","orcid":"0000-0002-1546-3265","full_name":"Auzinger, Thomas"},{"full_name":"Iarussi, Emmanuel","last_name":"Iarussi","id":"33F19F16-F248-11E8-B48F-1D18A9856A87","first_name":"Emmanuel"},{"id":"4DDBCEB0-F248-11E8-B48F-1D18A9856A87","last_name":"Zhang","orcid":"0000-0002-3808-281X","first_name":"Ran","full_name":"Zhang, Ran"},{"full_name":"Igarashi, Takeo","last_name":"Igarashi","first_name":"Takeo"},{"full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","first_name":"Bernd","orcid":"0000-0001-6511-9385"}],"isi":1,"file":[{"file_size":104225664,"relation":"main_file","content_type":"application/pdf","date_created":"2018-12-12T10:18:38Z","file_name":"IST-2018-1037-v1+1_CoreCavity-AuthorVersion.pdf","date_updated":"2020-07-14T12:44:38Z","access_level":"open_access","checksum":"6a5368bc86c4e1a9fcfe588fd1f14ee8","creator":"system","file_id":"5360"},{"file_id":"5361","creator":"system","checksum":"3861e693ba47c51f3ec7b7867d573a61","access_level":"open_access","file_name":"IST-2018-1037-v1+2_CoreCavity-Supplemental.zip","date_updated":"2020-07-14T12:44:38Z","date_created":"2018-12-12T10:18:39Z","content_type":"application/zip","relation":"main_file","file_size":377743553},{"file_size":162634396,"content_type":"video/vnd.objectvideo","relation":"main_file","date_created":"2018-12-12T10:18:41Z","file_name":"IST-2018-1037-v1+3_CoreCavity-Video.mp4","date_updated":"2020-07-14T12:44:38Z","access_level":"open_access","file_id":"5362","creator":"system","checksum":"490040c685ed869536e2a18f5a906b94"},{"date_updated":"2020-07-14T12:44:38Z","file_name":"IST-2018-1037-v1+4_CoreCavity-RepresentativeImage.jpg","date_created":"2018-12-12T10:18:42Z","checksum":"be7fc8b229adda727419b6504b3b9352","file_id":"5363","creator":"system","access_level":"open_access","relation":"main_file","content_type":"image/jpeg","file_size":527972}],"publist_id":"8044","pubrep_id":"1037","article_processing_charge":"No","external_id":{"isi":["000448185000096"]},"volume":37,"quality_controlled":"1","related_material":{"link":[{"url":"https://ist.ac.at/en/news/interactive-software-tool-makes-complex-mold-design-simple/","relation":"press_release","description":"News on IST Homepage"}]},"has_accepted_license":"1","date_created":"2018-12-11T11:44:09Z","publication":"ACM Transaction on Graphics","type":"journal_article","language":[{"iso":"eng"}],"department":[{"_id":"BeBi"}],"status":"public","oa":1,"month":"08","ec_funded":1,"date_updated":"2023-09-11T12:48:09Z","issue":"4","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."}],"year":"2018","article_number":"135","_id":"12","scopus_import":"1","file_date_updated":"2020-07-14T12:44:38Z","ddc":["004","516","670"],"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.","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>.","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>","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>.","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."},"publication_status":"published","doi":"10.1145/3197517.3201341","oa_version":"Submitted Version","date_published":"2018-08-04T00:00:00Z"},{"publist_id":"6119","article_processing_charge":"Yes (via OA deal)","pubrep_id":"712","quality_controlled":"1","volume":31,"page":"789-826","date_created":"2018-12-11T11:50:45Z","publication":"Journal of Theoretical Probability","has_accepted_license":"1","language":[{"iso":"eng"}],"department":[{"_id":"JaMa"}],"type":"journal_article","title":"Infinite-dimensional calculus under weak spatial regularity of the processes","publisher":"Springer","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","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","acknowledgement":"Open access funding provided by Institute of Science and Technology (IST Austria). The second named author benefited partially from the support of the “FMJH Program Gaspard Monge in Optimization and Operations Research” (Project 2014-1607H). He is also grateful for the invitation to the Department of Mathematics of the University of Pisa. The third named author is grateful for the invitation to ENSTA.","file":[{"access_level":"open_access","file_id":"5266","creator":"system","checksum":"47686d58ec21c164540f1a980ff2163f","date_created":"2018-12-12T10:17:13Z","file_name":"IST-2016-712-v1+1_s10959-016-0724-2.pdf","date_updated":"2020-07-14T12:44:39Z","file_size":671125,"content_type":"application/pdf","relation":"main_file"}],"project":[{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"author":[{"first_name":"Franco","last_name":"Flandoli","full_name":"Flandoli, Franco"},{"last_name":"Russo","first_name":"Francesco","full_name":"Russo, Francesco"},{"first_name":"Giovanni A","id":"47491882-F248-11E8-B48F-1D18A9856A87","last_name":"Zanco","full_name":"Zanco, Giovanni A"}],"ddc":["519"],"file_date_updated":"2020-07-14T12:44:39Z","scopus_import":1,"intvolume":"        31","citation":{"chicago":"Flandoli, Franco, Francesco Russo, and Giovanni A Zanco. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>.","mla":"Flandoli, Franco, et al. “Infinite-Dimensional Calculus under Weak Spatial Regularity of the Processes.” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2, Springer, 2018, pp. 789–826, doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>.","apa":"Flandoli, F., Russo, F., &#38; Zanco, G. A. (2018). Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. Springer. <a href=\"https://doi.org/10.1007/s10959-016-0724-2\">https://doi.org/10.1007/s10959-016-0724-2</a>","ista":"Flandoli F, Russo F, Zanco GA. 2018. Infinite-dimensional calculus under weak spatial regularity of the processes. Journal of Theoretical Probability. 31(2), 789–826.","ieee":"F. Flandoli, F. Russo, and G. A. Zanco, “Infinite-dimensional calculus under weak spatial regularity of the processes,” <i>Journal of Theoretical Probability</i>, vol. 31, no. 2. Springer, pp. 789–826, 2018.","ama":"Flandoli F, Russo F, Zanco GA. Infinite-dimensional calculus under weak spatial regularity of the processes. <i>Journal of Theoretical Probability</i>. 2018;31(2):789-826. doi:<a href=\"https://doi.org/10.1007/s10959-016-0724-2\">10.1007/s10959-016-0724-2</a>","short":"F. Flandoli, F. Russo, G.A. Zanco, Journal of Theoretical Probability 31 (2018) 789–826."},"publication_status":"published","doi":"10.1007/s10959-016-0724-2","date_published":"2018-06-01T00:00:00Z","oa_version":"Published Version","oa":1,"status":"public","month":"06","year":"2018","date_updated":"2021-01-12T06:49:09Z","abstract":[{"text":"Two generalizations of Itô formula to infinite-dimensional spaces are given.\r\nThe first one, in Hilbert spaces, extends the classical one by taking advantage of\r\ncancellations when they occur in examples and it is applied to the case of a group\r\ngenerator. The second one, based on the previous one and a limit procedure, is an Itô\r\nformula in a special class of Banach spaces having a product structure with the noise\r\nin a Hilbert component; again the key point is the extension due to a cancellation. This\r\nextension to Banach spaces and in particular the specific cancellation are motivated\r\nby path-dependent Itô calculus.","lang":"eng"}],"issue":"2","_id":"1215"},{"year":"2018","issue":"4","abstract":[{"lang":"eng","text":"We propose a new method for fabricating digital objects through reusable silicone molds. Molds are generated by casting liquid silicone into custom 3D printed containers called metamolds. Metamolds automatically define the cuts that are needed to extract the cast object from the silicone mold. The shape of metamolds is designed through a novel segmentation technique, which takes into account both geometric and topological constraints involved in the process of mold casting. Our technique is simple, does not require changing the shape or topology of the input objects, and only requires off-the- shelf materials and technologies. We successfully tested our method on a set of challenging examples with complex shapes and rich geometric detail. © 2018 Association for Computing Machinery."}],"date_updated":"2023-09-13T08:56:07Z","_id":"13","article_number":"136","oa":1,"status":"public","ec_funded":1,"month":"08","doi":"10.1145/3197517.3201381","publication_status":"published","date_published":"2018-08-04T00:00:00Z","oa_version":"Submitted Version","ddc":["004"],"scopus_import":"1","file_date_updated":"2020-07-14T12:44:43Z","citation":{"ama":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. Metamolds: Computational design of silicone molds. <i>ACM Trans Graph</i>. 2018;37(4). doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>","ieee":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, and P. Cignoni, “Metamolds: Computational design of silicone molds,” <i>ACM Trans. Graph.</i>, vol. 37, no. 4. ACM, 2018.","short":"T. Alderighi, L. Malomo, D. Giorgi, N. Pietroni, B. Bickel, P. Cignoni, ACM Trans. Graph. 37 (2018).","chicago":"Alderighi, Thomas, Luigi Malomo, Daniela Giorgi, Nico Pietroni, Bernd Bickel, and Paolo Cignoni. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Trans. Graph.</i> ACM, 2018. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>.","mla":"Alderighi, Thomas, et al. “Metamolds: Computational Design of Silicone Molds.” <i>ACM Trans. Graph.</i>, vol. 37, no. 4, 136, ACM, 2018, doi:<a href=\"https://doi.org/10.1145/3197517.3201381\">10.1145/3197517.3201381</a>.","ista":"Alderighi T, Malomo L, Giorgi D, Pietroni N, Bickel B, Cignoni P. 2018. Metamolds: Computational design of silicone molds. ACM Trans. Graph. 37(4), 136.","apa":"Alderighi, T., Malomo, L., Giorgi, D., Pietroni, N., Bickel, B., &#38; Cignoni, P. (2018). Metamolds: Computational design of silicone molds. <i>ACM Trans. Graph.</i> ACM. <a href=\"https://doi.org/10.1145/3197517.3201381\">https://doi.org/10.1145/3197517.3201381</a>"},"intvolume":"        37","day":"04","file":[{"date_updated":"2020-07-14T12:44:43Z","file_name":"IST-2018-1038-v1+1_metamolds_authorversion.pdf","date_created":"2018-12-12T10:18:52Z","creator":"system","checksum":"61d46273dca4de626accef1d17a0aaad","file_id":"5374","access_level":"open_access","relation":"main_file","content_type":"application/pdf","file_size":91939066}],"isi":1,"author":[{"full_name":"Alderighi, Thomas","first_name":"Thomas","last_name":"Alderighi"},{"full_name":"Malomo, Luigi","first_name":"Luigi","last_name":"Malomo"},{"full_name":"Giorgi, Daniela","last_name":"Giorgi","first_name":"Daniela"},{"full_name":"Pietroni, Nico","first_name":"Nico","last_name":"Pietroni"},{"full_name":"Bickel, Bernd","last_name":"Bickel","id":"49876194-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6511-9385","first_name":"Bernd"},{"full_name":"Cignoni, Paolo","last_name":"Cignoni","first_name":"Paolo"}],"project":[{"name":"MATERIALIZABLE: Intelligent fabrication-oriented Computational Design and Modeling","call_identifier":"H2020","grant_number":"715767","_id":"24F9549A-B435-11E9-9278-68D0E5697425"}],"title":"Metamolds: Computational design of silicone molds","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"ACM","publication":"ACM Trans. Graph.","date_created":"2018-12-11T11:44:09Z","has_accepted_license":"1","department":[{"_id":"BeBi"}],"language":[{"iso":"eng"}],"type":"journal_article","pubrep_id":"1038","article_processing_charge":"No","publist_id":"8043","related_material":{"link":[{"url":"https://ist.ac.at/en/news/metamolds-molding-a-mold/","description":"News on IST Homepage","relation":"press_release"}]},"volume":37,"quality_controlled":"1","external_id":{"isi":["000448185000097"]}},{"oa_version":"Published Version","type":"research_data_reference","date_published":"2018-11-03T00:00:00Z","department":[{"_id":"SiHi"}],"doi":"10.6084/m9.figshare.7295339.v1","date_created":"2021-08-06T12:26:53Z","citation":{"ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>.","chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 1: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">https://doi.org/10.6084/m9.figshare.7295339.v1</a>.","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018.","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295339.v1\">10.6084/m9.figshare.7295339.v1</a>","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018)."},"related_material":{"record":[{"relation":"used_in_publication","status":"public","id":"20"}]},"article_processing_charge":"No","main_file_link":[{"open_access":"1","url":"https://doi.org/10.6084/m9.figshare.7295339.v1"}],"author":[{"full_name":"Higareda Almaraz, Juan","last_name":"Higareda Almaraz","first_name":"Juan"},{"first_name":"Michael","last_name":"Karbiener","full_name":"Karbiener, Michael"},{"full_name":"Giroud, Maude","first_name":"Maude","last_name":"Giroud"},{"last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-7462-0048","first_name":"Florian","full_name":"Pauler, Florian"},{"full_name":"Gerhalter, Teresa","first_name":"Teresa","last_name":"Gerhalter"},{"full_name":"Herzig, Stephan","last_name":"Herzig","first_name":"Stephan"},{"full_name":"Scheideler, Marcel","last_name":"Scheideler","first_name":"Marcel"}],"_id":"9807","abstract":[{"lang":"eng","text":"Table S1. Genes with highest betweenness. Table S2. Local and Master regulators up-regulated. Table S3. Local and Master regulators down-regulated (XLSX 23 kb)."}],"date_updated":"2023-09-13T09:10:47Z","year":"2018","day":"03","month":"11","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","publisher":"Springer Nature","oa":1,"title":"Additional file 1: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes"},{"doi":"10.6084/m9.figshare.7295369.v1","date_created":"2021-08-06T12:31:57Z","type":"research_data_reference","oa_version":"Published Version","date_published":"2018-11-03T00:00:00Z","department":[{"_id":"SiHi"}],"article_processing_charge":"No","main_file_link":[{"url":"https://doi.org/10.6084/m9.figshare.7295369.v1","open_access":"1"}],"citation":{"chicago":"Higareda Almaraz, Juan, Michael Karbiener, Maude Giroud, Florian Pauler, Teresa Gerhalter, Stephan Herzig, and Marcel Scheideler. “Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes.” Springer Nature, 2018. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>.","mla":"Higareda Almaraz, Juan, et al. <i>Additional File 3: Of Norepinephrine Triggers an Immediate-Early Regulatory Network Response in Primary Human White Adipocytes</i>. Springer Nature, 2018, doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","ista":"Higareda Almaraz J, Karbiener M, Giroud M, Pauler F, Gerhalter T, Herzig S, Scheideler M. 2018. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes, Springer Nature, <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>.","apa":"Higareda Almaraz, J., Karbiener, M., Giroud, M., Pauler, F., Gerhalter, T., Herzig, S., &#38; Scheideler, M. (2018). Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. Springer Nature. <a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">https://doi.org/10.6084/m9.figshare.7295369.v1</a>","short":"J. Higareda Almaraz, M. Karbiener, M. Giroud, F. Pauler, T. Gerhalter, S. Herzig, M. Scheideler, (2018).","ama":"Higareda Almaraz J, Karbiener M, Giroud M, et al. Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes. 2018. doi:<a href=\"https://doi.org/10.6084/m9.figshare.7295369.v1\">10.6084/m9.figshare.7295369.v1</a>","ieee":"J. Higareda Almaraz <i>et al.</i>, “Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes.” Springer Nature, 2018."},"related_material":{"record":[{"id":"20","status":"public","relation":"used_in_publication"}]},"abstract":[{"lang":"eng","text":"Table S4. Counts per Gene per Million Reads Mapped. (XLSX 2751 kb)."}],"date_updated":"2023-09-13T09:10:47Z","year":"2018","day":"03","author":[{"first_name":"Juan","last_name":"Higareda Almaraz","full_name":"Higareda Almaraz, Juan"},{"full_name":"Karbiener, Michael","last_name":"Karbiener","first_name":"Michael"},{"full_name":"Giroud, Maude","first_name":"Maude","last_name":"Giroud"},{"orcid":"0000-0002-7462-0048","first_name":"Florian","last_name":"Pauler","id":"48EA0138-F248-11E8-B48F-1D18A9856A87","full_name":"Pauler, Florian"},{"first_name":"Teresa","last_name":"Gerhalter","full_name":"Gerhalter, Teresa"},{"last_name":"Herzig","first_name":"Stephan","full_name":"Herzig, Stephan"},{"first_name":"Marcel","last_name":"Scheideler","full_name":"Scheideler, Marcel"}],"_id":"9808","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","publisher":"Springer Nature","oa":1,"title":"Additional file 3: Of Norepinephrine triggers an immediate-early regulatory network response in primary human white adipocytes","month":"11"},{"related_material":{"record":[{"id":"82","relation":"used_in_publication","status":"public"}]},"citation":{"ista":"Chaudhry W, Pleska M, Shah N, Weiss H, Mccall I, Meyer J, Gupta A, Guet CC, Levin B. 2018. Numerical data used in figures, Public Library of Science, <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>.","apa":"Chaudhry, W., Pleska, M., Shah, N., Weiss, H., Mccall, I., Meyer, J., … Levin, B. (2018). Numerical data used in figures. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>","mla":"Chaudhry, Waqas, et al. <i>Numerical Data Used in Figures</i>. Public Library of Science, 2018, doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>.","chicago":"Chaudhry, Waqas, Maros Pleska, Nilang Shah, Howard Weiss, Ingrid Mccall, Justin Meyer, Animesh Gupta, Calin C Guet, and Bruce Levin. “Numerical Data Used in Figures.” Public Library of Science, 2018. <a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">https://doi.org/10.1371/journal.pbio.2005971.s008</a>.","short":"W. Chaudhry, M. Pleska, N. Shah, H. Weiss, I. Mccall, J. Meyer, A. Gupta, C.C. Guet, B. Levin, (2018).","ama":"Chaudhry W, Pleska M, Shah N, et al. Numerical data used in figures. 2018. doi:<a href=\"https://doi.org/10.1371/journal.pbio.2005971.s008\">10.1371/journal.pbio.2005971.s008</a>","ieee":"W. Chaudhry <i>et al.</i>, “Numerical data used in figures.” Public Library of Science, 2018."},"article_processing_charge":"No","date_published":"2018-08-16T00:00:00Z","department":[{"_id":"CaGu"}],"type":"research_data_reference","oa_version":"Published Version","date_created":"2021-08-06T12:43:44Z","doi":"10.1371/journal.pbio.2005971.s008","month":"08","title":"Numerical data used in figures","user_id":"6785fbc1-c503-11eb-8a32-93094b40e1cf","status":"public","publisher":"Public Library of Science","_id":"9810","author":[{"full_name":"Chaudhry, Waqas","last_name":"Chaudhry","first_name":"Waqas"},{"last_name":"Pleska","id":"4569785E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-7460-7479","first_name":"Maros","full_name":"Pleska, Maros"},{"full_name":"Shah, Nilang","first_name":"Nilang","last_name":"Shah"},{"full_name":"Weiss, Howard","last_name":"Weiss","first_name":"Howard"},{"full_name":"Mccall, Ingrid","first_name":"Ingrid","last_name":"Mccall"},{"last_name":"Meyer","first_name":"Justin","full_name":"Meyer, Justin"},{"full_name":"Gupta, Animesh","last_name":"Gupta","first_name":"Animesh"},{"first_name":"Calin C","orcid":"0000-0001-6220-2052","last_name":"Guet","id":"47F8433E-F248-11E8-B48F-1D18A9856A87","full_name":"Guet, Calin C"},{"last_name":"Levin","first_name":"Bruce","full_name":"Levin, Bruce"}],"year":"2018","day":"16","date_updated":"2023-09-13T08:45:41Z"}]