Time-varying volume visualization

Volume rendering is a very active research field in Computer Graphics because of its wide range of applications in various sciences, from medicine to flow mechanics. In this report, we survey a state-of-the-art on time-varying volume rendering. We state several basic concepts and then we establish several criteria to classify the studied works: IVR versus DVR, 4D versus 3D+time, compression techniques, involved architectures, use of parallelism and image-space versus object-space coherence. We also address other related problems as transfer functions and 2D cross-sections computation of time-varying volume data. All the papers reviewed are classified into several tables based on the mentioned classification and, finally, several conclusions are presented.Preprin

DINC: toward distributed in-network computing

In-network computing provides significant performance benefits, load reduction, and power savings. Still, an in-network service’s functionality is strictly limited to a single hardware device. Research has focused on enabling on-device functionality, with limited consideration to distributed in-network computing. This paper explores the applicability of distributed computing to in-network computing. We present DINC, a framework enabling distributed in-network computing, generating deployment strategies, overcoming resource constraints and providing functionality guarantees across a network. It uses multi-objective optimization to provide a deployment strategy, slicing P4 programs accordingly. DINC was evaluated using seven different workloads on both data center and wide-area network topologies, demonstrating feasibility and scalability, providing efficient distribution plans within seconds

N-Ink Printer Characterization with Barycentric Subdivision

Printing with a large number of inks, also called N-ink printing, is a challenging task. The challenges comprise spectral modelling of the printer, color separation, halftoning, and limitations of the amount of inks. Juxtaposed halftoning, a perfectly dot-off-dot halftoning method, has proven to be useful to address some of these challenges. However, for juxtaposed halftones, prediction of colors as a function of ink area-coverages has not yet been fully investigated. The goal of this paper is to introduce a spectral prediction model for N-ink juxtaposed-halftone prints. As the area-coverage domain of juxtaposed inks forms a simplex, we propose a cellular subdivision of the area-coverage domain using barycentric subdivision of simplexes. The barycentric subdivision provides algorithmically straightforward means to design and implement an N-ink color prediction model. Within the subdomain cells, the Yule-Nielsen spectral Neugebauer model is used for the spectral prediction. Our proposed model is highly accurate for prints with a large number of inks while requiring a relatively low number of calibration samples

Diamond-based models for scientific visualization

Hierarchical spatial decompositions are a basic modeling tool in a variety of application domains including scientific visualization, finite element analysis and shape modeling and analysis. A popular class of such approaches is based on the regular simplex bisection operator, which bisects simplices (e.g. line segments, triangles, tetrahedra) along the midpoint of a predetermined edge. Regular simplex bisection produces adaptive simplicial meshes of high geometric quality, while simplifying the extraction of crack-free, or conforming, approximations to the original dataset. Efficient multiresolution representations for such models have been achieved in 2D and 3D by clustering sets of simplices sharing the same bisection edge into structures called diamonds. In this thesis, we introduce several diamond-based approaches for scientific visualization. We first formalize the notion of diamonds in arbitrary dimensions in terms of two related simplicial decompositions of hypercubes. This enables us to enumerate the vertices, simplices, parents and children of a diamond. In particular, we identify the number of simplices involved in conforming updates to be factorial in the dimension and group these into a linear number of subclusters of simplices that are generated simultaneously. The latter form the basis for a compact pointerless representation for conforming meshes generated by regular simplex bisection and for efficiently navigating the topological connectivity of these meshes. Secondly, we introduce the supercube as a high-level primitive on such nested meshes based on the atomic units within the underlying triangulation grid. We propose the use of supercubes to associate information with coherent subsets of the full hierarchy and demonstrate the effectiveness of such a representation for modeling multiresolution terrain and volumetric datasets. Next, we introduce Isodiamond Hierarchies, a general framework for spatial access structures on a hierarchy of diamonds that exploits the implicit hierarchical and geometric relationships of the diamond model. We use an isodiamond hierarchy to encode irregular updates to a multiresolution isosurface or interval volume in terms of regular updates to diamonds. Finally, we consider nested hypercubic meshes, such as quadtrees, octrees and their higher dimensional analogues, through the lens of diamond hierarchies. This allows us to determine the relationships involved in generating balanced hypercubic meshes and to propose a compact pointerless representation of such meshes. We also provide a local diamond-based triangulation algorithm to generate high-quality conforming simplicial meshes

Interactive ray tracing for volume visualization

Journal ArticleWe present a brute-force ray tracing system for interactive volume visualization, The system runs on a conventional (distributed) shared-memory multiprocessor machine. For each pixel we trace a ray through a volume to compute the color for that pixel. Although this method has high intrinsic computational cost, its simplicity and scalability make it ideal for large datasets on current high-end parallel systems

Network Structures, Concurrency, and Interpretability: Lessons from the Development of an AI Enabled Graph Database System

This thesis describes the development of the SmartGraph, an AI enabled graph database. The need for such a system has been independently recognized in the isolated fields of graph databases, graph computing, and computational graph deep learning systems, such as TensorFlow. Though prior works have investigated some relationships between these fields, we believe that the SmartGraph is the first system designed from conception to incorporate the most significant and useful characteristics of each. Examples include the ability to store graph structured data, run analytics natively on this data, and run gradient descent algorithms. It is the synergistic aspects of combining these fields that provide the most novel results presented in this dissertation. Key among them is how the notion of “graph querying” as used in graph databases can be used to solve a problem that has plagued deep learning systems since their inception; rather than attempting to embed graph structured datasets into restrictive vector spaces, we instead allow the deep learning functionality of the system to natively perform graph querying in memory during optimization as a way of interpreting (and learning) the graph. This results in a concept of natural and interpretable processing of graph structured data. Graph computing systems have traditionally used distributed computing across multiple compute nodes (e.g. separate machines connected via Ethernet or internet) to deal with large-scale datasets whilst working sequentially on problems over entire datasets. In this dissertation, we outline a distributed graph computing methodology that facilitates all the above capabilities (even in an environment consisting of a single physical machine) while allowing for a workflow more typical of a graph database than a graph computing system; massive concurrent access allowing for arbitrarily asynchronous execution of queries and analytics across the entire system. Further, we demonstrate how this methodology is key to the artificial intelligence capabilities of the system

3rd Many-core Applications Research Community (MARC) Symposium. (KIT Scientific Reports ; 7598)

This manuscript includes recent scientific work regarding the Intel Single Chip Cloud computer and describes approaches for novel approaches for programming and run-time organization

Optimized NURBS Curve Based G-Code Part Program for CNC Systems

Indiana University-Purdue University Indianapolis (IUPUI)Computer Numerical Control (CNC) is widely used in many industries that needs high speed machining of the parts with high precision, accuracy and good surface finish. In order to avail this the generation of the CNC part program size will be immensely big and leads to an inefficient process, which increases the delivery time and cost of products. This work presents the automation of high-accuracy CNC tool trajectory planning from CAD to G-code generation through optimal NURBs surface approximation. The proposed optimization method finds the minimum number of NURBS control points for a given admissible theoretical cord error between the desired and manufactured surfaces. The result is a compact part program that is less sensitive to data starvation than circular and spline interpolations with potential better surface finish. The proposed approach is demonstrated with the tool path generation of an involute gear profile and a topologically optimized structure is developed using this approach and then finally it is 3D printed

Mathematical Approaches to Modeling, Optimally Designing, and Controlling Electric Machine

Optimal performance of the electric machine/drive system is mandatory to improve the energy consumption and reliability. To achieve this goal, mathematical models of the electric machine/drive system are necessary. Hence, this motivated the editors to instigate the Special Issue “Mathematical Approaches to Modeling, Optimally Designing, and Controlling Electric Machine”, aiming to collect novel publications that push the state-of-the art towards optimal performance for the electric machine/drive system. Seventeen papers have been published in this Special Issue. The published papers focus on several aspects of the electric machine/drive system with respect to the mathematical modelling. Novel optimization methods, control approaches, and comparative analysis for electric drive system based on various electric machines were discussed in the published papers