A new class of linear codes over GF(q) for byte organized systems from algebraic curves is proposed. Here, an element in GF(q) is called a symbol and "byte" denotes a q-ary sequence of length b≥2. A codewor...
详细信息
Previously we proposed a fast parallel decoding algorithm for general one-point algebraic geometric (AG) codes with a systolic array architecture. But, designing the detailed structure of the systolic array and schedu...
详细信息
This paper describes geometrical essentials of some iteration methods （e.g. Newton iteration, secant line method, etc.） for solving nonlinear equations and advances some geometrical methods of iteration that are fle...
详细信息
This paper describes geometrical essentials of some iteration methods （e.g. Newton iteration, secant line method, etc.） for solving nonlinear equations and advances some geometrical methods of iteration that are flexible and efficient.
We show that probabilistic bisimulation equivalence for normed probabilistic context-free processes is in Σ2p, the second level of the polynomial-time hierarchy, and hence in PSPACE. We also show that minimization of...
详细信息
This paper studies the rearrangeability of switching networks composed of digital symmetrical matrices (DSM networks). We describe an efficient rearrangement algorithm for rearrangeable DSM networks with O(r2) time co...
详细信息
Electrical impedance tomography (EIT) is a non-invasive imaging technique which aims to image the impedance of material within a test volume from electrical measurements made on the surface. The reconstruction of impe...
详细信息
Electrical impedance tomography (EIT) is a non-invasive imaging technique which aims to image the impedance of material within a test volume from electrical measurements made on the surface. The reconstruction of impedance images is an ill-posed problem which is both extremely sensitive to noise and highly comput.tionally intensive. This paper defines an experimental measurement in EIT and calculates optimal experiments which maximize the distinguishability between the region to be imaged and a best estimate conductivity distribution. These optimal experiments can be derived from measurements made on the boundary. We describe a reconstruction algorithm, known as POMPUS, which is based on the use of optimal experiments. We have shown that, given some mild constraints, if POMPUS converges, it converges to a stationary point of our objective function. It is demonstrated to be many times faster than standard, Newton based, reconstruction algorithms. Results using synthetic data indicate that the images produced by POMPUS are comparable to those produced by these standard algorithms.
A successive quadratic programming algorithm for solving SDP relaxation of Max- Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equatio...
详细信息
A successive quadratic programming algorithm for solving SDP relaxation of Max- Bisection is provided and its convergence result is given. The step-size in the algorithm is obtained by solving n easy quadratic equations without using the linear search technique. The numerical experiments show that this algorithm is rather faster than the interior-point method.
For a number of binary cyclic codes with e<e/sub BCH/, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp...
详细信息
For a number of binary cyclic codes with e<e/sub BCH/, algebraic algorithms are given to find the error locator polynomial. Thus, for these codes more errors can be corrected algebraically than by the Berlekamp-Massey algorithm. In some cases, all error patterns of weight up to e can be decoded; in other cases, only error patterns of weight up to e' with e/sub BCH/>e'>or=e can be decoded. The correctness of three of these algorithms is (partly) based on an exhaustive comput.r search; in all other cases, the algebraic proof is given in detail. It seems likely that many more cyclic codes can be decoded with these methods.
This paper discusses variations of a model of images and develops algorithms for estimation of all the parameters from the raw image data. The model is suitable for some cases of (1) lossy image compression and realis...
详细信息
Presents the B∗∗∗-tree, a data organization method which improves the storage utilization of the conventional B∗-tree by 20%-50%. The B∗∗∗-tree uses a special node data structure that eliminates some of the I/O overhe...
详细信息
暂无评论