On-line self-organizing control of multiple- goal, multiple-actuator systems.
Synthesis and design of on-line self-organizing control of multiple goal, multiple actuator systems
ON-LINE PROGRAMMING↗
SEARCH · Search NASA
Results for “self-organization”
Search indexed NASA NTRS and DOE OSTI research on propulsion, heat transfer, battery materials and energy systems. Follow report and document links to the original sources.
Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.
Self-organization of the protocell was a forward process
Yockey's (1981) interpretation of information theory relative to concepts of self-organization in the origin of life is criticized on the ground that it assumes that each amino acid residue type in a given sequence is an unaided information carrier throughout evolution. It is argued that more than one amino acid residue can act as a unit information carrier, and that this was the case in prebiotic protein evolution. Forward-extrapolation should be used to study prebiotic evolution, not backward-extrapolation. Transposing the near-random internal order of modern proteins to primitive proteins, as Yockey has done, is an unsupported assumption and disagrees with the results of experimental models of the primordial type. Studies indicate that early primary information carriers in evolution were mixtures of free alpha amino acids which necessarily had the capability of sequencing themselves.
Fox, S. W.↗
Self-organizing and learning control systems.
Self organizing and learning control systems, adaptive systems theory and defining self organizing control systems
Barron, R. L.↗
Abiotic polymerization and self-organization.
Cell origin in self organizing natural polymers in terms of molecular evolutionary priority of polynucleotides and poly alpha amino acids
Fox, S. W.↗
Self-organizing approach to the stochastic fuel regulator problem
Stochastic control optimization, examining self organizing approach for performance adaptive controller with asymptotic optimal properties
Gilbert, H. D.↗
Study to develop techniques for a self-organizing computer
The main emphasis has been on the programming language for a self organizing computer. An example of programming with the language of finite state machines is presented in a real time processing for weather radars.
Schaffner, M. R.↗
Research-study of a self-organizing computer
It is shown that a self organizing system has two main components: an organizable physical part, and a programing part. This report presents the organizable part in the form of a programable hardware and its programing language.
Schaffner, M. R.↗
Computer program documentation: ISOCLS iterative self-organizing clustering program, program C094
The author has identified the following significant results. This program implements an algorithm which, ideally, sorts a given set of multivariate data points into similar groups or clusters. The program is intended for use in the evaluation of multispectral scanner data; however, the algorithm could be used for other data types as well. The user may specify a set of initial estimated cluster means to begin the procedure, or he may begin with the assumption that all the data belongs to one cluster. The procedure is initiatized by assigning each data point to the nearest (in absolute distance) cluster mean. If no initial cluster means were input, all of the data is assigned to cluster 1. The means and standard deviations are calculated for each cluster.
Minter, R. T.↗
The CLASSY clustering algorithm: Description, evaluation, and comparison with the iterative self-organizing clustering system (ISOCLS)
A clustering method, CLASSY, was developed, which alternates maximum likelihood iteration with a procedure for splitting, combining, and eliminating the resulting statistics. The method maximizes the fit of a mixture of normal distributions to the observed first through fourth central moments of the data and produces an estimate of the proportions, means, and covariances in this mixture. The mathematical model which is the basic for CLASSY and the actual operation of the algorithm is described. Data comparing the performances of CLASSY and ISOCLS on simulated and actual LACIE data are presented.
Lennington, R. K.↗
An application of adaptive learning to malfunction recovery
A self-organizing controller is developed for a simplified two-dimensional aircraft model. The Controller learns how to pilot the aircraft through a navigational mission without exceeding pre-established position and velocity limits. The controller pilots the aircraft by activating one of eight directional actuators at all times. By continually monitoring the aircraft's position and velocity with respect to the mission, the controller progressively modifies its decision rules to improve the aircraft's performance. When the controller has learned how to pilot the aircraft, two actuators fail permanently. Despite this malfunction, the controller regains proficiency at its original task. The experimental results reported show the controller's capabilities for self-organizing control, learning, and malfunction recovery.
Cruz, R. E.↗
Adaptive parallel logic networks
Adaptive, self-organizing concurrent systems (ASOCS) that combine self-organization with massive parallelism for such applications as adaptive logic devices, robotics, process control, and system malfunction management, are presently discussed. In ASOCS, an adaptive network composed of many simple computing elements operating in combinational and asynchronous fashion is used and problems are specified by presenting if-then rules to the system in the form of Boolean conjunctions. During data processing, which is a different operational phase from adaptation, the network acts as a parallel hardware circuit.
Martinez, Tony R.↗
Survey of learning control systems for space vehicle applications.
On-line and off-line self-organizing control systems for space vehicle application
CONTROL SYSTEM↗
Hysteresis and macromolecular memory
Hysteresis and macromolecular memory, and memory device requirements as part of cybernetic self-organizing systems
MACROMOLECULE↗
Computers formed by the problems rather than problems deformed by the computers.
Description of an approach to computer programming which tries to minimize the time required for retranslation from the computer language into the language of the original process. A notion of a programmable network is introduced which allows the abstract machines that are a model of the processes in the user's mind to be put into a rigorous and simple form. Each process is then modeled as a particular finite-state machine, a circulating page loose system being employed as an architecture for implementing these finite-state machines. An experiment is discussed in which the use of abstract machines as a language for modeling processes, in conjunction with the use of a self-organizing computer, decreases user effort, eliminates the need for compilation, facilitates debugging, and decreases computer time.
Schaffner, M. R.↗
Effect of various features on the life cycle cost of the timing/synchronization subsystem of the DCS digital communications network
The effect on the life cycle cost of the timing subsystem was examined, when these optional features were included in various combinations. The features included mutual control, directed control, double-ended reference links, independence of clock error measurement and correction, phase reference combining, self-organization, smoothing for link and nodal dropouts, unequal reference weightings, and a master in a mutual control network. An overall design of a microprocessor-based timing subsystem was formulated. The microprocessor (8080) implements the digital filter portion of a digital phase locked loop, as well as other control functions such as organization of the network through communication with processors at neighboring nodes.
Kimsey, D. B.↗
CLASSY: An adaptive maximum likelihood clustering algorithm
The CLASSY clustering method alternates maximum likelihood iterative techniques for estimating the parameters of a mixture distribution with an adaptive procedure for splitting, combining, and eliminating the resultant components of the mixture. The adaptive procedure is based on maximizing the fit of a mixture of multivariate normal distributions to the observed data using its first through fourth central moments. It generates estimates of the number of multivariate normal components in the mixture as well as the proportion, mean vector, and covariance matrix for each component. The basic mathematical model for CLASSY and the actual operation of the algorithm as currently implemented are described. Results of applying CLASSY to real and simulated LANDSAT data are presented and compared with those generated by the iterative self-organizing clustering system algorithm on the same data sets.
Lennington, R. K.↗
An evaluation of ISOCLS and CLASSY clustering algorithms for forest classification in northern Idaho
Both the iterative self-organizing clustering system (ISOCLS) and the CLASSY algorithms were applied to forest and nonforest classes for one 1:24,000 quadrangle map of northern Idaho and the classification and mapping accuracies were evaluated with 1:30,000 color infrared aerial photography. Confusion matrices for the two clustering algorithms were generated and studied to determine which is most applicable to forest and rangeland inventories in future projects. In an unsupervised mode, ISOCLS requires many trial-and-error runs to find the proper parameters to separate desired information classes. CLASSY tells more in a single run concerning the classes that can be separated, shows more promise for forest stratification than ISOCLS, and shows more promise for consistency. One major drawback to CLASSY is that important forest and range classes that are smaller than a minimum cluster size will be combined with other classes. The algorithm requires so much computer storage that only data sets as small as a quadrangle can be used at one time.
Werth, L. F.↗
Intelligent signal analysis and recognition
Progress in the research and development of self-organizing database system that can support the identification and characterization of signals in an RF environment is described. As the radio frequency spectrum becomes more crowded, there are a number of situations that require a characterization of the RF environment. This database system is designed to be practical in applications where communications and other instruments encounter a time varying and complex RF environment. The primary application of this system is the guidance and control of NASA's SETI Microwave Observing Project. Other possible applications include selection of telemety bands for communication with spacecraft, and the scheduling of antenna for radio astronomy are two examples where characterization of the RF environment is required. In these applications, the RF environment is constantly changing, and even experienced operators cannot quickly identify the multitude of signals that can be encountered. Some of these signals are repetitive, others appear to occur sporadically.
Levinson, Robert↗