Artificial neural networks for coordination and control: The portability of experiential representations

It is time to locate connectionist representation theory in the new wave of robotics research. The utility of representations developed in artificial neural networks (ANNs) during learning has been demonstrated in cognitive science research since the 1980s. The research reported here puts learned representations to work in a decentered control task, the disembodied arm problem, in which a mobile robot operates an arm fixed to a table to pick up objects. There is no physical linkage between the arm and the robot and so the robot's point of view must be decentered. This is done by developing a modular Artificial Neural Net system in three stages: (i) a classifier net is trained with laser scan data to output transformationally invariant position classes; (ii) an arm net is trained for picking up objects; (iii) an inter net is trained to communicate and coordinate the sensing and acting. The completed system is shown to create new nonsymbolic transformationally invariant representations in order to perform the effective generalization of decentered viewpoints.     

A prolog based expert system for the allocation of quality assurance program resources

The worldwide proliferation of fraudulent materials has brought about the need for a new approach to the control of purchased material quality. Nuclear power, defense, aerospace and many other industries are affected by the supply of poor quality clones that presume to be original replacement parts. Safety considerations abound as these highly defective materials are used in systems that are critical to the preservation of human lives. Commonly utilized quality assurance programs have not effectively stopped the influx of fraudulent materials. These programs fail to concentrate inspection efforts on materials and inspection attributes that would effectively prevent the acceptance of fraudulent materials. herein a solution is presented to this problem in the form of an expert system application. Information commonly available in industry is formulated into a knowledge based system wherein advisories are given to the user regarding key purchased material receipt inspection strategies.     

Markov analysis of qualitative dynamics1

Common sense sometimes predicts events to be likely or unlikely rather than merely possible. We extend methods of qualitative reasoning to predict the relative likelihoods of possible qualitative behaviors by viewing the dynamics of a system as a Markov chain over its transition graph. This involves adding qualitative or quantitative estimates of transition probabilities to each of the transitions and applying the standard theory of Markov chains to distinguish persistent states from transient states and to calculate recurrence times, settling times, and probabilities for ending up in each state. Much of the analysis depends solely on qualitative estimates of transition probabilities, which follow directly from theoretical considerations and which lead to qualitative predictions about entire classes of systems. Quantitative estimates for specific systems are derived empirically and lead to qualitative and quantitative conclusions, most of which are insensitive to small perturbations in the estimated transition probabilities. The algorithms are straightforward and efficient.     

电缆气压保气率计算机统计系统

介绍了电缆气压保气率计算机统计系统开发的目的和意义，系统程序的流程和结构，以及系统程序的编制和应用。     

Some factors affecting the electrical properties of carbon-black-loaded butyl rubber during vulcanization

Butyl rubber mixtures loaded with 70 phr general purpose furnace black (GPF) and tetramethyl thiuram disulphide (TMTD)/S as vulcanizing system were prepared. The kinetics of their electrical conductivity development during the vulcanization process were followed by using an especially devised system. It was found that the increase in the electrical conductivity during vulcanization obeys an exponential growth function with time constant τ, which markedly decreases with increasing vulcanization temperature as well as with the efficiency of the vulcanizing system. After completion of the vulcanization process, about 80 min, the samples obtained possess reasonable stability and reproducibility of electrical conductivity.     

Issues in nonlinear stochastic grey box identification

Grey box identification refers to the practice of identifying dynamical systems in model structures exploiting partial prior information. This contribution reviews a method for stochastic grey box identification and surveys experiences and lessons of applying it to a number of industrial processes. Issues to be addressed include advantages and costs of introducing stochastics into the model, the question of what contribution must be expected from the model designer as opposed to what can be formalized in computer algorithms, and an outlook on future plans to resolve present shortcomings.     

An efficient heuristic for scheduling batches of parts in a flexible flow system

Flexible manufacturing systems (FMSs) are a class of automated systems that can be used to improve productivity in batch manufacturing. Four stages of decision making have been defined for an FMS—the design, planning, scheduling, and control stages. This research focuses on the planning stage, and specifically in the area of scheduling batches of parts through the system.The literature to date on the FMS planning stage has mostly focused on the machine grouping, tool loading, and parttype selection problems. Our research carries the literature a step further by addressing the problem of scheduling batches of parts. Due to the use of serial-access material-handling systems in many FMSs, the batch-scheduling problem is modeled for a flexible flow system (FFS). This model explicitly accounts for setup times between batches that are dependent on their processing sequence.A heuristic procedure is developed for this batch-scheduling problem—the Maximum Savings (MS) heuristic. The MS heuristic is based upon the savings in time associated with a particular sequence and selecting the one with the maximum savings. It uses a two-phase method, with the savings being calculated in phase I, while a branch-and-bound procedure is employed to seek the best heuristic solution in phase II. Extensive computational results are provided for a wide variety of problems. The results show that the MS heuristic provides good-quality solutions.     

Asymptotic stabilization of some equilibria of an underactuated underwater vehicle

The stabilization problem for selected relative equilibria of an underactuated rigid body, modelling a simple underwater vehicle, moving in an ideal fluid is addressed. State feedback control laws achieving local asymptotic stability of a forward motion and of a diving/rising with forward/reverse motion are proposed. The control design exploits the Hamiltonian nature of the system to be controlled and it is based on the so-called interconnection and damping assignment (IDA) procedure. Simulation results complete the work.     

Intelligent SQL

Intelligent SQL is an intelligent database engine interface language which incorporates object-oriented, inferencing, and multi-media constructs. It is intended to be a powerful extension of existing SQL dialects. It also provides querying capabilities for object-oriented databases. Intelligent SQL was prototyped at Ashton-Tate. This paper discusses the main features of Intelligent SQL.     

Self-learning inductive inference machines

Self-knowledge is a concept that is present in several philosophies. In this article, we consider the issue of whether or not a learning algorithm can in some sense possess self-knowledge. The question is answered affirmatively. Self-learning inductive inference algorithms are taken to be those that learn programs for their own algorithms, in addition to other functions.
La connaissance de soi est un concept qui se retrouve dans plusieurs philosophies. Dans cet article, les auteurs s'interrogent à savoir si un algorithme d' apprentissage peut dans une certaine mesure posséder la connaissance de soi. lis apportent une reponse positive a cette question. Les algorithmes d'inference inductive autodidactes sont ceux qui font l'apprentissage de programmes pour leurs propres algorithmes, en plus d' autres fonctions.