The term “collision detection” refers to the task of determining whether, in a given set of objects, any two intersect. If they do, then common collision detection systems return either one such pair or all such pairs. The term “proximity computation” refers to a more general task where we determine the nearest or the “most overlapping” pairs of objects. In the article, we present a new method ...

Many problems in Computational Science & Engineering (CS&E) are defined on the continuum. Standard algorithms for these problems are numerical and approximate. Their computational techniques include iteration, subdivision, and approximation. Such techniques are rarely seen in exact or algebraic algorithms. In this tutorial, we discuss a mode of computation called exact numerical computation (EN...

Solving the coupled-perturbed Hartree±Fock (CPHF) equations is the most time consuming part in the analytical computation of second derivatives of the molecular energy with respect to the nuclei. This paper describes a unique parallelization approach for solving the CPHF equations. The computational load is divided by the nuclear perturbations and distributed evenly among the computing nodes. T...

We describe a context-free parsing algorithm to deal with incomplete sentences, including unknown parts of unknown length. It produces a finite shared-forest compiling all parses, often infinite in number, that could account for both the error and the missing parts. In contrast to previous works, we derive profit from a finer dynamic programming construction, leading to an improved computationa...

The paper describes a real-time library providing facilities useful in the design of robot control architectures. The library supports structured creation of reactive and deliberative modules, dynamic modiication of relevant real-time parameters, generation of timing fault handlers , measurement and monitoring of execution times. This support enables adaptation of the rate of computation of rea...

The short-term hydrothermal scheduling is a daily planning proposition in power system operation, a task which is usually more complex than the scheduling of all-thermal generation system. The classical iteration method involves time consuming three iterative loops for obtaining the optimal solution. This paper presents an analytical method for eliminating the two iterative loops of the classic...

Processes considered rendering information dynamics have been studied, among others in: questions and answers, observations, communication, learning, belief revision, logical inference, game-theoretic interactions and computation. This article will put the computational approaches into a broader context of natural computation, where information dynamics is not only found in human communication ...

Current geophysical techniques for visualizing seismic activity employ image reconstruction methods that rely on a centralized approach for processing the raw data captured by seismic sensors. The data is either gathered manually, or relayed by expensive broadband stations, and then processed at a base station. This approach is time-consuming (weeks to months) and hazardous as the task involves...

data grid is an infrastructure that controls huge amount of data files, and provides intensive computational resources across geographically distributed collaboration. the heterogeneity and geographic dispersion of grid resources and applications place some complex problems such as job scheduling. most existing scheduling algorithms in grids only focus on one kind of grid jobs which can be data...