When we approach shape representation, we need to choose which modeling constructs to adopt, e.g., low-level geometric elements like edges and (sur)faces, or more general elements like protrusions, bumps and holes, among others. The latter can be described as spatial configurations of the former satisfying unity and, possibly, identity criteria. However, once these are brought into the picture,...

Let G be a finite group. A subset S of G not the identity element 1 of G called C I -subset (C( stands for isomorphism"), if for any isomorphism D(G, S) ~ D(G, T), there is f AutG such that T = f(S). G is called a DCI-group if every subset of G {I} is a CI-subset. G is called a GCl-group or simply a C I -group if every inverse-closed subset of G {I} is a CI-subset. (DCI and GCl stands for "digr...

the purpose of this paper is to design entrepreneurship model of agricultural extension in the context of agricultural sustainable development. in fact the purpose of this paper is to identify the prerequisite (the influential factors of entrepreneurship), process (development of entrepreneurial program in organization); context (extension perspective in the context of agricultural sustainable ...

several semantic image search schemes have been recently proposed to retrieve images from the web. however, the query context is regularly ignored in these techniques and hence, many of the returned images are not adequately relevant. in this paper, we make use of context to further confine the outcome of the semantic search engines. for this purpose, we propose a hybrid search engine which uti...

Context-aware systems must be interoperable and work across different platforms at any time and in any place. Context data collected from wireless body area networks (WBAN) may be heterogeneous and imperfect, which makes their design and implementation difficult. In this research, we introduce a model which takes the dynamic nature of a context-aware system into consideration. This model is con...

Probabilistic context-free grammars (PCFGs) provide a simple way to represent a particular class of distributions over sentences in a context-free language. Efficient parsing algorithms for answering particular queries about a PCFG (i.e., calculating the probability of a given sentence, or finding the most likely parse) have been developed, and applied to a variety of patternrecognition problem...

We investigate models for learning the class of context-free and context-sensitive languages (CFLs and CSLs). We begin with a brief discussion of some early hardness results which show that unrestricted language learning is impossible, and unrestricted CFL learning is computationally infeasible; we then briefly survey the literature on algorithms for learning restricted subclasses of the CFLs. ...