The merge-and-shrink framework has been introduced as a general approach for defining abstractions of large state spaces arising in domain-independent planning and related areas. distinguishing characteristic the is that it operates directly on factored representation spaces, repeatedly modifying this through transformations such shrinking (abstracting factor representation), merging (combining...

A new method, based on the normal shrink and modified version of Katssagelous and Lay, is proposed for multiscale blind image restoration. The method deals with the noise and blur in the images. It is shown that the normal shrink gives the highest S/N (signal to noise ratio) for image denoising process. The multiscale blind image restoration is divided in two sections. The first part of this pa...

References http://rstb.royalsocietypublishing.org/content/363/1491/467.full.html#ref-list-1 This article cites 7 articles, 2 of which can be accessed free Rapid response http://rstb.royalsocietypublishing.org/letters/submit/royptb;363/1491/467 Respond to this article Email alerting service here right-hand corner of the article or click Receive free email alerts when new articles cite this artic...

A heterostructure composed of $N$ parallel homogeneous layers is studied in the limit as their widths $l_1, \ldots , l_N$ shrink to zero. The problem investigated one dimension and piecewise constant potential Schr\"{o}dinger equation given by strengths $V_1, V_N$ functions l_N$, respectively. key point derivation conditions on $V_1(l_1), V_N(l_N)$ for realizing a family one-point interactions ...

signals DuBois and along the actin myofilaments. Carson, Rachel. Shrink-wrap and cardboard packaging are only infrequently seen, landfills are effectively permanent facilities; that is, they will need to be monitored and maintained for Saffor after they close.

We consider a property stronger than the Sacks property which holds between the ground model and the Sacks forcing extension. 1. The Shrink Wrapping Property Suppose that V is a Sacks forcing extension of a model M . Then the Sacks property holds between V and M . That is, for each x ∈ ω, there exists a tree T ⊆ ω in M such that x ∈ [T ] and each level of T is finite. The following is a stronge...

A set of vertices $S$ in a connected graph $G$ is a different-distance set if, for any vertex $w$ outside $S$, no two vertices in $S$ have the same distance to $w$.The lower and upper different-distance number of a graph are the order of a smallest, respectively largest, maximal different-distance set.We prove that a different-distance set induces either a special type of path or an independent...