Browsing by Subject "Set theory"

Now showing 1 - 20 of 39

Open Access
Adaptive decision fusion based cooperative spectrum sensing for cognitive radio systems
(IEEE, 2011) Töreyin, B. U.; Yarkan, S.; Qaraqe, K. A.; Çetin, A. Enis
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 tools for problems where drifts in concepts take place. Cooperative spectrum sensing in cognitive radio networks is such a problem where channel characteristics and utilization patterns change frequently. The importance of this problem stems from the requirement that secondary users must adjust their frequency utilization strategies in such a way that the communication performance of the primary users would not be degraded by any means. In the proposed framework, sensing values from several sensor nodes are fused together by weighted linear combination at the central spectrum awareness engine. The weights are updated on-line according to an active fusion method based on performing orthogonal projections onto convex sets describing power reading values from each sensor. The proposed adaptive fusion strategy for cooperative spectrum sensing can operate independent from the channel type between the primary user and secondary users. Results of simulations and experiments for the proposed method conducted in laboratory are also presented. © 2011 IEEE.
Open Access
An algorithm based on facial decomposition for finding the efficient set in multiple objective linear programming
(Elsevier, 1996) Sayın, S.
We propose a method for finding the efficient set of a multiple objective linear program based on the well-known facial decomposition of the efficient set. The method incorporates a simple linear programming test that identifies efficient faces while employing a top-down search strategy which avoids enumeration of efficient extreme points and locates the maximally efficient faces of the feasible region. We suggest that discrete representations of the efficient faces could be obtained and presented to the Decision Maker. Results of computational experiments are reported.
Open Access
Algorithms for layout of disconnected graphs
(Elsevier, 2000) Doğrusöz, Uğur
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 near-linear algorithms are based on alternate-bisection and two-dimensional packing methodologies. In addition, the parameters that affect the performance of these algorithms as well as the circumstances under which the two methodologies perform well are analyzed.
Open Access
Atomic strings of group IV, III-V, and II-VI elements
(American Institute of Physics, 2004) Tongay, S.; Durgun, Engin; Çıracı, Salim
A systematic first-principles study of atomic strings made by group IV, III-V, and II-VI elements has revealed interesting mechanical, electronic, and transport properties. The double bond structure underlies their unusual properties. We found that linear chain of C, Si, Ge, SiGe, GaAs, InSb, and CdTe are stable and good conductor, although their parent diamond (zincblende) crystals are covalent (polar) semiconductors but, compounds SiC, BN, AlP, and ZnSe are semiconductors. First row elements do not form zigzag structures.
Open Access
Automatic detection of geospatial objects using multiple hierarchical segmentations
(Institute of Electrical and Electronics Engineers, 2008-07) Akçay, H. G.; Aksoy, S.
The object-based analysis of remotely sensed imagery provides valuable spatial and structural information that is complementary to pixel-based spectral information in classification. In this paper, we present novel methods for automatic object detection in high-resolution images by combining spectral information with structural information exploited by using image segmentation. The proposed segmentation algorithm uses morphological operations applied to individual spectral bands using structuring elements in increasing sizes. These operations produce a set of connected components forming a hierarchy of segments for each band. A generic algorithm is designed to select meaningful segments that maximize a measure consisting of spectral homogeneity and neighborhood connectivity. Given the observation that different structures appear more clearly at different scales in different spectral bands, we describe a new algorithm for unsupervised grouping of candidate segments belonging to multiple hierarchical segmentations to find coherent sets of segments that correspond to actual objects. The segments are modeled by using their spectral and textural content, and the grouping problem is solved by using the probabilistic latent semantic analysis algorithm that builds object models by learning the object-conditional probability distributions. The automatic labeling of a segment is done by computing the similarity of its feature distribution to the distribution of the learned object models using the Kullback-Leibler divergence. The performances of the unsupervised segmentation and object detection algorithms are evaluated qualitatively and quantitatively using three different data sets with comparative experiments, and the results show that the proposed methods are able to automatically detect, group, and label segments belonging to the same object classes. © 2008 IEEE.
Open Access
Distance-based classification methods
(Taylor & Francis, 1999) Ekin, O.; Hammer, P. L.; Kogan, A.; Winter, P.
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 space ('query point') to one of these classes. The various classifications proposed in this paper are determined by the distances between the query point and the points in the training set. We report results of extensive computational experiments comparing the new methods with two well-known distance-based classification methods (k-nearest neighbors and Parzen windows) on data sets commonly used in the literature. The results show that the performance of both new and old distance-based methods is on par with and often better than that of the other best classification methods known. Moreover, the new classification procedures proposed in this paper are: (i) easy to implement, (ii) extremely fast, and (iii) very robust (i.e. their performance is insignificantly affected by the choice of parameter values).
Open Access
A distributed positioning algorithm for cooperative active and passive sensors
(IEEE, 2010) Gholami, M.R.; Gezici, Sinan; Rydström, M.; Ström, E.G.
The problem of positioning a target node is studied for wireless sensor networks with cooperative active and passive sensors. Two-way time-of-arrival and time-difference-of-arrival measurements made by both active and passive nodes are used to estimate the position of the target node. A maximum likelihood estimator (MLE) can be employed to solve the problem. Due to the nonlinear nature of the cost function in the MLE, an iterative search might converge to local minima which often results in large estimation errors. To avoid this drawback, we instead formulate the problem of positioning as finding the intersection of a number of convex sets derived from measurements. To obtain this intersection, we apply the projection onto convex sets approach, which is robust and can be implemented in a distributed manner. Simulations are performed to compare the performance of the MLE and the proposed method. ©2010 IEEE.
Open Access
Entropi fonsiyonuna dayalı uyarlanır karar tümleştirme yapısı
(2012-04) Günay, Osman; Töreyin, B. U.; Köse, Kıvanç; Çetin, A. Enis
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 temsil eden sıfır merkezli bir gerçek sayı olarak kendi kararını oluşturan birçok alt algoritmadan meydana gelir. Karar değerleri, çevrimiçi olarak alt algoritmaları tanımlayan dışbukey kümelerin üzerine entropik izdüşümler yapmaya dayalı bir aktif tümleştirme yöntemi ile güncellenen ağırlıklar kullanılarak doğrusal olarak birleştirilir. Bu yapıda genelde bir insan olan bir uzman da bulunur ve karar tümleştirme algoritmasına geribesleme sağlar. Önerilen karar tümleştirme algoritmasının performansı geliştirdigimiz video tabanlı bir orman yangını bulma sistemi kullanılarak test edilmiştir.
Open Access
An experimental setup for performance analysis of an online adaptive cooperative spectrum sensing scheme for both in-phase and quadrature branches
(IEEE, 2011) Yarkan, S.; Qaraqe, K.A.; Töreyin, B.U.; Çetin, A. Enis
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 of any spectrum sensing method to be deployed in CR systems. In this study, an online adaptive cooperation technique for spectrum sensing is proposed in order to maintain the level of reliability and performance. Cooperation is achieved by sensors which employ energy detection. These sensors send their output to a center where data fusion operation is carried out in an online and adaptive manner. Adaptation is realized by the use of orthogonal projections onto convex sets (POCS). In conjunction with the proposed method, an end-to-end methodology for a flexible experimental setup is also proposed in this study. This setup is arranged to emulate the proposed adaptive cooperation scheme for spectrum sensing and validate its practical use in cognitive radio systems. Comparative performance results for both inphase and quadrature branches are presented. © 2011 IEEE.
Open Access
An experimental validation of an online adaptive cooperation scheme for spectrum sensing
(IEEE, 2011-05) Yarkan, S.; Töreyin, B. U.; Qaraqe, K. A.; Çetin, A. Enis
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 performance under changing channel and environment conditions, in this study, an online adaptive cooperation scheme is proposed. Energy detection data from each cooperating sensor are fused together by an adaptive weighted linear combination at the fusion center. Weight update operation is performed online through the use of orthogonal projections onto convex sets (POCS). Also, in this paper, an end-to-end methodology for a flexible experimental setup is proposed. This setup is specifically deployed to emulate the proposed adaptive cooperation scheme for spectrum sensing and validate its practical use in cognitive radio systems. © 2011 IEEE.
Open Access
Filtered Variation method for denoising and sparse signal processing
(IEEE, 2012) Köse, Kıvanç; Cevher V.; Çetin, A. Enis
We propose a new framework, called Filtered Variation (FV), for denoising and sparse signal processing applications. These problems are inherently ill-posed. Hence, we provide regularization to overcome this challenge by using discrete time filters that are widely used in signal processing. We mathematically define the FV problem, and solve it using alternating projections in space and transform domains. We provide a globally convergent algorithm based on the projections onto convex sets approach. We apply to our algorithm to real denoising problems and compare it with the total variation recovery. © 2012 IEEE.
Open Access
Finding faces in news photos using both face and name information
(IEEE, 2006) Özkan, Derya; Duygulu, Pınar
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 faces associated with the query name are selected, Among these faces, there could be many faces corresponding to the queried person in different conditions, poses and times, but there could also be other faces corresponding to other people in the caption or some non-face images due to the errors in the face detection method used, However, in most cases, the number of corresponding faces of the queried person will be large, and these faces will be more similar to each other than to others. When the similarities of faces are represented in a graph structure, the set of most similar faces will be the densest component in the graph. In this study, we propose a graph-based method to find the most similar subset among the set of possible faces associated with the query name, where the most similar subset is likely to correspond to the faces of the queried person. © 2006 IEEE.
Open Access
Hypersolver: a graphical tool for commonsense set theory
(Elsevier, 1995) Pakkan, M.; Akman, V.
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 non-well-founded sets. A program, called hypersolver, which can solve systems of equations defined in terms of sets in the universe of this new theory is presented. This may be a useful tool for commonsense reasoning. © 1995.
Open Access
Inducing translation templates with type constraints
(Springer, 2005) Çiçekli, İlyas
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 is inferred during the learning process, each induced template is also associated with a set of type constraints. The type constraints that are associated with a translation template restrict the usage of the translation template in certain contexts in order to avoid some of the wrong translations. The types of variables are induced using type lattices designed for both the source and target languages. The proposed generalization technique has been implemented as a part of an example-based machine translation system.
Open Access
Issues in commonsense set theory
(Springer/Kluwer Academic Publishers, 1994) Pakkan, M.; Akman, V.
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, and then consider alternative set theories. Desirable properties of a possible commonsense set theory are investigated, treating different aspects like cumulative hierarchy, self-reference, cardinality, etc. Assorted examples from the ground-breaking research on the subject are also given. © 1995 Kluwer Academic Publishers.
Open Access
Language evolution and information theory
(IEEE, 2004-06-07) Ahlswede, R.; Arıkan, Erdal; Bäumer, L.; Deppe, C.
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. It was shown that the Nowak's conjecture is true for a class of spaces defined by a certain condition on the distance function. A connection between Nowak's model and standard information-theoretic models was indicated.
Open Access
Lattice dynamics and elastic properties of lanthanum monopnictides
(2008) Gökoǧlu G.; Erkişi, A.
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 rock-salt structure (B1 phase), are presented. Calculations were based on plane wave basis sets and pseudopotential methods in the framework of Density Functional Theory (DFT) with generalized gradient approximation. Elastic constants are calculated by tetragonal and orthorhombic distortions on cubic structure. Phonon dispersion spectra was constructed in the linear response approach of the Density Functional Perturbation Theory (DFPT). The complete phonon softening with negative frequencies and large elastic anisotropy were observed for LaN single crystal as a sign of the structural instability. The phonon dispersion curve for LaBi is typical for lanthanum monopnictides and does not show any anomalous physical property. The calculated structural quantities for both LaN and LaBi systems agree well with the available experimental and theoretical data. © 2008 Elsevier Ltd. All rights reserved.
Open Access
Localized states in local isomorphism classes of pentagonal quasicrystals
(American Physical Society, 2022-07-15) Oktel, Mehmet Özgür
A family of pentagonal quasicrystals can be defined by projecting a section of the five-dimensional cubic lattice to two dimensions. A single parameter, the sum of intercepts = j γj, describes this family by defining the cut in the five-dimensional space. Each value of 0 1 2 defines a unique local isomorphism class for these quasicrystals, with = 0 giving the Penrose lattice. Except for a few special values of , these lattices lack simple inflation-deflation rules making it hard to count how frequently a given local configuration is repeated. We consider the vertex-tight-binding model on these quasicrystals and investigate the strictly localized states (LS) for all values of . We count the frequency of localized states both by numerical exact diagonalization on lattices of 105 sites and by identifying localized state types and calculating their perpendicular space images. While the imbalance between the number of sites forming the two sublattices of the bipartite quasicrystal grows monotonically with , we find that the localized state fraction first decreases and then increases as the distance from the Penrose lattice grows. The highest LS fraction of 10.17% is attained at = 0.5 while the minimum is 4.5% at 0.12. The LS on the even sublattice are generally concentrated near sites with high symmetry, while the LS on the odd sublattice are more uniformly distributed. The odd sublattice has a higher LS fraction, having almost three times the LS frequency of the even sublattice at = 0.5. We identify 20 LS types on the even sublattice, and their total frequency agrees well with the numerical exact diagonalization result for all values of . For the odd sublattice, we identify 45 LS types. However, their total frequency remains significantly below the numerical calculation, indicating the possibility of more independent LS types.
Open Access
The method of analytical regularization in the electromagnetic wave scattering by thin disks
(Institution of Engineering and Technology, 2007) Balaban, M. V.; Nosich, A. I.; Altıntaş, Ayhan; Benson, T. M.
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) disk, and also thin electrically resistive (ER) and dielectric disks whose thickness is much smaller than the disk radius and the free space wavelength, and also much smaller than the skin-layer depth in the ER disk case. The method used for the modeling is based on the integral equation (IE) technique and analytical regularization. Starting with Maxwell's equations, boundary conditions and the radiation condition at infinity we obtain a set of coupled dual IEs (DIEs) for the unknowns and then reduce this set of equations to the coupled IEs of the Fredholm second kind. To verify our results we calculate the far field characteristics in the case of the PEC disk with the incident field being the field of horizontal electrical dipole located on the disk axis.
Open Access
Model based anticontrol of discrete-time systems
(IEEE, 2003) Morgül, Ömer
We will consider a model-based approach for the anticontrol of some discrete-time 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 controlled system with the chaotic system model.