Augmenting computer networks

Three methods of augmenting computer networks by adding at most one link per processor are discussed: (1) A tree of N nodes may be augmented such that the resulting graph has diameter no greater than 4log sub 2((N+2)/3)-2. Thi O(N(3)) algorithm can be applied to any spanning tree of a connected graph to reduce the diameter of that graph to O(log N); (2) Given a binary tree T and a chain C of N nodes each, C may be augmented to produce C so that T is a subgraph of C. This algorithm is O(N) and may be used to produce augmented chains or rings that have diameter no greater than 2log sub 2((N+2)/3) and are planar; (3) Any rectangular two-dimensional 4 (8) nearest neighbor array of size N = 2(k) may be augmented so that it can emulate a single step shuffle-exchange network of size N/2 in 3(t) time steps

Revisiting the Edge of Chaos: Evolving Cellular Automata to Perform Computations

We present results from an experiment similar to one performed by Packard (1988), in which a genetic algorithm is used to evolve cellular automata (CA) to perform a particular computational task. Packard examined the frequency of evolved CA rules as a function of Langton's lambda parameter (Langton, 1990), and interpreted the results of his experiment as giving evidence for the following two hypotheses: (1) CA rules able to perform complex computations are most likely to be found near ``critical'' lambda values, which have been claimed to correlate with a phase transition between ordered and chaotic behavioral regimes for CA; (2) When CA rules are evolved to perform a complex computation, evolution will tend to select rules with lambda values close to the critical values. Our experiment produced very different results, and we suggest that the interpretation of the original results is not correct. We also review and discuss issues related to lambda, dynamical-behavior classes, and computation in CA. The main constructive results of our study are identifying the emergence and competition of computational strategies and analyzing the central role of symmetries in an evolutionary system. In particular, we demonstrate how symmetry breaking can impede the evolution toward higher computational capability.Comment: 38 pages, compressed .ps files (780Kb) available ONLY thru anonymous ftp. (Instructions available via `get 9303003' .

The Connected Component Algorithm on The NON-VON Supercomputer

The NON-VON Supercomputer is a highly parallel tree-structured computer that is being Implemented at Columbia University. In this paper, we demonstrate that tree architectures with their favorable characteristics for VLSI Implementation, and fast global broadcast, lend themselves easily and naturally to the representation and manipulation of Images represented by hierarchical data structures A description of NON-VON architecture IS presented With an emphasis on the special architectural features that will be used m our Image understanding algorithms. We adopt a variation of the quad tree data structure, called the binary Image tree, to represent images in the NON-VON tree We show how Images are loaded in the NON-VON tree, and present the algorithm for budding the binary Image trees. An efficient Implementation of the connected component labeling algorithm on NON-VON is then presented Simulation results are discussed, and we show the fast execution time of the algorithm on NON-VON. Other algorithms are also developed, such as hlstogrammlng, Hough transform, Set operations and Image correlation, and we can conclude that NON-VON can be used to Implement efficiently several :important Image understanding task

Supporting divide-and-conquer algorithms for image processing

Divide-and-conquer is an important algorithm strategy, but it is not widely used in image processing. For higher-level, symbolic operations it should often be the strategy of choice for parallel computers. It is natural for a machine with a regular interconnection scheme such as a mesh, mesh with broadcasting, tree, pyramid, mesh-of-trees, PRAM, or hypercube, and can be used either on a machine with a pixel per processor or on one with many pixels per processor. However, divide-and-conquer algorithms use parallel computers in a different manner than, say, local edge detection, so machines optimized for local neighborhood algorithms may be poor for divide-and-conquer algorithms. Some characteristics of divide-and-conquer algorithms are examined, along with some of their implications for the design of machines and languages which can support the efficient programming and execution of divide-and-conquer algorithms.Peer Reviewedhttp://deepblue.lib.umich.edu/bitstream/2027.42/26821/1/0000380.pd

A STUDY OF MACHINE VISION IN THE AUTOMOTIVE INDUSTRY

With the growth of industrial automation, it has become increasingly important to validate the quality of every manufactured part during production. Until now, human visual inspection aided with hard tooling or machines have been the primary means to this end, but the speed of today's production lines, the complexity of production equipment and the highest standards of quality to which parts must adhere frequently, make the traditional methods of industrial inspection and control impractical, if not impossible. Subsequently, new solutions have been developed for the monitoring and control of industrial processes, in real­time. One such technology is the area of machine vision. After many years of research and development, computerised vision systems are now leaving the laboratory and are being used successfully in the factory environment. They are both robust and competitively priced as a sensing technique which has now opened up a whole new sector for automation. Machine vision systems are becoming an important integral part of the automotive manufacturing process, with applications ranging from inspection, classification, robot guidance, assembly verification through to process monitoring and control. Although the number of systems in current use is still relatively small, there can be no doubt, given the issues at stake, that the automotive industry will once again lead the way with the implementation of machine vision just as it has done robotic technology. The thesis considered the issue of machine vision and in particular, its deployment within the automotive industry. The thesis has presented work on machine vision for the prospective end-user and not the designer of such systems. It will provide sufficient background about the subject, to separate machine vision promises from reality and permit intelligent decisions regarding machine vision applications to be made. The initial part of the dissertation focussed on the strategic issues affecting the selection of machine vision at the planning stage, such as a listing of the factors to justify investment, the capability of the technology and type of problems that are associated with this relatively new but complex science. Though it is widely accepted that no two industrial machine vision systems are identical, knowledge of the basic fundamentals which underpin the structure of the technology in its application is presented. This work covered a structured description detailing typical hardware components such as camera technology, lighting systems, etc... which form an integral part of an industrial system and discussions regarding the criteria for selection are presented. To complement this work, a further section is specifically devoted to the bewildering array of vision software analysis techniques which are currently available today. A detailed description of the various techniques that are applied to images in order to make use of and understand the data contained within them are discussed and explored. Applications for machine vision fall into two main categories namely robotic guidance and inspection. Obviously within each category there are many further sub­groups. Within this context the latter part of the thesis reviews with a well structured description of several industrial case studies derived from the automotive industry, which illustrate that machine vision is capable of providing real time solutions to manufacturing based problems. In conclusion, despite the limited availability of industrially based machine vision systems, the success of implementation is not always guaranteed, as the technology imposes both technical limitations and introduce new human engineering considerations. By understanding the application and the implications of the technical requirements on both the "staging" and the "image-processing" power required of the machine vision system. The thesis has shown that the most significant elements of a successful application are indeed the lighting, optics, component design, etc... - the "Staging". From the case studies investigated, optimised "staging" has resulted in the need for less computing power in the machine vision system. Inevitably, greater computing power not only requires more time but is generally more expensive. The experience gained from the this project, has demonstrated that machine vision technology is a realistic alternative means of capturing data in real-time. Since the current limitations of the technology are well suited to the delivery process of the quality function within the manufacturing process

Studies of algorithms and related imaging techniques for industrial inspection

This thesis will deal with algorithms and imaging techniques for use in automated industrial inspection. The work falls into two main areas, the first dealing with general problems relating to typical inspection tasks, the second with specific applications including the analysis of seals on plastic packets.The requirements of a general object location and inspection system will be discussed initially in relation to algorithms supplied with commercial systems, which often seem ad-hoc. This will be followed up with detailed analyses of several corner and small hole detection algorithms. The features looked for in a useful algorithm are: (1) a high execution speed when implemented on a general purpose microcomputer, (2) good accuracy in locating the desired features, (3) robustness when faced with poor quality, noisy or cluttered images and (4) the ability to distinguish between genuine features and others that appear, superficially, to be similar. A program using these feature detectors to locate partially occluded machine parts in typical images will be presented.The second main area of investigation is that of the detection of faults in heat sealed food packets and is one which has hitherto largely been overlooked. The main problem with these packets is that the cellophane wrapper is highly reflective, giving rise to large areas of glare in any off-camera image. Experience has shown that careful lighting arrangement alone will never totally remove this problem. However, a simple arrangement of switched light beams, along with computer processing, can almost totally eliminate the glare. This approach has been used in the inspection of packets where faults are revealed by parts of the product inside showing through holes in the wrapper. Alternatively, by careful alignment of the light sources, the surface structure of the sealed part of a packet may be revealed. This can reveal defects either through the absence of a regular pattern, or by the presence of wrinkles running across the seal. Algorithms have been developed demonstrating each of these inspection tasks.Overall the work presented in this thesis has spanned several traditional areas of interest, and has also developed the techniques required for packet inspection and other situations where glare is a problem.<p

3D cellular automata finite element modelling of cleavage and ductile fracture

In the present research work, a three-dimensional Cellular Automata Finite Element (CAFE) multi-scale model was developed to simulate, ductile fracture, cleavage and the ductile-brittle transition in a structural steel. For the simulation of the ductile-brittle fracture, at least two Cellular Automata arrays are needed, one to represent the ductile material properties and the other one to account for the brittle fracture process. The cell sizes in both arrays are independent of each other and of the finite element size. The cell sizes in each Cellular Automata array are related to the microstructural process of each fracture mechanism. The finite elements size is chosen to represent the macro strain gradients accurately. The model was implemented through the user define material behavior subroutine VUMAT in the finite element program ABAQUS Explicit Version 5.6. In the CAFE model, the material information is moved from the structural response of finite elements and stored in the appropriated number of Cellular Automata (CA) arrays. In the present CAFE model, the Rousselier ductile damage model was applied to each ductile cell. The critical value of the maximum principal stress was used to assess the failure of each brittle cell. In the brittle CA arrays, four different cleavage fracture nucleation micromechanisms, found experimentally at te.st temperatures down to -196øC in a ferritic-pearlitic Grade A ship plate steel were included in the model. This was done in order to simulate the real microfeatures nucleating cleavage in ferritic steels. In this model, the physical damage parameters of the ductile and brittle parts were calibrated separately. After calibration the CAFE model simulated the experimentally measured distribution of brittle microcracks generated in the notch region of blunt four point double-notch bend tests performed at test temperatures from 25øC to -196øC. The ductile part of the CAFE model was calibrated with the simulation of tensile and impact Charpy tests performed at room temperature. Subsequently the model was applied to simulate the ductile-brittle transition of Grade A ship plate steel. When numerical against experimental data was obtained, the parameters were considered true material model parameters of the steel under analysis