Search NASA⌕ Search

SEARCH · Search NASA

Results for “algorithmic structures”

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 1,603 records · Page 89
All sourcesNASA NTRSDOE OSTI
NASA NTRS2012

Investigation of Optimal Control Allocation for Gust Load Alleviation in Flight Control

Advances in sensors and avionics computation power suggest real-time structural load measurements could be used in flight control systems for improved safety and performance. A conventional transport flight control system determines the moments necessary to meet the pilot's command, while rejecting disturbances and maintaining stability of the aircraft. Control allocation is the problem of converting these desired moments into control effector commands. In this paper, a framework is proposed to incorporate real-time structural load feedback and structural load constraints in the control allocator. Constrained optimal control allocation can be used to achieve desired moments without exceeding specified limits on monitored load points. Minimization of structural loads by the control allocator is used to alleviate gust loads. The framework to incorporate structural loads in the flight control system and an optimal control allocation algorithm will be described and then demonstrated on a nonlinear simulation of a generic transport aircraft with flight dynamics and static structural loads.

Frost, Susan A.↗
DOE OSTI2017

Load power device and system for real-time execution of hierarchical load identification algorithms

A load power device includes a power input; at least one power output for at least one load; and a plurality of sensors structured to sense voltage and current at the at least one power output. A processor is structured to provide real-time execution of: (a) a plurality of load identification algorithms, and (b) event detection and operating mode detection for the at least one load.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids: Preprint

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve more than 10-fold improvement in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2019

Hierarchical Distributed Voltage Regulation in Networked Autonomous Grids

We propose a novel algorithm to solve optimal power flow (OPF) that aims at dispatching controllable distributed energy resources (DERs) for voltage regulation at minimum cost. The proposed algorithm features unprecedented scalability to large distribution networks by utilizing an information structure based on networked autonomous grids (AGs). Specifically, each AG is a subtree of a large distribution network that has a tree topology. The topology and line parameters of each AG are known only to a regional coordinator (RC) that is responsible for communicating with and dispatching the DERs within this AG. The reduced network, where each AG is treated as a node, is managed by a central coordinator (CC), which knows the topology and line parameters of the reduced network only and communicates with all the RCs. We jointly explore this information structure and the structure of the linearized distribution power flow (LinDistFlow) model to derive a hierarchical, distributed implementation of the primal-dual gradient algorithm that solves the OPF. The proposed implementation significantly reduces the computation burden compared to the centrally coordinated implementation of the primal-dual algorithm. Numerical results on a 4,521-node test feeder show that the proposed hierarchical distributed algorithm can achieve an improvement of more than tenfold in the speed of convergence compared to the centrally coordinated primal-dual algorithm.

24 POWER TRANSMISSION AND DISTRIBUTION↗
DOE OSTI2015

An efficient tensor transpose algorithm for multicore CPU, Intel Xeon Phi, and NVidia Tesla GPU

An efficient parallel tensor transpose algorithm is suggested for shared-memory computing units, namely, multicore CPU, Intel Xeon Phi, and NVidia GPU. The algorithm operates on dense tensors (multidimensional arrays) and is based on the optimization of cache utilization on x86 CPU and the use of shared memory on NVidia GPU. From the applied side, the ultimate goal is to minimize the overhead encountered in the transformation of tensor contractions into matrix multiplications in computer implementations of advanced methods of quantum many-body theory (e.g., in electronic structure theory and nuclear physics). A particular accent is made on higher-dimensional tensors that typically appear in the so-called multireference correlated methods of electronic structure theory. Depending on tensor dimensionality, the presented optimized algorithms can achieve an order of magnitude speedup on x86 CPUs and 2-3 times speedup on NVidia Tesla K20X GPU with respect to the na ve scattering algorithm (no memory access optimization). Furthermore, the tensor transpose routines developed in this work have been incorporated into a general-purpose tensor algebra library (TAL-SH).

97 MATHEMATICS AND COMPUTING↗
DOE OSTI2014

Structures and Stabilities of (MgO) n Nanoclusters

Global minima for (MgO) n structures were optimized using a tree growth–hybrid genetic algorithm in conjunction with MNDO/MNDO/d semiempirical molecular orbital calculations followed by density functional theory geometry optimizations with the B3LYP functional. New lowest energy isomers were found for a number of (MgO) n clusters. The most stable isomers for (MgO) n (n > 3) are 3-dimensional. For n < 20, hexagonal tubular (MgO)n structures are more favored in energy than the cubic structures. The cubic structures and their variations dominate after n = 20. For the cubic isomers, increasing the size of the cluster in any dimension improves the stability. The effectiveness of increasing the size of the cluster in a specific dimension to improve stability diminishes as the size in that dimension increases. For cubic structures of the same size, the most compact cubic structure is expected to be the more stable cubic structure. The average Mg–O bond distance and coordination number both increase as n increases. The calculated average Mg–O bond distance is 2.055 Å at n = 40, slightly smaller than the bulk value of 2.104 Å. The average coordination number is predicted to be 4.6 for the lowest energy (MgO) 40 as compared to the bulk value of 6. As n increases, the normalized clustering energy ΔE(n) for the (MgO) n increases and the slope of the ΔE(n) vs n curve decreases. The value of ΔE(40) is predicted to be 150 kcal/mol, as compared to the bulk value ΔE(∞) = 176 kcal/mol. Finally, the electronic properties of the clusters are presented and the reactive sites are predicted to be at the corners.

Environmental Molecular Sciences Laboratory↗
NASA NTRS1999

Systems Engineering Design Via Experimental Operation Research: Complex Organizational Metric for Programmatic Risk Environments (COMPRE)

Unique and innovative graph theory, neural network, organizational modeling, and genetic algorithms are applied to the design and evolution of programmatic and organizational architectures. Graph theory representations of programs and organizations increase modeling capabilities and flexibility, while illuminating preferable programmatic/organizational design features. Treating programs and organizations as neural networks results in better system synthesis, and more robust data modeling. Organizational modeling using covariance structures enhances the determination of organizational risk factors. Genetic algorithms improve programmatic evolution characteristics, while shedding light on rulebase requirements for achieving specified technological readiness levels, given budget and schedule resources. This program of research improves the robustness and verifiability of systems synthesis tools, including the Complex Organizational Metric for Programmatic Risk Environments (COMPRE).

Mog, Robert A.↗
NASA NTRS1984

A statistical evaluation and comparison of VISSR Atmospheric Sounder (VAS) data

In order to account for the temporal and spatial discrepancies between the VAS and rawinsonde soundings, the rawinsonde data were adjusted to a common hour of release where the new observation time corresponded to the satellite scan time. Both the satellite and rawinsonde observations of the basic atmospheric parameters (T Td, and Z) were objectively analyzed to a uniform grid maintaining the same mesoscale structure in each data set. The performance of each retrieval algorithm in producing accurate and representative soundings was evaluated using statistical parameters such as the mean, standard deviation, and root mean square of the difference fields for each parameter and grid level. Horizontal structure was also qualitatively evaluated by examining atmospheric features on constant pressure surfaces. An analysis of the vertical structure of the atmosphere were also performed by looking at colocated and grid mean vertical profiles of both the satellite and rawinsonde data sets. Highlights of these results are presented.

Jedlovec, G. J.↗
DOE OSTI2021

Pressure-induced superconductivity in the hydrogen-rich pseudobinary CaB - H n compounds

Here, the crystal structures of CaB – Hn compounds with n = 1 – 12 in a pressure range of 50–300 GPa were studied using the genetic algorithm method and first-principles density-function theory calculations. Stable structures with stoichiometry of CaB H 6 and CaB H 7 were predicted in different pressure range. BH 4 , BH 5 , and BH 6 units were found to be the main motifs in these compounds. Moreover, metastable Imm2 CaB H 7 is dynamically stable above 180 GPa, with the formation of tetrahedral BH 4 unit surrounded by Ca atom and H 3 unit. Electron-phonon coupling (EPC) calculations reveal that the superconducting properties are closely related to the strong hydrogen-boron bonding of the BH 4 unit in Imm2, and T c can reach ~200 K at 200 GPa. As the major units, BH 4 , BH 5 , and BH 6 units exist in the Imm2, P 2 , and P2 1 /m phases of CaB H 7 at 300 GPa, respectively; the corresponding EPC parameter λ decreases with the increase of hydrogen content in CaB H 7 .

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗
DOE OSTI2016

Structures and magnetic properties of Ni n (n = 36-40) clusters from first-principles calculations

A genetic algorithm (GA) coupled with a tight-binding (TB) interatomic potential is used to search for the low-energy structures of medium-sized Ni n (n = 36-40) clusters. Structural candidates obtained from our GA search are further optimized with first-principles calculations. The medium-sized nickel clusters ranging from 36 to 40 atoms are found to favor the double-icosahedron-based structures with a Ni7 core (a pentagonal bipyramidal structure) except Ni38 cluster. The lowest-energy structure of Ni38 can be considered to be a magic cluster, which is a typical face-centered cubic structure with large stability and magnetic moment.

Song, W.↗
DOE OSTI2025

Scalable edge clustering of dynamic graphs via weighted line graphs

Timestamped relational datasets consisting of records (or connections) between pairs of entities are ubiquitous in network science. For applications like peer-to-peer communication, email, various social network interactions, and computer network security, it is useful to organize these records into groups based on how and when they are occurring. Weighted line graphs offer a natural way to model how records are related in such datasets but for large real-world graph topologies, building and utilizing the line graph is prohibitively expensive. Here, we present the framework to cluster the edges of a dynamic graph via the associated line graph that contains two major contributions. The first is a method to work with the line graph implicitly and the second is a distributed scale implementation of an agglomerative hierarchical graph clustering algorithm. We outline a novel hierarchical dynamic graph edge clustering approach that efficiently breaks massive relational datasets into small sets of edges containing events at various timescales. This is in stark contrast to traditional graph clustering algorithms that prioritize highly connected (clique-like) community structures. Our approach relies on constructing a sufficient subgraph of a weighted line graph and applying a hierarchical agglomerative clustering. This approach is related to scalable techniques from spatial clustering, nonlinear-dimension reduction, topological data analysis, and draws particular inspiration from HDBSCAN. As an edge clustering, this method yields an overlapping node clustering. Our algorithm is parallelizable and we demonstrate efficient clustering of a billion-scale, real-world dynamic graph into small edge sets that correlate in topology and time. The entire clustering process for a graph with tens of billions of edges takes just a few minutes of run time on 256 nodes of a distributed compute environment. We argue how the output of the edge clustering is useful for a multitude of data visualization and powerful machine learning tasks, both involving the original massive dynamic graph data and metadata associated with the nodes and edges. Finally, we describe how this approach can be extended to dynamic hypergraphs and dynamic graphs/hypergraphs with unstructured data living on vertices and edges.

Data Analysis↗
DOE OSTI2015

Electromagnetic and neutral-weak response functions of 4 He and 12 C

A major goal of nuclear theory is to understand the strong interaction in nuclei as it manifests itself in terms of two- and many-body forces among the nuclear constituents, the protons and neutrons, and the interactions of these constituents with external electroweak probes via one- and many-body currents. The objective of the present work is to calculate the quasielastic electroweak response functions in light nuclei within the realistic dynamical framework outlined above. These response functions determine the inclusive cross section as function of the lepton momentum and energy transfers. Their ab initio calculation is a very challenging quantum many-body problem, since it requires summation over the entire excitation spectrum of the nucleus and inclusion in the electroweak currents of one- and many-body terms. Green's functions Monte Carlo methods allow one to circumvent both difficulties by computing the response in imaginary time (the so-called Euclidean response) and hence summing implicitly over the bound and continuum states of the nucleus, and by implementing specific algorithms designed to deal with the complicated spin-isospin structure of nuclear many-body operators. Theoretical predictions for 4 He and 12 C, confirmed by experiment in the electromagnetic case, show that two-body currents generate excess transverse strength from threshold to the quasielastic to the dip region and beyond. In conclusion, these results challenge the conventional picture of quasielastic inclusive scattering as being largely dominated by single-nucleon knockout processes.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗
NASA NTRS1998

Trellises and Trellis-Based Decoding Algorithms for Linear Block Codes: A Recursive Maximum Likelihood Decoding - Part 3

The Viterbi algorithm is indeed a very simple and efficient method of implementing the maximum likelihood decoding. However, if we take advantage of the structural properties in a trellis section, other efficient trellis-based decoding algorithms can be devised. Recently, an efficient trellis-based recursive maximum likelihood decoding (RMLD) algorithm for linear block codes has been proposed. This algorithm is more efficient than the conventional Viterbi algorithm in both computation and hardware requirements. Most importantly, the implementation of this algorithm does not require the construction of the entire code trellis, only some special one-section trellises of relatively small state and branch complexities are needed for constructing path (or branch) metric tables recursively. At the end, there is only one table which contains only the most likely code-word and its metric for a given received sequence r = (r(sub 1), r(sub 2),...,r(sub n)). This algorithm basically uses the divide and conquer strategy. Furthermore, it allows parallel/pipeline processing of received sequences to speed up decoding.

Lin, Shu↗
NASA NTRS1990

Integrated fluid-thermal-structural analysis using adaptive unstructured meshes

An integrated fluid-thermal-structural analysis approach using adaptive unstructured meshes is presented. The approach combines the finite-element method and an adaptive remeshing technique to solve the Navier-tokes equations for high-speed compressible flow, the energy equation for the thermal response of the structure, and the quasi-static equilibrium equations for the structural response. The analysis solution procedure and the adaptive unstructured remeshing technique are described. The effectiveness of the approach is evaluated with three application studies. The adaptive unstructured remeshing procedure and finite-element solution algorithms combine to yield increased accuracy and effiency over standard structured meshes.

Dechaumphai, Pramote↗
DOE OSTI2025

Tactical Analysis for Calculating Contextual Risk at Boundaries: Summary of Laboratory Directed Research & Development Effort

The Tactical Analysis for Calculating Contextual Risk at Boundaries (TACCRAB) tool is an innovative digital twin (DT) platform and automated risk algorithm designed to transform operational decision-making in structured screening environments, with an initial focus on Southern Border Land Ports of Entry (POEs). The invention provides integration points for advanced artificial intelligence, predictive modeling, and real-time data analysis to produce a comprehensive risk management tool that enables proactive, data-informed security strategies. The core inventive features of TACCRAB center on its unique risk algorithm, which dynamically calculates contextual risk by synthesizing historical data, near real-time streaming data from the checkpoints themselves, and AI-generated predictions. Unlike traditional risk assessment methods, TACCRAB utilizes a DT to provide comprehensive operational insights, allowing stakeholders to visualize, simulate, and optimize checkpoint configurations with unprecedented speed and contextual awareness. TACCRAB's key innovation lies in its ability to combine multiple complex inputs - including technology detection probabilities, resource availability, screening pathway characteristics, and threat actor behavioral patterns - into a unified risk calculation and update these inputs based on changing operational and environmental conditions. By leveraging a DT that continuously updates and learns from linked data, TACCRAB can suggest adaptive mitigation strategies that minimize risk while maintaining operational efficiency. Particularly novel is the platform's approach to decision support, which goes beyond static risk assessment. The DT provides dynamic metrics such as wait times, resource allocation effectiveness, and potential emerging threat scenarios, enabling users to view sophisticated, relevant what-if simulations and optimize checkpoint operations in near real-time. The system's architecture allows for generalized application across different screening environments, such as secure facilities, ports of entry, and soft targets, making it a versatile tool for security and operational management. The invention distinguishes itself through its comprehensive integration of predictive modeling, AI-driven pattern discovery, and user-friendly interface design. By combining these elements, TACCRAB transforms complex risk data into actionable insights, supporting decision-makers at various organizational levels - from booth agents making split-second screening decisions to checkpoint managers optimizing the day's resource allocation to strategic planners managing long-term investments.

45 MILITARY TECHNOLOGY, WEAPONRY, AND NATIONAL DEF↗
DOE OSTI2024

Distribution of centrality measures on undirected random networks via the cavity method

The Katz centrality of a node in a complex network is a measure of the node’s importance as far as the flow of information across the network is concerned. For ensembles of locally tree-like undirected random graphs, this observable is a random variable. Its full probability distribution is of interest but difficult to handle analytically because of its “global” character and its definition in terms of a matrix inverse. Leveraging a fast Gaussian Belief Propagation-Cavity algorithm to solve linear systems on tree-like structures, we show that i) the Katz centrality of a single instance can be computed recursively in a very fast way, and ii) the probability P ( K ) that a random node in the ensemble of undirected random graphs has centrality K satisfies a set of recursive distributional equations, which can be analytically characterized and efficiently solved using a population dynamics algorithm. We test our solution on ensembles of Erdős-Rényi and Scale Free networks in the locally tree-like regime, with excellent agreement. The analytical distribution of centrality for the configuration model conditioned on the degree of each node can be employed as a benchmark to identify nodes of empirical networks with over- and underexpressed centrality relative to a null baseline. We also provide an approximate formula based on a rank- 1 projection that works well if the network is not too sparse, and we argue that an extension of our method could be efficiently extended to tackle analytical distributions of other centrality measures such as PageRank for directed networks in a transparent and user-friendly way.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗