15905801
Handle and hole improvement by using new corner cutting subdivision scheme with tension
The Doubly Linked Face List (DLFL) structure introduces a powerful modeling paradigm that allows users to alternatively apply topological change operations and subdivision operations on a mesh structure. Moreover the DLFL is topologically robust in the sense that it always guarantees valid 2-manifold surfaces. We further study the relationship between DLFL structure and subdivision algorithms. First, we develop a new corner cutting scheme, which provides a tension parameter to control the shape of the subdivided surface. Second, we develop a careful and efficient algorithm for our corner cutting scheme on the DLFL structure that uses only the basic operations provided by the DLFL structure. This implementation ensures that our new corner cutting scheme preserves topological robustness. The comparative study shows that the corner cutting schemes create better handles and holes than Catmull-Clark (1978) scheme.
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.
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.
12533129
Procrastination for leakage-aware rate-monotonic scheduling on a dynamic voltage scaling processor
As the dynamic voltage scaling (DVS) technique provides system engineers the flexibility to trade-off the performance and the energy consumption, DVS has been adopted in many computing systems. However, the longer a job executes, the more energy in the leakage current the device/processor consumes for the job. To reduce the energy consumption resulting from the leakage current, a system might enter the dormant mode. This paper targets energy-efficient rate-monotonic scheduling for periodic real-time tasks on a uniprocessor DVS system with non-negligible leakage power consumption. An on-line simulated scheduling strategy and a virtually blocking time strategy are developed for procrastination scheduling to reduce energy consumption. The proposed algorithms derive a feasible schedule for real-time tasks with worst-case guarantees for any input instance. Experimental results show that our proposed algorithms could derive energy-efficient solutions.
18194069
Avoiding Local Optima in Single Particle Reconstruction
In single-particle reconstruction, a 3D structure is reconstructed from a large number of randomly oriented 2D projections, using techniques related to computed tomography. Unlike in computed tomography, however, the orientations of the projections must be estimated at the same time as the 3D structure, and hence the reconstruction process can be error-prone, converging to an incorrect local optimum rather than the true 3D structure. In this paper, we discuss and further develop a maximum-likelihood approach to reconstruction, and demonstrate that this approach can help avoid incorrect local optima for both 2D and 3D reconstructions.
26236484
A new object-oriented method integrating Jackson structured programming method
Abstract This article presents a new object-oriented method which integrates the Jackson Structured Programming method with an object-oriented approach. The new method analyzes the user's services, identifies attributes from data structure diagrams, and identifies operations from program structure diagrams. Also, this method defers the identification of class relationships until the attributes and operations have been identified, so as to prevent premature decisions. In addition, the concept of “leading object” is used to decrease the number of actors and agents and to increase the number of servers in a system. This may enhance reusability of the objects.
17157033
On The Damage and Compensation of Privacy Leakage
A query on the distribution of a sensitive field within a selected population in a database can be submitted to the data center, and the answer to this query can leak private information, even though no identification information is provided. Inspired by decision theory, we present a quantitative model of the privacy protection problem in such a database query environment. In our model, the user information states are defined as classes of probability distributions on the set of possible confidential values. These states can be modified and refined by knowledge acquisition actions. The data confidentiality is guaranteed by ensuring that misusing private information is more costly than any possible gain.
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.