This paper presents a new parallel distributedprocessing (PDP) approach to solve job-shop scheduling problem which is NP-complete. In this approach, a stochastic model and a controlled external energy is used to impr...
详细信息
ISBN:
(纸本)0780314212
This paper presents a new parallel distributedprocessing (PDP) approach to solve job-shop scheduling problem which is NP-complete. In this approach, a stochastic model and a controlled external energy is used to improve the scheduling solution iteratively. Different to the processing element (PE) of the Hopfield neuralnetwork model, each PE of our model represents an operation of a certain job. So, the functions of each PE are a little more complicated than that of a Hopfield PE. Under such model, each PE is designed to perform some stochastic, collective computations. From the experimental result, the solutions can be improved toward optimal ones much faster than other methods. Instead of the polynomial number of variables needed in neuralnetwork approach, the variables number needed to formulate a job-shop problem in our model is only a linear function of the operation number contained in the given job-shop problem.
The color representation in the visual system is discussed through the analysis of a three-layered neuralnetwork model incorporating physiological evidence of color representation at the sensor level and the perceptu...
详细信息
The color representation in the visual system is discussed through the analysis of a three-layered neuralnetwork model incorporating physiological evidence of color representation at the sensor level and the perceptual level. The model is trained to perform a mapping between these color representations by a backpropagation algorithm. The acquired characteristics of the hidden units are analyzed. The hidden units learn characteristics similar to those of the color opponent cells found in fish retina and macaque lateral genticulate nucleus (LGN). It is concluded that the R-G and Y-B color opponent representations play an essential role in color information processing by investigating the efficiency of color representation in the hidden layer and the capability of color discrimination task of the model.< >
Different massively parallel implementations of multilayer feedforward neuralnetworks are presented and compared on a MasPar MP-1216, a parallel single instruction, multiple data (SIMD) computer with 16384 processors...
详细信息
Different massively parallel implementations of multilayer feedforward neuralnetworks are presented and compared on a MasPar MP-1216, a parallel single instruction, multiple data (SIMD) computer with 16384 processors. For multilayer feedforward networks, sustained rates of up to 348 M CPS and 129 M CUPS with backpropagation are obtained, a high mark for general purpose SIMD computers. Emphasis is placed on the problems of mapping neuralnetworks to parallel hardware, on implementation problems in obtaining high propagation rates on a SIMD machine, and on problems with the resulting learning algorithms.< >
Existing approaches to integrating neural and symbolic processing are divided into the following four categories: developing specialized, structured, localist networks for symbolic processing; performing symbolic proc...
详细信息
Existing approaches to integrating neural and symbolic processing are divided into the following four categories: developing specialized, structured, localist networks for symbolic processing; performing symbolic processing in distributedneuralnetworks (in a holistic way); combining separate symbolic and neuralnetwork modules; and using neuralnetworks as basic elements in symbolic architectures (the embedded approach). Research issues that need to be addressed in order to advance this field as well as to better understand the nature of intelligence and cognition are outlined.< >
The authors apply random neuralnetworks to the problem of assigning abstract data type modules (ADTs) to the processing elements of parallel computers. Although assignment of tasks has been discussed extensively in t...
详细信息
The authors apply random neuralnetworks to the problem of assigning abstract data type modules (ADTs) to the processing elements of parallel computers. Although assignment of tasks has been discussed extensively in the literature, the automatic assignment of ADTs is a relatively new problem, and therefore they describe the problem in detail. This is followed by an introduction to the random neuralnetwork model and a presentation of the neuralnetwork solution to the assignment problem. Experimental results are presented comparing the solution to those obtained with random assignment and with a greedy heuristic. The random neuralnetwork is found to give significantly better results than the other two approaches in virtually every case.< >
An approach is presented for the classification of a signal in noise. The classifier presented forms the bottom level in a decision network. By determining an interval of doubt about classifications, it is possible to...
详细信息
An approach is presented for the classification of a signal in noise. The classifier presented forms the bottom level in a decision network. By determining an interval of doubt about classifications, it is possible to make decisions at higher levels with additional or conflicting evidence, without having biased the decision from a low level classification. The region of uncertainty is a function of the information, so that the quality of decisions from individual decision makers will vary with the input. The decisions are formed in a parallel network which has a similar connectivity to an artificial neuralnetwork.< >
Relaxation labeling processes are a class of parallel distributedprocessing models developed to reduce local ambiguities and achieve global consistency in labeling problems. They have become a standard technique in t...
详细信息
Relaxation labeling processes are a class of parallel distributedprocessing models developed to reduce local ambiguities and achieve global consistency in labeling problems. They have become a standard technique in the computer vision domain, and possess certain common properties with both artificial and biological neural systems. In particular, like the Hopfield network, they have a quadratic Lyapunov function when a symmetry condition is satisfied. In this paper the use of relaxation processes to solve the traveling salesman problem is proposed and it is quantitatively demonstrated that the algorithm is extremely effective both in finding legitimate problem solutions and in discovering optimal tours.
neuralnetworks, parallel distributedprocessing, or connectionism has been the focus of a rising new paradigm in artificial intelligence with sometimes a claimed association with neuroanatomy. If a trained network is...
neuralnetworks, parallel distributedprocessing, or connectionism has been the focus of a rising new paradigm in artificial intelligence with sometimes a claimed association with neuroanatomy. If a trained network is viewed simply as an implementation of a function, it has to be admitted that it is a nonconventional implementation and is obtained by a nonconventional route. networks may then be viewed as a radically different implementation of software engineering problems. In this paper the authors illustrate the potential for this viewpoint with the results of studies currently being pursued on the use of neural computing as an emergent technology for the software engineer. It is shown that 'network programming' constitutes a new programming paradigm for the software engineer, and it makes drastic changes to the traditional area on which it impacts-in this case software production. They demonstrate how certain software-engineering problems can be reliably implemented as multiversion, neural-network software systems.< >
A parallel multiprocessor architecture for general-purpose neurocomputing applications is introduced. Methods to map the multilayer perceptron, Kohonen's self-organising feature map and Kanerva's sparse distri...
详细信息
A parallel multiprocessor architecture for general-purpose neurocomputing applications is introduced. Methods to map the multilayer perceptron, Kohonen's self-organising feature map and Kanerva's sparse distributed memory to the suggested architecture are discussed. The mapping examples include both the forward operation and training phase of the networks. The computational performance of the architecture is estimated for these three example cases.
A new content addressable associative memory structure, cellular associative memory, is proposed. It is composed of simple associative memory cells that are locally interconnected as a regular cellular network. This p...
详细信息
A new content addressable associative memory structure, cellular associative memory, is proposed. It is composed of simple associative memory cells that are locally interconnected as a regular cellular network. This paper describes broadly the ideas behind cellular associative memory and gives an example in the field of character recognition. The properties of cellular associative memory are compared to those of the Kanerva's sparse distributed memory (1988) and the Hopfield network.
暂无评论