Search NASA⌕ Search

SEARCH · Search NASA

Results for “Problem Solving”

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,171 records · Page 65

Incomplete nested dissection for solving n by n grid problems

Nested dissection orderings are known to be very effective for solving sparse positive definite linear systems which arise from n by n grid problems. In this paper we consider incomplete nested dissection, an ordering which corresponds to the premature termination of nested dissection. Analyses of the arithmetic and storage requirements for incomplete nested dissection are given and the ordering is shown to be competitive with nested dissection with regard to arithmetic operations and superior to that ordering in storage requirements.

George, A.↗

Reactive Collision Avoidance Algorithm

The reactive collision avoidance (RCA) algorithm allows a spacecraft to find a fuel-optimal trajectory for avoiding an arbitrary number of colliding spacecraft in real time while accounting for acceleration limits. In addition to spacecraft, the technology can be used for vehicles that can accelerate in any direction, such as helicopters and submersibles. In contrast to existing, passive algorithms that simultaneously design trajectories for a cluster of vehicles working to achieve a common goal, RCA is implemented onboard spacecraft only when an imminent collision is detected, and then plans a collision avoidance maneuver for only that host vehicle, thus preventing a collision in an off-nominal situation for which passive algorithms cannot. An example scenario for such a situation might be when a spacecraft in the cluster is approaching another one, but enters safe mode and begins to drift. Functionally, the RCA detects colliding spacecraft, plans an evasion trajectory by solving the Evasion Trajectory Problem (ETP), and then recovers after the collision is avoided. A direct optimization approach was used to develop the algorithm so it can run in real time. In this innovation, a parameterized class of avoidance trajectories is specified, and then the optimal trajectory is found by searching over the parameters. The class of trajectories is selected as bang-off-bang as motivated by optimal control theory. That is, an avoiding spacecraft first applies full acceleration in a constant direction, then coasts, and finally applies full acceleration to stop. The parameter optimization problem can be solved offline and stored as a look-up table of values. Using a look-up table allows the algorithm to run in real time. Given a colliding spacecraft, the properties of the collision geometry serve as indices of the look-up table that gives the optimal trajectory. For multiple colliding spacecraft, the set of trajectories that avoid all spacecraft is rapidly searched on-line. The optimal avoidance trajectory is implemented as a receding-horizon model predictive control law. Therefore, at each time step, the optimal avoidance trajectory is found and the first time step of its acceleration is applied. At the next time step of the control computer, the problem is re-solved and the new first time step is again applied. This continual updating allows the RCA algorithm to adapt to a colliding spacecraft that is making erratic course changes.

Scharf, Daniel↗

A variant of nested dissection for solving n by n grid problems

Nested dissection orderings are known to be very effective for solving the sparse positive definite linear systems which arise from n by n grid problems. In this paper nested dissection is shown to be the final step of incomplete nested dissection, an ordering which corresponds to the premature termination of dissection. Analyses of the arithmetic and storage requirements for incomplete nested dissection are given, and the ordering is shown to be competitive with nested dissection under certain conditions.

George, A.↗

Bayesian optimization algorithms for accelerator physics

Accelerator physics relies on numerical algorithms to solve optimization problems in online accelerator control and tasks such as experimental design and model calibration in simulations. The effectiveness of optimization algorithms in discovering ideal solutions for complex challenges with limited resources often determines the problem complexity these methods can address. The accelerator physics community has recognized the advantages of Bayesian optimization algorithms, which leverage statistical surrogate models of objective functions to effectively address complex optimization challenges, especially in the presence of noise during accelerator operation and in resource-intensive physics simulations. In this review article, we offer a conceptual overview of applying Bayesian optimization techniques toward solving optimization problems in accelerator physics. We begin by providing a straightforward explanation of the essential components that make up Bayesian optimization techniques. We then give an overview of current and previous work applying and modifying these techniques to solve accelerator physics challenges. Finally, we explore practical implementation strategies for Bayesian optimization algorithms to maximize their performance, enabling users to effectively address complex optimization challenges in real-time beam control and accelerator design. Published by the American Physical Society 2024

43 PARTICLE ACCELERATORS↗

Improving Cyber Situational Understanding

Effective cybersecurity operations require the ability to analyze large amounts of information to assess security risks and formulate defensive strategies against adversaries. This has become more complex in recent years as the sprawl and interconnectivity of devices grows through implementation of virtualization, cloud computing, and Internet of Things (IoT). The amount of data and analysis required for effective cybersecurity command and control decisions far exceeds humans’ capacity to perform manually. We characterize the analysis problem as cyber situational understanding. The research presented to improve cyber situational understanding focuses on vulnerability analysis and threat intelligence. Regarding vulnerabilities, entities must analyze and plan work for between thousands and tens of thousands of software vulnerabilities annually. Entities heavily use network firewalls to limit vulnerability exposure. As a result, some of these vulnerabilities permit exposure to adversarial exploitation, whereas others are inaccessible and therefore present negligible risk of exploitation. Distinguishing between high and low risk software vulnerabilities requires a deep understanding of the vulnerability, network firewall protection, and characteristics of the targeted device. This problem is solved by extracting network service features from vulnerability data features using both machine-learning and natural language processing. Then, the network firewall topology is parsed to determine which vulnerabilities are reachable by adversaries. Ultimately, a state-based safety analysis ascertains which vulnerabilities are unsafe. A related vulnerability analysis problem occurs in cybersecurity operations when associating an entity’s hardware and software assets to public vulnerability databases. Assets often reveal hardware and software through installation artifacts and network service identification, and entities store these artifacts in inventory databases. However, software and hardware vendors apply a standard Common Platform Enumeration (CPE) naming convention when publicly reporting vulnerabilities. Associating these two datasets often requires many hours to days of manual inspection. The proposed solution automates the mapping approach of human analysts using fuzzy matching techniques, natural language processing, and, ultimately, machine learning to present a small set of recommendations for mapping the two datasets. The result significantly reduces human analysis time and reduces the occurrence of false positives in vulnerability notifications. Finally, cyber threat intelligence (CTI) requires associating cyber observable artifacts, such as IP addresses, URIs, and file hashes, with cyber threat tactics, techniques, and procedures. Unfortunately, most CTI data is compartmentalized across multiple organizations and cannot be shared due to the legal and reputational risk with cyber threat being associated with the entity. The approach to solving this problem inovlves using a distributed ledger with anonymous token spending and authentication. This allows a consortium of semi-trusted entities to share the workload of curating CTI for a threat sharing community’s cooperative benefit.

Huff, Philip↗

Technology application at Rockwell International

Technology diffusion at Rockwell International has progressed from the application of special skills to solve specific problems to the transfer of the required people and skills to allow the commercial divisions to solve their own problems and develop or improve their own products. Our prime effort is concentrated on commercial industrial applications. Rockwell's major emphasis on advanced technology utilization is directed through three operational modes, namely, transfer from technologically developed to underdeveloped organizations within the company; transfer between technologically developed organizations to form new operations within the company; and formation of high technology spin-off organizations beyond the corporate entity.

Meechan, C. J.↗

New Interstellar Dust Models Consistent with Interstellar Extinction, Emission and Abundances Constraints

We present new interstellar dust models that are consistent with both, the FUV to near-IR extinction and infrared (IR) emission measurements from the diffuse interstellar medium. The models are characterized by different dust compositions and abundances. The problem we solve consists of determining the size distribution of the various dust components of the model. This problem is a typical ill-posed inversion problem which we solve using the regularization approach. We reproduce the Li Draine (2001, ApJ, 554, 778) results, however their model requires an excessive amount of interstellar silicon (48 ppM of hydrogen compared to the 36 ppM available for an ISM of solar composition) to be locked up in dust. We found that dust models consisting of PAHs, amorphous silicate, graphite, and composite grains made up from silicates, organic refractory, and water ice, provide an improved fit to the extinction and IR emission measurements, while still requiring a subsolar amount of silicon to be in the dust. This research was supported by NASA Astrophysical Theory Program NRA 99-OSS-01.

Zubko, V.↗

Learning to read aloud: A neural network approach using sparse distributed memory

An attempt to solve a problem of text-to-phoneme mapping is described which does not appear amenable to solution by use of standard algorithmic procedures. Experiments based on a model of distributed processing are also described. This model (sparse distributed memory (SDM)) can be used in an iterative supervised learning mode to solve the problem. Additional improvements aimed at obtaining better performance are suggested.

Joglekar, Umesh Dwarkanath↗

Progressive Hedging Decomposition for Solutions of Large-Scale Process Family Design Problems

Rapid, wide-scale deployment of green process systems, such as carbon capture or water desalination systems, is essential for combatting climate change. Methods relying on traditional design or modularity fail to capture the benefits of both economies of numbers and economies of scale. We have proposed process family design, which designs a family of processes simultaneously exploiting opportunities for common elements. In previous work, we explored different optimization formulations to solve this problem. In this work, we develop a decomposition approach to tackle larger problems efficiently. We solve a water desalination case study, which is too large to solve within a reasonable timeframe with the discretization formulation. We exploit the block angular structure of the discretization problem to decompose and solve using Progressive Hedging (PH). We use the open-source Python package mpi-sppy to execute PH which allows us to leverage parallelization and a HPC cluster to further improve solution time.

Stinchfield, Georgia↗

Analysis of solar ultraviolet lines

The formation of the strongest ultra-violet emission lines of Mg II, O I, C II, and C III in the solar atmosphere is studied in detail. The equations of statistical equilibrium and radiative transfer for each ion are solved using a general computer program that is capable of solving non-LTE line-formation problems for arbitrary atmospheric and atomic models. Interpreting the results in terms of the structure of the solar atmosphere, it is concluded that the HSRA atmosphere has a temperature too low by about 500 K near h = 1100 km and that a temperature plateau with T sub e approximately = 18,000 K and width close to 60 km exists in the upper chromosphere. The structure of the solar atmosphere in the range 20,000 to 100,000 K and the effects of microturbulence on the formation of lines are also investigated. Approximate analytic line-formation problems are solved, and more exact solutions are derived later. An attempt is made to make the best possible fit to the Ca II K line center-to-limb profiles with a one-component atmosphere, with an assumed source function and microturbulent velocity.

Chipman, E.↗

Infrared astronomy and the Shuttle

The infrared spectral range extends approximately from 1 micron to 1000 microns. Observations in infrared astronomy are made with the aid of ground-based telescopes and telescopes flown in aircraft, balloons, or rockets. Advantages and drawbacks of infrared studies conducted by different approaches are discussed. Infrared astronomers are looking forward to observations made from orbiting spacecraft. Present plans call for placing a large telescope aboard the Space Shuttle Orbiter for short missions lasting from seven days to three weeks several times a year. However, the occurrence of a pollution of the spacecraft environment by dust particles and gases coming from the spacecraft might present a problem for the observations. Possible approaches for solving this problem are discussed.

Harwit, M.↗

Optical contamination - Its prevention in the XUV spectrographs flown by the U.S. Naval Research Laboratory in the Apollo Telescope Mount

During construction and testing of the XUV spectrographs flown in the ATM by the Naval Research Laboratory, many problems associated with optical contamination were encountered. Solving these problems required setting up a contamination prevention program to select the materials used in constructing the instruments and to delineate procedures in assembling, testing, and storing the instruments. A brief description is given of methods of assessing the effects of contamination and of the procedures used to prevent contamination.

Hunter, W. R.↗

Calculation of Pareto-optimal solutions to multiple-objective problems using threshold-of-acceptability constraints

A technique is presented for the calculation of Pareto-optimal solutions to a multiple-objective constrained optimization problem by solving a series of single-objective problems. Threshold-of-acceptability constraints are placed on the objective functions at each stage to both limit the area of search and to mathematically guarantee convergence to a Pareto optimum.

Giesy, D. P.↗

Multi-Level Adaptive Techniques (MLAT) for singular-perturbation problems

The multilevel (multigrid) adaptive technique, a general strategy of solving continuous problems by cycling between coarser and finer levels of discretization is described. It provides very fast general solvers, together with adaptive, nearly optimal discretization schemes. In the process, boundary layers are automatically either resolved or skipped, depending on a control function which expresses the computational goal. The global error decreases exponentially as a function of the overall computational work, in a uniform rate independent of the magnitude of the singular-perturbation terms. The key is high-order uniformly stable difference equations, and uniformly smoothing relaxation schemes.

Brandt, A.↗

An approximation concepts method for space frame synthesis

A method is presented for the minimum mass design of three dimensional space frames constructed of thin walled rectangular cross-section members. Constraints on nodal displacements and rotations, material stress, local buckling, and cross sectional dimensions are included. A high quality separable approximate problem is formed in terms of the reciprocals of the four section properties of the frame element cross section, replacing all implicit functions with simplified explicit relations. The cross sectional dimensions are efficiently calculated without using multilevel techniques. Several test problems are solved, demonstrating that a series of approximate problem solutions converge rapidly to an optimal design.

Mills-Curran, W. C.↗

Model-size reduction for the analysis of symmetric structures with asymmetric boundary conditions

A simple computational procedure is presented for reducing the size of the analysis model for a symmetric structure with asymmetric boundary conditions to that of the corresponding structure with symmetric boundary conditions. The procedure is based on approximating the asymmetric response of the structure by a linear combination of symmetric and antisymmetric global approximation vectors (or modes). The key elements of the procedure are (1) restructuring the governing finite-element equations to delineate the contributions to the symmetric and antisymmetric components of the asymmetric response, (2) successive application of the finite element method and the classical Rayleigh-Ritz technique. The finite-element method is first used to generate a few global approximation vectors (or modes). Then the amplitudes of these modes are computed by using the Rayleigh-Ritz technique. The effectiveness of the computational procedure is demonstrated by means of numerical examples of linear static problems of shells, and its potential for solving nonlinear problems is discussed.

Noor, Ahmed K.↗

The linear Boltzmann equation in slab geometry - Development and verification of a reliable and efficient solution

The linear Boltzmann equation can be cast in a form mathematically identical to the radiation-transport equation. A multigroup procedure is used to reduce the energy (or velocity) dependence of the transport equation to a series of one-speed problems. Each of these one-speed problems is equivalent to the monochromatic radiative-transfer problem, and existing software is used to solve this problem in slab geometry. The numerical code conserves particles in elastic collisions. Generic examples are provided to illustrate the applicability of this approach. Although this formalism can, in principle, be applied to a variety of test particle or linearized gas dynamics problems, it is particularly well-suited to study the thermalization of suprathermal particles interacting with a background medium when the thermal motion of the background cannot be ignored. Extensions of the formalism to include external forces and spherical geometry are also feasible.

Stamnes, K.↗