Filtyp
Computer generated imagery is used in a wide range of disciplines, each with different requirements. As an example, real-time applications such as computer games have completely different restrictions and demands than offline rendering of feature films. A game has to render quickly using only limited resources, yet present visually adequate images. Film and visual effects rendering may not have st
Hierarchical depth culling is an important optimization, which is present in all modern high performance graphics processors. We present a novel culling algorithm based on a layered depth representation, with a per-sample mask indicating which layer each sample belongs to. Our algorithm is feed forward in nature in contrast to previous work, which rely on a delayed feedback loop. It is simple to i
From a control design point of view, modern diesel engines are dynamic, nonlinear, MIMO systems. This paper presents a method to find low-complexity black-box dynamic models suitable for model predictive control (MPC) of NOx and soot emissions based on on-line emissions measurements. A four-input-five-output representation of the engine is considered, with fuel injection timing, fuel injection dur
The aim of this study was to find models for turbulent fragmenting forces in the high-pressure homogeniser from data available in Computational Fluid Dynamics (CFD) simulations with Reynolds Averaged Navier Stokes (RANS) turbulence models. In addition to the more common RANS k-epsilon turbulence models, a Multi-scale k-epsilon model was tested since experimental investigations of the geometry impl
NURBS (Non-uniform rational B-splines) surfaces are one of the most useful primitives employed for high quality modeling in CAD/CAM tools and graphics software. Since direct evaluation of NURBS surfaces on the GPU is a highly complex task, the usual approach for rendering NURBS is to perform the conversion into Bezier surfaces on the CPU, and then evaluate and tessellate them on the GPU. In this p
We present two novel culling tests for rasterization of simultaneous depth of field and motion blur. These tests efficiently reduce the set of xyuvt samples that need to be coverage tested within a screen space tile. The first test finds linear bounds in ut - and vt -space using a separating line algorithm. We also derive a hyperplane in xyuvt - space for each triangle edge, and all samples outside
This paper presents the elaboration of an experimentally validated model of a continuous cross-flow atomic layer deposition (ALD) reactor with temporally separated precursor pulsing encoded in the Modelica language. For the experimental validation of the model, in situ quartz crystal microbalance (QCM) diagnostics was used to yield submonolayer resolution of mass deposition resulting from thin fil
Partitioning and mapping are important design decisions in exploiting the parallelism of programs that are to be run on systems with multiple processing elements. In this paper we introduce a fast, incremental approach for mapping dynamic dataflow programs to multiprocessor systems. We use causation traces and architecture descriptions as input for the mapping process that devises several heuristi
High performance requirements increased the popularity of unconventional architectures. While providing better performance, such architectures are generally harder to program and generate code for. In this paper, we present our approach to ease programmability and code generation for such architectures. We present a domain specific language (DSL) for the programming part, and a constraint programm
Random-walk and diffusion models for two-choice comparison of paired successive or simultaneous stimuli focus on response time (RT), modeled as the time needed to reach one or the other barrier, and its relation to the response probabilities. Logit P1 = ln[P1/(1-P1)], where P1 is the probability of responding ”first greater,” can be seen as a measure of subjective stimulus difference, d. Signed re
We present a hierarchical traversal algorithm for stochastic rasterization of motion blur, which efficiently reduces the number of inside tests needed to resolve spatio-temporal visibility. Our method is based on novel tile against moving primitive tests that also provide temporal bounds for the overlap. The algorithm works entirely in homogeneous coordinates, supports MSAA, facilitates efficient
This paper assumes the availability of a very fast higher-dimensional rasterizer in future graphics processors. Working in up to five dimensions, i.e., adding time and lens parameters, it is well-known that this can be used to render scenes with both motion blur and depth of field. Our hypothesis is that such a rasterizer can also be used as a flexible tool for other, less conventional, usage area
Many combinatorial optimization problems lend themselves to be modeled as distributed constraint optimization problems (DisCOP). Problems such as job shop scheduling have an intuitive matching between agents and machines. In distributed constraint problems, agents control variables and are connected via constraints. We have equipped these agents with a full constraint solver. This makes it possibl
Embedded DSP computing is currently shifting towards manycore architectures in order to cope with the ever growing computational demands. Actor based dataflow languages are being considered as a programming model. In this paper we present a code generator for CAL, one such dataflow language. We propose to use a compilation tool with two intermediate representations. We start from a machine model o
As custom architectures become more and more common for DSP applications, instruction selection and scheduling for such applications and architectures become important topics. In this paper, we explore the effects of defining the problem of finding an optimal instruction selection and scheduling as a constraint satisfaction problem (CSP). We incorporate methods based on sub-graph isomorphism and g
Traditional efforts in standardizing video coding used to involve a lengthy process that resulted in large monolithic standards and reference codes. This approach has become increasingly ill-suited to the dynamics and the fast changing needs of the video coding community. Most importantly, there used to be no principled approach to leveraging the significant commonalities between the different cod
A major challenge when designing general purpose graphics hardware is to allow efficient access to texture data. Although different rendering paradigms vary with respect to their data access patterns, there is no flexibility when it comes to data caching provided by the graphics architecture. In this paper we focus on volume ray-casting, and show the benefits of algorithm-aware data caching. Our M
Objective This study provides the summary of current knowledge about migrant work in agriculture available from journal articles, books, reports and other relevant academic publications, focusing on political, economic, legal, social and medical aspects of migrant work in agriculture. Methods A systematic search was carried out on the LibHub and Google Scholar databases in order to compile the e
This paper addresses design space exploration for streaming applications (such as MPEG) running on multi-processor platforms with guaranteed service interconnects. In particular, we solve mapping, path selection and router configuration problems. Given the complexity of these problems, state of the art approaches in this area largely rely on greedy heuristics, which do not guarantee optimality. Ou
