33569110
A Branch-and-Bound Algorithm for Single-Row Routing
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.
9829795
Poisson Generators on Mesh-Connected Computers with Multiple Broadcasting
30314810
Non-Associative Parallel Prefix Computation
Abstract Associativity of a binary operation allows many applications that are not possible with a non-associative binary operation. We propose a method to transform a binary expression into an associative one and present two related applications.
46105483
Embedding Cycles in IEH Graphs
Abstract We embed cycles into IEH graphs. First, IEH graphs are proved to be Hamiltonian except when they are of size 2 n − 1 for all n ⩾ 2. Next, we show that for an IEH graph of size N , an arbitrary cycle of even length N e where 3 N c N is found. We also find an arbitrary cycle of odd length N o where 2 N o N if and only if a node of this graph has at least one forward 2-Inter-Cube (IC) edges. These results help describe the whole cycle structure in IEH graphs.
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.
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.
4792658
Active Page Generation via Customizing XML for Data Beans in E-Commerce Applications
In this paper, we analyze enabling technologies for typical e-business applications in terms of their multi-tier system architecture and their Model-Control-View (MCV) programming model. Based on observed limitations of the JSP (Java Server Page) technique commonly adopted for dynamic page generation (the view logic), we instead propose an alternative solution approach, namely, a generic schema mapping strategy to generate XML documents and DTDs from enterprise data beans. First, we describe in detail the XML generation process for the content composition logic. We also outline the XSL processing for the transformation logic. The separation of these two logics results in a generic solution to the bean viewing problem. In particular, it improves the bean reusability via its XML representative compared to the rigid strategy of hard-coding logics into JSP. Our proposed XML mapping solution represents a potentially valuable addition to future versions of the enterprise data beans specification. The trade-off between performance and flexibility of these alternative solutions is discussed. Lastly, we survey the state-of-art research results and emerging stardards related to this XML model mapping approach.
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.
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.
38715917
Perfect Matchings of Generalized Polyomino Graphs