Interactive Ray Tracing of Large Models Using Voxel Hierarchies

We propose an efficient approach for interactive visualization of massive models with CPU ray tracing. A voxel‐based hierarchical level‐of‐detail (LOD) framework is employed to minimize rendering time and required system memory. In a pre‐processing phase, a compressed out‐of‐core data structure is constructed, which contains the original primitives of the model and the LOD voxels, organized into a kd‐tree. During rendering, data is loaded asynchronously to ensure a smooth inspection of the model regardless of the available I/O bandwidth. With our technique, we are able to explore data sets consisting of hundreds of millions of triangles in real‐time on a desktop PC with a quad‐core CPU.     

A trace metamodel proposal based on the model driven architecture framework for the traceability of user requirements in data warehouses

The complexity of the data warehouse (DW) development process requires to follow a methodological approach in order to be successful. A widely accepted approach for this development is the hybrid one, in which requirements and data sources must be accommodated to a new DW model. The main problem is that we lose the relationships between requirements, elements in the multidimensional (MD) conceptual models and data sources in the process, since no traceability is explicitly specified. Therefore, this hurts requirements validation capability and increases the complexity of Extraction, Transformation and Loading processes. In this paper, we propose a novel trace metamodel for DWs and focus on the relationships between requirements and MD conceptual models. We propose a set of Query/View/Transformation rules to include traceability in DWs in an automatic way, allowing us to obtain a MD conceptual model of the DW, as well as a trace model. Therefore, we are able to trace every requirement to the MD elements, further increasing user satisfaction. Finally, we show the implementation in our Lucentia BI tool.     

Dynamic-CoMPI: dynamic optimization techniques for MPI parallel applications

This work presents an optimization of MPI communications, called Dynamic-CoMPI, which uses two techniques in order to reduce the impact of communications and non-contiguous I/O requests in parallel applications. These techniques are independent of the application and complementaries to each other. The first technique is an optimization of the Two-Phase collective I/O technique from ROMIO, called Locality aware strategy for Two-Phase I/O (LA-Two-Phase I/O). In order to increase the locality of the file accesses, LA-Two-Phase I/O employs the Linear Assignment Problem (LAP) for finding an optimal I/O data communication schedule. The main purpose of this technique is the reduction of the number of communications involved in the I/O collective operation. The second technique, called Adaptive-CoMPI, is based on run-time compression of MPI messages exchanged by applications. Both techniques can be applied on every application, because both of them are transparent for the users. Dynamic-CoMPI has been validated by using several MPI benchmarks and real HPC applications. The results show that, for many of the considered scenarios, important reductions in the execution time are achieved by reducing the size and the number of the messages. Additional benefits of our approach are the reduction of the total communication time and the network contention, thus enhancing, not only performance, but also scalability.     

Using Chebyshev Polynomials to Approximate Partial Differential Equations: A Reply

Caporale and Cerrato (Comput Econ 35(3):235–244, 2010) propose a simple method based on Chebyshev approximation and Chebyshev nodes to approximate partial differential equations (PDEs). However, they suggest not to use Chebyshev nodes when dealing with optimal stopping problems. Here, we use the same optimal stopping example to show that Chebyshev polynomials and Chebyshev nodes can still be successfully used together if we solve the model in a matrix environment.     

An optimum design selection approach for product customization development

Consumer preferences and information on product choice behavior can be of significant value in the development processes of innovative products. In this paper, product customization evaluation and selection model is introduced to support imprecision inherent of qualitative inputs from customers and designers in the decision making process. Focusing on customer utility generation, an optimum design selection approach based on fuzzy set decision-making is proposed, where design attributes priority is identified from customer preferences using an analytical hierarchy process. A multi-attribute analysis diagram is developed to visualize the preference of each attribute from the expert’s group decision. Conjoint analysis is used in the product customization to focus on customer utility generation in terms of multiple criteria. The use of the decision-making method is illustrated with a case example that highlights the utility of the proposed method.     

An efficient model for studying the dynamics of frustrated systems

We present a model based on determinist cellular automata architecture for studying systems with frustrated interactions that present elemental excitations, such as magnetic monopoles. This model is especially designed to be applied for systems with components that have energy levels much higher than $kT$. This would imply that for these systems thermal fluctuations are negligible and they can be analyzed under the supposition that the dynamic is produced at zero temperature. This category includes artificial magnetic spin ice systems and donor and recipient electrical charge molecular systems. The dynamics of these systems can be simulated in real time with this model, with a minimum of computational requirements. It can be an excellent complement to Monte Carlo methods and in some cases can even replace them directly. In this report, we show the designed structure and some interesting results obtained in studying the dynamics of emergent magnetic monopoles in artificial spin ice systems and excitations in graphane molecular arrays.     

TangiWheel: A Widget for Manipulating Collections on Tabletop Displays Supporting Hybrid Input Modality

In this paper we present TangiWheel,a collection manipulation widget for tabletop displays.Our implementation is flexible,allowing either multi-touch or interaction,or even a hybrid scheme to better suit user choice and convenience.Different TangiWheel aspects and features are compared with other existing widgets for collection manipulation.The study reveals that TangiWheel is the first proposal to support a hybrid input modality with large resemblance levels between touch and tangible interaction styles.Several experiments were conducted to evaluate the techniques used in each input scheme for a better understanding of tangible surface interfaces in complex tasks performed by a single user (e.g.,involving a typical master-slave exploration pattern).The results show that tangibles perform significantly better than fingers,despite dealing with a greater number of interactions,in situations that require a large number of acquisitions and basic manipulation tasks such as establishing location and orientation.However,when users have to perform multiple exploration and selection operations that do not require previous basic manipulation tasks,for instance when collections are fixed in the interface layout,touch input is significantly better in terms of required time and number of actions.Finally,when a more elastic collection layout or more complex additional insertion or displacement operations are needed,the hybrid and tangible approaches clearly outperform finger-based interactions.     

On the differential benchmarking of promotional efficiency with machine learning modelling (II): Practical applications

The assessment of promotional sales with models constructed by machine learning techniques is arousing interest due, among other reasons, to the current economic situation leading to a more complex environment of simultaneous and concurrent promotional activities. An operative model diagnosis procedure was previously proposed in the companion paper, which can be readily used both for agile decision making on the architecture and implementation details of the machine learning algorithms, and for differential benchmarking among models. In this paper, a detailed example of model analysis is presented for two representative databases with different promotional behaviour, namely, a non-seasonal category (milk) and a heavily seasonal category (beer). The performance of four well-known machine learning techniques with increasing complexity is analyzed in detail here. In particular, k-Nearest Neighbours, General Regression Neural Networks, Multilayer Perceptron (MLP), and Support Vector Machines (SVM), are differentially compared. Present paper evaluates these techniques along the experiments described for both categories when applying the methodological findings obtained in the companion paper. We conclude that some elements included in the architecture are not essential for a good performance of the machine learning promotional models, such as the semiparametric nature of the kernel in SVM models, whereas other can be strongly dependent of the database, such as the convenience of multiple output models in MLP regression schemes. Additionally, the specificity of the behaviour of certain categories and product ranges determines the need to establish suitable and specific procedures for a better prediction and feature extraction.     

Stress recovery in geometrically nonlinear membranes by a Hu-Washizu finite element formulation

A class of mixed finite elements based on the Hu-Washizu functional is introduced as a strategy to reduce the spurious stress phenomena encountered with standard or displacement-based formulations for geometrically exact membranes. Selected examples compare the performance of this class of elements with that of the standard formulation and demonstrate that reduction of spurious stresses is obtained and that the stresses are more accurate than those optimally sampled in the standard formulation.