نتایج جستجو برای: cover selection

تعداد نتایج: 423668  

2013
Justin A. Dellinger Christine Proctor Todd D. Steury Marcella J. Kelly Michael R. Vaughan

0006-3207/$ see front matter 2012 Elsevier Ltd. A http://dx.doi.org/10.1016/j.biocon.2012.09.004 ⇑ Corresponding author. Tel.: +1 704 692 8142. E-mail addresses: [email protected] (J.A. Del Proctor), [email protected] (T.D. Steury), makelly2 [email protected] (M.R. Vaughan). Large carnivores, with their expansive home range and resource requirements, are a good model for understanding how animal popu...

2007
J. WESLEY BAILEY

We used an information-theoretic approach to investigate nest-site selection by black-capped vireos (Vireo atricapilla) at the landscape and habitat-patch scales on Fort Hood Military Reservation in central Texas, USA, during 2003 and 2004. We used a use–availability sampling design and logistic regression to compare woody cover characteristics at nests to random points in the landscape to dete...

2016
Seyyed Amin Seyyedi Nick Ivanov

Steganography is the method of information hiding. Free selection of cover image is a particular preponderance of steganography to other information hiding techniques. The performance of steganographic system can be improved by selecting the reasonable cover image. This article presents two level unsupervised image classification algorithm based on statistical characteristics of the image which...

2017
Fidelis Akunke Atuo Timothy John O'Connell

Sympatric predators are predicted to partition resources, especially under conditions of food limitation. Spatial heterogeneity that influences prey availability might play an important role in the scales at which potential competitors select habitat. We assessed potential mechanisms for coexistence by examining the role of heterogeneity in resource partitioning between sympatric raptors overwi...

Journal: :Expert Syst. Appl. 2014
Lior Rokach Alon Schclar Ehud Itach

Ensemble methods have been shown to be an effective tool for solving multi-label classification tasks. In the RAndom k-labELsets (RAKEL) algorithm, each member of the ensemble is associated with a small randomly-selected subset of k labels. Then, a single label classifier is trained according to each combination of elements in the subset. In this paper we adopt a similar approach, however, inst...

2012
Mary Ann Cunningham Douglas H Johnson

Sensitivity to habitat fragmentation often has been examined in terms of thresholds in landscape composition at which a species is likely to occur. Observed thresholds often have been low or absent, however, leaving much unexplained about habitat selection beyond initial thresholds of occurrence, even for species with strong habitat preferences. We examined responses to varying amounts of tree ...

2014
Mirjana Bevanda Ned Horning Bjoern Reineking Marco Heurich Martin Wegmann Joerg Mueller

BACKGROUND Linking animal movements to landscape features is critical to identify factors that shape the spatial behaviour of animals. Habitat selection is led by behavioural decisions and is shaped by the environment, therefore the landscape is crucial for the analysis. Land cover classification based on ground survey and remote sensing data sets are an established approach to define landscape...

Journal: :Journal of Machine Learning Research 2005
Mario Marchand Marina Sokolova

We present a learning algorithm for decision lists which allows features that are constructed from the data and allows a trade-off between accuracy and complexity. We provide bounds on the generalization error of this learning algorithm in terms of the number of errors and the size of the classifier it finds on the training data. We also compare its performance on some natural data sets with th...

1999
J. Cihlar R. Latifovic J. Chen J. Beaubien Z. Li

This is the first of two articles which explore the comtained using the TM map. The performance of samples selected by a combination of cover composition and conbined use of coarse and fine resolution data in land cover studies. It describes the development and evaluation of tagion index responded to the characteristics of individual tiles in terms of the selection criteria. A rigorous applian ...

2000
Anton V. Eremeev

In this paper we propose a mathematical model of a simpli-ed version of genetic algorithm (GA) based on mutation and tournament selection and obtain upper and lower bounds on expected proportion of the individuals with the tness above certain threshold. As an illustration we consider a GA optimizing the bit-counting function and a GA for the vertex cover problem on graphs of a special structure...

نمودار تعداد نتایج جستجو در هر سال

با کلیک روی نمودار نتایج را به سال انتشار فیلتر کنید