Camera Control in Computer Graphics

Recent progress in modelling, animation and rendering means that rich, high fidelity virtual worlds are found in many interactive graphics applications. However, the viewer's experience of a 3D world is dependent on the nature of the virtual cinematography, in particular, the camera position, orientation and motion in relation to the elements of the scene and the action. Camera control encompasses viewpoint computation, motion planning and editing. We present a range of computer graphics applications and draw on insights from cinematographic practice in identifying their different requirements with regard to camera control. The nature of the camera control problem varies depending on these requirements, which range from augmented manual control (semi‐automatic) in interactive applications, to fully automated approaches. We review the full range of solution techniques from constraint‐based to optimization‐based approaches, and conclude with an examination of occlusion management and expressiveness in the context of declarative approaches to camera control.     

A review of smart homes- present state and future challenges

In the era of information technology, the elderly and disabled can be monitored with numerous intelligent devices. Sensors can be implanted into their home for continuous mobility assistance and non-obtrusive disease prevention. Modern sensor-embedded houses, or smart houses, cannot only assist people with reduced physical functions but help resolve the social isolation they face. They are capable of providing assistance without limiting or disturbing the resident's daily routine, giving him or her greater comfort, pleasure, and well-being. This article presents an international selection of leading smart home projects, as well as the associated technologies of wearable/implantable monitoring systems and assistive robotics. The latter are often designed as components of the larger smart home environment. The paper will conclude by discussing future challenges of the domain.     

MatSeek: An Ontology-Based Federated Search Interface for Materials Scientists

The MatSeek system is an ontology-based federated search interface to key materials science databases and analytical tools. By combining Semantic Web and Web 2.0 technologies, MatSeek provides materials scientists with a single Web interface that enables them to search across disparate databases containing crystal-structure data, ionic-conductivity data, and phase stability data; render 3D crystal-structure images; calculate bond lengths and angles; retrieve relevant scholarly references; and identify potential new materials with the structure and properties required to satisfy specific applications. The MatOnto ontology underlying MatSeek enables integration of data across disparate databases, and Web 2.0 technologies enable iterative searching across the databases. The results retrieved from searching the previous database are used as input to the query on the next database. By providing materials scientists with a single, integrated Web interface to the critical materials science databases and analytical tools, MatSeek represents a significant advance toward a full-fledged materials-informatics workbench.     

The influence of temperature and grain size on substructure evolution in stainless steel 316L

The flow stress of polycrystals is controlled by the processes occurring in the grain interior as well as in the mantle, i.e. at the grain boundary and its immediate vicinity. The early stages of evolution of dislocation substructure in these two regions with strain in 316L stainless steel polycrystals have been studied at 293 K, 673 K and 1123 K representing the low temperature thermal, the intermediate temperature athermal and the high temperature thermal regimes respectively. Specimens with grain sizes of 4 and 12 m were employed to determine the effect of grain size.Transmission electron microscopy studies on deformed specimens show the different roles of grain boundary and grain interior in different temperature regimes. In the low temperature regime grain boundaries act as obstacles to moving dislocations and as such high density of dislocation is found in the grain boundary vicinity. In the intermediate temperature regime the dislocations which are easily spread into the grain interior rearrange to form cell walls. In the high temperature regime grain boundaries transform to the equilibrium state and do not contain any grain boundary dislocations, and the distribution of dislocations within grains is homogeneous at all strains. Significantly higher values of dislocation densities in the vicinity as well as in the grain interior were found in the finer grain size material in the whole strain region employed.     

Non-Hierarchical Architected Materials with Extreme Stiffness and Strength

Stretch-dominated truss and plate microstructures are contenders in the quest for realizing architected materials with extreme stiffness and strength. In the low volume fraction limit, closed-cell isotropic plate microstructures meet theoretical upper bounds on stiffness but have low buckling strength, whereas open-cell truss microstructures have high buckling strength at the cost of significantly reduced stiffness. At finite volume fractions, the picture becomes less clear but both are outperformed by hollow truss lattice and hierarchical microstructures in terms of buckling strength. Despite significant advances in manufacturing methods, hollow and multi-scale hierarchical microstructures are still challenging to build. The question is if there exist realizable microstructures providing stiffness and strength matching or even beating hard-to-realize hollow or hierarchical microstructures? Herein, single-scale non-hierarchical (first order) microstructures that beat the buckling strength of hollow truss lattice structures by a factor of 2.4 and first- and second-order plate microstructures by factors of 5 and 1.4, respectively, are systematically designed, built, and tested. Stiffness of the microstructures is within 40% of theoretical bounds and beats both truss and second order plate microstructures. The microstructures are realized with 3D printing. Experiments validate theoretical predictions and additional insight is provided through numerical modeling of a CT-scanned sample.     

Polite Combination of Algebraic Datatypes

Journal of Automated Reasoning - Algebraic datatypes, and among them lists and trees, have attracted a lot of interest in automated reasoning and Satisfiability Modulo Theories (SMT). Since its...     

Maskless writing of microfluidics: Rapid prototyping of 3D microfluidics using scratch on a polymer substrate

We present a new rapid prototyping method designed for simple fabrication of 3D microfluidics using a maskless direct writing technique on polymer substrates. The entire process is enabled by a commercial cutter plotter with 10 μm resolution precision and high speed. A CAD design of top and bottom microstructures is directly written on a polymer substrate using a cutter plotter after setting up the suitable force. The smallest channel width of 20 μm was obtained with the minimum force and 100 μm from the maximum. Also the written depth increased linearly with force from 30 to 130 μm. Several 3D microfluidic devices are demonstrated using a maskless writing technique. The entire fabrication process from CAD layout to a final 3D device can be completed in 30 min outside the clean room facilities.     

Bio-PEPA: A framework for the modelling and analysis of biological systems

In this work we present Bio-PEPA, a process algebra for the modelling and the analysis of biochemical networks. It is a modification of PEPA, originally defined for the performance analysis of computer systems, in order to handle some features of biological models, such as stoichiometry and the use of general kinetic laws. Bio-PEPA may be seen as an intermediate, formal, compositional representation of biological systems, on which different kinds of analyses can be carried out. Bio-PEPA is enriched with some notions of equivalence. Specifically, the isomorphism and strong bisimulation for PEPA have been considered and extended to our language. Finally, we show the translation of a biological model into the new language and we report some analysis results.     

Adapting application execution in CMPs using helper threads

In parallel to the changes in both the architecture domain–the move toward chip multiprocessors (CMPs)–and the application domain–the move toward increasingly data-intensive workloads–issues such as performance, energy efficiency and CPU availability are becoming increasingly critical. The CPU availability can change dynamically due to several reasons such as thermal overload, increase in transient errors, or operating system scheduling. An important question in this context is how to adapt, in a CMP, the execution of a given application to CPU availability change at runtime. Our paper studies this problem, targeting the energy-delay product (EDP) as the main metric to optimize. We first discuss that, in adapting the application execution to the varying CPU availability, one needs to consider the number of CPUs to use, the number of application threads to accommodate and the voltage/frequency levels to employ (if the CMP has this capability). We then propose to use helper threads to adapt the application execution to CPU availability change in general with the goal of minimizing the EDP. The helper thread runs parallel to the application execution threads and tries to determine the ideal number of CPUs, threads and voltage/frequency levels to employ at any given point in execution. We illustrate this idea using four applications (Fast Fourier Transform, MultiGrid, LU decomposition and Conjugate Gradient) under different execution scenarios. The results collected through our experiments are very promising and indicate that significant EDP reductions are possible using helper threads. For example, we achieved up to 66.3%, 83.3%, 91.2%, and 94.2% savings in EDP when adjusting all the parameters properly in applications FFT, MG, LU, and CG, respectively. We also discuss how our approach can be extended to address multi-programmed workloads.     

The other side of ranking schemes: generating weights for specified outcomes

This paper treats the problem of how to determine weights in a ranking, which will cause a selected entity to attain the highest possible position. We establish that there are two types of entities in a ranking scheme: those which can be ranked as number one and those which cannot. These two types of entities can be identified using the “ranking hull” of the data; a polyhedral set that envelops the data. Only entities with data points on the boundary of this hull can attain the number one position. There are no weights that will make an entity whose data point is in the interior of the hull to ever attain the number one position. We deal with these two types of entities separately. In the first case, we propose an approach for finding a set of weights that, under special conditions, will result in a selected entity achieving the top of the ranking without ties and without ignoring any of the attributes. For the second category of entities, we devise a procedure to guarantee that these entities will attain their highest possible position in the ranking. The first case will require using interior point methods to solve a linear program (LP). The second case involves a binary mixed integer formulation. These two mathematical programs were tested on data from a well‐known university ranking.