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 127 records · Page 7

Artificial cells: prospects for biotechnology

A variety of techniques can now be used to alter the genome of a cell. Although these techniques are very powerful, they have limitations related to cost and efficiency of scale. Artificial cells designed for specific applications combine properties of biological systems such as nanoscale efficiency, self-organization and adaptability at relatively low cost. Individual components needed for such structures have already been developed, and now the main challenge is to integrate them in functional microscopic compartments. It will then become possible to design and construct communities of artificial cells that can perform different tasks related to therapeutic and diagnostic applications.

Review↗

Whole-cell biocomputing

The ability to manipulate systems on the molecular scale naturally leads to speculation about the rational design of molecular-scale machines. Cells might be the ultimate molecular-scale machines and our ability to engineer them is relatively advanced when compared with our ability to control the synthesis and direct the assembly of man-made materials. Indeed, engineered whole cells deployed in biosensors can be considered one of the practical successes of molecular-scale devices. However, these devices explore only a small portion of cellular functionality. Individual cells or self-organized groups of cells perform extremely complex functions that include sensing, communication, navigation, cooperation and even fabrication of synthetic nanoscopic materials. In natural systems, these capabilities are controlled by complex genetic regulatory circuits, which are only partially understood and not readily accessible for use in engineered systems. Here, we focus on efforts to mimic the functionality of man-made information-processing systems within whole cells.

Non-NASA Center↗

Shape-dependent control of cell growth, differentiation, and apoptosis: switching between attractors in cell regulatory networks

Development of characteristic tissue patterns requires that individual cells be switched locally between different phenotypes or "fates;" while one cell may proliferate, its neighbors may differentiate or die. Recent studies have revealed that local switching between these different gene programs is controlled through interplay between soluble growth factors, insoluble extracellular matrix molecules, and mechanical forces which produce cell shape distortion. Although the precise molecular basis remains unknown, shape-dependent control of cell growth and function appears to be mediated by tension-dependent changes in the actin cytoskeleton. However, the question remains: how can a generalized physical stimulus, such as cell distortion, activate the same set of genes and signaling proteins that are triggered by molecules which bind to specific cell surface receptors. In this article, we use computer simulations based on dynamic Boolean networks to show that the different cell fates that a particular cell can exhibit may represent a preprogrammed set of common end programs or "attractors" which self-organize within the cell's regulatory networks. In this type of dynamic network model of information processing, generalized stimuli (e.g., mechanical forces) and specific molecular cues elicit signals which follow different trajectories, but eventually converge onto one of a small set of common end programs (growth, quiescence, differentiation, apoptosis, etc.). In other words, if cells use this type of information processing system, then control of cell function would involve selection of preexisting (latent) behavioral modes of the cell, rather than instruction by specific binding molecules. Importantly, the results of the computer simulation closely mimic experimental data obtained with living endothelial cells. The major implication of this finding is that current methods used for analysis of cell function that rely on characterization of linear signaling pathways or clusters of genes with common activity profiles may overlook the most critical features of cellular information processing which normally determine how signal specificity is established and maintained in living cells. Copyright 2000 Academic Press.

Review↗

A Probabilistic Model for Simulating Magnetoacoustic Emission Responses in Ferromagnets

Magnetoacoustic emission (MAE) is a phenomenon where acoustic noise is generated due to the motion of non-180 magnetic domain walls in a ferromagnet with non-zero magnetostrictive constants. MAE has been studied extensively for many years and has even been applied as an NDE tool for characterizing the heat treatment of high-yield low carbon steels. A complete theory which fully accounts for the magnetoacoustic response, however, has not yet emerged. The motion of the domain walls appears to be a totally random process, however, it does exhibit features of regularity which have been identified by studying phenomena such as 1/f flicker noise and self-organized criticality (SOC). In this paper, a probabilistic model incorporating the effects of SOC has been developed to help explain the MAE response. The model uses many simplifying assumptions yet yields good qualitative agreement with observed experimental results and also provides some insight into the possible underlying mechanisms responsible for MAE. We begin by providing a brief overview of magnetoacoustic emission and the experimental set-up used to obtain the MAE signal. We then describe a pseudo-probabilistic model used to predict the MAE response and give an example of the predicted result. Finally, the model is modified to account for SOC and the new predictions are shown and compared with experiment.

Namkung, M.↗

Dissipating Step Bunches during Crystallization under Transport Control

In studies of crystal formation by the generation and spreading of layers, equidistant step trains are considered unstable---bunches and other spatiotemporal patterns of the growth steps are viewed as ubiquitous. We provide an example to the opposite. We monitor the spatiotemporal dynamics of steps and the resulting step patterns during crystallization of the proteins ferritin and apoferritin using the atomic force microscope. The variations in step velocity and density are not correlated, indicating the lack of a long-range attraction between the steps. We show that (i) because of its coupling to bulk transport, nucleation of new layers is chaotic and occurs at the facet edges, where the interfacial supersaturation is higher; (ii) step bunches self-organize via the competition for supply from the solution; and, (iii) bunches of weakly interacting steps decay as they move along the face. Tests by numerical modeling support the conclusions about the mechanisms underlying our observations. The results from these systems suggest that during crystallization controlled by transport, with weakly or noninteracting growth steps, the stable kinetic state of the surface is an equidistant step train, and step bunches only arise during nucleation of new layers. Since nucleation only occurs at a few sites on the surface, the surface morphology may be controllably patterned or smoothened by locally controlling nucleation.

Lin, Hong↗

Gene Expression Dynamics Inspector (GEDI): for integrative analysis of expression profiles

Genome-wide expression profiles contain global patterns that evade visual detection in current gene clustering analysis. Here, a Gene Expression Dynamics Inspector (GEDI) is described that uses self-organizing maps to translate high-dimensional expression profiles of time courses or sample classes into animated, coherent and robust mosaics images. GEDI facilitates identification of interesting patterns of molecular activity simultaneously across gene, time and sample space without prior assumption of any structure in the data, and then permits the user to retrieve genes of interest. Important changes in genome-wide activities may be quickly identified based on 'Gestalt' recognition and hence, GEDI may be especially useful for non-specialist end users, such as physicians. AVAILABILITY: GEDI v1.0 is written in Matlab, and binary Matlab.dll files which require Matlab to run can be downloaded for free by academic institutions at http://www.chip.org/~ge/gedihome.html Supplementary information: http://www.chip.org/~ge/gedihome.html.

Database Management Systems↗

'Heat from Above' Heat Capacity Measurements in Liquid He-4

We have made heat capacity measurements of superfluid He-4 at temperatures very close to the lambda point, T(sub lambda) , in a constant heat flux, Q, when the helium sample is heated from above. In this configuration the helium enters a self-organized (SOC) heat transport state at a temperature T(sub SOC)(Q), which for Q greater than or = 100 nW/sq cm lies below T(sub lambda). At low Q we observe little or no deviation from the bulk Q = 0 heat capacity up to T(sub SOC)(Q); beyond this temperature the heat capacity appears to be sharply depressed, deviating dramatically from its bulk behaviour. This marks the formation and propagation of a SOC/superfluid two phase state, which we confirm with a simple model. The excellent agreement between data and model serves as an independent confirmation of the existence of the SOC state. As Q is increased (up to 6 micron W/sq cm) we observe a Q dependant depression in the heat capacity that occurs just below T(sub SOC)(Q), when the entire sample is still superfluid. This is due to the emergence of a large thermal resistance in the sample, which we have measured and used to model the observed heat capacity depression. Our measurements of the superfluid thermal resistivity are a factor of ten larger than previous measurements by Baddar et al.

Lee, R. A. M.↗

Comparing morphologies of drainage basins on Mars and Earth using integral-geometry and neural maps

We compare morphologies of drainage basins on Mars and Earth in order to confine the formation process of Martian valley networks. Basins on both planets are computationally extracted from digital topography. Integral-geometry methods are used to represent each basin by a circularity function that encapsulates its internal structure. The shape of such a function is an indicator of the style of fluvial erosion. We use the self-organizing map technique to construct a similarity graph for all basins. The graph reveals systematic differences between morphologies of basins on the two planets. This dichotomy indicates that terrestrial and Martian surfaces were eroded differently. We argue that morphologies of Martian basins are incompatible with runoff from sustained, homogeneous rainfall. Fluvial environments compatible with observed morphologies are discussed. We also construct a similarity graph based on the comparison of basins hypsometric curves to demonstrate that hypsometry is incapable of discriminating between terrestrial and Martian basins. INDEX TERMS: 1824 Hydrology: Geomorphology (1625); 1886 Hydrology: Weathering (1625); 5415 Planetology: Solid Surface Planets: Erosion and weathering; 6225 Planetology: Solar System Objects Mars. Citation: Stepinski, T. F., and S. Coradetti (2004), Comparing morphologies of drainage basins on Mars and Earth using integral-ge

Stepinski, T. F.↗

Multipoint sensing by intelligent collectives

Many remote sensing applications require that multiple sensors collect data simultaneously at spatially distributed locations and their information combined in order to characterize the phenomena of interest. Several basic classes of such multipoint measurement systems may be identified. For each, centralized methods exist for combining the raw data from the various sensors. However, recent advancements have given rise to small, integrated nodes comprised of one or more miniaturized sensors, processor, wireless communications capability and power supplies. Collections of these may be deployed and self-organized into intelligent sensor networks capable of performing cooperative signal processing locally, thereby providing substantial benefits.

multipoint measurement sensor networks↗

Improved dot size uniformity and luminescense of InAs quantum dots on InP substrate

InAs self-organized quantum dots have been grown in InGaAs quantum well on InP substrates by metalorganic vapor phase epitaxy. Atomic Force Microscopy confirmed of quantum dot formation with dot density of 3X10(sup 10) cm(sup -2). Improved dot size uniformity and strong room temperature photoluminescence up to 2 micron were observed after modifying the InGaAs well.

InAs quantum dot↗

On Hardware Evolvability and Levels of Granularity

Evolvable hardware addresses hardware that self-organizes/reconfigures under the guidance of evolutionary mechanisms. Some experiments in evolving at transistor level are briefly presented and the perspective of trnsistors as functional approximators is suggested.

Granularity Hardware↗

Probability Simulations by Non-Lipschitz Chaos

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-Lipschitz dynamics, without utilization of any man-made devices. Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

classical dynamics classical probabilities probabi↗

Image and Video Compression with VLSI Neural Networks

An advanced motion-compensated predictive video compression system based on artificial neural networks has been developed to effectively eliminate the temporal and spatial redundancy of video image sequences and thus reduce the bandwidth and storage required for the transmission and recording of the video signal. The VLSI neuroprocessor for high-speed high-ratio image compression based upon a self-organization network and the conventional algorithm for vector quantization are compared. The proposed method is quite efficient and can achieve near-optimal results.

compression artificial neural networks VLSI↗

Simulations of Probabilities for Quantum Computing

It has been demonstrated that classical probabilities, and in particular, probabilistic Turing machine, can be simulated by combining chaos and non-LIpschitz dynamics, without utilization of any man-made devices (such as random number generators). Self-organizing properties of systems coupling simulated and calculated probabilities and their link to quantum computations are discussed.

Turing machines↗

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and weighted links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Weights are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗

Probabilistic resource allocation system with self-adaptive capability

A probabilistic resource allocation system is disclosed containing a low capacity computational module (Short Term Memory or STM) and a self-organizing associative network (Long Term Memory or LTM) where nodes represent elementary resources, terminal end nodes represent goals, and directed links represent the order of resource association in different allocation episodes. Goals and their priorities are indicated by the user, and allocation decisions are made in the STM, while candidate associations of resources are supplied by the LTM based on the association strength (reliability). Reliability values are automatically assigned to the network links based on the frequency and relative success of exercising those links in the previous allocation decisions. Accumulation of allocation history in the form of an associative network in the LTM reduces computational demands on subsequent allocations. For this purpose, the network automatically partitions itself into strongly associated high reliability packets, allowing fast approximate computation and display of allocation solutions satisfying the overall reliability and other user-imposed constraints. System performance improves in time due to modification of network parameters and partitioning criteria based on the performance feedback.

Yufik, Yan M.↗