In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collapse/uncollapse based geometric simplification algorithms ...
详细信息
In this paper we explore the algorithmic space in which stripification, simplification and geometric compression of triangulated 2-manifolds overlap. Edge-collapse/uncollapse based geometric simplification algorithms develop a hierarchy of collapses such that during uncollapse the reverse order has to be maintained. We show that restricting the simplification and refinement operations only to, what we call, the collapsible edges creates hierarchyless simplification in which the operations on one edge can be performed independent of those on another. Although only a restricted set of edges is used for simplification operations, we prove topological results to show that, with minor retriangulation, any triangulated 2-manifold can be reduced to either a single vertex or a single edge using the hierarchyless simplification, resulting in extreme simplification. The set of collapsible edges helps us analyze and relate the similarities between simplification, stripification and geometric compression algorithms. We show that the maximal set of collapsible edges implicitly describes a triangle strip representation of the original model. Further, these strips can be effortlessly maintained on multi-resolution models obtained through any sequence of hierarchyless simplifications on these collapsible edges. Due to natural relationship between stripification and geometric compression, these multi-resolution models can also be efficiently compressed using traditional compression algorithms. We present algorithms to find the maximal set of collapsible edges and to reorganize these edges to get the minimum number of connected components of these edges. An order-independent simplification and refinement of these edges is achieved by our novel data structure and we show the results of our implementation of view-dependent, dynamic, hierarchyless simplification. We maintain a single triangle strip across all multi-resolution models created by the view-dependent simplification process.
The article focuses on distributed rendering environments (DREs) for teaching animation and scientific visualization. Most DREs are deployed in tightly controlled animation production units or national labs where acce...
详细信息
The article focuses on distributed rendering environments (DREs) for teaching animation and scientific visualization. Most DREs are deployed in tightly controlled animation production units or national labs where access is limited to a small group of people. While DREs are well known in the industry, no implementations are currently available for general student access. Furthermore, the challenges of setting up such a system for a large audience of students at colleges and universities are significant. Given this scenario, computer graphics students today have no exposure to real-world problem-solving techniques in rendering and animation development, as that would require access to an infrastructure that is absent in academia. As rendering algorithms are continuously refined to maximize accuracy and clarity of animations and scientific visualizations, the computational resources required to achieve this objective have also increased exponentially. It's impractical for educational institutions to invest valuable dollars in infrastructure that can only be used for rendering. However, most universities support and maintain large computer laboratories that remain unused for a small part of each day. INSET: Background and Rationale..
Link adaptation is a radio resource management technique that selects a transport mode based on the experienced channel conditions. The optimum mode is commonly determined so as to maximise the throughput. Although, t...
详细信息
Link adaptation is a radio resource management technique that selects a transport mode based on the experienced channel conditions. The optimum mode is commonly determined so as to maximise the throughput. Although, this approach is suitable for best-effort services. it is not tailored for real-time services. Presented is anew link adaptation algorithm designed to improve the transmission of delay-sensitive services. The results demonstrate that significant improvements in terms of transmission delay, throughput and operation of link adaptation itself, can be obtained with the proposed scheme.
An optimal set of jobs at oil fields is chosen with an extremal multi-criteria model. An algorithm based oil the universal procedure of finding it sequence of best solutions oil it finite set due to one of the authors...
详细信息
An optimal set of jobs at oil fields is chosen with an extremal multi-criteria model. An algorithm based oil the universal procedure of finding it sequence of best solutions oil it finite set due to one of the authors is applied to choose the set with this model.
Prediction of which peptides can bind major histocompatibility complex (MHC) molecules is commonly used to assist in the identification of T cell epitopes. However, because of the large numbers of different MHC molecu...
详细信息
Prediction of which peptides can bind major histocompatibility complex (MHC) molecules is commonly used to assist in the identification of T cell epitopes. However, because of the large numbers of different MHC molecules of interest, each associated with different predictive tools, tool generation and evaluation can be a very resource intensive task. A methodology commonly used to predict MHC binding affinity is the matrix or linear coefficients method. Herein, we described Average Relative Binding (ARB) matrix methods that directly predict IC50 values allowing combination of searches involving different peptide sizes and alleles into a single global prediction. A computer program was developed to automate the generation and evaluation of ARB predictive tools. Using an in-house MHC binding database, we generated a total of 85 and 13 MHC class I and class II matrices, respectively. Results from the automated evaluation of tool efficiency are presented. We anticipate that this automation framework will be generally applicable to the generation and evaluation of large numbers of MHC predictive methods and tools, and will be of value to centralize and rationalize the process of evaluation of MHC predictions. MHC binding predictions based on ARB matrices were made available at http://***:8080/matrix web server.
We present an efficient digital steganographic technique for three-dimensional (3D) triangle meshes. It is based on a substitutive blind procedure in the spatial domain. The basic idea is to consider every vertex of a...
详细信息
We present an efficient digital steganographic technique for three-dimensional (3D) triangle meshes. It is based on a substitutive blind procedure in the spatial domain. The basic idea is to consider every vertex of a triangle as a message vertex. We propose an efficient data structure and advanced jump strategy to fast assign order to the message vertex. We also provide a Multi-Level Embed Procedure (MLEP), including sliding, extending, and rotating levels, to embed information based on shifting the message vertex by its geometrical property. Experimental results show that the proposed technique is efficient and secure, has high capacity and low distortion, and is robust against affine transformations (which include translation, rotation, scaling, or their combined operations). The technique provides an automatic, reversible method and has proven to be feasible in steganography.
In this paper we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is base...
详细信息
In this paper we present a new method for surface extraction from volume data which preserves sharp features, maintains consistent topology and generates surface adaptively without crack patching. Our approach is based on the marching cubes algorithm, a popular method to convert volumetric data to polygonal meshes. The original marching cubes algorithm suffers from problems of topological inconsistency, cracks in adaptive resolution and inability to preserve sharp features. Most of marching cubes variants only focus on one or some of these problems. Although these techniques could be combined to solve these problems altogether such a combination might not be straightforward. Moreover, some feature-p reserving variants introduce an additional problem, inter-cell dependency. Our method provides a relatively simple and easy-to-implement solution to all these problems by converting 3D marching cubes into 2D cubical marching squares, resolving topology ambiguity with sharp features and eliminating inter-cell dependency by sampling face sharp features. We compare our algorithm with other marching cubes variants and demonstrate its effectiveness on various applications.
Computational methods on molecular sequence data are at the heart of computational molecular biology. Identification of known or unknown DNA and RNA motifs or regions involved in various biological processes such as i...
详细信息
Computational methods on molecular sequence data are at the heart of computational molecular biology. Identification of known or unknown DNA and RNA motifs or regions involved in various biological processes such as initiation of transcription, gene expression and translation, or the discovery of various types of repeats are some of the applications of major concern. An accurate identification and localization of such elements will allow biologists to perform deeper studies of the structure, function and evolution of genomes. This requires the development of faster and more complex mathematical models and computer algorithms. In this work we discuss current techniques to cope with string problems in molecular sequence data. We focus on Weighted Sequences and Sequences with "don't care characters", explaining the open problems and their relevance to biological applications.
Bioinformatics is playing an increasingly important role in nearly all aspects of drug discovery, drug assessment, and drug development. This growing importance lies not only in the role that bioinformatics plays in h...
详细信息
Bioinformatics is playing an increasingly important role in nearly all aspects of drug discovery, drug assessment, and drug development. This growing importance lies not only in the role that bioinformatics plays in handling large volumes of data, but also in the utility of bioinformatics tools to predict, analyze, or help interpret clinical and preclinical findings. This review focuses on describing and evaluating some of the newer or more important bioinformatics resources ( i. e., databases and software) that are of growing importance to understanding or predicting drug metabolism, especially with respect to the absorption, distribution, metabolism, excretion, ( ADME), and toxicity ( T) of both existing drugs and potential drug leads. Detailed descriptions and critical assessments of a number of potentially useful bioinformatics/ cheminformatics databases and predictive ADMET software tools are provided. Additionally, several pharmaceutically important applications of both the databases and software are highlighted. Given the rapid growth in this area and the rapid changes that are taking place, a special emphasis is placed on freely available or Web- accessible resources.
The bit-rate control algorithm for video sequence encoding with Region Of Interest (ROI) is presented in this paper The algorithm distributes available bit budget among image layers taking into consideration both the ...
详细信息
ISBN:
(纸本)0780393856
The bit-rate control algorithm for video sequence encoding with Region Of Interest (ROI) is presented in this paper The algorithm distributes available bit budget among image layers taking into consideration both the distance from ROI and the local complexity. It improves the image quality, in ROI by lowering the image quality, outside ROI with the preservation of the global constraint of the encoded stream bit-rate. The algorithm also ensures the gradual image quality degradation outside ROI.
暂无评论