6534333
A new paradigm for changing topology during subdivision modeling
The authors present a paradigm that allows dynamic changing of the topology of 2-manifold polygonal meshes. Our paradigm always guarantees topological consistency of polygonal meshes. Based on our paradigm, by simply adding and deleting edges, handles can be created and deleted, holes can be opened or closed, polygonal meshes can be connected or disconnected. These edge insertion and edge deletion operations are highly consistent with subdivision algorithms. In particular, these operations can be easily included into a subdivision modeling system such that the topological changes and subdivision operations can be performed alternatively during model construction. We demonstrate practical examples of topology changes based on this new paradigm and show that the new paradigm is convenient, effective, efficient, and friendly to subdivision surfaces.
16331940
Optimal Parallel Routing in Star Networks
Star networks have recently been proposed as attractive alternatives to the popular hypercube for interconnecting processors on a parallel computer. In this paper, we present an efficient algorithm that constructs an optimal parallel routing in star networks. Our result improves previous results for the problem.
2261180
Graph Ear Decompositions and Graph Embeddings
Ear decomposition of a graph has been extensively studied in relation to graph connectivity. In this paper, a connection of ear decomposition to graph embeddings is exhibited. It is shown that constructing a maximum-paired ear decomposition of a graph and constructing a maximum-genus embedding of the graph are polynomial-time equivalent. Applications of this connection are discussed.
31382426
Strong Fault-Tolerance: Parallel Routing in Networks with Faults
A d-regular network G is strongly fault-tolerant if for any copy Gf of G with at most d - 2 faulty nodes, every pair of nonfaulty nodes u and v in Gf admits min{df(u), df (v)} node-disjoint paths in Gf from u to v, where df(u) and df(v) are the degrees of the nodes u and v in Gf. We show that popular network structures, such as hypercube and star networks, are strongly fault-tolerant. We develop efficient algorithms that construct the maximum number of node-disjoint paths of optimal or nearly optimal length in these networks with faulty nodes. Our algorithms are optimal in terms of their running time.
1021255
A minimal and complete set of operators for the development of robust manifold mesh modelers
In this paper, we identify a minimal and complete set of fundamental operators, which is necessary and sufficient for performing all homeomorphic and topological operations on 2- manifold mesh structures. Efficient algorithms are developed for the implementation of these operators. We also developed a set of powerful, user-friendly, and effective operators at the level of user-interface. Using these operators, we have developed a prototype system for robust, interactive, and user-friendly modeling of orientable 2-manifold meshes. Users of our system can perform a large set of homeomorphic and topological changes with these user-interface level operators. Our system is topologically robust in the sense that users will never create invalid 2-manifold mesh structure with these operators. In our system, the homeomorphic and topological surgery operations can be applied alternatively on 2-manifold meshes. With our system, users can blend surfaces, construct rinds, and open holes on these rind shapes. With our system, the shapes that look like solid, non-manifold, or 2-manifold with boundary can be manipulated. The system also provides automatic texture mapping during topology changes.
5242879
Interactive rind modeling
In this paper, we describe a technique, with roots in topological graph theory, that we call rind modeling. It provides for the easy creation of surfaces resembling peeled and punctured rinds. We show how the method's two main steps of: 1) creation of a shell or crust like the rind of an orange, and 2) opening holes in the crust by punching or peeling can be encapsulated into a real time semi-automatic interactive algorithm. We include a number of worked examples, some by students in a first modeling course, that demonstrate the ease with which a large variety of intricate rind shapes can be created.
7673579
Managing personal and group collections of information
The internet revolution has dramatically increased the amount of information available to users. Various tools such as search engines have been developed to help users find the information they need from this vast repository. Users often also need tools to help manipulate the growing amount of useful information they have discovered. Current tools available for this purpose are typically local components of web browsers designed to manage URL bookmarks. They provide limited functionalities to handle high information complexities.
14782466
Similar_Join: extending DBMS with a bio-specific operator
Existing sequence comparison software applications lack adequate automation, abstraction, performance, and flexibility. Users need a new way of studying and applying sequence comparisons in the post-genomics era. We invented and developed a new bio-specific Database Management System (DBMS) operator, Similar_Join, to abstract the labor-intensive batch sequence similarity search task into a syntactically concise database operation. We implemented the Similar_Join operator as part of a relational operator package. This implementation enabled us to write simple PL/SQL scripts within the DBMS to accomplish routine sequence similarity searches conveniently, for example, a "batch BLAST" that compares 7,000 human genes against 500,000 human Expressed Sequence Tags (EST) in a few hours. We also implemented a simple version of Similar_Join as a database operator in the extended data cartridge of Oracle 8i object-relational DBMS. When fully integrated into SQL language extensions, we demonstrated this operator could enable biology users to achieve interesting complex biological queries previously impossible inside the DBMS.
2913360
Dynamic verification of temporal constraints on-the-fly for workflow systems
Temporal verification is an important method to check the temporal correctness of workflow management systems (WfMSs). However, the current temporal verification is relatively independent of the workflow system environments. It does not pay sufficient attention to the interrelationship between the temporal verification at different stages, the mutual dependency between some temporal constraints, and the run-time checkpoint selection strategy, which hence hinders the incorporation and consistency between the temporal verification and the workflow system environments. In this paper, we effectively integrate the temporal verification at different stages and explore the dependency between some temporal constraints. In addition, we present a new effective runtime checkpoint selection strategy which dynamically selects appropriate checkpoints based on the activity completion duration. Furthermore, based on these analyses, we develop some new methods for more efficient temporal verification. These analyses and new methods help to eliminate the gap between the temporal verification and the workflow system environments.
16407407
An interactive method for fuzzy multiple attribute group decision making
In this paper, we develop an interactive method for multiple attribute group decision making under fuzzy environment. The method can be used in situations where the information about attribute weights is partly known, the weights of decision makers are expressed in exact numerical values or triangular fuzzy numbers, and the attribute values are triangular fuzzy numbers. The method transforms fuzzy decision matrices into their expected decision matrices, constructs the corresponding normalized expected decision matrices by two simple formulas, and then aggregates these normalized expected decision matrices into a complex decision matrix. Moreover, the decision makers are asked to provide their preferences gradually in the course of interactions. By solving linear programming models, the method diminishes the given alternative set gradually, and finally finds the most preferred alternative. By using the method, the decision makers can provide and modify their preference information gradually in the process of decision making so as to make the decision result more reasonable. The method can not only reflect the importance of the given arguments and the ordered positions of the arguments, but also relieve the influence of unfair arguments on the decision result. Finally, a practical problem is used to illustrate the developed method.
12151643
Discretization Approach and Nonparametric Modeling for Long-Term HIV Dynamic Model
Modeling viral load response in long-term HIV dynamics is important for AIDS clinical study. It allows one to examine how a patient recuperates for an antiviral treatment. This paper investigates a discretization approach to the viral load based on a long-term HIV dynamic model. We propose a two-stage nonparametric procedure for estimating the viral load and the time-varying new productive virus. Simulation study shows that the proposed estimated methods are efficient and powerful for fitting long-term viral load measurements.