Industry
Symbolic Model Checking
Kluwer. See also: Symbolic Model Checking: An Approach to the State Explosion Problem. Doctoral thesis, Carnegie Mellon University, 1992 (http://www.kenmcmil.com/pubs/thesis.pdf). J.R. Burch, E.M. Clarke, K.L. McMillan, D.L. Dill, L.J. Hwang, Symbolic model checking: 1020 States and beyond, Information and Computation, Volume 98, Issue 2, June 1992, Pages 142-170 (http://www.sciencedirect.com/science/article/pii/089054019290017A). Burch, J. R.; Clarke, E.M.; McMillan, K. L.; Dill, D.L., Sequential circuit verification using symbolic model checking, Design Automation Conference, 1990. Proceedings, 27th ACM/IEEE, vol., no., pp.46,51, 24-28 Jun 1990. (https://ieeexplore.ieee.org/document/114827) Burch, J.R.; Clarke, E.M.; Long, D.E.; McMillan, K.L.; Dill, D.L., Symbolic model checking for sequential circuit verification, Computer-Aided Design of Integrated Circuits and Systems, IEEE Transactions on, vol.13, no.4, pp.401,424, Apr 1994 (https://ieeexplore.ieee.org/document/275352). E. M. Clarke, O. Grumberg, K. L. McMillan, and X. Zhao. 1995. Efficient generation of counterexamples and witnesses in symbolic model checking. In Proceedings of the 32nd annual ACM/IEEE Design Automation Conference (DAC '95). ACM, New York, NY, USA, 427-432 (http://dl.acm.org/citation.cfm?id=217565). Burch, Jerry R.; Clarke, Edmund M.; Long, David E.; McMillan, Kenneth L.; and Dill, David L., Symbolic Model Checking for Sequential Circuit Verification. IEEE Transactions On Computer-Aided Design of Integrated Circuits and Systems, Vol. 13, No. 4, pp. 401-424, April 1994 (http://www.cs.cmu.edu/~emc/papers/Conference%20Papers/Sequential%20circuit%20verification%20using%20symbolic%20model%20checking.pdf).
Neural Network Perception for Mobile Robot Guidance
Vision based mobile robot guidance has proven difficult for classical machine vision methods because of the diversity and real time constraints inherent in the task. This thesis describes a connectionist system called ALVINN (Autonomous Land Vehicle In a Neural Network) that overcomes these difficulties. ALVINN learns to guide mobile robots using the back-propagation training algorithm. Because of its ability to learn from example, ALVINN can adapt to new situations and therefore cope with the diversity of the autonomous navigation task. But real world problems like vision based mobile robot guidance presents a different set of challenges for the connectionist paradigm.
A Network of Localized Linear Discriminants
The localized linear discriminant network (LLDN) has been designed to address classification problems containing relatively closely spaced data from different classes (encounter zones [1], the accuracy problem [2]). Locally trained hyperplane segments are an effective way to define the decision boundaries for these regions [3]. The LLD uses a modified perceptron training algorithm for effective discovery of separating hyperplane/sigmoid units within narrow boundaries. The basic unit of the network is the discriminant receptive field (DRF) which combines the LLD function with Gaussians representing the dispersion of the local training data with respect to the hyperplane. The DRF implements a local distance measure [4], and obtains the benefits of networks oflocalized units [5]. A constructive algorithm for the two-class case is described which incorporates DRF's into the hidden layer to solve local discrimination problems. The output unit produces a smoothed, piecewise linear decision boundary. Preliminary results indicate the ability of the LLDN to efficiently achieve separation when boundaries are narrow and complex, in cases where both the "standard" multilayer perceptron (MLP) and k-nearest neighbor (KNN) yield high error rates on training data. 1 The LLD Training Algorithm and DRF Generation The LLD is defined by the hyperplane normal vector V and its "midpoint" M (a translated origin [1] near the center of gravity of the training data in feature space).
Models Wanted: Must Fit Dimensions of Sleep and Dreaming
Hobson, J. Allan, Mamelak, Adam N., Sutton, Jeffrey P.
During waking and sleep, the brain and mind undergo a tightly linked and precisely specified set of changes in state. At the level of neurons, this process has been modeled by variations of Volterra-Lotka equations for cyclic fluctuations of brainstem cell populations. However, neural network models based upon rapidly developing knowledge ofthe specific population connectivities and their differential responses to drugs have not yet been developed. Furthermore, only the most preliminary attempts have been made to model across states. Some of our own attempts to link rapid eye movement (REM) sleep neurophysiology and dream cognition using neural network approaches are summarized in this paper.
Neural Computing with Small Weights
Siu, Kai-Yeung, Bruck, Jehoshua
Kai-Yeung Siu Dept. of Electrical & Computer Engineering University of California, Irvine Irvine, CA 92717 Jehoshua Bruck IBM Research Division Almaden Research Center San Jose, CA 95120-6099 Abstract An important issue in neural computation is the dynamic range of weights in the neural networks. Many experimental results on learning indicate that the weights in the networks can grow prohibitively large with the size of the inputs. Here we address this issue by studying the tradeoffs between the depth and the size of weights in polynomial-size networks of linear threshold elements (LTEs). We show that there is an efficient way of simulating a network of LTEs with large weights by a network of LTEs with small weights. To prove these results, we use tools from harmonic analysis of Boolean functions.
Models Wanted: Must Fit Dimensions of Sleep and Dreaming
Hobson, J. Allan, Mamelak, Adam N., Sutton, Jeffrey P.
During waking and sleep, the brain and mind undergo a tightly linked and precisely specified set of changes in state. At the level of neurons, this process has been modeled by variations of Volterra-Lotka equations for cyclic fluctuations of brainstem cell populations. However, neural network models based upon rapidly developing knowledge ofthe specific population connectivities and their differential responses to drugs have not yet been developed. Furthermore, only the most preliminary attempts have been made to model across states. Some of our own attempts to link rapid eye movement (REM) sleep neurophysiology and dream cognition using neural network approaches are summarized in this paper.