In this article we illustrate some novel procedures of using Sinc methods to compute solutions to three types of medical problems. The rst of these is a novel way to solve optimal control problems. the second is a novel way to reconstruct images for X-ray tomography, and the third is a novel way to do ultrasonic tomography inversion. Each of these procedures uses Sinc convolution, which is a no...

This paper presents a new state of the art in the field of finite state system verification. The paradigm of this approach is to represent and to manipulate these systems in an implicit way. The computational costs of the verification procedures using this paradigm depend on the costs of the operations performed on this implicit representation instead of the number of states and transitions of ...

Rate-distortion otpimization procedures are very often used in rate allocation problems encountered in source encoders. However , these procedures can be, depending on the number of quantizers considered, very time consuming. This paper describes a sim-pliied approach relying on statistical signal and noise modeling. The strategy presented leads to performances comparable to a classical rate-di...

In this paper we review the procedures which are currently available for the generation of unstructured meshes suitable for use in the simulation of high Reynolds number viscous ows. For such simulations, computational eeciency generally dictates the requirement for the use of highly stretched cells in viscous dominated regions. Meshes of this type cannot be directly generated by the classical ...

Based on some relationships between modeland relay-based PI/PID tuning, some very simple synthesis procedures are proposed that couple the advantages of model-based methods to the simplicity and clarity of relay experiments. These procedures are fast, as they employ a single relay test, and do not introduce large process upsets. They are also very light from the computational standpoint, thus w...

We investigate the stochastic flow shop problem with m machines and general distributions for processing times. No analytic method exists for solving this problem, so we looked instead at heuristic methods. We devised three constructive procedures with modest computational requirements, each based on approaches that have been successful at solving the deterministic counterpart. We compared the ...

This paper presents a solution procedure based on a gradient descent method for the k-centrum problem in the plane. The particular framework of this problem for the Euclidean norm leads to bisector lines whose analytical expressions are easy to handle. This allows us to develop different solution procedures which are tested on different problems and compared with existing procedures in the lite...

An overview of some methods of statistical physics applied to the analysis of algorithms for optimization problems (satisfiability of Boolean constraints, vertex cover of graphs, decoding, ...) with distributions of random inputs is proposed. Two types of algorithms are analyzed: complete procedures with backtracking (Davis-Putnam-Loveland-Logeman algorithm) and incomplete, local search procedu...