Search NASA⌕ Search

SEARCH · Search NASA

Results for “matching problem”

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 199 records · Page 11
All sourcesNASA NTRSDOE OSTI
NASA NTRS1986

Interaction of decaying trailing vortices in ground shear

The drift of trailing vortices in a cross wind near to the ground is modeled by an unsteady, two-dimensional, rotational flowfield with a concentration of large vorticity in spots having finite total strength. The problem is analyzed by a combination of the method of matched asymptotic analyses for the decay of the vortical spots and the Euler solution for the unsteady rotational flow. A primary feature of the numerical scheme is that the grid size and time step depend only the length and velocity scales of the background flow and is independent of the effective core size of a vortical spot which can be much smaller than the grid size. Numerical results are presented to demonstrated the strong interaction between the trajectjories of the vortical spots and the redistribution of vorticity in the background flowfield.

Liu, C. H.↗
NASA NTRS1991

Structural stereopsis - Potential for automatic stereo camera calibration

The paper describes the use of extended edge features as a source of primitives for structural stereopsis and considers the design of a system for autonomous camera calibration. It is shown that the structural approach permits greater use of spatial relational constraints, eliminating the coarse-to-fine tracking of point-based algorithms. Experimental results concerning matching and calibration on real images using Laplacian-of-Gaussian contour fragments as primitives in structural stereopsis are presented, and results in graph-theoretic representation and inexact matches, analytical photogrammetry, and other computer vision and image analysis problem domains are examined. Such a system might be used in aerial photogrammetry and cartography, and robotic vision systems; however, the system is still very much under development.

Boyer, Kim L.↗
NASA NTRS2019

Image Processing Methods for Coronal Hole Segmentation, Matching, and Map Classification

The paper presents the results from a multi-year effort to develop and validate image processing methods forselecting the best physical models based on solar image observations. The approach consists of selecting the physical models based on their agreement with coronal holes extracted from the images. Ultimately, the goal is to use physical models to predict geomagnetic storms. We decompose the problem into three subproblems: (i) coronal hole segmentation based on physical constraints, (ii) matching clusters of coronal holes between different maps, and (iii) physical map classification. For segmenting coronal holes, we develop a multi-modal method that uses segmentation maps from three different methods to initialize a level-set method that evolves the initial coronal hole segmentation to the magnetic boundary. Then, we introducea new method based on Linear Programming for matchingclusters of coronal holes. The final matching is then performedusing Random Forests. The methods were carefully validatedusing consensus maps derived from multiple readers, manualclustering, manual map classification, and method validation for50 maps. The proposed multi-modal segmentation method significantly outperformed SegNet, U-net, Henney-Harvey, and FCNby providing accurate boundary detection. Overall, the methodgave a 95.5% map classification accuracy.

Jatla, Venkatesh↗
NASA NTRS1973

Application of matched asymptotic expansions to lunar and interplanetary trajectories. Volume 2: Derivations of second-order asymptotic boundary value solutions

Previously published asymptotic solutions for lunar and interplanetery trajectories have been modified and combined to formulate a general analytical solution to the problem of N-bodies. The earlier first-order solutions, derived by the method of matched asymptotic expansions, have been extended to second order for the purpose of obtaining increased accuracy. The complete derivation of the second-order solution, including the application of a regorous matching principle, is given. It is shown that the outer and inner expansions can be matched in a region of order mu to the alpha power, where 2/5 alpha 1/2, and mu (the moon/earth or planet/sun mass ratio) is much less than one. The second-order asymptotic solution has been used as a basis for formulating a number of analytical two-point boundary value solutions. These include earth-to-moon, one- and two-impulse moon-to-Earth, and interplanetary solutions. Each is presented as an explicit analytical solution which does not require iterative steps to satisfy the boundary conditions. The complete derivation of each solution is shown, as well as instructions for numerical evaluation. For Vol. 1, see N73-27738.

Lancaster, J. E.↗
NASA NTRS2014

System Engineering of Autonomous Space Vehicles

Human exploration of the solar system requires fully autonomous systems when travelling more than 5 light minutes from Earth. This autonomy is necessary to manage a large, complex spacecraft with limited crew members and skills available. The communication latency requires the vehicle to deal with events with only limited crew interaction in most cases. The engineering of these systems requires an extensive knowledge of the spacecraft systems, information theory, and autonomous algorithm characteristics. The characteristics of the spacecraft systems must be matched with the autonomous algorithm characteristics to reliably monitor and control the system. This presents a large system engineering problem. Recent work on product-focused, elegant system engineering will be applied to this application, looking at the full autonomy stack, the matching of autonomous systems to spacecraft systems, and the integration of different types of algorithms. Each of these areas will be outlined and a general approach defined for system engineering to provide the optimal solution to the given application context.

Watson, Michael D.↗
NASA NTRS1971

Contribution to methods for calculating the flow about thin lifting wings at transonic speeds: Analytic expressions for the far field

The problem of determining the small-disturbance flow about two-dimensional airfoils at transonic speeds has been successfully treated by the process of matching a numerical solution of the near field to analytic expressions for the far field. The three-dimensional problem, it would appear, can be treated in a similar way with the aid of algorithms adapted to high-speed and high-capacity computers. The far-field potential for both lifting and nonlifting three-dimensional wings at transonic speeds is developed herein for a subsonic free stream. This potential could be used for a three-dimensional-wing computation similar to the computation made for the two-dimensional wing.

Klunker, E. B.↗
NASA NTRS1989

Analysis of a turning point problem in flight trajectory optimization

The optimal control policy for the aeroglide portion of the minimum fuel, orbital plane change problem for maneuvering entry vehicles is reduced to the solution of a turning point problem for the bank angle control. For this problem a turning point occurs at the minimum altitude of the flight, when the flight path angle equals zero. The turning point separates the bank angle control into two outer solutions that are valid away from the turning point. In a neighborhood of the turning point, where the bank angle changes rapidly, an inner solution is developed and matched with the two outer solutions. An asymptotic analysis of the turning point problem is given, and an analytic example is provided to illustrate the construction of the bank angle control.

Gracey, C.↗
NASA NTRS1988

Maximum dynamic responses using matched filter theory and random process theory

This paper describes and illustrates two ways of performing time-correlated gust-load calculations. The first is based on Matched Filter Theory; the second on Random Process Theory. The two yield theoretically identical results and both employ novel applications of the theories and unconventional interpretations of the intermediate and final results. Both approaches are computationally fast and are general enough to be applied to dynamic-response problems other than gust loads. A brief mathematical development and example calculations using both Matched Filter Theory and Random Process Theory are presented.

Pototzky, Anthony S.↗
NASA NTRS1961

An Investigation of the Effects of the Time Lag Due to Long Transmission Distances upon Remote Control: Tracking Experiments - Phase 1

A series of pursuit tracking tasks were performed incorporating a transport lag in the control loop. The target was a mixture of four sine waves, the fastest having a frequency of 16 cycles per minute at full speed. An attempt was made to design the experiments so that they would provide data applicable to remote control of a ground vehicle over long transmission distances. Three programs were run. In each the time lag was placed between the control and the display. In the first program a velocity control was used and the operator was told that his knob controlled a vehicle, the problem represented a road 9 and he was to drive his vehicle along the road 9 using the delayed vehicle position as feedback for whatever means he desired. The objective was not to match the display traces. In the second program a velocity control was used, and the operator was told that the problem trace represented a road and the delayed trace represented a vehicle and he was to keep them together. The objective was to match display traces. The third program was identical with the first, except that an acceleration control was used rather than a velocity control. Target speeds used were full speed, 1/2 speed, 1/4 speed, 1/8 speed, and 1/16 speed. Time lags were 1/4 second, l/2 second, 1 second, 1-1/2 second, 2 second, 3 second, and 6 seconds. The experimental results are presented in the last section of this report.

Adams, James L.↗
DOE OSTI2024

The Impact of Wettability on the Co-moving Velocity of Two-Fluid Flow in Porous Media

Abstract The impact of wettability on the co-moving velocity of two-fluid flow in porous media is analyzed herein. The co-moving velocity, developed by Roy et al. (Front Phys 8:4, 2022), is a novel representation of the flow behavior of two fluids through porous media. Our study aims to better understand the behavior of the co-moving velocity by analyzing simulation data under various wetting conditions. We analyzed 46 relative permeability curves based on the Lattice–Boltzmann color fluid model and two experimentally determined relative permeability curves. The analysis of the relative permeability data followed the methodology proposed by Roy et al. (Front Phys 8:4, 2022) to reconstruct a constitutive equation for the co-moving velocity. Surprisingly, the coefficients of the constitutive equation were found to be nearly the same for all wetting conditions. On the basis of these results, a simple approach was proposed to reconstruct the relative permeability of the oil phase using only the co-moving velocity relationship and the relative permeability of the water phase. This proposed method provides new information on the interdependence of the relative permeability curves, which has implications for the history matching of production data and the solution of the associated inverse problem. The research findings contribute to a better understanding of the impact of wettability on fluid flow in porous media and provide a practical approach for estimating relative permeability based on the co-moving velocity relationship, which has never been shown before.

Engineering↗
NASA NTRS1986

A prototype DSN X/S-band feed: Model 3 development

The development of a prototype X/S-band common aperture Cassegrain feedhorn for Deep Space Network (DSN) use is discussed. A Model 3 combiner has been developed to increase S-band bandwidth to include the Highly Elliptical Earth Orbiter band from 2025 to 2110 MHz, and to provide a 400-kW CW S-band uplink and a possible planetary radar band near 2320 MHz. The combiner uses eight S-band waveguide injection slots arranged in four pairs. The problems of this design geometry associated with rejection filtering and X/S-band matching are discussed.

Bathker, D. A.↗
NASA NTRS1994

Microwave vision for robots

Microwave Vision (MV), a concept originally developed in 1985, could play a significant role in the solution to robotic vision problems. Originally our Microwave Vision concept was based on a pattern matching approach employing computer based stored replica correlation processing. Artificial Neural Network (ANN) processor technology offers an attractive alternative to the correlation processing approach, namely the ability to learn and to adapt to changing environments. This paper describes the Microwave Vision concept, some initial ANN-MV experiments, and the design of an ANN-MV system that has led to a second patent disclosure in the robotic vision field.

Lewandowski, Leon↗
NASA NTRS1979

Application of the pseudostate theory to the three-body Lambert problem

The pseudostate theory, which approximates three-body trajectories by overlapping the conic effects of both massive bodies on the third body, has been used to solve boundary value problems. Frequently, the approach to the secondary is quite close, as in interplanetary gravity assist trajectories or satellite tour trajectories. In this case the orbit with respect to the primary is radically changed so that perturbation techniques are time consuming, yet higher accuracy than point-to-point conics (V-infinity matching) is necessary. This method reduces the solution of the three-body Lambert problem to solving two conic Lambert problems and inverting a 7 x 7 matrix, the components of which are all found analytically. Typically 90-95% of the point-to-point conic error with respect to an integrated trajectory is eliminated.

Byrnes, D. V.↗
NASA NTRS1979

On matching the spectrum of Io - Variations in the photometric properties of sulfur-containing mixtures

The problem of comparing laboratory spectra of sulfur-containing binary mixtures with the spectrum of Io is discussed. For the satellite, the observable is the geometric albedo as a function of wavelength, whereas in the laboratory one often measures some other type of albedo. A previous paper demonstrated that for pure sulfur the multiplicative factor which converts the laboratory albedos to geometric albedos can be strongly wavelength dependent. The present paper demonstrates that this is also true for binary sulfur-containing mixtures. Furthermore, there is no universal conversion factor applicable to all binary mixtures, nor can the factor be interpolated for a particular mixture from the conversion factors of the two end members. The conversion factor is a function not only of the specific composition of a binary mixture but also of the relative particle size distributions of the two components, and must be measured specifically for each individual sample if a quantitative comparison between a laboratory sample and Io's surface is desired.

Veverka, J.↗
NASA NTRS1991

A variationally coupled FE-BE method for elasticity and fracture mechanics

A new method for coupling finite element and boundary element subdomains in elasticity and fracture mechanics problems is described. The essential feature of this new method is that a single variational statement is obtained for the entire domain, and in this process the terms associated with tractions on the interfaces between the subdomains are eliminated. This provides the additional advantage that the ambiguities associated with the matching of discontinuous tractions are circumvented. The method leads to a direct procedure for obtaining the discrete equations for the coupled problem without any intermediate steps. In order to evaluate this method and compare it with previous methods, a patch test for coupled procedures has been devised. Evaluation of this variationally coupled method and other methods, such as stiffness coupling and constraint traction matching coupling, shows that this method is substantially superior. Solutions for a series of fracture mechanics problems are also reported to illustrate the effectiveness of this method.

Lu, Y. Y.↗
DOE OSTI2026

Quantum Time-Space Tradeoffs for Matrix Problems

We consider the time and space required for quantum computers to solve a wide variety of problems involving matrices, many of which have only been analyzed classically in prior work. Our main results show that for a range of linear algebra problems—including matrix-vector product, matrix inversion, matrix multiplication and powering—existing classical time-space tradeoffs, several of which are tight for every space bound, also apply to quantum algorithms with at most a constant factor loss. For example, for almost all fixed matrices 𝐴, including the discrete Fourier transform matrix, we prove that quantum circuits with at most 𝑇 input queries and 𝑆 qubits of memory require 𝑇 = Ω⁢(𝑛 2 /𝑆) to compute matrix-vector product 𝐴⁢𝑥 for 𝑥 ∈{0,1 𝑛 . We similarly prove that matrix multiplication for 𝑛 ×𝑛 binary matrices requires 𝑇 = Ω⁢(𝑛 3 /$\sqrt{𝑆}$). Because many of our lower bounds are matched by deterministic algorithms with the same time and space complexity, our results show that quantum computers cannot provide any asymptotic advantage for these problems with any space bound. We obtain matching lower bounds for the stronger notion of quantum cumulative memory complexity—the sum of the space per layer of a circuit. We also consider Boolean (i.e., AND-OR) matrix multiplication and matrix-vector products, improving the previous quantum time-space tradeoff lower bounds for 𝑛 × 𝑛 Boolean matrix multiplication to 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/4 ) from 𝑇 = Ω⁢(𝑛 2.5 /𝑆 1/2 ). Our improved lower bound for Boolean matrix multiplication is based on a new coloring argument that extracts more from the strong direct product theorem that was the basis for prior work. To obtain our tight lower bounds for linear algebra problems, we require much stronger bounds than strong direct product theorems. We obtain these bounds by adding a new bucketing method to the quantum recording-query technique of Zhandry that lets us apply classical arguments to upper bound the success probability of quantum circuits.

lower bounds↗
NASA NTRS1988

Successful expert systems for space shuttle payload integration

Expert systems are successfully applied to solve recurring NASA Space Shuttle orbiter payload integration problems. Recurrence of these problems is the result of each Space Shuttle mission being unique. The NASA Space Shuttle orbiter was designed to be extremely flexible in its ability to handle many types and combinations of satellites and experiments. This flexibility results in different and unique engineering resource requirements for each of the payload satellites and experiments. The first successful expert system to be applied to these problems was the Orbiter Payload Bay Cabling Expert System (EXCABL), developed at Rockwell International Space Transportation Systems Division. The operational version of EXCABL was delivered in 1986 and successfully solved the payload electrical support services cabling layout problem. As a result of this success, a second expert system, Expert Drawing Matching System (EXMATCH), was developed to generate a list of the reusable installation drawings available for each EXCABL solution. EXMATCH went operational in 1987. As a result of these initial successes, the need for a third expert system was defined and is awaiting development. This new Expert System, called Technical Order Listing Expert System (EXTOL), will generate a list of all the applicable reusable installation drawings available to support the total payload bay mission provisioning and installation effort. This paper describes these expert systems, the individual problems that they were designed to solve, their individual solutions, and the degree of success achieved. These expert systems' instantiate the applicability of this technology to the solution of real-world Space Shuttle payload integration problems.

Morris, Keith↗
NASA NTRS2001

Efficiency Improvements to the Displacement Based Multilevel Structural Optimization Algorithm

Multilevel Structural Optimization (MSO) continues to be an area of research interest in engineering optimization. In the present project, the weight optimization of beams and trusses using Displacement based Multilevel Structural Optimization (DMSO), a member of the MSO set of methodologies, is investigated. In the DMSO approach, the optimization task is subdivided into a single system and multiple subsystems level optimizations. The system level optimization minimizes the load unbalance resulting from the use of displacement functions to approximate the structural displacements. The function coefficients are then the design variables. Alternately, the system level optimization can be solved using the displacements themselves as design variables, as was shown in previous research. Both approaches ensure that the calculated loads match the applied loads. In the subsystems level, the weight of the structure is minimized using the element dimensions as design variables. The approach is expected to be very efficient for large structures, since parallel computing can be utilized in the different levels of the problem. In this paper, the method is applied to a one-dimensional beam and a large three-dimensional truss. The beam was tested to study possible simplifications to the system level optimization. In previous research, polynomials were used to approximate the global nodal displacements. The number of coefficients of the polynomials equally matched the number of degrees of freedom of the problem. Here it was desired to see if it is possible to only match a subset of the degrees of freedom in the system level. This would lead to a simplification of the system level, with a resulting increase in overall efficiency. However, the methods tested for this type of system level simplification did not yield positive results. The large truss was utilized to test further improvements in the efficiency of DMSO. In previous work, parallel processing was applied to the subsystems level, where the derivative verification feature of the optimizer NPSOL had been utilized in the optimizations. This resulted in large runtimes. In this paper, the optimizations were repeated without using the derivative verification, and the results are compared to those from the previous work. Also, the optimizations were run on both, a network of SUN workstations using the MPICH implementation of the Message Passing Interface (MPI) and on the faster Beowulf cluster at ICASE, NASA Langley Research Center, using the LAM implementation of UP]. The results on both systems were consistent and showed that it is not necessary to verify the derivatives and that this gives a large increase in efficiency of the DMSO algorithm.

Plunkett, C. L.↗