---
_id: '11673'
abstract:
- lang: eng
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.
article_number: '15'
article_processing_charge: No
article_type: original
author:
- first_name: Eda
full_name: Baykan, 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
- first_name: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: Baykan E, Henzinger M, Marian L, Weber I. A comprehensive study of features
and algorithms for URL-based topic classification. ACM Transactions on the
Web. 2011;5(3). doi:10.1145/1993053.1993057
apa: 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. Association for Computing Machinery. https://doi.org/10.1145/1993053.1993057
chicago: Baykan, Eda, Monika Henzinger, Ludmila Marian, and Ingmar Weber. “A Comprehensive
Study of Features and Algorithms for URL-Based Topic Classification.” ACM Transactions
on the Web. Association for Computing Machinery, 2011. https://doi.org/10.1145/1993053.1993057.
ieee: E. Baykan, M. Henzinger, L. Marian, and I. Weber, “A comprehensive study of
features and algorithms for URL-based topic classification,” ACM Transactions
on the Web, 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.
mla: Baykan, Eda, et al. “A Comprehensive Study of Features and Algorithms for URL-Based
Topic Classification.” ACM Transactions on the Web, vol. 5, no. 3, 15,
Association for Computing Machinery, 2011, doi:10.1145/1993053.1993057.
short: E. Baykan, M. Henzinger, L. Marian, I. Weber, ACM Transactions on the Web
5 (2011).
date_created: 2022-07-27T13:48:11Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2024-11-06T12:07:30Z
day: '01'
doi: 10.1145/1993053.1993057
extern: '1'
intvolume: ' 5'
issue: '3'
keyword:
- Topic classification
- URL
- ODP
language:
- iso: eng
month: '07'
oa_version: None
publication: ACM Transactions on the Web
publication_identifier:
eissn:
- 1559-114X
issn:
- 1559-1131
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: A comprehensive study of features and algorithms for URL-based topic classification
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 5
year: '2011'
...
---
_id: '11760'
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."
article_processing_charge: No
article_type: original
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: Dütting P, Henzinger M, Weber I. Offline file assignments for online load balancing.
Information Processing Letters. 2011;111(4):178-183. doi:10.1016/j.ipl.2010.11.022
apa: Dütting, P., Henzinger, M., & Weber, I. (2011). Offline file assignments
for online load balancing. Information Processing Letters. Elsevier. https://doi.org/10.1016/j.ipl.2010.11.022
chicago: Dütting, Paul, Monika Henzinger, and Ingmar Weber. “Offline File Assignments
for Online Load Balancing.” Information Processing Letters. Elsevier, 2011.
https://doi.org/10.1016/j.ipl.2010.11.022.
ieee: P. Dütting, M. Henzinger, and I. Weber, “Offline file assignments for online
load balancing,” Information Processing Letters, vol. 111, no. 4. Elsevier,
pp. 178–183, 2011.
ista: Dütting P, Henzinger M, Weber I. 2011. Offline file assignments for online
load balancing. Information Processing Letters. 111(4), 178–183.
mla: Dütting, Paul, et al. “Offline File Assignments for Online Load Balancing.”
Information Processing Letters, vol. 111, no. 4, Elsevier, 2011, pp. 178–83,
doi:10.1016/j.ipl.2010.11.022.
short: P. Dütting, M. Henzinger, I. Weber, Information Processing Letters 111 (2011)
178–183.
date_created: 2022-08-08T11:33:03Z
date_published: 2011-01-15T00:00:00Z
date_updated: 2024-11-06T12:09:49Z
day: '15'
doi: 10.1016/j.ipl.2010.11.022
extern: '1'
intvolume: ' 111'
issue: '4'
language:
- iso: eng
month: '01'
oa_version: None
page: 178-183
publication: Information Processing Letters
publication_identifier:
issn:
- 0020-0190
publication_status: published
publisher: Elsevier
quality_controlled: '1'
scopus_import: '1'
status: public
title: Offline file assignments for online load balancing
type: journal_article
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 111
year: '2011'
...
---
_id: '11796'
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."
alternative_title:
- LNCS
article_processing_charge: No
author:
- 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: Angelina
full_name: Vidali, Angelina
last_name: Vidali
citation:
ama: 'Henzinger M, Vidali A. Multi-parameter mechanism design under budget and matroid
constraints. In: 19th Annual European Symposium on Algorithms. Vol 6942.
Springer Nature; 2011:192–202. doi:10.1007/978-3-642-23719-5_17'
apa: 'Henzinger, M., & Vidali, A. (2011). Multi-parameter mechanism design under
budget and matroid constraints. In 19th Annual European Symposium on Algorithms
(Vol. 6942, pp. 192–202). Saarbrücken, Germany: Springer Nature. https://doi.org/10.1007/978-3-642-23719-5_17'
chicago: Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design
under Budget and Matroid Constraints.” In 19th Annual European Symposium on
Algorithms, 6942:192–202. Springer Nature, 2011. https://doi.org/10.1007/978-3-642-23719-5_17.
ieee: M. Henzinger and A. Vidali, “Multi-parameter mechanism design under budget
and matroid constraints,” in 19th Annual European Symposium on Algorithms,
Saarbrücken, Germany, 2011, vol. 6942, pp. 192–202.
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.'
mla: Henzinger, Monika, and Angelina Vidali. “Multi-Parameter Mechanism Design under
Budget and Matroid Constraints.” 19th Annual European Symposium on Algorithms,
vol. 6942, Springer Nature, 2011, pp. 192–202, doi:10.1007/978-3-642-23719-5_17.
short: M. Henzinger, A. Vidali, in:, 19th Annual European Symposium on Algorithms,
Springer Nature, 2011, pp. 192–202.
conference:
end_date: 2011-09-09
location: Saarbrücken, Germany
name: 'ESA: European Symposium on Algorithms'
start_date: 2011-09-05
date_created: 2022-08-11T11:51:39Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2024-11-06T12:13:02Z
day: '01'
doi: 10.1007/978-3-642-23719-5_17
extern: '1'
intvolume: ' 6942'
language:
- iso: eng
month: '09'
oa_version: None
page: 192–202
publication: 19th Annual European Symposium on Algorithms
publication_identifier:
isbn:
- '9783642237188'
issn:
- 1611-3349
publication_status: published
publisher: Springer Nature
quality_controlled: '1'
scopus_import: '1'
status: public
title: Multi-parameter mechanism design under budget and matroid constraints
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
volume: 6942
year: '2011'
...
---
_id: '11864'
abstract:
- lang: eng
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.
article_processing_charge: No
author:
- first_name: Paul
full_name: Dütting, Paul
last_name: Dütting
- 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: Ingmar
full_name: Weber, Ingmar
last_name: Weber
citation:
ama: 'Dütting P, Henzinger M, Weber I. An expressive mechanism for auctions on the
web. In: Proceedings of the 20th International Conference on World Wide Web.
Association for Computing Machinery; 2011:127-136. doi:10.1145/1963405.1963427'
apa: 'Dütting, P., Henzinger, M., & Weber, I. (2011). An expressive mechanism
for auctions on the web. In Proceedings of the 20th international conference
on World wide web (pp. 127–136). Hyderabad, India: Association for Computing
Machinery. https://doi.org/10.1145/1963405.1963427'
chicago: Dütting, Paul, Monika Henzinger, and Ingmar Weber. “An Expressive Mechanism
for Auctions on the Web.” In Proceedings of the 20th International Conference
on World Wide Web, 127–36. Association for Computing Machinery, 2011. https://doi.org/10.1145/1963405.1963427.
ieee: P. Dütting, M. Henzinger, and I. Weber, “An expressive mechanism for auctions
on the web,” in Proceedings of the 20th international conference on World wide
web, Hyderabad, India, 2011, pp. 127–136.
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.'
mla: Dütting, Paul, et al. “An Expressive Mechanism for Auctions on the Web.” Proceedings
of the 20th International Conference on World Wide Web, Association for Computing
Machinery, 2011, pp. 127–36, doi:10.1145/1963405.1963427.
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.
conference:
end_date: 2011-04-01
location: Hyderabad, India
name: 'WWW: International Conference on World Wide Web'
start_date: 2011-03-28
date_created: 2022-08-16T09:05:34Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2024-11-06T12:19:04Z
day: '01'
doi: 10.1145/1963405.1963427
extern: '1'
language:
- iso: eng
month: '04'
oa_version: None
page: 127 - 136
publication: Proceedings of the 20th international conference on World wide web
publication_identifier:
isbn:
- 978-145030632-4
publication_status: published
publisher: Association for Computing Machinery
quality_controlled: '1'
scopus_import: '1'
status: public
title: An expressive mechanism for auctions on the web
type: conference
user_id: 2DF688A6-F248-11E8-B48F-1D18A9856A87
year: '2011'
...
---
_id: '2717'
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. '
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Antti
full_name: Knowles, Antti
last_name: Knowles
citation:
ama: Erdös L, Knowles A. Quantum diffusion and eigenfunction delocalization in a
random band matrix model. Communications in Mathematical Physics. 2011;303(2):509-554.
doi:10.1007/s00220-011-1204-2
apa: Erdös, L., & Knowles, A. (2011). Quantum diffusion and eigenfunction delocalization
in a random band matrix model. Communications in Mathematical Physics.
Springer. https://doi.org/10.1007/s00220-011-1204-2
chicago: Erdös, László, and Antti Knowles. “Quantum Diffusion and Eigenfunction
Delocalization in a Random Band Matrix Model.” Communications in Mathematical
Physics. Springer, 2011. https://doi.org/10.1007/s00220-011-1204-2.
ieee: L. Erdös and A. Knowles, “Quantum diffusion and eigenfunction delocalization
in a random band matrix model,” Communications in Mathematical Physics,
vol. 303, no. 2. Springer, pp. 509–554, 2011.
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.” Communications in Mathematical Physics,
vol. 303, no. 2, Springer, 2011, pp. 509–54, doi:10.1007/s00220-011-1204-2.
short: L. Erdös, A. Knowles, Communications in Mathematical Physics 303 (2011) 509–554.
date_created: 2018-12-11T11:59:14Z
date_published: 2011-04-01T00:00:00Z
date_updated: 2021-01-12T06:59:15Z
day: '01'
doi: 10.1007/s00220-011-1204-2
extern: 1
intvolume: ' 303'
issue: '2'
month: '04'
page: 509 - 554
publication: Communications in Mathematical Physics
publication_status: published
publisher: Springer
publist_id: '4175'
quality_controlled: 0
status: public
title: Quantum diffusion and eigenfunction delocalization in a random band matrix
model
type: journal_article
volume: 303
year: '2011'
...
---
_id: '2764'
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 ζ> 0. The proof
is based on an estimate of the entropy flow of the Dyson Brownian motion w. r.
t. a "pseudo equilibrium measure". 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.
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Benjamin
full_name: Schlein, Benjamin
last_name: Schlein
- first_name: Horng
full_name: Yau, Horng-Tzer
last_name: Yau
citation:
ama: Erdös L, Schlein B, Yau H. Universality of random matrices and local relaxation
flow. Inventiones Mathematicae. 2011;185(1):75-119. doi:10.1007/s00222-010-0302-7
apa: Erdös, L., Schlein, B., & Yau, H. (2011). Universality of random matrices
and local relaxation flow. Inventiones Mathematicae. Springer. https://doi.org/10.1007/s00222-010-0302-7
chicago: Erdös, László, Benjamin Schlein, and Horng Yau. “Universality of Random
Matrices and Local Relaxation Flow.” Inventiones Mathematicae. Springer,
2011. https://doi.org/10.1007/s00222-010-0302-7.
ieee: L. Erdös, B. Schlein, and H. Yau, “Universality of random matrices and local
relaxation flow,” Inventiones Mathematicae, vol. 185, no. 1. Springer,
pp. 75–119, 2011.
ista: Erdös L, Schlein B, Yau H. 2011. Universality of random matrices and local
relaxation flow. Inventiones Mathematicae. 185(1), 75–119.
mla: Erdös, László, et al. “Universality of Random Matrices and Local Relaxation
Flow.” Inventiones Mathematicae, vol. 185, no. 1, Springer, 2011, pp. 75–119,
doi:10.1007/s00222-010-0302-7.
short: L. Erdös, B. Schlein, H. Yau, Inventiones Mathematicae 185 (2011) 75–119.
date_created: 2018-12-11T11:59:29Z
date_published: 2011-07-01T00:00:00Z
date_updated: 2021-01-12T06:59:32Z
day: '01'
doi: 10.1007/s00222-010-0302-7
extern: 1
intvolume: ' 185'
issue: '1'
month: '07'
page: 75 - 119
publication: Inventiones Mathematicae
publication_status: published
publisher: Springer
publist_id: '4126'
quality_controlled: 0
status: public
title: Universality of random matrices and local relaxation flow
type: journal_article
volume: 185
year: '2011'
...
---
_id: '2765'
abstract:
- lang: eng
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.'
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
citation:
ama: 'Erdös L. Universality of Wigner random matrices: A survey of recent results.
Russian Mathematical Surveys. 2011;66(3):507-626. doi:10.1070/RM2011v066n03ABEH004749'
apa: 'Erdös, L. (2011). Universality of Wigner random matrices: A survey of recent
results. Russian Mathematical Surveys. IOP Publishing Ltd. https://doi.org/10.1070/RM2011v066n03ABEH004749'
chicago: 'Erdös, László. “Universality of Wigner Random Matrices: A Survey of Recent
Results.” Russian Mathematical Surveys. IOP Publishing Ltd., 2011. https://doi.org/10.1070/RM2011v066n03ABEH004749.'
ieee: 'L. Erdös, “Universality of Wigner random matrices: A survey of recent results,”
Russian Mathematical Surveys, vol. 66, no. 3. IOP Publishing Ltd., pp.
507–626, 2011.'
ista: 'Erdös L. 2011. Universality of Wigner random matrices: A survey of recent
results. Russian Mathematical Surveys. 66(3), 507–626.'
mla: 'Erdös, László. “Universality of Wigner Random Matrices: A Survey of Recent
Results.” Russian Mathematical Surveys, vol. 66, no. 3, IOP Publishing
Ltd., 2011, pp. 507–626, doi:10.1070/RM2011v066n03ABEH004749.'
short: L. Erdös, Russian Mathematical Surveys 66 (2011) 507–626.
date_created: 2018-12-11T11:59:29Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2019-04-26T07:22:20Z
day: '01'
doi: 10.1070/RM2011v066n03ABEH004749
extern: 1
intvolume: ' 66'
issue: '3'
main_file_link:
- open_access: '0'
url: http://arxiv.org/abs/1004.0861
month: '01'
page: 507 - 626
publication: Russian Mathematical Surveys
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4125'
quality_controlled: 0
status: public
title: 'Universality of Wigner random matrices: A survey of recent results'
type: review
volume: 66
year: '2011'
...
---
_id: '2766'
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} > 0, where M:= 1/(maxx,y σ2xy).
author:
- first_name: László
full_name: László Erdös
id: 4DBD5372-F248-11E8-B48F-1D18A9856A87
last_name: Erdös
orcid: 0000-0001-5366-9603
- first_name: Antti
full_name: Knowles, Antti
last_name: Knowles
citation:
ama: Erdös L, Knowles A. Quantum diffusion and delocalization for band matrices
with general distribution. Annales Henri Poincare. 2011;12(7):1227-1319.
doi:10.1007/s00023-011-0104-5
apa: Erdös, L., & Knowles, A. (2011). Quantum diffusion and delocalization for
band matrices with general distribution. Annales Henri Poincare. Birkhäuser.
https://doi.org/10.1007/s00023-011-0104-5
chicago: Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization
for Band Matrices with General Distribution.” Annales Henri Poincare. Birkhäuser,
2011. https://doi.org/10.1007/s00023-011-0104-5.
ieee: L. Erdös and A. Knowles, “Quantum diffusion and delocalization for band matrices
with general distribution,” Annales Henri Poincare, vol. 12, no. 7. Birkhäuser,
pp. 1227–1319, 2011.
ista: Erdös L, Knowles A. 2011. Quantum diffusion and delocalization for band matrices
with general distribution. Annales Henri Poincare. 12(7), 1227–1319.
mla: Erdös, László, and Antti Knowles. “Quantum Diffusion and Delocalization for
Band Matrices with General Distribution.” Annales Henri Poincare, vol.
12, no. 7, Birkhäuser, 2011, pp. 1227–319, doi:10.1007/s00023-011-0104-5.
short: L. Erdös, A. Knowles, Annales Henri Poincare 12 (2011) 1227–1319.
date_created: 2018-12-11T11:59:29Z
date_published: 2011-11-01T00:00:00Z
date_updated: 2021-01-12T06:59:33Z
day: '01'
doi: 10.1007/s00023-011-0104-5
extern: 1
intvolume: ' 12'
issue: '7'
month: '11'
page: 1227 - 1319
publication: Annales Henri Poincare
publication_status: published
publisher: Birkhäuser
publist_id: '4124'
quality_controlled: 0
status: public
title: Quantum diffusion and delocalization for band matrices with general distribution
type: journal_article
volume: 12
year: '2011'
...
---
_id: '2799'
abstract:
- lang: eng
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.
author:
- first_name: Kerstin
full_name: Avila, Kerstin
last_name: Avila
- first_name: David
full_name: Moxey, David
last_name: Moxey
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Dwight
full_name: Barkley, Dwight
last_name: Barkley
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Avila K, Moxey D, De Lózar A, Avila M, Barkley D, Hof B. The onset of turbulence
in pipe flow. Science. 2011;333(6039):192-196. doi:10.1126/science.1203223
apa: Avila, K., Moxey, D., De Lózar, A., Avila, M., Barkley, D., & Hof, B. (2011).
The onset of turbulence in pipe flow. Science. American Association for
the Advancement of Science. https://doi.org/10.1126/science.1203223
chicago: Avila, Kerstin, David Moxey, Alberto De Lózar, Marc Avila, Dwight Barkley,
and Björn Hof. “The Onset of Turbulence in Pipe Flow.” Science. American
Association for the Advancement of Science, 2011. https://doi.org/10.1126/science.1203223.
ieee: K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, and B. Hof, “The onset
of turbulence in pipe flow,” Science, vol. 333, no. 6039. American Association
for the Advancement of Science, pp. 192–196, 2011.
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.” Science,
vol. 333, no. 6039, American Association for the Advancement of Science, 2011,
pp. 192–96, doi:10.1126/science.1203223.
short: K. Avila, D. Moxey, A. De Lózar, M. Avila, D. Barkley, B. Hof, Science 333
(2011) 192–196.
date_created: 2018-12-11T11:59:39Z
date_published: 2011-07-08T00:00:00Z
date_updated: 2021-01-12T06:59:47Z
day: '08'
doi: 10.1126/science.1203223
extern: 1
intvolume: ' 333'
issue: '6039'
month: '07'
page: 192 - 196
publication: Science
publication_status: published
publisher: American Association for the Advancement of Science
publist_id: '4090'
quality_controlled: 0
status: public
title: The onset of turbulence in pipe flow
type: journal_article
volume: 333
year: '2011'
...
---
_id: '2800'
abstract:
- lang: eng
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.
author:
- first_name: Devranjan
full_name: Samanta, Devranjan
last_name: Samanta
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
citation:
ama: Samanta D, De Lózar A, Hof B. Experimental investigation of laminar turbulent
intermittency in pipe flow. Journal of Fluid Mechanics. 2011;681:193-204.
doi:10.1017/jfm.2011.189
apa: Samanta, D., De Lózar, A., & Hof, B. (2011). Experimental investigation
of laminar turbulent intermittency in pipe flow. Journal of Fluid Mechanics.
Cambridge University Press. https://doi.org/10.1017/jfm.2011.189
chicago: Samanta, Devranjan, Alberto De Lózar, and Björn Hof. “Experimental Investigation
of Laminar Turbulent Intermittency in Pipe Flow.” Journal of Fluid Mechanics.
Cambridge University Press, 2011. https://doi.org/10.1017/jfm.2011.189.
ieee: D. Samanta, A. De Lózar, and B. Hof, “Experimental investigation of laminar
turbulent intermittency in pipe flow,” Journal of Fluid Mechanics, 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.
mla: Samanta, Devranjan, et al. “Experimental Investigation of Laminar Turbulent
Intermittency in Pipe Flow.” Journal of Fluid Mechanics, vol. 681, Cambridge
University Press, 2011, pp. 193–204, doi:10.1017/jfm.2011.189.
short: D. Samanta, A. De Lózar, B. Hof, Journal of Fluid Mechanics 681 (2011) 193–204.
date_created: 2018-12-11T11:59:40Z
date_published: 2011-08-25T00:00:00Z
date_updated: 2021-01-12T06:59:48Z
day: '25'
doi: 10.1017/jfm.2011.189
extern: 1
intvolume: ' 681'
month: '08'
page: 193 - 204
publication: Journal of Fluid Mechanics
publication_status: published
publisher: Cambridge University Press
publist_id: '4089'
quality_controlled: 0
status: public
title: Experimental investigation of laminar turbulent intermittency in pipe flow
type: journal_article
volume: 681
year: '2011'
...
---
_id: '2801'
abstract:
- lang: eng
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.
alternative_title:
- 'Journal of Physics: Conference Series'
author:
- first_name: Markus
full_name: Holzner, Markus
last_name: Holzner
- first_name: Marc
full_name: Avila, Marc
last_name: Avila
- first_name: Alberto
full_name: de Lózar, Alberto
last_name: De Lózar
- first_name: Björn
full_name: Björn Hof
id: 3A374330-F248-11E8-B48F-1D18A9856A87
last_name: Hof
orcid: 0000-0003-2057-2754
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:10.1088/1742-6596/318/5/052031'
apa: 'Holzner, M., Avila, M., De Lózar, A., & 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. https://doi.org/10.1088/1742-6596/318/5/052031'
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. https://doi.org/10.1088/1742-6596/318/5/052031.
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. A Lagrangian Approach to the Interface Velocity
of Turbulent Puffs in Pipe Flow. Vol. 318, no. 5, IOP Publishing Ltd., 2011,
doi:10.1088/1742-6596/318/5/052031.
short: M. Holzner, M. Avila, A. De Lózar, B. Hof, in:, IOP Publishing Ltd., 2011.
conference:
name: 'ETC13: European Turbulence Conference'
date_created: 2018-12-11T11:59:40Z
date_published: 2011-09-01T00:00:00Z
date_updated: 2019-04-26T07:22:20Z
day: '01'
doi: 10.1088/1742-6596/318/5/052031
extern: 1
intvolume: ' 318'
issue: '5'
month: '09'
publication_status: published
publisher: IOP Publishing Ltd.
publist_id: '4088'
quality_controlled: 0
status: public
title: A Lagrangian approach to the interface velocity of turbulent puffs in pipe
flow
type: conference
volume: 318
year: '2011'
...
---
_id: '2871'
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.
author:
- first_name: Anthony
full_name: Bishopp, Anthony
last_name: Bishopp
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: Ykä
full_name: Helariutta, Ykä
last_name: Helariutta
citation:
ama: 'Bishopp A, Benková E, Helariutta Y. Sending mixed messages: Auxin-cytokinin
crosstalk in roots. Current Opinion in Plant Biology. 2011;14(1):10-16.
doi:10.1016/j.pbi.2010.08.014'
apa: 'Bishopp, A., Benková, E., & Helariutta, Y. (2011). Sending mixed messages:
Auxin-cytokinin crosstalk in roots. Current Opinion in Plant Biology. Elsevier.
https://doi.org/10.1016/j.pbi.2010.08.014'
chicago: 'Bishopp, Anthony, Eva Benková, and Ykä Helariutta. “Sending Mixed Messages:
Auxin-Cytokinin Crosstalk in Roots.” Current Opinion in Plant Biology.
Elsevier, 2011. https://doi.org/10.1016/j.pbi.2010.08.014.'
ieee: 'A. Bishopp, E. Benková, and Y. Helariutta, “Sending mixed messages: Auxin-cytokinin
crosstalk in roots,” Current Opinion in Plant Biology, 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.'
mla: 'Bishopp, Anthony, et al. “Sending Mixed Messages: Auxin-Cytokinin Crosstalk
in Roots.” Current Opinion in Plant Biology, vol. 14, no. 1, Elsevier,
2011, pp. 10–16, doi:10.1016/j.pbi.2010.08.014.'
short: A. Bishopp, E. Benková, Y. Helariutta, Current Opinion in Plant Biology 14
(2011) 10–16.
date_created: 2018-12-11T12:00:03Z
date_published: 2011-02-01T00:00:00Z
date_updated: 2021-01-12T07:00:23Z
day: '01'
doi: 10.1016/j.pbi.2010.08.014
extern: 1
intvolume: ' 14'
issue: '1'
month: '02'
page: 10 - 16
publication: Current Opinion in Plant Biology
publication_status: published
publisher: Elsevier
publist_id: '3894'
quality_controlled: 0
status: public
title: 'Sending mixed messages: Auxin-cytokinin crosstalk in roots'
type: journal_article
volume: 14
year: '2011'
...
---
_id: '2874'
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.
author:
- first_name: Javier
full_name: Gallego-Bartolomé, Javier
last_name: Gallego Bartolomé
- first_name: María
full_name: Arana, María V
last_name: Arana
- first_name: Filip
full_name: Vandenbussche, Filip
last_name: Vandenbussche
- first_name: Petra
full_name: Žádníková, Petra
last_name: Žádníková
- first_name: Eugenio
full_name: Minguet, Eugenio G
last_name: Minguet
- first_name: Vicente
full_name: Guardiola, Vicente
last_name: Guardiola
- first_name: Dominique
full_name: Van Der Straeten, Dominique
last_name: Van Der Straeten
- first_name: Eva
full_name: Eva Benková
id: 38F4F166-F248-11E8-B48F-1D18A9856A87
last_name: Benková
orcid: 0000-0002-8510-9739
- first_name: David
full_name: Alabadí, David
last_name: Alabadí
- first_name: Miguel
full_name: Blázquez, Miguel A
last_name: Blázquez
citation:
ama: Gallego Bartolomé J, Arana M, Vandenbussche F, et al. Hierarchy of hormone
action controlling apical hook development in Arabidopsis. Plant Journal.
2011;67(4):622-634. doi:10.1111/j.1365-313X.2011.04621.x
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. Plant Journal. Wiley-Blackwell.
https://doi.org/10.1111/j.1365-313X.2011.04621.x
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.” Plant Journal. Wiley-Blackwell, 2011.
https://doi.org/10.1111/j.1365-313X.2011.04621.x.
ieee: J. Gallego Bartolomé et al., “Hierarchy of hormone action controlling
apical hook development in Arabidopsis,” Plant Journal, 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.” Plant Journal, vol. 67, no. 4,
Wiley-Blackwell, 2011, pp. 622–34, doi:10.1111/j.1365-313X.2011.04621.x.
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.
date_created: 2018-12-11T12:00:04Z
date_published: 2011-08-01T00:00:00Z
date_updated: 2021-01-12T07:00:24Z
day: '01'
doi: 10.1111/j.1365-313X.2011.04621.x
extern: 1
intvolume: ' 67'
issue: '4'
month: '08'
page: 622 - 634
publication: Plant Journal
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3891'
quality_controlled: 0
status: public
title: Hierarchy of hormone action controlling apical hook development in Arabidopsis
type: journal_article
volume: 67
year: '2011'
...
---
_id: '2897'
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.
author:
- first_name: Tiago
full_name: Tiago Paixao
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Ricardo
full_name: Azevedo, Ricardo B
last_name: Azevedo
citation:
ama: Paixao T, Azevedo R. Redundancy and the Evolution of Cis Regulatory Element
Multiplicity. PLoS Computational Biology. 2011;6(7). doi:10.1371/journal.pcbi.1000848
apa: Paixao, T., & Azevedo, R. (2011). Redundancy and the Evolution of Cis Regulatory
Element Multiplicity. PLoS Computational Biology. Public Library of Science.
https://doi.org/10.1371/journal.pcbi.1000848
chicago: Paixao, Tiago, and Ricardo Azevedo. “Redundancy and the Evolution of Cis
Regulatory Element Multiplicity.” PLoS Computational Biology. Public Library
of Science, 2011. https://doi.org/10.1371/journal.pcbi.1000848.
ieee: T. Paixao and R. Azevedo, “Redundancy and the Evolution of Cis Regulatory
Element Multiplicity,” PLoS Computational Biology, vol. 6, no. 7. Public
Library of Science, 2011.
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.” PLoS Computational Biology, vol. 6, no. 7, Public
Library of Science, 2011, doi:10.1371/journal.pcbi.1000848.
short: T. Paixao, R. Azevedo, PLoS Computational Biology 6 (2011).
date_created: 2018-12-11T12:00:13Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:33Z
day: '01'
doi: 10.1371/journal.pcbi.1000848
extern: 1
intvolume: ' 6'
issue: '7'
license: https://creativecommons.org/licenses/by/4.0/
month: '01'
publication: PLoS Computational Biology
publication_status: published
publisher: Public Library of Science
publist_id: '3861'
quality_controlled: 0
status: public
title: Redundancy and the Evolution of Cis Regulatory Element Multiplicity
tmp:
image: /images/cc_by.png
legal_code_url: https://creativecommons.org/licenses/by/4.0/legalcode
name: Creative Commons Attribution 4.0 International Public License (CC-BY 4.0)
short: CC BY (4.0)
type: journal_article
volume: 6
year: '2011'
...
---
_id: '2898'
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.
author:
- first_name: Tiago
full_name: Tiago Paixao
id: 2C5658E6-F248-11E8-B48F-1D18A9856A87
last_name: Paixao
orcid: 0000-0003-2361-3953
- first_name: Sujal
full_name: Phadke, Sujal S
last_name: Phadke
- first_name: Ricardo
full_name: Azevedo, Ricardo B
last_name: Azevedo
- first_name: Rebecca
full_name: Zufall, Rebecca A
last_name: Zufall
citation:
ama: Paixao T, Phadke S, Azevedo R, Zufall R. Sex ratio evolution under probabilistic
sex determination. Evolution; International Journal of Organic Evolution.
2011;65(7):2050-2060. doi:10.1111/j.1558-5646.2011.01266.x
apa: Paixao, T., Phadke, S., Azevedo, R., & Zufall, R. (2011). Sex ratio evolution
under probabilistic sex determination. Evolution; International Journal of
Organic Evolution. Wiley-Blackwell. https://doi.org/10.1111/j.1558-5646.2011.01266.x
chicago: Paixao, Tiago, Sujal Phadke, Ricardo Azevedo, and Rebecca Zufall. “Sex
Ratio Evolution under Probabilistic Sex Determination.” Evolution; International
Journal of Organic Evolution. Wiley-Blackwell, 2011. https://doi.org/10.1111/j.1558-5646.2011.01266.x.
ieee: T. Paixao, S. Phadke, R. Azevedo, and R. Zufall, “Sex ratio evolution under
probabilistic sex determination,” Evolution; International Journal of Organic
Evolution, vol. 65, no. 7. Wiley-Blackwell, pp. 2050–2060, 2011.
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.
mla: Paixao, Tiago, et al. “Sex Ratio Evolution under Probabilistic Sex Determination.”
Evolution; International Journal of Organic Evolution, vol. 65, no. 7,
Wiley-Blackwell, 2011, pp. 2050–60, doi:10.1111/j.1558-5646.2011.01266.x.
short: T. Paixao, S. Phadke, R. Azevedo, R. Zufall, Evolution; International Journal
of Organic Evolution 65 (2011) 2050–2060.
date_created: 2018-12-11T12:00:13Z
date_published: 2011-03-01T00:00:00Z
date_updated: 2021-01-12T07:00:33Z
day: '01'
doi: 10.1111/j.1558-5646.2011.01266.x
extern: 1
intvolume: ' 65'
issue: '7'
month: '03'
page: 2050 - 2060
publication: Evolution; International Journal of Organic Evolution
publication_status: published
publisher: Wiley-Blackwell
publist_id: '3860'
quality_controlled: 0
status: public
title: Sex ratio evolution under probabilistic sex determination
type: journal_article
volume: 65
year: '2011'
...
---
_id: '2922'
author:
- first_name: Sara
full_name: Vicente, Sara
last_name: Vicente
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
citation:
ama: 'Vicente S, Kolmogorov V, Rother C. Graph-cut Based Image Segmentation with
Connectivity Priors. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press;
2011.'
apa: Vicente, S., Kolmogorov, V., & Rother, C. (2011). Graph-cut Based Image
Segmentation with Connectivity Priors. In A. Blake, P. Kohli, & C. Rother
(Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press.
chicago: Vicente, Sara, Vladimir Kolmogorov, and Carsten Rother. “Graph-Cut Based
Image Segmentation with Connectivity Priors.” In Markov Random Fields for Vision
and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten
Rother. Massachusetts Institute of Technology Press, 2011.
ieee: S. Vicente, V. Kolmogorov, and C. Rother, “Graph-cut Based Image Segmentation
with Connectivity Priors,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. 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.
.'
mla: Vicente, Sara, et al. “Graph-Cut Based Image Segmentation with Connectivity
Priors.” Markov Random Fields for Vision and Image Processing, edited by
Andrew Blake et al., Massachusetts Institute of Technology Press, 2011.
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.
date_created: 2018-12-11T12:00:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3815'
quality_controlled: 0
status: public
title: Graph-cut Based Image Segmentation with Connectivity Priors
type: book_chapter
year: '2011'
...
---
_id: '2923'
author:
- first_name: M Pawan
full_name: Kumar, 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
citation:
ama: 'Kumar MP, Kolmogorov V, Torr P. Analyzing Convex Relaxations for MAP Estimation.
In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image
Processing. Massachusetts Institute of Technology Press; 2011.'
apa: Kumar, M. P., Kolmogorov, V., & Torr, P. (2011). Analyzing Convex Relaxations
for MAP Estimation. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random
Fields for Vision and Image Processing. Massachusetts Institute of Technology
Press.
chicago: Kumar, M Pawan, Vladimir Kolmogorov, and Philip Torr. “Analyzing Convex
Relaxations for MAP Estimation.” In Markov Random Fields for Vision and Image
Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts
Institute of Technology Press, 2011.
ieee: M. P. Kumar, V. Kolmogorov, and P. Torr, “Analyzing Convex Relaxations for
MAP Estimation,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. Massachusetts Institute of Technology
Press, 2011.
ista: 'Kumar MP, Kolmogorov V, Torr P. 2011.Analyzing Convex Relaxations for MAP
Estimation. In: Markov Random Fields for Vision and Image Processing. .'
mla: Kumar, M. Pawan, et al. “Analyzing Convex Relaxations for MAP Estimation.”
Markov Random Fields for Vision and Image Processing, edited by Andrew
Blake et al., Massachusetts Institute of Technology Press, 2011.
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.
date_created: 2018-12-11T12:00:21Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3814'
quality_controlled: 0
status: public
title: Analyzing Convex Relaxations for MAP Estimation
type: book_chapter
year: '2011'
...
---
_id: '2924'
author:
- first_name: Antonio
full_name: Criminisi, Antonio
last_name: Criminisi
- first_name: Geoffrey
full_name: Cross, Geoffrey
last_name: Cross
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Criminisi A, Cross G, Blake A, Kolmogorov V. Bilayer Segmentation of Video.
In: Blake A, Kohli P, Rother C, eds. Markov Random Fields for Vision and Image
Processing. Massachusetts Institute of Technology Press; 2011.'
apa: Criminisi, A., Cross, G., Blake, A., & Kolmogorov, V. (2011). Bilayer Segmentation
of Video. In A. Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press.
chicago: Criminisi, Antonio, Geoffrey Cross, Andrew Blake, and Vladimir Kolmogorov.
“Bilayer Segmentation of Video.” In Markov Random Fields for Vision and Image
Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten Rother. Massachusetts
Institute of Technology Press, 2011.
ieee: A. Criminisi, G. Cross, A. Blake, and V. Kolmogorov, “Bilayer Segmentation
of Video,” in Markov Random Fields for Vision and Image Processing, A.
Blake, P. Kohli, and C. Rother, Eds. 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. .'
mla: Criminisi, Antonio, et al. “Bilayer Segmentation of Video.” Markov Random
Fields for Vision and Image Processing, edited by Andrew Blake et al., Massachusetts
Institute of Technology Press, 2011.
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.
date_created: 2018-12-11T12:00:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:43Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3813'
quality_controlled: 0
status: public
title: Bilayer Segmentation of Video
type: book_chapter
year: '2011'
...
---
_id: '2925'
author:
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
citation:
ama: 'Rother C, Kolmogorov V, Boykov Y, Blake A. Interactive Foreground Extraction
using graph cut. In: Blake A, Kohli P, Rother C, eds. Markov Random Fields
for Vision and Image Processing. Massachusetts Institute of Technology Press;
2011.'
apa: Rother, C., Kolmogorov, V., Boykov, Y., & Blake, A. (2011). Interactive
Foreground Extraction using graph cut. In A. Blake, P. Kohli, & C. Rother
(Eds.), Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press.
chicago: Rother, Carsten, Vladimir Kolmogorov, Yuri Boykov, and Andrew Blake. “Interactive
Foreground Extraction Using Graph Cut.” In Markov Random Fields for Vision
and Image Processing, edited by Andrew Blake, Pushmeet Kohli, and Carsten
Rother. Massachusetts Institute of Technology Press, 2011.
ieee: C. Rother, V. Kolmogorov, Y. Boykov, and A. Blake, “Interactive Foreground
Extraction using graph cut,” in Markov Random Fields for Vision and Image Processing,
A. Blake, P. Kohli, and C. Rother, Eds. 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. .'
mla: Rother, Carsten, et al. “Interactive Foreground Extraction Using Graph Cut.”
Markov Random Fields for Vision and Image Processing, 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.
date_created: 2018-12-11T12:00:22Z
date_published: 2011-01-01T00:00:00Z
date_updated: 2021-01-12T07:00:44Z
day: '01'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '01'
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3812'
quality_controlled: 0
status: public
title: Interactive Foreground Extraction using graph cut
type: book_chapter
year: '2011'
...
---
_id: '2935'
author:
- first_name: Yuri
full_name: Boykov, Yuri
last_name: Boykov
- first_name: Vladimir
full_name: Vladimir Kolmogorov
id: 3D50B0BA-F248-11E8-B48F-1D18A9856A87
last_name: Kolmogorov
citation:
ama: 'Boykov Y, Kolmogorov V. Basic graph cut algorithms. In: Blake A, Kohli P,
Rother C, eds. Markov Random Fields for Vision and Image Processing. Massachusetts
Institute of Technology Press; 2011:31-50.'
apa: Boykov, Y., & Kolmogorov, V. (2011). Basic graph cut algorithms. In A.
Blake, P. Kohli, & C. Rother (Eds.), Markov Random Fields for Vision and
Image Processing (pp. 31–50). Massachusetts Institute of Technology Press.
chicago: Boykov, Yuri, and Vladimir Kolmogorov. “Basic Graph Cut Algorithms.” In
Markov Random Fields for Vision and Image Processing, edited by Andrew
Blake, Pushmeet Kohli, and Carsten Rother, 31–50. Massachusetts Institute of Technology
Press, 2011.
ieee: Y. Boykov and V. Kolmogorov, “Basic graph cut algorithms,” in Markov Random
Fields for Vision and Image Processing, A. Blake, P. Kohli, and C. Rother,
Eds. 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.” Markov
Random Fields for Vision and Image Processing, edited by Andrew Blake et al.,
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.
date_created: 2018-12-11T12:00:26Z
date_published: 2011-07-22T00:00:00Z
date_updated: 2021-01-12T07:39:53Z
day: '22'
editor:
- first_name: Andrew
full_name: Blake, Andrew
last_name: Blake
- first_name: Pushmeet
full_name: Kohli, Pushmeet
last_name: Kohli
- first_name: Carsten
full_name: Rother, Carsten
last_name: Rother
extern: 1
month: '07'
page: 31 - 50
publication: Markov Random Fields for Vision and Image Processing
publication_status: published
publisher: Massachusetts Institute of Technology Press
publist_id: '3801'
quality_controlled: 0
status: public
title: Basic graph cut algorithms
type: book_chapter
year: '2011'
...