Search NASA⌕ Search

SEARCH · Search NASA

Results for “hierarchy 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 145 records · Page 8

Automated Finite Element Analysis of Elastically-Tailored Plates

A procedure for analyzing and designing elastically tailored composite laminates using the STAGS finite element solver has been presented. The methodology used to produce the elastic tailoring, namely computer-controlled steering of unidirectionally reinforced composite material tows, has been reduced to a handful of design parameters along with a selection of construction methods. The generality of the tow-steered ply definition provides the user a wide variety of options for laminate design, which can be automatically incorporated with any finite element model that is composed of STAGS shell elements. Furthermore, the variable stiffness parameterization is formulated so that manufacturability can be assessed during the design process, plus new ideas using tow steering concepts can be easily integrated within the general framework of the elastic tailoring definitions. Details for the necessary implementation of the tow-steering definitions within the STAGS hierarchy is provided, and the format of the ply definitions is discussed in detail to provide easy access to the elastic tailoring choices. Integration of the automated STAGS solver with laminate design software has been demonstrated, so that the large design space generated by the tow-steering options can be traversed effectively. Several design problems are presented which confirm the usefulness of the design tool as well as further establish the potential of tow-steered plies for laminate design.

Jegley, Dawn C.↗

High Performance Databases For Scientific Applications

The goal for this task is to develop an Extensible File System (ELFS). ELFS attacks the problem of the following: 1. Providing high bandwidth performance architectures; 2. Reducing the cognitive burden faced by applications programmers when they attempt to optimize; and 3. Seamlessly managing the proliferation of data formats and architectural differences. The approach for ELFS solution consists of language and run-time system support that permits the specification on a hierarchy of file classes.

French, James C.↗

Reuse at the Software Productivity Consortium

The Software Productivity Consortium is sponsored by 14 aerospace companies as a developer of software engineering methods and tools. Software reuse and prototyping are currently the major emphasis areas. The Methodology and Measurement Project in the Software Technology Exploration Division has developed some concepts for reuse which they intend to develop into a synthesis process. They have identified two approaches to software reuse: opportunistic and systematic. The assumptions underlying the systematic approach, phrased as hypotheses, are the following: the redevelopment hypothesis, i.e., software developers solve the same problems repeatedly; the oracle hypothesis, i.e., developers are able to predict variations from one redevelopment to others; and the organizational hypothesis, i.e., software must be organized according to behavior and structure to take advantage of the predictions that the developers make. The conceptual basis for reuse includes: program families, information hiding, abstract interfaces, uses and information hiding hierarchies, and process structure. The primary reusable software characteristics are black-box descriptions, structural descriptions, and composition and decomposition based on program families. Automated support can be provided for systematic reuse, and the Consortium is developing a prototype reuse library and guidebook. The software synthesis process that the Consortium is aiming toward includes modeling, refinement, prototyping, reuse, assessment, and new construction.

Weiss, David M.↗

A Generalized approach to the operationalization of Software Quality Models

Comprehensive measures of quality are a research imperative, yet the development of software quality models is a wicked problem. Definitive solutions do not exist and quality is subjective at its most abstract. Definitional measures of quality are contingent on a domain, and even within a domain, the choice of representative characteristics to decompose quality is subjective. Thus, the operationalization of quality models brings even more challenges. A promising approach to quality modeling is the use of hierarchies to represent characteristics, where lower levels of the hierarchy represent concepts closer to real-world observations. Building upon prior hierarchical modeling approaches, we developed the Platform for Investigative software Quality Understanding and Evaluation (PIQUE). PIQUE surmounts several quality modeling challenges because it allows modelers to instantiate abstract hierarchical models in any domain by leveraging organizational tools tailored to their specific contexts. Here, we introduce PIQUE; exemplify its utility with two practical use cases; address challenges associated with parameterizing a PIQUE model; and describe algorithmic techniques that tackle normalization, aggregation, and interpolation of measurements.

Data aggregation↗

NASA B737 flight test results of the total energy control system

The Total Energy Control System (TECS) is an integrated autopilot/autothrottle developed by BCAC that was test flown on NASA Langley's Transport System Research Vehicle (i.e., a highly modified Boeing B737). This systems was developed using principles of total energy in which the total kinetic and potential energy of the airplane was controlled by the throttles, and the energy distribution controled by the elevator. TECS integrates all the control functions of a conventional pitch autopilot and autothrottle into a single generalized control concept. This integration provides decoupled flightpath and maneuver control, as well as a coordinated throttle response for all maneuvers. A mode hierarchy was established to preclude exceeding airplane safety and performance limits. The flight test of TECS took place as a series of five flights over a 33-week period during September 1985 at NASA Langley. Most of the original flight test plan was completed within the first three flights with the system not exhibiting any instabilities or design problems that required any gain adjustment during flight.

Bruce, Kevin R.↗

Development and demonstration of an on-board mission planner for helicopters

Mission management tasks can be distributed within a planning hierarchy, where each level of the hierarchy addresses a scope of action, and associated time scale or planning horizon, and requirements for plan generation response time. The current work is focused on the far-field planning subproblem, with a scope and planning horizon encompassing the entire mission and with a response time required to be about two minutes. The far-feld planning problem is posed as a constrained optimization problem and algorithms and structural organizations are proposed for the solution. Algorithms are implemented in a developmental environment, and performance is assessed with respect to optimality and feasibility for the intended application and in comparison with alternative algorithms. This is done for the three major components of far-field planning: goal planning, waypoint path planning, and timeline management. It appears feasible to meet performance requirements on a 10 Mips flyable processor (dedicated to far-field planning) using a heuristically-guided simulated annealing technique for the goal planner, a modified A* search for the waypoint path planner, and a speed scheduling technique developed for this project.

Deutsch, Owen L.↗

Communications and control for electric power systems

The first section of the report describes the AbNET system, a hardware and software communications system designed for distribution automation (it can also find application in substation monitoring and control). The topology of the power system fixes the topology of the communications network, which can therefore be expected to include a larger number of branch points, tap points, and interconnections. These features make this communications network unlike any other. The network operating software has to solve the problem of communicating to all the nodes of a very complex network in as reliable a way as possible even if the network is damaged, and it has to do so with minimum transmission delays and at minimum cost. The design of the operating protocols is described within the framework of the seven-layer Open System Interconnection hierarchy of the International Standards Organization. Section 2 of the report describes the development and testing of a high voltage sensor based on an electro-optic polymer. The theory of operation is reviewed. Bulk fabrication of the polymer is discussed, as well as results of testing of the electro-optic coefficient of the material. Fabrication of a complete prototype sensor suitable for use in the range 1-20 kV is described. The electro-optic polymer is shown to be an important material for fiber optic sensing applications. Appendix A is theoretical support for this work. The third section of the report presents the application of an artificial neural network, Kohonen's self-organizing feature map, for the classification of power system states. This classifier maps vectors of an N-dimensional space to a 2-dimensional neural net in a nonlinear way preserving the topological order of the input vectors. These mappings are studied using a nonlinear power system model.

Kirkham, H.↗

A flavor of SO(10) unification with a spinor Higgs

We investigate Higgs Parity unification — a realization of SO(10) grand unification based on the Higgs Parity mechanism in which the Standard Model (SM) Higgs resides in a spinor representation. The theory has an intermediate left-right symmetric stage where the SU(2)R symmetry breaking scale is fixed by the vanishing of the SM Higgs quartic coupling. The strong CP problem is solved by parity. Gauge coupling unification successfully predicts αs(MZ) to within 1%. The spinor Higgs naturally leads to a seesaw origin for SM flavor observables. We identify a novel mechanism where large mixing of third generation fermions with additional heavy vector-like fermions accounts for the anarchical nature of the PMNS matrix and the lack of hierarchy in the neutrino mass spectrum, relative to the up-quarks. A fit to quark and lepton masses and mixings, with a minimal parameter set, predicts 1) A testable relation between the top quark mass and αs(MZ) which is about (1 – 2)σ from current best fit values, 2) The order of magnitude of the baryon asymmetry of the universe, via leptogenesis from second-generation right-handed neutrino decays. 3) The proton decay and the neutron EDM are likely observable in next generation experiments, and 4) A normal ordered neutrino mass spectrum where 0νββ decay and the mass of the lightest neutrino are out of reach of next generation experiments.

Baryo-and Leptogenesis↗

Digital simulation of V/STOL aircraft for autopilot research

Simulations of V/STOL aircraft for autopilot research were introduced as examples of large scale systems. A hierarchy of simulations was assembled, and a modular organization was given to the simulations. The dynamics of the system were subdivided into translational and rotational degrees of freedom, based on the different frequencies at which significant variations in motion variables, control forces and moments occur in two subsystems. This is the basis of the autopilot partitioning into two smaller control problems.

Cicolani, L. S.↗

Absorbing boundary conditions for second-order hyperbolic equations

A uniform approach to construct absorbing artificial boundary conditions for second-order linear hyperbolic equations is proposed. The nonlocal boundary condition is given by a pseudodifferential operator that annihilates travelling waves. It is obtained through the dispersion relation of the differential equation by requiring that the initial-boundary value problem admits the wave solutions travelling in one direction only. Local approximation of this global boundary condition yields an nth-order differential operator. It is shown that the best approximations must be in the canonical forms which can be factorized into first-order operators. These boundary conditions are perfectly absorbing for wave packets propagating at certain group velocities. A hierarchy of absorbing boundary conditions is derived for transonic small perturbation equations of unsteady flows. These examples illustrate that the absorbing boundary conditions are easy to derive, and the effectiveness is demonstrated by the numerical experiments.

Jiang, Hong↗

Absorbing boundary conditions for second-order hyperbolic equations

A uniform approach to construct absorbing artificial boundary conditions for second-order linear hyperbolic equations is proposed. The nonlocal boundary condition is given by a pseudodifferential operator that annihilates travelling waves. It is obtained through the dispersion relation of the differential equation by requiring that the initial-boundary value problem admits the wave solutions travelling in one direction only. Local approximation of this global boundary condition yields an nth-order differential operator. It is shown that the best approximations must be in the canonical forms which can be factorized into first-order operators. These boundary conditions are perfectly absorbing for wave packets propagating at certain group velocities. A hierarchy of absorbing boundary conditions is derived for transonic small perturbation equations of unsteady flows. These examples illustrate that the absorbing boundary conditions are easy to derive, and the effectiveness is demonstrated by the numerical experiments.

Jiang, Hong↗

Implementing a unified solver for nonlinearly constrained optimization

SQP and interior-point methods (also referred to as Lagrange-Newton methods) typically share key algorithmic components, such as strategies for computing descent directions and mechanisms that promote global convergence. Building on this insight, we introduce a unifying framework with eight building blocks that abstracts the workflows of Lagrange-Newton methods. We then present Uno, a modular C++ solver that implements our unifying framework and allows the automatic combination of a wide range of strategies with no programming effort from the user. Uno is meant to (1) organize mathematical optimization strategies into a coherent hierarchy; (2) offer a wide range of efficient and robust methods that can be compared for a given instance; (3) enable researchers to experiment with novel optimization strategies; and (4) reduce the cost of development and maintenance of multiple optimization solvers. Uno’s software design allows user to compose new customized solvers for emerging optimization areas such as robust optimization or optimization problems with complementarity constraints, while building on reliable nonlinear optimization techniques. We demonstrate that Uno is highly competitive against state-of-the-art solvers filterSQP, IPOPT, SNOPT, MINOS, LANCELOT, LOQO, and CONOPT on a subset of 429 small problems from the CUTE collection. Uno is available as open-source software under the MIT license at https://github.com/cvanaret/Uno and via its C, Julia, Python, Fortran, and AMPL interfaces.

97 MATHEMATICS AND COMPUTING↗

Combining factual and heuristic knowledge in knowledge acquisition

A knowledge acquisition technique that combines heuristic and factual knowledge represented as two hierarchies is described. These ideas were applied to the construction of a knowledge acquisition interface to the Expert System Analyst (OPERA). The goal of OPERA is to improve the operations support of the computer network in the space shuttle launch processing system. The knowledge acquisition bottleneck lies in gathering knowledge from human experts and transferring it to OPERA. OPERA's knowledge acquisition problem is approached as a classification problem-solving task, combining this approach with the use of factual knowledge about the domain. The interface was implemented in a Symbolics workstation making heavy use of windows, pull-down menus, and other user-friendly devices.

Gomez, Fernando↗

Instructable autonomous agents

In contrast to current intelligent systems, which must be laboriously programmed for each task they are meant to perform, instructable agents can be taught new tasks and associated knowledge. This thesis presents a general theory of learning from tutorial instruction and its use to produce an instructable agent. Tutorial instruction is a particularly powerful form of instruction, because it allows the instructor to communicate whatever kind of knowledge a student needs at whatever point it is needed. To exploit this broad flexibility, however, a tutorable agent must support a full range of interaction with its instructor to learn a full range of knowledge. Thus, unlike most machine learning tasks, which target deep learning of a single kind of knowledge from a single kind of input, tutorability requires a breadth of learning from a broad range of instructional interactions. The theory of learning from tutorial instruction presented here has two parts. First, a computational model of an intelligent agent, the problem space computational model, indicates the types of knowledge that determine an agent's performance, and thus, that should be acquirable via instruction. Second, a learning technique, called situated explanation specifies how the agent learns general knowledge from instruction. The theory is embodied by an implemented agent, Instructo-Soar, built within the Soar architecture. Instructo-Soar is able to learn hierarchies of completely new tasks, to extend task knowledge to apply in new situations, and in fact to acquire every type of knowledge it uses during task performance - control knowledge, knowledge of operators' effects, state inferences, etc. - from interactive natural language instructions. This variety of learning occurs by applying the situated explanation technique to a variety of instructional interactions involving a variety of types of instructions (commands, statements, conditionals, etc.). By taking seriously the requirements of flexible tutorial instruction, Instructo-Soar demonstrates a breadth of interaction and learning capabilities that goes beyond previous instructable systems, such as learning apprentice systems. Instructo-Soar's techniques could form the basis for future 'instructable technologies' that come equipped with basic capabilities, and can be taught by novice users to perform any number of desired tasks.

Huffman, Scott Bradley↗

Automatic blocking of nested loops

Blocked algorithms have much better properties of data locality and therefore can be much more efficient than ordinary algorithms when a memory hierarchy is involved. On the other hand, they are very difficult to write and to tune for particular machines. The reorganization is considered of nested loops through the use of known program transformations in order to create blocked algorithms automatically. The program transformations used are strip mining, loop interchange, and a variant of loop skewing in which invertible linear transformations (with integer coordinates) of the loop indices are allowed. Some problems are solved concerning the optimal application of these transformations. It is shown, in a very general setting, how to choose a nearly optimal set of transformed indices. It is then shown, in one particular but rather frequently occurring situation, how to choose an optimal set of block sizes.

Schreiber, Robert↗

Optimization by decomposition

An algorithm is presented for solving the structural optimization problem as a set of smaller subproblems that correspond to levels of nested substructures. In all three of the algorithm variants presented, the matching was assisted by means of the behavior and optimum sensitivity derivatives. The algorithm is noted to be intrinsically germane to distributed computing, since the subproblems can be concurrently addressed; the algorithm can also be generalized to those multidisciplinary systems whose subsystems can be arranged into a hierarchy of substructure-like dependencies.

Sobieszczanski-Sobieski, Jaroslaw↗

Measurements of three-flavor neutrino oscillations from a PISCES two-detector fit to the NOvA Experiment data

NOvA is a long-baseline neutrino oscillation experiment with two functionally identical detectors: a Near Detector (ND) at Fermilab, placed 1 km from the neutrino source, and a Far Detector (FD) located 810 km away from the ND in Minnesota. NOvA s primary physics goals are to measure the neutrino oscillation parameters $\theta_{23}$ and $\Delta m^2_{32}$ with high precision, determine the neutrino mass hierarchy, and constrain the value of $\delta_{CP}$, primarily via the study of muon neutrino to electron neutrino oscillation. Extracting values for oscillation parameters from fits to data usually relies on treating systematic uncertainties as nuisance parameters, a strategy that suffers from poor scalability as the number of uncertainties becomes larger. This work introduces PISCES (Parameter Inference with Systematic Covariance and Exact Statistics), a novel method that circumvents this scalability problem by encoding systematic uncertainties into a covariance matrix. PISCES utilizes a nested minimization in which optimal systematic pulls are first computed using the covariance matrix in an inner minimization step, then the oscillation parameters are profiled over in the outer minimization. PISCES also uses a Poisson Likelihood term, making it ideal for the inclusion of low-statistic samples in the fits. PISCES is a flexible framework that also supports complex fits, such as a joint Near and Far detector fit. In the standard NOvA analysis, oscillation parameters are extracted using an extrapolation technique in which the ND data indirectly constrain the FD prediction via a ratio method. PISCES, on the other hand, enables a simultaneous ND+FD fit, allowing the high-statistics ND data to directly constrain systematic uncertainties across all samples. This thesis presents the full PISCES joint ND+FD fit for the NOvA three-flavor analysis, details its implementation, and evaluates its performance through extensive robustness tests and fake data studies. It also provides a comparison between the PISCES joint ND+FD results and the standard NOvA extrapolation method using the full NOvA 10-year data set. The results demonstrate that PISCES can successfully fit NOvA data while incorporating the constraints from the ND detectors consistently, using physically motivated systematic uncertainties to account for data/MC discrepancies.

Rajaoalisoa, Miriama [Cincinnati U.]↗

C-MOS array design techniques: SUMC multiprocessor system study

The current capabilities of LSI techniques for speed and reliability, plus the possibilities of assembling large configurations of LSI logic and storage elements, have demanded the study of multiprocessors and multiprocessing techniques, problems, and potentialities. Evaluated are three previous systems studies for a space ultrareliable modular computer multiprocessing system, and a new multiprocessing system is proposed that is flexibly configured with up to four central processors, four 1/0 processors, and 16 main memory units, plus auxiliary memory and peripheral devices. This multiprocessor system features a multilevel interrupt, qualified S/360 compatibility for ground-based generation of programs, virtual memory management of a storage hierarchy through 1/0 processors, and multiport access to multiple and shared memory units.

Clapp, W. A.↗