Medium-scale land cover maps are traditionally created on the basis of a single cloud-free satellite scene, leaving information present in other scenes unused. Using 1309 field observations and 20 cloudand error-affected Landsat scenes covering Zanzibar Island, this study demonstrates that the use of multiple scenes can both allow complete coverage of the study area in the absence of cloud-free...

This paper addresses the problem of identification of multiple musical instruments in polyphonic recordings of classical music. A set of binary random forests was used as a classifier, and each random forest was trained to recognize the target class of sounds. Training data were prepared in two versions, one based on single sounds and their mixes, and the other based on sound frames taken from ...

The joint supply of timber and other services from forest environments plays a central role in most forest land debates. This paper defines a general conceptual model of timber supply that provides the context for discussing both individual harvest choice and aggregate supply models. While the structure and breadth of these models has developed considerably over the last twenty years, unresolve...

We consider a random generalized railway defined as a random 3-regular multigraph where some vertices are regarded as switches not allowing traffic between any pair of attached edges. It is shown that the probability that the generalized railway is functioning is linear in the proportion of switches. Thus there is no threshold phenomenon for this property.

This paper presents the MacSaar system developed to identify complex words in English texts. MacSaar participated in the SemEval 2016 task 11: Complex Word Identification submitting two runs. The system is based on the assumption that complex words are likely to be less frequent and on average longer than words considered to be simple. We report results of 82.5% accuracy and 27% F-Score using a...

The classification of genomic and proteomic data in extremely high dimensional datasets is a wellknown problem which requires appropriate classification techniques. Classification methods are usually combined with gene selection techniques to provide optimal classification conditions—i.e. a lower dimensional classification environment. Another reason for reducing the dimensionality of such data...

We study depth properties of a general class of random recursive trees where each node n attaches to the random node !nXn" and X0, . . . , Xn is a sequence of i.i.d. random variables taking values in [0, 1). We call such trees scaled attachment random recursive trees (SARRT). We prove that the height Hn of a SARRT is asymptotically given by Hn ∼ αmax log n where αmax is a constant depending onl...

Fix a Pareto optimal, strategy proof and non-bossy deterministic matching mechanism and define a random matching mechanism by assigning agents to the roles in the mechanism via a uniform lottery. Given a profile of preferences, the lottery over outcomes that arises under the random matching mechanism is identical to the lottery that arises under random serial dictatorship, where the order of di...

............................................................................................................................ ii Acknowledgements .......................................................................................................... v Table of