Search results

The trade-off between throughput and memory constraints is a common design problem in embedded systems, and especially for streaming applications, where the memory in question usually occurs in the form of buffers for streams of data. This paper presents a methodology, based on the post-processing of dataflow execution traces, that enables designers to make principled choices in the design space f

This paper presents a new method for representing Light Propagation Volumes using an octree data structure, and for allowing light from regular point light sources to be injected into them. The resulting technique uses full octrees with the help of a separate data structure for representing the octree structure. The octree structure enables light propagation to be performed at a lower resolution t

Abstract in UndeterminedVideo coding technology in the last 20 yearshas evolved producing a variety of different and com-plex algorithms and coding standards. So far the speci-fication of such standards, and of the algorithms thatbuild them, has been done case by case providingmonolithic textual and reference software specifica-tions in different forms and programming languages.However, very littl

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

In low-temperature combustion concepts such as partially premixed combustion, the ignition delay should be large enough in order to ensure sufficient fuel and air mixing before the start of combustion. It is also necessary that the combustion timing is sufficiently well phased for high thermal efficiency. Since the ignition delay and combustion timing are intimately coupled, the decoupling of the

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

This contribution presents a novel offline dynamic multi-objective optimization framework for high-pressure liquid chromatographic (HPLC) processes in batch elution mode. The framework allows for optimization of general elution trajectories parametrized with piecewise constant control signals. It is based on a simultaneous method where both the control and state variables are fully discretized in

Since the 1960s, product designers, architects, lighting planners, gamers and scientific visualizaiton specialists have craved the ability to work in real-time three-dimensional photorealistic virtual worlds. The authors, one specializing in making computer graphics more convincing and the other focusing on making them faster, present the achievements and challenges in the race for real-time photo

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