Search NASA⌕ Search

SEARCH · Search NASA

Results for “interface 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 523 records · Page 29

NASA Tech Briefs, December 2007

Topics include: Ka-Band TWT High-Efficiency Power Combiner for High-Rate Data Transmission; Reusable, Extensible High-Level Data-Distribution Concept; Processing Satellite Imagery To Detect Waste Tire Piles; Monitoring by Use of Clusters of Sensor-Data Vectors; Circuit and Method for Communication Over DC Power Line; Switched Band-Pass Filters for Adaptive Transceivers; Noncoherent DTTLs for Symbol Synchronization; High-Voltage Power Supply With Fast Rise and Fall Times; Waveguide Calibrator for Multi-Element Probe Calibration; Four-Way Ka-Band Power Combiner; Loss-of-Control-Inhibitor Systems for Aircraft; Improved Underwater Excitation-Emission Matrix Fluorometer; Metrology Camera System Using Two-Color Interferometry; Design and Fabrication of High-Efficiency CMOS/CCD Imagers; Foam Core Shielding for Spacecraft CHEM-Based Self-Deploying Planetary Storage Tanks Sequestration of Single-Walled Carbon Nanotubes in a Polymer PPC750 Performance Monitor Application-Program-Installer Builder Using Visual Odometry to Estimate Position and Attitude Design and Data Management System Simple, Script-Based Science Processing Archive Automated Rocket Propulsion Test Management Online Remote Sensing Interface Fusing Image Data for Calculating Position of an Object Implementation of a Point Algorithm for Real-Time Convex Optimization Handling Input and Output for COAMPS Modeling and Grid Generation of Iced Airfoils Automated Identification of Nucleotide Sequences Balloon Design Software Rocket Science 101 Interactive Educational Program Creep Forming of Carbon-Reinforced Ceramic-Matrix Composites Dog-Bone Horns for Piezoelectric Ultrasonic/Sonic Actuators Benchtop Detection of Proteins Recombinant Collagenlike Proteins Remote Sensing of Parasitic Nematodes in Plants Direct Coupling From WGM Resonator Disks to Photodetectors Using Digital Radiography To Image Liquid Nitrogen in Voids Multiple-Parameter, Low-False-Alarm Fire-Detection Systems Mosaic-Detector-Based Fluorescence Spectral Imager Plasmoid Thruster for High Specific-Impulse Propulsion Analysis Method for Quantifying Vehicle Design Goals Improved Tracking of Targets by Cameras on a Mars Rover Sample Caching Subsystem Multistage Passive Cooler for Spaceborne Instruments GVIPS Models and Software Stowable Energy-Absorbing Rocker-Bogie Suspensions

Source record↗

Orion Capsule Handling Qualities for Atmospheric Entry

Two piloted simulations were conducted at NASA's Johnson Space Center using the Cooper-Harper scale to study the handling qualities of the Orion Command Module capsule during atmospheric entry flight. The simulations were conducted using high fidelity 6-DOF simulators for Lunar Return Skip Entry and International Space Station Return Direct Entry flight using bank angle steering commands generated by either the Primary (PredGuid) or Backup (PLM) guidance algorithms. For both evaluations, manual control of bank angle began after descending through Entry Interface into the atmosphere until drogue chutes deployment. Pilots were able to use defined bank management and reversal criteria to accurately track the bank angle commands, and stay within flight performance metrics of landing accuracy, g-loads, and propellant consumption, suggesting that the pilotability of Orion under manual control is both achievable and provides adequate trajectory performance with acceptable levels of pilot effort. Another significant result of these analyses is the applicability of flying a complex entry task under high speed entry flight conditions relevant to the next generation Multi Purpose Crew Vehicle return from Mars and Near Earth Objects.

Tigges, Michael A.↗

Enhanced Software for Scheduling Space-Shuttle Processing

The Ground Processing Scheduling System (GPSS) computer program is used to develop streamlined schedules for the inspection, repair, and refurbishment of space shuttles at Kennedy Space Center. A scheduling computer program is needed because space-shuttle processing is complex and it is frequently necessary to modify schedules to accommodate unanticipated events, unavailability of specialized personnel, unexpected delays, and the need to repair newly discovered defects. GPSS implements constraint-based scheduling algorithms and provides an interactive scheduling software environment. In response to inputs, GPSS can respond with schedules that are optimized in the sense that they contain minimal violations of constraints while supporting the most effective and efficient utilization of space-shuttle ground processing resources. The present version of GPSS is a product of re-engineering of a prototype version. While the prototype version proved to be valuable and versatile as a scheduling software tool during the first five years, it was characterized by design and algorithmic deficiencies that affected schedule revisions, query capability, task movement, report capability, and overall interface complexity. In addition, the lack of documentation gave rise to difficulties in maintenance and limited both enhanceability and portability. The goal of the GPSS re-engineering project was to upgrade the prototype into a flexible system that supports multiple- flow, multiple-site scheduling and that retains the strengths of the prototype while incorporating improvements in maintainability, enhanceability, and portability.

Barretta, Joseph A.↗

The Mars Science Laboratory Entry, Descent, and Landing Flight Software

This paper describes the design, development, and testing of the EDL program from the perspective of the software engineer. We briefly cover the overall MSL flight software organization, and then the organization of EDL itself. We discuss the timeline, the structure of the GNC code (but not the algorithms as they are covered elsewhere in this conference) and the command and telemetry interfaces. Finally, we cover testing and the influence that testability had on the EDL flight software design.

Entry, Descent, Landing (EDL)↗

Performance Analysis of Speculative Parallel Adaptive Local Timestepping for Conservation Laws

Stable simulation of conservation laws, such as those used to model fluid dynamics and plasma physics applications, requires the satisfaction of the so-called Courant-Friedrichs-Lewy condition. By allowing regions of the mesh to advance with different timesteps that locally satisfy this stability constraint, significant work reduction can be attained when compared to a time integration scheme using a single timestep size. However, parallelizing this algorithm presents considerable difficulty. Since the stability condition depends on the state of the system, dependencies become dynamic and potentially non-local. In this article, we present an adaptive local timestepping algorithm using an optimistic (Timewarp-based) parallel discrete event simulation. We introduce waiting heuristics to limit misspeculation and a semi-static load balancing scheme to eliminate load imbalance as parts of the mesh require finer or coarser timesteps. Last, we outline an interface for separating the physics of the specific conservation law from the temporal integration allowing for productive adoption of our proposed algorithm. We present a misspeculation study for three conservation laws, demonstrating both the productivity of the local timestepping API, for which 74% of the lines of code are reused across different conservation laws, and the robustness of the waiting heuristics—at most 1.5% of element updates are rolled back. Our performance studies demonstrate up to a 2.8× speedup versus a baseline unoptimized local timestepping approach, a 4x improvement in per-node throughput compared to an MPI parallelization of synchronous timestepping, and scalability up to 3,072 cores on NERSC’s Cori Haswell partition.

97 MATHEMATICS AND COMPUTING↗

Practical jet flavour through NNLO

Abstract An infrared and collinear (IRC) safe definition of the partonic flavour of a jet is vital for precision predictions of quantum chromodynamics at colliders. Jet flavour definitions have been presented in the literature, but they are typically defined through modification of the jet algorithm to be sensitive to partonic flavour at every stage of the clustering. While this does ensure that the sum of flavours in a jet is IRC safe, a flavour-sensitive clustering procedure is difficult to apply to realistic data. We introduce a distinct and novel approach to jet flavour that can be applied to a collection of partons defined by any algorithm. Our definition of jet flavour is the sum of flavours of all partons that remain after Soft Drop grooming, reclustered with the "Image missing" <#comment/> algorithm. We prove that this prescription is IRC safe through next-to-next-to-leading order (NNLO), and so can interface with the most precise fixed-order calculations for jets available at present. We validate the IRC safety of this definition with numeric fixed-order codes and further show that jet flavour with Soft Drop reclustered with a generalised $$k_T$$ k T algorithm fails to be IRC safe at NNLO.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

RANGE: A robust adaptive nature-inspired global explorer of potential energy surfaces

With the growing demand for realistic representations of chemical structures and the advent of exascale computing, the intelligent sampling of potential energy surfaces and efficient identification of global minima have become more essential but also more feasible. Building on prior studies demonstrating the efficiency of the Artificial Bee Colony (ABC) swarm intelligence algorithm, we report a hybrid metaheuristic framework that integrates the adaptive exploration capabilities of ABC coupled with the exploitation strengths of genetic algorithms (GA) in a scalable, Python-based implementation. The resulting tool, RANGE (Robust Adaptive Nature-inspired Global Explorer), provides seamless interfaces to multiple potential energy evaluators, either directly or via widely used Python libraries, and is designed for high-performance computing environments. We describe the implementation details of RANGE and evaluate its performance, relative to ABC- or GA-alone based algorithms, on a variety of chemical systems, including molecular clusters and heterogeneous surfaces. In conclusion, our results demonstrate RANGE’s efficiency, robustness, and broad applicability in addressing challenging global optimization problems in computational chemistry and materials science.

Algorithms and data structure↗

Evaluating Connected and Automated Vehicles in Co-Simulation Environment of Traffic Microsimulation and Vehicle Dynamics

Connected and automated vehicles (CAVs) have the potential to improve many aspects of the current transportation systems such as safety, mobility, and energy efficiency. In order to evaluate the benefits and impacts of a CAV, the CAV control algorithm is typically implemented on vehicles simulated in a traffic microsimulation environment. However, traffic microsimulation usually lacks detailed vehicle and powertrain dynamics, making it challenging to fully understand how a CAV control algorithm will perform and respond on an actual vehicle. Whether the same benefits measured in the simulation will also be observed in real-world remains an open question. One potential approach to fill in this gap is to conduct a co-simulation of traffic microsimulation with detailed vehicle and powertrain dynamics models, often developed in MATLAB Simulink. However, current microsimulation tools such as VISSIM and SUMO do not have a ready-to-use interface for co-simulation with vehicle dynamics and Simulink. Also, even if such an interface exists, it will be tool-specific, making it challenging to shift from one tool to another or test CAV controls in different tools. There are needs for tool-agnostic co-simulation as different microsimulation tools have their pros and cons, and researchers often need to use different tools based on the purposes of the simulation, project needs, and applications. In this work, Flexible Interface for X-in-the-loop Simulation (FIXS) is developed that can support the co-simulation of microsimulation, CAV control algorithm, and vehicle dynamics model in Simulink. Enabled by the FIXS, the benefit and performance of a CAV control algorithm can be better understood with the consideration of vehicle responses and dynamics. The connection to VISSIM and SUMO is handled internally by the interface, and users can easily switch tools by changing a configuration file. The co-simulation capability is demonstrated for a VISSIM eco-approach and departure CAV scenario and a SUMO cooperative merging scenario for both a passenger CAV and a class 8 heavy-duty connected and automated trucks.

Shao, Yunli↗

Computational aerodynamics requirements: The future role of the computer and the needs of the aerospace industry

The commercial airplane builder's viewpoint on the important issues involved in the development of improved computational aerodynamics tools such as powerful computers optimized for fluid flow problems is presented. The primary user of computational aerodynamics in a commercial aircraft company is the design engineer who is concerned with solving practical engineering problems. From his viewpoint, the development of program interfaces and pre-and post-processing capability for new computational methods is just as important as the algorithms and machine architecture. As more and more details of the entire flow field are computed, the visibility of the output data becomes a major problem which is then doubled when a design capability is added. The user must be able to see, understand, and interpret the results calculated. Enormous costs are expanded because of the need to work with programs having only primitive user interfaces.

Rubbert, P. E.↗

ArborX 2.0

ArborX library tackles a problem of efficiently finding geometric objects that are close in space. Variations of this problem, such as finding the nearest neighbors of a point, or finding all objects within a certain distance, are inherent components of applications in many fields. The data may be large so that solving the problem efficiently may require significant computational resources, such as multiple processors or accelerators such as general purpose GPUs. ArborX' main advantage in its ability to solve large problems efficiently utilizing a combination of distributed and on-node parallelism. ArborX can be run efficiently on a wide variety of hardware, including GPUs from different vendors, which distinguishes it from other available libraries which typically choose only few of these. The other advantage is that it supports both types of user problems: spatial problems (useful for intersections and finding objects within certain distance), and nearest neighbor problems. ArborX also supports flexible interface in its interaction with a user. Particularly, it allows a user to call user's own function on a positive match, a functionality not rarely available in other libraries. ArborX implements construction and traversal algorithms using efficient tree structures, such as bounding volume hierarchy (BVH). At its core, ArborX uses linear BVH for its low construction cost and sufficient quality. ArborX implements both spatial and nearest-neighbor traversal algorithms. ArborX also provides several clustering algorithms (minimum spanning tree, DBSCAN, HDBSCAN*), interpolation using minimum least squares and ray tracing. ArborX is written using C++, and is parallelized using the message passing interface (MPI) for the distributed communication, and the Kokkos library for on-node parallelism. This approach allows ArborX to be run on a wide variety of hardware, from common laptops and desktops to supercomputers while using the same codebase.

Prokopenko, Andrey [Oak Ridge National Laboratory ↗

Integrating Intelligent Hydro-informatics into an effective Early Warning System for risk-informed urban flood management

The urban drainage system constantly facing flooding issues in coastal and urban areas. Robust and accurate urban flood management, particularly considering fast-moving compound floods, is crucial to minimize the impact of flood disasters in coastal cities. Till now, Ho Chi Minh City (HCMC) lacks an effective means of urban flood management because of flood risk communication among residents. Existing flood risk communication tools rely on post-disaster flood model outcomes and data. Therefore, this research proposes a real-time Early Urban Flooding Warning System (EUFWS) integrated with a user-friendly web and app interface. The backbone of this system consists of flood models developed using machine learning (ML) algorithms, combined with big data and Web-GIS visualization, with ML serving as the core for constructing the EUFWS. EUFWS offer several key advantages: they are available at all times, accessible from anywhere, and provide a real-time, multi-user working platform. Additionally, the system is flexible, allowing for the easy addition of components and services and scalable, adjusting to workload demands. EUFWS have been successfully deployed in Thu Duc City, Vietnam, as a case study and are operating effectively. EUFWS have been successfully deployed in Thu Duc City, Vietnam, as a case study and are operating effectively. Research results indicate that EUFWS supported decision-makers to be effectively risk informed and make intelligent decisions during urban flood emergencies. Finally, this underscores the significant potential of integrating ML and information technology to enhance the management of smart urban drainage systems in flood-prone cities worldwide.

54 ENVIRONMENTAL SCIENCES↗

Enabling machine learning-ready HPC ensembles with Merlin

With the growing complexity of computational and experimental facilities, many scientific researchers are turning to machine learning (ML) techniques to analyze large scale ensemble data. With complexities such as multi-component workflows, heterogeneous machine architectures, parallel file systems, and batch scheduling, care must be taken to facilitate this analysis in a high performance computing (HPC) environment. Here, we present Merlin, a workflow framework to enable large ML-friendly ensembles of scientific HPC simulations. By augmenting traditional HPC with distributed compute technologies, Merlin aims to lower the barrier for scientific subject matter experts to incorporate ML into their analysis. As a producer–consumer workflow model, Merlin enables multi-machine, cross-batch job, dynamically allocated yet persistent workflows capable of utilizing surge-compute resources. Key features of Merlin are a flexible HPC-centric interface, low per-task overhead, multi-tiered fault recovery, and a hierarchical sampling algorithm that allows for $\mathscr{O}$(N) task execution and $\mathscr{O}$(N ln N) task queuing to ensembles of millions of tasks. In addition to Merlin’s design, we test the algorithm’s performance in an HPC center and demonstrate the ability to enqueue 40 million simulations in 100 s, with a 30 millisecond per-task overhead that is independent of ensemble size. Finally, we describe some example applications that Merlin has enabled on leadership-class HPC resources, such as the ML-augmented optimization of nuclear fusion experiments and the calibration of infectious disease models to study the progression of and possible mitigation strategies for COVID-19.

97 MATHEMATICS AND COMPUTING↗

Resilient Control of Networked Microgrids Using Vertical Federated Reinforcement Learning: Designs and Real-Time Test-Bed Validations

Improving system-level resiliency of networked microgrids against adversarial cyber-attacks is an important aspect in the current regime of increased inverter-based resources (IBRs). To achieve that, this paper contributes in designing a hierarchical control layer, in conjunction with the existing control layers, resilient to adversarial attack signals. Considering model complexities, unknown dynamical behaviors of IBRs, and privacy issues regarding data sharing in multi-party-owned microgrids, designing such a control layer is non-trivial. Here, to tackle these issues, a novel federated reinforcement learning (Fed-RL) method is proposed. To grasp the interconnected dynamics of networked microgrids, the paper develops Federated Soft Actor-Critic (FedSAC) algorithm following the vertical structure of implementing Fed-RL. Next, utilizing the OpenAI Gym interface, we built a custom set-up in GridLAB-D/HELICS co-simulation platform, named Resilient RL Co-simulation (ResRLCoSIM), to train the RL agents with IEEE 123-bus benchmark comprising 3 interconnected microgrids. Finally, the learned policies in the simulation are transferred to the real-time hardware-in-the-loop (HIL) test-bed developed using the high-fidelity Hypersim platform. Finally, experiments show that the simulator-trained RL controllers achieve desirable performance with the test-bed platform, validating the minimization of the sim-to-real gap.

24 POWER TRANSMISSION AND DISTRIBUTION↗

OAST Space Theme Workshop. Volume 3: Working group summary. 4: Software (E-4). A. Summary. B. Technology needs (form 1). C. Priority assessment (form 2)

Only a few efforts are currently underway to develop an adequate technology base for the various themes. Particular attention must be given to software commonality and evolutionary capability, to increased system integrity and autonomy; and to improved communications among the program users, the program developers, and the programs themselves. There is a need for quantum improvement in software development methods and increasing the awareness of software by all concerned. Major thrusts identified include: (1) data and systems management; (2) software technology for autonomous systems; (3) technology and methods for improving the software development process; (4) advances related to systems of software elements including their architecture, their attributes as systems, and their interfaces with users and other systems; and (5) applications of software including both the basic algorithms used in a number of applications and the software specific to a particular theme or discipline area. The impact of each theme on software is assessed.

Source record↗

Structural control research and experiments at NASA/LaRC

The advances made in the area of structural dynamics and control using the flexible beam facility at the NASA Langley Research Center are surveyed. Spectral attention is given to the progress in adaptive control and reliability improvements using advanced control concepts. Both theoretical and experimental results are given to delineate the nature of the work being undertaken. With regard to adaptive control, emphasis is placed on parameter and system identification and on comparisons between competing on-line algorithms. In addition, results are presented for on-line modal control laws that are interfaced to a parameter identification scheme. This gives an on-line distributed adaptive control system. With regard to reliability, a design process is outlined that incorporates reliability over the design mission life.

Montgomery, R. C.↗

Automation of orbit determination functions for National Aeronautics and Space Administration (NASA)-supported satellite missions

The Flight Dynamics Facility (FDF) at Goddard Space Flight Center (GSFC) provides spacecraft trajectory determination for a wide variety of National Aeronautics and Space Administration (NASA)-supported satellite missions, using the Tracking Data Relay Satellite System (TDRSS) and Ground Spaceflight and Tracking Data Network (GSTDN). To take advantage of computerized decision making processes that can be used in spacecraft navigation, the Orbit Determination Automation System (ODAS) was designed, developed, and implemented as a prototype system to automate orbit determination (OD) and orbit quality assurance (QA) functions performed by orbit operations. Based on a machine-resident generic schedule and predetermined mission-dependent QA criteria, ODAS autonomously activates an interface with the existing trajectory determination system using a batch least-squares differential correction algorithm to perform the basic OD functions. The computational parameters determined during the OD are processed to make computerized decisions regarding QA, and a controlled recovery process isactivated when the criteria are not satisfied. The complete cycle is autonomous and continuous. ODAS was extensively tested for performance under conditions resembling actual operational conditions and found to be effective and reliable for extended autonomous OD. Details of the system structure and function are discussed, and test results are presented.

Mardirossian, H.↗

Boundary flexibility method of component mode synthesis using static Ritz vectors

A method of dynamic substructuring is presented which provides for the incorporation of a set of static Ritz vectors, referred to as boundary flexibility vectors, as a replacement and/or supplement to conventional eigenvectors in component mode synthesis. The suggested boundary flexibility Ritz vectors are generated by an extension of Wilson's load-dependent Ritz vector algorithm for transient dynamic analysis. The extended algorithm is not load-dependent, is applicable to both fixed-and free-interface components, and results in a general component mode synthesis model appropriate for any type of dynamic analysis.

Abdallah, A. A.↗

Automation of orbit determination functions for National Aeronautics and Space Administration (NASA)-supported satellite missions

The Flight Dynamics Facility (FDF) at Goddard Space Flight Center (GSFC) provides spacecraft trajectory determination for a wide variety of National Aeronautics and Space Administration (NASA)-supported satellite missions, using the Tracking Data Relay Satellite System (TDRSS) and Ground Spaceflight and Tracking Data Network (GSTDN). To take advantage of computerized decision making processes that can be used in spacecraft navigation, the Orbit Determination Automation System (ODAS) was designed, developed, and implemented as a prototype system to automate orbit determination (OD) and orbit quality assurance (QA) functions performed by orbit operations. Based on a machine-resident generic schedule and predetermined mission-dependent QA criteria, ODAS autonomously activates an interface with the existing trajectory determination system using a batch least-squares differential correction algorithm to perform the basic OD functions. The computational parameters determined during the OD are processed to make computerized decisions regarding QA, and a controlled recovery process is activated when the criteria are not satisfied. The complete cycle is autonomous and continuous. ODAS was extensively tested for performance under conditions resembling actual operational conditions and found to be effective and reliable for extended autonomous OD. Details of the system structure and function are discussed, and test results are presented.

Mardirossian, H.↗