[{"alternative_title":["LNCS"],"scopus_import":"1","date_published":"2018-07-18T00:00:00Z","file":[{"creator":"dernst","content_type":"application/pdf","file_size":5591566,"relation":"main_file","date_created":"2018-12-17T15:57:06Z","checksum":"fd95e8026deacef3dc752a733bb9355f","file_name":"2018_LNCS_Kong.pdf","access_level":"open_access","date_updated":"2020-07-14T12:44:53Z","file_id":"5718"}],"external_id":{"isi":["000491481600024"]},"page":"449 - 467","acknowledgement":"Austrian Science Fund FWF: S11402-N23, S11405-N23, Z211-N32","language":[{"iso":"eng"}],"doi":"10.1007/978-3-319-96145-3_24","has_accepted_license":"1","department":[{"_id":"ToHe"}],"type":"conference","date_updated":"2023-09-15T12:12:08Z","oa_version":"Published Version","day":"18","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","date_created":"2018-12-11T11:44:51Z","conference":{"end_date":"2018-07-17","name":"CAV: Computer Aided Verification","start_date":"2018-07-14","location":"Oxford, United Kingdom"},"month":"07","status":"public","intvolume":"     10981","publist_id":"7781","isi":1,"file_date_updated":"2020-07-14T12:44:53Z","publisher":"Springer","volume":10981,"project":[{"grant_number":"S 11407_N23","name":"Rigorous Systems Engineering","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"25F42A32-B435-11E9-9278-68D0E5697425","grant_number":"Z211","name":"The Wittgenstein Prize"}],"publication_status":"published","abstract":[{"text":"We address the problem of analyzing the reachable set of a polynomial nonlinear continuous system by over-approximating the flowpipe of its dynamics. The common approach to tackle this problem is to perform a numerical integration over a given time horizon based on Taylor expansion and interval arithmetic. However, this method results to be very conservative when there is a large difference in speed between trajectories as time progresses. In this paper, we propose to use combinations of barrier functions, which we call piecewise barrier tube (PBT), to over-approximate flowpipe. The basic idea of PBT is that for each segment of a flowpipe, a coarse box which is big enough to contain the segment is constructed using sampled simulation and then in the box we compute by linear programming a set of barrier functions (called barrier tube or BT for short) which work together to form a tube surrounding the flowpipe. The benefit of using PBT is that (1) BT is independent of time and hence can avoid being stretched and deformed by time; and (2) a small number of BTs can form a tight over-approximation for the flowpipe, which means that the computation required to decide whether the BTs intersect the unsafe set can be reduced significantly. We implemented a prototype called PBTS in C++. Experiments on some benchmark systems show that our approach is effective.","lang":"eng"}],"title":"Reachable set over-approximation for nonlinear systems using piecewise barrier tubes","ddc":["000"],"oa":1,"_id":"142","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2018","citation":{"mla":"Kong, Hui, et al. <i>Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes</i>. Vol. 10981, Springer, 2018, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>.","apa":"Kong, H., Bartocci, E., &#38; Henzinger, T. A. (2018). Reachable set over-approximation for nonlinear systems using piecewise barrier tubes (Vol. 10981, pp. 449–467). Presented at the CAV: Computer Aided Verification, Oxford, United Kingdom: Springer. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>","ieee":"H. Kong, E. Bartocci, and T. A. Henzinger, “Reachable set over-approximation for nonlinear systems using piecewise barrier tubes,” presented at the CAV: Computer Aided Verification, Oxford, United Kingdom, 2018, vol. 10981, pp. 449–467.","ama":"Kong H, Bartocci E, Henzinger TA. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. In: Vol 10981. Springer; 2018:449-467. doi:<a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">10.1007/978-3-319-96145-3_24</a>","short":"H. Kong, E. Bartocci, T.A. Henzinger, in:, Springer, 2018, pp. 449–467.","chicago":"Kong, Hui, Ezio Bartocci, and Thomas A Henzinger. “Reachable Set Over-Approximation for Nonlinear Systems Using Piecewise Barrier Tubes,” 10981:449–67. Springer, 2018. <a href=\"https://doi.org/10.1007/978-3-319-96145-3_24\">https://doi.org/10.1007/978-3-319-96145-3_24</a>.","ista":"Kong H, Bartocci E, Henzinger TA. 2018. Reachable set over-approximation for nonlinear systems using piecewise barrier tubes. CAV: Computer Aided Verification, LNCS, vol. 10981, 449–467."},"quality_controlled":"1","author":[{"full_name":"Kong, Hui","orcid":"0000-0002-3066-6941","id":"3BDE25AA-F248-11E8-B48F-1D18A9856A87","last_name":"Kong","first_name":"Hui"},{"full_name":"Bartocci, Ezio","first_name":"Ezio","last_name":"Bartocci"},{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","full_name":"Henzinger, Thomas A","orcid":"0000−0002−2985−7724"}]},{"intvolume":"        84","date_created":"2023-08-22T14:15:20Z","conference":{"name":"AISTATS: Conference on Artificial Intelligence and Statistics","end_date":"2018-04-11","location":"Playa Blanca, Lanzarote","start_date":"2018-04-09"},"month":"04","status":"public","volume":84,"publisher":"ML Research Press","title":"Boosting variational inference: An optimization perspective","publication":"Proceedings of the 21st International Conference on Artificial Intelligence and Statistics","oa":1,"_id":"14201","publication_status":"published","abstract":[{"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.","lang":"eng"}],"main_file_link":[{"url":"https://arxiv.org/abs/1708.01733","open_access":"1"}],"citation":{"apa":"Locatello, F., Khanna, R., Ghosh, J., &#38; Rätsch, G. (2018). Boosting variational inference: An optimization perspective. In <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i> (Vol. 84, pp. 464–472). Playa Blanca, Lanzarote: ML Research Press.","mla":"Locatello, Francesco, et al. “Boosting Variational Inference: An Optimization Perspective.” <i>Proceedings of the 21st International Conference on Artificial Intelligence and Statistics</i>, vol. 84, ML Research Press, 2018, pp. 464–72.","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.","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.","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."},"extern":"1","author":[{"last_name":"Locatello","first_name":"Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco"},{"last_name":"Khanna","first_name":"Rajiv","full_name":"Khanna, Rajiv"},{"full_name":"Ghosh, Joydeep","first_name":"Joydeep","last_name":"Ghosh"},{"first_name":"Gunnar","last_name":"Rätsch","full_name":"Rätsch, Gunnar"}],"quality_controlled":"1","year":"2018","alternative_title":["PMLR"],"scopus_import":"1","arxiv":1,"date_published":"2018-04-15T00:00:00Z","external_id":{"arxiv":["1708.01733"]},"page":"464-472","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}],"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-13T07:52:40Z","type":"conference","oa_version":"Preprint","day":"15"},{"volume":31,"publisher":"Neural Information Processing Systems Foundation","intvolume":"        31","date_created":"2023-08-22T14:15:40Z","month":"06","conference":{"location":"Montreal, Canada","start_date":"2018-12-03","end_date":"2018-12-08","name":"NeurIPS: Neural Information Processing Systems"},"status":"public","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.02185"}],"citation":{"short":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, G. Rätsch, in:, Advances in Neural Information Processing Systems, Neural Information Processing Systems Foundation, 2018.","chicago":"Locatello, Francesco, Gideon Dresdner, Rajiv Khanna, Isabel Valera, and Gunnar Rätsch. “Boosting Black Box Variational Inference.” In <i>Advances in Neural Information Processing Systems</i>, Vol. 31. Neural Information Processing Systems Foundation, 2018.","ista":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. 2018. Boosting black box variational inference. Advances in Neural Information Processing Systems. NeurIPS: Neural Information Processing Systems vol. 31.","ama":"Locatello F, Dresdner G, Khanna R, Valera I, Rätsch G. Boosting black box variational inference. In: <i>Advances in Neural Information Processing Systems</i>. Vol 31. Neural Information Processing Systems Foundation; 2018.","ieee":"F. Locatello, G. Dresdner, R. Khanna, I. Valera, and G. Rätsch, “Boosting black box variational inference,” in <i>Advances in Neural Information Processing Systems</i>, Montreal, Canada, 2018, vol. 31.","apa":"Locatello, F., Dresdner, G., Khanna, R., Valera, I., &#38; Rätsch, G. (2018). Boosting black box variational inference. In <i>Advances in Neural Information Processing Systems</i> (Vol. 31). Montreal, Canada: Neural Information Processing Systems Foundation.","mla":"Locatello, Francesco, et al. “Boosting Black Box Variational Inference.” <i>Advances in Neural Information Processing Systems</i>, vol. 31, Neural Information Processing Systems Foundation, 2018."},"extern":"1","author":[{"last_name":"Locatello","first_name":"Francesco","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"last_name":"Dresdner","first_name":"Gideon","full_name":"Dresdner, Gideon"},{"first_name":"Rajiv","last_name":"Khanna","full_name":"Khanna, Rajiv"},{"last_name":"Valera","first_name":"Isabel","full_name":"Valera, Isabel"},{"full_name":"Rätsch, Gunnar","first_name":"Gunnar","last_name":"Rätsch"}],"quality_controlled":"1","year":"2018","publication":"Advances in Neural Information Processing Systems","title":"Boosting black box variational inference","oa":1,"_id":"14202","publication_status":"published","abstract":[{"lang":"eng","text":"Approximating a probability density in a tractable manner is a central task\r\nin Bayesian statistics. Variational Inference (VI) is a popular technique that\r\nachieves tractability by choosing a relatively simple variational family.\r\nBorrowing ideas from the classic boosting framework, recent approaches attempt\r\nto \\emph{boost} VI by replacing the selection of a single density with a\r\ngreedily constructed mixture of densities. In order to guarantee convergence,\r\nprevious works impose stringent assumptions that require significant effort for\r\npractitioners. Specifically, they require a custom implementation of the greedy\r\nstep (called the LMO) for every probabilistic model with respect to an\r\nunnatural variational family of truncated distributions. Our work fixes these\r\nissues with novel theoretical and algorithmic insights. On the theoretical\r\nside, we show that boosting VI satisfies a relaxed smoothness assumption which\r\nis sufficient for the convergence of the functional Frank-Wolfe (FW) algorithm.\r\nFurthermore, we rephrase the LMO problem and propose to maximize the Residual\r\nELBO (RELBO) which replaces the standard ELBO optimization in VI. These\r\ntheoretical enhancements allow for black box implementation of the boosting\r\nsubroutine. Finally, we present a stopping criterion drawn from the duality gap\r\nin the classic FW analyses and exhaustive experiments to illustrate the\r\nusefulness of our theoretical and algorithmic contributions."}],"date_published":"2018-06-06T00:00:00Z","external_id":{"arxiv":["1806.02185"]},"publication_identifier":{"eissn":["1049-5258"],"isbn":["9781510884472"]},"scopus_import":"1","arxiv":1,"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-09-13T07:38:24Z","type":"conference","oa_version":"Preprint","day":"06","language":[{"iso":"eng"}],"department":[{"_id":"FrLo"}]},{"publisher":"ML Research Press","volume":80,"status":"public","conference":{"end_date":"2018-07-15","name":"ICML: International Conference on Machine Learning","location":"Stockholm, Sweden","start_date":"2018-07-10"},"month":"07","date_created":"2023-08-22T14:16:01Z","intvolume":"        80","year":"2018","author":[{"first_name":"Alp","last_name":"Yurtsever","full_name":"Yurtsever, Alp"},{"last_name":"Fercoq","first_name":"Olivier","full_name":"Fercoq, Olivier"},{"first_name":"Francesco","last_name":"Locatello","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Cevher, Volkan","first_name":"Volkan","last_name":"Cevher"}],"extern":"1","quality_controlled":"1","citation":{"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.","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.","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.","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.","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.","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."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.08544"}],"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"}],"publication_status":"published","_id":"14203","oa":1,"publication":"Proceedings of the 35th International Conference on Machine Learning","title":"A conditional gradient framework for composite convex minimization with applications to semidefinite programming","page":"5727-5736","external_id":{"arxiv":["1804.08544"]},"date_published":"2018-07-15T00:00:00Z","arxiv":1,"alternative_title":["PMLR"],"day":"15","oa_version":"Preprint","type":"conference","date_updated":"2023-09-13T08:13:39Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}]},{"article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"Preprint","type":"conference","date_updated":"2023-09-13T08:19:05Z","day":"01","department":[{"_id":"FrLo"}],"language":[{"iso":"eng"}],"external_id":{"arxiv":["1803.09539"]},"date_published":"2018-07-01T00:00:00Z","page":"3198-3207","alternative_title":["PMLR"],"scopus_import":"1","arxiv":1,"citation":{"ista":"Locatello F, Raj A, Karimireddy SP, Rätsch G, Schölkopf B, Stich SU, Jaggi M. 2018. On matching pursuit and coordinate descent. Proceedings of the 35th International Conference on Machine Learning. , PMLR, vol. 80, 3198–3207.","chicago":"Locatello, Francesco, Anant Raj, Sai Praneeth Karimireddy, Gunnar Rätsch, Bernhard Schölkopf, Sebastian U. Stich, and Martin Jaggi. “On Matching Pursuit and Coordinate Descent.” In <i>Proceedings of the 35th International Conference on Machine Learning</i>, 80:3198–3207. ML Research Press, 2018.","short":"F. Locatello, A. Raj, S.P. Karimireddy, G. Rätsch, B. Schölkopf, S.U. Stich, M. Jaggi, in:, Proceedings of the 35th International Conference on Machine Learning, ML Research Press, 2018, pp. 3198–3207.","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.","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.","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.","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."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1803.09539"}],"extern":"1","quality_controlled":"1","author":[{"full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4","first_name":"Francesco","last_name":"Locatello"},{"full_name":"Raj, Anant","last_name":"Raj","first_name":"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"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"},{"first_name":"Sebastian U.","last_name":"Stich","full_name":"Stich, Sebastian U."},{"last_name":"Jaggi","first_name":"Martin","full_name":"Jaggi, Martin"}],"year":"2018","publication":"Proceedings of the 35th International Conference on Machine Learning","title":"On matching pursuit and coordinate descent","_id":"14204","oa":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"}],"publication_status":"published","volume":80,"publisher":"ML Research Press","intvolume":"        80","month":"07","date_created":"2023-08-22T14:16:25Z","status":"public"},{"scopus_import":"1","arxiv":1,"conference":{"name":"International Conference on Machine Learning","end_date":"2018-05-03","start_date":"2018-04-30","location":"Vancouver, Canada"},"month":"05","date_created":"2023-08-22T14:25:34Z","status":"public","external_id":{"arxiv":["1804.11130"]},"date_published":"2018-05-01T00:00:00Z","title":"Clustering meets implicit generative models","publication":"6th International Conference on Learning Representations","_id":"14224","department":[{"_id":"FrLo"}],"oa":1,"language":[{"iso":"eng"}],"abstract":[{"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.","lang":"eng"}],"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.11130"}],"citation":{"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.","ieee":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, and B. Scholkopf, “Clustering meets implicit generative models,” in <i>6th International Conference on Learning Representations</i>, Vancouver, Canada, 2018.","ama":"Locatello F, Vincent D, Tolstikhin I, Ratsch G, Gelly S, Scholkopf B. Clustering meets implicit generative models. In: <i>6th International Conference on Learning Representations</i>. ; 2018.","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.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Ratsch, S. Gelly, B. Scholkopf, in:, 6th International Conference on Learning Representations, 2018.","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."},"article_processing_charge":"No","extern":"1","quality_controlled":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"id":"26cfd52f-2483-11ee-8040-88983bcc06d4","orcid":"0000-0002-4850-0683","full_name":"Locatello, Francesco","last_name":"Locatello","first_name":"Francesco"},{"full_name":"Vincent, Damien","last_name":"Vincent","first_name":"Damien"},{"first_name":"Ilya","last_name":"Tolstikhin","full_name":"Tolstikhin, Ilya"},{"first_name":"Gunnar","last_name":"Ratsch","full_name":"Ratsch, Gunnar"},{"full_name":"Gelly, Sylvain","last_name":"Gelly","first_name":"Sylvain"},{"first_name":"Bernhard","last_name":"Scholkopf","full_name":"Scholkopf, Bernhard"}],"oa_version":"Preprint","type":"conference","date_updated":"2023-09-13T09:08:24Z","year":"2018","day":"01"},{"alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"publication_identifier":{"isbn":["978-1-4503-5583-4"]},"scopus_import":"1","date_published":"2018-07-09T00:00:00Z","external_id":{"isi":["000545262800020"]},"page":"185 - 194","ec_funded":1,"doi":"10.1145/3209108.3209191","language":[{"iso":"eng"}],"department":[{"_id":"KrCh"}],"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","date_updated":"2025-06-02T08:53:48Z","type":"conference","oa_version":"Preprint","day":"09","publist_id":"7780","isi":1,"date_created":"2018-12-11T11:44:51Z","conference":{"start_date":"2018-07-09","location":"Oxford, United Kingdom","name":"LICS: Logic in Computer Science","end_date":"2018-07-12"},"month":"07","status":"public","volume":"F138033","publisher":"IEEE","title":"Efficient algorithms for asymptotic bounds on termination time in VASS","oa":1,"_id":"143","project":[{"_id":"25892FC0-B435-11E9-9278-68D0E5697425","name":"Efficient Algorithms for Computer Aided Verification","grant_number":"ICT15-003"},{"name":"Quantitative Graph Games: Theory and Applications","grant_number":"279307","call_identifier":"FP7","_id":"2581B60A-B435-11E9-9278-68D0E5697425"},{"name":"Rigorous Systems Engineering","grant_number":"S 11407_N23","call_identifier":"FWF","_id":"25832EC2-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","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"}],"citation":{"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>","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.","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>.","short":"T. Brázdil, K. Chatterjee, A. Kučera, P. Novotný, D. Velan, F. Zuleger, in:, IEEE, 2018, pp. 185–194."},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1804.10985"}],"author":[{"full_name":"Brázdil, Tomáš","last_name":"Brázdil","first_name":"Tomáš"},{"last_name":"Chatterjee","first_name":"Krishnendu","orcid":"0000-0002-4561-241X","full_name":"Chatterjee, Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87"},{"first_name":"Antonín","last_name":"Kučera","full_name":"Kučera, Antonín"},{"first_name":"Petr","last_name":"Novotny","id":"3CC3B868-F248-11E8-B48F-1D18A9856A87","full_name":"Novotny, Petr"},{"last_name":"Velan","first_name":"Dominik","full_name":"Velan, Dominik"},{"first_name":"Florian","last_name":"Zuleger","full_name":"Zuleger, Florian"}],"quality_controlled":"1","year":"2018"},{"article_number":"1804.11130","status":"public","date_created":"2023-09-13T12:20:49Z","arxiv":1,"month":"04","date_published":"2018-04-30T00:00:00Z","external_id":{"arxiv":["1804.11130"]},"language":[{"iso":"eng"}],"doi":"10.48550/arXiv.1804.11130","oa":1,"_id":"14327","department":[{"_id":"FrLo"}],"title":"Competitive training of mixtures of independent deep generative models","publication":"arXiv","publication_status":"submitted","abstract":[{"text":"A common assumption in causal modeling posits that the data is generated by a\r\nset of independent mechanisms, and algorithms should aim to recover this\r\nstructure. Standard unsupervised learning, however, is often concerned with\r\ntraining a single model to capture the overall distribution or aspects thereof.\r\nInspired by clustering approaches, we consider mixtures of implicit generative\r\nmodels that ``disentangle'' the independent generative mechanisms underlying\r\nthe data. Relying on an additional set of discriminators, we propose a\r\ncompetitive training procedure in which the models only need to capture the\r\nportion of the data distribution from which they can produce realistic samples.\r\nAs a by-product, each model is simpler and faster to train. We empirically show\r\nthat our approach splits the training distribution in a sensible way and\r\nincreases the quality of the generated samples.","lang":"eng"}],"author":[{"last_name":"Locatello","first_name":"Francesco","full_name":"Locatello, Francesco","orcid":"0000-0002-4850-0683","id":"26cfd52f-2483-11ee-8040-88983bcc06d4"},{"full_name":"Vincent, Damien","last_name":"Vincent","first_name":"Damien"},{"last_name":"Tolstikhin","first_name":"Ilya","full_name":"Tolstikhin, Ilya"},{"last_name":"Rätsch","first_name":"Gunnar","full_name":"Rätsch, Gunnar"},{"last_name":"Gelly","first_name":"Sylvain","full_name":"Gelly, Sylvain"},{"first_name":"Bernhard","last_name":"Schölkopf","full_name":"Schölkopf, Bernhard"}],"extern":"1","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","main_file_link":[{"url":"https://doi.org/10.48550/arXiv.1804.11130","open_access":"1"}],"citation":{"ama":"Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive training of mixtures of independent deep generative models. <i>arXiv</i>. doi:<a href=\"https://doi.org/10.48550/arXiv.1804.11130\">10.48550/arXiv.1804.11130</a>","ieee":"F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, and B. Schölkopf, “Competitive training of mixtures of independent deep generative models,” <i>arXiv</i>. .","chicago":"Locatello, Francesco, Damien Vincent, Ilya Tolstikhin, Gunnar Rätsch, Sylvain Gelly, and Bernhard Schölkopf. “Competitive Training of Mixtures of Independent Deep Generative Models.” <i>ArXiv</i>, n.d. <a href=\"https://doi.org/10.48550/arXiv.1804.11130\">https://doi.org/10.48550/arXiv.1804.11130</a>.","short":"F. Locatello, D. Vincent, I. Tolstikhin, G. Rätsch, S. Gelly, B. Schölkopf, ArXiv (n.d.).","ista":"Locatello F, Vincent D, Tolstikhin I, Rätsch G, Gelly S, Schölkopf B. Competitive training of mixtures of independent deep generative models. arXiv, 1804.11130.","apa":"Locatello, F., Vincent, D., Tolstikhin, I., Rätsch, G., Gelly, S., &#38; Schölkopf, B. (n.d.). Competitive training of mixtures of independent deep generative models. <i>arXiv</i>. <a href=\"https://doi.org/10.48550/arXiv.1804.11130\">https://doi.org/10.48550/arXiv.1804.11130</a>","mla":"Locatello, Francesco, et al. “Competitive Training of Mixtures of Independent Deep Generative Models.” <i>ArXiv</i>, 1804.11130, doi:<a href=\"https://doi.org/10.48550/arXiv.1804.11130\">10.48550/arXiv.1804.11130</a>."},"day":"30","year":"2018","type":"preprint","date_updated":"2023-09-13T12:23:03Z","oa_version":"Preprint"},{"month":"07","conference":{"name":"LICS: Logic in Computer Science","end_date":"2018-07-12","location":"Oxford, UK","start_date":"2018-07-09"},"date_created":"2018-12-11T11:44:52Z","status":"public","alternative_title":["ACM/IEEE Symposium on Logic in Computer Science"],"isi":1,"scopus_import":"1","publist_id":"7779","publisher":"IEEE","external_id":{"isi":["000545262800041"]},"date_published":"2018-07-09T00:00:00Z","page":"394 - 403","volume":"Part F138033","abstract":[{"lang":"eng","text":"The task of a monitor is to watch, at run-time, the execution of a reactive system, and signal the occurrence of a safety violation in the observed sequence of events. While finite-state monitors have been studied extensively, in practice, monitoring software also makes use of unbounded memory. We define a model of automata equipped with integer-valued registers which can execute only a bounded number of instructions between consecutive events, and thus can form the theoretical basis for the study of infinite-state monitors. We classify these register monitors according to the number k of available registers, and the type of register instructions. In stark contrast to the theory of computability for register machines, we prove that for every k 1, monitors with k + 1 counters (with instruction set 〈+1, =〉) are strictly more expressive than monitors with k counters. We also show that adder monitors (with instruction set 〈1, +, =〉) are strictly more expressive than counter monitors, but are complete for monitoring all computable safety -languages for k = 6. Real-time monitors are further required to signal the occurrence of a safety violation as soon as it occurs. The expressiveness hierarchy for counter monitors carries over to real-time monitors. We then show that 2 adders cannot simulate 3 counters in real-time. Finally, we show that real-time adder monitors with inequalities are as expressive as real-time Turing machines."}],"publication_status":"published","title":"A theory of register monitors","_id":"144","department":[{"_id":"ToHe"}],"language":[{"iso":"eng"}],"doi":"10.1145/3209108.3209194","oa_version":"None","date_updated":"2023-09-08T11:49:13Z","type":"conference","year":"2018","day":"09","citation":{"mla":"Ferrere, Thomas, et al. <i>A Theory of Register Monitors</i>. Vol. Part F138033, IEEE, 2018, pp. 394–403, doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>.","apa":"Ferrere, T., Henzinger, T. A., &#38; Saraç, E. (2018). A theory of register monitors (Vol. Part F138033, pp. 394–403). Presented at the LICS: Logic in Computer Science, Oxford, UK: IEEE. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>","short":"T. Ferrere, T.A. Henzinger, E. Saraç, in:, IEEE, 2018, pp. 394–403.","chicago":"Ferrere, Thomas, Thomas A Henzinger, and Ege Saraç. “A Theory of Register Monitors,” Part F138033:394–403. IEEE, 2018. <a href=\"https://doi.org/10.1145/3209108.3209194\">https://doi.org/10.1145/3209108.3209194</a>.","ista":"Ferrere T, Henzinger TA, Saraç E. 2018. A theory of register monitors. LICS: Logic in Computer Science, ACM/IEEE Symposium on Logic in Computer Science, vol. Part F138033, 394–403.","ieee":"T. Ferrere, T. A. Henzinger, and E. Saraç, “A theory of register monitors,” presented at the LICS: Logic in Computer Science, Oxford, UK, 2018, vol. Part F138033, pp. 394–403.","ama":"Ferrere T, Henzinger TA, Saraç E. A theory of register monitors. In: Vol Part F138033. IEEE; 2018:394-403. doi:<a href=\"https://doi.org/10.1145/3209108.3209194\">10.1145/3209108.3209194</a>"},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","author":[{"id":"40960E6E-F248-11E8-B48F-1D18A9856A87","full_name":"Ferrere, Thomas","orcid":"0000-0001-5199-3143","last_name":"Ferrere","first_name":"Thomas"},{"orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger"},{"full_name":"Saraç, Ege","last_name":"Saraç","first_name":"Ege"}]},{"issue":"15","volume":37,"file_date_updated":"2020-07-14T12:44:56Z","publisher":"Wiley","article_type":"original","intvolume":"        37","isi":1,"publist_id":"7778","month":"08","date_created":"2018-12-11T11:44:52Z","article_number":"e98044","status":"public","citation":{"mla":"Truckenbrodt, Sven M., et al. “Newly Produced Synaptic Vesicle Proteins Are Preferentially Used in Synaptic Transmission.” <i>The EMBO Journal</i>, vol. 37, no. 15, e98044, Wiley, 2018, doi:<a href=\"https://doi.org/10.15252/embj.201798044\">10.15252/embj.201798044</a>.","apa":"Truckenbrodt, S. M., Viplav, A., Jähne, S., Vogts, A., Denker, A., Wildhagen, H., … Rizzoli, S. (2018). Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. <i>The EMBO Journal</i>. Wiley. <a href=\"https://doi.org/10.15252/embj.201798044\">https://doi.org/10.15252/embj.201798044</a>","short":"S.M. Truckenbrodt, A. Viplav, S. Jähne, A. Vogts, A. Denker, H. Wildhagen, E. Fornasiero, S. Rizzoli, The EMBO Journal 37 (2018).","chicago":"Truckenbrodt, Sven M, Abhiyan Viplav, Sebsatian Jähne, Angela Vogts, Annette Denker, Hanna Wildhagen, Eugenio Fornasiero, and Silvio Rizzoli. “Newly Produced Synaptic Vesicle Proteins Are Preferentially Used in Synaptic Transmission.” <i>The EMBO Journal</i>. Wiley, 2018. <a href=\"https://doi.org/10.15252/embj.201798044\">https://doi.org/10.15252/embj.201798044</a>.","ista":"Truckenbrodt SM, Viplav A, Jähne S, Vogts A, Denker A, Wildhagen H, Fornasiero E, Rizzoli S. 2018. Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. The EMBO Journal. 37(15), e98044.","ieee":"S. M. Truckenbrodt <i>et al.</i>, “Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission,” <i>The EMBO Journal</i>, vol. 37, no. 15. Wiley, 2018.","ama":"Truckenbrodt SM, Viplav A, Jähne S, et al. Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission. <i>The EMBO Journal</i>. 2018;37(15). doi:<a href=\"https://doi.org/10.15252/embj.201798044\">10.15252/embj.201798044</a>"},"quality_controlled":"1","author":[{"id":"45812BD4-F248-11E8-B48F-1D18A9856A87","full_name":"Truckenbrodt, Sven M","first_name":"Sven M","last_name":"Truckenbrodt"},{"first_name":"Abhiyan","last_name":"Viplav","full_name":"Viplav, Abhiyan"},{"last_name":"Jähne","first_name":"Sebsatian","full_name":"Jähne, Sebsatian"},{"first_name":"Angela","last_name":"Vogts","full_name":"Vogts, Angela"},{"first_name":"Annette","last_name":"Denker","full_name":"Denker, Annette"},{"full_name":"Wildhagen, Hanna","first_name":"Hanna","last_name":"Wildhagen"},{"full_name":"Fornasiero, Eugenio","first_name":"Eugenio","last_name":"Fornasiero"},{"last_name":"Rizzoli","first_name":"Silvio","full_name":"Rizzoli, Silvio"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2018","pmid":1,"publication":"The EMBO Journal","title":"Newly produced synaptic vesicle proteins are preferentially used in synaptic transmission","_id":"145","ddc":["570"],"oa":1,"abstract":[{"text":"Aged proteins can become hazardous to cellular function, by accumulating molecular damage. This implies that cells should preferentially rely on newly produced ones. We tested this hypothesis in cultured hippocampal neurons, focusing on synaptic transmission. We found that newly synthesized vesicle proteins were incorporated in the actively recycling pool of vesicles responsible for all neurotransmitter release during physiological activity. We observed this for the calcium sensor Synaptotagmin 1, for the neurotransmitter transporter VGAT, and for the fusion protein VAMP2 (Synaptobrevin 2). Metabolic labeling of proteins and visualization by secondary ion mass spectrometry enabled us to query the entire protein makeup of the actively recycling vesicles, which we found to be younger than that of non-recycling vesicles. The young vesicle proteins remained in use for up to ~ 24 h, during which they participated in recycling a few hundred times. They were afterward reluctant to release and were degraded after an additional ~ 24–48 h. We suggest that the recycling pool of synaptic vesicles relies on newly synthesized proteins, while the inactive reserve pool contains older proteins.","lang":"eng"}],"publication_status":"published","external_id":{"isi":["000440416900005"],"pmid":["29950309"]},"file":[{"file_size":2846470,"creator":"dernst","content_type":"application/pdf","date_created":"2018-12-17T14:17:29Z","relation":"main_file","access_level":"open_access","checksum":"a540feb6c9af6aefc78de531461a8835","file_name":"2018_EMBO_Truckenbrodt.pdf","file_id":"5710","date_updated":"2020-07-14T12:44:56Z"}],"date_published":"2018-08-01T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["0261-4189"]},"article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Published Version","type":"journal_article","date_updated":"2023-09-13T09:02:48Z","day":"01","department":[{"_id":"JoDa"}],"has_accepted_license":"1","doi":"10.15252/embj.201798044","language":[{"iso":"eng"}],"acknowledgement":"We thank Reinhard Jahn for providing a plasmid for YFP-SNAP25. We thank Erwin Neher for help with the development of the mathematical model of the synaptic vesicle life cycle. We thank Martin Meschkat, Andreas Höbartner, Annedore Punge, and Peer Hoopmann for help with the experiments. We thank Burkhard Rammner for providing the illustrations of synaptic vesicle and protein dynamics. We thank Manuel Maidorn, Martin Helm, and Katharina N. Richter for critically reading the manuscript. S.T. was supported by an Excellence Stipend of the Göttingen Graduate School for Neurosciences, Biophysics, and Molecular Biosciences (GGNB). E.F.F. is a recipient of long-term fellowships from the European Molecular Biology Organization (ALTF_797-2012) and from the Human Frontier Science Program (HFSP_LT000830/2013). The work was supported by grants to S.O.R. from the European Research Council (ERC-2013-CoG NeuroMolAnatomy) and from the Deutsche Forschungsgemeinschaft (Cluster of Excellence Nanoscale Microscopy and Molecular Physiology of the Brain, SFB1190/P09, SFB889/A05, and SFB1286/A03, and DFG RI 1967 7/1). The nanoSIMS instrument was funded by the German Federal Ministry of Education and Research (03F0626A)."},{"external_id":{"pmid":["30061750"],"isi":["000443861300016"]},"file":[{"relation":"main_file","date_created":"2019-11-18T16:24:07Z","content_type":"application/pdf","creator":"dernst","file_size":226829,"date_updated":"2020-07-14T12:44:56Z","file_id":"7043","checksum":"da33101c76ee1b2dc5ab28fd2ccba9d0","file_name":"2018_NaturePlants_Shi.pdf","access_level":"open_access"}],"date_published":"2018-07-30T00:00:00Z","page":"596 - 604","scopus_import":"1","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","oa_version":"Submitted Version","date_updated":"2023-09-19T10:08:45Z","type":"journal_article","day":"30","department":[{"_id":"JiFr"}],"has_accepted_license":"1","doi":"10.1038/s41477-018-0212-z","language":[{"iso":"eng"}],"issue":"8","volume":4,"file_date_updated":"2020-07-14T12:44:56Z","publisher":"Nature Publishing Group","article_type":"original","intvolume":"         4","isi":1,"publist_id":"7777","month":"07","date_created":"2018-12-11T11:44:52Z","status":"public","citation":{"apa":"Shi, C. L., von Wangenheim, D., Herrmann, U., Wildhagen, M., Kulik, I., Kopf, A., … Aalen, R. B. (2018). The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling. <i>Nature Plants</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41477-018-0212-z\">https://doi.org/10.1038/s41477-018-0212-z</a>","mla":"Shi, Chun Lin, et al. “The Dynamics of Root Cap Sloughing in Arabidopsis Is Regulated by Peptide Signalling.” <i>Nature Plants</i>, vol. 4, no. 8, Nature Publishing Group, 2018, pp. 596–604, doi:<a href=\"https://doi.org/10.1038/s41477-018-0212-z\">10.1038/s41477-018-0212-z</a>.","ista":"Shi CL, von Wangenheim D, Herrmann U, Wildhagen M, Kulik I, Kopf A, Ishida T, Olsson V, Anker MK, Albert M, Butenko MA, Felix G, Sawa S, Claassen M, Friml J, Aalen RB. 2018. The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling. Nature Plants. 4(8), 596–604.","chicago":"Shi, Chun Lin, Daniel von Wangenheim, Ullrich Herrmann, Mari Wildhagen, Ivan Kulik, Andreas Kopf, Takashi Ishida, et al. “The Dynamics of Root Cap Sloughing in Arabidopsis Is Regulated by Peptide Signalling.” <i>Nature Plants</i>. Nature Publishing Group, 2018. <a href=\"https://doi.org/10.1038/s41477-018-0212-z\">https://doi.org/10.1038/s41477-018-0212-z</a>.","short":"C.L. Shi, D. von Wangenheim, U. Herrmann, M. Wildhagen, I. Kulik, A. Kopf, T. Ishida, V. Olsson, M.K. Anker, M. Albert, M.A. Butenko, G. Felix, S. Sawa, M. Claassen, J. Friml, R.B. Aalen, Nature Plants 4 (2018) 596–604.","ieee":"C. L. Shi <i>et al.</i>, “The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling,” <i>Nature Plants</i>, vol. 4, no. 8. Nature Publishing Group, pp. 596–604, 2018.","ama":"Shi CL, von Wangenheim D, Herrmann U, et al. The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling. <i>Nature Plants</i>. 2018;4(8):596-604. doi:<a href=\"https://doi.org/10.1038/s41477-018-0212-z\">10.1038/s41477-018-0212-z</a>"},"author":[{"full_name":"Shi, Chun Lin","first_name":"Chun Lin","last_name":"Shi"},{"first_name":"Daniel","last_name":"Von Wangenheim","orcid":"0000-0002-6862-1247","full_name":"Von Wangenheim, Daniel","id":"49E91952-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Herrmann, Ullrich","first_name":"Ullrich","last_name":"Herrmann"},{"full_name":"Wildhagen, Mari","first_name":"Mari","last_name":"Wildhagen"},{"last_name":"Kulik","first_name":"Ivan","full_name":"Kulik, Ivan","id":"F0AB3FCE-02D1-11E9-BD0E-99399A5D3DEB"},{"last_name":"Kopf","first_name":"Andreas","full_name":"Kopf, Andreas"},{"full_name":"Ishida, Takashi","last_name":"Ishida","first_name":"Takashi"},{"full_name":"Olsson, Vilde","last_name":"Olsson","first_name":"Vilde"},{"first_name":"Mari Kristine","last_name":"Anker","full_name":"Anker, Mari Kristine"},{"full_name":"Albert, Markus","first_name":"Markus","last_name":"Albert"},{"full_name":"Butenko, Melinka A","last_name":"Butenko","first_name":"Melinka A"},{"full_name":"Felix, Georg","first_name":"Georg","last_name":"Felix"},{"last_name":"Sawa","first_name":"Shinichiro","full_name":"Sawa, Shinichiro"},{"first_name":"Manfred","last_name":"Claassen","full_name":"Claassen, Manfred"},{"last_name":"Friml","first_name":"Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596"},{"last_name":"Aalen","first_name":"Reidunn B","full_name":"Aalen, Reidunn B"}],"quality_controlled":"1","year":"2018","pmid":1,"publication":"Nature Plants","title":"The dynamics of root cap sloughing in Arabidopsis is regulated by peptide signalling","_id":"146","related_material":{"link":[{"relation":"press_release","url":"https://ist.ac.at/en/news/new-process-in-root-development-discovered/","description":"News on IST Homepage"}]},"oa":1,"ddc":["580"],"abstract":[{"lang":"eng","text":"The root cap protects the stem cell niche of angiosperm roots from damage. In Arabidopsis, lateral root cap (LRC) cells covering the meristematic zone are regularly lost through programmed cell death, while the outermost layer of the root cap covering the tip is repeatedly sloughed. Efficient coordination with stem cells producing new layers is needed to maintain a constant size of the cap. We present a signalling pair, the peptide IDA-LIKE1 (IDL1) and its receptor HAESA-LIKE2 (HSL2), mediating such communication. Live imaging over several days characterized this process from initial fractures in LRC cell files to full separation of a layer. Enhanced expression of IDL1 in the separating root cap layers resulted in increased frequency of sloughing, balanced with generation of new layers in a HSL2-dependent manner. Transcriptome analyses linked IDL1-HSL2 signalling to the transcription factors BEARSKIN1/2 and genes associated with programmed cell death. Mutations in either IDL1 or HSL2 slowed down cell division, maturation and separation. Thus, IDL1-HSL2 signalling potentiates dynamic regulation of the homeostatic balance between stem cell division and sloughing activity."}],"publication_status":"published"},{"article_type":"original","publisher":"Oxford University Press","volume":30,"issue":"10","status":"public","month":"11","date_created":"2018-12-11T11:44:52Z","isi":1,"publist_id":"7776","intvolume":"        30","year":"2018","quality_controlled":"1","author":[{"full_name":"Kania, Urszula","id":"4AE5C486-F248-11E8-B48F-1D18A9856A87","first_name":"Urszula","last_name":"Kania"},{"first_name":"Tomasz","last_name":"Nodzyński","full_name":"Nodzyński, Tomasz"},{"first_name":"Qing","last_name":"Lu","full_name":"Lu, Qing"},{"full_name":"Hicks, Glenn R","first_name":"Glenn R","last_name":"Hicks"},{"first_name":"Wim","last_name":"Nerinckx","full_name":"Nerinckx, Wim"},{"last_name":"Mishev","first_name":"Kiril","full_name":"Mishev, Kiril"},{"first_name":"Francois","last_name":"Peurois","full_name":"Peurois, Francois"},{"first_name":"Jacqueline","last_name":"Cherfils","full_name":"Cherfils, Jacqueline"},{"full_name":"De, Rycke Riet Maria","first_name":"Rycke Riet Maria","last_name":"De"},{"id":"399876EC-F248-11E8-B48F-1D18A9856A87","full_name":"Grones, Peter","first_name":"Peter","last_name":"Grones"},{"full_name":"Robert, Stéphanie","first_name":"Stéphanie","last_name":"Robert"},{"full_name":"Russinova, Eugenia","last_name":"Russinova","first_name":"Eugenia"},{"orcid":"0000-0002-8302-7596","full_name":"Friml, Jirí","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"}],"citation":{"ieee":"U. Kania <i>et al.</i>, “The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes,” <i>The Plant Cell</i>, vol. 30, no. 10. Oxford University Press, pp. 2553–2572, 2018.","ama":"Kania U, Nodzyński T, Lu Q, et al. The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes. <i>The Plant Cell</i>. 2018;30(10):2553-2572. doi:<a href=\"https://doi.org/10.1105/tpc.18.00127\">10.1105/tpc.18.00127</a>","ista":"Kania U, Nodzyński T, Lu Q, Hicks GR, Nerinckx W, Mishev K, Peurois F, Cherfils J, De RRM, Grones P, Robert S, Russinova E, Friml J. 2018. The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes. The Plant Cell. 30(10), 2553–2572.","short":"U. Kania, T. Nodzyński, Q. Lu, G.R. Hicks, W. Nerinckx, K. Mishev, F. Peurois, J. Cherfils, R.R.M. De, P. Grones, S. Robert, E. Russinova, J. Friml, The Plant Cell 30 (2018) 2553–2572.","chicago":"Kania, Urszula, Tomasz Nodzyński, Qing Lu, Glenn R Hicks, Wim Nerinckx, Kiril Mishev, Francois Peurois, et al. “The Inhibitor Endosidin 4 Targets SEC7 Domain-Type ARF GTPase Exchange Factors and Interferes with Sub Cellular Trafficking in Eukaryotes.” <i>The Plant Cell</i>. Oxford University Press, 2018. <a href=\"https://doi.org/10.1105/tpc.18.00127\">https://doi.org/10.1105/tpc.18.00127</a>.","mla":"Kania, Urszula, et al. “The Inhibitor Endosidin 4 Targets SEC7 Domain-Type ARF GTPase Exchange Factors and Interferes with Sub Cellular Trafficking in Eukaryotes.” <i>The Plant Cell</i>, vol. 30, no. 10, Oxford University Press, 2018, pp. 2553–72, doi:<a href=\"https://doi.org/10.1105/tpc.18.00127\">10.1105/tpc.18.00127</a>.","apa":"Kania, U., Nodzyński, T., Lu, Q., Hicks, G. R., Nerinckx, W., Mishev, K., … Friml, J. (2018). The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes. <i>The Plant Cell</i>. Oxford University Press. <a href=\"https://doi.org/10.1105/tpc.18.00127\">https://doi.org/10.1105/tpc.18.00127</a>"},"main_file_link":[{"url":"https://doi.org/10.1105/tpc.18.00127","open_access":"1"}],"abstract":[{"lang":"eng","text":"The trafficking of subcellular cargos in eukaryotic cells crucially depends on vesicle budding, a process mediated by ARF-GEFs (ADP-ribosylation factor guanine nucleotide exchange factors). In plants, ARF-GEFs play essential roles in endocytosis, vacuolar trafficking, recycling, secretion, and polar trafficking. Moreover, they are important for plant development, mainly through controlling the polar subcellular localization of PIN-FORMED (PIN) transporters of the plant hormone auxin. Here, using a chemical genetics screen in Arabidopsis thaliana, we identified Endosidin 4 (ES4), an inhibitor of eukaryotic ARF-GEFs. ES4 acts similarly to and synergistically with the established ARF-GEF inhibitor Brefeldin A and has broad effects on intracellular trafficking, including endocytosis, exocytosis, and vacuolar targeting. Additionally, Arabidopsis and yeast (Sacharomyces cerevisiae) mutants defective in ARF-GEF show altered sensitivity to ES4. ES4 interferes with the activation-based membrane association of the ARF1 GTPases, but not of their mutant variants that are activated independently of ARF-GEF activity. Biochemical approaches and docking simulations confirmed that ES4 specifically targets the SEC7 domain-containing ARF-GEFs. These observations collectively identify ES4 as a chemical tool enabling the study of ARF-GEF-mediated processes, including ARF-GEF-mediated plant development."}],"publication_status":"published","project":[{"name":"Polarity and subcellular dynamics in plants","grant_number":"282300","call_identifier":"FP7","_id":"25716A02-B435-11E9-9278-68D0E5697425"},{"_id":"261099A6-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Tracing Evolution of Auxin Transport and Polarity in Plants","grant_number":"742985"}],"_id":"147","oa":1,"pmid":1,"title":"The inhibitor Endosidin 4 targets SEC7 domain-type ARF GTPase exchange factors and interferes with sub cellular trafficking in eukaryotes","publication":"The Plant Cell","page":"2553 - 2572","external_id":{"pmid":["30018156"],"isi":["000450000500023"]},"date_published":"2018-11-12T00:00:00Z","scopus_import":"1","publication_identifier":{"issn":["1040-4651"]},"day":"12","oa_version":"Published Version","type":"journal_article","date_updated":"2025-05-07T11:12:30Z","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","acknowledgement":"We thank Gerd Jürgens, Sandra Richter, and Sheng Yang He for providing antibodies; Maciek Adamowski, Fernando Aniento, Sebastian Bednarek, Nico Callewaert, Matyás Fendrych, Elena Feraru, and Mugurel I. Feraru for helpful suggestions; Siamsa Doyle for critical reading of the manuscript and helpful comments and suggestions; and Stephanie Smith and Martine De Cock for help in editing and language corrections. We acknowledge the core facility Cellular Imaging of CEITEC supported by the Czech-BioImaging large RI project (LM2015062 funded by MEYS CR) for their support with obtaining scientific data presented in this article. Plant Sciences Core Facility of CEITEC Masaryk University is gratefully acknowledged for obtaining part of the scientific data presented in this article. We acknowledge support from the Fondation pour la Recherche Médicale and from the Institut National du Cancer (J.C.). The research leading to these results was funded by the European Research Council under the European Union's 7th Framework Program (FP7/2007-2013)/ERC grant agreement numbers 282300 and 742985 and the Czech Science Foundation GAČR (GA18-26981S; J.F.); Ministry of Education, Youth, and Sports/MEYS of the Czech Republic under the Project CEITEC 2020 (LQ1601; T.N.); the China Science Council for a predoctoral fellowship (Q.L.); a joint research project within the framework of cooperation between the Research Foundation-Flanders and the Bulgarian Academy of Sciences (VS.025.13N; K.M. and E.R.); Vetenskapsrådet and Vinnova (Verket för Innovationssystem; S.R.), Knut och Alice Wallenbergs Stiftelse via “Shapesystem” Grant 2012.0050 (S.R.), Kempe stiftelserna (P.G.), Tryggers CTS410 (P.G.).","department":[{"_id":"JiFr"}],"doi":"10.1105/tpc.18.00127","language":[{"iso":"eng"}],"ec_funded":1},{"alternative_title":["ISTA Thesis"],"publication_identifier":{"issn":["2663-337X"]},"date_published":"2018-01-01T00:00:00Z","file":[{"relation":"source_file","embargo_to":"open_access","date_created":"2019-04-05T09:37:56Z","file_size":28112114,"creator":"dernst","content_type":"application/vnd.openxmlformats-officedocument.wordprocessingml.document","date_updated":"2020-12-02T23:30:08Z","file_id":"6226","file_name":"2018_Hurny_thesis_source.docx","checksum":"0c9d6d1c80d9857e6e545213467bbcb2","access_level":"closed"},{"access_level":"open_access","file_name":"2018_Hurny_thesis.pdf","checksum":"ecbe481a1413d270bd501b872c7ed54f","file_id":"6227","date_updated":"2020-12-02T09:52:16Z","embargo":"2019-07-10","creator":"dernst","content_type":"application/pdf","file_size":12524427,"date_created":"2019-04-05T09:37:55Z","relation":"main_file"}],"page":"147","language":[{"iso":"eng"}],"doi":"10.15479/AT:ISTA:th_930","department":[{"_id":"EvBe"}],"has_accepted_license":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","type":"dissertation","date_updated":"2023-09-07T12:41:06Z","oa_version":"Published Version","day":"01","supervisor":[{"full_name":"Benková, Eva","orcid":"0000-0002-8510-9739","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","first_name":"Eva"}],"publist_id":"7277","degree_awarded":"PhD","date_created":"2018-12-11T11:47:03Z","month":"01","status":"public","pubrep_id":"930","file_date_updated":"2020-12-02T23:30:08Z","publisher":"Institute of Science and Technology Austria","title":"Identification and characterization of novel auxin-cytokinin cross-talk components","ddc":["570"],"related_material":{"record":[{"id":"1024","relation":"part_of_dissertation","status":"public"}]},"oa":1,"_id":"539","publication_status":"published","abstract":[{"text":"The whole life cycle of plants as well as their responses to environmental stimuli is governed by a complex network of hormonal regulations. A number of studies have demonstrated an essential role of both auxin and cytokinin in the regulation of many aspects of plant growth and development including embryogenesis, postembryonic organogenic processes such as root, and shoot branching, root and shoot apical meristem activity and phyllotaxis. Over the last decades essential knowledge on the key molecular factors and pathways that spatio-temporally define auxin and cytokinin activities in the plant body has accumulated. However, how both hormonal pathways are interconnected by a complex network of interactions and feedback circuits that determines the final outcome of the individual hormone actions is still largely unknown. Root system architecture establishment and in particular formation of lateral organs is prime example of developmental process at whose regulation both auxin and cytokinin pathways converge. To dissect convergence points and pathways that tightly balance auxin - cytokinin antagonistic activities that determine the root branching pattern transcriptome profiling was applied. Genome wide expression analyses of the xylem pole pericycle, a tissue giving rise to lateral roots, led to identification of genes that are highly responsive to combinatorial auxin and cytokinin treatments and play an essential function in the auxin-cytokinin regulated root branching. SYNERGISTIC AUXIN CYTOKININ 1 (SYAC1) gene, which encodes for a protein of unknown function, was detected among the top candidate genes of which expression was synergistically up-regulated by simultaneous hormonal treatment. Plants with modulated SYAC1 activity exhibit severe defects in the root system establishment and attenuate developmental responses to both auxin and cytokinin. To explore the biological function of the SYAC1, we employed different strategies including expression pattern analysis, subcellular localization and phenotypic analyses of the syac1 loss-of-function and gain-of-function transgenic lines along with the identification of the SYAC1 interaction partners. Detailed functional characterization revealed that SYAC1 acts as a developmentally specific regulator of the secretory pathway to control deposition of cell wall components and thereby rapidly fine tune elongation growth.","lang":"eng"}],"citation":{"mla":"Hurny, Andrej. <i>Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components</i>. Institute of Science and Technology Austria, 2018, doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">10.15479/AT:ISTA:th_930</a>.","apa":"Hurny, A. (2018). <i>Identification and characterization of novel auxin-cytokinin cross-talk components</i>. Institute of Science and Technology Austria. <a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">https://doi.org/10.15479/AT:ISTA:th_930</a>","ista":"Hurny A. 2018. Identification and characterization of novel auxin-cytokinin cross-talk components. Institute of Science and Technology Austria.","chicago":"Hurny, Andrej. “Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components.” Institute of Science and Technology Austria, 2018. <a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">https://doi.org/10.15479/AT:ISTA:th_930</a>.","short":"A. Hurny, Identification and Characterization of Novel Auxin-Cytokinin Cross-Talk Components, Institute of Science and Technology Austria, 2018.","ieee":"A. Hurny, “Identification and characterization of novel auxin-cytokinin cross-talk components,” Institute of Science and Technology Austria, 2018.","ama":"Hurny A. Identification and characterization of novel auxin-cytokinin cross-talk components. 2018. doi:<a href=\"https://doi.org/10.15479/AT:ISTA:th_930\">10.15479/AT:ISTA:th_930</a>"},"author":[{"orcid":"0000-0003-3638-1426","full_name":"Hurny, Andrej","id":"4DC4AF46-F248-11E8-B48F-1D18A9856A87","last_name":"Hurny","first_name":"Andrej"}],"tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"year":"2018"},{"scopus_import":"1","date_published":"2018-10-08T00:00:00Z","external_id":{"isi":["000446579900002"]},"page":"3 - 19","doi":"10.1016/j.devcel.2018.09.014","language":[{"iso":"eng"}],"department":[{"_id":"CaHe"}],"acknowledgement":"Research in the Bellaïche laboratory is supported by the European Research Council (ERC Advanced, TiMoprh, 340784), the Fondation ARC pour la Recherche sur le Cancer (SL220130607097), the Agence Nationale de la Recherche (ANR lLabex DEEP; 11-LBX-0044, ANR-10-IDEX-0001-02), the Centre National de la Recherche Scientifique, the Institut National de la Santé et de la Recherche Médicale, and Institut Curie and PSL Research University funding or grants.","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","type":"journal_article","date_updated":"2023-09-13T08:54:38Z","oa_version":"Published Version","day":"08","intvolume":"        47","publist_id":"8000","isi":1,"date_created":"2018-12-11T11:44:23Z","month":"10","status":"public","volume":47,"issue":"1","article_type":"review","publisher":"Cell Press","title":"Mechanical force-driven adherents junction remodeling and epithelial dynamics","publication":"Developmental Cell","_id":"54","publication_status":"published","abstract":[{"lang":"eng","text":"During epithelial tissue development, repair, and homeostasis, adherens junctions (AJs) ensure intercellular adhesion and tissue integrity while allowing for cell and tissue dynamics. Mechanical forces play critical roles in AJs’ composition and dynamics. Recent findings highlight that beyond a well-established role in reinforcing cell-cell adhesion, AJ mechanosensitivity promotes junctional remodeling and polarization, thereby regulating critical processes such as cell intercalation, division, and collective migration. Here, we provide an integrated view of mechanosensing mechanisms that regulate cell-cell contact composition, geometry, and integrity under tension and highlight pivotal roles for mechanosensitive AJ remodeling in preserving epithelial integrity and sustaining tissue dynamics."}],"citation":{"ista":"Nunes Pinheiro DC, Bellaïche Y. 2018. Mechanical force-driven adherents junction remodeling and epithelial dynamics. Developmental Cell. 47(1), 3–19.","chicago":"Nunes Pinheiro, Diana C, and Yohanns Bellaïche. “Mechanical Force-Driven Adherents Junction Remodeling and Epithelial Dynamics.” <i>Developmental Cell</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.devcel.2018.09.014\">https://doi.org/10.1016/j.devcel.2018.09.014</a>.","short":"D.C. Nunes Pinheiro, Y. Bellaïche, Developmental Cell 47 (2018) 3–19.","ieee":"D. C. Nunes Pinheiro and Y. Bellaïche, “Mechanical force-driven adherents junction remodeling and epithelial dynamics,” <i>Developmental Cell</i>, vol. 47, no. 1. Cell Press, pp. 3–19, 2018.","ama":"Nunes Pinheiro DC, Bellaïche Y. Mechanical force-driven adherents junction remodeling and epithelial dynamics. <i>Developmental Cell</i>. 2018;47(1):3-19. doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.09.014\">10.1016/j.devcel.2018.09.014</a>","mla":"Nunes Pinheiro, Diana C., and Yohanns Bellaïche. “Mechanical Force-Driven Adherents Junction Remodeling and Epithelial Dynamics.” <i>Developmental Cell</i>, vol. 47, no. 1, Cell Press, 2018, pp. 3–19, doi:<a href=\"https://doi.org/10.1016/j.devcel.2018.09.014\">10.1016/j.devcel.2018.09.014</a>.","apa":"Nunes Pinheiro, D. C., &#38; Bellaïche, Y. (2018). Mechanical force-driven adherents junction remodeling and epithelial dynamics. <i>Developmental Cell</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.devcel.2018.09.014\">https://doi.org/10.1016/j.devcel.2018.09.014</a>"},"main_file_link":[{"url":"https://doi.org/10.1016/j.devcel.2018.09.014"}],"quality_controlled":"1","author":[{"id":"2E839F16-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-4333-7503","full_name":"Nunes Pinheiro, Diana C","first_name":"Diana C","last_name":"Nunes Pinheiro"},{"full_name":"Bellaïche, Yohanns","last_name":"Bellaïche","first_name":"Yohanns"}],"year":"2018"},{"year":"2018","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"quality_controlled":"1","author":[{"full_name":"Kelemen, Réka K","orcid":"0000-0002-8489-9281","id":"48D3F8DE-F248-11E8-B48F-1D18A9856A87","last_name":"Kelemen","first_name":"Réka K"},{"id":"49E1C5C6-F248-11E8-B48F-1D18A9856A87","full_name":"Vicoso, Beatriz","orcid":"0000-0002-4579-8306","last_name":"Vicoso","first_name":"Beatriz"}],"citation":{"apa":"Kelemen, R. K., &#38; Vicoso, B. (2018). Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. <i>Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/genetics.117.300513\">https://doi.org/10.1534/genetics.117.300513</a>","mla":"Kelemen, Réka K., and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” <i>Genetics</i>, vol. 208, no. 1, Genetics Society of America, 2018, pp. 365–75, doi:<a href=\"https://doi.org/10.1534/genetics.117.300513\">10.1534/genetics.117.300513</a>.","chicago":"Kelemen, Réka K, and Beatriz Vicoso. “Complex History and Differentiation Patterns of the T-Haplotype, a Mouse Meiotic Driver.” <i>Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/genetics.117.300513\">https://doi.org/10.1534/genetics.117.300513</a>.","short":"R.K. Kelemen, B. Vicoso, Genetics 208 (2018) 365–375.","ista":"Kelemen RK, Vicoso B. 2018. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. Genetics. 208(1), 365–375.","ieee":"R. K. Kelemen and B. Vicoso, “Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver,” <i>Genetics</i>, vol. 208, no. 1. Genetics Society of America, pp. 365–375, 2018.","ama":"Kelemen RK, Vicoso B. Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver. <i>Genetics</i>. 2018;208(1):365-375. doi:<a href=\"https://doi.org/10.1534/genetics.117.300513\">10.1534/genetics.117.300513</a>"},"publication_status":"published","abstract":[{"lang":"eng","text":"The t-haplotype, a mouse meiotic driver found on chromosome 17, has been a model for autosomal segregation distortion for close to a century, but several questions remain regarding its biology and evolutionary history. A recently published set of population genomics resources for wild mice includes several individuals heterozygous for the t-haplotype, which we use to characterize this selfish element at the genomic and transcriptomic level. Our results show that large sections of the t-haplotype have been replaced by standard homologous sequences, possibly due to occasional events of recombination, and that this complicates the inference of its history. As expected for a long genomic segment of very low recombination, the t-haplotype carries an excess of fixed nonsynonymous mutations compared to the standard chromosome. This excess is stronger for regions that have not undergone recent recombination, suggesting that occasional gene flow between the t and the standard chromosome may provide a mechanism to regenerate coding sequences that have accumulated deleterious mutations. Finally, we find that t-complex genes with altered expression largely overlap with deleted or amplified regions, and that carrying a t-haplotype alters the testis expression of genes outside of the t-complex, providing new leads into the pathways involved in the biology of this segregation distorter."}],"project":[{"name":"Prevalence and Influence of Sexual Antagonism on Genome Evolution","grant_number":"715257","_id":"250BDE62-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"}],"ddc":["576"],"related_material":{"record":[{"relation":"popular_science","status":"public","id":"5571"},{"status":"public","relation":"popular_science","id":"5572"}]},"oa":1,"_id":"542","title":"Complex history and differentiation patterns of the t-haplotype, a mouse meiotic driver","publication":"Genetics","publisher":"Genetics Society of America","article_type":"original","file_date_updated":"2020-07-14T12:46:50Z","issue":"1","volume":208,"pubrep_id":"1058","status":"public","date_created":"2018-12-11T11:47:04Z","month":"01","publist_id":"7274","isi":1,"intvolume":"       208","day":"01","date_updated":"2024-02-21T13:48:27Z","type":"journal_article","oa_version":"Published Version","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1534/genetics.117.300513","language":[{"iso":"eng"}],"department":[{"_id":"BeVi"}],"has_accepted_license":"1","ec_funded":1,"page":"365 - 375","date_published":"2018-01-01T00:00:00Z","external_id":{"isi":["000419356300024"]},"file":[{"file_id":"5132","date_updated":"2020-07-14T12:46:50Z","access_level":"open_access","file_name":"IST-2018-1058-v1+1_365.full__1_.pdf","checksum":"2123845e7031a0cf043905be160f9e69","date_created":"2018-12-12T10:15:14Z","relation":"main_file","creator":"system","content_type":"application/pdf","file_size":1311661}],"scopus_import":"1"},{"date_published":"2018-01-02T00:00:00Z","external_id":{"isi":["000419128700049"]},"page":"186 - 191","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","type":"journal_article","date_updated":"2023-09-19T10:16:35Z","oa_version":"Submitted Version","day":"02","language":[{"iso":"eng"}],"doi":"10.1073/pnas.1711114115","department":[{"_id":"GaTk"}],"volume":115,"issue":"1","publisher":"National Academy of Sciences","intvolume":"       115","publist_id":"7273","isi":1,"date_created":"2018-12-11T11:47:04Z","month":"01","status":"public","citation":{"mla":"Chalk, Matthew J., et al. “Toward a Unified Theory of Efficient, Predictive, and Sparse Coding.” <i>PNAS</i>, vol. 115, no. 1, National Academy of Sciences, 2018, pp. 186–91, doi:<a href=\"https://doi.org/10.1073/pnas.1711114115\">10.1073/pnas.1711114115</a>.","apa":"Chalk, M. J., Marre, O., &#38; Tkačik, G. (2018). Toward a unified theory of efficient, predictive, and sparse coding. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1711114115\">https://doi.org/10.1073/pnas.1711114115</a>","ista":"Chalk MJ, Marre O, Tkačik G. 2018. Toward a unified theory of efficient, predictive, and sparse coding. PNAS. 115(1), 186–191.","short":"M.J. Chalk, O. Marre, G. Tkačik, PNAS 115 (2018) 186–191.","chicago":"Chalk, Matthew J, Olivier Marre, and Gašper Tkačik. “Toward a Unified Theory of Efficient, Predictive, and Sparse Coding.” <i>PNAS</i>. National Academy of Sciences, 2018. <a href=\"https://doi.org/10.1073/pnas.1711114115\">https://doi.org/10.1073/pnas.1711114115</a>.","ama":"Chalk MJ, Marre O, Tkačik G. Toward a unified theory of efficient, predictive, and sparse coding. <i>PNAS</i>. 2018;115(1):186-191. doi:<a href=\"https://doi.org/10.1073/pnas.1711114115\">10.1073/pnas.1711114115</a>","ieee":"M. J. Chalk, O. Marre, and G. Tkačik, “Toward a unified theory of efficient, predictive, and sparse coding,” <i>PNAS</i>, vol. 115, no. 1. National Academy of Sciences, pp. 186–191, 2018."},"main_file_link":[{"url":"https://doi.org/10.1101/152660 ","open_access":"1"}],"author":[{"last_name":"Chalk","first_name":"Matthew J","orcid":"0000-0001-7782-4436","full_name":"Chalk, Matthew J","id":"2BAAC544-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Marre, Olivier","first_name":"Olivier","last_name":"Marre"},{"first_name":"Gasper","last_name":"Tkacik","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"}],"quality_controlled":"1","year":"2018","publication":"PNAS","title":"Toward a unified theory of efficient, predictive, and sparse coding","oa":1,"_id":"543","project":[{"grant_number":"P 25651-N26","name":"Sensitivity to higher-order statistics in natural scenes","call_identifier":"FWF","_id":"254D1A94-B435-11E9-9278-68D0E5697425"}],"publication_status":"published","abstract":[{"lang":"eng","text":"A central goal in theoretical neuroscience is to predict the response properties of sensory neurons from first principles. To this end, “efficient coding” posits that sensory neurons encode maximal information about their inputs given internal constraints. There exist, however, many variants of efficient coding (e.g., redundancy reduction, different formulations of predictive coding, robust coding, sparse coding, etc.), differing in their regimes of applicability, in the relevance of signals to be encoded, and in the choice of constraints. It is unclear how these types of efficient coding relate or what is expected when different coding objectives are combined. Here we present a unified framework that encompasses previously proposed efficient coding models and extends to unique regimes. We show that optimizing neural responses to encode predictive information can lead them to either correlate or decorrelate their inputs, depending on the stimulus statistics; in contrast, at low noise, efficiently encoding the past always predicts decorrelation. Later, we investigate coding of naturalistic movies and show that qualitatively different types of visual motion tuning and levels of response sparsity are predicted, depending on whether the objective is to recover the past or predict the future. Our approach promises a way to explain the observed diversity of sensory neural responses, as due to multiple functional goals and constraints fulfilled by different cell types and/or circuits."}]},{"quality_controlled":"1","author":[{"orcid":"0000-0002-1819-198X","full_name":"György, Attila","id":"3BCEDBE0-F248-11E8-B48F-1D18A9856A87","last_name":"György","first_name":"Attila"},{"id":"3047D808-F248-11E8-B48F-1D18A9856A87","full_name":"Roblek, Marko","orcid":"0000-0001-9588-1389","last_name":"Roblek","first_name":"Marko"},{"last_name":"Ratheesh","first_name":"Aparna","orcid":"0000-0001-7190-0776","full_name":"Ratheesh, Aparna","id":"2F064CFE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Valosková","first_name":"Katarina","id":"46F146FC-F248-11E8-B48F-1D18A9856A87","full_name":"Valosková, Katarina"},{"first_name":"Vera","last_name":"Belyaeva","full_name":"Belyaeva, Vera","id":"47F080FE-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Wachner","first_name":"Stephanie","id":"2A95E7B0-F248-11E8-B48F-1D18A9856A87","full_name":"Wachner, Stephanie"},{"full_name":"Matsubayashi, Yutaka","last_name":"Matsubayashi","first_name":"Yutaka"},{"last_name":"Sanchez Sanchez","first_name":"Besaiz","full_name":"Sanchez Sanchez, Besaiz"},{"last_name":"Stramer","first_name":"Brian","full_name":"Stramer, Brian"},{"last_name":"Siekhaus","first_name":"Daria E","id":"3D224B9E-F248-11E8-B48F-1D18A9856A87","full_name":"Siekhaus, Daria E","orcid":"0000-0001-8323-8353"}],"citation":{"mla":"György, Attila, et al. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” <i>G3: Genes, Genomes, Genetics</i>, vol. 8, no. 3, Genetics Society of America, 2018, pp. 845–57, doi:<a href=\"https://doi.org/10.1534/g3.117.300452\">10.1534/g3.117.300452</a>.","apa":"György, A., Roblek, M., Ratheesh, A., Valosková, K., Belyaeva, V., Wachner, S., … Siekhaus, D. E. (2018). Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. <i>G3: Genes, Genomes, Genetics</i>. Genetics Society of America. <a href=\"https://doi.org/10.1534/g3.117.300452\">https://doi.org/10.1534/g3.117.300452</a>","ama":"György A, Roblek M, Ratheesh A, et al. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. <i>G3: Genes, Genomes, Genetics</i>. 2018;8(3):845-857. doi:<a href=\"https://doi.org/10.1534/g3.117.300452\">10.1534/g3.117.300452</a>","ieee":"A. György <i>et al.</i>, “Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues,” <i>G3: Genes, Genomes, Genetics</i>, vol. 8, no. 3. Genetics Society of America, pp. 845–857, 2018.","ista":"György A, Roblek M, Ratheesh A, Valosková K, Belyaeva V, Wachner S, Matsubayashi Y, Sanchez Sanchez B, Stramer B, Siekhaus DE. 2018. Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues. G3: Genes, Genomes, Genetics. 8(3), 845–857.","chicago":"György, Attila, Marko Roblek, Aparna Ratheesh, Katarina Valosková, Vera Belyaeva, Stephanie Wachner, Yutaka Matsubayashi, Besaiz Sanchez Sanchez, Brian Stramer, and Daria E Siekhaus. “Tools Allowing Independent Visualization and Genetic Manipulation of Drosophila Melanogaster Macrophages and Surrounding Tissues.” <i>G3: Genes, Genomes, Genetics</i>. Genetics Society of America, 2018. <a href=\"https://doi.org/10.1534/g3.117.300452\">https://doi.org/10.1534/g3.117.300452</a>.","short":"A. György, M. Roblek, A. Ratheesh, K. Valosková, V. Belyaeva, S. Wachner, Y. Matsubayashi, B. Sanchez Sanchez, B. Stramer, D.E. Siekhaus, G3: Genes, Genomes, Genetics 8 (2018) 845–857."},"year":"2018","tmp":{"image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"ddc":["570"],"oa":1,"related_material":{"record":[{"relation":"research_paper","id":"6530"},{"id":"6543","relation":"research_paper"},{"id":"11193","status":"public","relation":"dissertation_contains"},{"relation":"dissertation_contains","status":"public","id":"6546"}]},"_id":"544","publication":"G3: Genes, Genomes, Genetics","title":"Tools allowing independent visualization and genetic manipulation of Drosophila melanogaster macrophages and surrounding tissues","publication_status":"published","abstract":[{"lang":"eng","text":"Drosophila melanogaster plasmatocytes, the phagocytic cells among hemocytes, are essential for immune responses, but also play key roles from early development to death through their interactions with other cell types. They regulate homeostasis and signaling during development, stem cell proliferation, metabolism, cancer, wound responses and aging, displaying intriguing molecular and functional conservation with vertebrate macrophages. Given the relative ease of genetics in Drosophila compared to vertebrates, tools permitting visualization and genetic manipulation of plasmatocytes and surrounding tissues independently at all stages would greatly aid in fully understanding these processes, but are lacking. Here we describe a comprehensive set of transgenic lines that allow this. These include extremely brightly fluorescing mCherry-based lines that allow GAL4-independent visualization of plasmatocyte nuclei, cytoplasm or actin cytoskeleton from embryonic Stage 8 through adulthood in both live and fixed samples even as heterozygotes, greatly facilitating screening. These lines allow live visualization and tracking of embryonic plasmatocytes, as well as larval plasmatocytes residing at the body wall or flowing with the surrounding hemolymph. With confocal imaging, interactions of plasmatocytes and inner tissues can be seen in live or fixed embryos, larvae and adults. They permit efficient GAL4-independent FACS analysis/sorting of plasmatocytes throughout life. To facilitate genetic analysis of reciprocal signaling, we have also made a plasmatocyte-expressing QF2 line that in combination with extant GAL4 drivers allows independent genetic manipulation of both plasmatocytes and surrounding tissues, and a GAL80 line that blocks GAL4 drivers from affecting plasmatocytes, both of which function from the early embryo to the adult."}],"project":[{"grant_number":"P29638","name":"Drosophila TNFa´s Funktion in Immunzellen","call_identifier":"FWF","_id":"253B6E48-B435-11E9-9278-68D0E5697425"},{"call_identifier":"FWF","_id":"253B6E48-B435-11E9-9278-68D0E5697425","grant_number":"P29638","name":"The role of Drosophila TNF alpha in immune cell invasion"},{"name":"Investigating the role of the novel major superfamily facilitator transporter family member MFSD1 in metastasis","grant_number":"LSC16-021 ","_id":"2637E9C0-B435-11E9-9278-68D0E5697425"},{"_id":"2536F660-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","name":"Investigating the role of transporters in invasive migration through junctions","grant_number":"334077"}],"volume":8,"issue":"3","pubrep_id":"990","publisher":"Genetics Society of America","file_date_updated":"2020-07-14T12:46:56Z","publist_id":"7271","isi":1,"intvolume":"         8","status":"public","date_created":"2018-12-11T11:47:05Z","month":"03","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","article_processing_charge":"No","day":"01","date_updated":"2024-03-25T23:30:15Z","type":"journal_article","oa_version":"Published Version","language":[{"iso":"eng"}],"doi":"10.1534/g3.117.300452","department":[{"_id":"DaSi"}],"has_accepted_license":"1","acknowledged_ssus":[{"_id":"LifeSc"}],"ec_funded":1,"acknowledgement":" A. Ratheesh also by Marie Curie IIF GA-2012-32950BB:DICJI, Marko Roblek by the provincial government of Lower Austria, K. Valoskova and S. Wachner by DOC Fellowships from the Austrian Academy of Sciences, ","page":"845 - 857","date_published":"2018-03-01T00:00:00Z","external_id":{"isi":["000426693300011"]},"file":[{"file_size":2251222,"content_type":"application/pdf","creator":"system","date_created":"2018-12-12T10:11:48Z","relation":"main_file","access_level":"open_access","file_name":"IST-2018-990-v1+1_2018_Gyoergy_Tools_allowing.pdf","checksum":"7d9d28b915159078a4ca7add568010e8","date_updated":"2020-07-14T12:46:56Z","file_id":"4905"}],"scopus_import":"1"},{"date_published":"2018-02-01T00:00:00Z","external_id":{"isi":["000427101600018"]},"page":"131 - 138","scopus_import":"1","type":"journal_article","date_updated":"2023-09-13T09:01:56Z","oa_version":"None","day":"01","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","doi":"10.1016/j.conb.2017.12.005","language":[{"iso":"eng"}],"department":[{"_id":"GaNo"}],"publisher":"Elsevier","issue":"2","volume":48,"date_created":"2018-12-11T11:47:06Z","month":"02","status":"public","intvolume":"        48","publist_id":"7268","isi":1,"year":"2018","citation":{"ista":"Sacco R, Cacci E, Novarino G. 2018. Neural stem cells in neuropsychiatric disorders. Current Opinion in Neurobiology. 48(2), 131–138.","short":"R. Sacco, E. Cacci, G. Novarino, Current Opinion in Neurobiology 48 (2018) 131–138.","chicago":"Sacco, Roberto, Emanuele Cacci, and Gaia Novarino. “Neural Stem Cells in Neuropsychiatric Disorders.” <i>Current Opinion in Neurobiology</i>. Elsevier, 2018. <a href=\"https://doi.org/10.1016/j.conb.2017.12.005\">https://doi.org/10.1016/j.conb.2017.12.005</a>.","ieee":"R. Sacco, E. Cacci, and G. Novarino, “Neural stem cells in neuropsychiatric disorders,” <i>Current Opinion in Neurobiology</i>, vol. 48, no. 2. Elsevier, pp. 131–138, 2018.","ama":"Sacco R, Cacci E, Novarino G. Neural stem cells in neuropsychiatric disorders. <i>Current Opinion in Neurobiology</i>. 2018;48(2):131-138. doi:<a href=\"https://doi.org/10.1016/j.conb.2017.12.005\">10.1016/j.conb.2017.12.005</a>","mla":"Sacco, Roberto, et al. “Neural Stem Cells in Neuropsychiatric Disorders.” <i>Current Opinion in Neurobiology</i>, vol. 48, no. 2, Elsevier, 2018, pp. 131–38, doi:<a href=\"https://doi.org/10.1016/j.conb.2017.12.005\">10.1016/j.conb.2017.12.005</a>.","apa":"Sacco, R., Cacci, E., &#38; Novarino, G. (2018). Neural stem cells in neuropsychiatric disorders. <i>Current Opinion in Neurobiology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.conb.2017.12.005\">https://doi.org/10.1016/j.conb.2017.12.005</a>"},"quality_controlled":"1","author":[{"full_name":"Sacco, Roberto","id":"42C9F57E-F248-11E8-B48F-1D18A9856A87","first_name":"Roberto","last_name":"Sacco"},{"full_name":"Cacci, Emanuele","last_name":"Cacci","first_name":"Emanuele"},{"full_name":"Novarino, Gaia","orcid":"0000-0002-7673-7178","id":"3E57A680-F248-11E8-B48F-1D18A9856A87","last_name":"Novarino","first_name":"Gaia"}],"publication_status":"published","abstract":[{"text":"The precise control of neural stem cell (NSC) proliferation and differentiation is crucial for the development and function of the human brain. Here, we review the emerging links between the alteration of embryonic and adult neurogenesis and the etiology of neuropsychiatric disorders (NPDs) such as autism spectrum disorders (ASDs) and schizophrenia (SCZ), as well as the advances in stem cell-based modeling and the novel therapeutic targets derived from these studies.","lang":"eng"}],"title":"Neural stem cells in neuropsychiatric disorders","publication":"Current Opinion in Neurobiology","_id":"546"},{"doi":"10.1016/j.cub.2018.08.063","language":[{"iso":"eng"}],"department":[{"_id":"SyCr"}],"type":"journal_article","date_updated":"2023-09-15T12:06:46Z","oa_version":"Published Version","day":"08","article_processing_charge":"No","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","scopus_import":"1","date_published":"2018-10-08T00:00:00Z","external_id":{"isi":["000446693400008"]},"page":"R1139 - R1140","publication_status":"published","abstract":[{"text":"Many animals use antimicrobials to prevent or cure disease [1,2]. For example, some animals will ingest plants with medicinal properties, both prophylactically to prevent infection and therapeutically to self-medicate when sick. Antimicrobial substances are also used as topical disinfectants, to prevent infection, protect offspring and to sanitise their surroundings [1,2]. Social insects (ants, bees, wasps and termites) build nests in environments with a high abundance and diversity of pathogenic microorganisms — such as soil and rotting wood — and colonies are often densely crowded, creating conditions that favour disease outbreaks. Consequently, social insects have evolved collective disease defences to protect their colonies from epidemics. These traits can be seen as functionally analogous to the immune system of individual organisms [3,4]. This ‘social immunity’ utilises antimicrobials to prevent and eradicate infections, and to keep the brood and nest clean. However, these antimicrobial compounds can be harmful to the insects themselves, and it is unknown how colonies prevent collateral damage when using them. Here, we demonstrate that antimicrobial acids, produced by workers to disinfect the colony, are harmful to the delicate pupal brood stage, but that the pupae are protected from the acids by the presence of a silk cocoon. Garden ants spray their nests with an antimicrobial poison to sanitize contaminated nestmates and brood. Here, Pull et al show that they also prophylactically sanitise their colonies, and that the silk cocoon serves as a barrier to protect developing pupae, thus preventing collateral damage during nest sanitation.","lang":"eng"}],"title":"Protection against the lethal side effects of social immunity in ants","publication":"Current Biology","oa":1,"_id":"55","year":"2018","citation":{"ama":"Pull C, Metzler S, Naderlinger E, Cremer S. Protection against the lethal side effects of social immunity in ants. <i>Current Biology</i>. 2018;28(19):R1139-R1140. doi:<a href=\"https://doi.org/10.1016/j.cub.2018.08.063\">10.1016/j.cub.2018.08.063</a>","ieee":"C. Pull, S. Metzler, E. Naderlinger, and S. Cremer, “Protection against the lethal side effects of social immunity in ants,” <i>Current Biology</i>, vol. 28, no. 19. Cell Press, pp. R1139–R1140, 2018.","ista":"Pull C, Metzler S, Naderlinger E, Cremer S. 2018. Protection against the lethal side effects of social immunity in ants. Current Biology. 28(19), R1139–R1140.","short":"C. Pull, S. Metzler, E. Naderlinger, S. Cremer, Current Biology 28 (2018) R1139–R1140.","chicago":"Pull, Christopher, Sina Metzler, Elisabeth Naderlinger, and Sylvia Cremer. “Protection against the Lethal Side Effects of Social Immunity in Ants.” <i>Current Biology</i>. Cell Press, 2018. <a href=\"https://doi.org/10.1016/j.cub.2018.08.063\">https://doi.org/10.1016/j.cub.2018.08.063</a>.","apa":"Pull, C., Metzler, S., Naderlinger, E., &#38; Cremer, S. (2018). Protection against the lethal side effects of social immunity in ants. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2018.08.063\">https://doi.org/10.1016/j.cub.2018.08.063</a>","mla":"Pull, Christopher, et al. “Protection against the Lethal Side Effects of Social Immunity in Ants.” <i>Current Biology</i>, vol. 28, no. 19, Cell Press, 2018, pp. R1139–40, doi:<a href=\"https://doi.org/10.1016/j.cub.2018.08.063\">10.1016/j.cub.2018.08.063</a>."},"main_file_link":[{"url":"https://doi.org/10.1016/j.cub.2018.08.063","open_access":"1"}],"author":[{"id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-1122-3982","full_name":"Pull, Christopher","first_name":"Christopher","last_name":"Pull"},{"id":"48204546-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9547-2494","full_name":"Metzler, Sina","last_name":"Metzler","first_name":"Sina"},{"last_name":"Naderlinger","first_name":"Elisabeth","full_name":"Naderlinger, Elisabeth","id":"31757262-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia","orcid":"0000-0002-2193-3868"}],"quality_controlled":"1","date_created":"2018-12-11T11:44:23Z","month":"10","status":"public","intvolume":"        28","publist_id":"7999","isi":1,"publisher":"Cell Press","article_type":"original","volume":28,"issue":"19"},{"day":"01","oa_version":"Submitted Version","type":"journal_article","date_updated":"2021-01-12T08:02:35Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","department":[{"_id":"RoSe"}],"language":[{"iso":"eng"}],"doi":"10.1007/s00220-017-3064-x","page":"347-403","external_id":{"arxiv":["1511.05953"]},"date_published":"2018-05-01T00:00:00Z","arxiv":1,"scopus_import":1,"publication_identifier":{"issn":["00103616"]},"year":"2018","quality_controlled":"1","author":[{"last_name":"Napiórkowski","first_name":"Marcin M","full_name":"Napiórkowski, Marcin M","id":"4197AD04-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Reuvers, Robin","last_name":"Reuvers","first_name":"Robin"},{"full_name":"Solovej, Jan","first_name":"Jan","last_name":"Solovej"}],"citation":{"ama":"Napiórkowski MM, Reuvers R, Solovej J. The Bogoliubov free energy functional II: The dilute Limit. <i>Communications in Mathematical Physics</i>. 2018;360(1):347-403. doi:<a href=\"https://doi.org/10.1007/s00220-017-3064-x\">10.1007/s00220-017-3064-x</a>","ieee":"M. M. Napiórkowski, R. Reuvers, and J. Solovej, “The Bogoliubov free energy functional II: The dilute Limit,” <i>Communications in Mathematical Physics</i>, vol. 360, no. 1. Springer, pp. 347–403, 2018.","chicago":"Napiórkowski, Marcin M, Robin Reuvers, and Jan Solovej. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” <i>Communications in Mathematical Physics</i>. Springer, 2018. <a href=\"https://doi.org/10.1007/s00220-017-3064-x\">https://doi.org/10.1007/s00220-017-3064-x</a>.","short":"M.M. Napiórkowski, R. Reuvers, J. Solovej, Communications in Mathematical Physics 360 (2018) 347–403.","ista":"Napiórkowski MM, Reuvers R, Solovej J. 2018. The Bogoliubov free energy functional II: The dilute Limit. Communications in Mathematical Physics. 360(1), 347–403.","mla":"Napiórkowski, Marcin M., et al. “The Bogoliubov Free Energy Functional II: The Dilute Limit.” <i>Communications in Mathematical Physics</i>, vol. 360, no. 1, Springer, 2018, pp. 347–403, doi:<a href=\"https://doi.org/10.1007/s00220-017-3064-x\">10.1007/s00220-017-3064-x</a>.","apa":"Napiórkowski, M. M., Reuvers, R., &#38; Solovej, J. (2018). The Bogoliubov free energy functional II: The dilute Limit. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-017-3064-x\">https://doi.org/10.1007/s00220-017-3064-x</a>"},"main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1511.05953"}],"abstract":[{"text":"We analyse the canonical Bogoliubov free energy functional in three dimensions at low temperatures in the dilute limit. We prove existence of a first-order phase transition and, in the limit (Formula presented.), we determine the critical temperature to be (Formula presented.) to leading order. Here, (Formula presented.) is the critical temperature of the free Bose gas, ρ is the density of the gas and a is the scattering length of the pair-interaction potential V. We also prove asymptotic expansions for the free energy. In particular, we recover the Lee–Huang–Yang formula in the limit (Formula presented.).","lang":"eng"}],"publication_status":"published","project":[{"grant_number":"P27533_N27","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","_id":"25C878CE-B435-11E9-9278-68D0E5697425","call_identifier":"FWF"}],"_id":"554","oa":1,"publication":"Communications in Mathematical Physics","title":"The Bogoliubov free energy functional II: The dilute Limit","publisher":"Springer","volume":360,"issue":"1","status":"public","month":"05","date_created":"2018-12-11T11:47:09Z","publist_id":"7260","intvolume":"       360"}]