[{"title":"Analytic Visibility on the GPU","volume":32,"status":"public","intvolume":"        32","day":"06","year":"2013","author":[{"orcid":"0000-0002-1546-3265","full_name":"Thomas Auzinger","last_name":"Auzinger","first_name":"Thomas","id":"4718F954-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Wimmer, Michael","last_name":"Wimmer","first_name":"Michael"},{"full_name":"Stefan Jeschke","last_name":"Jeschke","first_name":"Stefan","id":"44D6411A-F248-11E8-B48F-1D18A9856A87"}],"acknowledgement":"Funding was provided by the FWF grant P20768-N13.\nWe want to thank the reviewers for their insightful and helpful remarks and Gernot Ziegler for providing help with CUDA. ","citation":{"mla":"Auzinger, Thomas, et al. “Analytic Visibility on the GPU.” <i>Computer Graphics Forum</i>, vol. 32, no. 124, Wiley-Blackwell, 2013, pp. 409–18, doi:<a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">DOI: 10.1111/cgf.12061</a>.","ieee":"T. Auzinger, M. Wimmer, and S. Jeschke, “Analytic Visibility on the GPU,” <i>Computer Graphics Forum</i>, vol. 32, no. 124. Wiley-Blackwell, pp. 409–418, 2013.","ista":"Auzinger T, Wimmer M, Jeschke S. 2013. Analytic Visibility on the GPU. Computer Graphics Forum. 32(124), 409–418.","short":"T. Auzinger, M. Wimmer, S. Jeschke, Computer Graphics Forum 32 (2013) 409–418.","chicago":"Auzinger, Thomas, Michael Wimmer, and Stefan Jeschke. “Analytic Visibility on the GPU.” <i>Computer Graphics Forum</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">https://doi.org/DOI: 10.1111/cgf.12061</a>.","apa":"Auzinger, T., Wimmer, M., &#38; Jeschke, S. (2013). Analytic Visibility on the GPU. <i>Computer Graphics Forum</i>. Wiley-Blackwell. <a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">https://doi.org/DOI: 10.1111/cgf.12061</a>","ama":"Auzinger T, Wimmer M, Jeschke S. Analytic Visibility on the GPU. <i>Computer Graphics Forum</i>. 2013;32(124):409-418. doi:<a href=\"https://doi.org/DOI: 10.1111/cgf.12061\">DOI: 10.1111/cgf.12061</a>"},"doi":"DOI: 10.1111/cgf.12061","quality_controlled":0,"date_created":"2018-12-11T11:56:40Z","issue":124,"_id":"2269","type":"journal_article","extern":1,"publication":"Computer Graphics Forum","publication_status":"published","publisher":"Wiley-Blackwell","publist_id":"4675","date_updated":"2021-01-12T06:56:25Z","abstract":[{"lang":"eng","text":"This paper presents a parallel, implementation-friendly analytic visibility method for triangular meshes. Together with an analytic filter convolution, it allows for a fully analytic solution to anti-aliased 3D mesh rendering on parallel hardware. Building on recent works in computational geometry, we present a new edge-triangle intersection algorithm and a novel method to complete the boundaries of all visible triangle regions after a hidden line elimination step. All stages of the method are embarrassingly parallel and easily implementable on parallel hardware. A GPU implementation is discussed and performance characteristics of the method are shown and compared to traditional sampling-based rendering methods."}],"month":"05","date_published":"2013-05-06T00:00:00Z","page":"409 - 418"},{"oa_version":"None","quality_controlled":"1","date_created":"2018-12-11T11:56:41Z","citation":{"ama":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. Optimal Coalition Structures in Cooperative Graph Games. In: AAAI Press; 2013:81-87.","ieee":"Y. Bachrach, P. Kohli, V. Kolmogorov, and M. Zadimoghaddam, “Optimal Coalition Structures in Cooperative Graph Games,” presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States, 2013, pp. 81–87.","ista":"Bachrach Y, Kohli P, Kolmogorov V, Zadimoghaddam M. 2013. Optimal Coalition Structures in Cooperative Graph Games. AAAI: Conference on Artificial Intelligence, 81–87.","mla":"Bachrach, Yoram, et al. <i>Optimal Coalition Structures in Cooperative Graph Games</i>. AAAI Press, 2013, pp. 81–87.","apa":"Bachrach, Y., Kohli, P., Kolmogorov, V., &#38; Zadimoghaddam, M. (2013). Optimal Coalition Structures in Cooperative Graph Games (pp. 81–87). Presented at the AAAI: Conference on Artificial Intelligence, Bellevue, WA, United States: AAAI Press.","chicago":"Bachrach, Yoram, Pushmeet Kohli, Vladimir Kolmogorov, and Morteza Zadimoghaddam. “Optimal Coalition Structures in Cooperative Graph Games,” 81–87. AAAI Press, 2013.","short":"Y. Bachrach, P. Kohli, V. Kolmogorov, M. Zadimoghaddam, in:, AAAI Press, 2013, pp. 81–87."},"_id":"2270","type":"conference","author":[{"first_name":"Yoram","last_name":"Bachrach","full_name":"Bachrach, Yoram"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"},{"full_name":"Zadimoghaddam, Morteza","last_name":"Zadimoghaddam","first_name":"Morteza"}],"conference":{"name":"AAAI: Conference on Artificial Intelligence","start_date":"2013-07-14","end_date":"2013-07-18","location":"Bellevue, WA, United States"},"department":[{"_id":"VlKo"}],"day":"31","year":"2013","language":[{"iso":"eng"}],"title":"Optimal Coalition Structures in Cooperative Graph Games","arxiv":1,"status":"public","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1108.5248"}],"page":"81-87","external_id":{"arxiv":["1108.5248"]},"abstract":[{"lang":"eng","text":"Representation languages for coalitional games are a key research area in algorithmic game theory.   There is an inher-\r\nent tradeoff between how general a language is, allowing it to  capture  more  elaborate  games,  and  how  hard  it  is  computationally to optimize and solve such games.  One prominent  such  language  is  the  simple  yet  expressive\r\nWeighted Graph Games  (WGGs) representation (Deng  and Papadimitriou 1994), which maintains knowledge about synergies between agents in the form of an edge weighted graph. We  consider  the  problem  of  finding  the  optimal  coalition structure in WGGs. The agents in such games are vertices in a graph, and the value of a coalition is the sum of the weights of the edges present between coalition members. The optimal coalition structure is a partition of the agents to coalitions, that maximizes the sum of utilities obtained by the coalitions. We  show  that  finding  the  optimal  coalition  structure  is  not only hard for general graphs,  but is also intractable for restricted families such as planar graphs which are amenable for many other combinatorial problems.  We then provide algorithms with constant factor approximations for planar, minorfree and bounded degree graphs."}],"oa":1,"month":"12","date_published":"2013-12-31T00:00:00Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4674","date_updated":"2021-01-12T06:56:25Z","publisher":"AAAI Press"},{"abstract":[{"lang":"eng","text":"We consider Conditional Random Fields (CRFs) with pattern-based potentials defined on a chain. In this model the energy of a string (labeling) x1...xn is the sum of terms over intervals [i,j] where each term is non-zero only if the substring xi...xj equals a prespecified pattern α. Such CRFs can be naturally applied to many sequence tagging problems.\r\nWe present efficient algorithms for the three standard inference tasks in a CRF, namely computing (i) the partition function, (ii) marginals, and (iii) computing the MAP. Their complexities are respectively O(nL), O(nLℓmax) and O(nLmin{|D|,log(ℓmax+1)}) where L is the combined length of input patterns, ℓmax is the maximum length of a pattern, and D is the input alphabet. This improves on the previous algorithms of (Ye et al., 2009) whose complexities are respectively O(nL|D|), O(n|Γ|L2ℓ2max) and O(nL|D|), where |Γ| is the number of input patterns.\r\nIn addition, we give an efficient algorithm for sampling. Finally, we consider the case of non-positive weights. (Komodakis &amp; Paragios, 2009) gave an O(nL) algorithm for computing the MAP. We present a modification that has the same worst-case complexity but can beat it in the best case. "}],"oa":1,"page":"145 - 153","alternative_title":["JMLR"],"year":"2013","language":[{"iso":"eng"}],"intvolume":"        28","quality_controlled":"1","citation":{"ieee":"R. Takhanov and V. Kolmogorov, “Inference algorithms for pattern-based CRFs on sequence data,” in <i>ICML’13 Proceedings of the 30th International Conference on International</i>, Atlanta, GA, USA, 2013, vol. 28, no. 3, pp. 145–153.","ista":"Takhanov R, Kolmogorov V. 2013. Inference algorithms for pattern-based CRFs on sequence data. ICML’13 Proceedings of the 30th International Conference on International. ICML: International Conference on Machine Learning, JMLR, vol. 28, 145–153.","mla":"Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” <i>ICML’13 Proceedings of the 30th International Conference on International</i>, vol. 28, no. 3, ML Research Press, 2013, pp. 145–53.","apa":"Takhanov, R., &#38; Kolmogorov, V. (2013). Inference algorithms for pattern-based CRFs on sequence data. In <i>ICML’13 Proceedings of the 30th International Conference on International</i> (Vol. 28, pp. 145–153). Atlanta, GA, USA: ML Research Press.","chicago":"Takhanov, Rustem, and Vladimir Kolmogorov. “Inference Algorithms for Pattern-Based CRFs on Sequence Data.” In <i>ICML’13 Proceedings of the 30th International Conference on International</i>, 28:145–53. ML Research Press, 2013.","short":"R. Takhanov, V. Kolmogorov, in:, ICML’13 Proceedings of the 30th International Conference on International, ML Research Press, 2013, pp. 145–153.","ama":"Takhanov R, Kolmogorov V. Inference algorithms for pattern-based CRFs on sequence data. In: <i>ICML’13 Proceedings of the 30th International Conference on International</i>. Vol 28. ML Research Press; 2013:145-153."},"related_material":{"record":[{"relation":"later_version","id":"1794","status":"public"}]},"conference":{"location":"Atlanta, GA, USA","start_date":"2013-06-16","end_date":"2013-06-21","name":"ICML: International Conference on Machine Learning"},"date_published":"2013-06-01T00:00:00Z","month":"06","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4672","date_updated":"2023-10-17T09:51:32Z","publisher":"ML Research Press","main_file_link":[{"open_access":"1","url":"http://proceedings.mlr.press/v28/takhanov13.pdf?CFID=105472548&CFTOKEN=5c5859b5d97b4439-27B4AC58-BA92-A964-B598CAACEE6CC515"}],"scopus_import":"1","day":"01","volume":28,"title":"Inference algorithms for pattern-based CRFs on sequence data","status":"public","date_created":"2018-12-11T11:56:41Z","oa_version":"Submitted Version","publication":"ICML'13 Proceedings of the 30th International Conference on International","type":"conference","_id":"2272","article_processing_charge":"No","issue":"3","author":[{"full_name":"Takhanov, Rustem","first_name":"Rustem","id":"2CCAC26C-F248-11E8-B48F-1D18A9856A87","last_name":"Takhanov"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","last_name":"Kolmogorov","full_name":"Kolmogorov, Vladimir"}],"department":[{"_id":"VlKo"}]},{"day":"22","year":"2013","status":"public","title":"Reweighted message passing revisited","_id":"2273","type":"report","extern":0,"citation":{"apa":"Kolmogorov, V. (2013). <i>Reweighted message passing revisited</i>. IST Austria.","short":"V. Kolmogorov, Reweighted Message Passing Revisited, IST Austria, 2013.","chicago":"Kolmogorov, Vladimir. <i>Reweighted Message Passing Revisited</i>. IST Austria, 2013.","ista":"Kolmogorov V. 2013. Reweighted message passing revisited, IST Austria,p.","ieee":"V. Kolmogorov, <i>Reweighted message passing revisited</i>. IST Austria, 2013.","mla":"Kolmogorov, Vladimir. <i>Reweighted Message Passing Revisited</i>. IST Austria, 2013.","ama":"Kolmogorov V. <i>Reweighted Message Passing Revisited</i>. IST Austria; 2013."},"date_created":"2018-12-11T11:56:42Z","quality_controlled":0,"department":[{"_id":"VlKo"}],"author":[{"full_name":"Vladimir Kolmogorov","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"date_published":"2013-09-22T00:00:00Z","month":"09","oa":1,"abstract":[{"lang":"eng","text":"We propose a new family of message passing techniques for MAP estimation in graphical models which we call Sequential Reweighted Message Passing (SRMP). Special cases include well-known techniques such as Min-Sum Diusion (MSD) and a faster Sequential Tree-Reweighted Message Passing (TRW-S). Importantly, our derivation is simpler than the original derivation of TRW-S, and does not involve a  decomposition into trees. This allows easy generalizations. We present such a generalization for the case of higher-order graphical models, and test it on several real-world problems with promising results."}],"publisher":"IST Austria","publist_id":"4671","date_updated":"2019-01-24T13:07:32Z","publication_status":"published","main_file_link":[{"url":"http://arxiv.org/abs/1309.5655","open_access":"1"}]},{"department":[{"_id":"VlKo"},{"_id":"KrPi"}],"author":[{"full_name":"Dziembowski, Stefan","last_name":"Dziembowski","first_name":"Stefan"},{"full_name":"Faust, Sebastian","first_name":"Sebastian","last_name":"Faust"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir","full_name":"Kolmogorov, Vladimir"},{"full_name":"Pietrzak, Krzysztof Z","orcid":"0000-0002-9139-1654","first_name":"Krzysztof Z","id":"3E04A7AA-F248-11E8-B48F-1D18A9856A87","last_name":"Pietrzak"}],"related_material":{"record":[{"id":"1675","status":"public","relation":"later_version"}]},"file_date_updated":"2020-07-14T12:45:36Z","_id":"2274","type":"report","oa_version":"Published Version","date_created":"2018-12-11T11:56:42Z","pubrep_id":"671","citation":{"ama":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. <i>Proofs of Space</i>. IST Austria; 2013.","mla":"Dziembowski, Stefan, et al. <i>Proofs of Space</i>. IST Austria, 2013.","ieee":"S. Dziembowski, S. Faust, V. Kolmogorov, and K. Z. Pietrzak, <i>Proofs of Space</i>. IST Austria, 2013.","ista":"Dziembowski S, Faust S, Kolmogorov V, Pietrzak KZ. 2013. Proofs of Space, IST Austria,p.","short":"S. Dziembowski, S. Faust, V. Kolmogorov, K.Z. Pietrzak, Proofs of Space, IST Austria, 2013.","chicago":"Dziembowski, Stefan, Sebastian Faust, Vladimir Kolmogorov, and Krzysztof Z Pietrzak. <i>Proofs of Space</i>. IST Austria, 2013.","apa":"Dziembowski, S., Faust, S., Kolmogorov, V., &#38; Pietrzak, K. Z. (2013). <i>Proofs of Space</i>. IST Austria."},"status":"public","has_accepted_license":"1","title":"Proofs of Space","language":[{"iso":"eng"}],"day":"28","year":"2013","scopus_import":1,"date_updated":"2023-02-23T10:09:33Z","publist_id":"4670","publisher":"IST Austria","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","file":[{"file_id":"5197","access_level":"open_access","date_created":"2018-12-12T10:16:11Z","content_type":"application/pdf","file_name":"IST-2016-671-v1+1_796.pdf","relation":"main_file","file_size":405870,"checksum":"37b61637b62fc079d9141c59d9f1a94f","creator":"system","date_updated":"2020-07-14T12:45:36Z"}],"date_published":"2013-11-28T00:00:00Z","month":"11","abstract":[{"text":"Proofs of work (PoW) have been suggested by Dwork and Naor (Crypto'92) as protection to a shared resource. The basic idea is to ask the service requestor to dedicate some non-trivial amount of computational work to every request. The original applications included prevention of spam and protection against denial of service attacks. More recently, PoWs have been used to prevent double spending in the Bitcoin digital currency system.\r\n\r\nIn this work, we put forward an alternative concept for PoWs -- so-called proofs of space (PoS), where a service requestor must dedicate a significant amount of disk space as opposed to computation. We construct secure PoS schemes in the random oracle model, using graphs with high &quot;pebbling complexity&quot; and Merkle hash-trees. ","lang":"eng"}],"oa":1,"ddc":["530"]},{"publisher":"IEEE","publist_id":"4668","date_updated":"2021-01-12T06:56:28Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2013-12-01T00:00:00Z","month":"12","oa":1,"abstract":[{"text":"The problem of minimizing the Potts energy function frequently occurs in computer vision applications. One way to tackle this NP-hard problem was proposed by Kovtun [19, 20]. It identifies a part of an optimal solution by running k maxflow computations, where k is the number of labels. The number of “labeled” pixels can be significant in some applications, e.g. 50-93% in our tests for stereo. We show how to reduce the runtime to O (log k) maxflow computations (or one parametric maxflow computation). Furthermore, the output of our algorithm allows to speed-up the subsequent alpha expansion for the unlabeled part, or can be used as it is for time-critical applications. To derive our technique, we generalize the algorithm of Felzenszwalb et al. [7] for Tree Metrics . We also show a connection to k-submodular functions from combinatorial optimization, and discuss k-submodular relaxations for general energy functions.","lang":"eng"}],"external_id":{"arxiv":["1310.1771"]},"page":"2320 - 2327","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1310.1771"}],"status":"public","arxiv":1,"title":"Potts model, parametric maxflow and k-submodular functions","language":[{"iso":"eng"}],"day":"01","year":"2013","department":[{"_id":"JoCs"},{"_id":"VlKo"}],"conference":{"name":"ICCV: International Conference on Computer Vision","location":"Sydney, Australia","end_date":"2013-12-08","start_date":"2013-12-01"},"author":[{"id":"4B60654C-F248-11E8-B48F-1D18A9856A87","first_name":"Igor","last_name":"Gridchyn","full_name":"Gridchyn, Igor"},{"full_name":"Kolmogorov, Vladimir","first_name":"Vladimir","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"}],"type":"conference","_id":"2276","citation":{"apa":"Gridchyn, I., &#38; Kolmogorov, V. (2013). Potts model, parametric maxflow and k-submodular functions (pp. 2320–2327). Presented at the ICCV: International Conference on Computer Vision, Sydney, Australia: IEEE. <a href=\"https://doi.org/10.1109/ICCV.2013.288\">https://doi.org/10.1109/ICCV.2013.288</a>","short":"I. Gridchyn, V. Kolmogorov, in:, IEEE, 2013, pp. 2320–2327.","chicago":"Gridchyn, Igor, and Vladimir Kolmogorov. “Potts Model, Parametric Maxflow and k-Submodular Functions,” 2320–27. IEEE, 2013. <a href=\"https://doi.org/10.1109/ICCV.2013.288\">https://doi.org/10.1109/ICCV.2013.288</a>.","ieee":"I. Gridchyn and V. Kolmogorov, “Potts model, parametric maxflow and k-submodular functions,” presented at the ICCV: International Conference on Computer Vision, Sydney, Australia, 2013, pp. 2320–2327.","ista":"Gridchyn I, Kolmogorov V. 2013. Potts model, parametric maxflow and k-submodular functions. ICCV: International Conference on Computer Vision, 2320–2327.","mla":"Gridchyn, Igor, and Vladimir Kolmogorov. <i>Potts Model, Parametric Maxflow and k-Submodular Functions</i>. IEEE, 2013, pp. 2320–27, doi:<a href=\"https://doi.org/10.1109/ICCV.2013.288\">10.1109/ICCV.2013.288</a>.","ama":"Gridchyn I, Kolmogorov V. Potts model, parametric maxflow and k-submodular functions. In: IEEE; 2013:2320-2327. doi:<a href=\"https://doi.org/10.1109/ICCV.2013.288\">10.1109/ICCV.2013.288</a>"},"doi":"10.1109/ICCV.2013.288","date_created":"2018-12-11T11:56:43Z","quality_controlled":"1","oa_version":"Preprint"},{"oa":1,"ddc":["570"],"abstract":[{"text":"Redundancies and correlations in the responses of sensory neurons may seem to waste neural resources, but they can also carry cues about structured stimuli and may help the brain to correct for response errors. To investigate the effect of stimulus structure on redundancy in retina, we measured simultaneous responses from populations of retinal ganglion cells presented with natural and artificial stimuli that varied greatly in correlation structure; these stimuli and recordings are publicly available online. Responding to spatio-temporally structured stimuli such as natural movies, pairs of ganglion cells were modestly more correlated than in response to white noise checkerboards, but they were much less correlated than predicted by a non-adapting functional model of retinal response. Meanwhile, responding to stimuli with purely spatial correlations, pairs of ganglion cells showed increased correlations consistent with a static, non-adapting receptive field and nonlinearity. We found that in response to spatio-temporally correlated stimuli, ganglion cells had faster temporal kernels and tended to have stronger surrounds. These properties of individual cells, along with gain changes that opposed changes in effective contrast at the ganglion cell input, largely explained the pattern of pairwise correlations across stimuli where receptive field measurements were possible.","lang":"eng"}],"file":[{"file_size":3115568,"checksum":"46722afc4f7eabb0831165d9c1b171ad","creator":"system","date_updated":"2020-07-14T12:45:36Z","file_id":"5089","access_level":"open_access","date_created":"2018-12-12T10:14:36Z","content_type":"application/pdf","file_name":"IST-2016-410-v1+1_journal.pcbi.1003344.pdf","relation":"main_file"}],"citation":{"ama":"Simmons K, Prentice J, Tkačik G, et al. Transformation of stimulus correlations by the retina. <i>PLoS Computational Biology</i>. 2013;9(12). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">10.1371/journal.pcbi.1003344</a>","apa":"Simmons, K., Prentice, J., Tkačik, G., Homann, J., Yee, H., Palmer, S., … Balasubramanian, V. (2013). Transformation of stimulus correlations by the retina. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">https://doi.org/10.1371/journal.pcbi.1003344</a>","short":"K. Simmons, J. Prentice, G. Tkačik, J. Homann, H. Yee, S. Palmer, P. Nelson, V. Balasubramanian, PLoS Computational Biology 9 (2013).","chicago":"Simmons, Kristina, Jason Prentice, Gašper Tkačik, Jan Homann, Heather Yee, Stephanie Palmer, Philip Nelson, and Vijay Balasubramanian. “Transformation of Stimulus Correlations by the Retina.” <i>PLoS Computational Biology</i>. Public Library of Science, 2013. <a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">https://doi.org/10.1371/journal.pcbi.1003344</a>.","ista":"Simmons K, Prentice J, Tkačik G, Homann J, Yee H, Palmer S, Nelson P, Balasubramanian V. 2013. Transformation of stimulus correlations by the retina. PLoS Computational Biology. 9(12), e1003344.","ieee":"K. Simmons <i>et al.</i>, “Transformation of stimulus correlations by the retina,” <i>PLoS Computational Biology</i>, vol. 9, no. 12. Public Library of Science, 2013.","mla":"Simmons, Kristina, et al. “Transformation of Stimulus Correlations by the Retina.” <i>PLoS Computational Biology</i>, vol. 9, no. 12, e1003344, Public Library of Science, 2013, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1003344\">10.1371/journal.pcbi.1003344</a>."},"doi":"10.1371/journal.pcbi.1003344","quality_controlled":"1","related_material":{"record":[{"status":"public","id":"9752","relation":"research_data"}]},"year":"2013","language":[{"iso":"eng"}],"has_accepted_license":"1","intvolume":"         9","scopus_import":1,"month":"12","date_published":"2013-12-05T00:00:00Z","user_id":"3E5EF7F0-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Public Library of Science","publist_id":"4667","date_updated":"2023-02-23T14:07:04Z","date_created":"2018-12-11T11:56:43Z","oa_version":"Published Version","pubrep_id":"410","type":"journal_article","_id":"2277","issue":"12","publication":"PLoS Computational Biology","file_date_updated":"2020-07-14T12:45:36Z","author":[{"full_name":"Simmons, Kristina","last_name":"Simmons","first_name":"Kristina"},{"first_name":"Jason","last_name":"Prentice","full_name":"Prentice, Jason"},{"last_name":"Tkacik","first_name":"Gasper","id":"3D494DCA-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-6699-1455","full_name":"Tkacik, Gasper"},{"full_name":"Homann, Jan","last_name":"Homann","first_name":"Jan"},{"full_name":"Yee, Heather","last_name":"Yee","first_name":"Heather"},{"full_name":"Palmer, Stephanie","last_name":"Palmer","first_name":"Stephanie"},{"first_name":"Philip","last_name":"Nelson","full_name":"Nelson, Philip"},{"full_name":"Balasubramanian, Vijay","last_name":"Balasubramanian","first_name":"Vijay"}],"department":[{"_id":"GaTk"}],"day":"05","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":9,"title":"Transformation of stimulus correlations by the retina","article_number":"e1003344","status":"public"},{"publist_id":"4658","date_updated":"2021-01-12T06:56:29Z","publisher":"Company of Biologists","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_published":"2013-11-01T00:00:00Z","month":"11","abstract":[{"text":"It is firmly established that interactions between neurons and glia are fundamental across species for the correct establishment of a functional brain. Here, we found that the glia of the Drosophila larval brain display an essential non-autonomous role during the development of the optic lobe. The optic lobe develops from neuroepithelial cells that proliferate by dividing symmetrically until they switch to asymmetric/differentiative divisions that generate neuroblasts. The proneural gene lethal of scute (l9sc) is transiently activated by the epidermal growth factor receptor (EGFR)-Ras signal transduction pathway at the leading edge of a proneural wave that sweeps from medial to lateral neuroepithelium, promoting this switch. This process is tightly regulated by the tissue-autonomous function within the neuroepithelium of multiple signaling pathways, including EGFR-Ras and Notch. This study shows that the Notch ligand Serrate (Ser) is expressed in the glia and it forms a complex in vivo with Notch and Canoe, which colocalize at the adherens junctions of neuroepithelial cells. This complex is crucial for interactions between glia and neuroepithelial cells during optic lobe development. Ser is tissue-autonomously required in the glia where it activates Notch to regulate its proliferation, and non-autonomously in the neuroepithelium where Ser induces Notch signaling to avoid the premature activation of the EGFR-Ras pathway and hence of L9sc. Interestingly, different Notch activity reporters showed very different expression patterns in the glia and in the neuroepithelium, suggesting the existence of tissue-specific factors that promote the expression of particular Notch target genes or/and a reporter response dependent on different thresholds of Notch signaling.","lang":"eng"}],"scopus_import":1,"page":"4873 - 4884","intvolume":"       126","status":"public","volume":126,"title":"A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development","language":[{"iso":"eng"}],"day":"01","year":"2013","department":[{"_id":"CaHe"}],"author":[{"full_name":"Pérez Gómez, Raquel","first_name":"Raquel","last_name":"Pérez Gómez"},{"full_name":"Slovakova, Jana","id":"30F3F2F0-F248-11E8-B48F-1D18A9856A87","first_name":"Jana","last_name":"Slovakova"},{"full_name":"Rives Quinto, Noemí","first_name":"Noemí","last_name":"Rives Quinto"},{"first_name":"Alena","last_name":"Krejčí","full_name":"Krejčí, Alena"},{"full_name":"Carmena, Ana","first_name":"Ana","last_name":"Carmena"}],"publication":"Journal of Cell Science","type":"journal_article","_id":"2278","issue":"21","oa_version":"None","date_created":"2018-12-11T11:56:43Z","quality_controlled":"1","citation":{"ama":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. <i>Journal of Cell Science</i>. 2013;126(21):4873-4884. doi:<a href=\"https://doi.org/10.1242/jcs.125617\">10.1242/jcs.125617</a>","apa":"Pérez Gómez, R., Slovakova, J., Rives Quinto, N., Krejčí, A., &#38; Carmena, A. (2013). A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. <i>Journal of Cell Science</i>. Company of Biologists. <a href=\"https://doi.org/10.1242/jcs.125617\">https://doi.org/10.1242/jcs.125617</a>","short":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, A. Carmena, Journal of Cell Science 126 (2013) 4873–4884.","chicago":"Pérez Gómez, Raquel, Jana Slovakova, Noemí Rives Quinto, Alena Krejčí, and Ana Carmena. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” <i>Journal of Cell Science</i>. Company of Biologists, 2013. <a href=\"https://doi.org/10.1242/jcs.125617\">https://doi.org/10.1242/jcs.125617</a>.","ista":"Pérez Gómez R, Slovakova J, Rives Quinto N, Krejčí A, Carmena A. 2013. A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development. Journal of Cell Science. 126(21), 4873–4884.","ieee":"R. Pérez Gómez, J. Slovakova, N. Rives Quinto, A. Krejčí, and A. Carmena, “A serrate-notch-canoe complex mediates essential interactions between glia and neuroepithelial cells during Drosophila optic lobe development,” <i>Journal of Cell Science</i>, vol. 126, no. 21. Company of Biologists, pp. 4873–4884, 2013.","mla":"Pérez Gómez, Raquel, et al. “A Serrate-Notch-Canoe Complex Mediates Essential Interactions between Glia and Neuroepithelial Cells during Drosophila Optic Lobe Development.” <i>Journal of Cell Science</i>, vol. 126, no. 21, Company of Biologists, 2013, pp. 4873–84, doi:<a href=\"https://doi.org/10.1242/jcs.125617\">10.1242/jcs.125617</a>."},"doi":"10.1242/jcs.125617"},{"alternative_title":["LNCS"],"page":"118 - 132","abstract":[{"text":"We consider two-player games played on weighted directed graphs with mean-payoff and total-payoff objectives, two classical quantitative objectives. While for single-dimensional games the complexity and memory bounds for both objectives coincide, we show that in contrast to multi-dimensional mean-payoff games that are known to be coNP-complete, multi-dimensional total-payoff games are undecidable. We introduce conservative approximations of these objectives, where the payoff is considered over a local finite window sliding along a play, instead of the whole play. For single dimension, we show that (i) if the window size is polynomial, deciding the winner takes polynomial time, and (ii) the existence of a bounded window can be decided in NP ∩ coNP, and is at least as hard as solving mean-payoff games. For multiple dimensions, we show that (i) the problem with fixed window size is EXPTIME-complete, and (ii) there is no primitive-recursive algorithm to decide the existence of a bounded window.","lang":"eng"}],"oa":1,"quality_controlled":"1","ec_funded":1,"citation":{"apa":"Chatterjee, K., Doyen, L., Randour, M., &#38; Raskin, J. (2013). Looking at mean-payoff and total-payoff through windows. Presented at the ATVA: Automated Technology for Verification and Analysis, Hanoi, Vietnam: Springer. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>","short":"K. Chatterjee, L. Doyen, M. Randour, J. Raskin, 8172 (2013) 118–132.","chicago":"Chatterjee, Krishnendu, Laurent Doyen, Mickael Randour, and Jean Raskin. “Looking at Mean-Payoff and Total-Payoff through Windows.” Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">https://doi.org/10.1007/978-3-319-02444-8_10</a>.","ieee":"K. Chatterjee, L. Doyen, M. Randour, and J. Raskin, “Looking at mean-payoff and total-payoff through windows,” vol. 8172. Springer, pp. 118–132, 2013.","ista":"Chatterjee K, Doyen L, Randour M, Raskin J. 2013. Looking at mean-payoff and total-payoff through windows. 8172, 118–132.","mla":"Chatterjee, Krishnendu, et al. <i>Looking at Mean-Payoff and Total-Payoff through Windows</i>. Vol. 8172, Springer, 2013, pp. 118–32, doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>.","ama":"Chatterjee K, Doyen L, Randour M, Raskin J. Looking at mean-payoff and total-payoff through windows. 2013;8172:118-132. doi:<a href=\"https://doi.org/10.1007/978-3-319-02444-8_10\">10.1007/978-3-319-02444-8_10</a>"},"doi":"10.1007/978-3-319-02444-8_10","related_material":{"record":[{"status":"public","id":"523","relation":"later_version"}]},"acknowledgement":"279307; ERC; Fonds National de la Reserche Luxembourg;  279499; ERC; Fonds National de la Reserche Luxembourg","conference":{"location":"Hanoi, Vietnam","end_date":"2013-10-18","start_date":"2013-10-15","name":"ATVA: Automated Technology for Verification and Analysis"},"year":"2013","language":[{"iso":"eng"}],"intvolume":"      8172","main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1302.4248"}],"series_title":"Lecture Notes in Computer Science","scopus_import":1,"date_published":"2013-01-01T00:00:00Z","month":"01","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publist_id":"4656","date_updated":"2023-02-23T12:22:51Z","publisher":"Springer","oa_version":"Preprint","date_created":"2018-12-11T11:56:44Z","project":[{"call_identifier":"FP7","grant_number":"279307","name":"Quantitative Graph Games: Theory and Applications","_id":"2581B60A-B435-11E9-9278-68D0E5697425"}],"_id":"2279","type":"conference","author":[{"id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","first_name":"Krishnendu","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Doyen, Laurent","last_name":"Doyen","first_name":"Laurent"},{"full_name":"Randour, Mickael","first_name":"Mickael","last_name":"Randour"},{"full_name":"Raskin, Jean","last_name":"Raskin","first_name":"Jean"}],"department":[{"_id":"KrCh"}],"day":"01","title":"Looking at mean-payoff and total-payoff through windows","volume":8172,"status":"public"},{"date_created":"2018-12-11T11:56:44Z","oa_version":"Preprint","_id":"2280","issue":"4","type":"journal_article","publication":"SIAM Review","author":[{"id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","first_name":"Caroline","last_name":"Uhler","full_name":"Uhler, Caroline","orcid":"0000-0002-7008-0216"},{"full_name":"Wright, Stephen","first_name":"Stephen","last_name":"Wright"}],"department":[{"_id":"CaUh"}],"day":"07","volume":55,"title":"Packing ellipsoids with overlap","status":"public","main_file_link":[{"url":"http://arxiv.org/abs/1204.0235","open_access":"1"}],"scopus_import":1,"month":"11","date_published":"2013-11-07T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Society for Industrial and Applied Mathematics ","date_updated":"2021-01-12T06:56:30Z","publist_id":"4655","citation":{"ieee":"C. Uhler and S. Wright, “Packing ellipsoids with overlap,” <i>SIAM Review</i>, vol. 55, no. 4. Society for Industrial and Applied Mathematics , pp. 671–706, 2013.","ista":"Uhler C, Wright S. 2013. Packing ellipsoids with overlap. SIAM Review. 55(4), 671–706.","mla":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>, vol. 55, no. 4, Society for Industrial and Applied Mathematics , 2013, pp. 671–706, doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>.","apa":"Uhler, C., &#38; Wright, S. (2013). Packing ellipsoids with overlap. <i>SIAM Review</i>. Society for Industrial and Applied Mathematics . <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>","short":"C. Uhler, S. Wright, SIAM Review 55 (2013) 671–706.","chicago":"Uhler, Caroline, and Stephen Wright. “Packing Ellipsoids with Overlap.” <i>SIAM Review</i>. Society for Industrial and Applied Mathematics , 2013. <a href=\"https://doi.org/10.1137/120872309\">https://doi.org/10.1137/120872309</a>.","ama":"Uhler C, Wright S. Packing ellipsoids with overlap. <i>SIAM Review</i>. 2013;55(4):671-706. doi:<a href=\"https://doi.org/10.1137/120872309\">10.1137/120872309</a>"},"doi":"10.1137/120872309","quality_controlled":"1","year":"2013","language":[{"iso":"eng"}],"arxiv":1,"intvolume":"        55","page":"671 - 706","external_id":{"arxiv":["1204.0235"]},"oa":1,"abstract":[{"lang":"eng","text":"The problem of packing ellipsoids of different sizes and shapes into an ellipsoidal container so as to minimize a measure of overlap between ellipsoids is considered. A bilevel optimization formulation is given, together with an algorithm for the general case and a simpler algorithm for the special case in which all ellipsoids are in fact spheres. Convergence results are proved and computational experience is described and illustrated. The motivating application-chromosome organization in the human cell nucleus-is discussed briefly, and some illustrative results are presented."}]},{"main_file_link":[{"url":"http://hal.upmc.fr/hal-00983313/","open_access":"1"}],"scopus_import":1,"month":"11","date_published":"2013-11-10T00:00:00Z","publisher":"Nature Publishing Group","publist_id":"4652","date_updated":"2023-02-21T17:02:44Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","_id":"2282","type":"journal_article","publication":"Nature Cell Biology","project":[{"_id":"252ABD0A-B435-11E9-9278-68D0E5697425","name":"Control of Epithelial Cell Layer Spreading in Zebrafish","grant_number":"I 930-B20","call_identifier":"FWF"}],"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:45Z","department":[{"_id":"CaHe"}],"acknowledged_ssus":[{"_id":"PreCl"},{"_id":"Bio"}],"author":[{"orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro","first_name":"Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","last_name":"Campinho"},{"full_name":"Behrndt, Martin","id":"3ECECA3A-F248-11E8-B48F-1D18A9856A87","first_name":"Martin","last_name":"Behrndt"},{"full_name":"Ranft, Jonas","last_name":"Ranft","first_name":"Jonas"},{"last_name":"Risler","first_name":"Thomas","full_name":"Risler, Thomas"},{"first_name":"Nicolas","last_name":"Minc","full_name":"Minc, Nicolas"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","first_name":"Carl-Philipp J","id":"39427864-F248-11E8-B48F-1D18A9856A87"}],"day":"10","status":"public","volume":15,"title":"Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly","page":"1405 - 1414","oa":1,"abstract":[{"text":"Epithelial spreading is a common and fundamental aspect of various developmental and disease-related processes such as epithelial closure and wound healing. A key challenge for epithelial tissues undergoing spreading is to increase their surface area without disrupting epithelial integrity. Here we show that orienting cell divisions by tension constitutes an efficient mechanism by which the enveloping cell layer (EVL) releases anisotropic tension while undergoing spreading during zebrafish epiboly. The control of EVL cell-division orientation by tension involves cell elongation and requires myosin II activity to align the mitotic spindle with the main tension axis. We also found that in the absence of tension-oriented cell divisions and in the presence of increased tissue tension, EVL cells undergo ectopic fusions, suggesting that the reduction of tension anisotropy by oriented cell divisions is required to prevent EVL cells from fusing. We conclude that cell-division orientation by tension constitutes a key mechanism for limiting tension anisotropy and thus promoting tissue spreading during EVL epiboly.","lang":"eng"}],"citation":{"ama":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. <i>Nature Cell Biology</i>. 2013;15:1405-1414. doi:<a href=\"https://doi.org/10.1038/ncb2869\">10.1038/ncb2869</a>","mla":"Campinho, Pedro, et al. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” <i>Nature Cell Biology</i>, vol. 15, Nature Publishing Group, 2013, pp. 1405–14, doi:<a href=\"https://doi.org/10.1038/ncb2869\">10.1038/ncb2869</a>.","ieee":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, and C.-P. J. Heisenberg, “Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly,” <i>Nature Cell Biology</i>, vol. 15. Nature Publishing Group, pp. 1405–1414, 2013.","ista":"Campinho P, Behrndt M, Ranft J, Risler T, Minc N, Heisenberg C-PJ. 2013. Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. Nature Cell Biology. 15, 1405–1414.","chicago":"Campinho, Pedro, Martin Behrndt, Jonas Ranft, Thomas Risler, Nicolas Minc, and Carl-Philipp J Heisenberg. “Tension-Oriented Cell Divisions Limit Anisotropic Tissue Tension in Epithelial Spreading during Zebrafish Epiboly.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2013. <a href=\"https://doi.org/10.1038/ncb2869\">https://doi.org/10.1038/ncb2869</a>.","short":"P. Campinho, M. Behrndt, J. Ranft, T. Risler, N. Minc, C.-P.J. Heisenberg, Nature Cell Biology 15 (2013) 1405–1414.","apa":"Campinho, P., Behrndt, M., Ranft, J., Risler, T., Minc, N., &#38; Heisenberg, C.-P. J. (2013). Tension-oriented cell divisions limit anisotropic tissue tension in epithelial spreading during zebrafish epiboly. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb2869\">https://doi.org/10.1038/ncb2869</a>"},"doi":"10.1038/ncb2869","quality_controlled":"1","acknowledgement":"This work was supported by the IST Austria and MPI-CBG ","related_material":{"record":[{"status":"public","id":"1403","relation":"dissertation_contains"}]},"language":[{"iso":"eng"}],"year":"2013","intvolume":"        15"},{"day":"14","year":"2013","language":[{"iso":"eng"}],"title":"Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ","volume":100,"status":"public","intvolume":"       100","citation":{"ama":"Pull C, Hughes W, Brown M. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . <i>Naturwissenschaften</i>. 2013;100(12):1125-1136. doi:<a href=\"https://doi.org/10.1007/s00114-013-1115-5\">10.1007/s00114-013-1115-5</a>","ista":"Pull C, Hughes W, Brown M. 2013. Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . Naturwissenschaften. 100(12), 1125–1136.","ieee":"C. Pull, W. Hughes, and M. Brown, “Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger ,” <i>Naturwissenschaften</i>, vol. 100, no. 12. Springer, pp. 1125–1136, 2013.","mla":"Pull, Christopher, et al. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” <i>Naturwissenschaften</i>, vol. 100, no. 12, Springer, 2013, pp. 1125–36, doi:<a href=\"https://doi.org/10.1007/s00114-013-1115-5\">10.1007/s00114-013-1115-5</a>.","apa":"Pull, C., Hughes, W., &#38; Brown, M. (2013). Tolerating an infection: an indirect benefit of co-founding queen associations in the ant Lasius niger . <i>Naturwissenschaften</i>. Springer. <a href=\"https://doi.org/10.1007/s00114-013-1115-5\">https://doi.org/10.1007/s00114-013-1115-5</a>","short":"C. Pull, W. Hughes, M. Brown, Naturwissenschaften 100 (2013) 1125–1136.","chicago":"Pull, Christopher, William Hughes, and Markus Brown. “Tolerating an Infection: An Indirect Benefit of Co-Founding Queen Associations in the Ant Lasius Niger .” <i>Naturwissenschaften</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00114-013-1115-5\">https://doi.org/10.1007/s00114-013-1115-5</a>."},"doi":"10.1007/s00114-013-1115-5","oa_version":"None","date_created":"2018-12-11T11:56:45Z","quality_controlled":"1","issue":"12","_id":"2283","type":"journal_article","publication":"Naturwissenschaften","author":[{"first_name":"Christopher","id":"3C7F4840-F248-11E8-B48F-1D18A9856A87","last_name":"Pull","full_name":"Pull, Christopher","orcid":"0000-0003-1122-3982"},{"last_name":"Hughes","first_name":"William","full_name":"Hughes, William"},{"last_name":"Brown","first_name":"Markus","id":"3DAB9AFC-F248-11E8-B48F-1D18A9856A87","full_name":"Brown, Markus"}],"department":[{"_id":"SyCr"}],"abstract":[{"text":"Pathogens exert a strong selection pressure on organisms to evolve effective immune defences. In addition to individual immunity, social organisms can act cooperatively to produce collective defences. In many ant species, queens have the option to found a colony alone or in groups with other, often unrelated, conspecifics. These associations are transient, usually lasting only as long as each queen benefits from the presence of others. In fact, once the first workers emerge, queens fight to the death for dominance. One potential advantage of co-founding may be that queens benefit from collective disease defences, such as mutual grooming, that act against common soil pathogens. We test this hypothesis by exposing single and co-founding queens to a fungal parasite, in order to assess whether queens in co-founding associations have improved survival. Surprisingly, co-foundresses exposed to the entomopathogenic fungus Metarhizium did not engage in cooperative disease defences, and consequently, we find no direct benefit of multiple queens on survival. However, an indirect benefit was observed, with parasite-exposed queens producing more brood when they co-founded, than when they were alone. We suggest this is due to a trade-off between reproduction and immunity. Additionally, we report an extraordinary ability of the queens to tolerate an infection for long periods after parasite exposure. Our study suggests that there are no social immunity benefits for co-founding ant queens, but that in parasite-rich environments, the presence of additional queens may nevertheless improve the chances of colony founding success.","lang":"eng"}],"date_published":"2013-11-14T00:00:00Z","month":"11","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Springer","date_updated":"2021-01-12T06:56:31Z","publist_id":"4649","page":"1125  - 1136","scopus_import":1},{"scopus_import":1,"publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","date_updated":"2023-02-23T14:07:06Z","publist_id":"4647","publisher":"BioMed Central","month":"10","date_published":"2013-10-14T00:00:00Z","author":[{"first_name":"Simon","id":"35A7A418-F248-11E8-B48F-1D18A9856A87","last_name":"Tragust","full_name":"Tragust, Simon"},{"id":"3DC97C8E-F248-11E8-B48F-1D18A9856A87","first_name":"Line V","last_name":"Ugelvig","full_name":"Ugelvig, Line V","orcid":"0000-0003-1832-8883"},{"full_name":"Chapuisat, Michel","last_name":"Chapuisat","first_name":"Michel"},{"first_name":"Jürgen","last_name":"Heinze","full_name":"Heinze, Jürgen"},{"last_name":"Cremer","first_name":"Sylvia","id":"2F64EC8C-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-2193-3868","full_name":"Cremer, Sylvia"}],"department":[{"_id":"SyCr"}],"date_created":"2018-12-11T11:56:46Z","oa_version":"Published Version","pubrep_id":"402","project":[{"grant_number":"243071","call_identifier":"FP7","_id":"25DC711C-B435-11E9-9278-68D0E5697425","name":"Social Vaccination in Ant Colonies: from Individual Mechanisms to Society Effects"},{"_id":"25DAF0B2-B435-11E9-9278-68D0E5697425","name":"Host-Parasite Coevolution","grant_number":"CR-118/3-1"}],"file_date_updated":"2020-07-14T12:45:37Z","publication":"BMC Evolutionary Biology","_id":"2284","issue":"1","type":"journal_article","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":13,"title":"Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies","status":"public","article_number":"225","day":"14","abstract":[{"text":"Background: The brood of ants and other social insects is highly susceptible to pathogens, particularly those that penetrate the soft larval and pupal cuticle. We here test whether the presence of a pupal cocoon, which occurs in some ant species but not in others, affects the sanitary brood care and fungal infection patterns after exposure to the entomopathogenic fungus Metarhizium brunneum. We use a) a comparative approach analysing four species with either naked or cocooned pupae and b) a within-species analysis of a single ant species, in which both pupal types co-exist in the same colony. Results: We found that the presence of a cocoon did not compromise fungal pathogen detection by the ants and that species with cocooned pupae increased brood grooming after pathogen exposure. All tested ant species further removed brood from their nests, which was predominantly expressed towards larvae and naked pupae treated with the live fungal pathogen. In contrast, cocooned pupae exposed to live fungus were not removed at higher rates than cocooned pupae exposed to dead fungus or a sham control. Consistent with this, exposure to the live fungus caused high numbers of infections and fungal outgrowth in larvae and naked pupae, but not in cocooned pupae. Moreover, the ants consistently removed the brood prior to fungal outgrowth, ensuring a clean brood chamber. Conclusion: Our study suggests that the pupal cocoon has a protective effect against fungal infection, causing an adaptive change in sanitary behaviours by the ants. It further demonstrates that brood removal-originally described for honeybees as &quot;hygienic behaviour&quot;-is a widespread sanitary behaviour in ants, which likely has important implications on disease dynamics in social insect colonies.","lang":"eng"}],"oa":1,"ddc":["570"],"file":[{"file_id":"5026","access_level":"open_access","date_created":"2018-12-12T10:13:41Z","content_type":"application/pdf","relation":"main_file","file_name":"IST-2016-402-v1+1_1471-2148-13-225.pdf","file_size":281736,"checksum":"c16ef36f2a10786a7885e19c4528d707","creator":"system","date_updated":"2020-07-14T12:45:37Z"}],"related_material":{"record":[{"relation":"research_data","status":"public","id":"9753"}]},"acknowledgement":"The study was funded by the European Research Council (Marie Curie ERG 036569) and Marie Curie IEF 302204 to LVU\r\nCC BY 2.0\r\n","quality_controlled":"1","ec_funded":1,"doi":"10.1186/1471-2148-13-225","citation":{"short":"S. Tragust, L.V. Ugelvig, M. Chapuisat, J. Heinze, S. Cremer, BMC Evolutionary Biology 13 (2013).","chicago":"Tragust, Simon, Line V Ugelvig, Michel Chapuisat, Jürgen Heinze, and Sylvia Cremer. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>. BioMed Central, 2013. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>.","apa":"Tragust, S., Ugelvig, L. V., Chapuisat, M., Heinze, J., &#38; Cremer, S. (2013). Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. BioMed Central. <a href=\"https://doi.org/10.1186/1471-2148-13-225\">https://doi.org/10.1186/1471-2148-13-225</a>","mla":"Tragust, Simon, et al. “Pupal Cocoons Affect Sanitary Brood Care and Limit Fungal Infections in Ant Colonies.” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1, 225, BioMed Central, 2013, doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>.","ieee":"S. Tragust, L. V. Ugelvig, M. Chapuisat, J. Heinze, and S. Cremer, “Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies,” <i>BMC Evolutionary Biology</i>, vol. 13, no. 1. BioMed Central, 2013.","ista":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. 2013. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. BMC Evolutionary Biology. 13(1), 225.","ama":"Tragust S, Ugelvig LV, Chapuisat M, Heinze J, Cremer S. Pupal cocoons affect sanitary brood care and limit fungal infections in ant colonies. <i>BMC Evolutionary Biology</i>. 2013;13(1). doi:<a href=\"https://doi.org/10.1186/1471-2148-13-225\">10.1186/1471-2148-13-225</a>"},"has_accepted_license":"1","intvolume":"        13","year":"2013","language":[{"iso":"eng"}]},{"status":"public","title":"The force and effect of cell proliferation","volume":32,"day":"04","department":[{"_id":"CaHe"}],"author":[{"last_name":"Campinho","first_name":"Pedro","id":"3AFBBC42-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8526-5416","full_name":"Campinho, Pedro"},{"orcid":"0000-0002-0912-4566","full_name":"Heisenberg, Carl-Philipp J","last_name":"Heisenberg","id":"39427864-F248-11E8-B48F-1D18A9856A87","first_name":"Carl-Philipp J"}],"publication":"EMBO Journal","issue":"21","_id":"2286","type":"journal_article","date_created":"2018-12-11T11:56:46Z","oa_version":"Submitted Version","publist_id":"4645","date_updated":"2021-01-12T06:56:32Z","publisher":"Wiley-Blackwell","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"10","date_published":"2013-10-04T00:00:00Z","scopus_import":1,"main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3817470/","open_access":"1"}],"intvolume":"        32","pmid":1,"language":[{"iso":"eng"}],"year":"2013","quality_controlled":"1","citation":{"chicago":"Campinho, Pedro, and Carl-Philipp J Heisenberg. “The Force and Effect of Cell Proliferation.” <i>EMBO Journal</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1038/emboj.2013.225\">https://doi.org/10.1038/emboj.2013.225</a>.","short":"P. Campinho, C.-P.J. Heisenberg, EMBO Journal 32 (2013) 2783–2784.","apa":"Campinho, P., &#38; Heisenberg, C.-P. J. (2013). The force and effect of cell proliferation. <i>EMBO Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1038/emboj.2013.225\">https://doi.org/10.1038/emboj.2013.225</a>","mla":"Campinho, Pedro, and Carl-Philipp J. Heisenberg. “The Force and Effect of Cell Proliferation.” <i>EMBO Journal</i>, vol. 32, no. 21, Wiley-Blackwell, 2013, pp. 2783–84, doi:<a href=\"https://doi.org/10.1038/emboj.2013.225\">10.1038/emboj.2013.225</a>.","ieee":"P. Campinho and C.-P. J. Heisenberg, “The force and effect of cell proliferation,” <i>EMBO Journal</i>, vol. 32, no. 21. Wiley-Blackwell, pp. 2783–2784, 2013.","ista":"Campinho P, Heisenberg C-PJ. 2013. The force and effect of cell proliferation. EMBO Journal. 32(21), 2783–2784.","ama":"Campinho P, Heisenberg C-PJ. The force and effect of cell proliferation. <i>EMBO Journal</i>. 2013;32(21):2783-2784. doi:<a href=\"https://doi.org/10.1038/emboj.2013.225\">10.1038/emboj.2013.225</a>"},"doi":"10.1038/emboj.2013.225","abstract":[{"lang":"eng","text":"The spatiotemporal control of cell divisions is a key factor in epithelial morphogenesis and patterning. Mao et al (2013) now describe how differential rates of proliferation within the Drosophila wing disc epithelium give rise to anisotropic tissue tension in peripheral/proximal regions of the disc. Such global tissue tension anisotropy in turn determines the orientation of cell divisions by controlling epithelial cell elongation."}],"oa":1,"external_id":{"pmid":["24097062"]},"page":"2783 - 2784"},{"scopus_import":1,"publisher":"Wiley-Blackwell","date_updated":"2021-01-12T06:56:32Z","publist_id":"4644","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","date_published":"2013-03-01T00:00:00Z","month":"03","department":[{"_id":"NiBa"}],"author":[{"full_name":"Pickup, Melinda","orcid":"0000-0001-6118-0541","first_name":"Melinda","id":"2C78037E-F248-11E8-B48F-1D18A9856A87","last_name":"Pickup"},{"full_name":"Barrett, Spencer","last_name":"Barrett","first_name":"Spencer"}],"issue":"3","_id":"2287","type":"journal_article","publication":"Ecology and Evolution","file_date_updated":"2020-07-14T12:45:37Z","oa_version":"Published Version","pubrep_id":"416","date_created":"2018-12-11T11:56:47Z","status":"public","title":"The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":3,"day":"01","page":"629 - 639","file":[{"content_type":"application/pdf","file_name":"IST-2016-416-v1+1_Pickup_et_al-2013-Ecology_and_Evolution.pdf","relation":"main_file","file_id":"5290","access_level":"open_access","date_created":"2018-12-12T10:17:35Z","date_updated":"2020-07-14T12:45:37Z","checksum":"b5531bab4c0dec396bf5c8497fe178bf","file_size":626949,"creator":"system"}],"oa":1,"ddc":["576"],"abstract":[{"text":"Negative frequency-dependent selection should result in equal sex ratios in large populations of dioecious flowering plants, but deviations from equality are commonly reported. A variety of ecological and genetic factors can explain biased sex ratios, although the mechanisms involved are not well understood. Most dioecious species are long-lived and/or clonal complicating efforts to identify stages during the life cycle when biases develop. We investigated the demographic correlates of sex-ratio variation in two chromosome races of Rumex hastatulus, an annual, wind-pollinated colonizer of open habitats from the southern USA. We examined sex ratios in 46 populations and evaluated the hypothesis that the proximity of males in the local mating environment, through its influence on gametophytic selection, is the primary cause of female-biased sex ratios. Female-biased sex ratios characterized most populations of R.  hastatulus (mean sex ratio = 0.62), with significant female bias in 89% of populations. Large, high-density populations had the highest proportion of females, whereas smaller, low-density populations had sex ratios closer to equality. Progeny sex ratios were more female biased when males were in closer proximity to females, a result consistent with the gametophytic selection hypothesis. Our results suggest that interactions between demographic and genetic factors are probably the main cause of female-biased sex ratios in R. hastatulus. The annual life cycle of this species may limit the scope for selection against males and may account for the weaker degree of bias in comparison with perennial Rumex species.","lang":"eng"}],"citation":{"ama":"Pickup M, Barrett S. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. <i>Ecology and Evolution</i>. 2013;3(3):629-639. doi:<a href=\"https://doi.org/10.1002/ece3.465\">10.1002/ece3.465</a>","mla":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” <i>Ecology and Evolution</i>, vol. 3, no. 3, Wiley-Blackwell, 2013, pp. 629–39, doi:<a href=\"https://doi.org/10.1002/ece3.465\">10.1002/ece3.465</a>.","ista":"Pickup M, Barrett S. 2013. The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. Ecology and Evolution. 3(3), 629–639.","ieee":"M. Pickup and S. Barrett, “The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant,” <i>Ecology and Evolution</i>, vol. 3, no. 3. Wiley-Blackwell, pp. 629–639, 2013.","chicago":"Pickup, Melinda, and Spencer Barrett. “The Influence of Demography and Local Mating Environment on Sex Ratios in a Wind-Pollinated Dioecious Plant.” <i>Ecology and Evolution</i>. Wiley-Blackwell, 2013. <a href=\"https://doi.org/10.1002/ece3.465\">https://doi.org/10.1002/ece3.465</a>.","short":"M. Pickup, S. Barrett, Ecology and Evolution 3 (2013) 629–639.","apa":"Pickup, M., &#38; Barrett, S. (2013). The influence of demography and local mating environment on sex ratios in a wind-pollinated dioecious plant. <i>Ecology and Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1002/ece3.465\">https://doi.org/10.1002/ece3.465</a>"},"doi":"10.1002/ece3.465","quality_controlled":"1","intvolume":"         3","has_accepted_license":"1","language":[{"iso":"eng"}],"year":"2013"},{"editor":[{"id":"335E5684-F248-11E8-B48F-1D18A9856A87","first_name":"Ashutosh","last_name":"Gupta","full_name":"Gupta, Ashutosh"},{"id":"40876CD8-F248-11E8-B48F-1D18A9856A87","first_name":"Thomas A","last_name":"Henzinger","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"alternative_title":["LNCS"],"month":"07","date_published":"2013-07-01T00:00:00Z","abstract":[{"lang":"eng","text":"This book constitutes the proceedings of the 11th International Conference on Computational Methods in Systems Biology, CMSB 2013, held in Klosterneuburg, Austria, in September 2013. The 15 regular papers included in this volume were carefully reviewed and selected from 27 submissions. They deal with computational models for all levels, from molecular and cellular, to organs and entire organisms."}],"publist_id":"4643","date_updated":"2019-08-02T12:37:44Z","publisher":"Springer","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","_id":"2288","type":"conference_editor","oa_version":"None","date_created":"2018-12-11T11:56:47Z","quality_controlled":"1","citation":{"ieee":"A. Gupta and T. A. Henzinger, Eds., <i>Computational Methods in Systems Biology</i>, vol. 8130. Springer, 2013.","ista":"Gupta A, Henzinger TA eds. 2013. Computational Methods in Systems Biology, Springer,p.","mla":"Gupta, Ashutosh, and Thomas A. Henzinger, editors. <i>Computational Methods in Systems Biology</i>. Vol. 8130, Springer, 2013, doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>.","apa":"Gupta, A., &#38; Henzinger, T. A. (Eds.). (2013). <i>Computational Methods in Systems Biology</i> (Vol. 8130). Presented at the CMSB: Computational Methods in Systems Biology, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>","chicago":"Gupta, Ashutosh, and Thomas A Henzinger, eds. <i>Computational Methods in Systems Biology</i>. Vol. 8130. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40708-6\">https://doi.org/10.1007/978-3-642-40708-6</a>.","short":"A. Gupta, T.A. Henzinger, eds., Computational Methods in Systems Biology, Springer, 2013.","ama":"Gupta A, Henzinger TA, eds. <i>Computational Methods in Systems Biology</i>. Vol 8130. Springer; 2013. doi:<a href=\"https://doi.org/10.1007/978-3-642-40708-6\">10.1007/978-3-642-40708-6</a>"},"doi":"10.1007/978-3-642-40708-6","department":[{"_id":"ToHe"}],"conference":{"name":"CMSB: Computational Methods in Systems Biology","end_date":"2013-09-24","start_date":"2013-09-22","location":"Klosterneuburg, Austria"},"publication_identifier":{"isbn":["978-3-642-40707-9"]},"language":[{"iso":"eng"}],"year":"2013","day":"01","intvolume":"      8130","status":"public","volume":8130,"title":"Computational Methods in Systems Biology"},{"ddc":["000"],"oa":1,"abstract":[{"lang":"eng","text":"Formal verification aims to improve the quality of software by detecting errors before they do harm. At the basis of formal verification is the logical notion of correctness, which purports to capture whether or not a program behaves as desired. We suggest that the boolean partition of software into correct and incorrect programs falls short of the practical need to assess the behavior of software in a more nuanced fashion against multiple criteria. We therefore propose to introduce quantitative fitness measures for programs, specifically for measuring the function, performance, and robustness of reactive programs such as concurrent processes. This article describes the goals of the ERC Advanced Investigator Project QUAREM. The project aims to build and evaluate a theory of quantitative fitness measures for reactive models. Such a theory must strive to obtain quantitative generalizations of the paradigms that have been success stories in qualitative reactive modeling, such as compositionality, property-preserving abstraction and abstraction refinement, model checking, and synthesis. The theory will be evaluated not only in the context of software and hardware engineering, but also in the context of systems biology. In particular, we will use the quantitative reactive models and fitness measures developed in this project for testing hypotheses about the mechanisms behind data from biological experiments."}],"file":[{"date_updated":"2020-07-14T12:45:37Z","creator":"system","checksum":"f117a00f9f046165bfa95595681e08a0","file_size":570361,"relation":"main_file","file_name":"IST-2016-626-v1+1_s00450-013-0251-7.pdf","content_type":"application/pdf","access_level":"open_access","date_created":"2018-12-12T10:17:51Z","file_id":"5308"}],"page":"331 - 344","year":"2013","language":[{"iso":"eng"}],"has_accepted_license":"1","intvolume":"        28","doi":"10.1007/s00450-013-0251-7","citation":{"apa":"Henzinger, T. A. (2013). Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. Springer. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>","chicago":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>. Springer, 2013. <a href=\"https://doi.org/10.1007/s00450-013-0251-7\">https://doi.org/10.1007/s00450-013-0251-7</a>.","short":"T.A. Henzinger, Computer Science Research and Development 28 (2013) 331–344.","ista":"Henzinger TA. 2013. Quantitative reactive modeling and verification. Computer Science Research and Development. 28(4), 331–344.","ieee":"T. A. Henzinger, “Quantitative reactive modeling and verification,” <i>Computer Science Research and Development</i>, vol. 28, no. 4. Springer, pp. 331–344, 2013.","mla":"Henzinger, Thomas A. “Quantitative Reactive Modeling and Verification.” <i>Computer Science Research and Development</i>, vol. 28, no. 4, Springer, 2013, pp. 331–44, doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>.","ama":"Henzinger TA. Quantitative reactive modeling and verification. <i>Computer Science Research and Development</i>. 2013;28(4):331-344. doi:<a href=\"https://doi.org/10.1007/s00450-013-0251-7\">10.1007/s00450-013-0251-7</a>"},"quality_controlled":"1","ec_funded":1,"month":"10","date_published":"2013-10-05T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Springer","publist_id":"4642","date_updated":"2021-01-12T06:56:33Z","scopus_import":1,"day":"05","tmp":{"image":"/images/cc_by.png","short":"CC BY (4.0)","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode"},"volume":28,"title":"Quantitative reactive modeling and verification","status":"public","project":[{"_id":"25EE3708-B435-11E9-9278-68D0E5697425","name":"Quantitative Reactive Modeling","call_identifier":"FP7","grant_number":"267989"}],"oa_version":"Published Version","date_created":"2018-12-11T11:56:47Z","pubrep_id":"626","issue":"4","_id":"2289","type":"journal_article","file_date_updated":"2020-07-14T12:45:37Z","publication":"Computer Science Research and Development","author":[{"last_name":"Henzinger","first_name":"Thomas A","id":"40876CD8-F248-11E8-B48F-1D18A9856A87","orcid":"0000−0002−2985−7724","full_name":"Henzinger, Thomas A"}],"department":[{"_id":"ToHe"}]},{"page":"16259 - 16264","external_id":{"pmid":["24043780"]},"oa":1,"abstract":[{"text":"The plant hormone indole-acetic acid (auxin) is essential for many aspects of plant development. Auxin-mediated growth regulation typically involves the establishment of an auxin concentration gradient mediated by polarly localized auxin transporters. The localization of auxin carriers and their amount at the plasma membrane are controlled by membrane trafficking processes such as secretion, endocytosis, and recycling. In contrast to endocytosis or recycling, how the secretory pathway mediates the localization of auxin carriers is not well understood. In this study we have used the differential cell elongation process during apical hook development to elucidate the mechanisms underlying the post-Golgi trafficking of auxin carriers in Arabidopsis. We show that differential cell elongation during apical hook development is defective in Arabidopsis mutant echidna (ech). ECH protein is required for the trans-Golgi network (TGN)-mediated trafficking of the auxin influx carrier AUX1 to the plasma membrane. In contrast, ech mutation only marginally perturbs the trafficking of the highly related auxin influx carrier LIKE-AUX1-3 or the auxin efflux carrier PIN-FORMED-3, both also involved in hook development. Electron tomography reveals that the trafficking defects in ech mutant are associated with the perturbation of secretory vesicle genesis from the TGN. Our results identify differential mechanisms for the post-Golgi trafficking of de novo-synthesized auxin carriers to plasma membrane from the TGN and reveal how trafficking of auxin influx carriers mediates the control of differential cell elongation in apical hook development.","lang":"eng"}],"citation":{"ama":"Boutté Y, Jonsson K, Mcfarlane H, et al. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. 2013;110(40):16259-16264. doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>","mla":"Boutté, Yohann, et al. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>, vol. 110, no. 40, National Academy of Sciences, 2013, pp. 16259–64, doi:<a href=\"https://doi.org/10.1073/pnas.1309057110\">10.1073/pnas.1309057110</a>.","ieee":"Y. Boutté <i>et al.</i>, “ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation,” <i>PNAS</i>, vol. 110, no. 40. National Academy of Sciences, pp. 16259–16264, 2013.","ista":"Boutté Y, Jonsson K, Mcfarlane H, Johnson E, Gendre D, Swarup R, Friml J, Samuels L, Robert S, Bhalerao R. 2013. ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. PNAS. 110(40), 16259–16264.","short":"Y. Boutté, K. Jonsson, H. Mcfarlane, E. Johnson, D. Gendre, R. Swarup, J. Friml, L. Samuels, S. Robert, R. Bhalerao, PNAS 110 (2013) 16259–16264.","chicago":"Boutté, Yohann, Kristoffer Jonsson, Heather Mcfarlane, Errin Johnson, Delphine Gendre, Ranjan Swarup, Jiří Friml, Lacey Samuels, Stéphanie Robert, and Rishikesh Bhalerao. “ECHIDNA Mediated Post Golgi Trafficking of Auxin Carriers for Differential Cell Elongation.” <i>PNAS</i>. National Academy of Sciences, 2013. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>.","apa":"Boutté, Y., Jonsson, K., Mcfarlane, H., Johnson, E., Gendre, D., Swarup, R., … Bhalerao, R. (2013). ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation. <i>PNAS</i>. National Academy of Sciences. <a href=\"https://doi.org/10.1073/pnas.1309057110\">https://doi.org/10.1073/pnas.1309057110</a>"},"doi":"10.1073/pnas.1309057110","quality_controlled":"1","year":"2013","language":[{"iso":"eng"}],"pmid":1,"intvolume":"       110","main_file_link":[{"url":"http://www.ncbi.nlm.nih.gov/pmc/articles/PMC3791722/","open_access":"1"}],"scopus_import":1,"month":"10","date_published":"2013-10-01T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"National Academy of Sciences","date_updated":"2021-01-12T06:56:33Z","publist_id":"4639","oa_version":"Submitted Version","date_created":"2018-12-11T11:56:48Z","type":"journal_article","_id":"2290","issue":"40","publication":"PNAS","author":[{"full_name":"Boutté, Yohann","first_name":"Yohann","last_name":"Boutté"},{"first_name":"Kristoffer","last_name":"Jonsson","full_name":"Jonsson, Kristoffer"},{"full_name":"Mcfarlane, Heather","first_name":"Heather","last_name":"Mcfarlane"},{"full_name":"Johnson, Errin","first_name":"Errin","last_name":"Johnson"},{"last_name":"Gendre","first_name":"Delphine","full_name":"Gendre, Delphine"},{"full_name":"Swarup, Ranjan","first_name":"Ranjan","last_name":"Swarup"},{"full_name":"Friml, Jirí","orcid":"0000-0002-8302-7596","id":"4159519E-F248-11E8-B48F-1D18A9856A87","first_name":"Jirí","last_name":"Friml"},{"first_name":"Lacey","last_name":"Samuels","full_name":"Samuels, Lacey"},{"first_name":"Stéphanie","last_name":"Robert","full_name":"Robert, Stéphanie"},{"full_name":"Bhalerao, Rishikesh","last_name":"Bhalerao","first_name":"Rishikesh"}],"department":[{"_id":"JiFr"}],"day":"01","volume":110,"title":"ECHIDNA mediated post Golgi trafficking of auxin carriers for differential cell elongation","status":"public"},{"page":"115 - 129","scopus_import":1,"main_file_link":[{"url":"http://eprint.iacr.org/2013/492","open_access":"1"}],"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"IEEE","publist_id":"4637","date_updated":"2021-01-12T06:56:34Z","oa":1,"abstract":[{"lang":"eng","text":"Cryptographic access control promises to offer easily distributed trust and broader applicability, while reducing reliance on low-level online monitors. Traditional implementations of cryptographic access control rely on simple cryptographic primitives whereas recent endeavors employ primitives with richer functionality and security guarantees. Worryingly, few of the existing cryptographic access-control schemes come with precise guarantees, the gap between the policy specification and the implementation being analyzed only informally, if at all. In this paper we begin addressing this shortcoming. Unlike prior work that targeted ad-hoc policy specification, we look at the well-established Role-Based Access Control (RBAC) model, as used in a typical file system. In short, we provide a precise syntax for a computational version of RBAC, offer rigorous definitions for cryptographic policy enforcement of a large class of RBAC security policies, and demonstrate that an implementation based on attribute-based encryption meets our security notions. We view our main contribution as being at the conceptual level. Although we work with RBAC for concreteness, our general methodology could guide future research for uses of cryptography in other access-control models. \r\n"}],"date_published":"2013-09-01T00:00:00Z","month":"09","author":[{"last_name":"Ferrara","first_name":"Anna","full_name":"Ferrara, Anna"},{"full_name":"Fuchsbauer, Georg","id":"46B4C3EE-F248-11E8-B48F-1D18A9856A87","first_name":"Georg","last_name":"Fuchsbauer"},{"full_name":"Warinschi, Bogdan","first_name":"Bogdan","last_name":"Warinschi"}],"conference":{"end_date":"2013-09-28","start_date":"2013-09-26","location":"New Orleans, LA, United States","name":"CSF: Computer Security Foundations"},"department":[{"_id":"KrPi"}],"doi":"10.1109/CSF.2013.15","citation":{"ama":"Ferrara A, Fuchsbauer G, Warinschi B. Cryptographically enforced RBAC. In: IEEE; 2013:115-129. doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>","apa":"Ferrara, A., Fuchsbauer, G., &#38; Warinschi, B. (2013). Cryptographically enforced RBAC (pp. 115–129). Presented at the CSF: Computer Security Foundations, New Orleans, LA, United States: IEEE. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>","chicago":"Ferrara, Anna, Georg Fuchsbauer, and Bogdan Warinschi. “Cryptographically Enforced RBAC,” 115–29. IEEE, 2013. <a href=\"https://doi.org/10.1109/CSF.2013.15\">https://doi.org/10.1109/CSF.2013.15</a>.","short":"A. Ferrara, G. Fuchsbauer, B. Warinschi, in:, IEEE, 2013, pp. 115–129.","ista":"Ferrara A, Fuchsbauer G, Warinschi B. 2013. Cryptographically enforced RBAC. CSF: Computer Security Foundations, 115–129.","ieee":"A. Ferrara, G. Fuchsbauer, and B. Warinschi, “Cryptographically enforced RBAC,” presented at the CSF: Computer Security Foundations, New Orleans, LA, United States, 2013, pp. 115–129.","mla":"Ferrara, Anna, et al. <i>Cryptographically Enforced RBAC</i>. IEEE, 2013, pp. 115–29, doi:<a href=\"https://doi.org/10.1109/CSF.2013.15\">10.1109/CSF.2013.15</a>."},"oa_version":"Submitted Version","date_created":"2018-12-11T11:56:48Z","quality_controlled":"1","type":"conference","_id":"2291","title":"Cryptographically enforced RBAC","status":"public","year":"2013","day":"01","language":[{"iso":"eng"}]},{"editor":[{"first_name":"Krishnendu","id":"2E5DCA20-F248-11E8-B48F-1D18A9856A87","last_name":"Chatterjee","full_name":"Chatterjee, Krishnendu","orcid":"0000-0002-4561-241X"},{"full_name":"Sgall, Jiri","last_name":"Sgall","first_name":"Jiri"}],"series_title":"Lecture Notes in Computer Science","alternative_title":["LNCS"],"scopus_import":1,"page":"VI - 854","abstract":[{"lang":"eng","text":"This book constitutes the thoroughly refereed conference proceedings of the 38th International Symposium on Mathematical Foundations of Computer Science, MFCS 2013, held in Klosterneuburg, Austria, in August 2013. The 67 revised full papers presented together with six invited talks were carefully selected from 191 submissions. Topics covered include algorithmic game theory, algorithmic learning theory, algorithms and data structures, automata, formal languages, bioinformatics, complexity, computational geometry, computer-assisted reasoning, concurrency theory, databases and knowledge-based systems, foundations of computing, logic in computer science, models of computation, semantics and verification of programs, and theoretical issues in artificial intelligence."}],"month":"08","date_published":"2013-08-08T00:00:00Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","publication_status":"published","publisher":"Springer","publist_id":"4636","date_updated":"2020-08-11T10:09:45Z","citation":{"ama":"Chatterjee K, Sgall J, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol 8087. Springer; 2013:VI-854. doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>","mla":"Chatterjee, Krishnendu, and Jiri Sgall, editors. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087, Springer, 2013, p. VI-854, doi:<a href=\"https://doi.org/10.1007/978-3-642-40313-2\">10.1007/978-3-642-40313-2</a>.","ieee":"K. Chatterjee and J. Sgall, Eds., <i>Mathematical Foundations of Computer Science 2013</i>, vol. 8087. Springer, 2013, p. VI-854.","ista":"Chatterjee K, Sgall J eds. 2013. Mathematical Foundations of Computer Science 2013, Springer,p.","short":"K. Chatterjee, J. Sgall, eds., Mathematical Foundations of Computer Science 2013, Springer, 2013.","chicago":"Chatterjee, Krishnendu, and Jiri Sgall, eds. <i>Mathematical Foundations of Computer Science 2013</i>. Vol. 8087. Lecture Notes in Computer Science. Springer, 2013. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>.","apa":"Chatterjee, K., &#38; Sgall, J. (Eds.). (2013). <i>Mathematical Foundations of Computer Science 2013</i> (Vol. 8087, p. VI-854). Presented at the MFCS: Mathematical Foundations of Computer Science, Klosterneuburg, Austria: Springer. <a href=\"https://doi.org/10.1007/978-3-642-40313-2\">https://doi.org/10.1007/978-3-642-40313-2</a>"},"doi":"10.1007/978-3-642-40313-2","quality_controlled":"1","oa_version":"None","date_created":"2018-12-11T11:56:48Z","type":"conference_editor","_id":"2292","department":[{"_id":"KrCh"}],"conference":{"location":"Klosterneuburg, Austria","start_date":"2013-08-26","end_date":"2013-08-30","name":"MFCS: Mathematical Foundations of Computer Science"},"day":"08","year":"2013","publication_identifier":{"isbn":["978-3-642-40312-5"]},"language":[{"iso":"eng"}],"title":"Mathematical Foundations of Computer Science 2013","volume":8087,"status":"public","intvolume":"      8087"}]