The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
The GMM classifier for pattern recognition has shown increased intention in many applications such as speaker verification and identification. Such classifier requires a large storage and complex processing units but improved in performances. The performances of the GMM and its hardware complexity are analyzed in this paper. FPGA-based hardware implementation of the Log-Add algorithm is presented...
This paper deals with the number of paths in multiterminal binary decision diagrams (MTBDDs) and shared binary decision diagrams (SBDDs) representing a set of Boolean functions. It is shown that the number of paths in an MTBDD (SBDD) can be uniquely determined by values of specific weighted-autocorrelation coefficients. An analytical expression for the number of paths as a linear function of the values...
We investigate the problem of reconstructing a high-dimensional nonnegative sparse vector from lower-dimensional linear measurements. While much work has focused on dense measurement matrices, sparse measurement schemes can be more efficient both with respect to signal sensing as well as reconstruction complexity. Known constructions use the adjacency matrices of expander graphs, which often lead...
A modified method used in gross error detection and data reconciliation is introduced in this paper. The modified method combines NT (Nodal Test) method and SEGE (simultaneous estimation of gross errors) method to find nodes with gross error. The proposed method can decrease the number of combination and increase computation efficiency. Simulation results on a steam metering system verify the effectiveness...
A simplified space-vector pulse width modulation (SVPWM) algorithm for back-to-back three-level converter is analyzed in this paper. Also, a novel virtual flux control strategy and a hybrid rotor flux observer are proposed in the following. These algorithms are put into used in a back-to-back mine hoist control system for induction motor. The experiment results verified the effectiveness of the algorithms...
Based on the method of interval incidence degree, the grey relative incidence is expanded, and the decision-making information, for the three-parameter interval numbers, is also explored. In line with the degree of closeness between the effect vector of various schemes and the effect vector of optimal scheme or critical scheme, the ideally and critically relative incidence decision models, under the...
The process planning and scheduling (PPS) is to determine a solution (schedule), which tells a production facility what to make, when, and on which equipment, to process a set of parts with operations effectively. Multiobjective PPS problems become more complex because the decision maker need to make a trade-off between two or more objectives while determining a set of optimal nondominated solutions...
The projections and projection matrices are widely used (see e.g., Basilevsky 1983; Graybill 1983; Horn and Johnson 1990; Lutkepohl 1996). The projections and projection matrices with respect to the symmetric positive definite matrices are often used in algebra and statistics (see e.g., Rao and Mitra 1971; Searle 1982; Harville, 1997; Abadir and Magnus 2005). Harville (1997) discussed in detail the...
We give efficient algorithms for volume sampling, i.e., for picking k-subsets of the rows of any given matrix with probabilities proportional to the squared volumes of the simplices defined by them and the origin (or the squared volumes of the parallelepipeds defined by these subsets of rows). This solves an open problem from the monograph on spectral algorithms by Kannan and Vempala (see Section...
We study the problem of identity testing for depth-3 circuits of top fanin k and degree d. We give a new structure theorem for such identities. A direct application of our theorem improves the known deterministic d -time black-box identity test over rationals (Kayal & Saraf, FOCS 2009) to one that takes d(O(k2))-time. Our structure theorem essentially says that the number of independent variables...
We show that the minimum possible size of an ϵ-net for point objects and line (or rectangle)-ranges in the plane is (slightly) bigger than linear in 1/ϵ. This settles a problem raised by Matousek, Seidel and Welzl in 1990.
A locally decodable code encodes a message by a codeword, such that even if the codeword is corrupted by noise, each message bit can be recovered with high probability by a randomized decoding procedure that reads only few bits of the codeword. Recently a new class of locally decodable codes, based on families of vectors with restricted dot products has been discovered. We refer to those codes as...
We give sub linear-time approximation algorithms for some optimization problems arising in machine learning, such as training linear classifiers and finding minimum enclosing balls. Our algorithms can be extended to some kernelized versions of these problems, such as SVDD, hard margin SVM, and L2-SVM, for which sub linear-time algorithms were not known before. These new algorithms use a combination...
In this paper a novel view-invariant movement recognition method is presented. A multi-camera setup is used to capture the movement from different observation angles. Identification of the position of each camera with respect to the subject's body is achieved by a procedure based on morphological operations and the proportions of the human body. Binary body masks from frames of all cameras, consistently...
In multi-instance multi-label learning (i.e. MIML), each example is not only represented by multiple instances but also associated with multiple labels. Most existing algorithms solve MIML problem via the intuitive way of identifying its equivalence in degenerated version of MIML. However, this identification process may lose useful information encoded in training examples and therefore be harmful...
An application of Parallel Radial Basis Function (PRBF) network model on prediction of chaotic time series is presented in this paper. The PRBF net consists of a number of radial basis function (RBF) subnets connected in parallel. The number of input nodes for each RBF subnet is determined by different embedding dimension based on chaotic phase-space reconstruction. The output of PRBF is a weighted...
We present an algorithm that on input of an n-vertex m-edge weighted graph G and a value k, produces an incremental sparsifier G with n-1+m/k edges, such that the condition number of G with G is bounded above by Õ(k log2 n), with probability 1-p. The algorithm runs in time Õ((m log n + n log n) log(1/p)). As a result, we obtain an algorithm that on input of an n × n symmetric diagonally dominant...
In this paper we give the first construction of a pseudorandom generator, with seed length O(log n), for CC0[p], the class of constant-depth circuits with unbounded fan-in MODp gates, for some prime p. More accurately, the seed length of our generator is O(log n) for any constant error ϵ > 0. In fact, we obtain our generator by fooling distributions generated by low degree polynomials, over Fp,...
We address backward compatibility issues when developing new mobile communication systems, where older “legacy” users do not support features of the newer system. With multiuser MIMO vector perturbation precoding, all active users have to support modulo detection of the perturbed receive signal. Since legacy users cannot undo this nonlinear operation, they must be kept spatially separated from the...
Generally, in an electricity market, congestion is caused by two main agents - offer/bid by generator/load and the transmission system (i.e. network) itself. In this paper, we focus on the interdependency between congestion and the network, while keeping the effect of offer/bid constant. Network-based dynamic congestion can occur when congestion changes due to the changes in the network. We analyze...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.