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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 181 records · Page 10

All sources NASA NTRS DOE OSTI

NASA NTRS2013

Bilayer Protograph Codes for Half-Duplex Relay Channels

Direct to Earth return links are limited by the size and power of lander devices. A standard alternative is provided by a two-hops return link: a proximity link (from lander to orbiter relay) and a deep-space link (from orbiter relay to Earth). Although direct to Earth return links are limited by the size and power of lander devices, using an additional link and a proposed coding for relay channels, one can obtain a more reliable signal. Although significant progress has been made in the relay coding problem, existing codes must be painstakingly optimized to match to a single set of channel conditions, many of them do not offer easy encoding, and most of them do not have structured design. A high-performing LDPC (low-density parity-check) code for the relay channel addresses simultaneously two important issues: a code structure that allows low encoding complexity, and a flexible rate-compatible code that allows matching to various channel conditions. Most of the previous high-performance LDPC codes for the relay channel are tightly optimized for a given channel quality, and are not easily adapted without extensive re-optimization for various channel conditions. This code for the relay channel combines structured design and easy encoding with rate compatibility to allow adaptation to the three links involved in the relay channel, and furthermore offers very good performance. The proposed code is constructed by synthesizing a bilayer structure with a pro to graph. In addition to the contribution to relay encoding, an improved family of protograph codes was produced for the point-to-point AWGN (additive white Gaussian noise) channel whose high-rate members enjoy thresholds that are within 0.07 dB of capacity. These LDPC relay codes address three important issues in an integrative manner: low encoding complexity, modular structure allowing for easy design, and rate compatibility so that the code can be easily matched to a variety of channel conditions without extensive re-optimization. The main problem of half-duplex relay coding can be reduced to the simultaneous design of two codes at two rates and two SNRs (signal-to-noise ratios), such that one is a subset of the other. This problem can be addressed by forceful optimization, but a clever method of addressing this problem is via the bilayer lengthened (BL) LDPC structure. This method uses a bilayer Tanner graph to make the two codes while using a concept of "parity forwarding" with subsequent successive decoding that removes the need to directly address the issue of uneven SNRs among the symbols of a given codeword. This method is attractive in that it addresses some of the main issues in the design of relay codes, but it does not by itself give rise to highly structured codes with simple encoding, nor does it give rate-compatible codes. The main contribution of this work is to construct a class of codes that simultaneously possess a bilayer parity- forwarding mechanism, while also benefiting from the properties of protograph codes having an easy encoding, a modular design, and being a rate-compatible code.

Divsalar, Dariush↗

NASA NTRS1973

Robot Vision

The operation of a system is described that is built both to model the vision of primate animals, including man, and serve as a pre-prototype of possible object recognition system. It was employed in a series of experiments to determine the practicability of matching left and right images of a scene to determine the range and form of objects. The experiments started with computer generated random-dot stereograms as inputs and progressed through random square stereograms to a real scene. The major problems were the elimination of spurious matches, between the left and right views, and the interpretation of ambiguous regions, on the left side of an object that can be viewed only by the left camera, and on the right side of an object that can be viewed only by the right camera.

Sutro, L. L.↗

DOE OSTI2019

Approximation algorithms in combinatorial scientific computing

We survey recent work on approximation algorithms for computing degree-constrained subgraphs in graphs and their applications in combinatorial scientific computing. The problems we consider include maximization versions of cardinality matching, edge-weighted matching, vertex-weighted matching and edge-weighted $b$ -matching, and minimization versions of weighted edge cover and $b$ -edge cover. Exact algorithms for these problems are impractical for massive graphs with several millions of edges. For each problem we discuss theoretical foundations, the design of several linear or near-linear time approximation algorithms, their implementations on serial and parallel computers, and applications. Our focus is on practical algorithms that yield good performance on modern computer architectures with multiple threads and interconnected processors. We also include information about the software available for these problems.

Mathematics↗

NASA NTRS1990

Hierarchical approach to reconstruct surfaces by using iteratively rectified imagery

A new approach to reconstruct the 3D surface of the object space from digital images is described. All the object points obtained by an automatic orientation procedure lead to a first approximation of the surface. Edges are computed for one image and matched to the other image by grey level correlation or least-squares matching through the scale space. To every discrete step in the scale space there exists the digital stereopair (image pyramid), the corresponding surface digital elevation model (DEM), and the warped images. The warped images in this discrete scale space representation correspond to digital orthophotos obtained from the DEMs that result from matching the image pyramid. The warped images will be used on every successive level in the image pyramid in order to reduce the foreshortening problems associated with any area-based matching method.

Schenk, Toni↗

NASA NTRS1989

On the freestream matching condition for stagnation point turbulent flows

The problem of plane stagnation point flow with freestream turbulence is examined from a basic theoretical standpoint. It is argued that the singularity which arises from the standard kappa-epsilon model is not due to a defect in the model but results from the use of an inconsistent freestream boundary condition. The inconsistency lies in the implementation of a production equals dissipation equilibrium hypothesis in conjunction with a freestream mean velocity field that corresponds to homogeneous plane strain - a turbulent flow which does not reach such a simple equilibrium. Consequently, the adjustment that has been made in the constants of the epsilon-transport equation to eliminate this singularity is not self-consistent since it is tantamount to artificially imposing an equilibrium structure on a turbulent flow which is known not to have one.

Speziale, Charles G.↗

NASA NTRS1989

On the freestream matching condition for stagnation point turbulent flows

Speziale, C. G.↗

NASA NTRS2009

Initial Investigation of Operational Concept Elements for NASA's NextGen-Airportal Project Research

The NextGen-Airportal Project is organized into three research focus areas: Safe and Efficient Surface Operations, Coordinated Arrival/Departure Operations Management, and Airportal Transition and Integration Management. The content in this document was derived from an examination of constraints and problems at airports for accommodating future increases in air traffic, and from an examination of capabilities envisioned for NextGen. The concepts are organized around categories of constraints and problems and therefore do not precisely match, but generally reflect, the research focus areas. The concepts provide a framework for defining and coordinating research activities that are, and will be, conducted by the NextGen-Airportal Project. The concepts will help the research activities function as an integrated set focused on future needs for airport operations and will aid aligning the research activities with NextGen key capabilities. The concepts are presented as concept elements with more detailed sub-elements under each concept element. For each concept element, the following topics are discussed: constraints and problems being addressed, benefit descriptions, required technology and infrastructure, and an initial list of potential research topics. Concept content will be updated and more detail added as the research progresses. The concepts are focused on enhancing airportal capacity and efficiency in a timeframe 20 to 25 years in the future, which is similar to NextGen's timeframe.

Lohr, Gary↗

DOE OSTI2014

On Parallel Push-Relabel based Algorithms for Bipartite Maximum Matching

We study multithreaded push-relabel based algorithms for computing maximum cardinality matching in bipartite graphs. Matching is a fundamental combinatorial (graph) problem with applications in a wide variety of problems in science and engineering. We are motivated by its use in the context of sparse linear solvers for computing maximum transversal of a matrix. We implement and test our algorithms on several multi-socket multicore systems and compare their performance to state-of-the-art augmenting path-based serial and parallel algorithms using a testset comprised of a wide range of real-world instances. Building on several heuristics for enhancing performance, we demonstrate good scaling for the parallel push-relabel algorithm. We show that it is comparable to the best augmenting path-based algorithms for bipartite matching. To the best of our knowledge, this is the first extensive study of multithreaded push-relabel based algorithms. In addition to a direct impact on the applications using matching, the proposed algorithmic techniques can be extended to preflow-push based algorithms for computing maximum flow in graphs.

Push-relabel, matching, bipartite↗

DOE OSTI2021

Identity Document to Selfie Face Matching Across Adolescence

Matching live images (“selfies”) to images from ID documents is a problem that can arise in various applications. A challenging instance of the problem arises when the face image on the ID document is from early adolescence and the live image is from later adolescence. We explore this problem using a private dataset called Chilean Young Adult (CHIYA) dataset, where we match live face images taken at age 18-19 to face images on scanned ID documents created at ages 9 to 18. State-of-the-art deep learning face matchers (e.g., ArcFace) have relatively poor accuracy for document-to-selfie face matching. To achieve higher accuracy, we fine-tune the best available open-source model with triplet loss for a few-shot learning. Experiments show that our approach achieves higher accuracy than the DocFace+ model recently developed for this problem. Our fine-tuned model was able to improve the true acceptance rate for the most difficult (largest age span) subset from 62.92% to 96.67% at a false acceptance rate of 0.01%. Our fine-tuned model is available for use by other researchers.

Albiero, Vítor↗

DOE OSTI2016

Exploring the interoperability of remote GPGPU virtualization using rCUDA and directive-based programming models

Directive-based programming models, such as OpenMP, OpenACC, and OmpSs, enable users to accelerate applications by using coprocessors with little effort. These devices offer significant computing power, but their use can introduce two problems: an increase in the total cost of ownership and their underutilization because not all codes match their architecture. Remote accelerator virtualization frameworks address those problems. In particular, rCUDA provides transparent access to any graphic processor unit installed in a cluster, reducing the number of accelerators and increasing their utilization ratio. Joining these two technologies, directive-based programming models and rCUDA, is thus highly appealing. In this work, we study the integration of OmpSs and OpenACC with rCUDA, describing and analyzing several applications over three different hardware configurations that include two InfiniBand interconnections and three NVIDIA accelerators. Our evaluation reveals favorable performance results, showing low overhead and similar scaling factors when using remote accelerators instead of local devices.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2019

Implementation of the Crank‐Nicolson Douglas‐Gunn finite‐difference time domain with complex frequency‐shifted perfectly matched layer for modeling unbounded isotropic dispersive media in two dimensions

Abstract To model open‐domain problems with Drude, Lorentz, and Debye media, the complex frequency‐shifted perfectly matched layer (CFS‐PML) is adopted to truncate the Crank‐Nicolson Douglas‐Gunn finite‐difference time‐domain (CNDG‐FDTD) region. The auxiliary differential equation (ADE) and the bilinear Z ‐transform methods are incorporated separately into the implementations of CNDG‐CFS‐PML formulations, while the ADE, piecewise linear recursive convolution (RC), and trapezoidal RC methods are utilized to model dispersive media. The proposed formulations can not only circumvent the stability condition, but also have the advantages of the CFS‐PML in attenuating the evanescent waves and reducing the late‐time reflection. Three numerical examples have been carried out to validate these formulations. The simulation results show that the proposed CNDG‐CFS‐PML algorithm is efficient in absorbing performance and saving more computational time compared with the conventional FDTD method, which leads to extensive applicability and acts as a very good prospect.

Shi, Xue‐Yang↗

DOE OSTI2022

Inverse Analysis with Variational Autoencoders: A Comparison of Shallow and Deep Networks

Inverse problems are applied to determine unknown properties by matching observational data with a physical model that often takes many parameters as input. To overcome the underconstrained nature of inverse problems and achieve good performance, an approach is presented involving regularization with a technique known as a variational autoencoder (VAE), which is trained to map a high-dimensional parameter space with a complex structure to a low-dimensional latent space with a simple structure. We apply this approach to unconditioned realizations of the parameters (heterogeneous hydraulic fields) for a hydrogeological inverse problem. Two types of hydraulic conductivity fields are used to evaluate the characterization for the different levels of heterogeneity complexity of the physical inputs. This approach keeps the computational cost of generating the training data low. The reason is unconditioned realizations neither rely on the observational data used to perform the inverse analysis nor require any groundwater flow model forward runs. In addition, this approach applies regularization on a low-dimensional latent space from the VAE and increases optimization efficiency through automatic differentiation. Furthermore, two different neural network (NN) structures are tested for their utility in using the VAE for inverse analysis. The performance of a deep, convolutional neural network strongly depends on the dimensionality of the latent space, which requires tuning. In contrast, a shallow, dense neural network provides consistently accurate characterization without tuning. Furthermore, our approach evaluates the advantages of the shallow, dense neural network over the deep, convolutional one and enables future application to a wide range of inverse problems.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS2008

Tests and Techniques for Characterizing and Modeling X-43A Electromechanical Actuators

A series of tests were conducted on the electromechanical actuators of the X-43A research vehicle in preparation for the Mach 7 and 10 hypersonic flights. The tests were required to help validate the actuator models in the simulation and acquire a better understanding of the installed system characteristics. Static and dynamic threshold, multichannel crosstalk, command-to-surface timing, free play, voltage regeneration, calibration, frequency response, compliance, hysteretic damping, and aircraft-in-the-loop tests were performed as part of this effort. This report describes the objectives, configurations, and methods for those tests, as well as the techniques used for developing second-order actuator models from the test results. When the first flight attempt failed because of actuator problems with the launch vehicle, further analysis and model enhancements were performed as part of the return-to-flight activities. High-fidelity models are described, along with the modifications that were required to match measurements taken from the research vehicle. Problems involving the implementation of these models into the X-43A simulation are also discussed. This report emphasizes lessons learned from the actuator testing, simulation modeling, and integration efforts for the X-43A hypersonic research vehicle.

Lin, Yohan↗

DOE OSTI2018

Time and Frequency Domain Methods for Basis Selection in Random Linear Dynamical Systems

Polynomial chaos methods have been extensively used to analyze systems in uncertainty quantification. Furthermore, several approaches exist to determine a low-dimensional approximation (or sparse approximation) for some quantity of interest in a model, where just a few orthogonal basis polynomials are required. In this work, we consider linear dynamical systems consisting of ordinary differential equations with random variables. The aim of this paper is to explore methods for producing low-dimensional approximations of the quantity of interest further. We investigate two numerical techniques to compute a low-dimensional representation, which both fit the approximation to a set of samples in the time domain. On the one hand, a frequency domain analysis of a stochastic Galerkin system yields the selection of the basis polynomials. It follows a linear least squares problem. On the other hand, a sparse minimization yields the choice of the basis polynomials by information from the time domain only. An orthogonal matching pursuit produces an approximate solution of the minimization problem. Finally, we compare the two approaches using a test example from a mechanical application.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2016

SU-C-207B-07: Deep Convolutional Neural Network Image Matching for Ultrasound Guidance in Radiotherapy

Purpose: Robust matching of ultrasound images is a challenging problem as images of the same anatomy often present non-trivial differences. This poses an obstacle for ultrasound guidance in radiotherapy. Thus our objective is to overcome this obstacle by designing and evaluating an image blocks matching framework based on a two channel deep convolutional neural network. Methods: We extend to 3D an algorithmic structure previously introduced for 2D image feature learning [1]. To obtain the similarity between two 3D image blocks A and B, the 3D image blocks are divided into 2D patches Ai and Bi. The similarity is then calculated as the average similarity score of Ai and Bi. The neural network was then trained with public non-medical image pairs, and subsequently evaluated on ultrasound image blocks for the following scenarios: (S1) same image blocks with/without shifts (A and A-shift-x); (S2) non-related random block pairs; (S3) ground truth registration matched pairs of different ultrasound images with/without shifts (A-i and A-reg-i-shift-x). Results: For S1 the similarity scores of A and A-shift-x were 32.63, 18.38, 12.95, 9.23, 2.15 and 0.43 for x=ranging from 0 mm to 10 mm in 2 mm increments. For S2 the average similarity score for non-related block pairs was −1.15. For S3 the average similarity score of ground truth registration matched blocks A-i and A-reg-i-shift-0 (1≤i≤5) was 12.37. After translating A-reg-i-shift-0 by 0 mm, 2 mm, 4 mm, 6 mm, 8 mm, and 10 mm, the average similarity scores of A-i and A-reg-i-shift-x were 11.04, 8.42, 4.56, 2.27, and 0.29 respectively. Conclusion: The proposed method correctly assigns highest similarity to corresponding 3D ultrasound image blocks despite differences in image content and thus can form the basis for ultrasound image registration and tracking.[1] Zagoruyko, Komodakis, “Learning to compare image patches via convolutional neural networks', IEEE CVPR 2015,pp.4353–4361.

60 APPLIED LIFE SCIENCES↗

DOE OSTI2015

On Bipartite Graphs Trees and Their Partial Vertex Covers.

Graphs can be used to model risk management in various systems. Particularly, Caskurlu et al. in [7] have considered a system, which has threats, vulnerabilities and assets, and which essentially represents a tripartite graph. The goal in this model is to reduce the risk in the system below a predefined risk threshold level. One can either restricting the permissions of the users, or encapsulating the system assets. The pointed out two strategies correspond to deleting minimum number of elements corresponding to vulnerabilities and assets, such that the flow between threats and assets is reduced below the predefined threshold level. It can be shown that the main goal in this risk management system can be formulated as a Partial Vertex Cover problem on bipartite graphs. It is well-known that the Vertex Cover problem is in P on bipartite graphs, however; the computational complexity of the Partial Vertex Cover problem on bipartite graphs has remained open. In this paper, we establish that the Partial Vertex Cover problem is NP-hard on bipartite graphs, which was also recently independently demonstrated [N. Apollonio and B. Simeone, Discrete Appl. Math., 165 (2014), pp. 37–48; G. Joret and A. Vetta, preprint, arXiv:1211.4853v1 [cs.DS], 2012]. We then identify interesting special cases of bipartite graphs, for which the Partial Vertex Cover problem, the closely related Budgeted Maximum Coverage problem, and their weighted extensions can be solved in polynomial time. We also present an 8/9-approximation algorithm for the Budgeted Maximum Coverage problem in the class of bipartite graphs. We show that this matches and resolves the integrality gap of the natural LP relaxation of the problem and improves upon a recent 4/5-approximation.

97 MATHEMATICS AND COMPUTING↗

DOE OSTI2021

Molecular structure retrieval directly from laboratory-frame photoelectron spectra in laser-induced electron diffraction

Ubiquitous to most molecular scattering methods is the challenge to retrieve bond distance and angle from the scattering signals since this requires convergence of pattern matching algorithms or fitting methods. This problem is typically exacerbated when imaging larger molecules or for dynamic systems with little a priori knowledge. Here, we employ laser-induced electron diffraction (LIED) which is a powerful means to determine the precise atomic configuration of an isolated gas-phase molecule with picometre spatial and attosecond temporal precision. We introduce a simple molecular retrieval method, which is based only on the identification of critical points in the oscillating molecular interference scattering signal that is extracted directly from the laboratory-frame photoelectron spectrum. The method is compared with a Fourier-based retrieval method, and we show that both methods correctly retrieve the asymmetrically stretched and bent field-dressed configuration of the asymmetric top molecule carbonyl sulfide (OCS), which is confirmed by our quantum-classical calculations.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

DOE OSTI2019

Domain decomposition and multiscale mortar mixed finite element methods for linear elasticity with weak stress symmetry

Two non-overlapping domain decomposition methods are presented for the mixed finite element formulation of linear elasticity with weakly enforced stress symmetry. The methods utilize either displacement or normal stress Lagrange multiplier to impose interface continuity of normal stress or displacement, respectively. By eliminating the interior subdomain variables, the global problem is reduced to an interface problem, which is then solved by an iterative procedure. The condition number of the resulting algebraic interface problem is analyzed for both methods. A multiscale mortar mixed finite element method for the problem of interest on non-matching multiblock grids is also studied. It uses a coarse scale mortar finite element space on the non-matching interfaces to approximate the trace of the displacement and impose weakly the continuity of normal stress. A priori error analysis is performed. It is shown that, with appropriate choice of the mortar space, optimal convergence on the fine scale is obtained for the stress, displacement, and rotation, as well as some superconvergence for the displacement. Computational results are presented in confirmation of the theory of all proposed methods.

Mathematics↗