Search NASASearch

SEARCH · Search NASA

Results for “Simulation methods and programs”

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 19 records

Evaluation of the response to electrons and pions in the scintillating fiber and lead calorimeter for the future electron-ion collider

The performance of the Baby Barrel Electromagnetic Calorimeter (Baby BCAL) — a small-scale lead-scintillating-fiber (Pb/ScFi) prototype of the GlueX Barrel Electromagnetic Calorimeter (BCAL) — was tested in a dedicated beam campaign at the Fermilab Test Beam Facility (FTBF). This study provides a benchmark for the Pb/ScFi component of the future Barrel Imaging Calorimeter (BIC) in the ePIC detector at the Electron-Ion Collider (EIC). The detector response to electrons and pions was studied at beam energies between 4 and 10 GeV, extending previous GlueX tests to a higher energy regime. The calibrated detector exhibits good linearity within uncertainties, and its electron energy resolution meets EIC requirements. The data further constrain the constant term in the energy resolution to below 1.9%, improving upon previous constraints at lower energies. Simulations reproduce key features of the electron and pion data within the limitations of the collected dataset and the FTBF test environment. Electron-pion separation in the test beam setup was analyzed using multiple methods, incorporating varying degrees of beam-related effects. The inclusion of longitudinal shower profile information enhanced the separation performance, underscoring its relevance for the full-scale BIC in ePIC. These results provide essential benchmarks for the Pb/ScFi section of the future BIC, validating detector simulations and guiding optimization strategies for electron-pion discrimination.

47 OTHER INSTRUMENTATION

Runway Scheduling Using Generalized Dynamic Programming

A generalized dynamic programming method for finding a set of pareto optimal solutions for a runway scheduling problem is introduced. The algorithm generates a set of runway fight sequences that are optimal for both runway throughput and delay. Realistic time-based operational constraints are considered, including miles-in-trail separation, runway crossings, and wake vortex separation. The authors also model divergent runway takeoff operations to allow for reduced wake vortex separation. A modeled Dallas/Fort Worth International airport and three baseline heuristics are used to illustrate preliminary benefits of using the generalized dynamic programming method. Simulated traffic levels ranged from 10 aircraft to 30 aircraft with each test case spanning 15 minutes. The optimal solution shows a 40-70 percent decrease in the expected delay per aircraft over the baseline schedulers. Computational results suggest that the algorithm is promising for real-time application with an average computation time of 4.5 seconds. For even faster computation times, two heuristics are developed. As compared to the optimal, the heuristics are within 5% of the expected delay per aircraft and 1% of the expected number of runway operations per hour ad can be 100x faster.

optmization

Simulation, Manual and Computerized (SMAC)

The guiding concept was to develop a simulation modeling method which can be quickly taught and learned, yet can be used to solve significant real world problems. SMAC consists of two manual simulation methods and one computer program. One of the manual methods is designed to impart an understanding of simulation; the other is designed to be a practical simulation method. The computer program will simulate queueing situations with up to five parallel servers or up to three series servers. The program is built around GASP 2A routines and retains the 8K capability of GASP.

Parker, M. W.

XML-Based Generator of C++ Code for Integration With GUIs

An open source computer program has been developed to satisfy a need for simplified organization of structured input data for scientific simulation programs. Typically, such input data are parsed in from a flat American Standard Code for Information Interchange (ASCII) text file into computational data structures. Also typically, when a graphical user interface (GUI) is used, there is a need to completely duplicate the input information while providing it to a user in a more structured form. Heretofore, the duplication of the input information has entailed duplication of software efforts and increases in susceptibility to software errors because of the concomitant need to maintain two independent input-handling mechanisms. The present program implements a method in which the input data for a simulation program are completely specified in an Extensible Markup Language (XML)-based text file. The key benefit for XML is storing input data in a structured manner. More importantly, XML allows not just storing of data but also describing what each of the data items are. That XML file contains information useful for rendering the data by other applications. It also then generates data structures in the C++ language that are to be used in the simulation program. In this method, all input data are specified in one place only, and it is easy to integrate the data structures into both the simulation program and the GUI. XML-to-C is useful in two ways: 1. As an executable, it generates the corresponding C++ classes and 2. As a library, it automatically fills the objects with the input data values.

Hua, Hook

Local-Area-Network Simulator

Local Area Network Extensible Simulator (LANES) computer program provides method for simulating performance of high-speed local-area-network (LAN) technology. Developed as design and analysis software tool for networking computers on board proposed Space Station. Load, network, link, and physical layers of layered network architecture all modeled. Mathematically models according to different lower-layer protocols: Fiber Distributed Data Interface (FDDI) and Star*Bus. Written in FORTRAN 77.

Gibson, Jim

Huygens Titan Probe Trajectory Reconstruction Using Traditional Methods and the Program to Optimize Simulated Trajectories II

On January 14, 2005, ESA's Huygens probe separated from NASA's Cassini spacecraft, entered the Titan atmosphere and landed on its surface. As part of NASA Engineering Safety Center Independent Technical Assessment of the Huygens entry, descent, and landing, and an agreement with ESA, NASA provided results of all EDL analyses and associated findings to the Huygens project team prior to probe entry. In return, NASA was provided the flight data from the probe so that trajectory reconstruction could be done and simulation models assessed. Trajectory reconstruction of the Huygens entry probe at Titan was accomplished using two independent approaches: a traditional method and a POST2-based method. Results from both approaches are discussed in this paper.

Striepe, Scott A.

Program automated documentation methods

The mission analysis and trajectory simulation program is summarized; it provides an understanding of the size and complexity of one simulation for which documentation is mandatory. Programs for automating documentation of subroutines, flow charts, and internal cross reference information are also included.

Lanzano, B. C.

Graphical programming and the use of simulation for space-based manipulators

Robotic manipulators are difficult to program even without the special requirements of a zero-gravity environment. While attention should be paid to investigating the usefulness of industrial application programming methods to space manipulators, new methods with potential application to both environments need to be invented. These methods should allow various levels of autonomy and human-in-the-loop interaction and simple, rapid switching among them. For all methods simulation must be integrated to provide reliability and safety. Graphical programming of manipulators is a candidate for an effective robot programming method despite current limitations in input devices and displays. A research project in task-level robot programming has built an innovative interface to a state-of-the-art commercial simulation and robot programming platform. The prototype demonstrates simple augmented methods for graphical programming and simulation which may be of particular interest to those concerned with Space Station applications; its development has also raised important issues for the development of more sophisticated robot programming tools. Both aspects of the project are discussed.

Mcgrath, Debra S.

Reweighting simulated events using machine-learning techniques in the CMS experiment

Data analyses in particle physics rely on an accurate simulation of particle collisions and a detailed simulation of detector effects to extract physics knowledge from the recorded data. Event generators together with a GEANT -based simulation of the detectors are used to produce large samples of simulated events for analysis by the LHC experiments. These simulations come at a high computational cost, where the detector simulation and reconstruction algorithms have the largest CPU demands. This article describes how machine-learning (ML) techniques are used to reweight simulated samples obtained with a given set of parameters to samples with different parameters or samples obtained from entirely different simulation programs. The ML reweighting method avoids the need for simulating the detector response multiple times by incorporating the relevant information in a single sample through event weights. Results are presented for reweighting to model variations and higher-order calculations in simulated top quark pair production at the LHC. This ML-based reweighting is an important element of the future computing model of the CMS experiment and will facilitate precision measurements at the High-Luminosity LHC.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND

Application of the direct simulation Monte Carlo method to the full shuttle geometry

A new set of programs has been developed for the application of the direct simulation Monte Carlo (or DSMC) method to rarefied gas flows with complex three-dimensional boundaries. The programs are efficient in terms of the computational load and also in terms of the effort required to set up particular cases. This efficiency is illustrated through computations of the flow about the Shuttle Orbiter. The general flow features are illustrated for altitudes from 170 to 100 km. Also, the computed lift-drag ratio during re-entry is compared with flight measurements.

Bird, G. A.

Simulation and evaluation of the Sh-2F helicopter in a shipboard environment using the interchangeable cab system

The operation of the SH-2F helicopter from the decks of small ships in adverse weather was simulated using a large amplitude vertical motion simulator, a wide angle computer generated imagery visual system, and an interchangeable cab (ICAB). The simulation facility, the mathematical programs, and the validation method used to ensure simulation fidelity are described. The results show the simulator to be a useful tool in simulating the ship-landing problem. Characteristics of the ICAB system and ways in which the simulation can be improved are presented.

Paulk, C. H., Jr.

Eliminating Computational Instability In Multibody Simulations

TWOBODY implements improved version of Lagrange multiplier method. Program ultilizes programming technique eliminating computational instability in multibody simulations in which Lagrange multipliers used. In technique, one uses constraint equations, instead of integration, to determine coordinates that are not independent. To illustrate technique, it includes simple mathematical model of solid rocket booster and parachute connected by frictionless swivel. Written in FORTRAN 77.

Watts, Gaines L.

Digital Proxy Simulation of Robotic Hardware

A computer-implemented method, computer program product, and computing system is provided for a digital proxy simulation of robotic hardware. In an implementation, a method may include creating a digital proxy simulation for a robotic hardware wherein the digital simulation and the robotic hardware may share a network interface. a user may be provided with an option to switch between the robotic hardware and the digital proxy simulation. The switch may be executed, upon receiving a user selection, between the robotic hardware and the digital proxy simulation, wherein executing the switch includes transferring input and output signals between the digital proxy simulation and the robotic hardware.

Bacon, James A.

Operations analysis (study 2.1): Program manual and users guide for the LOVES computer code

Information is provided necessary to use the LOVES Computer Program in its existing state, or to modify the program to include studies not properly handled by the basic model. The Users Guide defines the basic elements assembled together to form the model for servicing satellites in orbit. As the program is a simulation, the method of attack is to disassemble the problem into a sequence of events, each occurring instantaneously and each creating one or more other events in the future. The main driving force of the simulation is the deterministic launch schedule of satellites and the subsequent failure of the various modules which make up the satellites. The LOVES Computer Program uses a random number generator to simulate the failure of module elements and therefore operates over a long span of time typically 10 to 15 years. The sequence of events is varied by making several runs in succession with different random numbers resulting in a Monte Carlo technique to determine statistical parameters of minimum value, average value, and maximum value.

Wray, S. T., Jr.