Sökresultat

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

For triangles with linear vertex motion, common practice is to backface cull a triangle if it is backfacing at both the start and end of the motion. However, this is not conservative. We derive conservative tests that guarantee that a moving triangle is backfacing over an entire time interval and over the area of a lens. In addition, we present tests for the special cases of only motion blur and o

The effect of disperse phase volume fraction on the turbulence in a scale model of a high-pressure homogenizer was studied experimentally. Velocity fields of the continuous phase were measured using particle image velocimetry. Refractive index matching combined with digital filtering enabled measurement with disperse phase present. Geometry and physical properties were carefully scaled in order to

Abstract As custom multicore 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-grap

For depth of field (DOF) rasterization, it is often desired to have an efficient tile versus triangle test, which can conservatively compute which samples on the lens that need to execute the sample-in-triangle test. We present a novel test for this, which is optimal in the sense that the region on the lens cannot be further reduced. Our test is based on removing half-space regions of the (u, v) -

Light field reconstruction algorithms can substantially decrease the noise in stochastically rendered images. Recent algorithms for defocus blur alone are both fast and accurate. However, motion blur is a considerably more complex type of camera effect, and as a consequence, current algorithms are either slow or too imprecise to use in high quality rendering. We extend previous work on real-time l

Programmable shading provides artistic control over materials and geometry, but the black box nature of shaders makes some rendering optimizations difficult to apply. In many cases, it is desirable to compute bounds of shaders in order to speed up rendering. A bounding shader can be automatically derived from the original shader by a compiler using interval analysis, but creating optimized interva

Due to memory bandwidth limitations, chip multiprocessors (CMP) adopting the convenient shared memory model for their main memory architecture scale poorly. On-chip core-to-core communication is a solution to this problem, that can lead to further performance increase for a number of multithreaded applications. Programmatically, the Communicating Sequential Processes (CSP) paradigm provides a soun

The combustion timing in internal combustion engines affects the fuel consumption, in-cylinder peak pressure, engine noise and emission levels. The combination of an in-cylinder pressure sensor together with a direct injection fuel system lends itself well for cycle-to-cycle control of the combustion timing. This paper presents a method of controlling the combustion timing by the use of a cycle-t

The parallel structure of dataflow programs and their support for processing streams of data make dataflow programming an interesting tool for doing stream processing on parallel processing architectures. The computational kernels, the actors, of a dataflow program communicate with other actors via FIFO channels. The actors in the dataflow model used in this paper may perform different actions dep

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

In this paper we examine the idea of implementing communicating sequential processes (CSP) constructs on a Java embedded chip multiprocessor (CMP). The approach is intended to reduce the memory bandwidth pressure on the shared memory, by employing a dedicated network-on-chip (NoC). The presented solution is scalable and also specific for our limited resources and real-time predictability requireme