Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “multiple solutions”

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 901 records · Page 50

Image Correlation Pattern Optimization for Micro-Scale In-Situ Strain Measurements

The accuracy and precision of digital image correlation (DIC) is a function of three primary ingredients: image acquisition, image analysis, and the subject of the image. Development of the first two (i.e. image acquisition techniques and image correlation algorithms) has led to widespread use of DIC; however, fewer developments have been focused on the third ingredient. Typically, subjects of DIC images are mechanical specimens with either a natural surface pattern or a pattern applied to the surface. Research in the area of DIC patterns has primarily been aimed at identifying which surface patterns are best suited for DIC, by comparing patterns to each other. Because the easiest and most widespread methods of applying patterns have a high degree of randomness associated with them (e.g., airbrush, spray paint, particle decoration, etc.), less effort has been spent on exact construction of ideal patterns. With the development of patterning techniques such as microstamping and lithography, patterns can be applied to a specimen pixel by pixel from a patterned image. In these cases, especially because the patterns are reused many times, an optimal pattern is sought such that error introduced into DIC from the pattern is minimized. DIC consists of tracking the motion of an array of nodes from a reference image to a deformed image. Every pixel in the images has an associated intensity (grayscale) value, with discretization depending on the bit depth of the image. Because individual pixel matching by intensity value yields a non-unique scale-dependent problem, subsets around each node are used for identification. A correlation criteria is used to find the best match of a particular subset of a reference image within a deformed image. The reader is referred to references for enumerations of typical correlation criteria. As illustrated by Schreier and Sutton and Lu and Cary systematic errors can be introduced by representing the underlying deformation with under-matched shape functions. An important implication, as discussed by Sutton et al., is that in the presence of highly localized deformations (e.g., crack fronts), error can be reduced by minimizing the subset size. In other words, smaller subsets allow the more accurate resolution of localized deformations. Contrarily, the choice of optimal subset size has been widely studied and a general consensus is that larger subsets with more information content are less prone to random error. Thus, an optimal subset size balances the systematic error from under matched deformations with random error from measurement noise. The alternative approach pursued in the current work is to choose a small subset size and optimize the information content within (i.e., optimizing an applied DIC pattern), rather than finding an optimal subset size. In the literature, many pattern quality metrics have been proposed, e.g., sum of square intensity gradient (SSSIG), mean subset fluctuation, gray level co-occurrence, autocorrelation-based metrics, and speckle-based metrics. The majority of these metrics were developed to quantify the quality of common pseudo-random patterns after they have been applied, and were not created with the intent of pattern generation. As such, it is found that none of the metrics examined in this study are fit to be the objective function of a pattern generation optimization. In some cases, such as with speckle-based metrics, application to pixel by pixel patterns is ill-conditioned and requires somewhat arbitrary extensions. In other cases, such as with the SSSIG, it is shown that trivial solutions exist for the optimum of the metric which are ill-suited for DIC (such as a checkerboard pattern). In the current work, a multi-metric optimization method is proposed whereby quality is viewed as a combination of individual quality metrics. Specifically, SSSIG and two auto-correlation metrics are used which have generally competitive objectives. Thus, each metric could be viewed as a constraint imposed upon the others, thereby precluding the achievement of their trivial solutions. In this way, optimization produces a pattern which balances the benefits of multiple quality metrics. The resulting pattern, along with randomly generated patterns, is subjected to numerical deformations and analyzed with DIC software. The optimal pattern is shown to outperform randomly generated patterns.

Bomarito, G. F.↗

Integrated Design Results for the MSR DAC-0.0 Mars Ascent Vehicle

The NASA Mars Sample Return (MSR) Campaign endeavors to return Martian regolith, rock, and atmospheric samples to Earth for scientific study. One of many significant challenges to overcome in the return of these samples lies in transporting them from the Martian surface to space. In order to surmount this challenge, the Campaign has conceptualized the need for a Mars Ascent Vehicle (MAV) to perform this function and deliver Martian samples to orbit. There, the samples will be ejected and captured by a separate spacecraft for return to Earth. Many concepts for a MAV have existed in the past, but it has not been until now that an integrated, detailed design solution has been developed and analyzed. Preliminary assessments of the initial architecture examined multiple methods of propulsion. The team ultimately determined that a Two Stage to Orbit (TSTO) solid propulsion vehicle would provide the most effective performance and be the most technologically ready to support this mission. Following the decision to adopt a TSTO solid propelled vehicle, the first official Design Analysis Cycle, DAC-0.0, was performed in Spring 2020 to formally advance the fidelity of the vehicle to a maturity level acceptable for NASA Key Decision Point A (KDP-A). This paper describes the resultant MAV design concept developed as part of the DAC-0.0 study by the NASA Marshall Space Flight Center (MSFC), in association with the NASA Jet Propulsion Laboratory (JPL). The TSTO vehicle features two solid rocket motors, one powering each stage. Their thrust vectors are controlled with Thrust Vector Control (TVC) systems consisting of independent electromechanical actuators acting on gimballed nozzles. The vehicle is designed to deliver up to 0.47kg of Martian samples to a Mars circular orbit of 343km at 27° inclination. Due to the unique environmental conditions that this vehicle is required to operate in, the subsystem design teams were compelled to develop creative and unorthodox designs to ensure a successful mission. The detailed design and analysis of these subsystems are discussed in this paper and include topics on the MAV Guidance, Navigation, and Control (GNC); structures and mechanisms; integrated vehicle thermal; avionics and flight software; a hydrazine-based Reaction Control System (RCS); aerosciences; and vehicle assembly, integration, and test (AI&T) considerations, among others. Following the conclusion of the MAV DAC-0.0, additional alternative architecture concepts were also studied to further reduce the mass of the overall system. The results of these studies will also be examined in this paper.

Darius Yaghoubi↗

Integrated Design Results for the MSR DAC-0.0 Mars Ascent Vehicle

The NASA Mars Sample Return (MSR) Campaign endeavors to return Martian regolith, rock, and atmospheric samples to Earth for scientific study. One of many significant challenges to overcome in the return of thesesamples lies in transporting them from the Martian surface to space. In order to surmount this challenge, the Campaign has conceptualized the need for a Mars Ascent Vehicle (MAV) to perform this function and deliver Martian samples to orbit. There, the samples will be ejected and captured by a separate spacecraft for return to Earth. Many concepts for a MAV have existed in the past, but it has not been until now that an integrated, detailed design solution has been developed and analyzed. Preliminary assessments of the initial architecture examined multiple methods of propulsion. The team ultimately determined that a Two Stage to Orbit (TSTO) solid propulsion vehicle would provide the most effective performance and be the most technologically ready to support this mission. Following the decision to adopt a TSTO solid propelled vehicle, the first official Design Analysis Cycle, DAC-0.0, was performed in Spring 2020 to formally advance the fidelity of the vehicle to a maturity level acceptable for NASA Key Decision Point A (KDP-A). This paper describes the resultant MAV design concept developed as part of the DAC-0.0 study by the NASA Marshall Space Flight Center (MSFC), in association with the NASA Jet Propulsion Laboratory (JPL). The TSTO vehicle features two solid rocket motors, one powering each stage. Their thrust vectors are controlled with Thrust Vector Control (TVC) systems consisting of independent electromechanical actuators acting on gimballed nozzles. The vehicle is designed to deliver up to 0.47kg of Martian samples to a Mars circular orbit of 343km at 27° inclination. Due to the unique environmental conditions that this vehicle is required to operate in, the subsystem design teams were compelled to develop creative and unorthodox designs to ensure a successful mission. The detailed design and analysis of these subsystems are discussed in this paper and include topics on the MAV Guidance, Navigation, and Control (GNC); structures and mechanisms; integrated vehicle thermal; avionics and flight software; a hydrazine-based Reaction Control System (RCS); aerosciences; and vehicle assembly, integration, and test (AI&T) considerations, among others. Following the conclusion of the MAV DAC-0.0, additional alternative architecture concepts were also studied to further reduce the mass of the overall system.

Mars↗

Representations of Invariant Manifolds for Applications in Three-Body Systems

The Lunar L1 and L2 libration points have been proposed as gateways granting inexpensive access to interplanetary space. To date, only individual solutions to the transfer between three-body systems have been found. The methodology to solve the problem for arbitrary three-body systems and entire families of orbits is currently being studied. This paper presents an initial approach to solve the general problem for single and multiple impulse transfers. Two different methods of representing and storing the invariant manifold data are presented. Some particular solutions are presented for two types of transfer problems, though the emphasis is on developing the methodology for solving the general problem.

Howell, K.↗

On applications of chimera grid schemes to store separation

A finite difference scheme which uses multiple overset meshes to simulate the aerodynamics of aircraft/store interaction and store separation is described. In this chimera, or multiple mesh, scheme, a complex configuration is mapped using a major grid about the main component of the configuration, and minor overset meshes are used to map each additional component such as a store. As a first step in modeling the aerodynamics of store separation, two dimensional inviscid flow calculations were carried out in which one of the minor meshes is allowed to move with respect to the major grid. Solutions of calibrated two dimensional problems indicate that allowing one mesh to move with respect to another does not adversely affect the time accuracy of an unsteady solution. Steady, inviscid three dimensional computations demonstrate the capability to simulate complex configurations, including closely packed multiple bodies.

Cougherty, F. C.↗

Temporal evolution of the solar wind and the formation of a standing shock

The temporal evolution of the solar wind from one steady state to another is explored when momentum deposition produces multiple critical points in the flow. It is shown that the wind always evolves in time to a new steady state compatible with the solution of the steady state equation of motion. However, for the same initial state and identical asymptotic momentum deposition rate, the temporal evolution pattern of the wind depends on the detailed time history of momentum addition and is therefore not unique. This feature plays an important role in the particular case when multiple (three in this study) steady states exist for identical boundary conditions; each one of these solutions is thus shown to be physically accessible. The details of the temporal evolution pattern of the wind reveal the formation of a shock discontinuity whenever the flow becomes supersonic at a critical point upstream from the initial critical point. If the flow remains supersonic at that inner critical point, the shock can become a standing one, depending on the strength and the temporal history of momentum addition. The results of this study indicate that the time scale required for the solar wind to evolve between steady states is of the order of 30-60 hours. Furthermore, the results also reveal the interesting and novel phenomenon that a standing shock is likely to develop in the inner solar wind flow within this time frame, in particular, in coronal hole regions with rapidly diverging geometries.

Habbal, S. R.↗

Fast simultaneous feasibility testing and applications for electrical power grids

Fast simultaneous feasibility testing (SFT) for management of an electrical power grid is achieved through various innovations. The computation problem relates to evaluation of candidate solutions for external power flows into a power grid, with respect to predetermined constraints and contingencies. Storage and computations are reduced by formulating the problem in terms of transactional nodes (e.g. third party connections for generators and loads) instead of the larger number of bus nodes. Further advantages are achieved by precomputing matrices that can be reused across multiple SFT invocations, organizing matrices and operations to reduce storage and computation, and eliminating branches that have no contingency violations. The fast SFT further enables new applications for integrating SFT with a Security-Constrained Unit Commitment (SCUC) optimizer for efficient single pass solutions; operating SFT as a service to multiple SCUC solvers; or integration with Security-Constrained Economic Dispatch (SCED) optimization.

97 MATHEMATICS AND COMPUTING↗

Multiple-compartment venting program

Computer program solves time-dependent energy and state equations for gas reservoirs, using the solutions of conductor conservation equations as mass and energy rate changes to reservoirs.

Leblanc, L. P.↗

FPGA-based hardware/software co-design instrument command-and-control solutions

Traditional design methodology dictates that an instrument electronics platform should consist of a printed circuit board (PCB)—often multiple boards—populated with many components and support electronics. More specifically, each subsystem is composed of numerous integrated circuits (ICs) spread across the board(s), connected with innumerable traces and wires. Additionally, it is often the case that the hardware and software design teams are quite separated—the hardware team designs a board and hands it to a software team, who must then deal with any hardware quirkiness and may need to rewrite software due to inadequately defined interfaces...

Allen, Mark A.↗

Distributed and Secure Spectrum Sharing for 5G and 6G Networks

Secure spectrum sharing or spectrum co-existence of multiple 5G networks and future 6G networks is a powerful enabler technology. The National Spectrum Strategy (NSS) published by the White House in November, 2023, and the subsequent NSS implementation plan led by the National Telecommunication and Information Administration (NTIA) is the driver of a national effort to enable co-existence of government incumbents and commercial networks in selected spectrum bands. Cellular networks such as 5G & 6G and non-cellular Wi-Fi 6E & 7 are the prominent wireless technologies considered for co-existence with incumbent wireless links. Security of the spectrum sharing solutions is a must to make this transformation of spectrum use possible, specially for mission critical communications. However, current spectrum sharing solutions rely on centralized data bases with inherent vulnerabilities. This paper focuses on secure spectrum sharing among multiple 5G networks using unlicensed and shared frequency bands. It presents an innovative AI/ML based distributed spectrum sharing approach that can be autonomously used by multiple networks. Each sharing network uses its own observation of the Radio Frequency (RF) environment, which consists of RF measurements reported from the 5G User Equipment (UE), to adjust the transmission power levels for secure co-existence. Data is presented to illustrate the superior performance of this solution compared to other spectrum sharing solutions where each network can utilize usage data of the other networks. Finally it discusses how this efficient spectrum sharing solution can evolve in the future for the 6G networks.

5G↗

Use of Invariant Manifolds for Transfers Between Three-Body Systems

The Lunar L1 and L2 libration points have been proposed as gateways granting inexpensive access to interplanetary space. To date, only individual solutions to the transfer between three-body systems have been found. The methodology to solve the problem for arbitrary three-body systems and entire families of orbits does not exist. This paper presents the initial approaches to solve the general problem for single and multiple impulse transfers. Two different methods of representing and storing 7-dimensional invariant manifold data are presented. Some particular solutions are presented for the transfer problem, though the emphasis is on developing methodology for solving the general problem.

Beckman, Mark↗

Automation of Vulnerability and Patch Management: Information Extraction, Association, and Optimization

Vulnerability and patch management is an integral part of a robust cybersecurity program, yet it grows increasingly complex due to the sheer amount of data that must be analyzed. Particularly in Operational Technology (OT) environments, analysis must be done manually because of the lack of automated solutions. Additionally, there are many steps in this process, from the initial discovery of the vulnerability to the implementation of its remediation, and each step in the process requires different data in order to be performed effectively. In this work, we provide approaches and strategies to assist operators in industrial or OT environments throughout the vulnerability management cycle. Security advisories provide key information about mitigation strategies, or actions that can be taken when a patch is unavailable or cannot be installed. Details of these strategies are not shared in public vulnerability databases and must be found manually. We approach this problem by designing a solution to automatically identify that information within vendor security advisories and retrieve it for operator use. We start with an approach that requires domain-specific knowledge of certain frequently-seen reference websites. Next, an approach that can work on an arbitrary website but relies on certain keywords. Finally, an approach that uses Natural Language Processing (NLP) methods and does not require specific knowledge or keywords. Each of these approaches is more general than its predecessor; we demonstrate high accuracy for all approaches Advisories also often contain details of affected products in non-standard or natural language formats. While this information can be easily understood when read by an operator, the non-standard format acts as a barrier to effective automation. We provide an approach for the first step in this process: identifying vendors in security advisories and mapping them to a standard framework for representing digital assets and software products. We evaluate five established string similarity algorithms, plus one of our own design that combines string similarity and information theory, on the task of mapping vendors to their corresponding entries in the Common Platform Enumeration (CPE) repository. Our results show that our proposed metric outperforms all others. Due to the constraints on time, finances, and personnel for organizations, Large Language Models (LLMs) may seem like attractive opportunities for security operators to speed up information gathering; however, it is still not clear whether LLMs can handle vulnerability management tasks well. To answer this question, we perform an empirical study of LLMs’ ability to provide consistent, accurate information about vulnerabilities in order to guide organizations in their adoption of LLMs. We observe poor performance for all models tested, suggesting that these models are not well-suited to the consistent retrieval of accurate vulnerability information. Finally, once vulnerabilities have been identified and any additional information has been obtained, operators must decide which remediation actions to implement based on their available resources. This already-complex problem becomes even more so when we consider that a vulnerability may have multiple avenues for remediation. We formulate this scenario as two knapsack problems and provide solutions, which we then compare against several existing strategies for vulnerability prioritization seen in real operational environments.

McClanahan, Kylie↗

Inverse atmospheric radiative transfer problems - A nonlinear minimization search method of solution

The paper studies the inversion of the radiative transfer equation describing the interaction of electromagnetic radiation with atmospheric aerosols. The interaction can be considered as the propagation in the aerosol medium of two light beams: the direct beam in the line-of-sight attenuated by absorption and scattering, and the diffuse beam arising from scattering into the viewing direction, which propagates more or less in random fashion. The latter beam has single scattering and multiple scattering contributions. In the former case and for single scattering, the problem is reducible to first-kind Fredholm equations, while for multiple scattering it is necessary to invert partial integrodifferential equations. A nonlinear minimization search method, applicable to the solution of both types of problems has been developed, and is applied here to the problem of monitoring aerosol pollution, namely the complex refractive index and size distribution of aerosol particles.

Fymat, A. L.↗

Research Trends and Applications of PMUs

This work is a survey of current trends in applications of PMUs. PMUs have the potential to solve major problems in the areas of power system estimation, protection, and stability. A variety of methods are being used for these purposes, including statistical techniques, mathematical transformations, probability, and AI. The results produced by the techniques reviewed in this work are promising, but there is work to be performed in the context of implementation and standardization. As the smart grid initiative continues to advance, the number of intelligent devices monitoring the power grid continues to increase. PMUs are at the center of this initiative, and as a result, each year more PMUs are deployed across the grid. Since their introduction, myriad solutions based on PMU-technology have been suggested. The high sampling rates and synchronized measurements provided by PMUs are expected to drive significant advancements across multiple fields, such as the protection, estimation, and control of the power grid. This work offers a review of contemporary research trends and applications of PMU technology. Most solutions presented in this work were published in the last five years, and techniques showing potential for significant impact are highlighted in greater detail. Being a relatively new technology, there are several issues that must be addressed before PMU-based solutions can be successfully implemented. This survey found that key areas where improvements are needed include the establishment of PMU-observability, data processing algorithms, the handling of heterogeneous sampling rates, and the minimization of the investment in infrastructure for PMU communication. Solutions based on Bayesian estimation, as well as those having a distributed architectures, show great promise. The material presented in this document is tailored to both new researchers entering this field and experienced researchers wishing to become acquainted with emerging trends.

42 ENGINEERING↗

Effects of multiple scattering on scintillation of transionospheric radio signals

Recent development in the optical scintillation theory has been adapted to the ionospheric geometry in order to study the ionospheric scintillation phenomenon in the presence of multiple scattering. Under approximations well satisfied in typical ionospheres for a frequency above about 20 MHz, the first through fourth moment equations have been derived and some analytic solutions given. The fourth moment equation has also been solved numerically. The numerical results show clearly the occurrence of focusing and saturation phenomena. The new multiple-scatter effects are emphasized.

Liu, C. H.↗

Augmenting Parametric Optimal Ascent Trajectory Modeling with Graph Theory

It has been well documented that decisions made in the early stages of Conceptual and Pre-Conceptual design commit up to 80% of total Life-Cycle Cost (LCC) while engineers know the least about the product they are designing [1]. Once within Preliminary and Detailed design however, making changes to the design becomes far more difficult to enact in both cost and schedule. Primarily this has been due to a lack of detailed data usually uncovered later during the Preliminary and Detailed design phases. In our current budget-constrained environment, making decisions within Conceptual and Pre-Conceptual design which minimize LCC while meeting requirements is paramount to a program's success. Within the arena of launch vehicle design, optimizing the ascent trajectory is critical for minimizing the costs present within such concerns as propellant, aerodynamic, aeroheating, and acceleration loads while meeting requirements such as payload delivered to a desired orbit. In order to optimize the vehicle design its constraints and requirements must be known, however as the design cycle proceeds it is all but inevitable that the conditions will change. Upon that change, the previously optimized trajectory may no longer be optimal, or meet design requirements. The current paradigm for adjusting to these updates is generating point solutions for every change in the design's requirements [2]. This can be a tedious, time-consuming task as changes in virtually any piece of a launch vehicle's design can have a disproportionately large effect on the ascent trajectory, as the solution space of the trajectory optimization problem is both non-linear and multimodal [3]. In addition, an industry standard tool, Program to Optimize Simulated Trajectories (POST), requires an expert analyst to produce simulated trajectories that are feasible and optimal [4]. In a previous publication the authors presented a method for combatting these challenges [5]. In order to bring more detailed information into Conceptual and Pre-Conceptual design, knowledge of the effects originating from changes to the vehicle must be calculated. In order to do this, a model capable of quantitatively describing any vehicle within the entire design space under consideration must be constructed. This model must be based upon analysis of acceptable fidelity, which in this work comes from POST. Design space interrogation can be achieved with surrogate modeling, a parametric, polynomial equation representing a tool. A surrogate model must be informed by data from the tool with enough points to represent the solution space for the chosen number of variables with an acceptable level of error. Therefore, Design Of Experiments (DOE) is used to select points within the design space to maximize information gained on the design space while minimizing number of data points required. To represent a design space with a non-trivial number of variable parameters the number of points required still represent an amount of work which would take an inordinate amount of time via the current paradigm of manual analysis, and so an automated method was developed. The best practices of expert trajectory analysts working within NASA Marshall's Advanced Concepts Office (ACO) were implemented within a tool called multiPOST. These practices include how to use the output data from a previous run of POST to inform the next, determining whether a trajectory solution is feasible from a real-world perspective, and how to handle program execution errors. The tool was then augmented with multiprocessing capability to enable analysis on multiple trajectories simultaneously, allowing throughput to scale with available computational resources. In this update to the previous work the authors discuss issues with the method and solutions.

Patrick D Dees↗

Multiple Coarse Grid Multigrid Methods for Solving Elliptic Problems

In this paper we describe some classes of multigrid methods for solving large linear systems arising in the solution by finite difference methods of certain boundary value problems involving Poisson's equation on rectangular regions. If parallel computing systems are used, then with standard multigrid methods many of the processors will be idle when one is working at the coarsest grid levels. We describe the use of Multiple Coarse Grid MultiGrid (MCGMG) methods. Here one first constructs a periodic set of equations corresponding to the given system. One then constructs a set of coarse grids such that for each grid corresponding to the grid size h there are four grids corresponding to the grid size 2*h. Multigrid operations such as restriction of residuals and interpolation of corrections are done in parallel at each grid level. For suitable choices of the multigrid operators the MCGMG method is equivalent to the Parallel Superconvergent MultiGrid (PSMG) method of Frederickson and McBryan. The convergence properties of MCGMG methods can be accurately analyzed using spectral methods.

Xiao, Shengyou↗