9829795
Poisson Generators on Mesh-Connected Computers with Multiple Broadcasting
205001001
The Towers of Hanoi Problem with Parallel Moves
Abstract This paper proposes a variant of the towers of Hanoi problem allowing parallel moves. An algorithm for this problem is presented and proved to be optimal.
33647867
Manipulating multiple stacks with ordered-heap
Abstract A new method for manipulating multiple stacks based on dynamic data structure is proposed in this paper. A simple data structure called ordered-heap is developed, in which nodes are preserved as a heap, and kept inorder traversal sequence remains unchanged. By employing ordered-heap to a multiple-stacks environment, it is easy and efficient to simultaneously handle several variable-size stacks in a sequential memory area. Our experiments show that not only the total number of item movements in the proposed method is much smaller than in the previous methods, but also the overhead for maintaining data structure in the proposed method is kept within a reasonable range.
30935891
K-coverable polyhex graphs
2083522
Conservation analysis of small RNA genes in Escherichia coli
MOTIVATION
Small RNA (sRNA) genes in Escherichia coli have been in focus recently, as 44 out of 55 experimentally confirmed sRNA genes have been precisely located in the genome. The object of this study is to analyze quantitatively the conservation of these sRNA genes and compare it with the conservation of protein-encoding genes, function-unknown regions and tRNA genes.


RESULTS
The results show that within an evolutionary distance of 0.26, both sRNA genes and protein-encoding genes display a similar tendency in their degrees of conservation at the nucleotide level. In addition, the conservation of sRNA genes is much stronger than function-unknown regions, but much weaker than tRNA genes. Based on the conservation of studied sRNA genes, we also give clues to estimate the total number of sRNA genes in E.coli.


SUPPLEMENTARY INFORMATION
Supplementary information is available at http://www.bioinfo.org.cn/SM/sRNAconservation.htm
32766485
Accelerating convergence in the Fermat-Weber location problem
This paper presents a simple procedure for accelerating convergence in a generalized Fermat-Weber problem with l"p distances. The main idea is to multiply the predetermined step size of the Weiszfeld algorithm by a factor which is a function of the parameter p. The form of this function is derived from the local convergence properties of the iterative sequence. Computational results are obtained which demonstrate that the total number of iterations to meet a given stopping criterion will be reduced substantially by the new step size, with the most dramatic results being observed for values of p close to 1.
41515158
Error resilience for block loss with overlapped motion compensation
A new error resilience algorithm for recovering the lost blocks or motion vectors is presented. It combines the overlapped motion compensation and the side match criterion to make the effect of lost blocks subjectively imperceptible. The side match criterion takes advantage of the spatial contiguity and interpixel correlation of image to select the best-fit replacement among the motion vectors of spatially contiguous candidate blocks. Particularly, to mask the blocking artifacts, we incorporate an overlapping technique to create a subjectively closer approximation to the true error-free image.
681079
Coronoid Systems with Perfect Matchings
Abstract A hexagonal system is a finite 2-connected plane graph in which every interior face is bounded by a regular hexagon. A coronoid system is obtained from a hexagonal system by deleting some interior vertices and/or interior edges such that a unique interior face which is bounded by a polygon with more than six edges emerges, and each edge on the outer perimeter belongs to a hexagon. In this paper, a necessary and sufficient condition is given for a coronoid system to have perfect matchings. Moreover, a criterion is established for those coronoid systems with perfect matchings that possess some edges which do not belong to any perfect matching.