Noisy image restoration by cost function minimization

Implementation of a new approach to the nonlinear noisy image restoration problem, which is feasible for large images, is described. The approach is based on a vector space representation of images and on using the conjugate gradient algorithm to solve a least squares minimization problem. Computer simulations yield good results with relatively little computational cost.     

Asymptotic and finite element approximations for heat transfer in rotating compressible flow over an infinite porous disk

The laminar boundary layer equations for the compressible flow due to the finite difference in rotation and temperature rates are solved for the case of uniform suction through the disk. The effects of viscous dissipation on the incompressible flow are taken into account for any rotation rate, whereas for a compressible fluid they are considered only for a disk rotating in a stationary fluid. For the general case, the governing equations are solved numerically using a standard finite element scheme. Series solutions are developed for those cases where the suction effect is dominant. Based on the above analytical and numerical solutions, a new asymptotic finite element scheme is presented. By using this scheme one can significantly improve the pointwise accuracy of the standard finite element scheme.     

Modeling microbial populations with the original and modified versions of the continuous and discrete logistic equations

The life histories of microbial populations, under favorable and adverse conditions, exhibit a variety of growth, decay, and fluctuation patterns. They have been described by numerous mathematical models that varies considerably in structure and number of constants. The continuous logistic equation alone and combined with itself or with its mirror image, the Fermi function, can produce many of the observed growth patterns. They include those that are traditionally described by the Gompertz equation and peaked curves, with the peak being symmetric or asymmetric narrow or wide. The shape of survival and dose response curves appears to be determined by the distribution of the resistance's to the lethal agent among the individual organisms. Thus, exponential decay and Fermian or Gompertz-type curves can be considered manifestations of skewed to the right, symmetric, and skewed to the left distributions, respectively. Because of the mathematical constraints and determinism, the original discrete logistic equation can rarely be an adequate model of real microbial populations. However, by making its proportionality constant a normal-random variate it can simulate realistic histories of fluctuating microbial populations, including scenarios of aperiodic population explosions of varying intensities of the kind found in food-poisoning episodes.     

The effect of precursory cooling on rewetting of a slab

The Dua and Tien (1976) model for the rewetting of a slab with precursory cooling is solved exactly by separation of variables. The solution for the rewetting velocity is found to agree very well with a Wiener Hopf technique solution to this model by the author. Rewetting rates predicted by the approximate solution of Dua and Tien are found to agree with the present solution for small Peclet numbers, while underpredicting them for large Peclet numbers. Theoretical quench front velocities compare favorably with experimental data for copper quenched by liquid nitrogen. Precursory cooling is shown to be able to greatly increase the rewetting velocity, in particular for cases of high flow rates, while neglecting it in modelling may result in much too low quench velocities, as compared to experimental measurements.     

Crumbling walls: a class of practical and efficient quorum systems

Summary.  A quorum system is a collection of sets (quorums) every two of which intersect. Quorum systems have been used for many applications in the area of distributed systems, including mutual exclusion, data replication and dissemination of information. In this paper we introduce a general class of quorum systems called Crumbling Walls and study its properties. The elements (processors) of a wall are logically arranged in rows of varying widths. A quorum in a wall is the union of one full row and a representative from every row below the full row. This class considerably generalizes a number of known quorum system constructions. The best crumbling wall is the CWlog quorum system. It has small quorums, of size O(lg n), and structural simplicity. The CWlog has optimal availability and optimal load among systems with such small quorum size. It manifests its high quality for all universe sizes, so it is a good choice not only for systems with thousands or millions of processors but also for systems with as few as 3 or 5 processors. Moreover, our analysis shows that the availability will increase and the load will decrease at the optimal rates as the system increases in size. Received: August 1995 / Accepted: August 1996     

Recovery of ego-motion using region alignment

A method for computing the 3D camera motion (the ego-motion) in a static scene is described, where initially a detected 2D motion between two frames is used to align corresponding image regions. We prove that such a 2D registration removes all effects of camera rotation, even for those image regions that remain misaligned. The resulting residual parallax displacement field between the two region-aligned images is an epipolar field centered at the FOE (Focus-of-Expansion). The 3D camera translation is recovered from the epipolar field. The 3D camera rotation is recovered from the computed 3D translation and the detected 2D motion. The decomposition of image motion into a 2D parametric motion and residual epipolar parallax displacements avoids many of the inherent ambiguities and instabilities associated with decomposing the image motion into its rotational and translational components, and hence makes the computation of ego-motion or 3D structure estimation more robust     

On the effect of the deployment setting on broadcasting in Euclidean radio networks

The paper studies broadcasting in radio networks whose stations are represented by points in the Euclidean plane (each station knows its own coordinates). In any given time step, a station can either receive or transmit. A message transmitted from station v is delivered to every station u at distance at most 1 from v, but u successfully hears the message if and only if v is the only station at distance at most 1 from u that transmitted in this time step. A designated source station has a message that should be disseminated throughout the network. All stations other than the source are initially idle and wake up upon the first time they hear the source message. It is shown in [17] that the time complexity of deterministic broadcasting algorithms depends on two parameters of the network, namely, its diameter (in hops) D and a lower bound d on the Euclidean distance between any two stations. The inverse of d is called the granularity of the network, denoted by g. Specifically, the authors of [17] present a deterministic broadcasting algorithm that works in time O (Dg) and prove that every broadcasting algorithm requires \(\varOmega \left( D \sqrt{g} \right) \) time. In this paper, we distinguish between the arbitrary deployment setting, originally studied in [17], in which stations can be placed everywhere in the plane, and the new grid deployment setting, in which stations are only allowed to be placed on a d-spaced grid. Does the latter (more restricted) setting provide any speedup in broadcasting time complexity? Although the O (Dg) broadcasting algorithm of [17] works under the (original) arbitrary deployment setting, it turns out that the \(\varOmega \left( D \sqrt{g} \right) \) lower bound remains valid under the grid deployment setting. Still, the above question is left unanswered. The current paper answers this question affirmatively by presenting a provable separation between the two deployment settings. We establish a tight lower bound on the time complexity of deterministic broadcasting algorithms under the arbitrary deployment setting proving that broadcasting cannot be completed in less than \(\varOmega (D g)\) time. For the grid deployment setting, we develop a deterministic broadcasting algorithm that runs in time \(O \left( D g^{5 / 6} \log g \right) \), thus breaking the linear dependency on g.