Feature selection is an essential problem in many fields such as computer vision. In this paper we introduce a supervised feature selection criterion based on Partial Least Squares regression (PLS). We find an optimal feature subset by applying the theory of Optimal Experiment Design to optimize the eigenvalues of the loadings matrix obtained from PLS. Since PLS extracts components such that th...

The quadratic assignment problem (QAP) belongs to the class of NP -hard combinatorial optimization problems. Although it has been studied extensively over the past 35 years, problems of size n 15 still prove to be intractable. Since good lower bounds are necessary to solve larger problem instances, we discuss the class of eigenvalue bounds for QAP and extend previous results of these continuous...

The interference constraints of genetic spectrum assignment model in cognitive radio networks are analyzed in this paper. An improved genetic spectrum assignment model is proposed. The population of genetic algorithm is divided into two sets, the feasible spectrum assignment strategies and the randomly updated spectrum assignment strategies. The penalty function is added to the utility function...

The irlba package provides a fast way to compute partial singular value decompositions (SVD) of large sparse or dense matrices. Recent additions to the package can also compute fast partial symmetric eigenvalue decompositions and principal components. The package is an R implementation of the augmented implicitly restarted Lanczos bidiagonalization algorithm of Jim Baglama and Lothar Reichel. S...

This paper models and analyzes downlink and uplink power assignment in Code Division Multiple Access (CDMA) mobile networks. By discretizing the area into small segments, the power requirements are characterized via a matrix representation that separates user and system characteristics. We obtain a closed-form analytical expression of the so-called Perron-Frobenius eigenvalue of that matrix, wh...

Abstract. To study the characteristic features of relativistic bound systems, the Bethe-Salpeter equation (BSE) for two equal mass spin 1/2 particles (like the deuteron) is solved in the cm-frame for a covariant separable interaction kernel. For that purpose the BSE is transformed to an eigenvalue problem which is diagonalized numerically. The Bethe–Salpeter amplitudes (BSAs) are obtained strai...

The state assignment for a finite state machine greatly affects the delay, area, and testabilities of the sequential circuits. In order to reduce the length and number of feedback cycles, a new state assignment technique based on m-block partition is introduced in this paper. After the completion of proposed state assignment and logic synthesis, partial scan design is performed to choose minima...

where X is a real number and/(i,x) is a real-valued function defined on R1 x G with /(0, x) s 0. If/(u,x) = u, the study of the boundary value problem (1) forms the foundation of the spectral analysis of A, a problem of great importance both in mathematics and its applications. If f(u,x) does not depend on « in a linear manner, one enters the relatively uncharted world of nonlinear functional a...

In this paper, we study the semidefinite inverse eigenvalue problem of reconstructing a real n-by-n matrix C such that it is nearest to the original pre-estimated real n-by-n matrix Co in the Frobenius norm and satisfies the measured partial eigendata, where the required matrix C should preserve the symmetry, positive semidefiniteness, and the prescribed entries of the preestimated matrix Co. W...

We investigate the D-optimal design problem in the common trigonometric regression model, where the design space is a partial circle. The task of maximizing the criterion function is transformed into the problem of determining an eigenvalue of a certain matrix via a di erential equation approach. Since this eigenvalue is an analytic function of the length of the design space, we can make use of...