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 73 records · Page 4
All sourcesNASA NTRSDOE OSTI
DOE OSTI2020

Optimization-Driven Scenario Grouping

Scenario decomposition algorithms for stochastic programs compute bounds by dualizing all nonanticipativity constraints and solving individual scenario problems independently. Here, we develop an approach that improves on these bounds by reinforcing a carefully chosen subset of nonanticipativity constraints, effectively placing scenarios into groups. Specifically, we formulate an optimization problem for grouping scenarios that aims to improve the bound by optimizing a proxy metric based on information obtained from evaluating a subset of candidate feasible solutions. We show that the proposed grouping problem is NP-hard in general, identify a polynomially solvable case, and present two formulations for solving the problem: a matching formulation for a special case and a mixed-integer programming formulation for the general case. We use the proposed grouping scheme as a preprocessing step for a particular scenario decomposition algorithm and demonstrate its effectiveness in solving standard test instances of two-stage 0–1 stochastic programs. Using this approach, we are able to prove optimality for all previously unsolved instances of a standard test set. Additionally, we implement this scheme as a preprocessing step for PySP, a publicly available and widely used implementation of progressive hedging, and compare this grouping approach with standard grouping approaches on large-scale stochastic unit commitment instances. Finally, the idea is extended to propose a finitely convergent algorithm for two-stage stochastic programs with a finite feasible region.

97 MATHEMATICS AND COMPUTING↗
NASA NTRS1982

Solidification of a binary mixture

The time dependent concentration and temperature profiles of a finite layer of a binary mixture are investigated during solidification. The coupled time dependent Stefan problem is solved numerically using an implicit finite differencing algorithm with the method of lines. Specifically, the temporal operator is approximated via an implicit finite difference operator resulting in a coupled set of ordinary differential equations for the spatial distribution of the temperature and concentration for each time. Since the resulting differential equations set form a boundary value problem with matching conditions at an unknown spatial point, the method of invariant imbedding is used for its solution.

Antar, B. N.↗
NASA NTRS1987

On the acceleration of charged particles at relativistic shock fronts

The diffusive acceleration of highly relativistic particles at a shock is reconsidered. Using the same physical assumptions as Blandford and Ostriker (1978), but dropping the restriction to nonrelativistic shock velocities, the authors find approximate solutions of the particle kinetic equation by generalizing the diffusion approximation to higher order terms in the anisotropy of the particle distribution. The general solution of the transport equation on either side of the shock is constructed, which involves the solution of an eigenvalue problem. By matching the two solutions at the shock, the spectral index of the resulting power law is found by taking into account a sufficiently large number of eigenfunctions. Low-order truncation corresponds to the standard diffusion approximation and to a somewhat more general method described by Peacock (1981). In addition to the energy spectrum, the method yields the angular distribution of the particles and its spatial dependence.

Kirk, J. G.↗
NASA NTRS1988

Dypas: A dynamic payload scheduler for shuttle missions

Decision and analysis systems have had broad and very practical application areas in the human decision making process. These software systems range from the help sections in simple accounting packages, to the more complex computer configuration programs. Dypas is a decision and analysis system that aids prelaunch shutlle scheduling, and has added functionality to aid the rescheduling done in flight. Dypas is written in Common Lisp on a Symbolics Lisp machine. Dypas differs from other scheduling programs in that it can draw its knowledge from different rule bases and apply them to different rule interpretation schemes. The system has been coded with Flavors, an object oriented extension to Common Lisp on the Symbolics hardware. This allows implementation of objects (experiments) to better match the problem definition, and allows a more coherent solution space to be developed. Dypas was originally developed to test a programmer's aptitude toward Common Lisp and the Symbolics software environment. Since then the system has grown into a large software effort with several programmers and researchers thrown into the effort. Dypas is currently using two expert systems and three inferencing procedures to generate a many object schedule. The paper will review the abilities of Dypas and comment on its functionality.

Davis, Stephen↗
NASA NTRS1993

Pressure-Coupled Acoustic-Transducer Assembly

Improved acoustic-transducer assembly easy to assemble, relocatable, and used at high temperatures. In assembly, piezoelectric acoustic transducer pressure-coupled to delay line or fixture through soft metal like aluminum, copper or gold. Transducer subassembly includes layered structure of coupling material, transducer, thin disk of coupling material acting as cushion for transducer, electrode disk with coaxial cable lead attached, insulation/damping material, and pressure plate. Pressure coupling precludes problem of matching coefficients of thermal expansion of transducer, coupling material, and delay line.

Parker, F. Raymond↗
NASA NTRS1995

Sea surface topography fields of the tropical Pacific from data assimilation

Time series of maps of monthly tropical Pacific dynamic topography anomalies from 1979 through 1985 were constructed by means of assimilation of the tide gauge and expendable bathythermograph (XBT) data into a linear model driven by observed winds. Estimates of error statistics were calculated and compared to actual differences between hindcasts and observations. Four experiements were performed as follows: one with no assimilation, one with assimiation of sea level anomaly data from eight selected island tide gauge stations, one with assimilation of dynamic height anomalies derived from XBT data, and one with both XBT and tide gauge data assimilated. Data from seven additional tide gauge stations were withheld from the assimilation process and used for verification in all four experiements. Statistical objective maps based on data alone were also constructed for comparison purposes. The dynamic response of the model without assimilation was, in general, weaker than the observed response. Assimilation resulted in enhanced signal amplitude in all three assimilation experiments. With few exceptions the error estimated generated by the Kalman filter appeared quite reasonable. Since the error processes cannot be assumed to be white or stationary, we could find no straightforward way to test the formal statistical hypothesis that the time series of differences between the filter ouput and the actual observations were drawn from a population with statistics given by the Kalman filter estimaes. We found that the best filter we could devise was still short of the goal of producing a white innovation sequence. Extensive changes in the assumed error statistics make only marginal differences. The same is true for long time and space scale behavior of different models with richer physics and finer resolution. Better data assimilation results will probably require relaxation of the assumptions of stationarity and serial independence of the errors. Formation of such detailed noise models will require longer time series, with the attendant problems of matching very different data sets.

Miller, Robert N.↗
NASA NTRS2003

Match-bounded String Rewriting Systems

We introduce a new class of automated proof methods for the termination of rewriting systems on strings. The basis of all these methods is to show that rewriting preserves regular languages. To this end, letters are annotated with natural numbers, called match heights. If the minimal height of all positions in a redex is h+1 then every position in the reduct will get height h+1. In a match-bounded system, match heights are globally bounded. Using recent results on deleting systems, we prove that rewriting by a match-bounded system preserves regular languages. Hence it is decidable whether a given rewriting system has a given match bound. We also provide a sufficient criterion for the abence of a match-bound. The problem of existence of a match-bound is still open. Match-boundedness for all strings can be used as an automated criterion for termination, for match-bounded systems are terminating. This criterion can be strengthened by requiring match-boundedness only for a restricted set of strings, for instance the set of right hand sides of forward closures.

Geser, Alfons↗
NASA NTRS2004

How Large Scale Flows in the Solar Convection Zone may Influence Solar Activity

Large scale flows within the solar convection zone are the primary drivers of the Sun s magnetic activity cycle. Differential rotation can amplify the magnetic field and convert poloidal fields into toroidal fields. Poleward meridional flow near the surface can carry magnetic flux that reverses the magnetic poles and can convert toroidal fields into poloidal fields. The deeper, equatorward meridional flow can carry magnetic flux toward the equator where it can reconnect with oppositely directed fields in the other hemisphere. These axisymmetric flows are themselves driven by large scale convective motions. The effects of the Sun s rotation on convection produce velocity correlations that can maintain the differential rotation and meridional circulation. These convective motions can influence solar activity themselves by shaping the large-scale magnetic field pattern. While considerable theoretical advances have been made toward understanding these large scale flows, outstanding problems in matching theory to observations still remain.

Hathaway, D. H.↗
NASA NTRS2004

How Large Scales Flows May Influence Solar Activity

Large scale flows within the solar convection zone are the primary drivers of the Sun's magnetic activity cycle and play important roles in shaping the Sun's magnetic field. Differential rotation amplifies the magnetic field through its shearing action and converts poloidal field into toroidal field. Poleward meridional flow near the surface carries magnetic flux that reverses the magnetic poles at about the time of solar maximum. The deeper, equatorward meridional flow can carry magnetic flux back toward the lower latitudes where it erupts through the surface to form tilted active regions that convert toroidal fields into oppositely directed poloidal fields. These axisymmetric flows are themselves driven by large scale convective motions. The effects of the Sun's rotation on convection produce velocity correlations that can maintain both the differential rotation and the meridional circulation. These convective motions can also influence solar activity directly by shaping the magnetic field pattern. While considerable theoretical advances have been made toward understanding these large scale flows, outstanding problems in matching theory to observations still remain.

Hathaway, D. H.↗
NASA NTRS2013

A Scala DSL for RETE-Based Runtime Verification

Runtime verification (RV) consists in part of checking execution traces against formalized specifications. Several systems have emerged, most of which support specification notations based on state machines, regular expressions, temporal logic, or grammars. The field of Artificial Intelligence (AI) has for an even longer period of time studied rule-based production systems, which at a closer look appear to be relevant for RV, although seemingly focused on slightly different application domains, such as for example business processes and expert systems. The core algorithm in many of these systems is the Rete algorithm. We have implemented a Rete-based runtime verification system, named LogFire (originally intended for offline log analysis but also applicable to online analysis), as an internal DSL in the Scala programming language, using Scala's support for defining DSLs. This combination appears attractive from a practical point of view. Our contribution is in part conceptual in arguing that such rule-based frameworks originating from AI may be suited for RV.

matching problem↗
NASA NTRS2018

Automation of Structural Sizing of Aircraft Concepts Under Static Aeroelastic Constraints

This paper presents an automation process for structural sizing of subsonic and supersonic aircraft concepts under static aeroelastic constraints. The automation process starts with an OpenVSP geometry and ends with a PATRAN plot of a NASTRAN solution for static aeroelastic analysis or optimization. ModelCenter is used to integrate all analysis codes with easy-to-use interfaces. Automation tools are developed to streamline the setup process and avoid user errors. Fuel is distributed by solving an optimization problem to match the center of gravity of aircraft at a specified flight condition. Fuel weights are also automatically attached to the structural model as point masses. All other weights used in FLOPS mission analysis (excluding fuselage and wing structural weights) are automatically attached to or smeared on the structural model. For any given OpenVSP geometry and FLOPS analysis data, a static aeroelastic sizing model for NASTRAN analysis can be generated in a couple of hours. The empirical fuselage and wing structural weights from FLOPS are replaced by structural panel weights from the sized finite-element model. Three supersonic and two subsonic aircraft concepts are used to demonstrate the automation process as a physics-based weight estimation tool for aircraft conceptual design.

Li, Wu↗
NASA NTRS1987

Constraint-based stereo matching

The major difficulty in stereo vision is the correspondence problem that requires matching features in two stereo images. Researchers describe a constraint-based stereo matching technique using local geometric constraints among edge segments to limit the search space and to resolve matching ambiguity. Edge segments are used as image features for stereo matching. Epipolar constraint and individual edge properties are used to determine possible initial matches between edge segments in a stereo image pair. Local edge geometric attributes such as continuity, junction structure, and edge neighborhood relations are used as constraints to guide the stereo matching process. The result is a locally consistent set of edge segment correspondences between stereo images. These locally consistent matches are used to generate higher-level hypotheses on extended edge segments and junctions to form more global contexts to achieve global consistency.

Kuan, D. T.↗
DOE OSTI2016

On Stable Marriages and Greedy Matchings

Research on stable marriage problems has a long and mathematically rigorous history, while that of exploiting greedy matchings in combinatorial scientific computing is a younger and less developed research field. In this paper we consider the relationships between these two areas. In particular we show that several problems related to computing greedy matchings can be formulated as stable marriage problems and as a consequence several recently proposed algorithms for computing greedy matchings are in fact special cases of well known algorithms for the stable marriage problem. However, in terms of implementations and practical scalable solutions on modern hardware, the greedy matching community has made considerable progress. We show that due to the strong relationship between these two fields many of these results are also applicable for solving stable marriage problems.

matching↗