5. 6. I. 8. 9. IO. Introduction Review of deterministic iterative restoration algorithms 2.1. Basic iterative algorithm 2.1.1. Derivation 2.1.2. Convergence 2.2. Basic iterative algorithm with reblurring 2.2.1. Derivation 2.2.2. Convergence and rate of convergence 2.3. Basic iterative algorithm with constraints 2.3. I. Derivation and convergence 2.3.2. Experiment I 2.4. Method of projecting ont...

One of the main problems in computational biology is the construction of biologically plausible alignments for given sequence families. Many procedures have been developed for this purpose; most are based on clustering the sequences hierarchically prior to the computation of their alignment and then proceeding recursively. In this paper, we compare results obtained with a new algorithm for simu...

Abstract The simultaneous eating algorithm (SEA) and probabilistic serial (PS) mechanism are well known for allocating a set of divisible or indivisible goods to agents with ordinal preferences. PS is SEA at the same speed. prominent property efficiency. Recently, we extended (EPS) from fixed quota each good variable varying in polytope constrained by submodular functions. In this article, furt...

An improved iterative method of Euler’s type for the simultaneous inclusion of polynomial zeros is considered. To accelerate the convergence of the basic method of fourth order, Carstensen-Petković’s approach [7] using Weierstrass’ correction is applied. It is proved that the R-order of convergence of the improved Euler-like method is (asymptotically) 2 + √ 7 ≈ 4.646 or 5, depending of the type...

Simultaneous occurrences of multiple recurrence relations in a system of non-linear constrained Horn clauses are crucial for proving its satisfiability. A solution of such system is often inexpressible in the constraint language. We propose to synchronize recurrent computations, thus increasing the chances for a solution to be found. We introduce a notion of CHC product allowing to formulate a ...

To create 3D volumetric maps of scenes with autonomous mobile robots it is necessary to gage several 3D scans and to merge them into one consistent 3D model. This paper provides a new solution to the simultaneous localization and mapping (SLAM) problem with six degrees of freedom. Robot motion on natural surfaces has to cope with yaw, pitch and roll angles, turning pose estimation into a proble...

We present in this work a comparison among four algorithms for transmission tomography. The algorithms are based on the formalism of POCS (Projection onto Convex Sets): ART (Algebraic Reconstruction Technique), SIRT (Simultaneous Iterative Reconstruction Technique), sequential POCS and parallel POCS. We found that the use of adequate a priori knowledge about the solutions, expressed by convex s...

Simultaneous localization and mapping (SLAM) of working environments is one of the important problems in mobile robotics. For the problem, we present a new method using an omnidirectional stereo system. By using 3D range information obtained from the omnidirectional stereo, we construct scan-matching based extended Kalman filter SLAM(EKF-SLAM) system. In the system, the output of the piecewise ...

We describe the problem of simultaneous determination of hypocentre locations and velocity structure, using data from microearthquake networks, and briefly discuss some of the techniques which have been proposed for its solution. In particular we examine the method of Thurber, as implemented in his program SIMUWL, where the problem is formulated as a non-linear least-squares problem. A new prog...

Stencil computations consume a major part of runtime in many scientific simulation codes. As prototypes for this class of algorithms we consider the iterative Jacobi and Gauss-Seidel smoothers and aim at highly efficient parallel implementations for cachebased multicore architectures. Temporal cache blocking is a known advanced optimization technique, which can reduce the pressure on the memory...