Asimovian Adaptive Agents

The goal of this research is to develop agents that are adaptive and predictable and timely. At first blush, these three requirements seem contradictory. For example, adaptation risks introducing undesirable side effects, thereby making agents' behavior less predictable. Furthermore, although formal verification can assist in ensuring behavioral predictability, it is known to be time-consuming. Our solution to the challenge of satisfying all three requirements is the following. Agents have finite-state automaton plans, which are adapted online via evolutionary learning (perturbation) operators. To ensure that critical behavioral constraints are always satisfied, agents' plans are first formally verified. They are then reverified after every adaptation. If reverification concludes that constraints are violated, the plans are repaired. The main objective of this paper is to improve the efficiency of reverification after learning, so that agents have a sufficiently rapid response time. We present two solutions: positive results that certain learning operators are a priori guaranteed to preserve useful classes of behavioral assurance constraints (which implies that no reverification is needed for these operators), and efficient incremental reverification algorithms for those learning operators that have negative a priori results

Tight-fill fruit packing /

C54

Effects of High and Low Barometric Pressures on Susceptibility and Resistance to Infection Quarterly Status Report, 1 Jul. - 30 Sep. 1966

High and low barometric pressure effects on susceptibility and resistance to infectio

IMPROVING THE PERFORMANCE OF THE FOOD DISTRIBUTION INDUSTRY

Discusses the "productivity crisis" in the food industry and suggests positive and negative fluences on the situation during the 1970's.Productivity Analysis,

Computer program determines chemical equilibria in complex systems

Computer program numerically solves nonlinear algebraic equations for chemical equilibrium based on iteration equations independent of choice of components. This program calculates theoretical performance for frozen and equilibrium composition during expansion and Chapman-Jouguet flame properties, studies combustion, and designs hardware

Matroids with nine elements

We describe the computation of a catalogue containing all matroids with up to nine elements, and present some fundamental data arising from this cataogue. Our computation confirms and extends the results obtained in the 1960s by Blackburn, Crapo and Higgs. The matroids and associated data are stored in an online database, and we give three short examples of the use of this database.Comment: 22 page