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.
With the improvement of the performance of ADC, it is available to sample and process real signal in intermediate frequency in radio communication system design. The large source usage and long latency of image-reject filter and decimation in IF DDC are the difficult problems in design. But In many occasions the signal can be processed as narrow band signal. In this paper, we designed an M-points...
Because of the high computation demand for multimedia applications like video decoding, there is a need to develop flexible and high performance reconfigurable computing architectures. Taking video decoding algorithm as an example, we propose a reconfigurable computing realization solution of multimedia application. Based on the analysis of parallelism in video decoding algorithm, a hardware platform...
In order to realize the objective and synthetic evaluation of the feasibility in Low-carbon (LC) project, the paper constructs the knowledge representation system(i.e. attribute value of information system), applies the reduction and the mining rules of the Rough Set Theory, at same the time computing dynamic weight, subjective weight, objective weight are combined with Analytic Hierarchy Process...
This paper studies the loading problems of Multi-category Goods under the limited loading capacity. According to the characteristics of model, hybrid heuristic algorithm is used to get the optimization solution. Firstly, adopt binary code so as to make the problem more succinctly. On the basis of cubage-weight balance algorithm, construct initial solution to improve the feasibility. Through adopting...
The multitone signals make traditional analysis difficult even impossible if the circuits are highly nonlinear. Using multiple time variables allow an efficient representation of these signals. In this formulation the components with different rates of variation are decoupled, each disparate signal being represented by its own artificial time scale. The differential algebraic equations describing...
An algorithm for multiparameter sensitivity analysis of a synthesized network based on a nullor model of active devices is implemented. It is simplified by using the modified Coates flow-graph. Due to the suggested method, additional information for parameter influence upon transmission coefficients in the circuit is obtained, all partial transfer functions and their products can be found. An example...
The difficulties encountered in sequential decision-making problems under uncertainty are often linked to the large size of the state space. Exploiting the structure of the problem, for example by employing a factored representation, is usually an efficient approach but, in the case of partially observable Markov decision processes, the fact that some state variables may be visible has not been sufficiently...
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...
The Lovász Local Lemma (LLL) is a powerful tool that gives sufficient conditions for avoiding all of a given set of "bad" events, with positive probability. A series of results have provided algorithms to efficiently construct structures whose existence is non-constructively guaranteed by the LLL, culminating in the recent breakthrough of Moser & Tardos. We show that the output distribution...
We present a near-linear time algorithm that approximates the edit distance between two strings within a polylogarithmic factor. For strings of length n and every fixed ε >; 0, the algorithm computes a (log n)O(1/ε) approximation in n1+ε time. This is an exponential improvement over the previously known approximation factor, 2Õ(√log n), with a comparable running time [Ostrovsky and Rabani, J....
An approach based on chaos theory and fuzzy neural network (FNN) is proposed for chaotic time series prediction. Firstly, C-C algorithm is applied to estimate the delay time of chaotic signal. Grassberger-Procaccia (G-P) algorithm and least squares regression are employed to calculate the correlation dimension of chaotic signal simultaneously. Considering the difficulty in determining the number of...
Sequential pattern mining is an important research task in many domains, such as biological science. In this paper, we study the problem of mining frequent patterns from sequences with wildcards. The user can specify the gap constraints with flexibility. Given a subject sequence, a minimal support threshold and a gap constraint, we aim to find frequent patterns whose supports in the sequence are no...
This paper aims to estimate the error in the control of a robot arm model by analyzing dynamics of the robot arm. The dynamics of robot arm has represented in the form of second order differential equation. A meticulous attempt has been made to estimate the error by comparing the solutions obtained using Single Term Walsh Series (STWS) and Single-Term Haar Wavelet Series (STHWS) method. The exact...
A new force control algorithm was proposed for parallel system. Through the analysis of the kinematics theory of multi-axis motion controller, a force control algorithm was put forward based on kinematics. Then a procedure of 2D parallel system as example was given. The result shows it is easy to realize and modify.
We give the first black-box reduction from arbitrary approximation algorithms to truthful approximation mechanisms for a non-trivial class of multi-parameter problems. Specifically, we prove that every packing problem that admits an FPTAS also admits a truthful-in-expectation randomized mechanism that is an FPTAS. Our reduction makes novel use of smoothed analysis, by employing small perturbations...
We investigate the possibility of finding satisfying assignments to Boolean formulae and testing validity of quantified Boolean formulae (QBF) asymptotically faster than a brute force search. Our first main result is a simple deterministic algorithm running in time 2n-Ω(n) for satisfiability of formulae of linear size in n, where n is the number of variables in the formula. This algorithm extends...
The basic objective of economic dispatch of electric power generation is to schedule the committed generating unit outputs so as to meet the load demand at minimum operating cost while satisfying all unit and system equality and inequality constraints. Due to increasing concern over the environmental considerations, society demands adequate and secure electricity not only at the cheapest possible...
We present an all-pairs shortest path algorithm whose running time on a complete directed graph on n vertices whose edge weights are chosen independently and uniformly at random from [0,1] is O(n2), in expectation and with high probability. This resolves a long standing open problem. The algorithm is a variant of the dynamic all-pairs shortest paths algorithm of Demetrescu and Italiano. The analysis...
We give the first improvement to the space/approximation trade-off of distance oracles since the seminal result of Thorup and Zwick [STOC'01]. For unweighted graphs, our distance oracle has size O(n5/3) = O(n1.66⋯) and, when queried about vertices at distance d, returns a path of length 2d + 1. For weighted graphs with m = n2/α edges, our distance oracle has size O(n2/3√α) and returns a factor 2 approximation...
We present a Fourier-analytic approach to list-decoding Reed-Muller codes over arbitrary finite fields. We use this to show that quadratic forms over any field are locally list-decodeable up to their minimum distance. The analogous statement for linear polynomials was proved in the celebrated works of Goldreich-Levin and Goldreich-Rubinfeld-Sudan. Previously, tight bounds for quadratic polynomials...
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.