SEARCH · Engineering Papers

Results for “hierarchical data”

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.

SourceResearch connectionFrom yearThrough year

Quote a phrase for an exact phrase match. Source license links do not imply unrestricted reuse.

At least 307 records · Page 17

All sources NASA NTRS DOE OSTI

DOE OSTI2023

Unsupervised learning of representative local atomic arrangements in molecular dynamics data

Molecular dynamics (MD) simulations present a data-mining challenge, given that they can generate a considerable amount of data but often rely on limited or biased human interpretation to examine their information content. By not asking the right questions of MD data we may miss critical information hidden within it. Here we combine dimensionality reduction (UMAP) and unsupervised hierarchical clustering (HDBSCAN) to quantitatively characterize prevalent coordination environments of chemical species within MD data. By focusing on local coordination, we significantly reduce the amount of data to be analyzed by extracting all distinct molecular formulas within a given coordination sphere. We then efficiently combine UMAP and HDBSCAN with alignment or shape-matching algorithms to partition these formulas into structural isomer families indicating their relative populations. The method was employed to reveal details of cation coordination in electrolytes based on molecular liquids.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

NASA NTRS1987

Real-time hierarchically distributed processing network interaction simulation

The Telerobot Testbed is a hierarchically distributed processing system which is linked together through a standard, commercial Ethernet. Standard Ethernet systems are primarily designed to manage non-real-time information transfer. Therefore, collisions on the net (i.e., two or more sources attempting to send data at the same time) are managed by randomly rescheduling one of the sources to retransmit at a later time interval. Although acceptable for transmitting noncritical data such as mail, this particular feature is unacceptable for real-time hierarchical command and control systems such as the Telerobot. Data transfer and scheduling simulations, such as token ring, offer solutions to collision management, but do not appropriately characterize real-time data transfer/interactions for robotic systems. Therefore, models like these do not provide a viable simulation environment for understanding real-time network loading. A real-time network loading model is being developed which allows processor-to-processor interactions to be simulated, collisions (and respective probabilities) to be logged, collision-prone areas to be identified, and network control variable adjustments to be reentered as a means of examining and reducing collision-prone regimes that occur in the process of simulating a complete task sequence.

Zimmerman, W. F.↗

NASA NTRSDate not supplied

Expanding Repository Data Available For Sharing and Knowledge Discovery

Some of the hardest space biology and space health challenges require data-intensive, bioinformatic, meta-analytical, and computer-assisted research approaches. These challenges include examining interdisciplinary space life science research across experiments and across interacting spaceflight hazards (radiation, altered gravity, confinement, hostile-closed environments, distance-duration from Earth). The approaches to confront these challenges involve mining multiple datasets simultaneously from various hierarchical organizations of biological complexity, all while concurrently evaluating how experimental design factors affect endpoints of standard assays. To enable this field, it is essential that principal investigators (PIs) submit data in a structure so it can be maximally re-used. The purpose of the NASA Ames Life Sciences Data Archive (ALSDA) is to collect, curate, and make publicly available all non-human space-relevant biological data. ALSDA must also ensure data are open-access, and maximally findable, accessible, interoperable, and reusable (FAIR). The scope of ALSDA data collected and submitted by PIs include subject and study design metadata, assay metadata parameters, raw and processed assay data, assay imagery/video, and subject-experienced mission data telemetry (radiation, temperature, humidity, acoustics, vibrations, etc.). ALSDA recently integrated into a collaborative group of Open Science projects to facilitate a suite of new tools and workflows that will improve data submission, accessibility, and reusability by implementing digital data submission agreements, and adopting the data management system originally developed by NASA GeneLab. ALSDA intends to bring current biological repository data and all future collected data into this new scientific data reuse reality. This new suite of tools will enable ALSDA to deploy a science curation system using scientific assay configurations for the data submission portal. It will capture essential assay parameters according to established standards in each sub-field within biology. The submission portal expedites data collection by enhancing ease of PI data submission, providing a user interface and specificity for which data is to be submitted. Data submissions can be brought into cutting-edge informatic analysis portals to enable mining of physiological, behavioral, biochemical, and imaging datasets in conjunction with ‘omics-level datasets. As ALSDA datasets are submitted, curated, and published (e.g., micro-computed tomography, histology, pulse oximetry, serum metabolites, magnetic resonance imaging, intraocular pressure, novel object recognition, etc.), the merging together of spaceflight data along this multi-hierarchical complexity of biology will enable informatics and data-intensive approaches resulting in knowledge discoveries across missions, space hazards, and biological disciplines.

Biology↗

NASA NTRSDate not supplied

Expanding Repository Data Available For Sharing And Knowledge Discovery

life science↗

DOE OSTI2022

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗

DOE OSTI2023

Chemical structure and complex growth modes of magnesium silicate hydrate: Nanoparticle orientation, aggregation, and fusion

The extent of utilization of magnesium silicate hydrate (MSH) in construction is limited partly because of insufficient data ascertaining the kinetics of its precipitation. In this report MSH grown homogeneously or heterogeneously in the range of magnesium to silicon solution molar concentration ratios, [Mg]/[Si] = 0.5-1.5, and temperature = 25-80 °C was analyzed for its chemical structure and morphology. Infrared spectroscopy and geochemical modeling show that increasing the [Mg]/[Si] ratio results in less silicate polymerization in MSH. Atomic force microscopy reveals the presence of nanoparticles that aggregate and fuse to form films. Oriented attachment of nanoparticles and features indicative of enhanced crystallinity were observed at higher temperatures and longer reaction times. These data provide direct evidence for the persistence of hierarchical structures (i.e., nanoparticles forming 3D microparticles and 2D film layers) at the nanoscale to mesoscale. These findings offer insights into the precise chemical synthesis of MSH and its widespread use as a binder for construction purposes.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

DOE OSTI2020

Accelerated training of bootstrap aggregation-based deep information extraction systems from cancer pathology reports

Not Available

60 APPLIED LIFE SCIENCES↗

DOE OSTI2022

Hierarchical deep reinforcement learning reveals a modular mechanism of cell movement

Time-lapse images of cells and tissues contain rich information about dynamic cell behaviours, which reflect the underlying processes of proliferation, differentiation and morphogenesis. However, we lack computational tools for effective inference. Here we exploit deep reinforcement learning (DRL) to infer cell–cell interactions and collective cell behaviours in tissue morphogenesis from three-dimensional (3D) time-lapse images. We use hierarchical DRL (HDRL), known for multiscale learning and data efficiency, to examine cell migrations based on images with a ubiquitous nuclear label and simple rules formulated from empirical statistics of the images. When applied to Caenorhabditis elegans embryogenesis, HDRL reveals a multiphase, modular organization of cell movement. Imaging with additional cellular markers confirms the modular organization as a novel migration mechanism, which we term sequential rosettes. Furthermore, HDRL forms a transferable model that successfully differentiates sequential rosettes-based migration from others. Our study demonstrates a powerful approach to infer the underlying biology from time-lapse imaging without prior knowledge.

59 BASIC BIOLOGICAL SCIENCES↗

DOE OSTI2024

Multi-Federate Co-Convergence with HELICS

In co-simulation studies, convergence refers to the ability of different simulation tools involved to achieve a consistent and stable solution. Convergence is a critical aspect of co-simulation as it determines the accuracy of the results obtained from the simulation. Convergence in co-simulation studies depends on several factors, this includes system complexity, the accuracy of the models used, and the numerical methods employed by the simulation tools. It is essential to ensure that the coupling interfaces between the different tools are designed to allow for data exchange in a consistent and accurate manner. Hierarchical Engine for Large-scale Infrastructure Co-Simulation (HELICS) is an open-source co-simulation framework developed for the energy domain. This paper explores the convergence performance of a set of co-simulation use cases. We further explore the use of a co-convergence helper federate to help with co-simulation convergence. The convergence efficacy of several algorithms (both gradient-based and gradient-free) is tested against these use cases. Finally, the sensitivity of these algorithms to several factors, such as system scaling and others, is tested and detailed in this paper. Our results show that for a subset of use cases, the co-convergence helper federate is able to improve co-simulation convergence significantly.

co-convergence↗

DOE OSTI2023

Progressive Tree-Based Compression of Large-Scale Particle Data

Scientific simulations and observations using particles have been creating large datasets that require effective and efficient data reduction to store, transfer, and analyze. However, current approaches either compress only small data well while being inefficient for large data, or handle large data but with insufficient compression. Toward effective and scalable compression/decompression of particle positions, we introduce new kinds of particle hierarchies and corresponding traversal orders that quickly reduce reconstruction error while being fast and low in memory footprint. Our solution to compression of large-scale particle data is a flexible block-based hierarchy that supports progressive, random-access, and error-driven decoding, where error estimation heuristics can be supplied by the user. For low-level node encoding, we introduce new schemes that effectively compress both uniform and densely structured particle distributions. Our proposed methods thus target all three phases of a tree-based particle compression pipeline, namely tree construction, tree traversal, and node encoding. In conclusion, the improved efficacy and flexibility of these methods over existing compressors are demonstrated through extensive experimentation, using a wide range of scientific particle datasets.

97 MATHEMATICS AND COMPUTING↗

NASA NTRS1971

A stochastic model for eye movements during fixation on a stationary target.

A stochastic model describing small eye movements occurring during steady fixation on a stationary target is presented. Based on eye movement data for steady gaze, the model has a hierarchical structure; the principal level represents the random motion of the image point within a local area of fixation, while the higher level mimics the jump processes involved in transitions from one local area to another. Target image motion within a local area is described by a Langevin-like stochastic differential equation taking into consideration the microsaccadic jumps pictured as being due to point processes and the high frequency muscle tremor, represented as a white noise. The transform of the probability density function for local area motion is obtained, leading to explicit expressions for their means and moments. Evaluation of these moments based on the model is comparable with experimental results.

Vasudevan, R.↗

NASA NTRS1976

Hierarchical resource analysis for land use planning through remote sensing

A hierarchical resource analysis was applied to remote sensing data to provide maps at Planning Levels I and III (Anderson et al., U.S. Geological Survey Circular 671) for Meade County, S. Dak. Level I land use and general soil maps were prepared by visual interpretation of imagery from a false color composite of Landsat MSS bands 4, 5, and 7 and single bands (5 and 7). A modified Level III land use map was prepared for the Black Hills area from RB-57 photography enlarged to a scale of 1:24,000. Level III land use data were used together with computer-generated interpretive soil maps to analyze relationships between developed and developing areas and soil criteria.

Byrnes, B. H.↗

NASA NTRS1991

Hierarchic models for laminated plates

Structural plates and shells are three-dimensional bodies, one dimension of which happens to be much smaller than the other two. Thus, the quality of a plate or shell model must be judged on the basis of how well its exact solution approximates the corresponding three-dimensional problem. Of course, the exact solution depends not only on the choice of the model but also on the topology, material properties, loading and constraints. The desired degree of approximation depends on the analyst's goals in performing the analysis. For these reasons models have to be chosen adaptively. Hierarchic sequences of models make adaptive selection of the model which is best suited for the purposes of a particular analysis possible. The principles governing the formulation of hierarchic models for laminated plates are presented. The essential features of the hierarchic models described models are: (1) the exact solutions corresponding to the hierarchic sequence of models converge to the exact solution of the corresponding problem of elasticity for a fixed laminate thickness; and (2) the exact solution of each model converges to the same limit as the exact solution of the corresponding problem of elasticity with respect to the laminate thickness approaching zero. The formulation is based on one parameter (beta) which characterizes the hierarchic sequence of models, and a set of constants whose influence was assessed by a numerical sensitivity study. The recommended selection of these constants results in the number of fields increasing by three for each increment in the power of beta. Numerical examples analyzed with the proposed sequence of models are included and good correlation with the reference solutions was found. Results were obtained for laminated strips (plates in cylindrical bending) and for square and rectangular plates with uniform loading and with homogeneous boundary conditions. Cross-ply and angle-ply laminates were evaluated and the results compared with those of MSC/PROBE. Hierarchic models make the computation of any engineering data possible to an arbitrary level of precision within the framework of the theory of elasticity.

Actis, Ricardo Luis↗

NASA NTRS1992

Hierarchic models for laminated composites

The principles governing the formulation of hierarchic models for laminated composites are discussed. The essential features of the hierarchic models described herein are: (1) the exact solutions corresponding to the hierarchic sequence of models converge to the exact solution of the corresponding problem of elasticity for a fixed laminate thickness; and (2) the exact solution of each model converges to the same limit as the exact solution of the corresponding problem of elasticity with respect to the laminate thickness approaching zero. Hierarchic models make the computation of any engineering data possible to an arbitrary level of precision within the framework of the theory of elasticity.

Babuska, Ivo↗

NASA NTRS1992

Description of the SSF PMAD dc testbed control system data acquisition function

A functional description of the various levels of the SSF power management and distribution dc test-bed control system architecture is presented, and the data acquisition function and the status of its implementation are described. The data requirements for the test-bed control system are dictated by the functionality being implemented at each level of the architecture. The test-bed control system hierarchy data acquisition function is distributed among its various levels. Fast-acting control functions that require time critical data are implemented at the lowest level. These functions require periodic data sampling to assure safe system operation and performance. Slower response control functions are implemented at the higher levels and require data to be reported at least every second. The present data acquisition function meets the requirements for a hierarchical and distributed power management and control system.

Baez, Anastacio N.↗

NASA NTRS2008

Processing LiDAR Data to Predict Natural Hazards

ELF-Base and ELF-Hazards (wherein 'ELF' signifies 'Extract LiDAR Features' and 'LiDAR' signifies 'light detection and ranging') are developmental software modules for processing remote-sensing LiDAR data to identify past natural hazards (principally, landslides) and predict future ones. ELF-Base processes raw LiDAR data, including LiDAR intensity data that are often ignored in other software, to create digital terrain models (DTMs) and digital feature models (DFMs) with sub-meter accuracy. ELF-Hazards fuses raw LiDAR data, data from multispectral and hyperspectral optical images, and DTMs and DFMs generated by ELF-Base to generate hazard risk maps. Advanced algorithms in these software modules include line-enhancement and edge-detection algorithms, surface-characterization algorithms, and algorithms that implement innovative data-fusion techniques. The line-extraction and edge-detection algorithms enable users to locate such features as faults and landslide headwall scarps. Also implemented in this software are improved methodologies for identification and mapping of past landslide events by use of (1) accurate, ELF-derived surface characterizations and (2) three LiDAR/optical-data-fusion techniques: post-classification data fusion, maximum-likelihood estimation modeling, and hierarchical within-class discrimination. This software is expected to enable faster, more accurate forecasting of natural hazards than has previously been possible.

Fairweather, Ian↗

NASA NTRS2017

Reconfigurable Model Execution in the OpenMDAO Framework

NASA's OpenMDAO framework facilitates constructing complex models and computing their derivatives for multidisciplinary design optimization. Decomposing a model into components that follow a prescribed interface enables OpenMDAO to assemble multidisciplinary derivatives from the component derivatives using what amounts to the adjoint method, direct method, chain rule, global sensitivity equations, or any combination thereof, using the MAUD architecture. OpenMDAO also handles the distribution of processors among the disciplines by hierarchically grouping the components, and it automates the data transfer between components that are on different processors. These features have made OpenMDAO useful for applications in aircraft design, satellite design, wind turbine design, and aircraft engine design, among others. This paper presents new algorithms for OpenMDAO that enable reconfigurable model execution. This concept refers to dynamically changing, during execution, one or more of: the variable sizes, solution algorithm, parallel load balancing, or set of variables-i.e., adding and removing components, perhaps to switch to a higher-fidelity sub-model. Any component can reconfigure at any point, even when running in parallel with other components, and the reconfiguration algorithm presented here performs the synchronized updates to all other components that are affected. A reconfigurable software framework for multidisciplinary design optimization enables new adaptive solvers, adaptive parallelization, and new applications such as gradient-based optimization with overset flow solvers and adaptive mesh refinement. Benchmarking results demonstrate the time savings for reconfiguration compared to setting up the model again from scratch, which can be significant in large-scale problems. Additionally, the new reconfigurability feature is applied to a mission profile optimization problem for commercial aircraft where both the parametrization of the mission profile and the time discretization are adaptively refined, resulting in computational savings of roughly 10% and the elimination of oscillations in the optimized altitude profile.

Hwang, John T.↗

DOE OSTI2020

Enabling Highly Efficient Capsule Networks Processing Through A PIM-Based Architecture Design

In recent years, the CNNs have achieved great successes in the image processing tasks, e.g., image recognition and object detection. Unfortunately, traditional CNN's classication is found to be easily misled by increasingly complex image features due to the usage of pooling operations, hence unable to preserve accurate position and pose information of the objects. To address this challenge, a novel neural network structure called Capsule Network has been proposed, which introduces equivariance through capsules to signicantly enhance the learning ability for image segmentation and object detection. Due to its requirement of performing a high volume of matrix operations, CapsNets have been generally accelerated on modern GPU platforms that provide highly optimized software library for common deep learning tasks. However, based on our performance characterization on modern GPUs, CapsNets exhibit low effciency due to the special program and execution features of their routing procedure, including massive unshareable intermediate variables and intensive syn- chronizations, which are very dicult to optimize at software level. To address these challenges, we propose a hybrid computing architecture design named PIM-CapsNet. It preserves GPU's on-chip computing capability for accelerating CNN types of layers in CapsNet, while pipelining with an off-chip in-memory acceleration solution that effectively tackles routing procedure's ineffciency by leveraging the processing-in-memory capability of today's 3D stacked memory. Using routing procedure's inherent parallellization feature, our design enables hierarchical improvements on CapsNet inference effciency through minimizing data movement and maximizing parallel processing in memory. Evaluation results demonstrate that our proposed design can achieve substantial improvement on both performance and energy savings for CapsNet inference, with almost zero accuracy loss. The results also suggest good performance scalability in optimizing the routing procedure with increasing network size.

Zhang, Xingyao↗