Trajectory Learning Using Hierarchy of Oscillatory Modules
To this date, the most successful approaches to learning have been either the back-propagation or gradient descent method.
hierarchical and modular approach trajectory learn↗
SEARCH · Engineering Papers
Results for “hierarchy”
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.
Large constraint length high speed viterbi decoder based on a modular hierarchial decomposition of the deBruijn graph
A method of formulating and packaging decision-making elements into a long constraint length Viterbi decoder which involves formulating the decision-making processors as individual Viterbi butterfly processors that are interconnected in a deBruijn graph configuration. A fully distributed architecture, which achieves high decoding speeds, is made feasible by novel wiring and partitioning of the state diagram. This partitioning defines universal modules, which can be used to build any size decoder, such that a large number of wires is contained inside each module, and a small number of wires is needed to connect modules. The total system is modular and hierarchical, and it implements a large proportion of the required wiring internally within modules and may include some external wiring to fully complete the deBruijn graph. pg,14.
Collins, Oliver↗
A Numerical Investigation of Turbine Noise Source Hierarchy and Its Acoustic Transmission Characteristics: Proof-of-Concept Progress
A CFD-based simulation of single-stage turbine was done using the TURBO code to assess its viability for determining acoustic transmission through blade rows. Temporal and spectral analysis of the unsteady pressure data from the numerical simulations showed the allowable Tyler-Sofrin modes that are consistent with expectations. This indicated that high-fidelity acoustic transmission calculations are feasible with TURBO.
VanZante, Dale↗
A Numerical Investigation of Turbine Noise Source Hierarchy and Its Acoustic Transmission Characteristics
Understanding the relative importance of the various turbine noise generation mechanisms and the characteristics of the turbine acoustic transmission loss are essential ingredients in developing robust reduced-order models for predicting the turbine noise signature. A computationally based investigation has been undertaken to help guide the development of a turbine noise prediction capability that does not rely on empiricism. The investigation relies on highly detailed numerical simulations of the unsteady flowfield inside a modern high-pressure turbine (HPT). The simulations are developed using TURBO, which is an unsteady Reynolds-averaged Navier-Stokes (URANS) code capable of multi-stage simulations. The purpose of this study is twofold. First, to determine an estimate of the relative importance of the contributions to the coherent part of the acoustic signature of a turbine from the three potential sources of turbine noise generation, namely, blade-row viscous interaction, potential field interaction, and entropic source associated with the interaction of the blade rows with the temperature nonuniformities caused by the incomplete mixing of the hot fluid and the cooling flow. Second, to develop an understanding of the turbine acoustic transmission characteristics and to assess the applicability of existing empirical and analytical transmission loss models to realistic geometries and flow conditions for modern turbine designs. The investigation so far has concentrated on two simulations: (1) a single-stage HPT and (2) a two-stage HPT and the associated inter-turbine duct/strut segment. The simulations are designed to resolve up to the second harmonic of the blade passing frequency tone in accordance with accepted rules for second order solvers like TURBO. The calculations include blade and vane cooling flows and a radial profile of pressure and temperature at the turbine inlet. The calculation can be modified later to include the combustor pattern factor at the turbine inlet to include that contribution to turbine noise. We shall present preliminary analysis of the results obtained so far in order to assess the validity of such an approach and to seek feedback on improving the approach. This work addresses both Area 1 (Turbine Tone Noise) and Area 5 (Influence of the Turbine on Combustor Noise) topics.
VanZante, Dale↗
The Analysis of Image Segmentation Hierarchies with a Graph-based Knowledge Discovery System
Currently available pixel-based analysis techniques do not effectively extract the information content from the increasingly available high spatial resolution remotely sensed imagery data. A general consensus is that object-based image analysis (OBIA) is required to effectively analyze this type of data. OBIA is usually a two-stage process; image segmentation followed by an analysis of the segmented objects. We are exploring an approach to OBIA in which hierarchical image segmentations provided by the Recursive Hierarchical Segmentation (RHSEG) software developed at NASA GSFC are analyzed by the Subdue graph-based knowledge discovery system developed by a team at Washington State University. In this paper we discuss out initial approach to representing the RHSEG-produced hierarchical image segmentations in a graphical form understandable by Subdue, and provide results on real and simulated data. We also discuss planned improvements designed to more effectively and completely convey the hierarchical segmentation information to Subdue and to improve processing efficiency.
Tilton, James C.↗
A Leonard-Sanders-Budiansky-Koiter-Type Nonlinear Shell Theory with a Hierarchy of Transverse-Shearing Deformations
A detailed exposition on a refined nonlinear shell theory suitable for nonlinear buckling analyses of laminated-composite shell structures is presented. This shell theory includes the classical nonlinear shell theory attributed to Leonard, Sanders, Koiter, and Budiansky as an explicit proper subset. This approach is used in order to leverage the exisiting experience base and to make the theory attractive to industry. In addition, the formalism of general tensors is avoided in order to expose the details needed to fully understand and use the theory. The shell theory is based on "small" strains and "moderate" rotations, and no shell-thinness approximations are used. As a result, the strain-displacement relations are exact within the presumptions of "small" strains and "moderate" rotations. The effects of transverse-shearing deformations are included in the theory by using analyst-defined functions to describe the through-the-thickness distributions of transverse-shearing strains. Constitutive equations for laminated-composite shells are derived without using any shell-thinness approximations, and simplified forms and special cases are presented.
Nemeth, Michael P.↗
Fragmentation hierarchy of bright sungrazing comets and the birth and orbital evolution of the Kreutz System. II. the case for cascading fragmentation
We examine the process of cascading fragmentation for the Kreutz sungrazer system to continue our exploration of its birth, orbital evolution, and temporal clumping. We modify and broaden the two-superfragment model from Paper I to include clusters of ~30 bright comets spanning four centuries and 1000 SOHO sungrazers from 1996 to 2006. The spectacular parent sungrazer X/1106 C1 is assumed to have tidally split shortly after perihelion into a train of major protofragments immersed in a cloud of particulate debris, which at larger heliocentric distances were breaking up nontidally over and over again. We describe potential evolutionary paths for the Kreutz system by linking X/1106 C1 in subgroup I-type orbit with the comet of February 423 in one scenario or with the comet of February 467 in another. The latter scenario accounts for sungrazer clusters in as early as the 16th century, suggests that the progenitor object may have been observed as the comet of 214 BCE, is quite consistent with the orbital distribution of the SOHO sungrazers that sample the central filament of the Kreutz system between the clusters of major sungrazers, and predicts future clusters until ~2120. Comet X/1106 C1 and the common parent of C/1882 R1 and C/1965 S1 were two first-generation fragments of the progenitor that split nontidally on the way to its 5th century perihelion, reminiscent of the superfragments in Paper I. We provide computational tools needed for solving the problem of the Kreutz system’s orbital evolution, but no unique scenarios are presented for the individual comets. Another cluster of bright sungrazers is expected to arrive in the coming decades, its earliest member possibly just several years from now.
Chodas, Paul W.↗
Application of the Analytical Hierarchy Process for Narrowing down NEP Candidate Reactor Designs
Explore the source record for details and available documents.
Dasari V Rao↗
Hierarchy of Knowledge: SEL Edition
Explore the source record for details and available documents.
Ray Ladbury↗
A Hunting Expedition For High-Order Hierarchies
Stellar hierarchical systems of high order containing more than three stars are rare and fascinating objects; their disco v ery and study highlight still unknown aspects of star formation and early evolution. We matched eclipsing binaries disco v ered by Transiting Exoplanet Surv e y Satellite with a Gaia catalogue of wide binaries and selected candidate quadruple (or higher order) systems based on e xcessiv e astrometric noise. A subset of 192 southern candidates located within 500 pc was observed by speckle interferometry, and we resolved for the first time 50 close pairs, confirming their high-order (from four to five components) multiplicity. These observations are reported, and some remarkable hierarchical systems are discussed.
Brian P Powell↗
A class Hierarchical, object-oriented approach to virtual memory management
The Choices family of operating systems exploits class hierarchies and object-oriented programming to facilitate the construction of customized operating systems for shared memory and networked multiprocessors. The software is being used in the Tapestry laboratory to study the performance of algorithms, mechanisms, and policies for parallel systems. Described here are the architectural design and class hierarchy of the Choices virtual memory management system. The software and hardware mechanisms and policies of a virtual memory system implement a memory hierarchy that exploits the trade-off between response times and storage capacities. In Choices, the notion of a memory hierarchy is captured by abstract classes. Concrete subclasses of those abstractions implement a virtual address space, segmentation, paging, physical memory management, secondary storage, and remote (that is, networked) storage. Captured in the notion of a memory hierarchy are classes that represent memory objects. These classes provide a storage mechanism that contains encapsulated data and have methods to read or write the memory object. Each of these classes provides specializations to represent the memory hierarchy.
Russo, Vincent F.↗
Monitoring Change Through Hierarchical Segmentation of Remotely Sensed Image Data
NASA's Goddard Space Flight Center has developed a fast and effective method for generating image segmentation hierarchies. These segmentation hierarchies organize image data in a manner that makes their information content more accessible for analysis. Image segmentation enables analysis through the examination of image regions rather than individual image pixels. In addition, the segmentation hierarchy provides additional analysis clues through the tracing of the behavior of image region characteristics at several levels of segmentation detail. The potential for extracting the information content from imagery data based on segmentation hierarchies has not been fully explored for the benefit of the Earth and space science communities. This paper explores the potential of exploiting these segmentation hierarchies for the analysis of multi-date data sets, and for the particular application of change monitoring.
Tilton, James C.↗
Algorithm for Rapid Searching Among Star-Catalog Entries
An algorithm searches a star catalog to identify guide stars within the field of view of a telescope or camera. The algorithm is fast: the number of computations needed to perform the search is approximately proportional to the logarithm of the number of stars in the catalog. The algorithm requires the prior organization of the star catalog into a hierarchy utilizing independent spherical coverings (see figure), such that each successively higher level contains fewer elements. In the lowest and most numerous level of the hierarchy, the elements are individual stars in the star catalog. The next higher level contains a spherical covering (a constellation of n points on a sphere that minimizes the maximum distance of any point on the sphere from the closest one of the n points), the next higher level contains a smaller spherical covering, and so forth, ending at the highest level, which contains one element representing the point of entry into the search structure. With necessary exceptions at the lowest and highest levels, each element at each level is labeled in terms of the element to which it is linked in the next higher level and the first element to which it is linked in the next lower level. Each element is also labeled in terms of (1) its coordinates on the celestial sphere and (2) the largest angular distance to any element in any lower level in the hierarchy. The elements at all levels of the hierarchy are numbered on a single list, such that the elements of each constellation at each level are numbered consecutively. The algorithm is recursive. The input required to start the algorithm comprises the coordinates of a point on the celestial sphere. Attention is then focused on individual elements of the hierarchy, starting from the topmost one, as follows: The angle between the input point and the element under consideration is calculated. If the calculated angle is larger than the sum of (1) the predetermined angle to the most distant element plus (2) the half field of view of the telescope, then no stars will be within the field of view and this recursive part of the algorithm is terminated.
Liebe, Carl Christian↗
Land use and mapping
This summary is divided into two basic sections-one dealing with land use classification and delineation, and the other dealing with mapping. The term land use classification is used in respect to the actual use of land rather than land capability, land suitability, or the potential use of land. The classification of actual use of the land, as defined by man's activities that are related to the land, may be only inferred, rather than directly interpreted, in the case of the identification and classification of some surface features or vegetation cover types. Also, in the case of some surface features or vegetational cover types, the specific activity involving man's use of the land may not be designated in a four-level classification system until level 3 or level 4 is reached. Most investigations employed or implied a hierarchial land use classification scheme with more than two levels, but mainly addressed themselves to classifying and delineating surface features (land use) that would fall in the first two levels of a three- or four-level hierarchial scheme. Although not all investigators used a hierarchial classification scheme or concurred with the idea (computer-implemented classifications with digital data are not conducive to a hierarchial classification approach), the classification system proposed by the U.S. Department of the Interior is used as reference.
Joyce, A. T.↗
Generation of animation sequences of three dimensional models
The invention is directed toward a method and apparatus for generating an animated sequence through the movement of three-dimensional graphical models. A plurality of pre-defined graphical models are stored and manipulated in response to interactive commands or by means of a pre-defined command file. The models may be combined as part of a hierarchical structure to represent physical systems without need to create a separate model which represents the combined system. System motion is simulated through the introduction of translation, rotation and scaling parameters upon a model within the system. The motion is then transmitted down through the system hierarchy of models in accordance with hierarchical definitions and joint movement limitations. The present invention also calls for a method of editing hierarchical structure in response to interactive commands or a command file such that a model may be included, deleted, copied or moved within multiple system model hierarchies. The present invention also calls for the definition of multiple viewpoints or cameras which may exist as part of a system hierarchy or as an independent camera. The simulated movement of the models and systems is graphically displayed on a monitor and a frame is recorded by means of a video controller. Multiple movement and hierarchy manipulations are then recorded as a sequence of frames which may be played back as an animation sequence on a video cassette recorder.
Poi, Sharon↗
Dynamics and configurations of galaxy triplets
The purpose is to infer the probable dynamical states of galaxy triplets by the observed data on their configurations. Two methods are proposed for describing the distributions of the triplet configuration parameters characterizing a tendency to alignment and hierarchy: (1) obtaining a representative sample of configurations and determining its statistical parameters (moments and percentages); and (2) dividing the region of possible configurations of triple systems (Agekian and Anosova, 1967) into a set of segments and finding the probabilities for the configurations to find themselves in each of them. Both these methods allow representation of the data by numerical simulations as well as observations. The effect of projection was studied. It rather overestimates the alignment and hierarchy of the triple systems. Among the parameters of interest there are found some parameters that are least sensitive to projection effects. The samples consist of simulated galaxy triplets (with hidden mass) as well as of 46 probably physical triple galaxies (Karachentseva et al., 1979). The observed triples as well as numerical models show a tendency to alignment. The triple galaxies do not show any tendency to hierarchy (formation of the temporary binaries), but this tendency may be present for simulated triplets without significant dark matter. The significant hidden mass (of order ten times the total mass of a triplet) decreases the probability of forming a binary and so weakens the hierarchy. Small galaxy groups consisting of 3 to 7 members are probably the most prevalent types of galaxy aggregate (Gorbatsky, 1987). Galaxy triplets are the simplest groups, but dynamically nontrivial ones.
Anosova, Joanna P.↗
A linguistic geometry for space applications
We develop a formal theory, the so-called Linguistic Geometry, in order to discover the inner properties of human expert heuristics, which were successful in a certain class of complex control systems, and apply them to different systems. This research relies on the formalization of search heuristics of high-skilled human experts which allow for the decomposition of complex system into the hierarchy of subsystems, and thus solve intractable problems reducing the search. The hierarchy of subsystems is represented as a hierarchy of formal attribute languages. This paper includes a formal survey of the Linguistic Geometry, and new example of a solution of optimization problem for the space robotic vehicles. This example includes actual generation of the hierarchy of languages, some details of trajectory generation and demonstrates the drastic reduction of search in comparison with conventional search algorithms.
Stilman, Boris↗
Utilizing Hierarchical Segmentation to Generate Water and Snow Masks to Facilitate Monitoring Change with Remotely Sensed Image Data
The hierarchical segmentation (HSEG) algorithm is a hybrid of hierarchical step-wise optimization and constrained spectral clustering that produces a hierarchical set of image segmentations. This segmentation hierarchy organizes image data in a manner that makes the image's information content more accessible for analysis by enabling region-based analysis. This paper discusses data analysis with HSEG and describes several measures of region characteristics that may be useful analyzing segmentation hierarchies for various applications. Segmentation hierarchy analysis for generating landwater and snow/ice masks from MODIS (Moderate Resolution Imaging Spectroradiometer) data was demonstrated and compared with the corresponding MODIS standard products. The masks based on HSEG segmentation hierarchies compare very favorably to the MODIS standard products. Further, the HSEG based landwater mask was specifically tailored to the MODIS data and the HSEG snow/ice mask did not require the setting of a critical threshold as required in the production of the corresponding MODIS standard product.
Tilton, James C.↗