Kinematic transformations of several mechanisms
Kinematic information on various mechanisms in graphical form for input-output motion transformation
KINEMATICS↗
SEARCH · Search NASA
Results for “Graph transformer”
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.
Task scheduling in dataflow computer architectures
Dataflow computers provide a platform for the solution of a large class of computational problems, which includes digital signal processing and image processing. Many typical applications are represented by a set of tasks which can be repetitively executed in parallel as specified by an associated dataflow graph. Research in this area aims to model these architectures, develop scheduling procedures, and predict the transient and steady state performance. Researchers at NASA have created a model and developed associated software tools which are capable of analyzing a dataflow graph and predicting its runtime performance under various resource and timing constraints. These models and tools were extended and used in this work. Experiments using these tools revealed certain properties of such graphs that require further study. Specifically, the transient behavior at the beginning of the execution of a graph can have a significant effect on the steady state performance. Transformation and retiming of the application algorithm and its initial conditions can produce a different transient behavior and consequently different steady state performance. The effect of such transformations on the resource requirements or under resource constraints requires extensive study. Task scheduling to obtain maximum performance (based on user-defined criteria), or to satisfy a set of resource constraints, can also be significantly affected by a transformation of the application algorithm. Since task scheduling is performed by heuristic algorithms, further research is needed to determine if new scheduling heuristics can be developed that can exploit such transformations. This work has provided the initial development for further long-term research efforts. A simulation tool was completed to provide insight into the transient and steady state execution of a dataflow graph. A set of scheduling algorithms was completed which can operate in conjunction with the modeling and performance tools previously developed. Initial studies on the performance of these algorithms were done to examine the effects of application algorithm transformations as measured by such quantities as number of processors, time between outputs, time between input and output, communication time, and memory size.
Katsinis, Constantine↗
Parafrase restructuring of FORTRAN code for parallel processing
Parafrase transforms a FORTRAN code, subroutine by subroutine, into a parallel code for a vector and/or shared-memory multiprocessor system. Parafrase is not a compiler; it transforms a code and provides information for a vector or concurrent process. Parafrase uses a data dependency to reveal parallelism among instructions. The data dependency test distinguishes between recurrences and statements that can be directly vectorized or parallelized. A number of transformations are required to build a data dependency graph.
Wadhwa, Atul↗
Generalized serial search code acquisition - The equivalent circular state diagram approach
A transform-domain method for deriving the generating function of the acquisition process resulting from an arbitrary serial search strategy is presented. The method relies on equivalent circular state diagrams, uses Mason's formula from flow-graph theory, and employs a minimum number of required parameters. The transform-domain approach is briefly described and the concept of equivalent circular state diagrams is introduced and exploited to derive the generating function and resulting mean acquisition time for three particular cases of interest, the continuous/center Z search, the broken/center Z search, and the expanding window search. An optimization of the latter technique is performed whereby the number of partial windows which minimizes the mean acquisition time is determined. The numerical results satisfy certain intuitive predictions and provide useful design guidelines for such systems.
Polydoros, A.↗
A family of permutations for concurrent factorization of block tridiagonal matrices
The inherent strong seriality of closely coupled systems is circumvented by defining a family of permutations for reordering equation sets whose matrix of coefficients is Hermitian block tridiagonal. The authors show how these permutations can be used to achieve relatively high concurrency in the Cholesky factorization of banded systems at the expense of introducing limited extra computations due to fill-in terms in the factors. Directed graphs are developed for the concurrent factorization of the transformed matrix of coefficients by the Cholesky algorithm. Expressions for speedup and efficiency are derived in terms of parameters of the permutation, set of equations, and machine architecture.
Utku, Senol↗
Spatial scales of cirrus cloud properties
Research in studying the spatial scales of the cirrus, used data collected during the flight legs of the NCAR Sabreliner aircraft on four days during the FIRE Cirrus IFO to study the spatial scales of the cirrus, and will concentrate on the scales of horizontal wind. The spatial scales of the cloud features can be described by power spectra (or spectral density graphs) and cumulative variance graphs. The cumulative variance graphs were created by first using a Fast Fourier Transform (FFT) to create variance spectra. The variances were then summed in a cumulative fashion from the largest scalelengths (wavelengths) to the smallest. No detrending was done to the original data, and no smoothing or averaging was done to the spectral points. All the spectral points were included. This means that the values of the first five to ten spectral points of the large scalelengths should only be considered to be qualitatively correct. The cumulative variance at smaller scalelengths should be correct because a more accurate representation of the variance at the larger scalelengths should only redistribute the energy amongst the larger scalelengths.
Hein, Paul F.↗
Stresses and Strains within the "Stable" North American Plate
This paper presents a final report on "Stresses and Strains within the "Stable" North American Plate". The topics include: 1) Strain rates near the New Madrid seismic zone; 2) Signal Processing of intermediate term data; and 3) Transform fault stresses and strains. The paper also includes graphs of the stress and strain distributions.
Engeln, Joe↗
Exploring Semantic Search Capability of Graph Convolutions Over a Knowledge Graph Built Using Earth Science Corpora
Traditional knowledge graphs tend to be too generic, and often perform poorly on complex scientific queries. Often times, precedence is given to pop culture over scientific knowledge for queries. This is predominantly due to the use of internet sources for building the knowledge graph. With this work, we aim to explore the effectiveness of combining a knowledge graph generated from earth science corpora with a language model and graph convolutions for the purpose of surfacing latent and related sentences given a natural language query. In this model, sentences are conceptualized in the graph as nodes which are connected through entities—words and phrases of interest found in the text—extracted using Google Cloud’s entity extraction model. The language model we used for this is Bidirectional Encoder Representations from Transformers (BERT).The sentences are given a numeric representation by the BERT model. Graph convolutions are then applied to sentence embeddings in order to obtain a vector representation of the sentence as well as the surrounding graph structure, thereby leveraging the power of adjacency inherently encoded in graph structures. With this presentation, we demonstrate the ability of graph convolutions and their improved ability to surface relevant, latent information based on the subject of the input query.
Muthukumaran Ramasubramanian↗
Optical Calibration Process Developed for Neural-Network-Based Optical Nondestructive Evaluation Method
A completely optical calibration process has been developed at Glenn for calibrating a neural-network-based nondestructive evaluation (NDE) method. The NDE method itself detects very small changes in the characteristic patterns or vibration mode shapes of vibrating structures as discussed in many references. The mode shapes or characteristic patterns are recorded using television or electronic holography and change when a structure experiences, for example, cracking, debonds, or variations in fastener properties. An artificial neural network can be trained to be very sensitive to changes in the mode shapes, but quantifying or calibrating that sensitivity in a consistent, meaningful, and deliverable manner has been challenging. The standard calibration approach has been difficult to implement, where the response to damage of the trained neural network is compared with the responses of vibration-measurement sensors. In particular, the vibration-measurement sensors are intrusive, insufficiently sensitive, and not numerous enough. In response to these difficulties, a completely optical alternative to the standard calibration approach was proposed and tested successfully. Specifically, the vibration mode to be monitored for structural damage was intentionally contaminated with known amounts of another mode, and the response of the trained neural network was measured as a function of the peak-to-peak amplitude of the contaminating mode. The neural network calibration technique essentially uses the vibration mode shapes of the undamaged structure as standards against which the changed mode shapes are compared. The published response of the network can be made nearly independent of the contaminating mode, if enough vibration modes are used to train the net. The sensitivity of the neural network can be adjusted for the environment in which the test is to be conducted. The response of a neural network trained with measured vibration patterns for use on a vibration isolation table in the presence of various sources of laboratory noise is shown. The output of the neural network is called the degradable classification index. The curve was generated by a simultaneous comparison of means, and it shows a peak-to-peak sensitivity of about 100 nm. The following graph uses model generated data from a compressor blade to show that much higher sensitivities are possible when the environment can be controlled better. The peak-to-peak sensitivity here is about 20 nm. The training procedure was modified for the second graph, and the data were subjected to an intensity-dependent transformation called folding. All the measurements for this approach to calibration were optical. The peak-to-peak amplitudes of the vibration modes were measured using heterodyne interferometry, and the modes themselves were recorded using television (electronic) holography.
Decker, Arthur J.↗
A rapid method for obtaining frequency-response functions for multiple input photogrammetric data
A two-digital-camera photogrammetric technique for measuring the motion of a vibrating spacecraft structure or wing surface and an applicable data-reduction algorithm are presented. The 3D frequency-response functions are obtained by coordinate transformation from averaged cross and autopower spectra derived from the 4D camera coordinates by Fourier transformation. Error sources are investigated analytically, and sample results are shown in graphs.
Kroen, M. L.↗
Multiple degree of freedom object recognition using optical relational graph decision nets
Multiple-degree-of-freedom object recognition concerns objects with no stable rest position with all scale, rotation, and aspect distortions possible. It is assumed that the objects are in a fairly benign background, so that feature extractors are usable. In-plane distortion invariance is provided by use of a polar-log coordinate transform feature space, and out-of-plane distortion invariance is provided by linear discriminant function design. Relational graph decision nets are considered for multiple-degree-of-freedom pattern recognition. The design of Fisher (1936) linear discriminant functions and synthetic discriminant function for use at the nodes of binary and multidecision nets is discussed. Case studies are detailed for two-class and multiclass problems. Simulation results demonstrate the robustness of the processors to quantization of the filter coefficients and to noise.
Casasent, David P.↗
Requirement Discovery Using Embedded Knowledge Graph with ChatGPT
- NASA’s Air Traffic Management-Exploration (ATM-X) Urban Air Mobility (UAM) Airspace Subproject is conducting research that evolves UAM airspace towards a highly automated and operationally flexible system of the future. - (see https://www.nasa.gov/uam-overview/ for more information) - The complexity of UAM airspace, and its evolution through a series of transformative epochs, requires a planning tool to effectively organize, integrate, and communicate the research that will guide the evolution of UAM operations in the National Airspace System (NAS). - The planning tool, called the UAM airspace research roadmap (or just roadmap), is being developed as a new system engineering methodology leveraging model based system engineering (MBSE) and artificial intelligence capabilities. This presentation gives an overview of the Knowledge Graph and ChatGPT applications within this system engineering methodology and will describe how it is being used to meet the ATM-X UAM Airspace Subproject’s overarching research goals.
systems engineering↗
Predicting the Strengths of Angle-Plied Laminates
Simplified convenient procedure has been developed that can be used to determine elastic and strength properties of angle-plied laminates. Method is suitable for use with pocket calculator. Consists of simple equations and graphs of ply combinations from most frequently used composites. Procedure makes use of well-known transformation equations, ply stress influence coefficients, and ply uniaxial composites including interply and intraply hybrids.
Chamis, C. C.↗
Strategies for concurrent processing of complex algorithms in data driven architectures
The performance modeling and enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures is examined. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called ATAMM (Algorithm To Architecture Mapping Model). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.
Stoughton, John W.↗
Strategies for concurrent processing of complex algorithms in data driven architectures
Performance modeling and performance enhancement for periodic execution of large-grain, decision-free algorithms in data flow architectures are discussed. Applications include real-time implementation of control and signal processing algorithms where performance is required to be highly predictable. The mapping of algorithms onto the specified class of data flow architectures is realized by a marked graph model called algorithm to architecture mapping model (ATAMM). Performance measures and bounds are established. Algorithm transformation techniques are identified for performance enhancement and reduction of resource (computing element) requirements. A systematic design procedure is described for generating operating conditions for predictable performance both with and without resource constraints. An ATAMM simulator is used to test and validate the performance prediction by the design procedure. Experiments on a three resource testbed provide verification of the ATAMM model and the design procedure.
Som, Sukhamoy↗
Antenna Near-Field Probe Station Scanner
A miniaturized antenna system is characterized non-destructively through the use of a scanner that measures its near-field radiated power performance. When taking measurements, the scanner can be moved linearly along the x, y and z axis, as well as rotationally relative to the antenna. The data obtained from the characterization are processed to determine the far-field properties of the system and to optimize the system. Each antenna is excited using a probe station system while a scanning probe scans the space above the antenna to measure the near field signals. Upon completion of the scan, the near-field patterns are transformed into far-field patterns. Along with taking data, this system also allows for extensive graphing and analysis of both the near-field and far-field data. The details of the probe station as well as the procedures for setting up a test, conducting a test, and analyzing the resulting data are also described.
Zaman, Afroz J.↗
Quantum Leap: Evaluating the Feasibility of Quantum Machine Learning Using NASA Earth Observational Data
This study explores the feasibility of leveraging quantum machine learning (QML) to analyze NASA Earth Observational (EO) data for climate change research, with a particular focus on the phenomenon of ”crop frosting” which has become more prevalent due to climate change. We implemented and evaluated two QML models, the Variational Quantum Classifier (VQC) and Quantum Support Vector Classifier (QSVC), in both simulated and real quantum computing environments using a 127 qubit IBM quantum processor. Our study emphasizes the scientific rigor in comparing these quantum models with a classical Support Vector Machine (SVM) classifier, highlighting their performance in processing climate data. The results offer valuable insights into the potential scientific advantages, limitations, and scalability of QML for analyzing EO datasets, thus paving the way for more advanced climate modeling and predictive analytics using quantum computing. We showcased how Environmental Interaction Knowledge Graphs (EIKGs) and Digital Twins (DTs) can be integrated into this study. This research underscores the transformative potential of Classical and QML leveraging KGs and DT to address the multifaceted challenges posed by climate change.
Quantum Computing↗
Neutrino tomography - Tevatron mapping versus the neutrino sky
The feasibility of neutrino tomography of the earth's interior is discussed, taking the 80-GeV W-boson mass determined by Arnison (1983) and Banner (1983) into account. The opacity of earth zones is calculated on the basis of the preliminary reference earth model of Dziewonski and Anderson (1981), and the results are presented in tables and graphs. Proposed tomography schemes are evaluated in terms of the well-posedness of the inverse-Radon-transform problems involved, the neutrino generators and detectors required, and practical and economic factors. The ill-posed schemes are shown to be infeasible; the well-posed schemes (using Tevatrons or the neutrino sky as sources) are considered feasible but impractical.
Wilson, T. L.↗