Search NASA⌕ Search

SEARCH · Search NASA

Results for “satisfiability problems”

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

Distributed Ada: Methodology, notation and tools

The task of creating software to run on a distributed system brings with it many problems not encountered in a uni-processor environment. The designer, in addition to creating a solution to meet the functional requirements of the applicaiton, must determine how to distribute that functionality in order to meet the nonfunctional requirements such as performance and fault tolerance. In the traditional approach to building distributed software systems, decisions of how to partition the software must be made early in the design process so that a separate program can be written for each of the processors in the system. This design paradigm is extremely vulnerable to changes in the target hardware environment, as well as being sensitive to poor initial guesses about what distribution of functionality will satisfy the nonfunctional requirements. The paradigm is also weak in that no compiler has a complete view of the system. Many of the advantages of using a powerful language system are lost in a one-program-per-processor environment. Another approach to the development of distributed software systems, Honeywell's Distributed Ada program, is presented.

Eisenhauer, Greg↗
NASA NTRSDate not supplied

Multidisciplinary Design Optimization of Low-Boom Supersonic Aircraft with Mission Constraints

Design of low-boom supersonic aircraft is heavily dictated by aircraft volume and lift distributions. These unique design characteristics make it a challenge to enforce mission requirements (such as static margins and trim requirements) during design optimization. This low-boom design challenge is resolved by using reversed equivalent area targets for low-fidelity low-boom design and a decomposition method for multidisciplinary design optimization(MDO).The corresponding low-boom MDO problem includes aircraft mission constraints for cruise ranges, cruise speeds, trim margin for low-boom cruise, static margins for takeoff/cruise/landing, tail rotation angles for trim at takeoff/landing, takeoff/landing field lengths, and approach velocity, as well as volume constraints for cabin and main landing gear packaging. The decomposition method is developed to optimally resolve the conflicts between the low-boom design objective and other design constraints. The decomposition method is successfully applied to design a low-boom supersonic configuration that carries 40 passengers, has low-boom cruise of Mach 1.6 with range ≥ 2,500 nm, and can also cruise at Mach 1.8 with range ≥ 3,600 nm. The generated configuration satisfies all specified mission constraints and has the potential to achieve a low-boom ground noise level below 75 PLdB.

Wu Li↗
DOE OSTI2020

Towards a classification of rank r $\mathscr{N}$ = 2 SCFTs. Part II. Special Kahler stratification of the Coulomb branch

We study the stratification of the singular locus of four dimensional $\mathscr{N}$ = 2 Coulomb branches. We present a set of self-consistency conditions on this stratification which can be used to extend the classification of scale-invariant rank 1 Coulomb branch geometries to two complex dimensions, and beyond. The calculational simplicity of the arguments presented here stems from the fact that the main ingredients needed - the rank 1 deformation patterns and the pattern of inclusions of rank 2 strata - are discrete topological data which satisfy strong self-consistency conditions through their relationship to the central charges of the SCFT. This relationship of the stratification data to the central charges is used here, but is derived and explained in a companion paper by one of the authors. We illustrate the use of these conditions by re-analyzing many previously-known examples of rank 2 SCFTs, and also by finding examples of new theories. The power of these conditions stems from the fact that for Coulomb branch stratifications a conjecturally complete list of physically allowed “elementary slices” is known. By contrast, constraining the possible elementary slices of symplectic singularities relevant for Higgs branch stratifications remains an open problem.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS2020

Multidisciplinary Design Optimization of Low-Boom Supersonic Aircraft with Mission Constraints

Conceptual design of low-boom supersonic aircraft is heavily dictated by aircraft volume and lift distributions. These unique design characteristics make it a challenge to enforce mission requirements (such as static margins and trim requirements) during design optimization. This low-boom design challenge is resolved by using reversed equivalent area targets for low-fidelity low-boom inverse design and a block coordinate optimization (BCO) method for multidisciplinary design optimization (MDO). The corresponding low-boom MDO problem includes aircraft mission constraints on ranges, cruise speeds, trim for low-boom cruise, static margins for takeoff/cruise/landing, takeoff/landing field lengths, approach velocity, and tail rotation angles for trim at takeoff/landing, as well as fuselage volume constraints for passengers and main gear storage. The BCO method is developed to optimally resolve the conflicts between the low-boom inverse design objective and other design constraints. This method is successfully applied to design a low-boom supersonic configuration that carries 40 passengers, flies a low-boom mission with cruise Mach of 1.6 and range of 2,500 nm, and cruises overwater at Mach 1.8 with range of 3,600 nm. The generated configuration satisfies all specified mission constraints and has the potential to match a reversed equivalent area target with ground noise level below 70 PLdB.

Multidisciplinary design optimization↗
DOE OSTI2021

A Comparison of Exact and Model Exchange–Correlation Potentials for Molecules

Accurate exchange–correlation (XC) potentials for three-dimensional systems–via solution of the inverse density functional theory (DFT) problem–are now available to test the quality of DFT approximations. Herein, the exact XC potential for seven molecules–dihydrogen at four different bond-lengths, lithium hydride, water, and ortho-benzyne–are computed from full configuration interaction reference densities. These are compared to model XC potentials from nonlocal (B3LYP, HSE06, SCAN0, and M08-HX) and semilocal/local (SCAN, PBE, and PW92) XC functionals. Whereas for most systems, relative errors in the ground-state densities are O(10 –3 –10 –2 ) , the model XC potentials have much higher errors of O(10 –1 –10 0 ) . Among the model XC functionals, SCAN0 offers the best agreement with the exact XC potential, underlining the significance of satisfying exact conditions as well as including nonlocal effects in XC functionals. This work indicates that tests against the exact XC potential will provide a promising new direction for building more accurate XC functionals for DFT.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗
NASA NTRS1995

Convergence properties of finite-difference hydrodynamics schemes in the presence of shocks

We investigate the asymptotic convergence of finite-difference schemes for the Euler equations when the limiting solution contains shocks. The Lax-Wendroff theorem guarantees that certain conservative schemes converge to correct, physically valid solutions. We focus on two one-dimensional operator-split schemes with explicit artificial-viscosity terms. One, an internal-energy scheme, does not satisfy the assumptions of Lax-Wendroff; the other, a conservative total-energy scheme, does. With viscous lengths chosen proportional to the grid size, we find that both schemes converge to their zero-grid-size limits at the theoretically expected rate, but only the conversative scheme converges toward correct solutions of the inviscid fluid equations. We show that the difference in their behaviors results directly from the presence of shocks in the limiting solution. Empirically, we find that when the viscous lenghts tend toward zero more slowly than the grid size, however the nonconservative scheme also converges toward correct solutions. We characterize the asymptotic behavior of the total-energy scheme in a particular problem in which a shock forms. As the grid is refined, a Cauchy error approaches the expected rate of change slowly. We show that the changes in the artificial viscosity alter the diffusion of small-amplitude waves. The differences associated with such waves make the dominant contribution to the Cauchy error. We formulate an analytic model to relate the rate of approach to the effect of varying diffusion in waves and find quantitative agreement with our numerical results.

Kimoto, Paul A.↗
NASA NTRS2006

Diagnosing a Failed Proof in Fault-Tolerance: A Disproving Challenge Problem

This paper proposes a challenge problem in disproving. We describe a fault-tolerant distributed protocol designed at NASA for use in a fly-by-wire system for next-generation commercial aircraft. An early design of the protocol contains a subtle bug that is highly unlikely to be caught in fault injection testing. We describe a failed proof of the protocol's correctness in a mechanical theorem prover (PVS) with a complex unfinished proof conjecture. We use a model checking suite (SAL) to generate a concrete counterexample to the unproven conjecture to demonstrate the existence of a bug. However, we argue that the effort required in our approach is too high and propose what conditions a better solution would satisfy. We carefully describe the protocol and bug to provide a challenging but feasible case study for disproving research.

Pike, Lee↗
DOE OSTI2022

U-splines: Splines over unstructured meshes

U-splines are a novel approach to the construction of a spline basis for representing smooth objects in Computer-Aided Design (CAD) and Computer-Aided Engineering (CAE). A spline is a piecewise-defined function that satisfies continuity constraints between adjacent cells in a mesh. U-splines differ from existing spline constructions, such as Non-Uniform Rational B-splines (NURBS), subdivision surfaces, T-splines, and hierarchical B-splines, in that they can accommodate local variation in cell size, polynomial degree, and smoothness simultaneously over more varied mesh configurations. Mixed cell types (e.g., triangle and quadrilateral cells in the same mesh) and T-junctions are also supported, although the continuity of interfaces with triangle and tetrahedral cells is limited in the present work. The U-spline algorithm introduces a new technique for using local null space solutions to construct basis functions for the global spline null space problem. The U-spline construction is presented for curves, surfaces, and volumes with higher dimensional generalizations possible. Lastly, a set of requirements are given to ensure that the U-spline basis is positive, forms a partition of unity, is complete, and is locally linearly independent.

42 ENGINEERING↗
DOE OSTI2024

Dynamic Shaping of Grid Response of Multi-Machine Multi-Inverter Systems Through Grid-Forming IBRs

We consider the problem of controlling the frequency response of weakly-coupled multi-machine multi-inverter low-inertia power systems via grid-forming inverter-based resources (IBRs). In contrast to existing methods, our approach relies on dividing the larger system into multiple strongly-coupled subsystems, without ignoring either the underlying network or approximating the subsystem response as an aggregate harmonic mean model. Rather, through a structured clustering and recursive dynamic shaping approach, the frequency response of the overall system to load perturbations is shaped appropriately. We demonstrate the proposed approach for a three-node triangular configuration and a small-scale radial network. Furthermore, previous synchronization analysis for heterogeneous systems requires the machines to satisfy certain proportionality property. In our approach, the effective transfer functions for each cluster can be tuned by the IBRs to satisfy such property, enabling us to apply the shaping control to systems with a wider range of heterogeneous machines.

frequency-shaping control↗
NASA NTRS1973

Control of turbofan lift engines for VTOL aircraft

The use of turbofan engines as lift units for VTOL aircraft poses new engine control problems. At low flight speeds, the lift units must provide the fast thrust response needed for aircraft attitude and height control. The results are presented of an analytical study of the dynamics and control of turbofan lift engines, and methods are proposed for meeting the response requirements imposed by the VTOL aircraft application. Two types of lift fan engines are discussed: the integral and remote. The integral engine is a conventional two-spool, high bypass ratio turbofan designed for low noise and short length. The remote engine employs a gas generator and a lift fan which are separated by a duct, and which need not be coaxial. For the integral engine, a control system design is presented which satisfies the VTOL response requirements. For the remote engine, two unconventional methods of control involving flow transfer between lift units are discussed. Both methods are shown to have thrust response near the required levels.

Sellers, J. F.↗
NASA NTRS1981

An autonomous Nimbus Doppler positioning system

A single-pass Doppler positioning system was developed at the GSFC in support of the Nimbus-6 mission. The system was designed to satisfy the following requirements: compatibility with the PDP 11/70 minicomputer; single-pass recovery of up to 250 positions with a two-sigma accuracy of 5 km; high reliability with a minimum of human interaction; and near real-time responsiveness. The system consists of a numerical integrator which includes only the J2 term (earth flattening) of the earth's gravity field, an editing routine, a first guess algorithm, a least squares position recovery program, and a routine for generating a 95% confidence circle based on a computer covariance matrix. An analysis and quantification of the following error sources that limit system accuracy are presented: orbit error, radial aliasing, computational difficulties with overhead passes, oscillator drift, and ambiguity problems. Results of system reliability tests and sample outputs are included.

Garza-Robles, R.↗
NASA NTRS2009

Hybrid NN/SVM Computational System for Optimizing Designs

A computational method and system based on a hybrid of an artificial neural network (NN) and a support vector machine (SVM) (see figure) has been conceived as a means of maximizing or minimizing an objective function, optionally subject to one or more constraints. Such maximization or minimization could be performed, for example, to optimize solve a data-regression or data-classification problem or to optimize a design associated with a response function. A response function can be considered as a subset of a response surface, which is a surface in a vector space of design and performance parameters. A typical example of a design problem that the method and system can be used to solve is that of an airfoil, for which a response function could be the spatial distribution of pressure over the airfoil. In this example, the response surface would describe the pressure distribution as a function of the operating conditions and the geometric parameters of the airfoil. The use of NNs to analyze physical objects in order to optimize their responses under specified physical conditions is well known. NN analysis is suitable for multidimensional interpolation of data that lack structure and enables the representation and optimization of a succession of numerical solutions of increasing complexity or increasing fidelity to the real world. NN analysis is especially useful in helping to satisfy multiple design objectives. Feedforward NNs can be used to make estimates based on nonlinear mathematical models. One difficulty associated with use of a feedforward NN arises from the need for nonlinear optimization to determine connection weights among input, intermediate, and output variables. It can be very expensive to train an NN in cases in which it is necessary to model large amounts of information. Less widely known (in comparison with NNs) are support vector machines (SVMs), which were originally applied in statistical learning theory. In terms that are necessarily oversimplified to fit the scope of this article, an SVM can be characterized as an algorithm that (1) effects a nonlinear mapping of input vectors into a higher-dimensional feature space and (2) involves a dual formulation of governing equations and constraints. One advantageous feature of the SVM approach is that an objective function (which one seeks to minimize to obtain coefficients that define an SVM mathematical model) is convex, so that unlike in the cases of many NN models, any local minimum of an SVM model is also a global minimum.

Rai, Man Mohan↗
NASA NTRS2012

A Linear Programming Approach to the Development of Contrail Reduction Strategies Satisfying Operationally Feasible Constraints

A class of strategies has been proposed to reduce contrail formation in the United States airspace. A 3D grid based on weather data and the cruising altitude level of aircraft is adjusted to avoid the persistent contrail potential area with the consideration to fuel-efficiency. In this paper, the authors introduce a contrail avoidance strategy on 3D grid by considering additional operationally feasible constraints from an air traffic controller's aspect. First, shifting too many aircraft to the same cruising level will make the miles-in-trail at this level smaller than the safety separation threshold. Furthermore, the high density of aircraft at one cruising level may exceed the workload for the traffic controller. Therefore, in our new model we restrict the number of total aircraft at each level. Second, the aircraft count variation for successive intervals cannot be too drastic since the workload to manage climbing/descending aircraft is much larger than managing cruising aircraft. The contrail reduction is formulated as an integer-programming problem and the problem is shown to have the property of total unimodularity. Solving the corresponding relaxed linear programming with the simplex method provides an optimal and integral solution to the problem. Simulation results are provided to illustrate the methodology.

Wei, Peng↗
NASA NTRS1976

A multilevel approach to sequential detection of pictorial features

The problem of detecting the local similarity between templates in a given class and a given image using a hierarchically ordered sequential decision rule is examined. It is proposed that the set of templates be partitioned and a 'representative template' be defined for each of the partitions. Several levels of partitioning are defined. Elimination of mismatching locations and termination of computation can take place at each level of detection. Each level of testing is over a more restrictive subset of the template class than the previous level. Criteria are given for selecting representative templates, the ordering of components of a template vector for error evaluation, and the threshold sequences to be used in deciding about a 'match'. Suboptimal solutions are given satisfying these criteria. Examples showing recognition of linear features in test patterns and photographs obtained by aerial and spaceborne sensors are provided.

Ramapriyan, H. K.↗
NASA NTRS1995

Formal methods in the design of Ada 1995

Formal, mathematical methods are most useful when applied early in the design and implementation of a software system--that, at least, is the familiar refrain. I will report on a modest effort to apply formal methods at the earliest possible stage, namely, in the design of the Ada 95 programming language itself. This talk is an 'experience report' that provides brief case studies illustrating the kinds of problems we worked on, how we approached them, and the extent (if any) to which the results proved useful. It also derives some lessons and suggestions for those undertaking future projects of this kind. Ada 95 is the first revision of the standard for the Ada programming language. The revision began in 1988, when the Ada Joint Programming Office first asked the Ada Board to recommend a plan for revising the Ada standard. The first step in the revision was to solicit criticisms of Ada 83. A set of requirements for the new language standard, based on those criticisms, was published in 1990. A small design team, the Mapping Revision Team (MRT), became exclusively responsible for revising the language standard to satisfy those requirements. The MRT, from Intermetrics, is led by S. Tucker Taft. The work of the MRT was regularly subject to independent review and criticism by a committee of distinguished Reviewers and by several advisory teams--for example, the two User/Implementor teams, each consisting of an industrial user (attempting to make significant use of the new language on a realistic application) and a compiler vendor (undertaking, experimentally, to modify its current implementation in order to provide the necessary new features). One novel decision established the Language Precision Team (LPT), which investigated language proposals from a mathematical point of view. The LPT applied formal mathematical analysis to help improve the design of Ada 95 (e.g., by clarifying the language proposals) and to help promote its acceptance (e.g., by identifying a verifiable subset that would meet the needs of safety-critical applications). The first LPT project, which ran from the fall of 1990 unti the end of 1992, produced studies of several language issues: optimization, sharing and storage, tasking and protected records, overload resolution, the floating point model, distribution, program erros, and object-oriented programming. The second LPT project, in 1994, formally modeled the dynamic semantics of a large part of the (almost) final language definition, looking especially for interactions between language features.

Guaspari, David↗
DOE OSTI2020

A conservative, consistent, and scalable meshfree mimetic method

Mimetic methods discretize divergence by restricting the Gauss theorem to mesh cells. Because point clouds lack such geometric entities, construction of a compatible meshfree divergence remains a challenge. In this work, we define an abstract Meshfree Mimetic Divergence (MMD) operator on point clouds by contraction of field and virtual face moments. This MMD satisfies a discrete divergence theorem, provides a discrete local conservation principle, and is first-order accurate. We consider two MMD instantiations. The first one assumes a background mesh and uses generalized moving least squares (GMLS) to obtain the necessary field and face moments. This MMD instance is appropriate for settings where a mesh is available but its quality is insufficient for a robust and accurate mesh-based discretization. The second MMD operator retains the GMLS field moments but defines virtual face moments using computationally efficient weighted graph-Laplacian equations. This MMD instance does not require a background grid and is appropriate for applications where mesh generation creates a computational bottleneck. It allows one to trade an expensive mesh generation problem for a scalable algebraic one, without sacrificing compatibility with the divergence operator. We demonstrate the approach by using the MMD operator to obtain a virtual finite-volume discretization of conservation laws on point clouds. Finally, numerical results in the paper confirm the mimetic properties of the method and show that it behaves similarly to standard finite volume methods.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗
NASA NTRS1985

Some properties of n-dimensional triangulations

A number of mathematical results relevant to the problem of constructing a triangulation, i.e., a simplicial tessellation, of the convex hull of an arbitrary finite set of points in n-space are described. The principal results achieved are: (1) a set of n+2 points in n-space may be triangulated in at most 2 different ways; (2) the sphere test defined in this report selects a preferred one of these two triangulations; (3) a set of parameters is defined that permits the characterization and enumeration of all sets of n+2 points in n-space that are significantly different from the point of view of their possible triangulation; (4) the local sphere test induces a global sphere test property for a triangulation; and (5) a triangulation satisfying the global sphere property is dual to the n-dimensional Dirichlet tesselation, i.e., it is a Delaunay triangulation.

Lawson, C. L.↗
NASA NTRS1994

Scheduling with genetic algorithms

In many domains, scheduling a sequence of jobs is an important function contributing to the overall efficiency of the operation. At Boeing, we develop schedules for many different domains, including assembly of military and commercial aircraft, weapons systems, and space vehicles. Boeing is under contract to develop scheduling systems for the Space Station Payload Planning System (PPS) and Payload Operations and Integration Center (POIC). These applications require that we respect certain sequencing restrictions among the jobs to be scheduled while at the same time assigning resources to the jobs. We call this general problem scheduling and resource allocation. Genetic algorithms (GA's) offer a search method that uses a population of solutions and benefits from intrinsic parallelism to search the problem space rapidly, producing near-optimal solutions. Good intermediate solutions are probabalistically recombined to produce better offspring (based upon some application specific measure of solution fitness, e.g., minimum flowtime, or schedule completeness). Also, at any point in the search, any intermediate solution can be accepted as a final solution; allowing the search to proceed longer usually produces a better solution while terminating the search at virtually any time may yield an acceptable solution. Many processes are constrained by restrictions of sequence among the individual jobs. For a specific job, other jobs must be completed beforehand. While there are obviously many other constraints on processes, it is these on which we focussed for this research: how to allocate crews to jobs while satisfying job precedence requirements and personnel, and tooling and fixture (or, more generally, resource) requirements.

Fennel, Theron R.↗