The availability of freeness and sharing information for logic programs has proven useful in a wide variety of applications. However, deriving correct freeness and sharing information turns out to be a complex task. I...
详细信息
The author introduces the theory of pattern recognition using class 2 dynamical systems. In particular, the theory of fractal learning is considered, and fractal learning theory is applied to character recognition. Fr...
详细信息
The author introduces the theory of pattern recognition using class 2 dynamical systems. In particular, the theory of fractal learning is considered, and fractal learning theory is applied to character recognition. Fractal image encoding, that is storing image in stable configurations of dynamical systems, is discussed. Image encoding and decoding algorithms are presented. Several types of fractal equations and their solution are also discussed. Some primary results of fractal learning are demonstrated.< >
Image compression using stochastic artificial neural networks (SANNs) is studied. The ideal is to store an image in a stable distribution of a stochastic neural network. Given an input image f epsilon F, one can find ...
详细信息
Image compression using stochastic artificial neural networks (SANNs) is studied. The ideal is to store an image in a stable distribution of a stochastic neural network. Given an input image f epsilon F, one can find a SANN t epsilon T such that the equilibrium distribution of this SANN is the given image f. Therefore, the input image, f, is encoded into a specification of a SANN, t. This mapping from F (image space) to T (parameter space of SANN) defines the SANN transformation. It is shown that the compression ratio R of the SANN transformation is R=O(n/(K (log n)/sup 2/)) where n is the number of pixels. To complete a SANN transformation, SANN equations must be solved. Two SANN equations are presented. The solution of SANN is briefly discussed.< >
A system for performing highly parallel, predictable real-time image filtration is described. The application software was developed using a special class of abstract data types (ADT) constructed in the RT-X language ...
详细信息
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-pot...
详细信息
The theory of worm routing (rather than packet routing) recently attracts an increased attention as an abstraction of the underlying communication mechanisms in many parallel machines. Routing the worms in the hot-potato style is a desired form of communication in high-speed optical interconnection networks. The authors develop a simple method for the design of parallel hot-potato worm routing algorithms. The basic approach is to simulate known packet routing algorithms, so that in each step worms are moved around instead of packets. For hot-potato permutation routing of worms of size k the authors have the following results. They get a O(k/sup 2.5/n) algorithm for the n*n mesh, and a O(k/sup 1.5/n) algorithm for the corresponding offline problem. For the 2/sup n/-nodes hypercube they get a O(k/sup 3/n log /sup 2/n) deterministic algorithm, and a O(k/sup 3/n) randomized algorithm. Although the results are given for permutation routing on the mesh and the hypercube, the general method can be applied to many other networks and to more general communication patterns as well. Moreover, once better routing algorithms are found for the underlying network, the worm routing algorithm improves, too.< >
Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understa...
详细信息
Infinite, recursive versions of NP optimization problems are defined. For example, MAX CLIQUE becomes the question of whether a recursive graph contains an infinite clique. The work was motivated by trying to understand what makes some NP problems highly undecidable in the infinite case, while others remain on low levels of the arithmetical hierarchy. Two results are proved; one enables using knowledge about the infinite case to yield implications to the finite case, and the other enables implications in the other direction. Taken together, the two results provide a method for proving (finitary) problems to be outside the syntactic class MAX NP, hence outside MAX SNP too. The technique is illustrated with many examples.< >
We present geometric algorithms which tackle the docking problem in Molecular Biology. This problem is a central research topic both for synthetic drug design and for biomolecular recognition and interaction of protei...
详细信息
A method is presented to correct an approximate polygonal sketch of an image object boundary by adjusting the location of each corner point in the sketch. The method is suitable for the segmentation of unknown images ...
详细信息
A method is presented to correct an approximate polygonal sketch of an image object boundary by adjusting the location of each corner point in the sketch. The method is suitable for the segmentation of unknown images using interactive techniques, and for locating object boundaries in model-based segmentation. For each point, p, at which two lines meet in an open or closed polygonal sketch, a corner segmentation model is derived based on the angle, orientation and scale of the corner defined, and the image function f(x, y) in the immediate region about p. A corner template is then constructed and matched in a small neighborhood about p, thereby providing a corrected polygonal sketch. The segmentation model is correct in 95% of the cases, and the corner is accurately located.< >
Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design de...
详细信息
Development of wormhole routing techniques so far has been largely independent of the results available for store-and-forward routing in literature. The authors provide a general result which enables them to design deadlock-free wormhole routing algorithms from store-and-forward routing algorithms that satisfy certain criteria. They illustrate this result by developing fully-adaptive deadlock-free wormhole routing algorithms from two well-known store-and-forward algorithms: the positive- and negative-hop algorithms based on the number of hops taken by messages. They compare the negative-hop algorithm with the commonly used non-adaptive e-cube and recently proposed partially adaptive north-last algorithm.< >
暂无评论