- Full text PDF available (4)
- This year (0)
- Last 5 years (0)
- Last 10 years (0)
Journals and Conferences
A stable matching for an instance of the stable marriages problem or the stable roommates problem is bistable if it is also a stable matching when the ordering of the input preference lists is reversed. For the stable marriages problem, it is shown that the bistable matchings are a sublattice of the distributive lattice of stable matchings. In addition, the… (More)
Ordered linked lists are introduced in data structures courses and are frequently encountered in the study of algorithms. Set operations (e.g. union, intersection) on sets of real intervals provide a non-trivial exercise in developing correct algorithms for manipulating lists.
The n-grid model for group authorization and access control extends the NTree representation of twodimensional partial orders and incorporates the implicit authorizations of the MCC model. The n-grid is a representation of multi-dimensional partial orders, permitting the inclusion of relationships among user (subject) groups, object groups, and access-right… (More)
Patients with chronic obstructive pulmonary disease must understand and accept their responsibilities to obtain the benefits of a comprehensive home care program.
Graphs representing interconnection networks are often drawn without considering inherent symmetry and bisection properties. By using the nauty package for analyzing a graph for automorphisms, vertices are then displayed in AT&T’s NEATO package to make topologically-equivalent vertices obvious. Edges are similarly colored based on the METIS package’s… (More)
In the original N-grid model for group authorization, subject groups, object groups, and access right groups are organized in partial orders based on the semantics of authorizations. The n-dimension grid encoding using the dimension theory of partial orders allows top-down incremental change of partial orders without changing their encoded representations.… (More)
We have previously developed several algorithms which deal with different input sequence scenarios respectively. In this paper, another sequential algorithm for computing Longest Common Increasing Subsequence for two random input sequences is reported. It runs in O(m n log p) time complexity and takes space of O(2(m + n + 1) p), where m and n are the length… (More)