[{"project":[{"name":"Discrete Optimization in Computer Vision: Theory and Practice","_id":"25FBA906-B435-11E9-9278-68D0E5697425","call_identifier":"FP7","grant_number":"616160"}],"language":[{"iso":"eng"}],"isi":1,"conference":{"end_date":"2019-06-20","location":"Long Beach, CA, United States","name":"CVPR: Conference on Computer Vision and Pattern Recognition","start_date":"2019-06-15"},"publication_identifier":{"isbn":["9781728132938"],"issn":["10636919"]},"quality_controlled":"1","doi":"10.1109/CVPR.2019.01140","department":[{"_id":"VlKo"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","article_processing_charge":"No","scopus_import":"1","ec_funded":1,"publication":"Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition","day":"01","author":[{"full_name":"Swoboda, Paul","id":"446560C6-F248-11E8-B48F-1D18A9856A87","last_name":"Swoboda","first_name":"Paul"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","last_name":"Kolmogorov"}],"arxiv":1,"title":"Map inference via block-coordinate Frank-Wolfe algorithm","article_number":"11138-11147","status":"public","external_id":{"isi":["000542649304076"],"arxiv":["1806.05049"]},"citation":{"ama":"Swoboda P, Kolmogorov V. Map inference via block-coordinate Frank-Wolfe algorithm. In: <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>. Vol 2019-June. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>","mla":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, vol. 2019–June, 11138–11147, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/CVPR.2019.01140\">10.1109/CVPR.2019.01140</a>.","ista":"Swoboda P, Kolmogorov V. 2019. Map inference via block-coordinate Frank-Wolfe algorithm. Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition. CVPR: Conference on Computer Vision and Pattern Recognition vol. 2019–June, 11138–11147.","apa":"Swoboda, P., &#38; Kolmogorov, V. (2019). Map inference via block-coordinate Frank-Wolfe algorithm. In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i> (Vol. 2019–June). Long Beach, CA, United States: IEEE. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>","ieee":"P. Swoboda and V. Kolmogorov, “Map inference via block-coordinate Frank-Wolfe algorithm,” in <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Long Beach, CA, United States, 2019, vol. 2019–June.","chicago":"Swoboda, Paul, and Vladimir Kolmogorov. “Map Inference via Block-Coordinate Frank-Wolfe Algorithm.” In <i>Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition</i>, Vol. 2019–June. IEEE, 2019. <a href=\"https://doi.org/10.1109/CVPR.2019.01140\">https://doi.org/10.1109/CVPR.2019.01140</a>.","short":"P. Swoboda, V. Kolmogorov, in:, Proceedings of the IEEE Computer Society Conference on Computer Vision and Pattern Recognition, IEEE, 2019."},"oa":1,"publication_status":"published","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1806.05049"}],"date_published":"2019-06-01T00:00:00Z","year":"2019","_id":"7468","abstract":[{"text":"We present a new proximal bundle method for Maximum-A-Posteriori (MAP) inference in structured energy minimization problems. The method optimizes a Lagrangean relaxation of the original energy minimization problem using a multi plane block-coordinate Frank-Wolfe method that takes advantage of the specific structure of the Lagrangean decomposition. We show empirically that our method outperforms state-of-the-art Lagrangean decomposition based algorithms on some challenging Markov Random Field, multi-label discrete tomography and graph matching problems.","lang":"eng"}],"date_updated":"2023-09-07T14:54:24Z","oa_version":"Preprint","month":"06","type":"conference","date_created":"2020-02-09T23:00:52Z","volume":"2019-June"},{"external_id":{"isi":["000531438101047"]},"status":"public","related_material":{"record":[{"status":"public","id":"9418","relation":"dissertation_contains"}]},"citation":{"short":"M. Phuong, C. Lampert, in:, IEEE International Conference on Computer Vision, IEEE, 2019, pp. 1355–1364.","ieee":"M. Phuong and C. Lampert, “Distillation-based training for multi-exit architectures,” in <i>IEEE International Conference on Computer Vision</i>, Seoul, Korea, 2019, vol. 2019–October, pp. 1355–1364.","chicago":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” In <i>IEEE International Conference on Computer Vision</i>, 2019–October:1355–64. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>.","mla":"Phuong, Mary, and Christoph Lampert. “Distillation-Based Training for Multi-Exit Architectures.” <i>IEEE International Conference on Computer Vision</i>, vol. 2019–October, IEEE, 2019, pp. 1355–64, doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>.","ista":"Phuong M, Lampert C. 2019. Distillation-based training for multi-exit architectures. IEEE International Conference on Computer Vision. ICCV: International Conference on Computer Vision vol. 2019–October, 1355–1364.","apa":"Phuong, M., &#38; Lampert, C. (2019). Distillation-based training for multi-exit architectures. In <i>IEEE International Conference on Computer Vision</i> (Vol. 2019–October, pp. 1355–1364). Seoul, Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2019.00144\">https://doi.org/10.1109/ICCV.2019.00144</a>","ama":"Phuong M, Lampert C. Distillation-based training for multi-exit architectures. In: <i>IEEE International Conference on Computer Vision</i>. Vol 2019-October. IEEE; 2019:1355-1364. doi:<a href=\"https://doi.org/10.1109/ICCV.2019.00144\">10.1109/ICCV.2019.00144</a>"},"oa":1,"publication_status":"published","has_accepted_license":"1","ddc":["000"],"date_published":"2019-10-01T00:00:00Z","year":"2019","_id":"7479","page":"1355-1364","oa_version":"Submitted Version","month":"10","type":"conference","date_updated":"2023-09-08T11:11:12Z","abstract":[{"lang":"eng","text":"Multi-exit architectures, in which a stack of processing layers is interleaved with early output layers, allow the processing of a test example to stop early and thus save computation time and/or energy.  In this work, we propose a new training procedure for multi-exit architectures based on the principle of knowledge distillation. The method encourage searly exits to mimic later, more accurate exits, by matching their output probabilities.\r\nExperiments  on  CIFAR100  and  ImageNet  show  that distillation-based training significantly improves the accuracy of early exits while maintaining state-of-the-art accuracy  for  late  ones.   The  method  is  particularly  beneficial when  training  data  is  limited  and  it  allows  a  straightforward extension to semi-supervised learning,i.e. making use of unlabeled data at training time. Moreover, it takes only afew lines to implement and incurs almost no computational overhead at training time, and none at all at test time."}],"volume":"2019-October","file_date_updated":"2020-07-14T12:47:59Z","date_created":"2020-02-11T09:06:57Z","project":[{"grant_number":"308036","call_identifier":"FP7","_id":"2532554C-B435-11E9-9278-68D0E5697425","name":"Lifelong Learning of Visual Scene Understanding"}],"conference":{"end_date":"2019-11-02","start_date":"2019-10-27","location":"Seoul, Korea","name":"ICCV: International Conference on Computer Vision"},"isi":1,"language":[{"iso":"eng"}],"publication_identifier":{"isbn":["9781728148038"],"issn":["15505499"]},"doi":"10.1109/ICCV.2019.00144","quality_controlled":"1","publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"ChLa"}],"publication":"IEEE International Conference on Computer Vision","scopus_import":"1","article_processing_charge":"No","ec_funded":1,"author":[{"id":"3EC6EE64-F248-11E8-B48F-1D18A9856A87","full_name":"Bui Thi Mai, Phuong","last_name":"Bui Thi Mai","first_name":"Phuong"},{"orcid":"0000-0001-8622-7887","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","full_name":"Lampert, Christoph","last_name":"Lampert","first_name":"Christoph"}],"file":[{"file_name":"main.pdf","content_type":"application/pdf","relation":"main_file","file_size":735768,"creator":"bphuong","date_updated":"2020-07-14T12:47:59Z","file_id":"7480","checksum":"7b77fb5c2d27c4c37a7612ba46a66117","date_created":"2020-02-11T09:06:39Z","access_level":"open_access"}],"day":"01","title":"Distillation-based training for multi-exit architectures"},{"title":"Social immunity","date_created":"2020-02-23T23:00:36Z","author":[{"last_name":"Cremer","first_name":"Sylvia","orcid":"0000-0002-2193-3868","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","full_name":"Cremer, Sylvia"},{"first_name":"Megan","last_name":"Kutzer","full_name":"Kutzer, Megan","id":"29D0B332-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8696-6978"}],"page":"747-755","abstract":[{"lang":"eng","text":"Social insects (i.e., ants, termites and the social bees and wasps) protect their colonies from disease using a combination of individual immunity and collectively performed defenses, termed social immunity. The first line of social immune defense is sanitary care, which is performed by colony members to protect their pathogen-exposed nestmates from developing an infection. If sanitary care fails and an infection becomes established, a second line of social immune defense is deployed to stop disease transmission within the colony and to protect the valuable queens, which together with the males are the reproductive individuals of the colony. Insect colonies are separated into these reproductive individuals and the sterile worker force, forming a superorganismal reproductive unit reminiscent of the differentiated germline and soma in a multicellular organism. Ultimately, the social immune response preserves the germline of the superorganism insect colony and increases overall fitness of the colony in case of disease. "}],"date_updated":"2023-09-08T11:12:04Z","day":"06","month":"02","type":"book_chapter","oa_version":"None","publication":"Encyclopedia of Animal Behavior","_id":"7513","article_processing_charge":"No","scopus_import":"1","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Elsevier","year":"2019","department":[{"_id":"SyCr"}],"doi":"10.1016/B978-0-12-809633-8.90721-0","date_published":"2019-02-06T00:00:00Z","quality_controlled":"1","publication_status":"published","publication_identifier":{"eisbn":["9780128132524"],"isbn":["9780128132517"]},"isi":1,"citation":{"short":"S. Cremer, M. Kutzer, in:, J. Choe (Ed.), Encyclopedia of Animal Behavior, 2nd ed., Elsevier, 2019, pp. 747–755.","ieee":"S. Cremer and M. Kutzer, “Social immunity,” in <i>Encyclopedia of Animal Behavior</i>, 2nd ed., J. Choe, Ed. Elsevier, 2019, pp. 747–755.","chicago":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” In <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., 747–55. Elsevier, 2019. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>.","ista":"Cremer S, Kutzer M. 2019.Social immunity. In: Encyclopedia of Animal Behavior. , 747–755.","mla":"Cremer, Sylvia, and Megan Kutzer. “Social Immunity.” <i>Encyclopedia of Animal Behavior</i>, edited by Jae Choe, 2nd ed., Elsevier, 2019, pp. 747–55, doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>.","apa":"Cremer, S., &#38; Kutzer, M. (2019). Social immunity. In J. Choe (Ed.), <i>Encyclopedia of Animal Behavior</i> (2nd ed., pp. 747–755). Elsevier. <a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">https://doi.org/10.1016/B978-0-12-809633-8.90721-0</a>","ama":"Cremer S, Kutzer M. Social immunity. In: Choe J, ed. <i>Encyclopedia of Animal Behavior</i>. 2nd ed. Elsevier; 2019:747-755. doi:<a href=\"https://doi.org/10.1016/B978-0-12-809633-8.90721-0\">10.1016/B978-0-12-809633-8.90721-0</a>"},"language":[{"iso":"eng"}],"edition":"2","editor":[{"full_name":"Choe, Jae","first_name":"Jae","last_name":"Choe"}],"external_id":{"isi":["000248989500026"]},"status":"public"},{"article_processing_charge":"No","scopus_import":1,"ec_funded":1,"publication":"arXiv:1910.03372","_id":"7524","year":"2019","department":[{"_id":"RoSe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ArXiv","date_created":"2020-02-26T08:46:40Z","title":"The free energy of the two-dimensional dilute Bose gas. I. Lower bound","day":"08","abstract":[{"text":"We prove a lower bound for the free energy (per unit volume) of the two-dimensional Bose gas in the thermodynamic limit. We show that the free energy at density $\\rho$ and inverse temperature $\\beta$ differs from the one of the non-interacting system by the correction term $4 \\pi \\rho^2 |\\ln a^2 \\rho|^{-1} (2 - [1 - \\beta_{\\mathrm{c}}/\\beta]_+^2)$. Here $a$ is the scattering length of the interaction potential, $[\\cdot]_+ = \\max\\{ 0, \\cdot \\}$ and $\\beta_{\\mathrm{c}}$ is the inverse Berezinskii--Kosterlitz--Thouless critical temperature for superfluidity. The result is valid in the dilute limit\r\n$a^2\\rho \\ll 1$ and if $\\beta \\rho \\gtrsim 1$.","lang":"eng"}],"date_updated":"2023-09-07T13:12:41Z","oa_version":"Preprint","type":"preprint","month":"10","page":"61","author":[{"first_name":"Andreas","last_name":"Deuchert","full_name":"Deuchert, Andreas","id":"4DA65CD0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3146-6746"},{"last_name":"Mayer","first_name":"Simon","id":"30C4630A-F248-11E8-B48F-1D18A9856A87","full_name":"Mayer, Simon"},{"last_name":"Seiringer","first_name":"Robert","full_name":"Seiringer, Robert","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521"}],"citation":{"ama":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:191003372</i>.","ista":"Deuchert A, Mayer S, Seiringer R. The free energy of the two-dimensional dilute Bose gas. I. Lower bound. arXiv:1910.03372, .","mla":"Deuchert, Andreas, et al. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>, ArXiv.","apa":"Deuchert, A., Mayer, S., &#38; Seiringer, R. (n.d.). The free energy of the two-dimensional dilute Bose gas. I. Lower bound. <i>arXiv:1910.03372</i>. ArXiv.","ieee":"A. Deuchert, S. Mayer, and R. Seiringer, “The free energy of the two-dimensional dilute Bose gas. I. Lower bound,” <i>arXiv:1910.03372</i>. ArXiv.","chicago":"Deuchert, Andreas, Simon Mayer, and Robert Seiringer. “The Free Energy of the Two-Dimensional Dilute Bose Gas. I. Lower Bound.” <i>ArXiv:1910.03372</i>. ArXiv, n.d.","short":"A. Deuchert, S. Mayer, R. Seiringer, ArXiv:1910.03372 (n.d.)."},"language":[{"iso":"eng"}],"related_material":{"record":[{"id":"7790","status":"public","relation":"later_version"},{"status":"public","id":"7514","relation":"dissertation_contains"}]},"status":"public","project":[{"grant_number":"694227","call_identifier":"H2020","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","name":"Analysis of quantum many-body systems"}],"main_file_link":[{"url":"https://arxiv.org/abs/1910.03372","open_access":"1"}],"date_published":"2019-10-08T00:00:00Z","publication_status":"draft","oa":1},{"page":"927-938","type":"conference","oa_version":"Published Version","month":"12","abstract":[{"text":"We present a novel class of convolutional neural networks (CNNs) for set functions,i.e., data indexed with the powerset of a finite set. The convolutions are derivedas linear, shift-equivariant functions for various notions of shifts on set functions.The framework is fundamentally different from graph convolutions based on theLaplacian, as it provides not one but several basic shifts, one for each element inthe ground set. Prototypical experiments with several set function classificationtasks on synthetic datasets and on datasets derived from real-world hypergraphsdemonstrate the potential of our new powerset CNNs.","lang":"eng"}],"date_updated":"2023-09-08T11:13:52Z","volume":32,"date_created":"2020-02-28T10:03:24Z","year":"2019","_id":"7542","publication_status":"published","oa":1,"date_published":"2019-12-01T00:00:00Z","main_file_link":[{"url":"http://papers.nips.cc/paper/8379-powerset-convolutional-neural-networks","open_access":"1"}],"status":"public","external_id":{"isi":["000534424300084"],"arxiv":["1909.02253"]},"intvolume":"        32","citation":{"apa":"Wendler, C., Alistarh, D.-A., &#38; Püschel, M. (2019). Powerset convolutional neural networks (Vol. 32, pp. 927–938). Presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada: Neural Information Processing Systems Foundation.","ista":"Wendler C, Alistarh D-A, Püschel M. 2019. Powerset convolutional neural networks. NIPS: Conference on Neural Information Processing Systems vol. 32, 927–938.","mla":"Wendler, Chris, et al. <i>Powerset Convolutional Neural Networks</i>. Vol. 32, Neural Information Processing Systems Foundation, 2019, pp. 927–38.","ama":"Wendler C, Alistarh D-A, Püschel M. Powerset convolutional neural networks. In: Vol 32. Neural Information Processing Systems Foundation; 2019:927-938.","short":"C. Wendler, D.-A. Alistarh, M. Püschel, in:, Neural Information Processing Systems Foundation, 2019, pp. 927–938.","chicago":"Wendler, Chris, Dan-Adrian Alistarh, and Markus Püschel. “Powerset Convolutional Neural Networks,” 32:927–38. Neural Information Processing Systems Foundation, 2019.","ieee":"C. Wendler, D.-A. Alistarh, and M. Püschel, “Powerset convolutional neural networks,” presented at the NIPS: Conference on Neural Information Processing Systems, Vancouver, Canada, 2019, vol. 32, pp. 927–938."},"author":[{"last_name":"Wendler","first_name":"Chris","full_name":"Wendler, Chris"},{"full_name":"Alistarh, Dan-Adrian","id":"4A899BFC-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-3650-940X","last_name":"Alistarh","first_name":"Dan-Adrian"},{"first_name":"Markus","last_name":"Püschel","full_name":"Püschel, Markus"}],"day":"01","title":"Powerset convolutional neural networks","arxiv":1,"publisher":"Neural Information Processing Systems Foundation","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","department":[{"_id":"DaAl"}],"ec_funded":1,"article_processing_charge":"No","publication_identifier":{"issn":["1049-5258"]},"quality_controlled":"1","project":[{"grant_number":"805223","call_identifier":"H2020","_id":"268A44D6-B435-11E9-9278-68D0E5697425","name":"Elastic Coordination for Scalable Machine Learning"}],"conference":{"end_date":"2019-12-14","start_date":"2019-12-08","location":"Vancouver, Canada","name":"NIPS: Conference on Neural Information Processing Systems"},"isi":1,"language":[{"iso":"eng"}]},{"oa_version":"Preprint","month":"10","type":"journal_article","date_updated":"2022-06-17T07:52:41Z","abstract":[{"text":"We consider an optimal control problem for an abstract nonlinear dissipative evolution equation. The differential constraint is penalized by augmenting the target functional by a nonnegative global-in-time functional which is null-minimized in the evolution equation is satisfied. Different variational settings are presented, leading to the convergence of the penalization method for gradient flows, noncyclic and semimonotone flows, doubly nonlinear evolutions, and GENERIC systems. ","lang":"eng"}],"page":"425-447","date_created":"2020-02-28T10:54:41Z","volume":28,"year":"2019","acknowledgement":"This work is supported by Vienna Science and Technology Fund (WWTF) through Project MA14-009 and by the Austrian Science Fund (FWF) projects F 65 and I 2375.","_id":"7550","oa":1,"publication_status":"published","main_file_link":[{"url":" https://doi.org/10.48550/arXiv.1910.10050","open_access":"1"}],"date_published":"2019-10-22T00:00:00Z","external_id":{"arxiv":["1910.10050"]},"status":"public","citation":{"ama":"Portinale L, Stefanelli U. Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. 2019;28(2):425-447.","mla":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2, Gakko Tosho, 2019, pp. 425–47.","ista":"Portinale L, Stefanelli U. 2019. Penalization via global functionals of optimal-control problems for dissipative evolution. Advances in Mathematical Sciences and Applications. 28(2), 425–447.","apa":"Portinale, L., &#38; Stefanelli, U. (2019). Penalization via global functionals of optimal-control problems for dissipative evolution. <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho.","ieee":"L. Portinale and U. Stefanelli, “Penalization via global functionals of optimal-control problems for dissipative evolution,” <i>Advances in Mathematical Sciences and Applications</i>, vol. 28, no. 2. Gakko Tosho, pp. 425–447, 2019.","chicago":"Portinale, Lorenzo, and Ulisse Stefanelli. “Penalization via Global Functionals of Optimal-Control Problems for Dissipative Evolution.” <i>Advances in Mathematical Sciences and Applications</i>. Gakko Tosho, 2019.","short":"L. Portinale, U. Stefanelli, Advances in Mathematical Sciences and Applications 28 (2019) 425–447."},"intvolume":"        28","day":"22","author":[{"full_name":"Portinale, Lorenzo","id":"30AD2CBC-F248-11E8-B48F-1D18A9856A87","last_name":"Portinale","first_name":"Lorenzo"},{"last_name":"Stefanelli","first_name":"Ulisse","full_name":"Stefanelli, Ulisse"}],"title":"Penalization via global functionals of optimal-control problems for dissipative evolution","arxiv":1,"department":[{"_id":"JaMa"}],"publisher":"Gakko Tosho","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","article_processing_charge":"No","publication":"Advances in Mathematical Sciences and Applications","publication_identifier":{"issn":["1343-4373"]},"quality_controlled":"1","project":[{"grant_number":"F6504","name":"Taming Complexity in Partial Differential Systems","_id":"fc31cba2-9c52-11eb-aca3-ff467d239cd2"}],"issue":"2","language":[{"iso":"eng"}]},{"language":[{"iso":"eng"}],"citation":{"ista":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. arXiv:1912.08579, .","mla":"Bialek, William, et al. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>, ArXiv.","apa":"Bialek, W., Gregor, T., &#38; Tkačik, G. (n.d.). Action at a distance in transcriptional regulation. <i>arXiv:1912.08579</i>. ArXiv.","ama":"Bialek W, Gregor T, Tkačik G. Action at a distance in transcriptional regulation. <i>arXiv:191208579</i>.","short":"W. Bialek, T. Gregor, G. Tkačik, ArXiv:1912.08579 (n.d.).","ieee":"W. Bialek, T. Gregor, and G. Tkačik, “Action at a distance in transcriptional regulation,” <i>arXiv:1912.08579</i>. ArXiv.","chicago":"Bialek, William, Thomas Gregor, and Gašper Tkačik. “Action at a Distance in Transcriptional Regulation.” <i>ArXiv:1912.08579</i>. ArXiv, n.d."},"project":[{"grant_number":"P28844-B27","call_identifier":"FWF","_id":"254E9036-B435-11E9-9278-68D0E5697425","name":"Biophysics of information processing in gene regulation"}],"external_id":{"arxiv":["1912.08579"]},"status":"public","date_published":"2019-12-18T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1912.08579"}],"publication_status":"submitted","oa":1,"publication":"arXiv:1912.08579","_id":"7552","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"ArXiv","department":[{"_id":"GaTk"}],"year":"2019","title":"Action at a distance in transcriptional regulation","arxiv":1,"date_created":"2020-02-28T10:57:08Z","page":"5","author":[{"first_name":"William","last_name":"Bialek","full_name":"Bialek, William"},{"last_name":"Gregor","first_name":"Thomas","full_name":"Gregor, Thomas"},{"id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkačik, Gašper","first_name":"Gašper","last_name":"Tkačik"}],"abstract":[{"lang":"eng","text":"There is increasing evidence that protein binding to specific sites along DNA can activate the reading out of genetic information without coming into direct physical contact with the gene. There also is evidence that these distant but interacting sites are embedded in a liquid droplet of proteins which condenses out of the surrounding solution. We argue that droplet-mediated interactions can account for crucial features of gene regulation only if the droplet is poised at a non-generic point in its phase diagram. We explore a minimal model that embodies this idea, show that this model has a natural mechanism for self-tuning, and suggest direct experimental tests. "}],"day":"18","date_updated":"2021-01-12T08:14:09Z","type":"preprint","oa_version":"Preprint","month":"12"},{"title":"ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics","day":"25","file":[{"date_created":"2020-03-24T07:36:36Z","access_level":"open_access","file_id":"7617","date_updated":"2020-07-14T12:48:00Z","checksum":"9138977a06fcd6a95976eb4bca875f0c","file_size":1934830,"content_type":"application/pdf","relation":"main_file","creator":"dernst","file_name":"2019_ARCH19_Immler.pdf"}],"author":[{"full_name":"Immler, Fabian","last_name":"Immler","first_name":"Fabian"},{"full_name":"Althoff, Matthias","first_name":"Matthias","last_name":"Althoff"},{"full_name":"Benet, Luis","last_name":"Benet","first_name":"Luis"},{"full_name":"Chapoutot, Alexandre","first_name":"Alexandre","last_name":"Chapoutot"},{"last_name":"Chen","first_name":"Xin","full_name":"Chen, Xin"},{"full_name":"Forets, Marcelo","last_name":"Forets","first_name":"Marcelo"},{"full_name":"Geretti, Luca","last_name":"Geretti","first_name":"Luca"},{"full_name":"Kochdumper, Niklas","last_name":"Kochdumper","first_name":"Niklas"},{"last_name":"Sanders","first_name":"David P.","full_name":"Sanders, David P."},{"last_name":"Schilling","first_name":"Christian","full_name":"Schilling, Christian","orcid":"0000-0003-3658-1065","id":"3A2F4DCE-F248-11E8-B48F-1D18A9856A87"}],"article_processing_charge":"No","scopus_import":1,"publication":"EPiC Series in Computing","department":[{"_id":"ToHe"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publisher":"EasyChair Publications","quality_controlled":"1","doi":"10.29007/m75b","publication_identifier":{"eissn":["23987340"]},"language":[{"iso":"eng"}],"conference":{"end_date":"2019-04-15","start_date":"2019-04-15","name":"ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems","location":"Montreal, Canada"},"file_date_updated":"2020-07-14T12:48:00Z","date_created":"2020-03-08T23:00:49Z","volume":61,"date_updated":"2021-01-12T08:14:17Z","abstract":[{"lang":"eng","text":"We present the results of a friendly competition for formal verification of continuous and hybrid systems with nonlinear continuous dynamics. The friendly competition took place as part of the workshop Applied Verification for Continuous and Hybrid Systems (ARCH) in 2019. In this year, 6 tools Ariadne, CORA, DynIbex, Flow*, Isabelle/HOL, and JuliaReach (in alphabetic order) participated. They are applied to solve reachability analysis problems on four benchmark problems, one of them with hybrid dynamics. We do not rank the tools based on the results, but show the current status and discover the potential advantages of different tools."}],"type":"conference","month":"05","oa_version":"Published Version","page":"41-61","_id":"7576","year":"2019","ddc":["000"],"date_published":"2019-05-25T00:00:00Z","has_accepted_license":"1","oa":1,"publication_status":"published","citation":{"mla":"Immler, Fabian, et al. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” <i>EPiC Series in Computing</i>, vol. 61, EasyChair Publications, 2019, pp. 41–61, doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>.","ista":"Immler F, Althoff M, Benet L, Chapoutot A, Chen X, Forets M, Geretti L, Kochdumper N, Sanders DP, Schilling C. 2019. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. EPiC Series in Computing. ARCH: International Workshop on Applied Verification on Continuous and Hybrid Systems vol. 61, 41–61.","apa":"Immler, F., Althoff, M., Benet, L., Chapoutot, A., Chen, X., Forets, M., … Schilling, C. (2019). ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In <i>EPiC Series in Computing</i> (Vol. 61, pp. 41–61). Montreal, Canada: EasyChair Publications. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>","ama":"Immler F, Althoff M, Benet L, et al. ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics. In: <i>EPiC Series in Computing</i>. Vol 61. EasyChair Publications; 2019:41-61. doi:<a href=\"https://doi.org/10.29007/m75b\">10.29007/m75b</a>","short":"F. Immler, M. Althoff, L. Benet, A. Chapoutot, X. Chen, M. Forets, L. Geretti, N. Kochdumper, D.P. Sanders, C. Schilling, in:, EPiC Series in Computing, EasyChair Publications, 2019, pp. 41–61.","ieee":"F. Immler <i>et al.</i>, “ARCH-COMP19 Category Report: Continuous and hybrid systems with nonlinear dynamics,” in <i>EPiC Series in Computing</i>, Montreal, Canada, 2019, vol. 61, pp. 41–61.","chicago":"Immler, Fabian, Matthias Althoff, Luis Benet, Alexandre Chapoutot, Xin Chen, Marcelo Forets, Luca Geretti, Niklas Kochdumper, David P. Sanders, and Christian Schilling. “ARCH-COMP19 Category Report: Continuous and Hybrid Systems with Nonlinear Dynamics.” In <i>EPiC Series in Computing</i>, 61:41–61. EasyChair Publications, 2019. <a href=\"https://doi.org/10.29007/m75b\">https://doi.org/10.29007/m75b</a>."},"intvolume":"        61","status":"public"},{"quality_controlled":"1","doi":"10.1109/ITW44776.2019.8989292","publication_identifier":{"isbn":["9781538669006"]},"language":[{"iso":"eng"}],"isi":1,"conference":{"end_date":"2019-08-28","start_date":"2019-08-25","location":"Visby, Sweden","name":"Information Theory Workshop"},"project":[{"_id":"2564DBCA-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"International IST Doctoral Program","grant_number":"665385"}],"title":"A tight upper bound on mutual information","arxiv":1,"article_number":"8989292","day":"01","author":[{"first_name":"Michal","last_name":"Hledik","full_name":"Hledik, Michal","id":"4171253A-F248-11E8-B48F-1D18A9856A87"},{"orcid":"0000-0002-1287-3779","id":"3E999752-F248-11E8-B48F-1D18A9856A87","full_name":"Sokolowski, Thomas R","first_name":"Thomas R","last_name":"Sokolowski"},{"orcid":"0000-0002-6699-1455","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","full_name":"Tkačik, Gašper","last_name":"Tkačik","first_name":"Gašper"}],"scopus_import":"1","ec_funded":1,"article_processing_charge":"No","publication":"IEEE Information Theory Workshop, ITW 2019","department":[{"_id":"GaTk"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"IEEE","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1812.01475"}],"date_published":"2019-08-01T00:00:00Z","oa":1,"publication_status":"published","citation":{"short":"M. Hledik, T.R. Sokolowski, G. Tkačik, in:, IEEE Information Theory Workshop, ITW 2019, IEEE, 2019.","chicago":"Hledik, Michal, Thomas R Sokolowski, and Gašper Tkačik. “A Tight Upper Bound on Mutual Information.” In <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>.","ieee":"M. Hledik, T. R. Sokolowski, and G. Tkačik, “A tight upper bound on mutual information,” in <i>IEEE Information Theory Workshop, ITW 2019</i>, Visby, Sweden, 2019.","apa":"Hledik, M., Sokolowski, T. R., &#38; Tkačik, G. (2019). A tight upper bound on mutual information. In <i>IEEE Information Theory Workshop, ITW 2019</i>. Visby, Sweden: IEEE. <a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">https://doi.org/10.1109/ITW44776.2019.8989292</a>","mla":"Hledik, Michal, et al. “A Tight Upper Bound on Mutual Information.” <i>IEEE Information Theory Workshop, ITW 2019</i>, 8989292, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>.","ista":"Hledik M, Sokolowski TR, Tkačik G. 2019. A tight upper bound on mutual information. IEEE Information Theory Workshop, ITW 2019. Information Theory Workshop, 8989292.","ama":"Hledik M, Sokolowski TR, Tkačik G. A tight upper bound on mutual information. In: <i>IEEE Information Theory Workshop, ITW 2019</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ITW44776.2019.8989292\">10.1109/ITW44776.2019.8989292</a>"},"related_material":{"record":[{"status":"public","id":"15020","relation":"dissertation_contains"}]},"status":"public","external_id":{"isi":["000540384500015"],"arxiv":["1812.01475"]},"date_created":"2020-03-22T23:00:47Z","date_updated":"2025-06-30T13:21:05Z","abstract":[{"lang":"eng","text":"We derive a tight lower bound on equivocation (conditional entropy), or equivalently a tight upper bound on mutual information between a signal variable and channel outputs. The bound is in terms of the joint distribution of the signals and maximum a posteriori decodes (most probable signals given channel output). As part of our derivation, we describe the key properties of the distribution of signals, channel outputs and decodes, that minimizes equivocation and maximizes mutual information. This work addresses a problem in data analysis, where mutual information between signals and decodes is sometimes used to lower bound the mutual information between signals and channel outputs. Our result provides a corresponding upper bound."}],"month":"08","oa_version":"Preprint","type":"conference","_id":"7606","year":"2019"},{"external_id":{"isi":["000554591600090"]},"status":"public","isi":1,"conference":{"location":"Seoul, South Korea","name":"ICCVW: International Conference on Computer Vision Workshop","start_date":"2019-10-27","end_date":"2019-10-28"},"citation":{"mla":"Rannen-Triki, Amal, et al. “Function Norms for Neural Networks.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 748–752, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>.","ista":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. 2019. Function norms for neural networks. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 748–752.","apa":"Rannen-Triki, A., Berman, M., Kolmogorov, V., &#38; Blaschko, M. B. (2019). Function norms for neural networks. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>","ama":"Rannen-Triki A, Berman M, Kolmogorov V, Blaschko MB. Function norms for neural networks. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">10.1109/ICCVW.2019.00097</a>","short":"A. Rannen-Triki, M. Berman, V. Kolmogorov, M.B. Blaschko, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","ieee":"A. Rannen-Triki, M. Berman, V. Kolmogorov, and M. B. Blaschko, “Function norms for neural networks,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","chicago":"Rannen-Triki, Amal, Maxim Berman, Vladimir Kolmogorov, and Matthew B. Blaschko. “Function Norms for Neural Networks.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00097\">https://doi.org/10.1109/ICCVW.2019.00097</a>."},"language":[{"iso":"eng"}],"publication_status":"published","publication_identifier":{"isbn":["9781728150239"]},"date_published":"2019-10-01T00:00:00Z","doi":"10.1109/ICCVW.2019.00097","quality_controlled":"1","publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","year":"2019","department":[{"_id":"VlKo"}],"publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","_id":"7639","scopus_import":"1","article_processing_charge":"No","author":[{"full_name":"Rannen-Triki, Amal","last_name":"Rannen-Triki","first_name":"Amal"},{"first_name":"Maxim","last_name":"Berman","full_name":"Berman, Maxim"},{"full_name":"Kolmogorov, Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov"},{"last_name":"Blaschko","first_name":"Matthew B.","full_name":"Blaschko, Matthew B."}],"date_updated":"2023-09-08T11:19:12Z","abstract":[{"text":"Deep neural networks (DNNs) have become increasingly important due to their excellent empirical performance on a wide range of problems. However, regularization is generally achieved by indirect means, largely due to the complex set of functions defined by a network and the difficulty in measuring function complexity. There exists no method in the literature for additive regularization based on a norm of the function, as is classically considered in statistical learning theory. In this work, we study the tractability of function norms for deep neural networks with ReLU activations. We provide, to the best of our knowledge, the first proof in the literature of the NP-hardness of computing function norms of DNNs of 3 or more layers. We also highlight a fundamental difference between shallow and deep networks. In the light on these results, we propose a new regularization strategy based on approximate function norms, and show its efficiency on a segmentation task with a DNN.","lang":"eng"}],"day":"01","type":"conference","oa_version":"None","month":"10","title":"Function norms for neural networks","article_number":"748-752","date_created":"2020-04-05T22:00:50Z"},{"article_number":"1749-1753","title":"Detecting visual relationships using box attention","arxiv":1,"day":"01","author":[{"first_name":"Alexander","last_name":"Kolesnikov","full_name":"Kolesnikov, Alexander","id":"2D157DB6-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Kuznetsova, Alina","last_name":"Kuznetsova","first_name":"Alina"},{"last_name":"Lampert","first_name":"Christoph","full_name":"Lampert, Christoph","id":"40C20FD2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-8622-7887"},{"full_name":"Ferrari, Vittorio","first_name":"Vittorio","last_name":"Ferrari"}],"article_processing_charge":"No","ec_funded":1,"scopus_import":"1","publication":"Proceedings of the 2019 International Conference on Computer Vision Workshop","department":[{"_id":"ChLa"}],"publisher":"IEEE","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","quality_controlled":"1","doi":"10.1109/ICCVW.2019.00217","publication_identifier":{"isbn":["9781728150239"]},"language":[{"iso":"eng"}],"conference":{"start_date":"2019-10-27","name":"ICCVW: International Conference on Computer Vision Workshop","location":"Seoul, South Korea","end_date":"2019-10-28"},"isi":1,"project":[{"grant_number":"308036","name":"Lifelong Learning of Visual Scene Understanding","_id":"2532554C-B435-11E9-9278-68D0E5697425","call_identifier":"FP7"}],"date_created":"2020-04-05T22:00:51Z","oa_version":"Preprint","type":"conference","month":"10","abstract":[{"text":"We propose a new model for detecting visual relationships, such as \"person riding motorcycle\" or \"bottle on table\". This task is an important step towards comprehensive structured mage understanding, going beyond detecting individual objects. Our main novelty is a Box Attention mechanism that allows to model pairwise interactions between objects using standard object detection pipelines. The resulting model is conceptually clean, expressive and relies on well-justified training and prediction procedures. Moreover, unlike previously proposed approaches, our model does not introduce any additional complex components or hyperparameters on top of those already required by the underlying detection model. We conduct an experimental evaluation on two datasets, V-COCO and Open Images, demonstrating strong quantitative and qualitative results.","lang":"eng"}],"date_updated":"2023-09-08T11:18:37Z","_id":"7640","year":"2019","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1807.02136"}],"date_published":"2019-10-01T00:00:00Z","oa":1,"publication_status":"published","citation":{"ista":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. 2019. Detecting visual relationships using box attention. Proceedings of the 2019 International Conference on Computer Vision Workshop. ICCVW: International Conference on Computer Vision Workshop, 1749–1753.","mla":"Kolesnikov, Alexander, et al. “Detecting Visual Relationships Using Box Attention.” <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, 1749–1753, IEEE, 2019, doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>.","apa":"Kolesnikov, A., Kuznetsova, A., Lampert, C., &#38; Ferrari, V. (2019). Detecting visual relationships using box attention. In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. Seoul, South Korea: IEEE. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>","ama":"Kolesnikov A, Kuznetsova A, Lampert C, Ferrari V. Detecting visual relationships using box attention. In: <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE; 2019. doi:<a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">10.1109/ICCVW.2019.00217</a>","short":"A. Kolesnikov, A. Kuznetsova, C. Lampert, V. Ferrari, in:, Proceedings of the 2019 International Conference on Computer Vision Workshop, IEEE, 2019.","ieee":"A. Kolesnikov, A. Kuznetsova, C. Lampert, and V. Ferrari, “Detecting visual relationships using box attention,” in <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>, Seoul, South Korea, 2019.","chicago":"Kolesnikov, Alexander, Alina Kuznetsova, Christoph Lampert, and Vittorio Ferrari. “Detecting Visual Relationships Using Box Attention.” In <i>Proceedings of the 2019 International Conference on Computer Vision Workshop</i>. IEEE, 2019. <a href=\"https://doi.org/10.1109/ICCVW.2019.00217\">https://doi.org/10.1109/ICCVW.2019.00217</a>."},"external_id":{"arxiv":["1807.02136"],"isi":["000554591601098"]},"status":"public"},{"department":[{"_id":"TaHa"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Wiley","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","publication":"Journal of the London Mathematical Society","file":[{"file_size":431754,"relation":"main_file","content_type":"application/pdf","creator":"kschuh","file_name":"2019_Wiley_Ganev.pdf","date_created":"2020-01-07T13:31:53Z","access_level":"open_access","file_id":"7238","date_updated":"2020-07-14T12:46:35Z","checksum":"1be56239b2cd740a0e9a084f773c22f6"}],"day":"01","author":[{"full_name":"Ganev, Iordan V","id":"447491B8-F248-11E8-B48F-1D18A9856A87","last_name":"Ganev","first_name":"Iordan V"}],"publist_id":"8052","title":"The wonderful compactification for quantum groups","issue":"3","language":[{"iso":"eng"}],"isi":1,"quality_controlled":"1","doi":"10.1112/jlms.12193","year":"2019","_id":"5","type":"journal_article","oa_version":"Published Version","month":"06","abstract":[{"lang":"eng","text":"In this paper, we introduce a quantum version of the wonderful compactification of a group as a certain noncommutative projective scheme. Our approach stems from the fact that the wonderful compactification encodes the asymptotics of matrix coefficients, and from its realization as a GIT quotient of the Vinberg semigroup. In order to define the wonderful compactification for a quantum group, we adopt a generalized formalism of Proj categories in the spirit of Artin and Zhang. Key to our construction is a quantum version of the Vinberg semigroup, which we define as a q-deformation of a certain Rees algebra, compatible with a standard Poisson structure. Furthermore, we discuss quantum analogues of the stratification of the wonderful compactification by orbits for a certain group action, and provide explicit computations in the case of SL2."}],"date_updated":"2023-09-19T10:13:08Z","page":"778-806","file_date_updated":"2020-07-14T12:46:35Z","date_created":"2018-12-11T11:44:06Z","volume":99,"status":"public","external_id":{"isi":["000470025900008"]},"citation":{"short":"I.V. Ganev, Journal of the London Mathematical Society 99 (2019) 778–806.","ieee":"I. V. Ganev, “The wonderful compactification for quantum groups,” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3. Wiley, pp. 778–806, 2019.","chicago":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>. Wiley, 2019. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>.","ista":"Ganev IV. 2019. The wonderful compactification for quantum groups. Journal of the London Mathematical Society. 99(3), 778–806.","mla":"Ganev, Iordan V. “The Wonderful Compactification for Quantum Groups.” <i>Journal of the London Mathematical Society</i>, vol. 99, no. 3, Wiley, 2019, pp. 778–806, doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>.","apa":"Ganev, I. V. (2019). The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. Wiley. <a href=\"https://doi.org/10.1112/jlms.12193\">https://doi.org/10.1112/jlms.12193</a>","ama":"Ganev IV. The wonderful compactification for quantum groups. <i>Journal of the London Mathematical Society</i>. 2019;99(3):778-806. doi:<a href=\"https://doi.org/10.1112/jlms.12193\">10.1112/jlms.12193</a>"},"intvolume":"        99","has_accepted_license":"1","publication_status":"published","oa":1,"ddc":["510"],"date_published":"2019-06-01T00:00:00Z"},{"volume":62,"date_created":"2018-12-16T22:59:20Z","file_date_updated":"2020-07-14T12:47:10Z","page":"865–878","oa_version":"Published Version","type":"journal_article","month":"12","date_updated":"2023-09-07T12:07:12Z","abstract":[{"lang":"eng","text":"The order-k Voronoi tessellation of a locally finite set 𝑋⊆ℝ𝑛 decomposes ℝ𝑛 into convex domains whose points have the same k nearest neighbors in X. Assuming X is a stationary Poisson point process, we give explicit formulas for the expected number and total area of faces of a given dimension per unit volume of space. We also develop a relaxed version of discrete Morse theory and generalize by counting only faces, for which the k nearest points in X are within a given distance threshold."}],"_id":"5678","year":"2019","date_published":"2019-12-01T00:00:00Z","ddc":["516"],"publication_status":"published","oa":1,"has_accepted_license":"1","related_material":{"record":[{"relation":"dissertation_contains","status":"public","id":"6287"}]},"intvolume":"        62","citation":{"ieee":"H. Edelsbrunner and A. Nikitenko, “Poisson–Delaunay Mosaics of Order k,” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4. Springer, pp. 865–878, 2019.","chicago":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>.","short":"H. Edelsbrunner, A. Nikitenko, Discrete and Computational Geometry 62 (2019) 865–878.","ama":"Edelsbrunner H, Nikitenko A. Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. 2019;62(4):865–878. doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>","mla":"Edelsbrunner, Herbert, and Anton Nikitenko. “Poisson–Delaunay Mosaics of Order K.” <i>Discrete and Computational Geometry</i>, vol. 62, no. 4, Springer, 2019, pp. 865–878, doi:<a href=\"https://doi.org/10.1007/s00454-018-0049-2\">10.1007/s00454-018-0049-2</a>.","ista":"Edelsbrunner H, Nikitenko A. 2019. Poisson–Delaunay Mosaics of Order k. Discrete and Computational Geometry. 62(4), 865–878.","apa":"Edelsbrunner, H., &#38; Nikitenko, A. (2019). Poisson–Delaunay Mosaics of Order k. <i>Discrete and Computational Geometry</i>. Springer. <a href=\"https://doi.org/10.1007/s00454-018-0049-2\">https://doi.org/10.1007/s00454-018-0049-2</a>"},"external_id":{"arxiv":["1709.09380"],"isi":["000494042900008"]},"status":"public","arxiv":1,"title":"Poisson–Delaunay Mosaics of Order k","author":[{"last_name":"Edelsbrunner","first_name":"Herbert","full_name":"Edelsbrunner, Herbert","id":"3FB178DA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-9823-6833"},{"last_name":"Nikitenko","first_name":"Anton","id":"3E4FF1BA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0659-3201","full_name":"Nikitenko, Anton"}],"day":"01","file":[{"file_size":599339,"relation":"main_file","content_type":"application/pdf","creator":"dernst","file_name":"2018_DiscreteCompGeometry_Edelsbrunner.pdf","date_created":"2019-02-06T10:10:46Z","access_level":"open_access","file_id":"5932","date_updated":"2020-07-14T12:47:10Z","checksum":"f9d00e166efaccb5a76bbcbb4dcea3b4"}],"publication":"Discrete and Computational Geometry","article_type":"original","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"ec_funded":1,"article_processing_charge":"Yes (via OA deal)","scopus_import":"1","publisher":"Springer","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"HeEd"}],"doi":"10.1007/s00454-018-0049-2","quality_controlled":"1","publication_identifier":{"issn":["01795376"],"eissn":["14320444"]},"isi":1,"issue":"4","language":[{"iso":"eng"}],"project":[{"grant_number":"788183","_id":"266A2E9E-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Alpha Shape Theory Extended"},{"name":"Persistence and stability of geometric complexes","_id":"2561EBF4-B435-11E9-9278-68D0E5697425","call_identifier":"FWF","grant_number":"I02979-N35"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}]},{"author":[{"first_name":"Christophe","last_name":"Andalo","full_name":"Andalo, Christophe"},{"last_name":"Burrus","first_name":"Monique","full_name":"Burrus, Monique"},{"last_name":"Paute","first_name":"Sandrine","full_name":"Paute, Sandrine"},{"last_name":"Lauzeral","first_name":"Christine","full_name":"Lauzeral, Christine"},{"last_name":"Field","first_name":"David","id":"419049E2-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-4014-8478","full_name":"Field, David"}],"day":"01","title":"Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone","publisher":"Taylor and Francis","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","department":[{"_id":"NiBa"}],"publication":"Botany Letters","scopus_import":"1","article_processing_charge":"No","publication_identifier":{"issn":["23818107"],"eissn":["23818115"]},"doi":"10.1080/23818107.2018.1545142","quality_controlled":"1","isi":1,"language":[{"iso":"eng"}],"issue":"1","page":"80-92","abstract":[{"text":"Pollinators display a remarkable diversity of foraging strategies with flowering plants, from primarily mutualistic interactions to cheating through nectar robbery. Despite numerous studies on the effect of nectar robbing on components of plant fitness, its contribution to reproductive isolation is unclear. We experimentally tested the impact of different pollinator strategies in a natural hybrid zone between two subspecies of Antirrhinum majus with alternate flower colour guides. On either side of a steep cline in flower colour between Antirrhinum majus pseudomajus (magenta) and A. m. striatum (yellow), we quantified the behaviour of all floral visitors at different time points during the flowering season. Using long-run camera surveys, we quantify the impact of nectar robbing on the number of flowers visited per inflorescence and the flower probing time. We further experimentally tested the effect of nectar robbing on female reproductive success by manipulating the intensity of robbing. While robbing increased over time the number of legitimate visitors tended to decrease concomitantly. We found that the number of flowers pollinated on a focal inflorescence decreased with the number of prior robbing events. However, in the manipulative experiment, fruit set and fruit volume did not vary significantly between low robbing and control treatments. Our findings challenge the idea that robbers have a negative impact on plant fitness through female function. This study also adds to our understanding of the components of pollinator-mediated reproductive isolation and the maintenance of Antirrhinum hybrid zones.","lang":"eng"}],"date_updated":"2023-08-24T14:34:12Z","type":"journal_article","oa_version":"None","month":"01","volume":166,"date_created":"2018-12-16T22:59:20Z","year":"2019","_id":"5680","publication_status":"published","date_published":"2019-01-01T00:00:00Z","status":"public","external_id":{"isi":["000463802800009"]},"intvolume":"       166","citation":{"ama":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. <i>Botany Letters</i>. 2019;166(1):80-92. doi:<a href=\"https://doi.org/10.1080/23818107.2018.1545142\">10.1080/23818107.2018.1545142</a>","apa":"Andalo, C., Burrus, M., Paute, S., Lauzeral, C., &#38; Field, D. (2019). Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. <i>Botany Letters</i>. Taylor and Francis. <a href=\"https://doi.org/10.1080/23818107.2018.1545142\">https://doi.org/10.1080/23818107.2018.1545142</a>","ista":"Andalo C, Burrus M, Paute S, Lauzeral C, Field D. 2019. Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone. Botany Letters. 166(1), 80–92.","mla":"Andalo, Christophe, et al. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” <i>Botany Letters</i>, vol. 166, no. 1, Taylor and Francis, 2019, pp. 80–92, doi:<a href=\"https://doi.org/10.1080/23818107.2018.1545142\">10.1080/23818107.2018.1545142</a>.","chicago":"Andalo, Christophe, Monique Burrus, Sandrine Paute, Christine Lauzeral, and David Field. “Prevalence of Legitimate Pollinators and Nectar Robbers and the Consequences for Fruit Set in an Antirrhinum Majus Hybrid Zone.” <i>Botany Letters</i>. Taylor and Francis, 2019. <a href=\"https://doi.org/10.1080/23818107.2018.1545142\">https://doi.org/10.1080/23818107.2018.1545142</a>.","ieee":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, and D. Field, “Prevalence of legitimate pollinators and nectar robbers and the consequences for fruit set in an Antirrhinum majus hybrid zone,” <i>Botany Letters</i>, vol. 166, no. 1. Taylor and Francis, pp. 80–92, 2019.","short":"C. Andalo, M. Burrus, S. Paute, C. Lauzeral, D. Field, Botany Letters 166 (2019) 80–92."}},{"publication_identifier":{"issn":["14657392"]},"doi":"10.1038/s41556-018-0247-4","quality_controlled":"1","project":[{"grant_number":"742573","name":"Interaction and feedback between cell mechanics and fate specification in vertebrate gastrulation","_id":"260F1432-B435-11E9-9278-68D0E5697425","call_identifier":"H2020"},{"name":"Molecular mechanism of auxindriven formative divisions delineating lateral root organogenesis in plants (EMBO fellowship)","_id":"253E54C8-B435-11E9-9278-68D0E5697425","grant_number":"ALTF710-2016"}],"isi":1,"language":[{"iso":"eng"}],"author":[{"id":"2A003F6C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8451-1195","full_name":"Petridou, Nicoletta","last_name":"Petridou","first_name":"Nicoletta"},{"first_name":"Silvia","last_name":"Grigolon","full_name":"Grigolon, Silvia"},{"first_name":"Guillaume","last_name":"Salbreux","full_name":"Salbreux, Guillaume"},{"first_name":"Edouard B","last_name":"Hannezo","full_name":"Hannezo, Edouard B","id":"3A9DB764-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0001-6005-1561"},{"full_name":"Heisenberg, Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-0912-4566","first_name":"Carl-Philipp J","last_name":"Heisenberg"}],"file":[{"date_updated":"2020-10-21T07:18:35Z","file_id":"8685","checksum":"e38523787b3bc84006f2793de99ad70f","date_created":"2020-10-21T07:18:35Z","access_level":"open_access","success":1,"file_name":"2018_NatureCellBio_Petridou_accepted.pdf","content_type":"application/pdf","relation":"main_file","file_size":71590590,"creator":"dernst"}],"day":"01","title":"Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling","publisher":"Nature Publishing Group","user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","pmid":1,"department":[{"_id":"CaHe"},{"_id":"EdHa"}],"publication":"Nature Cell Biology","scopus_import":"1","ec_funded":1,"article_processing_charge":"No","article_type":"original","publication_status":"published","oa":1,"has_accepted_license":"1","ddc":["570"],"date_published":"2019-02-01T00:00:00Z","acknowledged_ssus":[{"_id":"Bio"}],"status":"public","external_id":{"isi":["000457468300011"],"pmid":["30559456"]},"related_material":{"link":[{"url":"https://ist.ac.at/en/news/when-a-fish-becomes-fluid/","description":"News on IST Homepage","relation":"press_release"}]},"intvolume":"        21","citation":{"short":"N. Petridou, S. Grigolon, G. Salbreux, E.B. Hannezo, C.-P.J. Heisenberg, Nature Cell Biology 21 (2019) 169–178.","ieee":"N. Petridou, S. Grigolon, G. Salbreux, E. B. Hannezo, and C.-P. J. Heisenberg, “Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling,” <i>Nature Cell Biology</i>, vol. 21. Nature Publishing Group, pp. 169–178, 2019.","chicago":"Petridou, Nicoletta, Silvia Grigolon, Guillaume Salbreux, Edouard B Hannezo, and Carl-Philipp J Heisenberg. “Fluidization-Mediated Tissue Spreading by Mitotic Cell Rounding and Non-Canonical Wnt Signalling.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2019. <a href=\"https://doi.org/10.1038/s41556-018-0247-4\">https://doi.org/10.1038/s41556-018-0247-4</a>.","mla":"Petridou, Nicoletta, et al. “Fluidization-Mediated Tissue Spreading by Mitotic Cell Rounding and Non-Canonical Wnt Signalling.” <i>Nature Cell Biology</i>, vol. 21, Nature Publishing Group, 2019, pp. 169–178, doi:<a href=\"https://doi.org/10.1038/s41556-018-0247-4\">10.1038/s41556-018-0247-4</a>.","ista":"Petridou N, Grigolon S, Salbreux G, Hannezo EB, Heisenberg C-PJ. 2019. Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. Nature Cell Biology. 21, 169–178.","apa":"Petridou, N., Grigolon, S., Salbreux, G., Hannezo, E. B., &#38; Heisenberg, C.-P. J. (2019). Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/s41556-018-0247-4\">https://doi.org/10.1038/s41556-018-0247-4</a>","ama":"Petridou N, Grigolon S, Salbreux G, Hannezo EB, Heisenberg C-PJ. Fluidization-mediated tissue spreading by mitotic cell rounding and non-canonical Wnt signalling. <i>Nature Cell Biology</i>. 2019;21:169–178. doi:<a href=\"https://doi.org/10.1038/s41556-018-0247-4\">10.1038/s41556-018-0247-4</a>"},"page":"169–178","date_updated":"2023-09-11T14:03:28Z","abstract":[{"text":"Tissue morphogenesis is driven by mechanical forces that elicit changes in cell size, shape and motion. The extent by which forces deform tissues critically depends on the rheological properties of the recipient tissue. Yet, whether and how dynamic changes in tissue rheology affect tissue morphogenesis and how they are regulated within the developing organism remain unclear. Here, we show that blastoderm spreading at the onset of zebrafish morphogenesis relies on a rapid, pronounced and spatially patterned tissue fluidization. Blastoderm fluidization is temporally controlled by mitotic cell rounding-dependent cell–cell contact disassembly during the last rounds of cell cleavages. Moreover, fluidization is spatially restricted to the central blastoderm by local activation of non-canonical Wnt signalling within the blastoderm margin, increasing cell cohesion and thereby counteracting the effect of mitotic rounding on contact disassembly. Overall, our results identify a fluidity transition mediated by loss of cell cohesion as a critical regulator of embryo morphogenesis.","lang":"eng"}],"month":"02","oa_version":"Submitted Version","type":"journal_article","volume":21,"date_created":"2018-12-30T22:59:15Z","file_date_updated":"2020-10-21T07:18:35Z","year":"2019","_id":"5789"},{"title":"Extending partial representations of circle graphs","arxiv":1,"author":[{"full_name":"Chaplick, Steven","first_name":"Steven","last_name":"Chaplick"},{"first_name":"Radoslav","last_name":"Fulek","full_name":"Fulek, Radoslav","orcid":"0000-0001-8485-1774","id":"39F3FFE4-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Klavík, Pavel","first_name":"Pavel","last_name":"Klavík"}],"day":"01","publication":"Journal of Graph Theory","ec_funded":1,"scopus_import":"1","article_processing_charge":"No","article_type":"original","user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Wiley","department":[{"_id":"UlWa"}],"doi":"10.1002/jgt.22436","quality_controlled":"1","publication_identifier":{"issn":["03649024"]},"isi":1,"language":[{"iso":"eng"}],"issue":"4","project":[{"grant_number":"291734","name":"International IST Postdoc Fellowship Programme","call_identifier":"FP7","_id":"25681D80-B435-11E9-9278-68D0E5697425"}],"volume":91,"date_created":"2018-12-30T22:59:15Z","page":"365-394","abstract":[{"lang":"eng","text":"The partial representation extension problem is a recently introduced generalization of the recognition problem. A circle graph is an intersection graph of chords of a circle. We study the partial representation extension problem for circle graphs, where the input consists of a graph G and a partial representation R′ giving some predrawn chords that represent an induced subgraph of G. The question is whether one can extend R′ to a representation R of the entire graph G, that is, whether one can draw the remaining chords into a partially predrawn representation to obtain a representation of G. Our main result is an O(n3) time algorithm for partial representation extension of circle graphs, where n is the number of vertices. To show this, we describe the structure of all representations of a circle graph using split decomposition. This can be of independent interest."}],"date_updated":"2023-08-24T14:30:43Z","type":"journal_article","month":"08","oa_version":"Preprint","_id":"5790","year":"2019","date_published":"2019-08-01T00:00:00Z","main_file_link":[{"open_access":"1","url":"https://arxiv.org/abs/1309.2399"}],"publication_status":"published","oa":1,"intvolume":"        91","citation":{"apa":"Chaplick, S., Fulek, R., &#38; Klavík, P. (2019). Extending partial representations of circle graphs. <i>Journal of Graph Theory</i>. Wiley. <a href=\"https://doi.org/10.1002/jgt.22436\">https://doi.org/10.1002/jgt.22436</a>","ista":"Chaplick S, Fulek R, Klavík P. 2019. Extending partial representations of circle graphs. Journal of Graph Theory. 91(4), 365–394.","mla":"Chaplick, Steven, et al. “Extending Partial Representations of Circle Graphs.” <i>Journal of Graph Theory</i>, vol. 91, no. 4, Wiley, 2019, pp. 365–94, doi:<a href=\"https://doi.org/10.1002/jgt.22436\">10.1002/jgt.22436</a>.","ama":"Chaplick S, Fulek R, Klavík P. Extending partial representations of circle graphs. <i>Journal of Graph Theory</i>. 2019;91(4):365-394. doi:<a href=\"https://doi.org/10.1002/jgt.22436\">10.1002/jgt.22436</a>","short":"S. Chaplick, R. Fulek, P. Klavík, Journal of Graph Theory 91 (2019) 365–394.","chicago":"Chaplick, Steven, Radoslav Fulek, and Pavel Klavík. “Extending Partial Representations of Circle Graphs.” <i>Journal of Graph Theory</i>. Wiley, 2019. <a href=\"https://doi.org/10.1002/jgt.22436\">https://doi.org/10.1002/jgt.22436</a>.","ieee":"S. Chaplick, R. Fulek, and P. Klavík, “Extending partial representations of circle graphs,” <i>Journal of Graph Theory</i>, vol. 91, no. 4. Wiley, pp. 365–394, 2019."},"external_id":{"isi":["000485392800004"],"arxiv":["1309.2399"]},"status":"public"},{"quality_controlled":"1","date_published":"2019-01-01T00:00:00Z","doi":"10.1007/978-1-4939-8910-2_14","publication_identifier":{"isbn":["978-1-4939-8909-6"]},"publication_status":"published","language":[{"iso":"eng"}],"citation":{"short":"Y. Asaoka, H. Morita, H. Furumoto, C.-P.J. Heisenberg, M. Furutani-Seiki, in:, A. Hergovich (Ed.), The Hippo Pathway, Springer, 2019, pp. 167–181.","ieee":"Y. Asaoka, H. Morita, H. Furumoto, C.-P. J. Heisenberg, and M. Furutani-Seiki, “Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids,” in <i>The hippo pathway</i>, vol. 1893, A. Hergovich, Ed. Springer, 2019, pp. 167–181.","chicago":"Asaoka, Yoichi, Hitoshi Morita, Hiroko Furumoto, Carl-Philipp J Heisenberg, and Makoto Furutani-Seiki. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” In <i>The Hippo Pathway</i>, edited by Alexander Hergovich, 1893:167–81. Methods in Molecular Biology. Springer, 2019. <a href=\"https://doi.org/10.1007/978-1-4939-8910-2_14\">https://doi.org/10.1007/978-1-4939-8910-2_14</a>.","ista":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. 2019.Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: The hippo pathway. MIMB, vol. 1893, 167–181.","mla":"Asaoka, Yoichi, et al. “Studying YAP-Mediated 3D Morphogenesis Using Fish Embryos and Human Spheroids.” <i>The Hippo Pathway</i>, edited by Alexander Hergovich, vol. 1893, Springer, 2019, pp. 167–81, doi:<a href=\"https://doi.org/10.1007/978-1-4939-8910-2_14\">10.1007/978-1-4939-8910-2_14</a>.","apa":"Asaoka, Y., Morita, H., Furumoto, H., Heisenberg, C.-P. J., &#38; Furutani-Seiki, M. (2019). Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In A. Hergovich (Ed.), <i>The hippo pathway</i> (Vol. 1893, pp. 167–181). Springer. <a href=\"https://doi.org/10.1007/978-1-4939-8910-2_14\">https://doi.org/10.1007/978-1-4939-8910-2_14</a>","ama":"Asaoka Y, Morita H, Furumoto H, Heisenberg C-PJ, Furutani-Seiki M. Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids. In: Hergovich A, ed. <i>The Hippo Pathway</i>. Vol 1893. Methods in Molecular Biology. Springer; 2019:167-181. doi:<a href=\"https://doi.org/10.1007/978-1-4939-8910-2_14\">10.1007/978-1-4939-8910-2_14</a>"},"series_title":"Methods in Molecular Biology","intvolume":"      1893","status":"public","editor":[{"first_name":"Alexander","last_name":"Hergovich","full_name":"Hergovich, Alexander"}],"alternative_title":["MIMB"],"date_created":"2019-01-06T22:59:11Z","title":"Studying YAP-mediated 3D morphogenesis using fish embryos and human spheroids","volume":1893,"month":"01","oa_version":"None","type":"book_chapter","abstract":[{"lang":"eng","text":"The transcription coactivator, Yes-associated protein (YAP), which is a nuclear effector of the Hippo signaling pathway, has been shown to be a mechano-transducer. By using mutant fish and human 3D spheroids, we have recently demonstrated that YAP is also a mechano-effector. YAP functions in three-dimensional (3D) morphogenesis of organ and global body shape by controlling actomyosin-mediated tissue tension. In this chapter, we present a platform that links the findings in fish embryos with human cells. The protocols for analyzing tissue tension-mediated global body shape/organ morphogenesis in vivo and ex vivo using medaka fish embryos and in vitro using human cell spheroids represent useful tools for unraveling the molecular mechanisms by which YAP functions in regulating global body/organ morphogenesis."}],"date_updated":"2021-01-12T08:03:30Z","day":"01","page":"167-181","author":[{"first_name":"Yoichi","last_name":"Asaoka","full_name":"Asaoka, Yoichi"},{"full_name":"Morita, Hitoshi","first_name":"Hitoshi","last_name":"Morita"},{"full_name":"Furumoto, Hiroko","first_name":"Hiroko","last_name":"Furumoto"},{"last_name":"Heisenberg","first_name":"Carl-Philipp J","orcid":"0000-0002-0912-4566","id":"39427864-F248-11E8-B48F-1D18A9856A87","full_name":"Heisenberg, Carl-Philipp J"},{"first_name":"Makoto","last_name":"Furutani-Seiki","full_name":"Furutani-Seiki, Makoto"}],"scopus_import":1,"_id":"5793","publication":"The hippo pathway","department":[{"_id":"CaHe"}],"year":"2019","publisher":"Springer","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87"},{"pmid":1,"department":[{"_id":"GaTk"}],"user_id":"c635000d-4b10-11ee-a964-aac5a93f6ac1","publisher":"Royal Society of Chemistry","article_processing_charge":"No","scopus_import":"1","tmp":{"name":"Creative Commons Attribution-NonCommercial-NoDerivs 3.0 Unported (CC BY-NC-ND 3.0)","short":"CC BY-NC-ND (3.0)","legal_code_url":"https://creativecommons.org/licenses/by-nc-nd/3.0/legalcode","image":"/images/cc_by_nc_nd.png"},"article_type":"original","publication":"Soft Matter","file":[{"checksum":"614c337d6424ccd3d48d1b1f9513510d","file_id":"8641","date_updated":"2020-10-09T11:00:05Z","access_level":"open_access","date_created":"2020-10-09T11:00:05Z","file_name":"lmt_sftmtr_V8.pdf","success":1,"creator":"bkavcic","file_size":5370762,"content_type":"application/pdf","relation":"main_file"}],"license":"https://creativecommons.org/licenses/by-nc-nd/3.0/","day":"10","author":[{"first_name":"Bor","last_name":"Kavcic","full_name":"Kavcic, Bor","orcid":"0000-0001-6041-254X","id":"350F91D2-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Sakashita, A.","last_name":"Sakashita","first_name":"A."},{"full_name":"Noguchi, H.","last_name":"Noguchi","first_name":"H."},{"full_name":"Ziherl, P.","first_name":"P.","last_name":"Ziherl"}],"title":"Limiting shapes of confined lipid vesicles","language":[{"iso":"eng"}],"issue":"4","isi":1,"publication_identifier":{"eissn":["1744-6848"],"issn":["1744-683X"]},"quality_controlled":"1","doi":"10.1039/c8sm01956h","year":"2019","_id":"5817","abstract":[{"text":"We theoretically study the shapes of lipid vesicles confined to a spherical cavity, elaborating a framework based on the so-called limiting shapes constructed from geometrically simple structural elements such as double-membrane walls and edges. Partly inspired by numerical results, the proposed non-compartmentalized and compartmentalized limiting shapes are arranged in the bilayer-couple phase diagram which is then compared to its free-vesicle counterpart. We also compute the area-difference-elasticity phase diagram of the limiting shapes and we use it to interpret shape transitions experimentally observed in vesicles confined within another vesicle. The limiting-shape framework may be generalized to theoretically investigate the structure of certain cell organelles such as the mitochondrion.","lang":"eng"}],"date_updated":"2023-09-13T08:47:16Z","month":"01","type":"journal_article","oa_version":"Submitted Version","page":"602-614","date_created":"2019-01-11T07:37:47Z","file_date_updated":"2020-10-09T11:00:05Z","volume":15,"external_id":{"pmid":["30629082"],"isi":["000457329700003"]},"status":"public","citation":{"chicago":"Kavcic, Bor, A. Sakashita, H. Noguchi, and P. Ziherl. “Limiting Shapes of Confined Lipid Vesicles.” <i>Soft Matter</i>. Royal Society of Chemistry, 2019. <a href=\"https://doi.org/10.1039/c8sm01956h\">https://doi.org/10.1039/c8sm01956h</a>.","ieee":"B. Kavcic, A. Sakashita, H. Noguchi, and P. Ziherl, “Limiting shapes of confined lipid vesicles,” <i>Soft Matter</i>, vol. 15, no. 4. Royal Society of Chemistry, pp. 602–614, 2019.","short":"B. Kavcic, A. Sakashita, H. Noguchi, P. Ziherl, Soft Matter 15 (2019) 602–614.","ama":"Kavcic B, Sakashita A, Noguchi H, Ziherl P. Limiting shapes of confined lipid vesicles. <i>Soft Matter</i>. 2019;15(4):602-614. doi:<a href=\"https://doi.org/10.1039/c8sm01956h\">10.1039/c8sm01956h</a>","apa":"Kavcic, B., Sakashita, A., Noguchi, H., &#38; Ziherl, P. (2019). Limiting shapes of confined lipid vesicles. <i>Soft Matter</i>. Royal Society of Chemistry. <a href=\"https://doi.org/10.1039/c8sm01956h\">https://doi.org/10.1039/c8sm01956h</a>","mla":"Kavcic, Bor, et al. “Limiting Shapes of Confined Lipid Vesicles.” <i>Soft Matter</i>, vol. 15, no. 4, Royal Society of Chemistry, 2019, pp. 602–14, doi:<a href=\"https://doi.org/10.1039/c8sm01956h\">10.1039/c8sm01956h</a>.","ista":"Kavcic B, Sakashita A, Noguchi H, Ziherl P. 2019. Limiting shapes of confined lipid vesicles. Soft Matter. 15(4), 602–614."},"intvolume":"        15","has_accepted_license":"1","publication_status":"published","oa":1,"ddc":["530"],"date_published":"2019-01-10T00:00:00Z"},{"language":[{"iso":"eng"}],"issue":"1","isi":1,"project":[{"grant_number":"281511","call_identifier":"FP7","_id":"257A4776-B435-11E9-9278-68D0E5697425","name":"Memory-related information processing in neuronal circuits of the hippocampus and entorhinal cortex"}],"quality_controlled":"1","doi":"10.1016/j.neuron.2018.11.015","publication_identifier":{"issn":["10974199"]},"scopus_import":"1","ec_funded":1,"article_processing_charge":"No","article_type":"original","publication":"Neuron","department":[{"_id":"JoCs"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Elsevier","title":"Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze","day":"02","author":[{"first_name":"Haibing","last_name":"Xu","full_name":"Xu, Haibing","id":"310349D0-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Baracskay, Peter","id":"361CC00E-F248-11E8-B48F-1D18A9856A87","first_name":"Peter","last_name":"Baracskay"},{"id":"426376DC-F248-11E8-B48F-1D18A9856A87","full_name":"O'Neill, Joseph","last_name":"O'Neill","first_name":"Joseph"},{"last_name":"Csicsvari","first_name":"Jozsef L","id":"3FA14672-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-5193-4036","full_name":"Csicsvari, Jozsef L"}],"citation":{"mla":"Xu, Haibing, et al. “Assembly Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.” <i>Neuron</i>, vol. 101, no. 1, Elsevier, 2019, p. 119–132.e4, doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.11.015\">10.1016/j.neuron.2018.11.015</a>.","ista":"Xu H, Baracskay P, O’Neill J, Csicsvari JL. 2019. Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. Neuron. 101(1), 119–132.e4.","apa":"Xu, H., Baracskay, P., O’Neill, J., &#38; Csicsvari, J. L. (2019). Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. <i>Neuron</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.neuron.2018.11.015\">https://doi.org/10.1016/j.neuron.2018.11.015</a>","ama":"Xu H, Baracskay P, O’Neill J, Csicsvari JL. Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze. <i>Neuron</i>. 2019;101(1):119-132.e4. doi:<a href=\"https://doi.org/10.1016/j.neuron.2018.11.015\">10.1016/j.neuron.2018.11.015</a>","short":"H. Xu, P. Baracskay, J. O’Neill, J.L. Csicsvari, Neuron 101 (2019) 119–132.e4.","ieee":"H. Xu, P. Baracskay, J. O’Neill, and J. L. Csicsvari, “Assembly responses of hippocampal CA1 place cells predict learned behavior in goal-directed spatial tasks on the radial eight-arm maze,” <i>Neuron</i>, vol. 101, no. 1. Elsevier, p. 119–132.e4, 2019.","chicago":"Xu, Haibing, Peter Baracskay, Joseph O’Neill, and Jozsef L Csicsvari. “Assembly Responses of Hippocampal CA1 Place Cells Predict Learned Behavior in Goal-Directed Spatial Tasks on the Radial Eight-Arm Maze.” <i>Neuron</i>. Elsevier, 2019. <a href=\"https://doi.org/10.1016/j.neuron.2018.11.015\">https://doi.org/10.1016/j.neuron.2018.11.015</a>."},"related_material":{"link":[{"description":"News on IST Homepage","url":"https://ist.ac.at/en/news/reading-rats-minds/","relation":"press_release"}],"record":[{"relation":"dissertation_contains","id":"837","status":"public"}]},"intvolume":"       101","external_id":{"isi":["000454791500014"]},"status":"public","main_file_link":[{"url":"https://www.doi.org/10.1016/j.neuron.2018.11.015","open_access":"1"}],"date_published":"2019-01-02T00:00:00Z","publication_status":"published","oa":1,"_id":"5828","year":"2019","date_created":"2019-01-13T22:59:10Z","volume":101,"abstract":[{"text":"Hippocampus is needed for both spatial working and reference memories. Here, using a radial eight-arm maze, we examined how the combined demand on these memories influenced CA1 place cell assemblies while reference memories were partially updated. This was contrasted with control tasks requiring only working memory or the update of reference memory. Reference memory update led to the reward-directed place field shifts at newly rewarded arms and to the gradual strengthening of firing in passes between newly rewarded arms but not between those passes that included a familiar-rewarded arm. At the maze center, transient network synchronization periods preferentially replayed trajectories of the next chosen arm in reference memory tasks but the previously visited arm in the working memory task. Hence, reference memory demand was uniquely associated with a gradual, goal novelty-related reorganization of place cell assemblies and with trajectory replay that reflected the animal's decision of which arm to visit next.","lang":"eng"}],"date_updated":"2023-09-07T12:06:37Z","month":"01","oa_version":"Published Version","type":"journal_article","page":"119-132.e4"},{"ec_funded":1,"scopus_import":"1","article_processing_charge":"Yes (via OA deal)","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"article_type":"original","publication":"Annales Henri Poincare","department":[{"_id":"RoSe"}],"user_id":"4359f0d1-fa6c-11eb-b949-802e58b17ae8","publisher":"Springer","title":"Energy contribution of a point-interacting impurity in a Fermi gas","arxiv":1,"day":"01","file":[{"file_name":"2019_Annales_Moser.pdf","creator":"dernst","relation":"main_file","content_type":"application/pdf","file_size":859846,"checksum":"255e42f957a8e2b10aad2499c750a8d6","date_updated":"2020-07-14T12:47:12Z","file_id":"5894","access_level":"open_access","date_created":"2019-01-28T15:27:17Z"}],"author":[{"id":"2B5FC9A4-F248-11E8-B48F-1D18A9856A87","full_name":"Moser, Thomas","first_name":"Thomas","last_name":"Moser"},{"first_name":"Robert","last_name":"Seiringer","id":"4AFD0470-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6781-0521","full_name":"Seiringer, Robert"}],"language":[{"iso":"eng"}],"issue":"4","isi":1,"project":[{"grant_number":"694227","_id":"25C6DC12-B435-11E9-9278-68D0E5697425","call_identifier":"H2020","name":"Analysis of quantum many-body systems"},{"call_identifier":"FWF","_id":"25C878CE-B435-11E9-9278-68D0E5697425","name":"Structure of the Excitation Spectrum for Many-Body Quantum Systems","grant_number":"P27533_N27"},{"name":"IST Austria Open Access Fund","_id":"B67AFEDC-15C9-11EA-A837-991A96BB2854"}],"quality_controlled":"1","doi":"10.1007/s00023-018-00757-0","publication_identifier":{"issn":["14240637"]},"_id":"5856","year":"2019","date_created":"2019-01-20T22:59:17Z","file_date_updated":"2020-07-14T12:47:12Z","volume":20,"abstract":[{"text":"We give a bound on the ground-state energy of a system of N non-interacting fermions in a three-dimensional cubic box interacting with an impurity particle via point interactions. We show that the change in energy compared to the system in the absence of the impurity is bounded in terms of the gas density and the scattering length of the interaction, independently of N. Our bound holds as long as the ratio of the mass of the impurity to the one of the gas particles is larger than a critical value m∗ ∗≈ 0.36 , which is the same regime for which we recently showed stability of the system.","lang":"eng"}],"date_updated":"2023-09-07T12:37:42Z","month":"04","oa_version":"Published Version","type":"journal_article","page":"1325–1365","citation":{"ieee":"T. Moser and R. Seiringer, “Energy contribution of a point-interacting impurity in a Fermi gas,” <i>Annales Henri Poincare</i>, vol. 20, no. 4. Springer, pp. 1325–1365, 2019.","chicago":"Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting Impurity in a Fermi Gas.” <i>Annales Henri Poincare</i>. Springer, 2019. <a href=\"https://doi.org/10.1007/s00023-018-00757-0\">https://doi.org/10.1007/s00023-018-00757-0</a>.","short":"T. Moser, R. Seiringer, Annales Henri Poincare 20 (2019) 1325–1365.","ama":"Moser T, Seiringer R. Energy contribution of a point-interacting impurity in a Fermi gas. <i>Annales Henri Poincare</i>. 2019;20(4):1325–1365. doi:<a href=\"https://doi.org/10.1007/s00023-018-00757-0\">10.1007/s00023-018-00757-0</a>","ista":"Moser T, Seiringer R. 2019. Energy contribution of a point-interacting impurity in a Fermi gas. Annales Henri Poincare. 20(4), 1325–1365.","mla":"Moser, Thomas, and Robert Seiringer. “Energy Contribution of a Point-Interacting Impurity in a Fermi Gas.” <i>Annales Henri Poincare</i>, vol. 20, no. 4, Springer, 2019, pp. 1325–1365, doi:<a href=\"https://doi.org/10.1007/s00023-018-00757-0\">10.1007/s00023-018-00757-0</a>.","apa":"Moser, T., &#38; Seiringer, R. (2019). Energy contribution of a point-interacting impurity in a Fermi gas. <i>Annales Henri Poincare</i>. Springer. <a href=\"https://doi.org/10.1007/s00023-018-00757-0\">https://doi.org/10.1007/s00023-018-00757-0</a>"},"intvolume":"        20","related_material":{"record":[{"relation":"dissertation_contains","id":"52","status":"public"}]},"status":"public","external_id":{"isi":["000462444300008"],"arxiv":["1807.00739"]},"ddc":["530"],"date_published":"2019-04-01T00:00:00Z","has_accepted_license":"1","publication_status":"published","oa":1}]