[{"date_updated":"2024-11-06T12:07:30Z","publication_identifier":{"issn":["1559-1131"],"eissn":["1559-114X"]},"language":[{"iso":"eng"}],"quality_controlled":"1","intvolume":"         5","article_number":"15","date_created":"2022-07-27T13:48:11Z","type":"journal_article","publisher":"Association for Computing Machinery","day":"01","doi":"10.1145/1993053.1993057","volume":5,"citation":{"ama":"Baykan E, Henzinger M, Marian L, Weber I. A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. 2011;5(3). doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>","chicago":"Baykan, Eda, Monika Henzinger, Ludmila Marian, and Ingmar Weber. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>.","short":"E. Baykan, M. Henzinger, L. Marian, I. Weber, ACM Transactions on the Web 5 (2011).","ieee":"E. Baykan, M. Henzinger, L. Marian, and I. Weber, “A comprehensive study of features and algorithms for URL-based topic classification,” <i>ACM Transactions on the Web</i>, vol. 5, no. 3. Association for Computing Machinery, 2011.","ista":"Baykan E, Henzinger M, Marian L, Weber I. 2011. A comprehensive study of features and algorithms for URL-based topic classification. ACM Transactions on the Web. 5(3), 15.","apa":"Baykan, E., Henzinger, M., Marian, L., &#38; Weber, I. (2011). A comprehensive study of features and algorithms for URL-based topic classification. <i>ACM Transactions on the Web</i>. Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1993053.1993057\">https://doi.org/10.1145/1993053.1993057</a>","mla":"Baykan, Eda, et al. “A Comprehensive Study of Features and Algorithms for URL-Based Topic Classification.” <i>ACM Transactions on the Web</i>, vol. 5, no. 3, 15, Association for Computing Machinery, 2011, doi:<a href=\"https://doi.org/10.1145/1993053.1993057\">10.1145/1993053.1993057</a>."},"extern":"1","publication":"ACM Transactions on the Web","status":"public","date_published":"2011-07-01T00:00:00Z","abstract":[{"text":"Given only the URL of a Web page, can we identify its topic? We study this problem in detail by exploring a large number of different feature sets and algorithms on several datasets. We also show that the inherent overlap between topics and the sparsity of the information in URLs makes this a very challenging problem. Web page classification without a page’s content is desirable when the content is not available at all, when a classification is needed before obtaining the content, or when classification speed is of utmost importance. For our experiments we used five different corpora comprising a total of about 3 million (URL, classification) pairs. We evaluated several techniques for feature generation and classification algorithms. The individual binary classifiers were then combined via boosting into metabinary classifiers. We achieve typical F-measure values between 80 and 85, and a typical precision of around 86. The precision can be pushed further over 90 while maintaining a typical level of recall between 30 and 40.","lang":"eng"}],"scopus_import":"1","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"full_name":"Baykan, Eda","first_name":"Eda","last_name":"Baykan"},{"first_name":"Monika H","full_name":"Henzinger, Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Ludmila","full_name":"Marian, Ludmila","last_name":"Marian"},{"last_name":"Weber","full_name":"Weber, Ingmar","first_name":"Ingmar"}],"article_type":"original","publication_status":"published","keyword":["Topic classification","URL","ODP"],"title":"A comprehensive study of features and algorithms for URL-based topic classification","oa_version":"None","issue":"3","_id":"11673","year":"2011","month":"07","article_processing_charge":"No"},{"extern":"1","month":"01","publication":"Information Processing Letters","article_processing_charge":"No","page":"178-183","doi":"10.1016/j.ipl.2010.11.022","publisher":"Elsevier","day":"15","title":"Offline file assignments for online load balancing","type":"journal_article","year":"2011","issue":"4","_id":"11760","citation":{"chicago":"Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>. Elsevier, 2011. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>.","ama":"Dütting P, Henzinger M, Weber I. Offline file assignments for online load balancing. <i>Information Processing Letters</i>. 2011;111(4):178-183. doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>","ieee":"P. Dütting, M. Henzinger, and I. Weber, “Offline file assignments for online load balancing,” <i>Information Processing Letters</i>, vol. 111, no. 4. Elsevier, pp. 178–183, 2011.","mla":"Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.” <i>Information Processing Letters</i>, vol. 111, no. 4, Elsevier, 2011, pp. 178–83, doi:<a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">10.1016/j.ipl.2010.11.022</a>.","apa":"Dütting, P., Henzinger, M., &#38; Weber, I. (2011). Offline file assignments for online load balancing. <i>Information Processing Letters</i>. Elsevier. <a href=\"https://doi.org/10.1016/j.ipl.2010.11.022\">https://doi.org/10.1016/j.ipl.2010.11.022</a>","ista":"Dütting P, Henzinger M, Weber I. 2011. Offline file assignments for online load balancing. Information Processing Letters. 111(4), 178–183.","short":"P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 111 (2011) 178–183."},"volume":111,"oa_version":"None","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","article_type":"original","date_created":"2022-08-08T11:33:03Z","publication_status":"published","author":[{"last_name":"Dütting","first_name":"Paul","full_name":"Dütting, Paul"},{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H"},{"last_name":"Weber","full_name":"Weber, Ingmar","first_name":"Ingmar"}],"date_updated":"2024-11-06T12:09:49Z","intvolume":"       111","quality_controlled":"1","scopus_import":"1","abstract":[{"lang":"eng","text":"We study a novel load balancing problem that arises in web search engines. The problem is a combination of an offline assignment problem, where files need to be (copied and) assigned to machines, and an online load balancing problem, where requests ask for specific files and need to be assigned to a corresponding machine, whose load is increased\r\nby this. We present simple deterministic algorithms for this problem and exhibit an interesting trade-off between the available space to make file copies and the obtainable makespan. We also give non-trivial lower bounds for a large class of deterministic algorithms and present a randomized algorithm that beats these bounds with high probability."}],"language":[{"iso":"eng"}],"date_published":"2011-01-15T00:00:00Z","publication_identifier":{"issn":["0020-0190"]},"status":"public"},{"user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","author":[{"orcid":"0000-0002-5008-6530","last_name":"Henzinger","first_name":"Monika H","id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H"},{"full_name":"Vidali, Angelina","first_name":"Angelina","last_name":"Vidali"}],"publication_status":"published","date_created":"2022-08-11T11:51:39Z","conference":{"start_date":"2011-09-05","end_date":"2011-09-09","name":"ESA: European Symposium on Algorithms","location":"Saarbrücken, Germany"},"date_updated":"2024-11-06T12:13:02Z","publication_identifier":{"issn":["1611-3349"],"isbn":["9783642237188"]},"status":"public","intvolume":"      6942","language":[{"iso":"eng"}],"scopus_import":"1","quality_controlled":"1","date_published":"2011-09-01T00:00:00Z","abstract":[{"lang":"eng","text":"The design of truthful auctions that approximate the optimal expected revenue is a central problem in algorithmic mechanism design. 30 years after Myerson’s characterization of Bayesian optimal auctions in single-parameter domains [8], characterizing but also providing efficient mechanisms for multi-parameter domains still remains a very important unsolved problem. Our work improves upon recent results in this area, introducing new techniques for tackling the problem, while also combining and extending recently introduced tools.\r\n\r\nIn particular we give the first approximation algorithms for Bayesian auctions with multiple heterogeneous items when bidders have additive valuations, budget constraints and general matroid feasibility constraints."}],"month":"09","extern":"1","alternative_title":["LNCS"],"article_processing_charge":"No","publication":"19th Annual European Symposium on Algorithms","title":"Multi-parameter mechanism design under budget and matroid constraints","type":"conference","page":"192–202","doi":"10.1007/978-3-642-23719-5_17","day":"01","publisher":"Springer Nature","volume":6942,"oa_version":"None","year":"2011","citation":{"mla":"Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” <i>19th Annual European Symposium on Algorithms</i>, vol. 6942, Springer Nature, 2011, pp. 192–202, doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>.","ista":"Henzinger M, Vidali A. 2011. Multi-parameter mechanism design under budget and matroid constraints. 19th Annual European Symposium on Algorithms. ESA: European Symposium on Algorithms, LNCS, vol. 6942, 192–202.","apa":"Henzinger, M., &#38; Vidali, A. (2011). Multi-parameter mechanism design under budget and matroid constraints. In <i>19th Annual European Symposium on Algorithms</i> (Vol. 6942, pp. 192–202). Saarbrücken, Germany: Springer Nature. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>","ieee":"M. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget and matroid constraints,” in <i>19th Annual European Symposium on Algorithms</i>, Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.","short":"M. Henzinger, A. Vidali, in:, 19th Annual European Symposium on Algorithms, Springer Nature, 2011, pp. 192–202.","chicago":"Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design under Budget and Matroid Constraints.” In <i>19th Annual European Symposium on Algorithms</i>, 6942:192–202. Springer Nature, 2011. <a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">https://doi.org/10.1007/978-3-642-23719-5_17</a>.","ama":"Henzinger M, Vidali A. Multi-parameter mechanism design under budget and matroid constraints. In: <i>19th Annual European Symposium on Algorithms</i>. Vol 6942. Springer Nature; 2011:192–202. doi:<a href=\"https://doi.org/10.1007/978-3-642-23719-5_17\">10.1007/978-3-642-23719-5_17</a>"},"_id":"11796"},{"status":"public","publication_identifier":{"isbn":["978-145030632-4"]},"quality_controlled":"1","scopus_import":"1","date_published":"2011-04-01T00:00:00Z","abstract":[{"text":"Auctions are widely used on the Web. Applications range from internet advertising to platforms such as eBay. In most of these applications the auctions in use are single/multi-item auctions with unit demand. The main drawback of standard mechanisms for this type of auctions, such as VCG and GSP, is the limited expressiveness that they offer to the bidders. The General Auction Mechanism (GAM) of [1] is taking a first step towards addressing the problem of limited expressiveness by computing a bidder optimal, envy free outcome for linear utility functions with identical slopes and a single discontinuity per bidder-item pair. We show that in many practical situations this does not suffice to adequately model the preferences of the bidders, and we overcome this problem by presenting the first mechanism for piece-wise linear utility functions with non-identical slopes and multiple discontinuities. Our mechanism runs in polynomial time. Like GAM it is incentive compatible for inputs that fulfill a certain non-degeneracy requirement, but our requirement is more general than the requirement of GAM. For discontinuous utility functions that are non-degenerate as well as for continuous utility functions the outcome of our mechanism is a competitive equilibrium. We also show how our mechanism can be used to compute approximately bidder optimal, envy free outcomes for a general class of continuous utility functions via piece-wise linear approximation. Finally, we prove hardness results for even more expressive settings.","lang":"eng"}],"language":[{"iso":"eng"}],"conference":{"end_date":"2011-04-01","name":"WWW: International Conference on World Wide Web","start_date":"2011-03-28","location":"Hyderabad, India"},"date_updated":"2024-11-06T12:19:04Z","author":[{"first_name":"Paul","full_name":"Dütting, Paul","last_name":"Dütting"},{"id":"540c9bbd-f2de-11ec-812d-d04a5be85630","full_name":"Henzinger, Monika H","first_name":"Monika H","last_name":"Henzinger","orcid":"0000-0002-5008-6530"},{"first_name":"Ingmar","full_name":"Weber, Ingmar","last_name":"Weber"}],"date_created":"2022-08-16T09:05:34Z","publication_status":"published","user_id":"2DF688A6-F248-11E8-B48F-1D18A9856A87","oa_version":"None","year":"2011","citation":{"ieee":"P. Dütting, M. Henzinger, and I. Weber, “An expressive mechanism for auctions on the web,” in <i>Proceedings of the 20th international conference on World wide web</i>, Hyderabad, India, 2011, pp. 127–136.","apa":"Dütting, P., Henzinger, M., &#38; Weber, I. (2011). An expressive mechanism for auctions on the web. In <i>Proceedings of the 20th international conference on World wide web</i> (pp. 127–136). Hyderabad, India: Association for Computing Machinery. <a href=\"https://doi.org/10.1145/1963405.1963427\">https://doi.org/10.1145/1963405.1963427</a>","mla":"Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” <i>Proceedings of the 20th International Conference on World Wide Web</i>, Association for Computing Machinery, 2011, pp. 127–36, doi:<a href=\"https://doi.org/10.1145/1963405.1963427\">10.1145/1963405.1963427</a>.","ista":"Dütting P, Henzinger M, Weber I. 2011. An expressive mechanism for auctions on the web. Proceedings of the 20th international conference on World wide web. WWW: International Conference on World Wide Web, 127–136.","short":"P. Dütting, M. Henzinger, I. Weber, in:, Proceedings of the 20th International Conference on World Wide Web, Association for Computing Machinery, 2011, pp. 127–136.","chicago":"Dütting, Paul, Monika Henzinger, and Ingmar Weber. “An Expressive Mechanism for Auctions on the Web.” In <i>Proceedings of the 20th International Conference on World Wide Web</i>, 127–36. Association for Computing Machinery, 2011. <a href=\"https://doi.org/10.1145/1963405.1963427\">https://doi.org/10.1145/1963405.1963427</a>.","ama":"Dütting P, Henzinger M, Weber I. An expressive mechanism for auctions on the web. In: <i>Proceedings of the 20th International Conference on World Wide Web</i>. Association for Computing Machinery; 2011:127-136. doi:<a href=\"https://doi.org/10.1145/1963405.1963427\">10.1145/1963405.1963427</a>"},"_id":"11864","title":"An expressive mechanism for auctions on the web","type":"conference","page":"127 - 136","publisher":"Association for Computing Machinery","day":"01","doi":"10.1145/1963405.1963427","article_processing_charge":"No","publication":"Proceedings of the 20th international conference on World wide web","month":"04","extern":"1"},{"extern":1,"publist_id":"4175","month":"04","publication":"Communications in Mathematical Physics","publisher":"Springer","doi":"10.1007/s00220-011-1204-2","day":"01","page":"509 - 554","type":"journal_article","title":"Quantum diffusion and eigenfunction delocalization in a random band matrix model","_id":"2717","issue":"2","citation":{"short":"L. Erdös, A. Knowles, Communications in Mathematical Physics 303 (2011) 509–554.","apa":"Erdös, L., &#38; Knowles, A. (2011). Quantum diffusion and eigenfunction delocalization in a random band matrix model. <i>Communications in Mathematical Physics</i>. Springer. <a href=\"https://doi.org/10.1007/s00220-011-1204-2\">https://doi.org/10.1007/s00220-011-1204-2</a>","ista":"Erdös L, Knowles A. 2011. Quantum diffusion and eigenfunction delocalization in a random band matrix model. Communications in Mathematical Physics. 303(2), 509–554.","mla":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Eigenfunction Delocalization in a Random Band Matrix Model.” <i>Communications in Mathematical Physics</i>, vol. 303, no. 2, Springer, 2011, pp. 509–54, doi:<a href=\"https://doi.org/10.1007/s00220-011-1204-2\">10.1007/s00220-011-1204-2</a>.","ieee":"L. Erdös and A. Knowles, “Quantum diffusion and eigenfunction delocalization in a random band matrix model,” <i>Communications in Mathematical Physics</i>, vol. 303, no. 2. Springer, pp. 509–554, 2011.","ama":"Erdös L, Knowles A. Quantum diffusion and eigenfunction delocalization in a random band matrix model. <i>Communications in Mathematical Physics</i>. 2011;303(2):509-554. doi:<a href=\"https://doi.org/10.1007/s00220-011-1204-2\">10.1007/s00220-011-1204-2</a>","chicago":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Eigenfunction Delocalization in a Random Band Matrix Model.” <i>Communications in Mathematical Physics</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00220-011-1204-2\">https://doi.org/10.1007/s00220-011-1204-2</a>."},"year":"2011","volume":303,"date_created":"2018-12-11T11:59:14Z","publication_status":"published","author":[{"id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"László Erdös","first_name":"László","orcid":"0000-0001-5366-9603","last_name":"Erdös"},{"last_name":"Knowles","full_name":"Knowles, Antti","first_name":"Antti"}],"date_updated":"2021-01-12T06:59:15Z","quality_controlled":0,"date_published":"2011-04-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider Hermitian and symmetric random band matrices H in d ≥ 1 dimensions. The matrix elements H xy, indexed by, are independent, uniformly distributed random variables if {pipe}x-y{pipe} is less than the band width W, and zero otherwise. We prove that the time evolution of a quantum particle subject to the Hamiltonian H is diffusive on time scales. We also show that the localization length of the eigenvectors of H is larger than a factor W d/6 times the band width. All results are uniform in the size of the matrix. "}],"intvolume":"       303","status":"public"},{"title":"Universality of random matrices and local relaxation flow","type":"journal_article","page":"75 - 119","day":"01","doi":"10.1007/s00222-010-0302-7","publisher":"Springer","volume":185,"year":"2011","issue":"1","_id":"2764","citation":{"ieee":"L. Erdös, B. Schlein, and H. Yau, “Universality of random matrices and local relaxation flow,” <i>Inventiones Mathematicae</i>, vol. 185, no. 1. Springer, pp. 75–119, 2011.","mla":"Erdös, László, et al. “Universality of Random Matrices and Local Relaxation Flow.” <i>Inventiones Mathematicae</i>, vol. 185, no. 1, Springer, 2011, pp. 75–119, doi:<a href=\"https://doi.org/10.1007/s00222-010-0302-7\">10.1007/s00222-010-0302-7</a>.","ista":"Erdös L, Schlein B, Yau H. 2011. Universality of random matrices and local relaxation flow. Inventiones Mathematicae. 185(1), 75–119.","apa":"Erdös, L., Schlein, B., &#38; Yau, H. (2011). Universality of random matrices and local relaxation flow. <i>Inventiones Mathematicae</i>. Springer. <a href=\"https://doi.org/10.1007/s00222-010-0302-7\">https://doi.org/10.1007/s00222-010-0302-7</a>","short":"L. Erdös, B. Schlein, H. Yau, Inventiones Mathematicae 185 (2011) 75–119.","chicago":"Erdös, László, Benjamin Schlein, and Horng Yau. “Universality of Random Matrices and Local Relaxation Flow.” <i>Inventiones Mathematicae</i>. Springer, 2011. <a href=\"https://doi.org/10.1007/s00222-010-0302-7\">https://doi.org/10.1007/s00222-010-0302-7</a>.","ama":"Erdös L, Schlein B, Yau H. Universality of random matrices and local relaxation flow. <i>Inventiones Mathematicae</i>. 2011;185(1):75-119. doi:<a href=\"https://doi.org/10.1007/s00222-010-0302-7\">10.1007/s00222-010-0302-7</a>"},"month":"07","publist_id":"4126","extern":1,"publication":"Inventiones Mathematicae","date_updated":"2021-01-12T06:59:32Z","status":"public","intvolume":"       185","abstract":[{"lang":"eng","text":"Consider the Dyson Brownian motion with parameter β, where β=1,2,4 corresponds to the eigenvalue flows for the eigenvalues of symmetric, hermitian and quaternion self-dual ensembles. For any β≥1, we prove that the relaxation time to local equilibrium for the Dyson Brownian motion is bounded above by N -ζ for some ζ&gt; 0. The proof is based on an estimate of the entropy flow of the Dyson Brownian motion w. r. t. a &quot;pseudo equilibrium measure&quot;. As an application of this estimate, we prove that the eigenvalue spacing statistics in the bulk of the spectrum for N×N symmetric Wigner ensemble is the same as that of the Gaussian Orthogonal Ensemble (GOE) in the limit N→∞. The assumptions on the probability distribution of the matrix elements of the Wigner ensemble are a subexponential decay and some minor restriction on the support."}],"quality_controlled":0,"date_published":"2011-07-01T00:00:00Z","author":[{"last_name":"Erdös","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"László Erdös","first_name":"László"},{"first_name":"Benjamin","full_name":"Schlein, Benjamin","last_name":"Schlein"},{"last_name":"Yau","first_name":"Horng","full_name":"Yau, Horng-Tzer"}],"date_created":"2018-12-11T11:59:29Z","publication_status":"published"},{"date_created":"2018-12-11T11:59:29Z","publication_status":"published","author":[{"orcid":"0000-0001-5366-9603","last_name":"Erdös","first_name":"László","full_name":"László Erdös","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87"}],"date_updated":"2019-04-26T07:22:20Z","intvolume":"        66","quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","abstract":[{"text":"This is a study of the universality of spectral statistics for large random matrices. Considered are N×N symmetric, Hermitian, or quaternion self-dual random matrices with independent identically distributed entries (Wigner matrices), where the probability distribution of each matrix element is given by a measure v with zero expectation and with subexponential decay. The main result is that the correlation functions of the local eigenvalue statistics in the bulk of the spectrum coincide with those of the Gaussian Orthogonal Ensemble (GOE), the Gaussian Unitary Ensemble (GUE), and the Gaussian Symplectic Ensemble (GSE), respectively, in the limit as N → ∞. This approach is based on a study of the Dyson Brownian motion via a related new dynamics, the local relaxation flow. As a main input, it is established that the density of the eigenvalues converges to the Wigner semicircle law, and this holds even down to the smallest possible scale. Moreover, it is shown that the eigenvectors are completely delocalized. These results hold even without the condition that the matrix elements are identically distributed: only independence is used. In fact, for the matrix elements of the Green function strong estimates are given that imply that the local statistics of any two ensembles in the bulk are identical if the first four moments of the matrix elements match. Universality at the spectral edges requires matching only two moments. A Wigner-type estimate is also proved, and it is shown that the eigenvalues repel each other on arbitrarily small scales.","lang":"eng"}],"status":"public","extern":1,"main_file_link":[{"url":"http://arxiv.org/abs/1004.0861","open_access":"0"}],"publist_id":"4125","month":"01","publication":"Russian Mathematical Surveys","page":"507 - 626","day":"01","doi":"10.1070/RM2011v066n03ABEH004749","publisher":"IOP Publishing Ltd.","title":"Universality of Wigner random matrices: A survey of recent results","type":"review","year":"2011","issue":"3","_id":"2765","citation":{"ieee":"L. Erdös, “Universality of Wigner random matrices: A survey of recent results,” <i>Russian Mathematical Surveys</i>, vol. 66, no. 3. IOP Publishing Ltd., pp. 507–626, 2011.","apa":"Erdös, L. (2011). Universality of Wigner random matrices: A survey of recent results. <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd. <a href=\"https://doi.org/10.1070/RM2011v066n03ABEH004749\">https://doi.org/10.1070/RM2011v066n03ABEH004749</a>","mla":"Erdös, László. “Universality of Wigner Random Matrices: A Survey of Recent Results.” <i>Russian Mathematical Surveys</i>, vol. 66, no. 3, IOP Publishing Ltd., 2011, pp. 507–626, doi:<a href=\"https://doi.org/10.1070/RM2011v066n03ABEH004749\">10.1070/RM2011v066n03ABEH004749</a>.","ista":"Erdös L. 2011. Universality of Wigner random matrices: A survey of recent results. Russian Mathematical Surveys. 66(3), 507–626.","short":"L. Erdös, Russian Mathematical Surveys 66 (2011) 507–626.","chicago":"Erdös, László. “Universality of Wigner Random Matrices: A Survey of Recent Results.” <i>Russian Mathematical Surveys</i>. IOP Publishing Ltd., 2011. <a href=\"https://doi.org/10.1070/RM2011v066n03ABEH004749\">https://doi.org/10.1070/RM2011v066n03ABEH004749</a>.","ama":"Erdös L. Universality of Wigner random matrices: A survey of recent results. <i>Russian Mathematical Surveys</i>. 2011;66(3):507-626. doi:<a href=\"https://doi.org/10.1070/RM2011v066n03ABEH004749\">10.1070/RM2011v066n03ABEH004749</a>"},"volume":66},{"date_updated":"2021-01-12T06:59:33Z","status":"public","date_published":"2011-11-01T00:00:00Z","abstract":[{"lang":"eng","text":"We consider Hermitian and symmetric random band matrices H in d ≥ dimensions. The matrix elements Hxy, indexed by x,y ∈ Λ ⊂ ℤd are independent and their variances satisfy σ2xy:= E{pipe}Hxy{pipe}2 = W-d f((x-y)/W for some probability density f. We assume that the law of each matrix element Hxy is symmetric and exhibits subexponential decay. We prove that the time evolution of a quantum particle subject to the Hamiltonian H is diffusive on time scales ≪ Wd/3. We also show that the localization length of the eigenvectors of H is larger than a factor Wd/6 times the band width W. All results are uniform in the size {pipe}Λ{pipe} of the matrix. This extends our recent result (Erdo{double acute}s and Knowles in Commun. Math. Phys., 2011) to general band matrices. As another consequence of our proof we show that, for a larger class of random matrices satisfying Σx σ2xy for all y, the largest eigenvalue of H is bounded with high probability by 2+M-2/3+e{open} for any e{open} &gt; 0, where M:= 1/(maxx,y σ2xy)."}],"quality_controlled":0,"intvolume":"        12","author":[{"last_name":"Erdös","orcid":"0000-0001-5366-9603","id":"4DBD5372-F248-11E8-B48F-1D18A9856A87","full_name":"László Erdös","first_name":"László"},{"last_name":"Knowles","first_name":"Antti","full_name":"Knowles, Antti"}],"date_created":"2018-12-11T11:59:29Z","publication_status":"published","type":"journal_article","title":"Quantum diffusion and delocalization for band matrices with general distribution","publisher":"Birkhäuser","doi":"10.1007/s00023-011-0104-5","day":"01","page":"1227 - 1319","volume":12,"citation":{"ieee":"L. Erdös and A. Knowles, “Quantum diffusion and delocalization for band matrices with general distribution,” <i>Annales Henri Poincare</i>, vol. 12, no. 7. Birkhäuser, pp. 1227–1319, 2011.","apa":"Erdös, L., &#38; Knowles, A. (2011). Quantum diffusion and delocalization for band matrices with general distribution. <i>Annales Henri Poincare</i>. Birkhäuser. <a href=\"https://doi.org/10.1007/s00023-011-0104-5\">https://doi.org/10.1007/s00023-011-0104-5</a>","mla":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization for Band Matrices with General Distribution.” <i>Annales Henri Poincare</i>, vol. 12, no. 7, Birkhäuser, 2011, pp. 1227–319, doi:<a href=\"https://doi.org/10.1007/s00023-011-0104-5\">10.1007/s00023-011-0104-5</a>.","ista":"Erdös L, Knowles A. 2011. Quantum diffusion and delocalization for band matrices with general distribution. Annales Henri Poincare. 12(7), 1227–1319.","short":"L. Erdös, A. Knowles, Annales Henri Poincare 12 (2011) 1227–1319.","chicago":"Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization for Band Matrices with General Distribution.” <i>Annales Henri Poincare</i>. Birkhäuser, 2011. <a href=\"https://doi.org/10.1007/s00023-011-0104-5\">https://doi.org/10.1007/s00023-011-0104-5</a>.","ama":"Erdös L, Knowles A. Quantum diffusion and delocalization for band matrices with general distribution. <i>Annales Henri Poincare</i>. 2011;12(7):1227-1319. doi:<a href=\"https://doi.org/10.1007/s00023-011-0104-5\">10.1007/s00023-011-0104-5</a>"},"_id":"2766","issue":"7","year":"2011","publist_id":"4124","month":"11","extern":1,"publication":"Annales Henri Poincare"},{"day":"08","doi":"10.1126/science.1203223","publisher":"American Association for the Advancement of Science","page":"192 - 196","type":"journal_article","title":"The onset of turbulence in pipe flow","_id":"2799","issue":"6039","citation":{"short":"K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, B. Hof, Science 333 (2011) 192–196.","apa":"Avila, K., Moxey, D., De Lózar, A., Avila, M., Barkley, D., &#38; Hof, B. (2011). The onset of turbulence in pipe flow. <i>Science</i>. American Association for the Advancement of Science. <a href=\"https://doi.org/10.1126/science.1203223\">https://doi.org/10.1126/science.1203223</a>","ista":"Avila K, Moxey D, De Lózar A, Avila M, Barkley D, Hof B. 2011. The onset of turbulence in pipe flow. Science. 333(6039), 192–196.","mla":"Avila, Kerstin, et al. “The Onset of Turbulence in Pipe Flow.” <i>Science</i>, vol. 333, no. 6039, American Association for the Advancement of Science, 2011, pp. 192–96, doi:<a href=\"https://doi.org/10.1126/science.1203223\">10.1126/science.1203223</a>.","ieee":"K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, and B. Hof, “The onset of turbulence in pipe flow,” <i>Science</i>, vol. 333, no. 6039. American Association for the Advancement of Science, pp. 192–196, 2011.","ama":"Avila K, Moxey D, De Lózar A, Avila M, Barkley D, Hof B. The onset of turbulence in pipe flow. <i>Science</i>. 2011;333(6039):192-196. doi:<a href=\"https://doi.org/10.1126/science.1203223\">10.1126/science.1203223</a>","chicago":"Avila, Kerstin, David Moxey, Alberto De Lózar, Marc Avila, Dwight Barkley, and Björn Hof. “The Onset of Turbulence in Pipe Flow.” <i>Science</i>. American Association for the Advancement of Science, 2011. <a href=\"https://doi.org/10.1126/science.1203223\">https://doi.org/10.1126/science.1203223</a>."},"year":"2011","volume":333,"extern":1,"publist_id":"4090","month":"07","publication":"Science","date_updated":"2021-01-12T06:59:47Z","quality_controlled":0,"date_published":"2011-07-08T00:00:00Z","abstract":[{"text":"Shear flows undergo a sudden transition from laminar to turbulent motion as the velocity increases, and the onset of turbulence radically changes transport efficiency and mixing properties. Even for the well-studied case of pipe flow, it has not been possible to determine at what Reynolds number the motion will be either persistently turbulent or ultimately laminar. We show that in pipes, turbulence that is transient at low Reynolds numbers becomes sustained at a distinct critical point. Through extensive experiments and computer simulations, we were able to identify and characterize the processes ultimately responsible for sustaining turbulence. In contrast to the classical Landau-Ruelle-Takens view that turbulence arises from an increase in the temporal complexity of fluid motion, here, spatial proliferation of chaotic domains is the decisive process and intrinsic to the nature of fluid turbulence.","lang":"eng"}],"intvolume":"       333","status":"public","publication_status":"published","date_created":"2018-12-11T11:59:39Z","author":[{"full_name":"Avila, Kerstin","first_name":"Kerstin","last_name":"Avila"},{"full_name":"Moxey, David","first_name":"David","last_name":"Moxey"},{"full_name":"de Lózar, Alberto","first_name":"Alberto","last_name":"De Lózar"},{"first_name":"Marc","full_name":"Avila, Marc","last_name":"Avila"},{"full_name":"Barkley, Dwight","first_name":"Dwight","last_name":"Barkley"},{"full_name":"Björn Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn","orcid":"0000-0003-2057-2754","last_name":"Hof"}]},{"year":"2011","_id":"2800","citation":{"chicago":"Samanta, Devranjan, Alberto De Lózar, and Björn Hof. “Experimental Investigation of Laminar Turbulent Intermittency in Pipe Flow.” <i>Journal of Fluid Mechanics</i>. Cambridge University Press, 2011. <a href=\"https://doi.org/10.1017/jfm.2011.189\">https://doi.org/10.1017/jfm.2011.189</a>.","ama":"Samanta D, De Lózar A, Hof B. Experimental investigation of laminar turbulent intermittency in pipe flow. <i>Journal of Fluid Mechanics</i>. 2011;681:193-204. doi:<a href=\"https://doi.org/10.1017/jfm.2011.189\">10.1017/jfm.2011.189</a>","ieee":"D. Samanta, A. De Lózar, and B. Hof, “Experimental investigation of laminar turbulent intermittency in pipe flow,” <i>Journal of Fluid Mechanics</i>, vol. 681. Cambridge University Press, pp. 193–204, 2011.","ista":"Samanta D, De Lózar A, Hof B. 2011. Experimental investigation of laminar turbulent intermittency in pipe flow. Journal of Fluid Mechanics. 681, 193–204.","apa":"Samanta, D., De Lózar, A., &#38; Hof, B. (2011). Experimental investigation of laminar turbulent intermittency in pipe flow. <i>Journal of Fluid Mechanics</i>. Cambridge University Press. <a href=\"https://doi.org/10.1017/jfm.2011.189\">https://doi.org/10.1017/jfm.2011.189</a>","mla":"Samanta, Devranjan, et al. “Experimental Investigation of Laminar Turbulent Intermittency in Pipe Flow.” <i>Journal of Fluid Mechanics</i>, vol. 681, Cambridge University Press, 2011, pp. 193–204, doi:<a href=\"https://doi.org/10.1017/jfm.2011.189\">10.1017/jfm.2011.189</a>.","short":"D. Samanta, A. De Lózar, B. Hof, Journal of Fluid Mechanics 681 (2011) 193–204."},"volume":681,"page":"193 - 204","doi":"10.1017/jfm.2011.189","publisher":"Cambridge University Press","day":"25","title":"Experimental investigation of laminar turbulent intermittency in pipe flow","type":"journal_article","publication":"Journal of Fluid Mechanics","extern":1,"publist_id":"4089","month":"08","intvolume":"       681","abstract":[{"text":"In shear flows, turbulence first occurs in the form of localized structures (puffs/spots) surrounded by laminar fluid. We here investigate such spatially intermittent flows in a pipe experiment showing that turbulent puffs have a well-defined interaction distance, which sets their minimum spacing as well as the maximum observable turbulent fraction. Two methodologies are employed. Starting from a laminar flow, puffs are first created by locally injecting a jet of fluid through the pipe wall. When the perturbation is applied periodically at low frequencies, as expected, a regular sequence of puffs is observed where the puff spacing is given by the ratio of the mean flow speed to the perturbation frequency. At large frequencies however puffs are found to interact and annihilate each other. Varying the perturbation frequency, an interaction distance is determined which sets the highest possible turbulence fraction. This enables us to establish an upper bound for the friction factor in the transitional regime, which provides a well-defined link between the Blasius and the Hagen-Poiseuille friction laws. In the second set of experiments, the Reynolds number is reduced suddenly from fully turbulent to the intermittent regime. The resulting flow reorganizes itself to a sequence of constant size puffs which, unlike in Couette and Taylor–Couette flow are randomly spaced. The minimum distance between the turbulent patches is identical to the puff interaction length. The puff interaction length is found to be in agreement with the wavelength of regular stripe and spiral patterns in plane Couette and Taylor–Couette flow.","lang":"eng"}],"quality_controlled":0,"date_published":"2011-08-25T00:00:00Z","status":"public","date_updated":"2021-01-12T06:59:48Z","date_created":"2018-12-11T11:59:40Z","publication_status":"published","author":[{"last_name":"Samanta","full_name":"Samanta, Devranjan","first_name":"Devranjan"},{"first_name":"Alberto","full_name":"de Lózar, Alberto","last_name":"De Lózar"},{"orcid":"0000-0003-2057-2754","last_name":"Hof","full_name":"Björn Hof","id":"3A374330-F248-11E8-B48F-1D18A9856A87","first_name":"Björn"}]},{"volume":318,"issue":"5","_id":"2801","citation":{"ama":"Holzner M, Avila M, De Lózar A, Hof B. A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow. In: Vol 318. IOP Publishing Ltd.; 2011. doi:<a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">10.1088/1742-6596/318/5/052031</a>","chicago":"Holzner, Markus, Marc Avila, Alberto De Lózar, and Björn Hof. “A Lagrangian Approach to the Interface Velocity of Turbulent Puffs in Pipe Flow,” Vol. 318. IOP Publishing Ltd., 2011. <a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">https://doi.org/10.1088/1742-6596/318/5/052031</a>.","short":"M. Holzner, M. Avila, A. De Lózar, B. Hof, in:, IOP Publishing Ltd., 2011.","ieee":"M. Holzner, M. Avila, A. De Lózar, and B. Hof, “A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow,” presented at the ETC13: European Turbulence Conference, 2011, vol. 318, no. 5.","ista":"Holzner M, Avila M, De Lózar A, Hof B. 2011. A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow. ETC13: European Turbulence Conference, Journal of Physics: Conference Series, vol. 318.","mla":"Holzner, Markus, et al. <i>A Lagrangian Approach to the Interface Velocity of Turbulent Puffs in Pipe Flow</i>. Vol. 318, no. 5, IOP Publishing Ltd., 2011, doi:<a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">10.1088/1742-6596/318/5/052031</a>.","apa":"Holzner, M., Avila, M., De Lózar, A., &#38; Hof, B. (2011). A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow (Vol. 318). Presented at the ETC13: European Turbulence Conference, IOP Publishing Ltd. <a href=\"https://doi.org/10.1088/1742-6596/318/5/052031\">https://doi.org/10.1088/1742-6596/318/5/052031</a>"},"year":"2011","type":"conference","title":"A Lagrangian approach to the interface velocity of turbulent puffs in pipe flow","doi":"10.1088/1742-6596/318/5/052031","day":"01","publisher":"IOP Publishing Ltd.","alternative_title":["Journal of Physics: Conference Series"],"month":"09","publist_id":"4088","extern":1,"status":"public","abstract":[{"text":"Turbulent puffs in pipe flow are characterized by a sharp laminar-turbulent interface at the trailing edge and a more diffused leading interface. It is known that these laminar-turbulent interfaces propagate at a speed that is approximately equal to the flow rate. Our results from direct numerical simulation show that, locally, the interface velocity relative to the fluid (i) counteracts the advection due to the laminar velocity profile so that the puff can preserve its characteristic overall shape, (ii) is very small in magnitude, but involves a large interface area so that the global propagation velocity relative to the mean flow can be large and (iii) is determined by both inertial and viscous effects. The analysis provides some new insights into the mechanisms that sustain or expand localized turbulence and might be relevant for the design of new control strategies.","lang":"eng"}],"date_published":"2011-09-01T00:00:00Z","quality_controlled":0,"intvolume":"       318","conference":{"name":"ETC13: European Turbulence Conference"},"date_updated":"2019-04-26T07:22:20Z","author":[{"first_name":"Markus","full_name":"Holzner, Markus","last_name":"Holzner"},{"last_name":"Avila","first_name":"Marc","full_name":"Avila, Marc"},{"first_name":"Alberto","full_name":"de Lózar, Alberto","last_name":"De Lózar"},{"id":"3A374330-F248-11E8-B48F-1D18A9856A87","full_name":"Björn Hof","first_name":"Björn","last_name":"Hof","orcid":"0000-0003-2057-2754"}],"publication_status":"published","date_created":"2018-12-11T11:59:40Z"},{"_id":"2871","citation":{"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.","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.","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>","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>.","short":"A. Bishopp, E. Benková, Y. Helariutta, Current Opinion in Plant Biology 14 (2011) 10–16.","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>.","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>"},"issue":"1","year":"2011","volume":14,"doi":"10.1016/j.pbi.2010.08.014","publisher":"Elsevier","day":"01","page":"10 - 16","type":"journal_article","title":"Sending mixed messages: Auxin-cytokinin crosstalk in roots","publication":"Current Opinion in Plant Biology","extern":1,"publist_id":"3894","month":"02","quality_controlled":0,"date_published":"2011-02-01T00:00:00Z","abstract":[{"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.","lang":"eng"}],"intvolume":"        14","status":"public","date_updated":"2021-01-12T07:00:23Z","date_created":"2018-12-11T12:00:03Z","publication_status":"published","author":[{"full_name":"Bishopp, Anthony","first_name":"Anthony","last_name":"Bishopp"},{"orcid":"0000-0002-8510-9739","last_name":"Benková","first_name":"Eva","full_name":"Eva Benková","id":"38F4F166-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Helariutta","first_name":"Ykä","full_name":"Helariutta, Ykä"}]},{"publist_id":"3891","month":"08","extern":1,"publication":"Plant Journal","type":"journal_article","title":"Hierarchy of hormone action controlling apical hook development in Arabidopsis","doi":"10.1111/j.1365-313X.2011.04621.x","publisher":"Wiley-Blackwell","day":"01","page":"622 - 634","volume":67,"citation":{"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.","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.","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>.","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>","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.","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>.","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>"},"_id":"2874","issue":"4","year":"2011","author":[{"last_name":"Gallego Bartolomé","first_name":"Javier","full_name":"Gallego-Bartolomé, Javier"},{"first_name":"María","full_name":"Arana, María V","last_name":"Arana"},{"last_name":"Vandenbussche","first_name":"Filip","full_name":"Vandenbussche, Filip"},{"last_name":"Žádníková","full_name":"Žádníková, Petra","first_name":"Petra"},{"first_name":"Eugenio","full_name":"Minguet, Eugenio G","last_name":"Minguet"},{"first_name":"Vicente","full_name":"Guardiola, Vicente","last_name":"Guardiola"},{"full_name":"Van Der Straeten, Dominique","first_name":"Dominique","last_name":"Van Der Straeten"},{"id":"38F4F166-F248-11E8-B48F-1D18A9856A87","full_name":"Eva Benková","first_name":"Eva","last_name":"Benková","orcid":"0000-0002-8510-9739"},{"last_name":"Alabadí","full_name":"Alabadí, David","first_name":"David"},{"last_name":"Blázquez","first_name":"Miguel","full_name":"Blázquez, Miguel A"}],"date_created":"2018-12-11T12:00:04Z","publication_status":"published","date_updated":"2021-01-12T07:00:24Z","status":"public","quality_controlled":0,"date_published":"2011-08-01T00:00:00Z","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."}],"intvolume":"        67"},{"date_updated":"2021-01-12T07:00:33Z","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.","intvolume":"         6","date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"status":"public","tmp":{"legal_code_url":"https://creativecommons.org/licenses/by/4.0/legalcode","image":"/images/cc_by.png","name":"Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)","short":"CC BY (4.0)"},"date_created":"2018-12-11T12:00:13Z","publication_status":"published","author":[{"last_name":"Paixao","orcid":"0000-0003-2361-3953","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","full_name":"Tiago Paixao","first_name":"Tiago"},{"full_name":"Azevedo, Ricardo B","first_name":"Ricardo","last_name":"Azevedo"}],"day":"01","doi":"10.1371/journal.pcbi.1000848","publisher":"Public Library of Science","title":"Redundancy and the Evolution of Cis Regulatory Element Multiplicity","type":"journal_article","year":"2011","_id":"2897","citation":{"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>","ista":"Paixao T, Azevedo R. 2011. Redundancy and the Evolution of Cis Regulatory Element Multiplicity. PLoS Computational Biology. 6(7).","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).","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>.","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>"},"issue":"7","volume":6,"extern":1,"month":"01","publist_id":"3861","publication":"PLoS Computational Biology"},{"issue":"7","_id":"2898","citation":{"short":"T. Paixao, S. Phadke, R. Azevedo, R. Zufall, Evolution; International Journal of Organic Evolution 65 (2011) 2050–2060.","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.","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>","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>.","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.","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>."},"year":"2011","volume":65,"doi":"10.1111/j.1558-5646.2011.01266.x","day":"01","publisher":"Wiley-Blackwell","page":"2050 - 2060","type":"journal_article","title":"Sex ratio evolution under probabilistic sex determination","publication":"Evolution; International Journal of Organic Evolution","extern":1,"publist_id":"3860","month":"03","abstract":[{"lang":"eng","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."}],"date_published":"2011-03-01T00:00:00Z","quality_controlled":0,"intvolume":"        65","status":"public","date_updated":"2021-01-12T07:00:33Z","date_created":"2018-12-11T12:00:13Z","publication_status":"published","author":[{"full_name":"Tiago Paixao","id":"2C5658E6-F248-11E8-B48F-1D18A9856A87","first_name":"Tiago","last_name":"Paixao","orcid":"0000-0003-2361-3953"},{"full_name":"Phadke, Sujal S","first_name":"Sujal","last_name":"Phadke"},{"last_name":"Azevedo","full_name":"Azevedo, Ricardo B","first_name":"Ricardo"},{"first_name":"Rebecca","full_name":"Zufall, Rebecca A","last_name":"Zufall"}]},{"publication":"Markov Random Fields for Vision and Image Processing","extern":1,"month":"01","publist_id":"3815","year":"2011","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.","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.","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. .","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.","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."},"_id":"2922","publisher":"Massachusetts Institute of Technology Press","day":"01","title":"Graph-cut Based Image Segmentation with Connectivity Priors","type":"book_chapter","date_created":"2018-12-11T12:00:21Z","publication_status":"published","author":[{"last_name":"Vicente","first_name":"Sara","full_name":"Vicente, Sara"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"quality_controlled":0,"date_published":"2011-01-01T00:00:00Z","status":"public","date_updated":"2021-01-12T07:00:43Z","editor":[{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"first_name":"Pushmeet","full_name":"Kohli, Pushmeet","last_name":"Kohli"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}]},{"publist_id":"3814","month":"01","extern":1,"publication":"Markov Random Fields for Vision and Image Processing","title":"Analyzing Convex Relaxations for MAP Estimation","type":"book_chapter","day":"01","publisher":"Massachusetts Institute of Technology Press","year":"2011","_id":"2923","citation":{"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.","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.","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.","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.","ista":"Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP Estimation. In: Markov Random Fields for Vision and Image Processing. .","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.","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."},"author":[{"full_name":"Kumar, M Pawan","first_name":"M Pawan","last_name":"Kumar"},{"first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","last_name":"Kolmogorov"},{"first_name":"Philip","full_name":"Torr, Philip H","last_name":"Torr"}],"publication_status":"published","date_created":"2018-12-11T12:00:21Z","date_updated":"2021-01-12T07:00:43Z","editor":[{"first_name":"Andrew","full_name":"Blake, Andrew","last_name":"Blake"},{"last_name":"Kohli","full_name":"Kohli, Pushmeet","first_name":"Pushmeet"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"status":"public","date_published":"2011-01-01T00:00:00Z","quality_controlled":0},{"editor":[{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"first_name":"Pushmeet","full_name":"Kohli, Pushmeet","last_name":"Kohli"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"date_updated":"2021-01-12T07:00:43Z","date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"status":"public","date_created":"2018-12-11T12:00:22Z","publication_status":"published","author":[{"last_name":"Criminisi","full_name":"Criminisi, Antonio","first_name":"Antonio"},{"first_name":"Geoffrey","full_name":"Cross, Geoffrey","last_name":"Cross"},{"last_name":"Blake","full_name":"Blake, Andrew","first_name":"Andrew"},{"last_name":"Kolmogorov","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","first_name":"Vladimir"}],"publisher":"Massachusetts Institute of Technology Press","day":"01","type":"book_chapter","title":"Bilayer Segmentation of Video","_id":"2924","citation":{"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.","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. .","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.","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.","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."},"year":"2011","extern":1,"publist_id":"3813","month":"01","publication":"Markov Random Fields for Vision and Image Processing"},{"title":"Interactive Foreground Extraction using graph cut","type":"book_chapter","publisher":"Massachusetts Institute of Technology Press","day":"01","year":"2011","citation":{"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.","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.","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. .","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.","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.","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.","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."},"_id":"2925","publist_id":"3812","month":"01","extern":1,"publication":"Markov Random Fields for Vision and Image Processing","date_updated":"2021-01-12T07:00:44Z","editor":[{"last_name":"Blake","first_name":"Andrew","full_name":"Blake, Andrew"},{"last_name":"Kohli","first_name":"Pushmeet","full_name":"Kohli, Pushmeet"},{"last_name":"Rother","full_name":"Rother, Carsten","first_name":"Carsten"}],"status":"public","date_published":"2011-01-01T00:00:00Z","quality_controlled":0,"author":[{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"},{"last_name":"Kolmogorov","first_name":"Vladimir","full_name":"Vladimir Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87"},{"last_name":"Boykov","full_name":"Boykov, Yuri","first_name":"Yuri"},{"last_name":"Blake","first_name":"Andrew","full_name":"Blake, Andrew"}],"publication_status":"published","date_created":"2018-12-11T12:00:22Z"},{"publist_id":"3801","month":"07","extern":1,"publication":"Markov Random Fields for Vision and Image Processing","title":"Basic graph cut algorithms","type":"book_chapter","page":"31 - 50","day":"22","publisher":"Massachusetts Institute of Technology Press","year":"2011","_id":"2935","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.","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.","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.","ista":"Boykov Y, Kolmogorov V. 2011.Basic graph cut algorithms. In: Markov Random Fields for Vision and Image Processing. , 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.","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."},"author":[{"last_name":"Boykov","full_name":"Boykov, Yuri","first_name":"Yuri"},{"last_name":"Kolmogorov","id":"3D50B0BA-F248-11E8-B48F-1D18A9856A87","full_name":"Vladimir Kolmogorov","first_name":"Vladimir"}],"date_created":"2018-12-11T12:00:26Z","publication_status":"published","date_updated":"2021-01-12T07:39:53Z","editor":[{"full_name":"Blake, Andrew","first_name":"Andrew","last_name":"Blake"},{"first_name":"Pushmeet","full_name":"Kohli, Pushmeet","last_name":"Kohli"},{"last_name":"Rother","first_name":"Carsten","full_name":"Rother, Carsten"}],"status":"public","quality_controlled":0,"date_published":"2011-07-22T00:00:00Z"}]