Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Graph Analytics”

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 307 records · Page 17

Adaptive structures

The fundamental principles of the adaptive structures concept and its applications to current and planned space missions are reviewed and illustrated with diagrams, drawings, graphs, and photographs. An adaptive structure is defined as one which can be modified to meet mission requirements, either by remote commands or automatically in response to external stimuli. Topics addressed include the need for adaptive structures, analytical models, ground testing, sensor/actuator-structure interactions, structural concepts, active damping, wave propagation in large structures, the selection of active member locations, and on-orbit system identification. Particular attention is given to adaptive structures being developed for the NASA Large Deployable Reflector and Optical Interferometer projects.

Wada, Ben K.↗

ATAMM enhancement and multiprocessing performance evaluation

The algorithm to architecture mapping model (ATAAM) is a Petri net based model which provides a strategy for periodic execution of a class of real-time algorithms on multicomputer dataflow architecture. The execution of large-grained, decision-free algorithms on homogeneous processing elements is studied. The ATAAM provides an analytical basis for calculating performance bounds on throughput characteristics. Extension of the ATAMM as a strategy for cyclo-static scheduling provides for a truly distributed ATAMM multicomputer operating system. An ATAAM testbed consisting of a centralized graph manager and three processors is described using embedded firmware on 68HC11 microcontrollers.

Stoughton, John W.↗

A New Paradigm for Quality Metrics

SMA metrics have been traditionally represented as either leading and lagging indicators. Traditional ways of viewing these metrics and trending the data is via graphs which reflect one attribute in each graph. The KSC Independent Assessment Team developed a non-traditional method for expressing variation as a ratio (the deviation between the Expected and Actual). This method allows different measures to be plotted on the same graph for trending and comparison to provide a holistic view across a particular theme or discipline. Since all measurements are a ratio of variation and dimensionless, this variation-based metrics approach can be used a new analytical tool which is complimentary to existing value-added metrics tools.

Dimensionless↗

Improvements on Low-Density Parity-Check (LDPC) Codes and High-Performance Neuromorphic Engineering for Communication Systems

Belief propagation (BP) on LDPC codes is an iterative decoding algorithm that performs information transfer on the Tanner graph, which represents the code. In each iteration, the algorithm exchanges information (LLR) between variable nodes and check nodes through the edges of the graph. LLR values represent the probability that a given bit in a transmitted codeword equals 0 or 1, given a received word. In the hardware part, recent advancements in intelligent technologies, such as artificial intelligence, big data analytics, autonomous vehicles, and speech/image recognition, have heightened the demand for faster calculations and reduced energy consumption.

Danilo Barrionuevo↗

Computer architecture for efficient algorithmic executions in real-time systems: New technology for avionics systems and advanced space vehicles

Improvements and advances in the development of computer architecture now provide innovative technology for the recasting of traditional sequential solutions into high-performance, low-cost, parallel system to increase system performance. Research conducted in development of specialized computer architecture for the algorithmic execution of an avionics system, guidance and control problem in real time is described. A comprehensive treatment of both the hardware and software structures of a customized computer which performs real-time computation of guidance commands with updated estimates of target motion and time-to-go is presented. An optimal, real-time allocation algorithm was developed which maps the algorithmic tasks onto the processing elements. This allocation is based on the critical path analysis. The final stage is the design and development of the hardware structures suitable for the efficient execution of the allocated task graph. The processing element is designed for rapid execution of the allocated tasks. Fault tolerance is a key feature of the overall architecture. Parallel numerical integration techniques, tasks definitions, and allocation algorithms are discussed. The parallel implementation is analytically verified and the experimental results are presented. The design of the data-driven computer architecture, customized for the execution of the particular algorithm, is discussed.

Carroll, Chester C.↗

The inviscid stability of supersonic flow past a sharp cone

The effects of lateral curvature on the development of supersonic laminar inviscid boundary-layer flow on a sharp cone with adiabatic wall conditions are investigated analytically, with a focus on the linear temporal inviscid stability properties. The derivation of the governing equations and of a 'triply generalized' inflexion condition is outlined, and numerical results for freestream Mach number 3.8 are presented in extensive graphs and characterized in detail. A third instability mode related to the viscous mode observed by Duck and Hall (1990) using triple-deck theory is detected and shown to be more unstable and to have larger growth rates than the second mode in some cases. It is found that the 'sonic' neutral mode is affected by the lateral curvature and becomes a supersonic neutral mode.

Duck, Peter W.↗

Environmental Stress Testing of the Single Sample Cylinder: A Proven Consensus Standard for Internal Gas Analysis (IGA) or Residual Gas Analysis (RGA)

In August 2008, Schuessler Consulting was contracted by NASA GSFC in support of the NASA Electronic Parts and Packaging (NEPP) program to perform two separate studies on moisture laden air in a stainless steel cylinder that had been designed to become a consensus standard for Test Method 1018. This Test Method was originally released for hybrids under Mil. Std. 883 but was quickly utilized on other microelectronic devices under the auspice of Mil. Std. 750. The cylinder had subsequently been fabricated for the 750 community. It was back-filled with moist air and subsequently analyzed over a period of time under a previous NASA contract. It had been shown that moisture in the 4000 - 5000 ppm range could be analyzed rather precisely with a mass spectrometer, commonly referred to as a Residual Gas Analyzer (RGA). The scope of this study was to ascertain if the composition and precision varied as a function of thermal shock at sub-zero temperatures and whether there was consensus when the standard was submitted to other RGA units. It was demonstrated and published that the consensus standard would yield precise RGA data for moisture within +/- 1% when optimized for a given RGA unit. It has been subsequently shown in this study at Oneida Research Services, that sub-zero storage did not affect that precision when a well-defined protocol for the analysis was followed. The consensus standard was taken to a second facility for analysis where it was found that moisture adsorption on the transfer lines caused precision to drop to +/- 12%. The Single Sample Cylinder (SSC) is a one liter stainless steel cylinder with associated sampling valves and has considerable weight and volume. But this considerable size allows for approximately 300 gas samples of the same composition to be delivered to any RGA unit. Lastly, a smaller cylinder, approximately 75 cc, of a second consensus standard was fabricated and tested with a different mix of fixed gases where moisture was kept in the 100 ppm range. This second standard has the potential of providing 30 gaseous samples and can be readily shipped to any analytical facility that desires to generate comparison RGA data. A series of comparison residual gas analyses was performed at the Honeywell Federal Manufacturing & Technologies facility in the National Nuclear Facility Administration s plant in Kansas City to complete this project. It was shown that improvements in the precision of a given RGA unit can be done by controlling the cycle time for each analysis and increasing analysis temperatures to minimize moisture adsorption. It was also found that a "one time event" in the subzero storage of the large SSC did not effect the units ability to continuously supply precise samples of the same chemistry, however the "event" caused a permanent +8% shift in the reported value of the moisture content. Lastly, a set of SSC RGA results was plotted on a common graph with DSCC "correlation study" RGA data. The result demonstrates the ability of the SSC to remove many of the individual variances that single, individual samples introduce. The consensus standards are now in storage at Oneida Research Services, one of the DSCC certified houses that does RGA to Military Standards, where they await future studies. The analytical data and the operational parameters of the instruments used are provided in the following discussion. Limitations and suggested means for improvement of both precision and accuracy are provided.

Schuessler, Philipp WH↗

Effects of fibril magnetic fields on solar p-modes. II - Calculation of mode frequency shifts

The effect of magnetic flux tubes in the solar convection zone on p-mode oscillations is investigated analytically using WKB ray theory, extending the results of Bogdan and Zweibel (1985) to the case of propagation not perpendicular to the tubes. Results for the frequency shift in polytropic slabs with vertical or horizontal flux tubes are presented in graphs and discussed.

Zweibel, E. G.↗

A new convergent point and distance modulus for the Hyades from radial velocities

The dynamics of the Hyades open star cluster is investigated analytically on the basis of the photoelectric radial velocities reported by Griffin et al. (1988). The methods used to determine the radial-velocity gradient, convergent point, and distance modulus are described, and the results are presented in tables and graphs and characterized in detail. Findings reported include convergent-point alpha = 98.2 + or - 1.1 deg and delta = 6.1 + or - 1.0 deg, space motion 48.0 + or - 0.27 km/s, distance to cluster center 45.4 + or - 2.1 pc, distance modulus 3.28 + or - 0.10, and cluster velocity dispersion 230 m/s.

Gunn, James E.↗

Mechanics of unsymmetric laminates

Theoretical models describing the mechanical behavior of fiber-reinforced composite laminates are developed analytically and demonstrated. The curing of composite structures and the out-of-plane shapes of unsymmetric laminates are discussed and illustrated with photographs; the derivation of the governing equations is outlined; numerical results for typical laminates are presented in graphs; and particular attention is given to stability considerations and the effects of material properties, laminate thickness, aspect ratio, and stacking sequence.

Hyer, M. W.↗

Designing alloys with process-mapping AI pre-trained on empirical knowledge

<span style="font-family: Calibri, sans-serif; font-size: 12pt;">Accelerated materials design should match the recent trends in the product development cycles. Materials data analytics can be used to significantly shorten development time of specialized alloys needed for next generation energy applications. However, it faces a challenge of scarce data available for training ML models. Incorporation of the domain knowledge into deep-learning graph structure via fuzzy pre-training and causal process imitation presents a viable approach to developing accurate data-driven models and reliable alloy design tools, with limited datasets. Artificial Intelligence (AI) was used in this study to incorporate such knowledge in the domain-specific computational tool, pyroMind. The tool provides not only novel design ideas but also their interpretation via physics and engineering concepts.</span>

Romanov, Vyacheslav↗

Maximum Kolmogorov-Sinai Entropy Versus Minimum Mixing Time in Markov Chains

We establish a link between the maximization of Kolmogorov Sinai entropy (KSE) and the minimization of the mixing time for general Markov chains. Since the maximisation of KSE is analytical and easier to compute in general than mixing time, this link provides a new faster method to approximate the minimum mixing time dynamics. It could be interesting in computer sciences and statistical physics, for computations that use random walks on graphs that can be represented as Markov chains.

97 MATHEMATICS AND COMPUTING↗

Effect of mean load on the non-linear behavior of spur gear noise source

An analytical technique for estimating noise generation by spur-gear pairs with backlash is developed using the results obtained by Comparin and Singh (1989). The derivation of the governing equations is outlined, and numerical results for sample problems are presented in graphs. Good agreement with published experimental data (Munro, 1962) is demonstrated.

Kahraman, Ahmet↗

Publication and Retrieval of Computational Chemical-Physical Data Via the Semantic Web. Final Technical Report

This research showed the feasibility of applying the concepts of the Semantic Web to Computation Chemistry. We have created the first web portal (www.chemsem.com) that allows data created in the calculations of quantum chemistry, and other such chemistry calculations to be placed on the web in a way that makes the data accessible to scientists in a semantic form never before possible. The semantic web nature of the portal allows data to be searched, found, and used as an advance over the usual approach of a relational database. The semantic data on our portal has the nature of a Giant Global Graph (GGG) that can be easily merged with related data and searched globally via a SPARQL Protocol and RDF Query Language (SPARQL) that makes global searches for data easier than with traditional methods. Our Semantic Web Portal requires that the data be understood by a computer and hence defined by an ontology (vocabulary). This ontology is used by the computer in understanding the data. We have created such an ontology for computational chemistry (purl.org/gc) that encapsulates a broad knowledge of the field of computational chemistry. We refer to this ontology as the Gainesville Core. While it is perhaps the first ontology for computational chemistry and is used by our portal, it is only a start of what must be a long multi-partner effort to define computational chemistry. In conjunction with the above efforts we have defined a new potential file standard (Common Standard for eXchange – CSX for computational chemistry data). This CSX file is the precursor of data in the Resource Description Framework (RDF) form that the semantic web requires. Our portal translates CSX files (as well as other computational chemistry data files) into RDF files that are part of the graph database that the semantic web employs. We propose a CSX file as a convenient way to encapsulate computational chemistry data.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

A simple hyperbolic model for communication in parallel processing environments

We introduce a model for communication costs in parallel processing environments called the 'hyperbolic model,' which generalizes two-parameter dedicated-link models in an analytically simple way. Dedicated interprocessor links parameterized by a latency and a transfer rate that are independent of load are assumed by many existing communication models; such models are unrealistic for workstation networks. The communication system is modeled as a directed communication graph in which terminal nodes represent the application processes that initiate the sending and receiving of the information and in which internal nodes, called communication blocks (CBs), reflect the layered structure of the underlying communication architecture. The direction of graph edges specifies the flow of the information carried through messages. Each CB is characterized by a two-parameter hyperbolic function of the message size that represents the service time needed for processing the message. The parameters are evaluated in the limits of very large and very small messages. Rules are given for reducing a communication graph consisting of many to an equivalent two-parameter form, while maintaining an approximation for the service time that is exact in both large and small limits. The model is validated on a dedicated Ethernet network of workstations by experiments with communication subprograms arising in scientific applications, for which a tight fit of the model predictions with actual measurements of the communication and synchronization time between end processes is demonstrated. The model is then used to evaluate the performance of two simple parallel scientific applications from partial differential equations: domain decomposition and time-parallel multigrid. In an appropriate limit, we also show the compatibility of the hyperbolic model with the recently proposed LogP model.

Stoica, Ion↗

Modeling Complex Relationships in Large-Scale Data using Hypergraphs (LDRD Final Report)

This SAND report documents the findings of the LDRD project, "Modeling Complex Relationships in Large-Scale Data using Hypergraphs". The project ran from October 2017 through September 2019. The focus of the project was the development and application of hypergraph data analytics to Sandia relational data applications. In this project, we attempted to apply a hypergraph data analysis method—specifically, hypergraph eigenvector centrality—to Sandia mission problems to identify influential entities (people, location, times, etc.) in the data. Unfortunately, the application data led to graph and hypergraph representations containing disconnected components. To date, there are no well-established techniques for applying eigenvector centrality to such graphs and hypergraphs. In this report, we present several heuristics for computing eigenvector centrality for disconnected graphs. We believe this is an important start to understanding how to approach the similar problem for hypergraphs, but this project concluded before we made progress on that problem. The ideas, methods, and suggestions presented here can be used for further research into this challenging problem. We also present our ideas for generating graphs with known degree and centrality distributions. The goal in presenting this work is to identify a procedure for analyzing such graphs once the problem of addressing disconnected components has been addressed. When working with a single data set, this generator can be used to create many instances of graphs that can be used to analyze the robustness of the centrality computations for the original data set. Although the results did not match perfectly in the case of the Facebook Ego dataset used in the experiments presented here, this again represents a good start in the direction of a graph generator for such problems. We note that there are potential trade-offs between how the degree and centrality distributions are fit to the original data and suggested several possible avenues for follow-on research efforts.

97 MATHEMATICS AND COMPUTING↗

HOOVER

HOOVER is a distributed framework for solving streaming/dynamic graph problems where the structure of a graph changes over time based on the state of its vertices.

97 MATHEMATICS AND COMPUTING↗

Building near-real-time processing pipelines with the spark-MPI platform

Advances in detectors and computational technologies provide new opportunities for applied research and the fundamental sciences. Concurrently, dramatic increases in the three V's (Volume, Velocity, and Variety) of experimental data and the scale of computational tasks produced the demand for new real-time processing systems at experimental facilities. Recently, this demand was addressed by the Spark-MPI approach connecting the Spark data-intensive platform with the MPI high-performance framework. In contrast with existing data management and analytics systems, Spark introduced a new middleware based on resilient distributed datasets (RDDs), which decoupled various data sources from high-level processing algorithms. The RDD middleware significantly advanced the scope of data-intensive applications, spreading from SQL queries to machine learning to graph processing. Spark-MPI further extended the Spark ecosystem with the MPI applications using the Process Management Interface. The paper explores this integrated platform within the context of online ptychographic and tomographic reconstruction pipelines.

97 MATHEMATICS AND COMPUTING↗