[{"status":"public","publist_id":"3894","year":"2011","doi":"10.1016/j.pbi.2010.08.014","day":"01","fulldoi":"https://doi.org/10.1016/j.pbi.2010.08.014","issue":"1","abstract":[{"lang":"eng","text":"Despite their relatively simple appearance, roots are incredibly complex organs that are highly adapted to differing environments. Many aspects of root development are co-ordinated by subtle spatial differences in the concentrations of the phytohormones auxin and cytokinin. Events from the formation of a root during embryogenesis to the determination of the network of lateral roots are controlled by interactions between these hormones. Recently, interactions have been defined where auxin signaling promotes the expression of cytokinin signaling inhibitors, cytokinin signaling promotes the expression of auxin signaling inhibitors and finally where cytokinin signaling regulates the complex network of auxin transport proteins to position zones of high auxin signaling. We are witnessing a period of discovery in which we are beginning to understand how these hormonal pathways communicate to regulate root formation."}],"volume":14,"publisher":"Elsevier","page":"10 - 16","date_updated":"2021-01-12T07:00:23Z","date_created":"2018-12-11T12:00:03Z","publication":"Current Opinion in Plant Biology","month":"02","_id":"2871","citation":{"apa":"Bishopp, A., Benková, E., &#38; Helariutta, Y. (2011). Sending mixed messages: Auxin-cytokinin crosstalk in roots. <i>Current Opinion in Plant Biology</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">https://doi.org/10.1016/j.pbi.2010.08.014</a>","ieee":"A. Bishopp, E. Benková, and Y. Helariutta, “Sending mixed messages: Auxin-cytokinin crosstalk in roots,” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 1. Elsevier, pp. 10–16, 2011.","ama":"Bishopp A, Benková E, Helariutta Y. Sending mixed messages: Auxin-cytokinin crosstalk in roots. <i>Current Opinion in Plant Biology</i>. 2011;14(1):10-16. doi:<a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">10.1016/j.pbi.2010.08.014</a>","chicago":"Bishopp, Anthony, Eva Benková, and Ykä Helariutta. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk in Roots.” <i>Current Opinion in Plant Biology</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">https://doi.org/10.1016/j.pbi.2010.08.014</a>.","mla":"Bishopp, Anthony, et al. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk in Roots.” <i>Current Opinion in Plant Biology</i>, vol. 14, no. 1, Elsevier, 2011, pp. 10–16, doi:<a href=\"https://doi.org/10.1016/j.pbi.2010.08.014\">10.1016/j.pbi.2010.08.014</a>.","ista":"Bishopp A, Benková E, Helariutta Y. 2011. Sending mixed messages: Auxin-cytokinin crosstalk in roots. Current Opinion in Plant Biology. 14(1), 10–16.","short":"A. Bishopp, E. Benková, Y. Helariutta, Current Opinion in Plant Biology 14 (2011) 10–16."},"intvolume":"        14","type":"journal_article","title":"Sending mixed messages: Auxin-cytokinin crosstalk in roots","author":[{"full_name":"Bishopp, Anthony","first_name":"Anthony","last_name":"Bishopp"},{"orcid":"0000-0002-8510-9739","last_name":"Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","first_name":"Eva"},{"last_name":"Helariutta","first_name":"Ykä","full_name":"Helariutta, Ykä"}],"publication_status":"published","quality_controlled":0,"date_published":"2011-02-01T00:00:00Z","extern":1},{"quality_controlled":0,"extern":1,"date_published":"2011-08-01T00:00:00Z","intvolume":"        67","type":"journal_article","title":"Hierarchy of hormone action controlling apical hook development in Arabidopsis","author":[{"last_name":"Gallego Bartolomé","first_name":"Javier","full_name":"Gallego-Bartolomé, Javier"},{"last_name":"Arana","first_name":"María","full_name":"Arana, María V"},{"first_name":"Filip","full_name":"Vandenbussche, Filip","last_name":"Vandenbussche"},{"last_name":"Žádníková","full_name":"Žádníková, Petra","first_name":"Petra"},{"full_name":"Minguet, Eugenio G","first_name":"Eugenio","last_name":"Minguet"},{"last_name":"Guardiola","first_name":"Vicente","full_name":"Guardiola, Vicente"},{"last_name":"Van Der Straeten","first_name":"Dominique","full_name":"Van Der Straeten, Dominique"},{"first_name":"Eva","full_name":"Eva Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87","last_name":"Benková","orcid":"0000-0002-8510-9739"},{"last_name":"Alabadí","full_name":"Alabadí, David","first_name":"David"},{"last_name":"Blázquez","full_name":"Blázquez, Miguel A","first_name":"Miguel"}],"publication_status":"published","_id":"2874","month":"08","citation":{"chicago":"Gallego Bartolomé, Javier, María Arana, Filip Vandenbussche, Petra Žádníková, Eugenio Minguet, Vicente Guardiola, Dominique Van Der Straeten, Eva Benková, David Alabadí, and Miguel Blázquez. “Hierarchy of Hormone Action Controlling Apical Hook Development in Arabidopsis.” <i>Plant Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">https://doi.org/10.1111/j.1365-313X.2011.04621.x</a>.","apa":"Gallego Bartolomé, J., Arana, M., Vandenbussche, F., Žádníková, P., Minguet, E., Guardiola, V., … Blázquez, M. (2011). Hierarchy of hormone action controlling apical hook development in Arabidopsis. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">https://doi.org/10.1111/j.1365-313X.2011.04621.x</a>","ieee":"J. Gallego Bartolomé <i>et al.</i>, “Hierarchy of hormone action controlling apical hook development in Arabidopsis,” <i>Plant Journal</i>, vol. 67, no. 4. Wiley-Blackwell, pp. 622–634, 2011.","ama":"Gallego Bartolomé J, Arana M, Vandenbussche F, et al. Hierarchy of hormone action controlling apical hook development in Arabidopsis. <i>Plant Journal</i>. 2011;67(4):622-634. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">10.1111/j.1365-313X.2011.04621.x</a>","ista":"Gallego Bartolomé J, Arana M, Vandenbussche F, Žádníková P, Minguet E, Guardiola V, Van Der Straeten D, Benková E, Alabadí D, Blázquez M. 2011. Hierarchy of hormone action controlling apical hook development in Arabidopsis. Plant Journal. 67(4), 622–634.","short":"J. Gallego Bartolomé, M. Arana, F. Vandenbussche, P. Žádníková, E. Minguet, V. Guardiola, D. Van Der Straeten, E. Benková, D. Alabadí, M. Blázquez, Plant Journal 67 (2011) 622–634.","mla":"Gallego Bartolomé, Javier, et al. “Hierarchy of Hormone Action Controlling Apical Hook Development in Arabidopsis.” <i>Plant Journal</i>, vol. 67, no. 4, Wiley-Blackwell, 2011, pp. 622–34, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2011.04621.x\">10.1111/j.1365-313X.2011.04621.x</a>."},"publisher":"Wiley-Blackwell","page":"622 - 634","date_updated":"2021-01-12T07:00:24Z","publication":"Plant Journal","date_created":"2018-12-11T12:00:04Z","issue":"4","abstract":[{"lang":"eng","text":"The apical hook develops in the upper part of the hypocotyl when seeds buried in the soil germinate, and serves to protect cotyledons and the shoot apical meristem from possible damage caused by pushing through the soil. The curvature is formed through differential cell growth that occurs at the two opposite sides of the hypocotyl, and it is established by a gradient of auxin activity and refined by the coordinated action of auxin and ethylene. Here we show that gibberellins (GAs) promote hook development through the transcriptional regulation of several genes of the ethylene and auxin pathways in Arabidopsis. The level of GA activity determines the speed of hook formation and the extent of the curvature during the formation phase independently of ethylene, probably by modulating auxin transport and response through HLS1, PIN3, and PIN7. Moreover, GAs cooperate with ethylene in preventing hook opening, in part through the induction of ethylene production mediated by ACS5/ETO2 and ACS8."}],"volume":67,"status":"public","publist_id":"3891","year":"2011","doi":"10.1111/j.1365-313X.2011.04621.x","day":"01","fulldoi":"https://doi.org/10.1111/j.1365-313X.2011.04621.x"},{"quality_controlled":0,"extern":1,"date_published":"2011-01-01T00:00:00Z","title":"Redundancy and the Evolution of Cis Regulatory Element Multiplicity","author":[{"last_name":"Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2361-3953","full_name":"Tiago Paixao","first_name":"Tiago"},{"first_name":"Ricardo","full_name":"Azevedo, Ricardo B","last_name":"Azevedo"}],"type":"journal_article","intvolume":"         6","publication_status":"published","license":"https://creativecommons.org/licenses/by/4.0/","_id":"2897","month":"01","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","image":"/images/cc_by.png","short":"CC BY (4.0)"},"citation":{"mla":"Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis Regulatory Element Multiplicity.” <i>PLoS Computational Biology</i>, vol. 6, no. 7, Public Library of Science, 2011, doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">10.1371/journal.pcbi.1000848</a>.","short":"T. Paixao, R. Azevedo, PLoS Computational Biology 6 (2011).","ista":"Paixao T, Azevedo R. 2011. Redundancy and the Evolution of Cis Regulatory Element Multiplicity. PLoS Computational Biology. 6(7).","ieee":"T. Paixao and R. Azevedo, “Redundancy and the Evolution of Cis Regulatory Element Multiplicity,” <i>PLoS Computational Biology</i>, vol. 6, no. 7. Public Library of Science, 2011.","apa":"Paixao, T., &#38; Azevedo, R. (2011). Redundancy and the Evolution of Cis Regulatory Element Multiplicity. <i>PLoS Computational Biology</i>. Public Library of Science. <a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">https://doi.org/10.1371/journal.pcbi.1000848</a>","ama":"Paixao T, Azevedo R. Redundancy and the Evolution of Cis Regulatory Element Multiplicity. <i>PLoS Computational Biology</i>. 2011;6(7). doi:<a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">10.1371/journal.pcbi.1000848</a>","chicago":"Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis Regulatory Element Multiplicity.” <i>PLoS Computational Biology</i>. Public Library of Science, 2011. <a href=\"https://doi.org/10.1371/journal.pcbi.1000848\">https://doi.org/10.1371/journal.pcbi.1000848</a>."},"date_created":"2018-12-11T12:00:13Z","date_updated":"2021-01-12T07:00:33Z","publication":"PLoS Computational Biology","publisher":"Public Library of Science","issue":"7","volume":6,"doi":"10.1371/journal.pcbi.1000848","year":"2011","publist_id":"3861","status":"public","fulldoi":"https://doi.org/10.1371/journal.pcbi.1000848","acknowledgement":"TFs regulate gene expression by binding to specific sequences in the promoter regions of their target genes. Promoters often contain multiple copies of the same TF binding sites. How does this multiplicity evolve? One possibility is that individuals with multiple, redundant binding sites have higher fitness. However, nonadaptive processes are also likely to be important. Here, we develop a mathematical model of the evolution of TF binding sites to help us disentangle how different evolutionary mechanisms contribute to the evolution of binding site redundancy and multiplicity. We show that recombination is expected to promote the evolution of multiple binding sites. This prediction is corroborated by genome-wide data from yeast. Another important factor in the evolution of multiplicity predicted in our analysis is TF promiscuity, that is, the ability of a TF to bind to multiple sequences. In addition, our analysis indicated that direct selection can have large effects on the evolution of redundancy and multiplicity. Data from yeast identified selection for changes in expression level as a candidate mechanism for the evolution of multiple binding sites. We conclude that, although selection may play a major role in the evolution of multiplicity in regulatory regions, nonadaptive forces can also lead to high levels of multiplicity.","day":"01"},{"doi":"10.1111/j.1558-5646.2011.01266.x","year":"2011","publist_id":"3860","status":"public","fulldoi":"https://doi.org/10.1111/j.1558-5646.2011.01266.x","day":"01","abstract":[{"text":"Sex allocation theory has been remarkably successful at explaining the prevalence of even sex ratios in natural populations and at identifying specific conditions that can result in biased sex ratios. Much of this theory focuses on parental sex determination (SD) strategies. Here, we consider instead the evolutionary causes and consequences of mixed offspring SD strategies, in which the genotype of an individual determines not its sex, but the probability of developing one of multiple sexes. We find that alleles specifying mixed offspring SD strategies can generally outcompete alleles that specify pure strategies, but generate constraints that may prevent a population from reaching an even sex ratio. We use our model to analyze sex ratios in natural populations of Tetrahymena thermophila, a ciliate with seven sexes determined by mixed SD alleles. We show that probabilistic SD is sufficient to account for the occurrence of skewed sex ratios in natural populations of T. thermophila, provided that their effective population sizes are small. Our results highlight the importance of genetic drift in sex ratio evolution and suggest that mixed offspring SD strategies should be more common than currently thought.","lang":"eng"}],"issue":"7","volume":65,"date_created":"2018-12-11T12:00:13Z","publication":"Evolution; International Journal of Organic Evolution","date_updated":"2021-01-12T07:00:33Z","page":"2050 - 2060","publisher":"Wiley-Blackwell","month":"03","_id":"2898","citation":{"mla":"Paixao, Tiago, et al. “Sex Ratio Evolution under Probabilistic Sex Determination.” <i>Evolution; International Journal of Organic Evolution</i>, vol. 65, no. 7, Wiley-Blackwell, 2011, pp. 2050–60, doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">10.1111/j.1558-5646.2011.01266.x</a>.","short":"T. Paixao, S. Phadke, R. Azevedo, R. Zufall, Evolution; International Journal of Organic Evolution 65 (2011) 2050–2060.","ista":"Paixao T, Phadke S, Azevedo R, Zufall R. 2011. Sex ratio evolution under probabilistic sex determination. Evolution; International Journal of Organic Evolution. 65(7), 2050–2060.","apa":"Paixao, T., Phadke, S., Azevedo, R., &#38; Zufall, R. (2011). Sex ratio evolution under probabilistic sex determination. <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">https://doi.org/10.1111/j.1558-5646.2011.01266.x</a>","ieee":"T. Paixao, S. Phadke, R. Azevedo, and R. Zufall, “Sex ratio evolution under probabilistic sex determination,” <i>Evolution; International Journal of Organic Evolution</i>, vol. 65, no. 7. Wiley-Blackwell, pp. 2050–2060, 2011.","ama":"Paixao T, Phadke S, Azevedo R, Zufall R. Sex ratio evolution under probabilistic sex determination. <i>Evolution; International Journal of Organic Evolution</i>. 2011;65(7):2050-2060. doi:<a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">10.1111/j.1558-5646.2011.01266.x</a>","chicago":"Paixao, Tiago, Sujal Phadke, Ricardo Azevedo, and Rebecca Zufall. “Sex Ratio Evolution under Probabilistic Sex Determination.” <i>Evolution; International Journal of Organic Evolution</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1558-5646.2011.01266.x\">https://doi.org/10.1111/j.1558-5646.2011.01266.x</a>."},"title":"Sex ratio evolution under probabilistic sex determination","author":[{"orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","last_name":"Paixao","first_name":"Tiago","full_name":"Tiago Paixao"},{"full_name":"Phadke, Sujal S","first_name":"Sujal","last_name":"Phadke"},{"full_name":"Azevedo, Ricardo B","first_name":"Ricardo","last_name":"Azevedo"},{"last_name":"Zufall","full_name":"Zufall, Rebecca A","first_name":"Rebecca"}],"intvolume":"        65","type":"journal_article","publication_status":"published","quality_controlled":0,"date_published":"2011-03-01T00:00:00Z","extern":1},{"publication_status":"published","type":"book_chapter","author":[{"last_name":"Vicente","full_name":"Vicente, Sara","first_name":"Sara"},{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"title":"Graph-cut Based Image Segmentation with Connectivity Priors","extern":1,"date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"editor":[{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"last_name":"Kohli","full_name":"Kohli, Pushmeet","first_name":"Pushmeet"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"citation":{"chicago":"Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph-Cut Based Image Segmentation with Connectivity Priors.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","ama":"Vicente S, Kolmogorov V, Rother C. Graph-cut Based Image Segmentation with Connectivity Priors. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","ieee":"S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation with Connectivity Priors,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","apa":"Vicente, S., Kolmogorov, V., &#38; Rother, C. (2011). Graph-cut Based Image Segmentation with Connectivity Priors. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ista":"Vicente S, Kolmogorov V, Rother C. 2011.Graph-cut Based Image Segmentation with Connectivity Priors. In: Markov Random Fields for Vision and Image Processing. .","short":"S. Vicente, V. Kolmogorov, C. Rother, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity Priors.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011."},"month":"01","_id":"2922","publisher":"Massachusetts Institute of Technology Press","date_created":"2018-12-11T12:00:21Z","publication":"Markov Random Fields for Vision and Image Processing","date_updated":"2021-01-12T07:00:43Z","day":"01","status":"public","publist_id":"3815","year":"2011"},{"day":"01","publist_id":"3814","status":"public","year":"2011","publisher":"Massachusetts Institute of Technology Press","date_updated":"2021-01-12T07:00:43Z","date_created":"2018-12-11T12:00:21Z","publication":"Markov Random Fields for Vision and Image Processing","citation":{"ista":"Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP Estimation. In: Markov Random Fields for Vision and Image Processing. .","short":"M.P. Kumar, V. Kolmogorov, P. Torr, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","mla":"Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","chicago":"Kumar, M Pawan, Vladimir Kolmogorov, and Philip Torr. “Analyzing Convex Relaxations for MAP Estimation.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","ama":"Kumar MP, Kolmogorov V, Torr P. Analyzing Convex Relaxations for MAP Estimation. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","apa":"Kumar, M. P., Kolmogorov, V., &#38; Torr, P. (2011). Analyzing Convex Relaxations for MAP Estimation. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ieee":"M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for MAP Estimation,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011."},"month":"01","_id":"2923","editor":[{"last_name":"Blake","first_name":"Andrew","full_name":"Blake, Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"last_name":"Rother","full_name":"Rother, Carsten","first_name":"Carsten"}],"extern":1,"date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"publication_status":"published","type":"book_chapter","author":[{"last_name":"Kumar","first_name":"M Pawan","full_name":"Kumar, M Pawan"},{"full_name":"Vladimir Kolmogorov","first_name":"Vladimir","last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Torr","full_name":"Torr, Philip H","first_name":"Philip"}],"title":"Analyzing Convex Relaxations for MAP Estimation"},{"day":"01","publist_id":"3813","status":"public","year":"2011","publisher":"Massachusetts Institute of Technology Press","date_created":"2018-12-11T12:00:22Z","publication":"Markov Random Fields for Vision and Image Processing","date_updated":"2021-01-12T07:00:43Z","citation":{"mla":"Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","ista":"Criminisi A, Cross G, Blake A, Kolmogorov V. 2011.Bilayer Segmentation of Video. In: Markov Random Fields for Vision and Image Processing. .","short":"A. Criminisi, G. Cross, A. Blake, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","ama":"Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer Segmentation of Video. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","apa":"Criminisi, A., Cross, G., Blake, A., &#38; Kolmogorov, V. (2011). Bilayer Segmentation of Video. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ieee":"A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation of Video,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","chicago":"Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov. “Bilayer Segmentation of Video.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011."},"_id":"2924","month":"01","editor":[{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"first_name":"Pushmeet","full_name":"Kohli, Pushmeet","last_name":"Kohli"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"}],"extern":1,"date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"publication_status":"published","type":"book_chapter","title":"Bilayer Segmentation of Video","author":[{"last_name":"Criminisi","first_name":"Antonio","full_name":"Criminisi, Antonio"},{"last_name":"Cross","full_name":"Cross, Geoffrey","first_name":"Geoffrey"},{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov"}]},{"publication_status":"published","type":"book_chapter","title":"Interactive Foreground Extraction using graph cut","author":[{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"},{"id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov"},{"last_name":"Boykov","first_name":"Yuri","full_name":"Boykov, Yuri"},{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"}],"extern":1,"date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"editor":[{"full_name":"Blake, Andrew","first_name":"Andrew","last_name":"Blake"},{"first_name":"Pushmeet","full_name":"Kohli, Pushmeet","last_name":"Kohli"},{"full_name":"Rother, Carsten","first_name":"Carsten","last_name":"Rother"}],"citation":{"ieee":"C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground Extraction using graph cut,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011.","apa":"Rother, C., Kolmogorov, V., Boykov, Y., &#38; Blake, A. (2011). Interactive Foreground Extraction using graph cut. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press.","ama":"Rother C, Kolmogorov V, Boykov Y, Blake A. Interactive Foreground Extraction using graph cut. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011.","chicago":"Rother, Carsten, Vladimir Kolmogorov, Yuri Boykov, and Andrew Blake. “Interactive Foreground Extraction Using Graph Cut.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts Institute of Technology Press, 2011.","mla":"Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.","short":"C. Rother, V. Kolmogorov, Y. Boykov, A. Blake, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011.","ista":"Rother C, Kolmogorov V, Boykov Y, Blake A. 2011.Interactive Foreground Extraction using graph cut. In: Markov Random Fields for Vision and Image Processing. ."},"_id":"2925","month":"01","publisher":"Massachusetts Institute of Technology Press","date_created":"2018-12-11T12:00:22Z","publication":"Markov Random Fields for Vision and Image Processing","date_updated":"2021-01-12T07:00:44Z","day":"01","publist_id":"3812","status":"public","year":"2011"},{"title":"Basic graph cut algorithms","author":[{"full_name":"Boykov, Yuri","first_name":"Yuri","last_name":"Boykov"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","first_name":"Vladimir"}],"type":"book_chapter","publication_status":"published","quality_controlled":0,"extern":1,"date_published":"2011-07-22T00:00:00Z","editor":[{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"full_name":"Kohli, Pushmeet","first_name":"Pushmeet","last_name":"Kohli"},{"first_name":"Carsten","full_name":"Rother, Carsten","last_name":"Rother"}],"_id":"2935","month":"07","citation":{"chicago":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” In <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother, 31–50. Massachusetts Institute of Technology Press, 2011.","ama":"Boykov Y, Kolmogorov V. Basic graph cut algorithms. In: Blake A, Kohli P, Rother C, eds. <i>Markov Random Fields for Vision and Image Processing</i>. Massachusetts Institute of Technology Press; 2011:31-50.","ieee":"Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in <i>Markov Random Fields for Vision and Image Processing</i>, A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology Press, 2011, pp. 31–50.","apa":"Boykov, Y., &#38; Kolmogorov, V. (2011). Basic graph cut algorithms. In A. Blake, P. Kohli, &#38; C. Rother (Eds.), <i>Markov Random Fields for Vision and Image Processing</i> (pp. 31–50). Massachusetts Institute of Technology Press.","short":"Y. Boykov, V. Kolmogorov, in:, A. Blake, P. Kohli, C. Rother (Eds.), Markov Random Fields for Vision and Image Processing, Massachusetts Institute of Technology Press, 2011, pp. 31–50.","ista":"Boykov Y, Kolmogorov V. 2011.Basic graph cut algorithms. In: Markov Random Fields for Vision and Image Processing. , 31–50.","mla":"Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” <i>Markov Random Fields for Vision and Image Processing</i>, edited by Andrew Blake et al., Massachusetts Institute of Technology Press, 2011, pp. 31–50."},"date_created":"2018-12-11T12:00:26Z","publication":"Markov Random Fields for Vision and Image Processing","date_updated":"2021-01-12T07:39:53Z","page":"31 - 50","publisher":"Massachusetts Institute of Technology Press","year":"2011","status":"public","publist_id":"3801","day":"22"},{"_id":"2960","month":"01","citation":{"short":"S. Fienberg, A. Slavkovic, C. Uhler, in:, IEEE, 2011.","ista":"Fienberg S, Slavkovic A, Uhler C. 2011. Privacy Preserving GWAS Data Sharing. Proceedings of the 11th IEEE International Conference on Data Mining.","mla":"Fienberg, Stephen, et al. <i>Privacy Preserving GWAS Data Sharing</i>. IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ICDMW.2011.140\">10.1109/ICDMW.2011.140</a>.","chicago":"Fienberg, Stephen, Aleksandra Slavkovic, and Caroline Uhler. “Privacy Preserving GWAS Data Sharing.” IEEE, 2011. <a href=\"https://doi.org/10.1109/ICDMW.2011.140\">https://doi.org/10.1109/ICDMW.2011.140</a>.","ieee":"S. Fienberg, A. Slavkovic, and C. Uhler, “Privacy Preserving GWAS Data Sharing,” presented at the Proceedings of the 11th IEEE International Conference on Data Mining, 2011.","apa":"Fienberg, S., Slavkovic, A., &#38; Uhler, C. (2011). Privacy Preserving GWAS Data Sharing. Presented at the Proceedings of the 11th IEEE International Conference on Data Mining, IEEE. <a href=\"https://doi.org/10.1109/ICDMW.2011.140\">https://doi.org/10.1109/ICDMW.2011.140</a>","ama":"Fienberg S, Slavkovic A, Uhler C. Privacy Preserving GWAS Data Sharing. In: IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ICDMW.2011.140\">10.1109/ICDMW.2011.140</a>"},"conference":{"name":"Proceedings of the 11th IEEE International Conference on Data Mining"},"quality_controlled":0,"extern":1,"date_published":"2011-01-01T00:00:00Z","type":"conference","title":"Privacy Preserving GWAS Data Sharing","author":[{"last_name":"Fienberg","full_name":"Fienberg, Stephen E","first_name":"Stephen"},{"full_name":"Slavkovic, Aleksandra","first_name":"Aleksandra","last_name":"Slavkovic"},{"orcid":"0000-0002-7008-0216","last_name":"Uhler","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","full_name":"Caroline Uhler","first_name":"Caroline"}],"publication_status":"published","abstract":[{"lang":"eng","text":"Traditional statistical methods for the confidentiality protection for statistical databases do not scale well to deal with GWAS (genome-wide association studies) databases and external information on them. The more recent concept of differential privacy, introduced by the cryptographic community, is an approach which provides a rigorous definition of privacy with meaningful privacy guarantees in the presence of arbitrary external information. Building on such notions, we propose new methods to release aggregate GWAS data without compromising an individual's privacy. We present methods for releasing differentially private minor allele frequencies, chi-square statistics and p-values. We compare these approaches on simulated data and on a GWAS study of canine hair length involving 685 dogs. We also propose a privacy-preserving method for finding genome-wide associations based on a differentially private approach to penalized logistic regression."}],"status":"public","publist_id":"3766","doi":"10.1109/ICDMW.2011.140","year":"2011","day":"01","fulldoi":"https://doi.org/10.1109/ICDMW.2011.140","publisher":"IEEE","date_updated":"2021-01-12T07:40:05Z","date_created":"2018-12-11T12:00:34Z"},{"status":"public","publist_id":"3764","doi":"http://dx.doi.org/10.18409/jas.v2i1.27","year":"2011","acknowledgement":"Anna-Sapfo Malaspinas is supported by a Janggen-Poehn Fellowship. Caroline Uhler is supported by an International Fulbright Science and Technology Fellowship.","day":"01","fulldoi":"https://doi.org/http://dx.doi.org/10.18409/jas.v2i1.27","issue":"1","abstract":[{"lang":"eng","text":"Rapid research progress in genotyping techniques have allowed large genome-wide association studies. Existing methods often focus on determining associations between single loci and a specic phenotype. However, a particular phenotype is usually the result of complex relationships between multiple loci and the environment. In this paper, we describe a two-stage method for detecting epistasis by combining the traditionally used single-locus search with a search for multiway interactions. Our method is based on an extended version of Fisher's exact test. To\nperform this test, a Markov chain is constructed on the space of multidimensional contingency tables using the elements of a Markov basis as moves. We test our method on simulated data and compare it to a two-stage logistic regression method and to a fully Bayesian method, showing that we are able to detect the interacting loci when other methods fail to do so. Finally, we apply our method to a genome-wide data set consisting of 685 dogs and identify epistasis associated with canine hair length for four pairs of single nucleotide polymorphisms (SNPs)."}],"volume":2,"main_file_link":[{"open_access":"1","url":"http://arxiv.org/abs/1006.4929"}],"publisher":"Public Knowledge Project","date_updated":"2021-01-12T07:40:05Z","publication":"Journal of Algebraic Statistics","date_created":"2018-12-11T12:00:34Z","page":"36 - 53","oa":1,"_id":"2961","month":"01","citation":{"chicago":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” <i>Journal of Algebraic Statistics</i>. Public Knowledge Project, 2011. <a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>.","ieee":"A. Malaspinas and C. Uhler, “Detecting epistasis via Markov bases,” <i>Journal of Algebraic Statistics</i>, vol. 2, no. 1. Public Knowledge Project, pp. 36–53, 2011.","apa":"Malaspinas, A., &#38; Uhler, C. (2011). Detecting epistasis via Markov bases. <i>Journal of Algebraic Statistics</i>. Public Knowledge Project. <a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>","ama":"Malaspinas A, Uhler C. Detecting epistasis via Markov bases. <i>Journal of Algebraic Statistics</i>. 2011;2(1):36-53. doi:<a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>","ista":"Malaspinas A, Uhler C. 2011. Detecting epistasis via Markov bases. Journal of Algebraic Statistics. 2(1), 36–53.","short":"A. Malaspinas, C. Uhler, Journal of Algebraic Statistics 2 (2011) 36–53.","mla":"Malaspinas, Anna, and Caroline Uhler. “Detecting Epistasis via Markov Bases.” <i>Journal of Algebraic Statistics</i>, vol. 2, no. 1, Public Knowledge Project, 2011, pp. 36–53, doi:<a href=\"http://dx.doi.org/10.18409/jas.v2i1.27\">http://dx.doi.org/10.18409/jas.v2i1.27</a>."},"intvolume":"         2","type":"journal_article","title":"Detecting epistasis via Markov bases","author":[{"first_name":"Anna","full_name":"Malaspinas, Anna-Sapfo ","last_name":"Malaspinas"},{"first_name":"Caroline","full_name":"Caroline Uhler","orcid":"0000-0002-7008-0216","id":"49ADD78E-F248-11E8-B48F-1D18A9856A87","last_name":"Uhler"}],"publication_status":"published","quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","extern":1},{"quality_controlled":0,"extern":1,"date_published":"2011-11-21T00:00:00Z","type":"conference","intvolume":"      7073","title":"A Framework for Practical Universally Composable Zero-Knowledge Protocols","author":[{"full_name":"Camenisch, Jan","first_name":"Jan","last_name":"Camenisch"},{"first_name":"Stephan","full_name":"Stephan Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","last_name":"Krenn","orcid":"0000-0003-2835-9093"},{"last_name":"Shoup","first_name":"Victor","full_name":"Shoup, Victor"}],"alternative_title":["LNCS"],"publication_status":"published","_id":"2975","month":"11","citation":{"mla":"Camenisch, Jan, et al. <i>A Framework for Practical Universally Composable Zero-Knowledge Protocols</i>. Edited by Dong Lee and Xiaoyun Wang, vol. 7073, Springer, 2011, pp. 449–67, doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0\">10.1007/978-3-642-25385-0</a>.","short":"J. Camenisch, S. Krenn, V. Shoup, in:, D. Lee, X. Wang (Eds.), Springer, 2011, pp. 449–467.","ista":"Camenisch J, Krenn S, Shoup V. 2011. A Framework for Practical Universally Composable Zero-Knowledge Protocols. ASIACRYPT: Theory and Application of Cryptology and Information Security, LNCS, vol. 7073, 449–467.","ama":"Camenisch J, Krenn S, Shoup V. A Framework for Practical Universally Composable Zero-Knowledge Protocols. In: Lee D, Wang X, eds. Vol 7073. Springer; 2011:449-467. doi:<a href=\"https://doi.org/10.1007/978-3-642-25385-0\">10.1007/978-3-642-25385-0</a>","apa":"Camenisch, J., Krenn, S., &#38; Shoup, V. (2011). A Framework for Practical Universally Composable Zero-Knowledge Protocols. In D. Lee &#38; X. Wang (Eds.) (Vol. 7073, pp. 449–467). Presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, Springer. <a href=\"https://doi.org/10.1007/978-3-642-25385-0\">https://doi.org/10.1007/978-3-642-25385-0</a>","ieee":"J. Camenisch, S. Krenn, and V. Shoup, “A Framework for Practical Universally Composable Zero-Knowledge Protocols,” presented at the ASIACRYPT: Theory and Application of Cryptology and Information Security, 2011, vol. 7073, pp. 449–467.","chicago":"Camenisch, Jan, Stephan Krenn, and Victor Shoup. “A Framework for Practical Universally Composable Zero-Knowledge Protocols.” edited by Dong Lee and Xiaoyun Wang, 7073:449–67. Springer, 2011. <a href=\"https://doi.org/10.1007/978-3-642-25385-0\">https://doi.org/10.1007/978-3-642-25385-0</a>."},"conference":{"name":"ASIACRYPT: Theory and Application of Cryptology and Information Security"},"editor":[{"full_name":"Lee, Dong Hoon","first_name":"Dong","last_name":"Lee"},{"first_name":"Xiaoyun","full_name":"Wang, Xiaoyun","last_name":"Wang"}],"publisher":"Springer","page":"449 - 467","date_updated":"2021-01-12T07:40:11Z","date_created":"2018-12-11T12:00:39Z","main_file_link":[{"url":"http://eprint.iacr.org/2011/228.pdf","open_access":"0"}],"abstract":[{"lang":"eng","text":"Zero-knowledge proofs of knowledge (ZK-PoK) for discrete logarithms and related problems are indispensable for practical cryptographic protocols. Recently, Camenisch, Kiayias, and Yung provided a specification language (the CKY-language) for such protocols which allows for a modular design and protocol analysis: for every zero-knowledge proof specified in this language, protocol designers are ensured that there exists an efficient protocol which indeed proves the specified statement.\n\nHowever, the protocols resulting from their compilation techniques only satisfy the classical notion of ZK-PoK, which is not retained are when they used as building blocks for higher-level applications or composed with other protocols.\nThis problem can be tackled by moving to the Universal Composability (UC) framework, which guarantees retention of security when composing protocols in arbitrary ways.  \nWhile there exist generic transformations from $\\Sigma$-protocols to UC-secure protocols, these transformation are often too inefficient for practice.\n \nIn this paper we introduce a specification language akin to the CKY-language and a compiler such that the resulting protocols are UC-secure and efficient. \nTo this end, we propose an extension of the UC-framework addressing the \nissue that UC-secure zero-knowledge proofs are by definition proofs of knowledge, and state a special composition theorem which allows one to use the weaker -- but more efficient and often sufficient -- notion of proofs of membership in the UC-framework.  \nWe believe that our contributions enable the design of practically efficient protocols that are UC-secure and thus themselves can be used as building blocks."}],"volume":7073,"publist_id":"3728","status":"public","doi":"10.1007/978-3-642-25385-0","year":"2011","day":"21","acknowledgement":"This work was in part funded by the Swiss Hasler Foundation, and the EU FP7 grants 216483 and 216499, as well as by the NSF grant CNS-0716690.","fulldoi":"https://doi.org/10.1007/978-3-642-25385-0"},{"type":"conference","author":[{"last_name":"Gullasch","full_name":"Gullasch, David","first_name":"David"},{"last_name":"Bangerter","full_name":"Bangerter, Endre","first_name":"Endre"},{"full_name":"Stephan Krenn","first_name":"Stephan","orcid":"0000-0003-2835-9093","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87"}],"title":"Cache Games - Bringing Access-Based Cache Attacks on AES to Practice","publication_status":"published","quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","extern":1,"conference":{"name":"S&P: IEEE Symposium on Security and Privacy"},"month":"01","_id":"2976","citation":{"chicago":"Gullasch, David, Endre Bangerter, and Stephan Krenn. “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” 490–505. IEEE, 2011. <a href=\"https://doi.org/10.1109/SP.2011.22\">https://doi.org/10.1109/SP.2011.22</a>.","ama":"Gullasch D, Bangerter E, Krenn S. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. In: IEEE; 2011:490-505. doi:<a href=\"https://doi.org/10.1109/SP.2011.22\">10.1109/SP.2011.22</a>","apa":"Gullasch, D., Bangerter, E., &#38; Krenn, S. (2011). Cache Games - Bringing Access-Based Cache Attacks on AES to Practice (pp. 490–505). Presented at the S&#38;P: IEEE Symposium on Security and Privacy, IEEE. <a href=\"https://doi.org/10.1109/SP.2011.22\">https://doi.org/10.1109/SP.2011.22</a>","ieee":"D. Gullasch, E. Bangerter, and S. Krenn, “Cache Games - Bringing Access-Based Cache Attacks on AES to Practice,” presented at the S&#38;P: IEEE Symposium on Security and Privacy, 2011, pp. 490–505.","short":"D. Gullasch, E. Bangerter, S. Krenn, in:, IEEE, 2011, pp. 490–505.","ista":"Gullasch D, Bangerter E, Krenn S. 2011. Cache Games - Bringing Access-Based Cache Attacks on AES to Practice. S&#38;P: IEEE Symposium on Security and Privacy, 490–505.","mla":"Gullasch, David, et al. <i>Cache Games - Bringing Access-Based Cache Attacks on AES to Practice</i>. IEEE, 2011, pp. 490–505, doi:<a href=\"https://doi.org/10.1109/SP.2011.22\">10.1109/SP.2011.22</a>."},"main_file_link":[{"open_access":"0","url":"http://eprint.iacr.org/2010/594.pdf"}],"publisher":"IEEE","date_updated":"2021-01-12T07:40:11Z","date_created":"2018-12-11T12:00:39Z","page":"490 - 505","status":"public","publist_id":"3727","year":"2011","doi":"10.1109/SP.2011.22","acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation.\nAn extended abstract was also accepted for COSADE 2011.","day":"01","fulldoi":"https://doi.org/10.1109/SP.2011.22","abstract":[{"text":"Side channel attacks on cryptographic systems exploit information\ngained from physical implementations rather than theoretical\nweaknesses of a scheme. In recent years, major achievements were made\nfor the class of so called access-driven cache attacks. Such attacks\nexploit the leakage of the memory locations accessed by a victim\nprocess.\n\nIn this paper we consider the AES block cipher and present an attack\nwhich is capable of recovering the full secret key in almost realtime\nfor AES-128, requiring only a very limited number of observed\nencryptions. Unlike previous attacks, we do not require any\ninformation about the plaintext (such as its distribution, etc.).\nMoreover, for the first time, we also show how the plaintext can be\nrecovered without having access to the ciphertext at all.  It is the\nfirst working attack on AES implementations using compressed\ntables. There, no efficient techniques to identify the beginning\nof AES rounds is known, which is the fundamental assumption underlying previous\nattacks.\n\nWe have a fully working implementation of our attack which is able to\nrecover AES keys after observing as little as 100 encryptions. It\nworks against the OpenSSL 0.9.8n implementation of AES on Linux\nsystems.  Our spy process does not require any special privileges\nbeyond those of a standard Linux user. A contribution of probably\nindependent interest is a denial of service attack on the task scheduler of\ncurrent Linux systems (CFS), which allows one to observe (on average)\nevery single memory access of a victim process.","lang":"eng"}]},{"publication_status":"published","type":"conference","title":"cPLC - A Cryptographic Programming Language and Compiler","author":[{"full_name":"Bangerter, Endre","first_name":"Endre","last_name":"Bangerter"},{"full_name":"Stephan Krenn","first_name":"Stephan","last_name":"Krenn","id":"329FCCF0-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0003-2835-9093"},{"first_name":"Martial","full_name":"Seifriz, Martial","last_name":"Seifriz"},{"last_name":"Ultes Nitsche","first_name":"Ulrich","full_name":"Ultes-Nitsche, Ulrich"}],"extern":1,"date_published":"2011-08-01T00:00:00Z","quality_controlled":0,"editor":[{"last_name":"Venter","full_name":"Venter, Hein S.","first_name":"Hein"},{"last_name":"Coetzee","full_name":"Coetzee, Marijke","first_name":"Marijke"},{"first_name":"Marianne","full_name":"Loock, Marianne","last_name":"Loock"}],"conference":{"name":"ISSA: Information Security South Africa"},"citation":{"chicago":"Bangerter, Endre, Stephan Krenn, Martial Seifriz, and Ulrich Ultes Nitsche. “CPLC - A Cryptographic Programming Language and Compiler.” edited by Hein Venter, Marijke Coetzee, and Marianne Loock. IEEE, 2011. <a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">https://doi.org/10.1109/ISSA.2011.6027533</a>.","ama":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. cPLC - A Cryptographic Programming Language and Compiler. In: Venter H, Coetzee M, Loock M, eds. IEEE; 2011. doi:<a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">10.1109/ISSA.2011.6027533</a>","apa":"Bangerter, E., Krenn, S., Seifriz, M., &#38; Ultes Nitsche, U. (2011). cPLC - A Cryptographic Programming Language and Compiler. In H. Venter, M. Coetzee, &#38; M. Loock (Eds.). Presented at the ISSA: Information Security South Africa, IEEE. <a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">https://doi.org/10.1109/ISSA.2011.6027533</a>","ieee":"E. Bangerter, S. Krenn, M. Seifriz, and U. Ultes Nitsche, “cPLC - A Cryptographic Programming Language and Compiler,” presented at the ISSA: Information Security South Africa, 2011.","short":"E. Bangerter, S. Krenn, M. Seifriz, U. Ultes Nitsche, in:, H. Venter, M. Coetzee, M. Loock (Eds.), IEEE, 2011.","ista":"Bangerter E, Krenn S, Seifriz M, Ultes Nitsche U. 2011. cPLC - A Cryptographic Programming Language and Compiler. ISSA: Information Security South Africa.","mla":"Bangerter, Endre, et al. <i>CPLC - A Cryptographic Programming Language and Compiler</i>. Edited by Hein Venter et al., IEEE, 2011, doi:<a href=\"https://doi.org/10.1109/ISSA.2011.6027533\">10.1109/ISSA.2011.6027533</a>."},"month":"08","_id":"2977","publisher":"IEEE","date_created":"2018-12-11T12:00:39Z","date_updated":"2021-01-12T07:40:12Z","day":"01","acknowledgement":"This work was in part funded by the European Community’s Seventh Framework Programme (FP7) under grant agreement no. 216499 and the Swiss Hasler Foundation under projects no. 09037 and 10069.","fulldoi":"https://doi.org/10.1109/ISSA.2011.6027533","publist_id":"3726","status":"public","doi":"10.1109/ISSA.2011.6027533","year":"2011","abstract":[{"text":"Cryptographic two-party protocols are used ubiquitously in\n    everyday life. While some of these protocols are easy to\n    understand and implement (e.g., key exchange or transmission of\n    encrypted data), many of them are much more complex (e.g.,\n    e-banking and e-voting applications, or anonymous authentication\n    and credential systems).\n\n    For a software engineer without appropriate cryptographic skills\n    the implementation of such protocols is often difficult, time\n    consuming and error-prone. For this reason, a number of compilers\n    supporting programmers have been published in recent\n    years. However, they are either designed for very specific\n    cryptographic primitives (e.g., zero-knowledge proofs of\n    knowledge), or they only offer a very low level of abstraction and\n    thus again demand substantial mathematical and cryptographic\n    skills from the programmer. Finally, some of the existing\n    compilers do not produce executable code, but only metacode which\n    has to be instantiated with mathematical libraries, encryption\n    routines, etc. before it can actually be used.\n  \n    In this paper we present a cryptographically aware compiler which\n    is equally useful to cryptographers who want to benchmark\n    protocols designed on paper, and to programmers who want to\n    implement complex security sensitive protocols without having to\n    understand all subtleties. Our tool offers a high level of\n    abstraction and outputs well-structured and documented Java\n    code. We believe that our compiler can contribute to shortening\n    the development cycles of cryptographic applications and to\n    reducing their error-proneness.","lang":"eng"}]},{"type":"journal_article","intvolume":"        65","title":"Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth","author":[{"full_name":"Balla, Jozef","first_name":"Jozef","last_name":"Balla"},{"full_name":"Kalousek, Petr","first_name":"Petr","last_name":"Kalousek"},{"full_name":"Reinöhl, Vilém","first_name":"Vilém","last_name":"Reinöhl"},{"last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596","full_name":"Jirí Friml","first_name":"Jirí"},{"last_name":"Procházka","full_name":"Procházka, Stanislav","first_name":"Stanislav"}],"publication_status":"published","quality_controlled":0,"date_published":"2011-02-01T00:00:00Z","extern":1,"_id":"3082","month":"02","citation":{"ieee":"J. Balla, P. Kalousek, V. Reinöhl, J. Friml, and S. Procházka, “Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth,” <i>Plant Journal</i>, vol. 65, no. 4. Wiley-Blackwell, pp. 571–577, 2011.","apa":"Balla, J., Kalousek, P., Reinöhl, V., Friml, J., &#38; Procházka, S. (2011). Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. <i>Plant Journal</i>. Wiley-Blackwell. <a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">https://doi.org/10.1111/j.1365-313X.2010.04443.x</a>","ama":"Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. <i>Plant Journal</i>. 2011;65(4):571-577. doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">10.1111/j.1365-313X.2010.04443.x</a>","chicago":"Balla, Jozef, Petr Kalousek, Vilém Reinöhl, Jiří Friml, and Stanislav Procházka. “Competitive Canalization of PIN Dependent Auxin Flow from Axillary Buds Controls Pea Bud Outgrowth.” <i>Plant Journal</i>. Wiley-Blackwell, 2011. <a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">https://doi.org/10.1111/j.1365-313X.2010.04443.x</a>.","mla":"Balla, Jozef, et al. “Competitive Canalization of PIN Dependent Auxin Flow from Axillary Buds Controls Pea Bud Outgrowth.” <i>Plant Journal</i>, vol. 65, no. 4, Wiley-Blackwell, 2011, pp. 571–77, doi:<a href=\"https://doi.org/10.1111/j.1365-313X.2010.04443.x\">10.1111/j.1365-313X.2010.04443.x</a>.","short":"J. Balla, P. Kalousek, V. Reinöhl, J. Friml, S. Procházka, Plant Journal 65 (2011) 571–577.","ista":"Balla J, Kalousek P, Reinöhl V, Friml J, Procházka S. 2011. Competitive canalization of PIN dependent auxin flow from axillary buds controls pea bud outgrowth. Plant Journal. 65(4), 571–577."},"publisher":"Wiley-Blackwell","publication":"Plant Journal","date_created":"2018-12-11T12:01:16Z","page":"571 - 577","date_updated":"2021-01-12T07:40:56Z","publist_id":"3619","status":"public","year":"2011","doi":"10.1111/j.1365-313X.2010.04443.x","day":"01","fulldoi":"https://doi.org/10.1111/j.1365-313X.2010.04443.x","issue":"4","abstract":[{"text":"Shoot branching is one of the major determinants of plant architecture. Polar auxin transport in stems is necessary for the control of bud outgrowth by a dominant apex. Here, we show that following decapitation in pea (Pisum sativum L.), the axillary buds establish directional auxin export by subcellular polarization of PIN auxin transporters. Apical auxin application on the decapitated stem prevents this PIN polarization and canalization of laterally applied auxin. These results support a model in which the apical and lateral auxin sources compete for primary channels of auxin transport in the stem to control the outgrowth of axillary buds.","lang":"eng"}],"volume":65},{"fulldoi":"https://doi.org/10.1105/tpc.110.082099","day":"01","doi":"10.1105/tpc.110.082099","year":"2011","publist_id":"3617","status":"public","volume":23,"issue":"3","date_updated":"2021-01-12T07:40:56Z","page":"846 - 849","publication":"Plant Cell","date_created":"2018-12-11T12:01:16Z","publisher":"American Society of Plant Biologists","citation":{"mla":"Robinson, David, et al. “ARF1 Localizes to the Golgi and the Trans Golgi Network.” <i>Plant Cell</i>, vol. 23, no. 3, American Society of Plant Biologists, 2011, pp. 846–49, doi:<a href=\"https://doi.org/10.1105/tpc.110.082099\">10.1105/tpc.110.082099</a>.","short":"D. Robinson, D. Scheuring, S. Naramoto, J. Friml, Plant Cell 23 (2011) 846–849.","ista":"Robinson D, Scheuring D, Naramoto S, Friml J. 2011. ARF1 localizes to the golgi and the trans Golgi network. Plant Cell. 23(3), 846–849.","apa":"Robinson, D., Scheuring, D., Naramoto, S., &#38; Friml, J. (2011). ARF1 localizes to the golgi and the trans Golgi network. <i>Plant Cell</i>. American Society of Plant Biologists. <a href=\"https://doi.org/10.1105/tpc.110.082099\">https://doi.org/10.1105/tpc.110.082099</a>","ieee":"D. Robinson, D. Scheuring, S. Naramoto, and J. Friml, “ARF1 localizes to the golgi and the trans Golgi network,” <i>Plant Cell</i>, vol. 23, no. 3. American Society of Plant Biologists, pp. 846–849, 2011.","ama":"Robinson D, Scheuring D, Naramoto S, Friml J. ARF1 localizes to the golgi and the trans Golgi network. <i>Plant Cell</i>. 2011;23(3):846-849. doi:<a href=\"https://doi.org/10.1105/tpc.110.082099\">10.1105/tpc.110.082099</a>","chicago":"Robinson, David, David Scheuring, Satoshi Naramoto, and Jiří Friml. “ARF1 Localizes to the Golgi and the Trans Golgi Network.” <i>Plant Cell</i>. American Society of Plant Biologists, 2011. <a href=\"https://doi.org/10.1105/tpc.110.082099\">https://doi.org/10.1105/tpc.110.082099</a>."},"month":"03","_id":"3083","publication_status":"published","title":"ARF1 localizes to the golgi and the trans Golgi network","author":[{"last_name":"Robinson","full_name":"Robinson, David G","first_name":"David"},{"full_name":"Scheuring, David","first_name":"David","last_name":"Scheuring"},{"full_name":"Naramoto, Satoshi","first_name":"Satoshi","last_name":"Naramoto"},{"first_name":"Jirí","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"intvolume":"        23","type":"journal_article","extern":1,"date_published":"2011-03-01T00:00:00Z","quality_controlled":0},{"_id":"3084","month":"02","citation":{"mla":"Feraru, Elena, et al. “PIN Polarity Maintenance by the Cell Wall in Arabidopsis.” <i>Current Biology</i>, vol. 21, no. 4, Cell Press, 2011, pp. 338–43, doi:<a href=\"https://doi.org/10.1016/j.cub.2011.01.036\">10.1016/j.cub.2011.01.036</a>.","ista":"Feraru E, Feraru M, Kleine Vehn J, Martinière A, Mouille G, Vanneste S, Vernhettes S, Runions J, Friml J. 2011. PIN polarity maintenance by the cell wall in Arabidopsis. Current Biology. 21(4), 338–343.","short":"E. Feraru, M. Feraru, J. Kleine Vehn, A. Martinière, G. Mouille, S. Vanneste, S. Vernhettes, J. Runions, J. Friml, Current Biology 21 (2011) 338–343.","ama":"Feraru E, Feraru M, Kleine Vehn J, et al. PIN polarity maintenance by the cell wall in Arabidopsis. <i>Current Biology</i>. 2011;21(4):338-343. doi:<a href=\"https://doi.org/10.1016/j.cub.2011.01.036\">10.1016/j.cub.2011.01.036</a>","ieee":"E. Feraru <i>et al.</i>, “PIN polarity maintenance by the cell wall in Arabidopsis,” <i>Current Biology</i>, vol. 21, no. 4. Cell Press, pp. 338–343, 2011.","apa":"Feraru, E., Feraru, M., Kleine Vehn, J., Martinière, A., Mouille, G., Vanneste, S., … Friml, J. (2011). PIN polarity maintenance by the cell wall in Arabidopsis. <i>Current Biology</i>. Cell Press. <a href=\"https://doi.org/10.1016/j.cub.2011.01.036\">https://doi.org/10.1016/j.cub.2011.01.036</a>","chicago":"Feraru, Elena, Mugurel Feraru, Jürgen Kleine Vehn, Alexandre Martinière, Grégory Mouille, Steffen Vanneste, Samantha Vernhettes, John Runions, and Jiří Friml. “PIN Polarity Maintenance by the Cell Wall in Arabidopsis.” <i>Current Biology</i>. Cell Press, 2011. <a href=\"https://doi.org/10.1016/j.cub.2011.01.036\">https://doi.org/10.1016/j.cub.2011.01.036</a>."},"quality_controlled":0,"extern":1,"date_published":"2011-02-22T00:00:00Z","author":[{"last_name":"Feraru","first_name":"Elena","full_name":"Feraru, Elena"},{"full_name":"Feraru, Mugurel I","first_name":"Mugurel","last_name":"Feraru"},{"last_name":"Kleine Vehn","full_name":"Kleine-Vehn, Jürgen","first_name":"Jürgen"},{"full_name":"Martinière, Alexandre","first_name":"Alexandre","last_name":"Martinière"},{"first_name":"Grégory","full_name":"Mouille, Grégory","last_name":"Mouille"},{"first_name":"Steffen","full_name":"Vanneste, Steffen","last_name":"Vanneste"},{"full_name":"Vernhettes, Samantha","first_name":"Samantha","last_name":"Vernhettes"},{"last_name":"Runions","first_name":"John","full_name":"Runions, John"},{"first_name":"Jirí","full_name":"Jirí Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","last_name":"Friml","orcid":"0000-0002-8302-7596"}],"title":"PIN polarity maintenance by the cell wall in Arabidopsis","type":"journal_article","intvolume":"        21","publication_status":"published","abstract":[{"text":"\nA central question in developmental biology concerns the mechanism of generation and maintenance of cell polarity, because these processes are essential for many cellular functions and multicellular development [1]. In plants, cell polarity has an additional role in mediating directional transport of the plant hormone auxin that is crucial for multiple developmental processes [2-4]. In addition, plant cells have a complex extracellular matrix, the cell wall [5, 6], whose role in regulating cellular processes, including cell polarity, is unexplored. We have found that polar distribution of PIN auxin transporters [7] in plant cells is maintained by connections between polar domains at the plasma membrane and the cell wall. Genetic and pharmacological interference with cellulose, the major component of the cell wall, or mechanical interference with the cell wall disrupts these connections and leads to increased lateral diffusion and loss of polar distribution of PIN transporters for the phytohormone auxin. Our results reveal a plant-specific mechanism for cell polarity maintenance and provide a conceptual framework for modulating cell polarity and plant development via endogenous and environmental manipulations of the cellulose-based extracellular matrix.","lang":"eng"}],"issue":"4","volume":21,"doi":"10.1016/j.cub.2011.01.036","year":"2011","publist_id":"3618","status":"public","fulldoi":"https://doi.org/10.1016/j.cub.2011.01.036","day":"22","publication":"Current Biology","date_created":"2018-12-11T12:01:17Z","page":"338 - 343","date_updated":"2021-01-12T07:40:56Z","publisher":"Cell Press"},{"date_updated":"2021-01-12T07:40:57Z","publication":"Nature Cell Biology","page":"447 - 453","date_created":"2018-12-11T12:01:17Z","publisher":"Nature Publishing Group","volume":13,"abstract":[{"text":"Phototropism is an adaptation response, through which plants grow towards the light. It involves light perception and asymmetric distribution of the plant hormone auxin. Here we identify a crucial part of the mechanism for phototropism, revealing how light perception initiates auxin redistribution that leads to directional growth. We show that light polarizes the cellular localization of the auxin efflux carrier PIN3 in hypocotyl endodermis cells, resulting in changes in auxin distribution and differential growth. In the dark, high expression and activity of the PINOID (PID) kinase correlates with apolar targeting of PIN3 to all cell sides. Following illumination, light represses PINOID transcription and PIN3 is polarized specifically to the inner cell sides by GNOM ARF GTPase GEF (guanine nucleotide exchange factor)-dependent trafficking. Thus, differential trafficking at the shaded and illuminated hypocotyl side aligns PIN3 polarity with the light direction, and presumably redirects auxin flow towards the shaded side, where auxin promotes growth, causing hypocotyls to bend towards the light. Our results imply that PID phosphorylation-dependent recruitment of PIN proteins into distinct trafficking pathways is a mechanism to polarize auxin fluxes in response to different environmental and endogenous cues.","lang":"eng"}],"issue":"4","fulldoi":"https://doi.org/10.1038/ncb2208","day":"01","year":"2011","doi":"10.1038/ncb2208","publist_id":"3616","status":"public","date_published":"2011-04-01T00:00:00Z","extern":1,"quality_controlled":0,"publication_status":"published","author":[{"first_name":"Zhaojun","full_name":"Ding, Zhaojun","last_name":"Ding"},{"full_name":"Galván-Ampudia, Carlos S","first_name":"Carlos","last_name":"Galván Ampudia"},{"last_name":"Demarsy","first_name":"Emilie","full_name":"Demarsy, Emilie"},{"full_name":"Łangowski, Łukasz","first_name":"Łukasz","last_name":"Łangowski"},{"last_name":"Kleine Vehn","first_name":"Jürgen","full_name":"Kleine-Vehn, Jürgen"},{"first_name":"Yuanwei","full_name":"Fan, Yuanwei","last_name":"Fan"},{"full_name":"Morita, Miyo T","first_name":"Miyo","last_name":"Morita"},{"first_name":"Masao","full_name":"Tasaka, Masao","last_name":"Tasaka"},{"last_name":"Fankhauser","first_name":"Christian","full_name":"Fankhauser, Christian"},{"full_name":"Offringa, Remko","first_name":"Remko","last_name":"Offringa"},{"full_name":"Jirí Friml","first_name":"Jirí","last_name":"Friml","id":"4159519E-F248-11E8-B48F-1D18A9856A87","orcid":"0000-0002-8302-7596"}],"title":"Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis","intvolume":"        13","type":"journal_article","citation":{"ama":"Ding Z, Galván Ampudia C, Demarsy E, et al. Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis. <i>Nature Cell Biology</i>. 2011;13(4):447-453. doi:<a href=\"https://doi.org/10.1038/ncb2208\">10.1038/ncb2208</a>","ieee":"Z. Ding <i>et al.</i>, “Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis,” <i>Nature Cell Biology</i>, vol. 13, no. 4. Nature Publishing Group, pp. 447–453, 2011.","apa":"Ding, Z., Galván Ampudia, C., Demarsy, E., Łangowski, Ł., Kleine Vehn, J., Fan, Y., … Friml, J. (2011). Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis. <i>Nature Cell Biology</i>. Nature Publishing Group. <a href=\"https://doi.org/10.1038/ncb2208\">https://doi.org/10.1038/ncb2208</a>","chicago":"Ding, Zhaojun, Carlos Galván Ampudia, Emilie Demarsy, Łukasz Łangowski, Jürgen Kleine Vehn, Yuanwei Fan, Miyo Morita, et al. “Light-Mediated Polarization of the PIN3 Auxin Transporter for the Phototropic Response in Arabidopsis.” <i>Nature Cell Biology</i>. Nature Publishing Group, 2011. <a href=\"https://doi.org/10.1038/ncb2208\">https://doi.org/10.1038/ncb2208</a>.","mla":"Ding, Zhaojun, et al. “Light-Mediated Polarization of the PIN3 Auxin Transporter for the Phototropic Response in Arabidopsis.” <i>Nature Cell Biology</i>, vol. 13, no. 4, Nature Publishing Group, 2011, pp. 447–53, doi:<a href=\"https://doi.org/10.1038/ncb2208\">10.1038/ncb2208</a>.","ista":"Ding Z, Galván Ampudia C, Demarsy E, Łangowski Ł, Kleine Vehn J, Fan Y, Morita M, Tasaka M, Fankhauser C, Offringa R, Friml J. 2011. Light-mediated polarization of the PIN3 auxin transporter for the phototropic response in Arabidopsis. Nature Cell Biology. 13(4), 447–453.","short":"Z. Ding, C. Galván Ampudia, E. Demarsy, Ł. Łangowski, J. Kleine Vehn, Y. Fan, M. Morita, M. Tasaka, C. Fankhauser, R. Offringa, J. Friml, Nature Cell Biology 13 (2011) 447–453."},"_id":"3085","month":"04"},{"status":"public","language":[{"iso":"eng"}],"issue":"7","date_updated":"2024-10-14T12:01:21Z","date_created":"2023-02-20T08:18:03Z","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_processing_charge":"No","oa_version":"Published Version","citation":{"mla":"Finger, David, et al. “The Value of Glacier Mass Balance, Satellite Snow Cover Images, and Hourly Discharge for Improving the Performance of a Physically Based Distributed Hydrological Model.” <i>Water Resources Research</i>, vol. 47, no. 7, W07519, American Geophysical Union, 2011, doi:<a href=\"https://doi.org/10.1029/2010wr009824\">10.1029/2010wr009824</a>.","ista":"Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. 2011. The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. Water Resources Research. 47(7), W07519.","short":"D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, P. Burlando, Water Resources Research 47 (2011).","apa":"Finger, D., Pellicciotti, F., Konz, M., Rimkus, S., &#38; Burlando, P. (2011). The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. <i>Water Resources Research</i>. American Geophysical Union. <a href=\"https://doi.org/10.1029/2010wr009824\">https://doi.org/10.1029/2010wr009824</a>","ieee":"D. Finger, F. Pellicciotti, M. Konz, S. Rimkus, and P. Burlando, “The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model,” <i>Water Resources Research</i>, vol. 47, no. 7. American Geophysical Union, 2011.","ama":"Finger D, Pellicciotti F, Konz M, Rimkus S, Burlando P. The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model. <i>Water Resources Research</i>. 2011;47(7). doi:<a href=\"https://doi.org/10.1029/2010wr009824\">10.1029/2010wr009824</a>","chicago":"Finger, David, Francesca Pellicciotti, Markus Konz, Stefan Rimkus, and Paolo Burlando. “The Value of Glacier Mass Balance, Satellite Snow Cover Images, and Hourly Discharge for Improving the Performance of a Physically Based Distributed Hydrological Model.” <i>Water Resources Research</i>. American Geophysical Union, 2011. <a href=\"https://doi.org/10.1029/2010wr009824\">https://doi.org/10.1029/2010wr009824</a>."},"month":"07","publication_status":"published","type":"journal_article","author":[{"last_name":"Finger","full_name":"Finger, David","first_name":"David"},{"orcid":"0000-0002-5554-8087","last_name":"Pellicciotti","id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","full_name":"Pellicciotti, Francesca","first_name":"Francesca"},{"first_name":"Markus","full_name":"Konz, Markus","last_name":"Konz"},{"last_name":"Rimkus","full_name":"Rimkus, Stefan","first_name":"Stefan"},{"full_name":"Burlando, Paolo","first_name":"Paolo","last_name":"Burlando"}],"extern":"1","quality_controlled":"1","day":"01","fulldoi":"https://doi.org/10.1029/2010wr009824","doi":"10.1029/2010wr009824","year":"2011","volume":47,"abstract":[{"lang":"eng","text":"Physically based hydrological models describe natural processes more accurately than conceptual models but require extensive data sets to produce accurate results. To identify the value of different data sets for improving the performance of the distributed hydrological model TOPKAPI we combine a multivariable validation technique with Monte Carlo simulations. The study is carried out in the snow and ice-dominated Rhonegletscher basin, as these types of mountainous basins are generally the most critical with respect to data availability and sensitivity to climate fluctuations. Each observational data set is used individually and in combination with the other data sets to determine a subset of best parameter combinations out of 10,000 Monte Carlos runs performed with randomly generated parameter sets. We validate model results against discharge, glacier mass balance, and satellite snow cover images for a 14 year time period (1994–2007). While the use of all data sets combined provides the best overall model performance (defined by the concurrent best agreement of simulated discharge, snow cover and mass balance with their respective measurements), the use of one or two variables for constraining the model results in poorer performance. Using only one data set for constraining the model glacier mass balance proved to be the most efficient observation leading to the best overall model performance. Our main result is that a combination of discharge and satellite snow cover images is best for improving model performance, since the volumetric information of discharge data and the spatial information of snow cover images are complementary."}],"main_file_link":[{"url":"https://doi.org/10.1029/2010WR009824","open_access":"1"}],"publisher":"American Geophysical Union","publication":"Water Resources Research","publication_identifier":{"issn":["0043-1397"]},"oa":1,"_id":"12649","intvolume":"        47","article_number":"W07519","scopus_import":"1","title":"The value of glacier mass balance, satellite snow cover images, and hourly discharge for improving the performance of a physically based distributed hydrological model","article_type":"original","date_published":"2011-07-01T00:00:00Z"},{"editor":[{"first_name":"Vijay","full_name":"Singh, Vijay","last_name":"Singh"},{"full_name":"Singh, Pratap","first_name":"Pratap","last_name":"Singh"},{"full_name":"Haritashya, Umesh","first_name":"Umesh","last_name":"Haritashya"}],"publication_identifier":{"eisbn":["978-90-481-2642-2"],"isbn":["978-90-481-2641-5"],"eissn":["1871-756X"],"issn":["1388-4360"]},"_id":"12650","title":"Streamflow Trends in Mountainous Regions","scopus_import":"1","date_published":"2011-07-01T00:00:00Z","doi":"10.1007/978-90-481-2642-2_543","year":"2011","fulldoi":"https://doi.org/10.1007/978-90-481-2642-2_543","day":"01","abstract":[{"lang":"eng","text":"Streamflow is a hydrological variable measured at a defined river cross-section; it spatially integrates the runoff generating processes in the contributing watershed, including precipitation and air temperature. Trends in streamflow are progressive changes in the time series of streamflow that can be detected with statistical methods and their statistical significance can be assessed. Mountainous regions are particularly vulnerable to streamflow change because of their high specific runoff and the sensitivity to the distribution of precipitation and air temperature, and the processes of snow accumulation and melt."}],"place":"Dordrecht","page":"1084-1089","publication":"Encyclopedia of Snow, Ice and Glaciers","publisher":"Springer Nature","article_processing_charge":"No","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","month":"07","edition":"1","citation":{"chicago":"Molnar, Peter, Paolo Burlando, and Francesca Pellicciotti. “Streamflow Trends in Mountainous Regions.” In <i>Encyclopedia of Snow, Ice and Glaciers</i>, edited by Vijay Singh, Pratap Singh, and Umesh Haritashya, 1st ed., 1084–89. Dordrecht: Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">https://doi.org/10.1007/978-90-481-2642-2_543</a>.","ama":"Molnar P, Burlando P, Pellicciotti F. Streamflow Trends in Mountainous Regions. In: Singh V, Singh P, Haritashya U, eds. <i>Encyclopedia of Snow, Ice and Glaciers</i>. 1st ed. Dordrecht: Springer Nature; 2011:1084-1089. doi:<a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">10.1007/978-90-481-2642-2_543</a>","ieee":"P. Molnar, P. Burlando, and F. Pellicciotti, “Streamflow Trends in Mountainous Regions,” in <i>Encyclopedia of Snow, Ice and Glaciers</i>, 1st ed., V. Singh, P. Singh, and U. Haritashya, Eds. Dordrecht: Springer Nature, 2011, pp. 1084–1089.","apa":"Molnar, P., Burlando, P., &#38; Pellicciotti, F. (2011). Streamflow Trends in Mountainous Regions. In V. Singh, P. Singh, &#38; U. Haritashya (Eds.), <i>Encyclopedia of Snow, Ice and Glaciers</i> (1st ed., pp. 1084–1089). Dordrecht: Springer Nature. <a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">https://doi.org/10.1007/978-90-481-2642-2_543</a>","short":"P. Molnar, P. Burlando, F. Pellicciotti, in:, V. Singh, P. Singh, U. Haritashya (Eds.), Encyclopedia of Snow, Ice and Glaciers, 1st ed., Springer Nature, Dordrecht, 2011, pp. 1084–1089.","ista":"Molnar P, Burlando P, Pellicciotti F. 2011.Streamflow Trends in Mountainous Regions. In: Encyclopedia of Snow, Ice and Glaciers. Encyclopedia of Earth Sciences Series, , 1084–1089.","mla":"Molnar, Peter, et al. “Streamflow Trends in Mountainous Regions.” <i>Encyclopedia of Snow, Ice and Glaciers</i>, edited by Vijay Singh et al., 1st ed., Springer Nature, 2011, pp. 1084–89, doi:<a href=\"https://doi.org/10.1007/978-90-481-2642-2_543\">10.1007/978-90-481-2642-2_543</a>."},"oa_version":"None","author":[{"full_name":"Molnar, Peter","first_name":"Peter","last_name":"Molnar"},{"full_name":"Burlando, Paolo","first_name":"Paolo","last_name":"Burlando"},{"id":"b28f055a-81ea-11ed-b70c-a9fe7f7b0e70","last_name":"Pellicciotti","first_name":"Francesca","full_name":"Pellicciotti, Francesca"}],"type":"book_chapter","alternative_title":["Encyclopedia of Earth Sciences Series"],"publication_status":"published","quality_controlled":"1","extern":"1","status":"public","language":[{"iso":"eng"}],"date_updated":"2023-02-20T10:35:28Z","date_created":"2023-02-20T08:18:07Z"}]