SEARCH · Search NASA
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.
Computer program, NASKERN developed to aid in evaluation of performances of supercomputers. Consists of seven test-kernel programs performing computations typical of supercomputer calculations. Written in FORTRAN 77.
Convergence properties of controls, trajectories, and feedback kernels analyzed. Report discusses use of factorization techniques to approximate optimal feedback gains in finite-time, linear-regulator/quadratic-cost-function problem of system governed by retarded-functional-difference equations RFDE's with control delays. Presents approach to factorization based on discretization of state penalty leading to simple structure for feedback control law.
The X13/3B flare of 25 April 1984, 0001 UT, was accompanied by intense white light emission that reached a peak power output approx 2x10 to the 29 erg/sec in the optical/near UV continuum; the total energy radiated in the continuum alone reached 10 to the 32 power ergs. This was the most powerful white light flare yet recorded, exceeding the peak output of the largest previously known event by more than one order of magnitude. The flare was a two-ribbon type with intense embedded kernels as observed in both Balmer-alpha line and Balmer continuum, and each of these flare ribbons covered separate umbrae shortly after the maximum of the event. The onset and peak of the white light emission coincided with the onset and peak of the associated E greater than 100 KeV hard X-ray burst, while the 1-8 angstrom soft X-ray emission reached its maximum 4 minutes after the peak in white light.
The fast Fourier transform (FFT) kernel of the NAS benchmark program has been utilized to experiment with the multitasking library on the Cray-2 and Cray X-MP/48, and microtasking directives on the Cray X-MP. Some performance figures are shown, and the state of multitasking software is described.
A 3-by-3 convolver utilizes 9 binary arithmetic units connected in cascade for multiplying 12-bit binary pixel values P sub i which are positive or two's complement binary numbers by 5-bit magnitide (plus sign) weights W sub i which may be positive or negative. The weights are stored in registers including the sign bits. For a negative weight, the one's complement of the pixel value to be multiplied is formed at each unit by a bank of 17 exclusive or gates G sub i under control of the sign of the corresponding weight W sub i, and a correction is made by adding the sum of the absolute values of all the negative weights for each 3-by-3 kernel. Since this correction value remains constant as long as the weights are constant, it can be precomputed and stored in a register as a value to be added to the product PW of the first arithmetic unit.
The following problem is examined: given a nonlinear control system dot-x(t) = f(x/t/) + the sum to m terms (i = 1) u sub i (t)g sub i (x/t/) on R(n) and a point x(0) in R(n), approximate the system near x(0) by a linear system. One approach is to use the usual Taylor series linearization. However, the controllability properties of both the nonlinear and linear systems depend on certain Lie brackets of the vector field under consideration. This suggests that a linear approximation based on Lie bracket matching should be constructed at x(0). In general, the linearizations based on the Taylor method and the Lie bracket approach are different. However, under certain mild assumptions, it is shown that there is a coordinate system for R(n) near x(0) in which these two types of linearizations agree. The importance of this agreement is indicated by examining the time responses of the nonlinear system and its linear approximation and comparing the lower order kernels in Volterra expansions of each.
Solar Maximum Mission soft X-ray data and Sacramento Peak Observatory H-alpha observations are combined in a study of the impulsive phase of a solar flare. A blue asymmetry, indicative of upflows, was observed in the coronal Ca XIX line during the soft X-ray rise phase. A red asymmetry, indicative of downflows, was observed simultaneously in chromospheric H-alpha emitted from bright flare kernels during the period of hard X-ray emission. Combining the velocity data with a measurement of coronal electron density, it is shown that the impulsive phase momentum of upflowing soft X-ray-emitting plasma equalled that of the downflowing H-alpha-emitting plasma to within one order of magnitude. In particular, the momentum of the upflowing plasma was 2 x 10 to the 21st g cm/s while that of the downflowing plasma was 7 x 10 to the 21st g cm/s, with a factor of 2 uncertainty on each value. This equality supports the explosive chromospheric evaporation model of solar flares, in which a sudden pressure increase at the footprint of a coronal loop produces oppositely directed flows in the heated plasma.
The fundamental control synthesis issue of establishing a priori convergence rates of approximation schemes for feedback controllers for a class of distributed parameter systems is addressed within the context of hereditary schemes. Specifically, a factorization approach is presented for deriving approximations to the optimal feedback gains for the linear regulator-quadratic cost problem associated with time-varying functional differential equations with control delays. The approach is based on a discretization of the state penalty which leads to a simple structure for the feedback control law. General properties of the Volterra factors of Hilbert-Schmidt operators are then used to obtain convergence results for the controls, trajectories and feedback kernels. Two algorithms are derived from the basic approximation scheme, including a fast algorithm, in the time-invariant case. A numerical example is also considered.
CLIPS version 4.2 represents major revision of CLIPS code to organize better kernel and to lay groundwork for additional features in future. Includes rule compiler for run-time modules, integrated MicroEMACS editor and online help facility. Cross-reference tool expanded to provide style checking and automatic verification. DEC VAX version line oriented. PC and Macintosh versions each contain windowing variant of CLIPS as well as standard line-oriented version. Written in C.
An abstract approximation framework for the solution of operator algebraic Riccati equations is developed. The approach taken is based on a formulation of the Riccati equation as an abstract nonlinear operator equation on the space of Hilbert-Schmidt operators. Hilbert-Schmidt norm convergence of solutions to generic finite dimensional Galerkin approximations to the Riccati equation to the solution of the original infinite dimensional problem is argued. The application of the general theory is illustrated via an operator Riccati equation arising in the linear-quadratic design of an optimal feedback control law for a 1-D heat/diffusion equation. Numerical results demonstrating the convergence of the associated Hilbert-Schmidt kernels are included.
The flutter boundaries of six thin highly-swept delta-platform wings have been calculated. Comparisons are made between experimental data and results using several aerodynamic methods. The aerodynamic methods used include a subsonic and supersonic kernel function, second order piston theory, and a transonic small disturbance code. The dynamic equations of motion are solved using analytically calculated mode shapes and frequencies.
From runs of standard benchmarks or benchmark suites, it is not possible to characterize the machine nor to predict the run time of other benchmarks which have not been run. A new approach to benchmarking and machine characterization is reported. The creation and use of a machine analyzer is described, which measures the performance of a given machine on FORTRAN source language constructs. The machine analyzer yields a set of parameters which characterize the machine and spotlight its strong and weak points. Also described is a program analyzer, which analyzes FORTRAN programs and determines the frequency of execution of each of the same set of source language operations. It is then shown that by combining a machine characterization and a program characterization, we are able to predict with good accuracy the run time of a given benchmark on a given machine. Characterizations are provided for the Cray-X-MP/48, Cyber 205, IBM 3090/200, Amdahl 5840, Convex C-1, VAX 8600, VAX 11/785, VAX 11/780, SUN 3/50, and IBM RT-PC/125, and for the following benchmark programs or suites: Los Alamos (BMK8A1), Baskett, Linpack, Livermore Loops, Madelbrot Set, NAS Kernels, Shell Sort, Smith, Whetstone and Sieve of Erathostenes.
A validation procedure for the Ada binding of the Graphical Kernel System (GKS) is being developed. PRIOR Data Sciences is also producing a version of the GKS written in Ada. These major software engineering projects will provide an opportunity to demonstrate a sound approach for software testing in an Ada environment. The GKS/Ada validation capability will be a collection of test programs and data, and test management guidelines. These products will be used to assess the correctness, completeness, and efficiency of any GKS/Ada implementation. The GKS/Ada developers will be able to obtain the validation software for their own use. It is anticipated that this validation software will eventually be taken over by an independent standards body to provide objective assessments of GKS/Ada implementations, using an approach similar to the validation testing currently applied to Ada compilers. In the meantime, if requested, this validation software will be used to assess GKS/Ada products. The second project, implementation of GKS using the Ada language, is a conventional software engineering tasks. It represents a large body of Ada code and has some interesting testing problems associated with automatic testing of graphics routines. Here the normal test practices which include automated regression testing, independent quality assistance, test configuration management, and the application of software quality metrics will be employed. The software testing methods emphasize quality enhancement and automated procedures. Ada makes some aspects of testing easier, and introduces some concerns. These issues are addressed.
The Common APSE Interface Set (CAIS) is a proposed MIL-STD intended to promote the portability of Ada Programming Support Environment (APSE) tools written in Ada. The standardized interfaces define a virtual operating system, from which portable tools derive their basic services, e.g., file management, input/output, communications, and process control. In the Ada world, such a virtual operating system is called a Kernel Ada Programming Support Environment (KAPSE). The CAIS is a standardized interface between KAPSEs and tools. The CAIS has been proposed as a starting point for standard interfaces to be used in the NASA Software Support Environment (SSE) for the Space Station Program. The status of the CAIS standardization effort and plans for further development are described.
A major impediment to a systematic attack on Ada software reusability is the lack of an effective taxonomy for software component functions. The scope of all possible applications of Ada software is considered too great to allow the practical development of a working taxonomy. Instead, for the purposes herein, the scope of Ada software application is limited to device and subsystem control in real-time embedded systems. A functional approach is taken in constructing the taxonomy tree for identified Ada domain. The use of modular software functions as a starting point fits well with the object oriented programming philosophy of Ada. Examples of the types of functions represented within the working taxonomy are real time kernels, interrupt service routines, synchronization and message passing, data conversion, digital filtering and signal conditioning, and device control. The constructed taxonomy is proposed as a framework from which a need analysis can be performed to reveal voids in current Ada real-time embedded programming efforts for Space Station.
Some results from a combined experimental and analytical study of the low-speed flutter characteristics of low-aspect-ratio delta wings are presented. Data are presented which show the effects of sweep angle on the flutter characteristics of some simple plate models of constant planform area. The range of sweep angles studied was from 30 to 72 degrees. In addition, flutter results are presented for two 30 deg-sweep clipped-delta wing models. Further, results are presented that show the effects of root clamping (percentage length of the root chord that is cantilevered) for a 45 deg-sweep delta wing. The experimental data are compared with analytical results obtained by using kernel function and doublet lattice subsonic unsteady lifting surface theories.
The NASA Lewis Research Center is investigating the benefits of parallel processing to applications in computational fluid and structural mechanics. To aid this investigation, NASA Lewis is developing the Hypercluster, a multi-architecture, parallel-processing test bed. The initial operating capability (IOC) being developed for the Hypercluster is described. The IOC will provide a user with a programming/operating environment that is interactive, responsive, and easy to use. The IOC effort includes the development of the Hypercluster Operating System (HYCLOPS). HYCLOPS runs in conjunction with a vendor-supplied disk operating system on a Front-End Processor (FEP) to provide interactive, run-time operations such as program loading, execution, memory editing, and data retrieval. Run-time libraries, that augment the FEP FORTRAN libraries, are being developed to support parallel and vector processing on the Hypercluster. Special utilities are being provided to enable passage of information about application programs and their mapping to the operating system. Communications between the FEP and the Hypercluster are being handled by dedicated processors, each running a Message-Passing Kernel, (MPK). A shared-memory interface allows rapid data exchange between HYCLOPS and the communications processors. Input/output handlers are built into the HYCLOPS-MPK interface, eliminating the need for the user to supply separate I/O support programs on the FEP.
In the uniqueness part of a geophysical inverse problem, the observer wants to predict all likely values of P unknown numerical properties z = (z sub 1,...,z sub p) of the earth from measurement of D other numerical properties y(0)=(y sub 1(0),...,y sub D(0)) knowledge of the statistical distribution of the random errors in y(0). The data space Y containing y(0) is D-dimensional, so when the model space X is infinite-dimensional the linear uniqueness problem usually is insoluble without prior information about the correct earth model x. If that information is a quadratic bound on x (e.g., energy or dissipation rate), Bayesian inference (BI) and stochastic inversion (SI) inject spurious structure into x, implied by neither the data nor the quadratic bound. Confidence set inference (CSI) provides an alternative inversion technique free of this objection. CSI is illustrated in the problem of estimating the geomagnetic field B at the core-mantle boundary (CMB) from components of B measured on or above the earth's surface. Neither the heat flow nor the energy bound is strong enough to permit estimation of B(r) at single points on the CMB, but the heat flow bound permits estimation of uniform averages of B(r) over discs on the CMB, and both bounds permit weighted disc-averages with continous weighting kernels. Both bounds also permit estimation of low-degree Gauss coefficients at the CMB. The heat flow bound resolves them up to degree 8 if the crustal field at satellite altitudes must be treated as a systematic error, but can resolve to degree 11 under the most favorable statistical treatment of the crust. These two limits produce circles of confusion on the CMB with diameters of 25 deg and 19 deg respectively.