In this paper we present a new method for ontology selection in a reuse context. The novel feature of this method is the iterative selection of the reused ontologies. Ontology selection is guided by the user according to his requirements and his perception to the target domain. Starting from a first selected ontology, the concepts with the weakest density are identified then the ontology develo...

Cultural selection theory has been rejected by many social scientists. The objections against this theory are listed and commented. Some of the objections can be dismissed as expressions of preference for one perspective over another. Different perspectives lead scientists to make different kinds of discoveries, but all perspectives are valid, and no theory or perspective can cover all aspects ...

This paper proposes a way of preparing and recording a speech corpus for unit selection text-to-speech speech synthesis driven by symbolic prosody. The research is focused on a phonetically and prosodically rich sentence selection algorithm. Symbolic description on a deep prosody level is used to enrich the phonetic representation of sentences (by respecting the prosodeme types phones appear in...

to reach the desirable ecosystem management, determining the animal dietselection, which is one of the components of rangeland ecosystem, is important. therefore, inorder to determine the grazing behavior and diet selection of sheep and goat, the uplandrangeland of northern part of alborz was selected. in this study, the first weeks of july andaugust of 2009 were chosen for the grazing period o...

Researchers have developed a great number of embedding techniques in steganography. Matrix embedding, otherwise called the binning scheme, is one such technique that has been proven to be an efficient algorithm. Unlike conventional matrix embedding, which requires a maximum likelihood decoding algorithm to find the coset leader, this study proposes an adaptive algorithm called the linear indepe...

We introduce the successive Hitting Set model, where the set system is not given in advance but a set generator produces the sets that contain a specific element from the universe on demand. Despite incomplete knowledge about the set system, we show that several approximation algorithms for the conventional Hitting Set problem can be adopted to perform well in this model. We describe, and exper...

We study a geometric hitting set problem involving unirectional rays and curves in the plane. We show that this problem is hard to approximate within a logarithmic factor even when the curves are convex polygonal x-monotone chains. Additionally, it is hard to approximate within a factor of 76 even when the curves are line segments with bounded slopes. Lastly, we demonstrate that the problem is ...

Urban land cover classification using remote sensing data is quite challenging due to spectrally and spatially complex urban features. The present study describes the potential use of hyperspectral data for urban land cover classification and its comparison with multispectral data. EO-1 Hyperion data of October 05, 2012 covering parts of Bengaluru city was analyzed for land cover classification...