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.
In this paper, we evaluate the input-parity weight distribution of terminated recursive systematic convolutional (RSC) codes. On the trellis of convolutional codes, the paths are ended at any state of the code after information sequence input. The number of paths ended at the zero-state can be described by the number of error events which can easily be obtained. For the paths at non-zero state of...
In this paper, we focus on the discrete-time polynomial systems and present the modified algorithms for testing observability and accessibility based on the methods by D. Nešić. Our method uses not only quantifier elimination but also Gröbner basis and real root counting techniques for decision problems needed in checking the properties and incorporates the strategy to improve efficiency in testing...
The fast growing of data scale encourages the wide employment of data disks with large storage capacity. However, a mass of data disks' equipment will in turn increase the probability of data loss or damage, because of the appearance of various kinds of disk failures. To ensure the intactness of the hosted data, modern storage systems usually adopt erasure codes, which can recover the lost data by...
This paper presents an application of swarm intelligence technique for power system optimization. Unit commitment is an important task for the optimal allocation of the generating units for the economic operations of the power system network. Solution to the unit commitment (UC) problem in the conventional market and profit based unit commitment (PBUC) in restructured power market have been solved...
Discovering global frequent subtrees from ordered labeled trees in distribute environment is an attractive research problem in data mining. In this paper, a new algorithm FAMDFS (Fast Algorithm for Mining Global Frequent Subtree) was proposed. This algorithm transfer local projected branch frequent nodes, can decrease network traffic, improve the efficiency of the algorithm. Theoretical analysis and...
An algebraic decoding of the (89, 45, 17) quadratic residue code suggested by Truong et al. (2008) has been designed that uses the inverse-free Berlekamp-Massey (BM) algorithm to determine the error-locator polynomial and applies a verification method to check whether the error pattern obtained by decoding algorithm is correct or not. In this paper, based on the ideas of the algorithm mentioned above,...
The binary QR codes are well known for their good behavior. The proposed algebraic decoding algorithm for decoding the (31, 16, 7) QR code with reducible generator polynomial is able to correct up to three errors in the finite field GF(25). The proposed algorithm is based on an application of the decoding algorithm given by Truong et al. and Chen et al. to modify the decoding algorithm proposed by...
In this paper, a classical decoder for the (89, 45, 17) binary quadratic residue code, the last one not decoded yet of length less than 100, is proposed. It was also verified for all error patterns within the error-correcting capacity of the code without checking all error patterns by computer simulations.
This paper discusses the predictability of the sequence given by outputing a constant proportion α of the leading bits of the numbers produced by a linear congruential generator. First, we make the assumption that the modulus of the generator is the only known parameter and we prove that, almost surely, a significant proportion of the bits can be predicted from the previous ones, once the generator...
It is shown that the problem of deciding and constructing a perfect matching in bipartite graphs G with the polynomial permanents of their n × n adjacency matrices A (perm(A) = nO(1)) are in the deterministic classes NC2 and NC3, respectively. We further design an NC3 algorithm for the problem of constructing all perfect matchings (enumeration problem) in a graph G with a permanent bounded by O(nk)...
A system design approach based on the use of algorithm-specific integrated circuits is presented. This approach is illustrated with the examples of a 2-D image recognition system and a 1000 word speech recognition system which have recently been built. These systems demonstrate that the use of algorithm-specific chips leads to an enormous reduction in the size and hardware cost while providing computational...
We explicitly construct, for every integer n and ε ≫ 0, a family of functions (psuedo-random bit generators) fn,ε:{0,1}nε → {0,1}n with the following property: for a random seed, the pseudorandom output "looks random" to any polynomial size, constant depth, unbounded fan-in circuit. Moreover, the functions fn,ε themselves can be computed by uniform polynomial size, constant depth circuits...
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.