Genre
Issues in the Design of AI-Based Schedulers: A Workshop Report
Kempf, Karl, Pape, Claude Le, Smith, Stephen F., Fox, Barry R.
Based on the experience in manufacturing production scheduling problems which the AI community has amassed over the last ten years, a workshop was held to provide a forum for discussion of the issues encountered in the design of AI-based scheduling systems. Several topics were addressed including: the relative virtues of expert system, deep method, and interactive approaches, the balance between predictive and reactive components in a scheduling system, the maintenance of convenient scheduling descriptions, the application of the ideas of chaos theory to scheduling, the state of the art in schedulers which learn, and the practicality and desirability of a set of benchmark scheduling problems. This article expands on these issues, abstracts the papers which were presented, and summarizes the lengthy discussions that took place.
Theory and Application of Minimal-Length Encoding: 1990 AAAI Spring Symposium Report
This symposium was very successful and was perhaps the most unusual of the spring symposia this year. It brought together for the first time distinguished researchers from many diverse disciplines to discuss and share results on a particular topic of mutual interest. The disciplines included machine learning, computational learning theory, computer vision, pattern recognition, perceptual psychology, statistics, information theory, theoretical computer science, and molecular biology, with the involvement of the latter group having lead to a joint session with the AI and Molecular Biology symposium.
Using a Translation-Invariant Neural Network to Diagnose Heart Arrhythmia
Distinctive electrocardiogram (EeG) patterns are created when the heart is beating normally and when a dangerous arrhythmia is present. Some devices which monitor the EeG and react to arrhythmias parameterize the ECG signal and make a diagnosis based on the parameters. The author discusses the use of a neural network to classify the EeG signals directly.
Neural Network Analysis of Distributed Representations of Dynamical Sensory-Motor Transformations in the Leech
Lockery, Shawn R., Fang, Yan, Sejnowski, Terrence J.
Neu.·al Network Analysis of Distributed Representations of Dynamical Sensory-Motor rrransformations in the Leech Shawn R. LockerYt Van Fangt and Terrence J. Sejnowski Computational Neurobiology Laboratory Salk Institute for Biological Studies Box 85800, San Diego, CA 92138 ABSTRACT Interneurons in leech ganglia receive multiple sensory inputs and make synaptic contacts with many motor neurons. These "hidden" units coordinate several different behaviors. We used physiological and anatomical constraints to construct a model of the local bending reflex. Dynamical networks were trained on experimentally derived input-output patterns using recurrent back-propagation. Units in the model were modified to include electrical synapses and multiple synaptic time constants.
Learning in Higher-Order "Artificial Dendritic Trees
The computational territory between the linearly summing McCulloch-Pitts neuron and the nonlinear differential equations of Hodgkin & Huxley is relatively sparsely populated. Connectionists use variants of the former and computational neuroscientists struggle with the exploding parameter spaces provided by the latter. However, evidence from biophysical simulations suggests that the voltage transfer properties of synapses, spines and dendritic membranes involve many detailed nonlinear interactions, not just a squashing function at the cell body. Real neurons may indeed be higher-order nets. For the computationally-minded, higher order interactions means, first of all, quadratic terms. This contribution presents a simple learning principle for a binary tree with a logistic/quadratic transfer function at each node. These functions, though highly nested, are shown to be capable of changing their shape in concert. The resulting tree structure receives inputs at its leaves, and outputs an estimate of the probability that the input pattern is a member of one of two classes at the top.