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.
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
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.
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.
10137544
Diagnosing Java Programs with Static Abstractions of Data Structures
Model-based software debugging helps users to find program errors and thus to reduce the overall costs for software development. In this paper, we extend our previous work to diagnose common data structure errors. The proposed logical program model derives from a collection of indexed object relations, which capture the underlying data structures at the abstraction level of objects. A case study suggests that the counterexample with the diagnoses can help the user to understand the nature of program errors and thus speed up error correction.
3158206
Live updating operating systems using virtualization
Many critical IT infrastructures require non-disruptive operations. However, the operating systems thereon are far from perfect that patches and upgrades are frequently applied, in order to close vulnerabilities, add new features and enhance performance. To mitigate the loss of availability, such operating systems need to provide features such as live update through which patches and upgrades can be applied without having to stop and reboot the operating system. Unfortunately, most current live updating approaches cannot be easily applied to existing operating systems: some are tightly bound to specific design approaches (e.g. object-oriented); others can only be used under particular circumstances (e.g. quiescence states).In this paper, we propose using virtualization to provide the live update capability. The proposed approach allows a broad range of patches and upgrades to be applied at any time without the requirement of a quiescence state. Moreover, such approach shares good portability for its OS-transparency and is suitable for inclusion in general virtualization systems. We present a working prototype, LUCOS, which supports live update capability on Linux running on Xen virtual machine monitor. To demonstrate the applicability of our approach, we use real-life kernel patches from Linux kernel 2.6.10 to Linux kernel 2.6.11, and apply some of those kernel patches on the fly. Performance measurements show that our implementation incurs negligible performance overhead: a less than 1% performance degradation compared to a Xen-Linux. The time to apply a patch is also very minimal.
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
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.