Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Context algorithm”

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 649 records · Page 36

Approximating the linear quadratic optimal control law for hereditary systems with delays in the control

The fundamental control synthesis issue of establishing a priori convergence rates of approximation schemes for feedback controllers for a class of distributed parameter systems is addressed within the context of hereditary systems. Specifically, a factorization approach is presented for deriving approximations to the optimal feedback gains for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the controls, trajectories and feedback kernels. Two algorithms are derived from the basic approximation scheme, including a fast algorithm, in the time-invariant case. A numerical example is also considered.

Milman, Mark H.↗

Approximating the linear quadratic optimal control law for hereditary systems with delays in the control

The fundamental control synthesis issue of establishing a priori convergence rates of approximation schemes for feedback controllers for a class of distributed parameter systems is addressed within the context of hereditary schemes. Specifically, a factorization approach is presented for deriving approximations to the optimal feedback gains for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the controls, trajectories and feedback kernels. Two algorithms are derived from the basic approximation scheme, including a fast algorithm, in the time-invariant case. A numerical example is also considered.

Milman, Mark H.↗

Distributed decision-making for space operations

A programmatic and technical perspective in the context of future space applications is presented, that includes some of the management challenges that arise as the decision-making process becomes increasingly more decentralized. Three challenges are discussed: (1) the degree to which the planners must communicate with each other and with those who are seeking space operations resources, (2) the collection, management, employment and dissemination of the information needed to make decisions, and (3) the challenges connected with schedule integration. The technical perspective presented leads to recommended adaptations to the normal scheduling algorithms that retain the 'degrees of freedom' in the planning result. It is shown that these adaptations are specific technical responses to the programmatic challenges discussed.

Hornstein, Rhoda Shaller↗

Distributed state-space generation of discrete-state stochastic models

High-level formalisms such as stochastic Petri nets can be used to model complex systems. Analysis of logical and numerical properties of these models of ten requires the generation and storage of the entire underlying state space. This imposes practical limitations on the types of systems which can be modeled. Because of the vast amount of memory consumed, we investigate distributed algorithms for the generation of state space graphs. The distributed construction allows us to take advantage of the combined memory readily available on a network of workstations. The key technical problem is to find effective methods for on-the-fly partitioning, so that the state space is evenly distributed among processors. In this paper we report on the implementation of a distributed state-space generator that may be linked to a number of existing system modeling tools. We discuss partitioning strategies in the context of Petri net models, and report on performance observed on a network of workstations, as well as on a distributed memory multi-computer.

Ciardo, Gianfranco↗

Development of an Innovative Algorithm for Aerodynamics-Structure Interaction Using Lattice Boltzmann Method

The lattice Boltzmann equation (LBE) is a kinetic formulation which offers an alternative computational method capable of solving fluid dynamics for various systems. Major advantages of the method are owing to the fact that the solution for the particle distribution functions is explicit, easy to implement, and the algorithm is natural to parallelize. In this final report, we summarize the works accomplished in the past three years. Since most works have been published, the technical details can be found in the literature. Brief summary will be provided in this report. In this project, a second-order accurate treatment of boundary condition in the LBE method is developed for a curved boundary and tested successfully in various 2-D and 3-D configurations. To evaluate the aerodynamic force on a body in the context of LBE method, several force evaluation schemes have been investigated. A simple momentum exchange method is shown to give reliable and accurate values for the force on a body in both 2-D and 3-D cases. Various 3-D LBE models have been assessed in terms of efficiency, accuracy, and robustness. In general, accurate 3-D results can be obtained using LBE methods. The 3-D 19-bit model is found to be the best one among the 15-bit, 19-bit, and 27-bit LBE models. To achieve desired grid resolution and to accommodate the far field boundary conditions in aerodynamics computations, a multi-block LBE method is developed by dividing the flow field into various blocks each having constant lattice spacing. Substantial contribution to the LBE method is also made through the development of a new, generalized lattice Boltzmann equation constructed in the moment space in order to improve the computational stability, detailed theoretical analysis on the stability, dispersion, and dissipation characteristics of the LBE method, and computational studies of high Reynolds number flows with singular gradients. Finally, a finite difference-based lattice Boltzmann method is developed for inviscid compressible flows.

Mei, Ren-Wei↗

Marve: Measurement Context Extraction from Text

We propose Marve, a system for extracting measurement values, units, and related words from natural language text. Marve uses conditional random fields (CRF) to identify measurement values and units, followed by a rule-based system to find related entities, descriptors and modifiers within a sentence. Sentence tokens are represented by an undirected graphical model, and rules are based on part-of-speech and word dependency patterns connecting values and units to contextual words. Marve is unique in its focus on measurement context and early experimentation demonstrates Marve’s ability to generate high-precision extractions with strong recall. We also discuss Marve’s role in justifying NASA JPL’s proposed HyspIRI mission, a hyper spectral infrared imaging satellite that will study the world’s ecosystems. In general, our work with HyspIRI demonstrates the value of semantic measurement extractions in characterizing quantitative discussion contained in large corpuses of natural language text. These extractions accelerate broad-cross cu ing literature surveys and expose researchers and scientists new algorithmic approaches and experimental nuances. They also facilitate identification of scientific opportunities enabled by HyspIRI leading to more informed scientific investment and research.

Mattmann, Chris A.↗

Using Filter Methods to Guide Convergence for ADMM, with Applications to Nonnegative Matrix Factorization Problems

Nonconvex, nonlinear optimization problems arise naturally in parameter fitting and machine learning. While augmented Lagrangian methods have demonstrated robust convergence for classes of these problems, their convergence for block updates has been relatively unexplored outside of the context of the alternating direction method of multipliers (ADMM). ADMM has seen extensive use in these applications, but may exhibit uncertain convergence behavior in many practical nonconvex settings, and struggles with general nonlinear constraints. In contrast, filter methods have proved effective in enforcing convergence for sequential quadratic programming methods and interior point methods with feasibility criteria. We develop an ADMM-filter method for highly nonlinear and nonconvex problems. Here, we show convergence under mild assumptions for several types of coordinate descent schemes, and demonstrate our algorithm on nonnegative matrix factorization and completion problems in imaging and chemical spectrum analysis.

Nonconvex optimization↗

Design methodologies and engineering applications for ecosystem biomimicry: an interdisciplinary review spanning cyber, physical, and cyber-physical systems

Abstract Ecosystem biomimicry is a promising pathway for sustainable development. However, while typical form- and process-level biomimicry is prevalent, system-level ecosystem biomimicry remains a nascent practice in numerous engineering fields. This critical review takes an interdisciplinary approach to synthesize trends across case studies, evaluate design methodologies, and identify future opportunities when applying ecosystem biomimicry to engineering practices, including cyber systems (CS), physical systems (PS), and cyber-physical systems (CPS). After systematically sourcing publications from major databases, the papers were first analyzed at a meta level for their bibliographic context and for statistical correlations among categorical variables. Then, we investigated deeper into the engineering applications and design methodologies. Results indicate that CPS most frequently mimic organisms and ecosystems, while CS and PS frequently mimic populations-communities and molecules-tissues-organ systems, respectively (statistically highly significant). An indirect approach is most often used for mimicry at organizational levels from populations to ecosystems, while a direct approach frequently suits levels from molecules to organisms (highly significant). Dominant themes across engineering applications include symbiotic organism search algorithms for CS and ecological network analysis for CPS, while PS are highly diverse. For design methodologies, this work summarizes and details ten well-documented biomimetic process models among literature, which addresses an outdated concern for a lack of systematic methods for ecosystem biomimicry. In addition to the Biomimetics Standard ISO 18458, these methods include the Natural Step and Techno-Ecological Synergy framework, among others. Further, the analyses revealed future opportunities from less utilized design methods (e.g. interdisciplinary teams tackling indirect, ecosystem-level projects) to well-established engineering concepts ready for technological advancement (e.g. implementing membrane computing for physical applications). For future studies, this review provides a comprehensive reference for ecosystem biomimetic design practices and application opportunities across multiple engineering domains.

42 ENGINEERING↗

Aerosol Constraints from Multi-Angle Imaging That Modelers Can Use

As we continue to develop, refine, and apply the MISR aerosol products to a range of scientific questions, the strengths and limitations of the data content regarding aerosol optical depth (AOD), aerosol type, and plume height mapping have become pretty clear. Optimizing the operational algorithms to take advantage of the multi-angle, multi-spectral radiance information content is challenging in some situations, so we have also developed a number of specialized tools that run only on individual cases. These include the MISR Research Aerosol Retrieval algorithm, the highest-quality aerosol plume heights derived from the MINX software, and MISR-MODIS aerosol transport mapping code. This presentation will focus on some of the research products we are creating, with emphasis on those that might be most useful for constraining aerosol transport models, As we have acquired more than 11 years of once-weekly global coverage from MISR, discussion with the group will consider where and when having these products would maximize our contribution to AeroCom modeling efforts, in the context of practical limitations on specialized product generation.

Kahn, Ralph↗

ATTRACTOR: Toward Trustworthy and Trusted Autonomous Systems

The question of what it means and what it takes for an autonomous system to consider another autonomous system justifiably trustworthy must be addressed by all who seek to integrate intelligent machine agents into real-world operations. A satisfactory answer to this question is an essential component in accepting autonomous machine decision-making in safety-critical and time-critical environments, such as aviation. Historically, simulation platforms for test and evaluation of complex systems have proven to be effective in assessing performance and contributing to decisions on the fitness of systems to operate in current general and commercial aviation airspace. Moreover, simulations have informed the definition of safety-critical constraints. However, as machine systems progressively take on responsibilities for decision-making traditionally supplied by humans, simulations require enhancement. Mixed reality simulation that integrates real-world platforms and data or high-fidelity simulation data in a sim-to-flight paradigm provides insight into agent interaction and the rationale behind autonomous agent decision-making as well as the capacity for seamless integrated implementation, testing, and operation of systems. Strong simulation capabilities are especially important in the presence of algorithms that hold great promise in decision-making yet increase the uncertainty in the system. Autonomy Teaming and TRAjectories for Complex Trusted Operational Reliability (ATTRACTOR) is a subproject of NASA’s Convergent Aeronautics Solutions (CAS) Project. ATTRACTOR’s objective is to build a basis for understanding trust and trustworthiness in multi-agent autonomous teams, and thus to inform future certification of safety-critical and time-critical autonomous systems in aviation. Because the concepts of trust and trustworthiness must be addressed in a context, ATTRACTOR has chosen Search and Rescue (SAR) in dynamic and unstructured environments, with emphasis on search, as its design reference mission (DRM). During dynamic planning and execution of trajectory-based operations, autonomous agents determine their trajectories given an assigned mission or missions and call for assistance from an appropriate teammate when needed. This experience along with the attendant human-machine and machine-machine interactions, serve as a platform for developing approaches to identifying and measuring trustworthiness and increasing trust. In this paper, we give an overview of some of ATTRACTOR’s research and development activities, findings, and ongoing work.

ATTRACTOR↗

Classifying Forest Type in the National Forest Inventory Context with Airborne Hyperspectral and Lidar Data

Forest structure and composition regulate a range of ecosystem services, including biodiversity, water and nutrient cycling, and wood volume for resource extraction. Forest type is an important metric measured in the US Forest Service Forest Inventory and Analysis (FIA) program, the national forest inventory of the USA. Forest type information can be used to quantify carbon and other forest resources within specific domains to support ecological analysis and forest management decisions, such as managing for disease and pests. In this study, we developed a methodology that uses a combination of airborne hyperspectral and lidar data to map FIA-defined forest type between sparsely sampled FIA plot data collected in interior Alaska. To determine the best classification algorithm and remote sensing data for this task, five classification algorithms were tested with six different combinations of raw hyperspectral data, hyperspectral vegetation indices, and lidar-derived canopy and topography metrics. Models were trained using forest type information from 632 FIA subplots collected in interior Alaska. Of the thirty model and input combinations tested, the random forest classification algorithm with hyperspectral vegetation indices and lidar-derived topography and canopy height metrics had the highest accuracy (78% overall accuracy). This study supports random forest as a powerful classifier for natural resource data. It also demonstrates the benefits from combining both structural (lidar) and spectral (imagery) data for forest type classification.

random forest↗

$\mathrm{COBRA}$ improves the completeness and contiguity of viral genomes assembled from metagenomes

Viruses are often studied using metagenome-assembled sequences, but genome incompleteness hampers comprehensive and accurate analyses. Contig Overlap Based Re-Assembly (COBRA) resolves assembly breakpoints based on the de Bruijn graph and joins contigs. Here we benchmarked COBRA using ocean and soil viral datasets. COBRA accurately joined the assembled sequences and achieved notably higher genome accuracy than binning tools. From 231 published freshwater metagenomes, we obtained 7,334 bacteriophage clusters, ~83% of which represent new phage species. Notably, ~70% of these were circular, compared with 34% before COBRA analyses. We expanded sampling of huge phages (≥200 kbp), the largest of which was curated to completion (717 kbp). Improved phage genomes from Rotsee Lake provided context for metatranscriptomic data and indicated the in situ activity of huge phages, whiB-encoding phages and cysC- and cysH-encoding phages. COBRA improves viral genome assembly contiguity and completeness, thus the accuracy and reliability of analyses of gene content, diversity and evolution.

54 ENVIRONMENTAL SCIENCES↗

The Land Use and Land Cover Dichotomy: A Comparison of Two Land Classification Systems in Support of Urban Earth Science Applications

One is likely to read the terms 'land use' and 'land cover' in the same sentence, yet these concepts have different origins and different applications. Land cover is typically analyzed by earth scientists working with remotely sensed images. Land use is typically studied by urban planners who must prescribe solutions that could prevent future problems. This apparent dichotomy has led to different classification systems for land-based data. The works of earth scientists and urban planning practitioners are beginning to come together in the field of spatial analysis and in their common use of new spatial analysis technology. In this context, the technology can stimulate a common 'language' that allows a broader sharing of ideas. The increasing amount of land use and land cover change challenges the various efforts to classify in ways that are efficient, effective, and agreeable to all groups of users. If land cover and land uses can be identified by remote methods using aerial photography and satellites, then these ways are more efficient than field surveys of the same area. New technology, such as high-resolution satellite sensors, and new methods, such as more refined algorithms for image interpretation, are providing refined data to better identify the actual cover and apparent use of land, thus effectiveness is improved. However, the closer together and the more vertical the land uses are, the more difficult the task of identification is, and the greater is the need to supplement remotely sensed data with field study (in situ). Thus, a number of land classification methods were developed in order to organize the greatly expanding volume of data on land characteristics in ways useful to different groups. This paper distinguishes two land based classification systems, one developed primarily for remotely sensed data, and the other, a more comprehensive system requiring in situ collection methods. The intent is to look at how the two systems developed and how they can work together so that land based information can be shared among different users and compared over time.

McAllister, William K.↗

The Process of Bringing Dark Data to Light: The Rescue of the Early Nimbus Satellite Data

Myriad environmental satellite missions are currently orbiting the earth. The comprehensive monitoring by these sensors provide scientists, policymakers, and the public critical information on the earths weather and climate system. The state of the art technology of our satellite monitoring system is the legacy of the first environment satellites, the Nimbus systems launched by NASA in the mid-1960s. Such early data can extend our climate record and provide important context in longer-term climate changes. However, the data was stowed away and, over the years, largely forgotten. It was nearly lost before its value was recognized and attempts to recover the data were undertaken. This paper covers what it took the authors to recover, navigate and reprocess the data into modern formats so that it could be used as a part of the satellite climate record. The procedures to recover the Nimbus data, from both film and tape, could be used by other data rescue projects, however the algorithms presented will tend to be Nimbus specific. Data rescue projects are often both difficult and time consuming but the data they bring back to the science community makes these efforts worthwhile.

dark↗

Application of Margin-Based Methods to Assess System Health

Health management of complex systems such as nuclear power plants is an essential task to guarantee system reliability. This task can be greatly enhanced by constantly monitoring asset status and performances and process such data (through anomaly detection, diagnostic, and prognostic computational algorithms) to identify asset degradation trends and faulty states. While such information and data are typically available for many of the assets, they are not propagated from the asset to the system level in order to identify the most critical assets and prioritize maintenance and surveillance activities. The main reason is driven by the fact that current reliability modeling techniques are inadequate to process such information/data. This is due to the nature of these techniques which are based on the concept of failure rate/probability that do not serve an operational context where quantitative asset health information is available. Simply stated, current reliability techniques serve a run-to-failure operational setting and not a predictive maintenance one where the goal is to perform maintenance and surveillance activities only when they are needed based on asset health. The risk informed asset management (RIAM) project is focusing on the development of a different kind of reliability modeling techniques designed to adequately serve a predictive operational setting. Such reliability techniques move aways from a failure rate/probability to a margin-based mindset where margin is here used as a metric to quantify asset health based only on current and past operational experience of the asset under consideration. In addition, margin-based reliability techniques are able to propagate asset health information from the component to system level and provide importance measure to each asset. This report summarizes a recent activity performed in collaboration with plant modernization pathway designed to integrate monitoring data into margin-based reliability models. Such activity focuses on a specific system of an existing nuclear power plant where large amount of historic monitoring data is used to monitor asset and system health.

97 MATHEMATICS AND COMPUTING↗

A Battery Health Monitoring Framework for Planetary Rovers

Batteries have seen an increased use in electric ground and air vehicles for commercial, military, and space applications as the primary energy source. An important aspect of using batteries in such contexts is battery health monitoring. Batteries must be carefully monitored such that the battery health can be determined, and end of discharge and end of usable life events may be accurately predicted. For planetary rovers, battery health estimation and prediction is critical to mission planning and decision-making. We develop a model-based approach utilizing computaitonally efficient and accurate electrochemistry models of batteries. An unscented Kalman filter yields state estimates, which are then used to predict the future behavior of the batteries and, specifically, end of discharge. The prediction algorithm accounts for possible future power demands on the rover batteries in order to provide meaningful results and an accurate representation of prediction uncertainty. The framework is demonstrated on a set of lithium-ion batteries powering a rover at NASA.

prediction↗

QuAIL Tools for Benchmarking, Analysis and Quantum Algorithm Development

HybridQ and PySA are open-source tools developed by NASA to support benchmarking, analysis and quantum algorithm development in areas such as simulation, optimization and machine learning. These tools leverage classical hardware acceleration via high-performance computing CPU and GPU architectures and support high-performance computing. HybridQ is a highly extensible platform designed to provide a common framework to integrate multiple state-of-the-art techniques to simulate large scale quantum circuits. PySA is an extensible platform to optimize a classical cost function. We provide an outline of each of these open-source tools and highlight projects using each of these tools in contexts of simulation, optimization and machine learning.

Quantum Computing↗

HPDR: High-Performance Portable Scientific Data Reduction Framework

The rapid growth in scientific data generation is outpacing advancements in computing systems necessary for efficient storage, transfer, and analysis, particularly in the context of exascale computing. With the deployment of first-generation exascale computing systems and next-generation experimental facilities, this gap is widening and necessitates effective data reduction techniques to manage enormous data volumes. Over the past decade, various data reduction methods, including lossless compression, error-controlled lossy compression, and data refactoring, have been developed to accelerate I/O in scientific workflows. Despite significant reductions in data volume, these methods introduce considerable computational overhead, which can become the new bottleneck in data processing. To mitigate this, GPU-accelerated data reduction algorithms have been introduced. However, challenges remain in their integration into exascale workflows, including limited portability across different GPU architectures, substantial memory transfer overhead, and reduced scalability on dense multi-GPU systems. To address these challenges, we propose HPDR, a high-performance and portable data reduction framework. HPDR is designed to enable the execution of state-of-the-art reduction algorithms across diverse processor architectures while reducing memory transfer overhead to 2.3 % of the original, resulting in up to 3.5× faster throughput compared to existing solutions. It also achieves up to 96% of the theoretical speedup in multi-GPU settings. In addition, evaluations on accelerating I/O operations at scale up to 1,024 nodes of the Frontier supercomputer demonstrate that HPDR can achieve up to 103 TB/s reduction throughput, providing up to 4× acceleration in parallel I/O performance compared to existing data reduction routines. This work highlights the potential of HPDR to significantly enhance data reduction efficiency in exascale computing environments.

Chen, Jieyang [University of Oregon]↗