Engineering Papers⌕ Search

SEARCH · Engineering Papers

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.

At least 433 records · Page 24

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↗

Planetary environments and the conditions of life

Geophysical models of the first 600 Ma ofthe earth's history following accretion and core formation point to a period of great environmental disequilibrium. In such an environment, the passage of energy from the earth's interior and from the sun through gas-liquid-solid domains and their boundaries with each other generated a dynamically interacting, complex hierarchy of self-organized structures ranging from bubbles at the sea-air interface to tectonic plates. The ability of a planet to produce such a hierarchy is speculated to be a prerequisite to the origin and sustenance of life. The application of this criterion to Mars argues against the origin of Martian life.

Chang, S.↗

Oligomerization of deoxynucleoside-biphosphate dimers - Template and linkage specificity

The oligomerization of the activated 3-prime-5-prime pyrophosphate-linked dimer, pdAppdAp, is presently noted to be selectively favored by a poly(U) template over the 3-prime-3-prime and 5-prime-5-prime linked dimers. Both overall yields and the production of the longest oligomers were markedly stimulated by poly(U)'s presence; in its absence, the 5-prime-5-prime linked dimer became the most reactive, yielding chains of the order of 60 monomer-unit lengths. Remarkable self-organization properties are noted for the 5-prime-5-prime dimer of pdAp.

Visscher, J.↗

Terminal attractors in neural networks

A new type of attractor (terminal attractors) for content-addressable memory, associative memory, and pattern recognition in artificial neural networks operating in continuous time is introduced. The idea of a terminal attractor is based upon a violation of the Lipschitz condition at a fixed point. As a result, the fixed point becomes a singular solution which envelopes the family of regular solutions, while each regular solution approaches such an attractor in finite time. It will be shown that terminal attractors can be incorporated into neural networks such that any desired set of these attractors with prescribed basins is provided by an appropriate selection of the synaptic weights. The applications of terminal attractors for content-addressable and associative memories, pattern recognition, self-organization, and for dynamical training are illustrated.

Zak, Michail↗

Distributed memory approaches for robotic neural controllers

The suitability is explored of two varieties of distributed memory neutral networks as trainable controllers for a simulated robotics task. The task requires that two cameras observe an arbitrary target point in space. Coordinates of the target on the camera image planes are passed to a neural controller which must learn to solve the inverse kinematics of a manipulator with one revolute and two prismatic joints. Two new network designs are evaluated. The first, radial basis sparse distributed memory (RBSDM), approximates functional mappings as sums of multivariate gaussians centered around previously learned patterns. The second network types involved variations of Adaptive Vector Quantizers or Self Organizing Maps. In these networks, random N dimensional points are given local connectivities. They are then exposed to training patterns and readjust their locations based on a nearest neighbor rule. Both approaches are tested based on their ability to interpolate manipulator joint coordinates for simulated arm movement while simultaneously performing stereo fusion of the camera data. Comparisons are made with classical k-nearest neighbor pattern recognition techniques.

Jorgensen, Charles C.↗

Integrated communication and information fabric for space applications

The results of preliminary research into infrastructures for integrated communication and information fabrics, which can meet the needs of space applications of the future, are presented. Technologies that foster scaleability and adaptability and support self-organizing mechanisms are needed to effectively integrate the working fabric of a large-scale distributed system. A multigrid network architecture that uses a completely distributed packet-routing scheme is derived. The first part of the paper introduces a simple model of a communication and information system for space applications, the second discusses the known limitations of the large-scale future communication and information systems, and the third part describes the results of preliminary research in this area. It is expected that this technology will result in inexpensive networks utilizing multigigabit-per-second data links.

Maitan, J.↗

A multidisciplinary approach to the development of low-cost high-performance lightwave networks

Our research focuses on high-speed distributed systems. We anticipate that our results will allow the fabrication of low-cost networks employing multi-gigabit-per-second data links for space and military applications. The recent development of high-speed low-cost photonic components and new generations of microprocessors creates an opportunity to develop advanced large-scale distributed information systems. These systems currently involve hundreds of thousands of nodes and are made up of components and communications links that may fail during operation. In order to realize these systems, research is needed into technologies that foster adaptability and scaleability. Self-organizing mechanisms are needed to integrate a working fabric of large-scale distributed systems. The challenge is to fuse theory, technology, and development methodologies to construct a cost-effective, efficient, large-scale system.

Maitan, Jacek↗

Cosmic instability from radiation pressure

The Cosmic Background Explorer has recently confirmed the blackbody character of the microwave background to high accuracy (Mather et al., 1990), and will have the capability to detect other cosmic backgrounds throughout the infrared. A detection of cosmic background radiation dating from the pregalactic era would have important consequences for theories of cosmic structure. During the creation of such a background the pressure of the radiation itself causes an instability which leads inevitably to the growth of large-scale structure in the matter distribution. In contrast to conventional gravitational-instability models, the statistical properties of this structure are determined primarily by the self-organizing dynamics of the instability rather than details of cosmological initial conditions. The behavior of the instability is described here.

Hogan, Craig J.↗

Path integrals, differential renormalization-group, and stochastic systems near criticality

It is demonstrated, using the techniques of path integrals and renormalization-group, that nonlinear stochastic systems near criticality (including self-organized criticality) generally exhibit low-dimensional behavior. The symmetry which characterizes a particular criticality can be broken by the appearance of relevant scaling fields. A connection is made between the fractal dimensions of finite-dimensional chaotic systems and the anomalous dimensions in stochastic systems near criticality. The effect of additional random noise on stochastic systems is also delineated.

Chang, Tom↗

Two generalizations of Kohonen clustering

The relationship between the sequential hard c-means (SHCM), learning vector quantization (LVQ), and fuzzy c-means (FCM) clustering algorithms is discussed. LVQ and SHCM suffer from several major problems. For example, they depend heavily on initialization. If the initial values of the cluster centers are outside the convex hull of the input data, such algorithms, even if they terminate, may not produce meaningful results in terms of prototypes for cluster representation. This is due in part to the fact that they update only the winning prototype for every input vector. The impact and interaction of these two families with Kohonen's self-organizing feature mapping (SOFM), which is not a clustering method, but which often leads ideas to clustering algorithms is discussed. Then two generalizations of LVQ that are explicitly designed as clustering algorithms are presented; these algorithms are referred to as generalized LVQ = GLVQ; and fuzzy LVQ = FLVQ. Learning rules are derived to optimize an objective function whose goal is to produce 'good clusters'. GLVQ/FLVQ (may) update every node in the clustering net for each input vector. Neither GLVQ nor FLVQ depends upon a choice for the update neighborhood or learning rate distribution - these are taken care of automatically. Segmentation of a gray tone image is used as a typical application of these algorithms to illustrate the performance of GLVQ/FLVQ.

Bezdek, James C.↗

Towards autonomous fuzzy control

The efficient implementation of on-line adaptation in real time is an important research problem in fuzzy control. The goal is to develop autonomous self-organizing controllers employing system-independent control meta-knowledge which enables them to adjust their control policies depending on the systems they control and the environments in which they operate. An autonomous fuzzy controller would continuously observe system behavior while implementing its control actions and would use the outcomes of these actions to refine its control policy. It could be designed to lie dormant when its control actions give rise to adequate performance characteristics but could rapidly and autonomously initiate real-time adaptation whenever its performance degrades. Such an autonomous fuzzy controller would have immense practical value. It could accommodate individual variations in system characteristics and also compensate for degradations in system characteristics caused by wear and tear. It could also potentially deal with black-box systems and control scenarios. On-going research in autonomous fuzzy control is reported. The ultimate research objective is to develop robust and relatively inexpensive autonomous fuzzy control hardware suitable for use in real time environments.

Shenoi, Sujeet↗

Low-dimensional behavior and symmetry breaking of stochastic systems near criticality - Can these effects be observed in space and in the laboratory?

We demonstrate that nonlinear stochastic systems near criticality (including forced and self-organized criticality) will generally exhibit low-dimensional behavior. We give a connection between the fractal dimensions of finite-dimensional chaotic systems and the anomalous dimensions in stochastic systems near criticality. The effect of additional random noise on stochastic systems will be delineated in terms of the crossover phenomenon between competing criticalities. The possibility of observing such effects in space (such as the onset of substorms) and in the laboratory (such as stochastic particle heating in 'noisy' magnetic fields) will be discussed.

Chang, Tom↗

A new neural net approach to robot 3D perception and visuo-motor coordination

A novel neural network approach to robot hand-eye coordination is presented. The approach provides a true sense of visual error servoing, redundant arm configuration control for collision avoidance, and invariant visuo-motor learning under gazing control. A 3-D perception network is introduced to represent the robot internal 3-D metric space in which visual error servoing and arm configuration control are performed. The arm kinematic network performs the bidirectional association between 3-D space arm configurations and joint angles, and enforces the legitimate arm configurations. The arm kinematic net is structured by a radial-based competitive and cooperative network with hierarchical self-organizing learning. The main goal of the present work is to demonstrate that the neural net representation of the robot 3-D perception net serves as an important intermediate functional block connecting robot eyes and arms.

Lee, Sukhan↗

Analysis of regional deformation and strain accumulation data adjacent to the San Andreas fault

A new approach to the understanding of crustal deformation was developed under this grant. This approach combined aspects of fractals, chaos, and self-organized criticality to provide a comprehensive theory for deformation on distributed faults. It is hypothesized that crustal deformation is an example of comminution: Deformation takes place on a fractal distribution of faults resulting in a fractal distribution of seismicity. Our primary effort under this grant was devoted to developing an understanding of distributed deformation in the continental crust. An initial effort was carried out on the fractal clustering of earthquakes in time. It was shown that earthquakes do not obey random Poisson statistics, but can be approximated in many cases by coupled, scale-invariant fractal statistics. We applied our approach to the statistics of earthquakes in the New Hebrides region of the southwest Pacific because of the very high level of seismicity there. This work was written up and published in the Bulletin of the Seismological Society of America. This approach was also applied to the statistics of the seismicity on the San Andreas fault system.

Turcotte, Donald L.↗

A petabyte size electronic library using the N-Gram memory engine

A model library containing petabytes of data is proposed by Triada, Ltd., Ann Arbor, Michigan. The library uses the newly patented N-Gram Memory Engine (Neurex), for storage, compression, and retrieval. Neurex splits data into two parts: a hierarchical network of associative memories that store 'information' from data and a permutation operator that preserves sequence. Neurex is expected to offer four advantages in mass storage systems. Neurex representations are dense, fully reversible, hence less expensive to store. Neurex becomes exponentially more stable with increasing data flow; thus its contents and the inverting algorithm may be mass produced for low cost distribution. Only a small permutation operator would be recalled from the library to recover data. Neurex may be enhanced to recall patterns using a partial pattern. Neurex nodes are measures of their pattern. Researchers might use nodes in statistical models to avoid costly sorting and counting procedures. Neurex subsumes a theory of learning and memory that the author believes extends information theory. Its first axiom is a symmetry principle: learning creates memory and memory evidences learning. The theory treats an information store that evolves from a null state to stationarity. A Neurex extracts information data without a priori knowledge; i.e., unlike neural networks, neither feedback nor training is required. The model consists of an energetically conservative field of uniformly distributed events with variable spatial and temporal scale, and an observer walking randomly through this field. A bank of band limited transducers (an 'eye'), each transducer in a bank being tuned to a sub-band, outputs signals upon registering events. Output signals are 'observed' by another transducer bank (a mid-brain), except the band limit of the second bank is narrower than the band limit of the first bank. The banks are arrayed as n 'levels' or 'time domains, td.' The banks are the hierarchical network (a cortex) and transducers are (associative) memories. A model Neurex was built and studied. Data were 50 MB to 10 GB samples of text, data base, and images: black/white, grey scale, and high resolution in several spectral bands. Memories at td, S(m(sub td)), were plotted against outputs of memories at td-1. S(m(sub td)) was Boltzman distributed, and memory frequencies exhibited self-organized criticality (SOC); i.e., 'l/f(sup beta)' after long exposures to data. Whereas output signals from level n may be encoded with B(sub output) = O(-log(2)f(sup beta)) bits, and input data encoded with B(sub input) = O((S(td)/S(td-1))(sup n)), B(sup output)/B(sub input) is much less than 1 always, the Neurex determines a canonical code for data and it is a lossless data compressor. Further tests are underway to confirm these results with more data types and larger samples.

Bugajski, Joseph M.↗