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 235 records · Page 13

Autonomous Information Unit: Why Making Data Smart Can also Make Data Secured?

In this paper, we introduce a new fine-grain distributed information protection mechanism which can self-protect, self-discover, self-organize, and self-manage. In our approach, we decompose data into smaller pieces and provide individualized protection. We also provide a policy control mechanism to allow 'smart' access control and context based re-assembly of the decomposed data. By combining smart policy with individually protected data, we are able to provide better protection of sensitive information and achieve more flexible access during emergency conditions. As a result, this new fine-grain protection mechanism can enable us to achieve better solutions for problems such as distributed information protection and identity theft.

data security↗

Identification and Control of Aircrafts using Multiple Models and Adaptive Critics

We compared two possible implementations of local linear models for control: one approach is based on a self-organizing map (SOM) to cluster the dynamics followed by a set of linear models operating at each cluster. Therefore the gating function is hard (a single local model will represent the regional dynamics). This simplifies the controller design since there is a one to one mapping between controllers and local models. The second approach uses a soft gate using a probabilistic framework based on a Gaussian Mixture Model (also called a dynamic mixture of experts). In this approach several models may be active at a given time, we can expect a smaller number of models, but the controller design is more involved, with potentially better noise rejection characteristics. Our experiments showed that the SOM provides overall best performance in high SNRs, but the performance degrades faster than with the GMM for the same noise conditions. The SOM approach required about an order of magnitude more models than the GMM, so in terms of implementation cost, the GMM is preferable. The design of the SOM is straight forward, while the design of the GMM controllers, although still reasonable, is more involved and needs more care in the selection of the parameters. Either one of these locally linear approaches outperform global nonlinear controllers based on neural networks, such as the time delay neural network (TDNN). Therefore, in essence the local model approach warrants practical implementations. In order to call the attention of the control community for this design methodology we extended successfully the multiple model approach to PID controllers (still today the most widely used control scheme in the industry), and wrote a paper on this subject. The echo state network (ESN) is a recurrent neural network with the special characteristics that only the output parameters are trained. The recurrent connections are preset according to the problem domain and are fixed. In a nutshell, the states of the reservoir of recurrent processing elements implement a projection space, where the desired response is optimally projected. This architecture trades training efficiency by a large increase in the dimension of the recurrent layer. However, the power of the recurrent neural networks can be brought to bear on practical difficult problems. Our goal was to implement an adaptive critic architecture implementing Bellman s approach to optimal control. However, we could only characterize the ESN performance as a critic in value function evaluation, which is just one of the pieces of the overall adaptive critic controller. The results were very convincing, and the simplicity of the implementation was unparalleled.

Principe, Jose C.↗

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.↗

Dependence of Microelastic-plastic Nonlinearity of Martensitic Stainless Steel on Fatigue Damage Accumulation

Self-organized substructural arrangements of dislocations formed in wavy slip metals during cyclic stress-induced fatigue produce substantial changes in the material microelastic-plastic nonlinearity, a quantitative measure of which is the nonlinearity parameter Beta extracted from acoustic harmonic generation measurements. The contributions to Beta from the substructural evolution of dislocations and crack growth for fatigued martensitic 410Cb stainless steel are calculated from the Cantrell model as a function of percent full fatigue life to fracture. A wave interaction factor f(sub WI) is introduced into the model to account experimentally for the relative volume of material fatigue damage included in the volume of material swept out by an interrogating acoustic wave. For cyclic stress-controlled loading at 551 MPa and f(sub WI) = 0.013 the model predicts a monotonic increase in Beta from dislocation substructures of almost 100 percent from the virgin state to roughly 95 percent full life. Negligible contributions from cracks are predicted in this range of fatigue life. However, over the last five percent of fatigue life the model predicts a rapid monotonic increase of Beta by several thousand percent that is dominated by crack growth. The theoretical predictions are in good agreement with experimental measurements of 410Cb stainless steel samples fatigued in uniaxial, stress-controlled cyclic loading at 551 MPa from zero to full tensile load with a measured f(sub WI) of 0.013.

Cantrell, John H.↗

A Data Type for Efficient Representation of Other Data Types

A self-organizing, monomorphic data type denoted a sequence has been conceived to address certain concerns that arise in programming parallel computers. A sequence in the present sense can be regarded abstractly as a vector, set, bag, queue, or other construct. Heretofore, in programming a parallel computer, it has been necessary for the programmer to state explicitly, at the outset, what parts of the program and the underlying data structures must be represented in parallel form. Not only is this requirement not optimal from the perspective of implementation; it entails an additional requirement that the programmer have intimate understanding of the underlying parallel structure. The present sequence data type overcomes both the implementation and parallel structure obstacles. In so doing, the sequence data type provides unified means by which the programmer can represent a data structure for natural and automatic decomposition to a parallel computing architecture. Sequences exhibit the behavioral and structural characteristics of vectors, but the underlying representations are automatically synthesized from combinations of programmers advice and execution use metrics. Sequences can vary bidirectionally between sparseness and density, making them excellent choices for many kinds of algorithms. The novelty and benefit of this behavior lies in the fact that it can relieve programmers of the details of implementations. The creation of a sequence enables decoupling of a conceptual representation from an implementation. The underlying representation of a sequence is a hybrid of representations composed of vectors, linked lists, connected blocks, and hash tables. The internal structure of a sequence can automatically change from time to time on the basis of how it is being used. Those portions of a sequence where elements have not been added or removed can be as efficient as vectors. As elements are inserted and removed in a given portion, then different methods are utilized to provide both an access and memory strategy that is optimized for that portion and the use to which it is put.

James, Mark↗

Fabricating Nanodots using Lift-Off of a Nanopore Template

A process for fabricating a planar array of dots having characteristic dimensions of the order of several nanometers to several hundred nanometers involves the formation and use of a thin alumina nanopore template on a semiconductor substrate. The dot material is deposited in the nanopores, then the template is lifted off the substrate after the dots have been formed. This process is expected to be a basis for development of other, similar nanofabrication processes for relatively inexpensive mass production of nanometerscale optical, optoelectronic, electronic, and magnetic devices. Alumina nanopore templates are self-organized structures that result from anodization of aluminum under appropriate conditions. Alumina nanopore templates have been regarded as attractive for use in fabricating the devices mentioned above, but prior efforts to use alumina nanopore templates for this purpose have not been successful. One reason for the lack of success is that the aspect ratios (ratios between depth and diameter) of the pores have been too large: large aspect ratios can result in blockage of deposition and/or can prevent successful lift-off. The development of the present process was motivated partly by a requirement to reduce aspect ratios to values (of the order of 10) for which there is little or no blockage of deposition and attempts at lift-off are more likely to be successful. The fabrication process is outlined.

Yang, Eui-Hyeok↗

Distributed Trajectory Flexibility Preservation for Traffic Complexity Mitigation

The growing demand for air travel is increasing the need for mitigation of air traffic congestion and complexity problems, which are already at high levels. At the same time new information and automation technologies are enabling the distribution of tasks and decisions from the service providers to the users of the air traffic system, with potential capacity and cost benefits. This distribution of tasks and decisions raises the concern that independent user actions will decrease the predictability and increase the complexity of the traffic system, hence inhibiting and possibly reversing any potential benefits. In answer to this concern, the authors propose the introduction of decision-making metrics for preserving user trajectory flexibility. The hypothesis is that such metrics will make user actions naturally mitigate traffic complexity. In this paper, the impact of using these metrics on traffic complexity is investigated. The scenarios analyzed include aircraft in en route airspace with each aircraft meeting a required time of arrival in a one-hour time horizon while mitigating the risk of loss of separation with the other aircraft, thus preserving its trajectory flexibility. The experiments showed promising results in that the individual trajectory flexibility preservation induced self-separation and self-organization effects in the overall traffic situation. The effects were quantified using traffic complexity metrics based on Lyapunov exponents and traffic proximity.

Idris, Husni↗

Analysis of Trajectory Flexibility Preservation Impact on Traffic Complexity

The growing demand for air travel is increasing the need for mitigation of air traffic congestion and complexity problems, which are already at high levels. At the same time new information and automation technologies are enabling the distribution of tasks and decisions from the service providers to the users of the air traffic system, with potential capacity and cost benefits. This distribution of tasks and decisions raises the concern that independent user actions will decrease the predictability and increase the complexity of the traffic system, hence inhibiting and possibly reversing any potential benefits. In answer to this concern, the authors proposed the introduction of decision-making metrics for preserving user trajectory flexibility. The hypothesis is that such metrics will make user actions naturally mitigate traffic complexity. In this paper, the impact of using these metrics on traffic complexity is investigated. The scenarios analyzed include aircraft in en route airspace with each aircraft meeting a required time of arrival in a one-hour time horizon while mitigating the risk of loss of separation with the other aircraft, thus preserving its trajectory flexibility. The experiments showed promising results in that the individual trajectory flexibility preservation induced self-separation and self-organization effects in the overall traffic situation. The effects were quantified using traffic complexity metrics, namely dynamic density indicators, which indicated that using the flexibility metrics reduced aircraft density and the potential of loss of separation.

Idris, Husni↗

A Simple Model for the Evolution of Multi-Stranded Coronal Loops

We develop and analyze a simple cellular automaton (CA) model that reproduces the main properties of the evolution of soft X-ray coronal loops. We are motivated by the observation that these loops evolve in three distinguishable phases that suggest the development, maintainance, and decay of a self-organized system. The model is based on the idea that loops are made of elemental strands that are heated by the relaxation of magnetic stress in the form of nanoflares. In this vision, usually called "the Parker conjecture" (Parker 1988), the origin of stress is the displacement of the strand footpoints due to photospheric convective motions. Modeling the response and evolution of the plasma we obtain synthetic light curves that have the same characteristic properties (intensity, fluctuations, and timescales) as the observed cases. We study the dependence of these properties on the model parameters and find scaling laws that can be used as observational predictions of the model. We discuss the implications of our results for the interpretation of recent loop observations in different wavelengths. Subject headings: Sun: corona - Sun: flares - Sun: magnetic topology - Sun: X-rays, gamma rays

Fuentes, M. C. Lopez↗

Cloud Macroscopic Organization: Order Emerging from Randomness

Clouds play a central role in many aspects of the climate system and their forms and shapes are remarkably diverse. Appropriate representation of clouds in climate models is a major challenge because cloud processes span at least eight orders of magnitude in spatial scales. Here we show that there exists order in cloud size distribution of low-level clouds, and that it follows a power-law distribution with exponent gamma close to 2. gamma is insensitive to yearly variations in environmental conditions, but has regional variations and land-ocean contrasts. More importantly, we demonstrate this self-organizing behavior of clouds emerges naturally from a complex network model with simple, physical organizing principles: random clumping and merging. We also demonstrate symmetry between clear and cloudy skies in terms of macroscopic organization because of similar fundamental underlying organizing principles. The order in the apparently complex cloud-clear field thus has its root in random local interactions. Studying cloud organization with complex network models is an attractive new approach that has wide applications in climate science. We also propose a concept of cloud statistic mechanics approach. This approach is fully complementary to deterministic models, and the two approaches provide a powerful framework to meet the challenge of representing clouds in our climate models when working in tandem.

Yuan, Tianle↗

Dark Energy Survey Year 6 Results: Redshift Calibration of the MagLim++ Lens Sample

In this work, we derive and calibrate the redshift distribution of the MagLim++ lens galaxy sample used in the Dark Energy Survey Year 6 (DES Y6) 3x2pt cosmology analysis. The 3x2pt analysis combines galaxy clustering from the lens galaxy sample and weak gravitational lensing. The redshift distributions are inferred using the SOMPZ method - a Self-Organizing Map framework that combines deep-field multi-band photometry, wide-field data, and a synthetic source injection (Balrog) catalog. Key improvements over the DES Year 3 (Y3) calibration include a noise-weighted SOM metric, an expanded Balrog catalogue, and an improved scheme for propagating systematic uncertainties, which allows us to generate O($10^8$) redshift realizations that collectively span the dominant sources of uncertainty. These realizations are then combined with independent clustering-redshift measurements via importance sampling. The resulting calibration achieves typical uncertainties on the mean redshift of 1-2%, corresponding to a 20-30% average reduction relative to DES Y3. We compress the $n(z)$ uncertainties into a small number of orthogonal modes for use in cosmological inference. Marginalizing over these modes leads to only a minor degradation in cosmological constraints. This analysis establishes the MagLim++ sample as a robust lens sample for precision cosmology with DES Y6 and provides a scalable framework for future surveys.

Giannini, G. [Chicago U., Astron. Astrophys. Ctr.;↗

Dark Energy Survey Year 6 Results: Redshift Calibration of the Weak Lensing Source Galaxies

Determining the distribution of redshifts for galaxies in wide-field photometric surveys is essential for robust cosmological studies of weak gravitational lensing. We present the methodology, calibrated redshift distributions, and uncertainties of the final Dark Energy Survey Year 6 (Y6) weak lensing galaxy data, divided into four redshift bins centered at $\langle z \rangle = [0.414, 0.538, 0.846, 1.157]$. We combine independent information from two methods on the full shape of redshift distributions: optical and near-infrared photometry within an improved Self-Organizing Map $p(z)$ (SOMPZ) framework, and cross-correlations with spectroscopic galaxy clustering measurements (WZ), which we demonstrate to be consistent both in terms of the redshift calibration itself and in terms of resulting cosmological constraints within 0.1$σ$. We describe the process used to produce an ensemble of redshift distributions that account for several known sources of uncertainty. Among these, imperfection in the calibration sample due to the lack of faint, representative spectra is the dominant factor. The final uncertainty on mean redshift in each bin is $σ_{\langle z\rangle} = [0.012, 0.008,0.009, 0.024]$. We ensure the robustness of the redshift distributions by leveraging new image simulations and a cross-check with galaxy shape information via the shear ratio (SR) method.

Yin, B. [Duke U.] (ORCID:0009000656049980)↗

The Power of DESI for Photometric Redshift Calibration: A Case Study with KiDS-1000

Accurate redshift estimates are a critical requirement for weak lensing surveys and one of the main uncertainties in constraints on dark energy and large-scale cosmic structure. In this paper, we study the potential to calibrate photometric redshift (photo-z) distributions for gravitational lensing using the Dark Energy Spectroscopic Instrument (DESI). Since beginning its science operations in 2021, DESI has collected more than 50 million redshifts, adding about one million monthly. In addition to its large-scale structure samples, DESI has also acquired over 256k high-quality spectroscopic redshifts (spec-zs) in the COSMOS and XMM and VVDS fields. This is already a factor of 3 larger than previous spec-z calibration compilations in these two regions. Here, we explore calibrating photo-zs for the subset of KiDS-1000 galaxies that fall into joint self-organizing map (SOM) cells overlapping the DESI COSMOS footprint using the DESI COSMOS observations. Estimating the redshift distribution in KiDS-1000 with the new DESI data, we find broad consistency with previously published results while also detecting differences in the mean redshift in some tomographic bins with an average shifts of Delta Mean(z) = -0.028 in the mean and Delta Median(z) = +0.011 in the median across tomographic bins. However, we also find that incompleteness per SOM cell, i.e., groups of galaxies with similar colors and magnitudes, can modify n(z) distributions. Finally, we comment on the fact that larger photometric catalogs, aligned with the DESI COSMOS and DESI XMM and VVDS footprints, would be needed to fully exploit the DESI dataset and would extend the coverage to nearly eight times the area of existing 9-band photometry.

Blanco, Diana [UC, Santa Cruz; UC, Santa Cruz, Ins↗

Microscopic Imprints of Learned Solutions in Tunable Networks

In physical networks trained using supervised learning, physical parameters are adjusted to produce desired responses to inputs. An example is an electrical contrastive local learning network of nodes connected by edges that adjust their conductances during training. When an edge conductance changes, it upsets the current balance of every node. In response, physics adjusts the node voltages to minimize the dissipated power. Learning in these systems is therefore a coupled double-optimization process, in which the network descends both a cost landscape in the high-dimensional space of edge conductances and a physical landscape—the power dissipation—in the high-dimensional space of node voltages. Because of this coupling, the physical landscape of a trained network contains information about the learned task. Here, we derive a structure-function relation for trained tunable networks and demonstrate that all the physical information relevant to the trained input-output relation can be captured by a tuning susceptibility, an experimentally measurable quantity. We supplement our theoretical results with simulations to show that the tuning susceptibility is correlated with functional importance and that we can extract physical insight into how the system performs the task from the conductances of highly susceptible edges. Our analysis is general and can be applied directly to mechanical networks, such as networks trained for protein-inspired function such as allostery.

36 MATERIALS SCIENCE↗

Root‐Pore Interactions, the Underestimated Driver for Rhizosphere Structure and Rhizosheath Development

Physical characteristics of rhizosphere and rhizosheath, that is, root-adhering soil, are crucial for plant performance. Yet, the drivers of the rhizosphere's structural properties and their relationships with rhizosheath development remain unclear. We used X-ray computed micro-tomography (i) to explore two drivers of rhizosphere porosity: root-induced changes vs. preferential root growth into soil with certain pore characteristics and (ii) to estimate their contributions to rhizosphere macroporosity gradients and rhizosheath formation. Rhizosheath development was assessed in relation to rhizosphere macroporosity and rhizodeposition after ¹⁴C labeling. Our results confirmed that both root-induced changes and growth preferences shape rhizosphere structure, with their relative significance depending on the inherent macropore availability. In intact soils, growth preferences were the dominant factor, while in sieved soils the root-induced changes became equally important. Rhizosheath formation was associated with roots compacting their surrounding and releasing carbon. However, no correlation was found between rhizosheath formation and the actual rhizosphere, that is, the volume of soil adjacent to the roots. The study offers new process-level understanding of rhizosphere porosity gradients, while emphasizing caution in interpreting root growth data from sieved soil studies. Similarly, traditional destructively sampled rhizosheath may not fully capture the true characteristics of the actual rhizosphere, underscoring importance of intact-soil analyses.

macroporosity gradients↗

Effect of Cathode Cooling in Three-Dimensional Simulations of an Atmospheric Pressure Glow Discharge

The Atmospheric Pressure Glow Discharge (APGD) is a relatively simple and versatile plasma source used in a wide range of applications. Active cooling of the cathode can effectively mitigate instabilities, leading to glow-to-arc transitions. This study investigates the effect of varying the degree of cathode cooling in APGD with a planar cathode in helium. The plasma flow model incorporates mass conservation, chemical species transport, momentum conservation, conservation of thermal energy of heavy species and of electrons, and electrostatics. The model is applied to time-dependent simulations through a three-dimensional computational domain describing the whole discharge, without geometric symmetry or steady-state assumptions. Simulations of an experimentally characterized APGD explore the effects of electric current and cathode cooling—ranging from thermally insulated to extreme convective cooling. Results show the formation of an annular region with high electric field over the cathode surface under conditions of high current and low cooling.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗