Browsing by Keywords "Set theory"
Now showing items 120 of 38

Adaptive decision fusion based cooperative spectrum sensing for cognitive radio systems
(IEEE, 2011)In this paper, an online Adaptive Decision Fusion (ADF) framework is proposed for the central spectrum awareness engine of a spectrum sensor network in Cognitive Radio (CR) systems. Online learning approaches are powerful ... 
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
(Elsevier, 1996)We propose a method for finding the efficient set of a multiple objective linear program based on the wellknown facial decomposition of the efficient set. The method incorporates a simple linear programming test that ... 
Algorithms for layout of disconnected graphs
(Elsevier, 2000)We present efficient algorithms for the layout of disconnected objects in a graph (isolated nodes and components) for a specified aspect ratio. These linear and nearlinear algorithms are based on alternatebisection and ... 
Atomic strings of group IV, IIIV, and IIVI elements
(American Institute of Physics, 2004)A systematic firstprinciples study of atomic strings made by group IV, IIIV, and IIVI elements has revealed interesting mechanical, electronic, and transport properties. The double bond structure underlies their unusual ... 
Automatic detection of geospatial objects using multiple hierarchical segmentations
(Institute of Electrical and Electronics Engineers, 200807)The objectbased analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixelbased spectral information in classification. In this paper, we present novel methods ... 
Distancebased classification methods
(Taylor & Francis, 1999)Given a set of points in a Euclidean space, and a partitioning of this 'training set' into two or more subsets ('classes'), we consider the problem of identifying a 'reasonable' assignment of another point in the Euclidean ... 
A distributed positioning algorithm for cooperative active and passive sensors
(IEEE, 2010)The problem of positioning a target node is studied for wireless sensor networks with cooperative active and passive sensors. Twoway timeofarrival and timedifferenceofarrival measurements made by both active and ... 
Entropi fonsiyonuna dayalı uyarlanır karar tümleştirme yapısı
(201204)Bu bildiride, resim analizi ve bilgisayarla görü uygulamalarında kullanılmak üzere entropi fonksiyonuna dayanan uyarlanır karar tümleştirme yapısı geliştirilmiştir. Bu yapıda bileşik algoritma, herbiri güven derecesini ... 
An experimental setup for performance analysis of an online adaptive cooperative spectrum sensing scheme for both inphase and quadrature branches
(IEEE, 2011)Spectrum sensing is one of the most essential characteristics of cognitive radios (CRs). Robustness and adaptation to varying wireless propagation scenarios without compromising the sensing accuracy are desirable features ... 
An experimental validation of an online adaptive cooperation scheme for spectrum sensing
(IEEE, 201105)Cooperative spectrum sensing methods in the literature assume a static communication scenario with fixed channel and propagation environment characteristics. In order to maintain the level of sensing reliability and ... 
Filtered Variation method for denoising and sparse signal processing
(IEEE, 2012)We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently illposed. Hence, we provide regularization to overcome this challenge by ... 
Finding faces in news photos using both face and name information
(IEEE, 2006)We propose a method to associate names and faces for querying people in large news photo collections. On the assumption that a person's face is likely to appear when his/her name is mentioned in the caption, first all the ... 
Hypersolver: a graphical tool for commonsense set theory
(Elsevier, 1995)This paper investigates an alternative set theory (due to Aczel) called the Hyperset Theory. Aczel uses a graphical representation for sets and thereby allows the representation of nonwellfounded sets. A program, called ... 
Inducing translation templates with type constraints
(Springer, 2005)This paper presents a generalization technique that induces translation templates from a given set of translation examples by replacing differing parts in the examples with typed variables. Since the type of each variable ... 
Issues in commonsense set theory
(Springer/Kluwer Academic Publishers, 1994)The success of set theory as a foundation for mathematics inspires its use in artificial intelligence, particularly in commonsense reasoning. In this survey, we briefly review classical set theory from an AI perspective, ... 
Language evolution and information theory
(IEEE, 20040607)The use of Nowak's model to study the language evolution and to settle a conjecture by Nowak was discussed. These models explained the ways by which natural selection can lead to the gradual emergence of human language. ... 
Lattice dynamics and elastic properties of lanthanum monopnictides
(2008)In this study, first principles calculation results of the second order elastic constants and lattice dynamics of two lanthanum monopnictides, LaN and LaBi, which crystallize in rocksalt structure (B1 phase), are presented. ... 
The method of analytical regularization in the electromagnetic wave scattering by thin disks
(Institution of Engineering and Technology, 2007)We consider the problem of diffraction of an arbitrary electromagnetic wave by a thin disk made from different materials and located in free space. Here we imply a zero thickness perfectly electrically conducting (PEC) ... 
Model based anticontrol of discretetime systems
(IEEE, 2003)We will consider a modelbased approach for the anticontrol of some discretetime systems. We first assume the existence of a chaotic model in an appropriate form. Then by using an appropriate control input we try to match ... 
The network design problem with relays
(Elsevier, 2007)The network design problem with relays (NDPR) is defined on an undirected graph G = (V, E, K), where V = {1, ..., n} is a vertex set, E = {(i, j) : i, j ∈ V, i < j} is an edge set. The set K = {(o(k), d(k))} is a set ...