作者：
J.H.M. ten Thije BoonkkampCentre for Analysis
Scientific Computing and Applications Department of Mathematics and Computer Science Eindhoven University of Technology PO Box 513 5600 MB Eindhoven The Netherlands
Expressions for the numerical flux of a conservation law of advection-diffusion-reaction type are derived from a local solution of the entire conservation law, including the source term. The resulting complete flux sc...
In this paper, we investigate the quadratic approximation methods. After studying the basic idea of simplex methods, we construct several new search directions by combining the local information progressively obtained...
详细信息
In this paper, we investigate the quadratic approximation methods. After studying the basic idea of simplex methods, we construct several new search directions by combining the local information progressively obtained during the iterates of the algorithm to form new subspaces. And the quadratic model is solved in the new subspaces. The motivation is to use the information disclosed by the former steps to construct more promising directions. For most tested problems, the number of functions evaluations have been reduced obviously through our algorithms.
This paper concerns mathematical and numerical modelling of focal ischemia in tridimensional geometries. The proposed model includes a space dependent description of the blood dynamics assuming that the vascular tissu...
Software for numerical solution of partial differential equations requires accessing, manipulating, and often modifying information about the geometry of the computational domain, the mesh used for the simulation, and...
详细信息
Particle-based simulation methods are used to model a wide range of complex phenomena and to solve time-dependent problems of various scales. Effective visualizations of the resulting state will communicate subtle cha...
Synchronous communication is a primary concern for multi-user virtual environments like Massively Multiplayer Online Games (MMOGs). Most of the MMOGs offer discrete view for the avatars and follow logical zone layout ...
详细信息
ISBN:
(纸本)9781595937025
Synchronous communication is a primary concern for multi-user virtual environments like Massively Multiplayer Online Games (MMOGs). Most of the MMOGs offer discrete view for the avatars and follow logical zone layout for easy state management. The avatar movement, from one logical zone to another, causes reorganization at the P2P overlay structure. Its recurrent nature along with unintelligent zone crossing approaches eventually hampers synchronous communication. In this paper, we present performance enhancement mechanisms to reduce P2P overlay reorganization penalties based on avatars' physical characteristics. Avatars' unpredictable movement around the zone boundaries also incur repeated connections and disconnections either among the zone masters or among the multiple peers in the overlay networks. Interest driven zone crossing, dynamic shared region between adjacent zones, and clustering of the entities based on their attributes significantly alleviates these problems and also provides continuous view and seamless region crossing to players. The technical contribution of this paper is to present the effectiveness of object clustering mechanism and interest driven zone crossing with dynamic shared region between each adjacent zones to enhance the gaming experience of MMOG players or users of other types of networked virtual environments (VE). Copyright 2007 ACM.
Characterizing the communication behavior of large-scale applications is a difficult and costly task due to code/system complexity and their long execution times. An alternative to running actual codes is to gather th...
详细信息
We present interactive techniques for identifying and extracting features in function fields. Function fields map points in n-dimensional Euclidean space to 1-dimensional scalar functions. Visual feature identificatio...
详细信息
We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate rep...
详细信息
ISBN:
(纸本)159593748X
We present our on-going work to develop techniques for specifying source code signatures of bug patterns. Specifically, we discuss two approaches. The first approach directly analyzes a program in the intermediate representation (IR) of the ROSE compiler infrastructure using ROSE's API. The second analyzes the program using the bddbddb system of Lam, Whaley, et al.. In this approach, we store the IR produced by ROSE as a relational database, express patterns as declarative inference rules on relations in the language Datalog, and bddbddb implements the Datalog programs using binary decision diagram (BDD) techniques. Both approaches readily apply to large-scale applications, since ROSE provides full type analysis, control flow, and other available analysis information. In this paper, we primarily consider bug patterns expressed with respect to the structure of the source code or the control flow, or both. More complex techniques to specify patterns that are functions of data flow properties may be addressed by either of the above approaches, but are not directly treated here. Our Datalog-based work includes explicit support for expressing patterns on the use of the Message Passing Interface (MPI) in parallel distributed memory programs. We show examples of this on-going work as well. Copyright 2007 ACM.
N-Gram (n-character sequences in text documents) counting is a well-established technique used in classifying the language of text in a document. In this paper, n-gram processing is accelerated through the use of reco...
详细信息
ISBN:
(纸本)9781595938947
N-Gram (n-character sequences in text documents) counting is a well-established technique used in classifying the language of text in a document. In this paper, n-gram processing is accelerated through the use of reconfigurable hardware on the XtremeData XD1000 system. Our design employs parallelism at multiple levels, with parallel Bloom Filters accessing on-chip RAM, parallel language classifiers, and parallel document processing. In contrast to another hardware implementation (HAIL algorithm) that uses offchip SRAM for lookup, our highly scalable implementation uses only on-chip memory blocks. Our implementation of end-to-end language classification runs at 85 X comparable software and 1.45x the competing hardware design. Copyright. 2007 ACM.
暂无评论