Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “difference graphs”

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 487 records · Page 27

Decode the Workload: Training Deep Learning Models for Efficient Compute Cluster Representation

Monitoring the status of a high throughput computing cluster running computationally intensive production jobs is a crucial yet challenging system administration task due to the complexity of such systems. To this end, we train autoencoders using the Linux kernel CPU metrics of the cluster. Additionally, we explore assisting these models with graph neural networks to share information across threads within a compute node. The models are compared in terms of their ability to: 1) Produce a compressed latent representation that captures the salient features of the input, 2) Detect anomalous activity, and 3) Make distinction between different kinds of jobs run at Jefferson Lab. The goal is to have a robust encoder whose compressed embeddings are used for several downstream tasks. We extend this study further by deploying these models in a human-in-the-loop production-based setting for the anomaly detection task and discuss the associated implementation aspects such as continual learning and the criterion to generate alarms. This study represents a first step in the endeavor towards building self-supervised large-scale foundation models for computing centers.

Mohammed, Ahmed↗

Bayesian chain graph models to characterize microbe-environment dynamics

Microbiome data require statistical models that can simultaneously decode microbes' reaction to the environment and interactions among microbes. While a multiresponse linear regression model seems like a straight-forward solution, we argue that treating it as a graphical model is problematic given that the regression coefficient matrix does not encode the conditional dependence structure between response and predictor nodes. This observation is especially important in biological settings when we have prior knowledge on the edges from specific experimental interventions that can only be properly encoded under a conditional dependence model. Here, we propose a chain graph model with two sets of nodes (predictors and responses) whose solution yields a graph with edges that indeed represent conditional dependence, thus agreeing with the experimenter's intuition on the average behavior of nodes under treatment. The solution to our model is sparse via the Bayesian linear regression (LASSO). In addition, we propose an adaptive extension so that different shrinkages can be applied to different edges to incorporate edge-specific prior knowledge. Our model is computationally inexpensive through an efficient Gibbs sampling algorithm and can account for binary, counting, and compositional responses via an appropriate hierarchical structure. We test the performance of our model in a variety of simulated datasets, thereby showing superior performance to state-of-the-art approaches. We further apply our model to human gut and soil microbial compositional datasets, and we highlight that CG-LASSO can estimate biologically meaningful network structures in the data.

compositional data↗

Orbits: Computer simulation

In rotating machinery dynamics an orbit (Lissajous curve) represents the dynamic path of the shaft centerline motion during shaft rotation and resulting precession. The orbit can be observed with an oscilloscope connected to XY promixity probes. The orbits can also be simulated by a computer. The software for HP computer simulates orbits for two cases: (1) Symmetric orbit with four frequency components with different radial amplitudes and relative phase angles; and (2) Nonsymmetric orbit with two frequency components with two different vertical/horizontal amplitudes and two different relative phase angles. Each orbit carries a Keyphasor mark (one-per-turn reference). The frequencies, amplitudes, and phase angles, as well as number of time steps for orbit computation, have to be chosen and introduced to the computer by the user. The orbit graphs can be observed on the computer screen.

Muszynska, A.↗

Automated Recognition of 3D Features in GPIR Images

A method of automated recognition of three-dimensional (3D) features in images generated by ground-penetrating imaging radar (GPIR) is undergoing development. GPIR 3D images can be analyzed to detect and identify such subsurface features as pipes and other utility conduits. Until now, much of the analysis of GPIR images has been performed manually by expert operators who must visually identify and track each feature. The present method is intended to satisfy a need for more efficient and accurate analysis by means of algorithms that can automatically identify and track subsurface features, with minimal supervision by human operators. In this method, data from multiple sources (for example, data on different features extracted by different algorithms) are fused together for identifying subsurface objects. The algorithms of this method can be classified in several different ways. In one classification, the algorithms fall into three classes: (1) image-processing algorithms, (2) feature- extraction algorithms, and (3) a multiaxis data-fusion/pattern-recognition algorithm that includes a combination of machine-learning, pattern-recognition, and object-linking algorithms. The image-processing class includes preprocessing algorithms for reducing noise and enhancing target features for pattern recognition. The feature-extraction algorithms operate on preprocessed data to extract such specific features in images as two-dimensional (2D) slices of a pipe. Then the multiaxis data-fusion/ pattern-recognition algorithm identifies, classifies, and reconstructs 3D objects from the extracted features. In this process, multiple 2D features extracted by use of different algorithms and representing views along different directions are used to identify and reconstruct 3D objects. In object linking, which is an essential part of this process, features identified in successive 2D slices and located within a threshold radius of identical features in adjacent slices are linked in a directed-graph data structure. Relative to past approaches, this multiaxis approach offers the advantages of more reliable detections, better discrimination of objects, and provision of redundant information, which can be helpful in filling gaps in feature recognition by one of the component algorithms. The image-processing class also includes postprocessing algorithms that enhance identified features to prepare them for further scrutiny by human analysts (see figure). Enhancement of images as a postprocessing step is a significant departure from traditional practice, in which enhancement of images is a preprocessing step.

Park, Han↗

A Privacy First Path Analysis using Clickstream Data

In the modern digital economy, data-driven decision making is crucial for effectively meeting the ever-evolving demands of consumer engagement and satisfaction. Clickstream data has become invaluable for understanding customer behavior, yet concerns over privacy and security persist, especially with some internet service providers profiting from its sale. This article introduces an innovative methodology that blends experiential learning with advanced cryptographic techniques, including differential privacy and graph analytics. The core objective of this methodology is to estimate Customer Lifetime Value (CLV) by analyzing clickstream data, achieving an average prediction accuracy of 92.4% in user engagement levels while ensuring user anonymity through Recency, Frequency, and Monetary (RFM) analysis. Our study introduces the concept of a “data depositor” and a privacy manager, employing the composition theorem to merge non-adaptive queries effectively. Privacy budgets (? = 1.0, d = 10-5), sensitivity-specific techniques, and data partitioning were applied. Randomization and noise addition protect data integrity, with special handling for categorical values. This approach, differing from prior studies, offers a 12.6% improvement in privacy-preserving targeting accuracy while maintaining strict confidentiality, presenting a novel path forward in data-driven decision-making.

Frequency and Monetary (RFM) analysis↗

Long-duration life tests of slip ring capsule assemblies for inertial guidance platforms

Eight slip ring capsules, each having 80 or 100 circuits, were operated for time periods ranging from 14,300 hours to 24,700 hours. The test mode simulated the motion of gimbal axes of the Saturn inertial guidance the platform in an organic free nitrogen environment. Computer-compiled noise data (approximately 45,000 recordings) were graphed as a function of test time and position within the capsules and as extreme probability distributions. Greater than ninety-nine percent of the noise measurements for the capsules with sufficient lubrication were less than 10 milliohms. Capsules with glass dielectrics did not perform significantly differently than those with filled epoxy dielectrics. The initial wear mode of prow formation was followed by rider wear. After 10 to the 8th power wipes, ring wear depth did not exceed the surface finish and the radial rider wear depth was less than 13 microns.

Cole, S. R.↗

Noise generated by quiet engine fans. 3: Fan C

A family of fans designed with low noise features was acoustically evaluated, and noise results are documented for a 1.6-pressure-ratio, 472-m/sec (155-ft/sec) tip speed fan. The fan is described and some aerodynamic operating data are given. Far field noise around the fan was measured over a range of operating conditions for a variety of configurations having different arrangements of sound absorbing material in the flow ducts. Complete results of 1.3 octave band analysis of the data are presented in tabular form. Included also are acoustic power spectra and sideline perceived noise levels. Representative 1/3 octave band data are presented graphically, and sample graphs of continuous narrow band spectra are also provided.

Montegan, F. J.↗

Comparative study of machine learning techniques for post-combustion carbon capture systems

Computational analysis of countercurrent flows in packed absorption columns, often used in solvent-based post-combustion carbon capture systems (CCSs), is challenging. Typically, computational fluid dynamics (CFD) approaches are used to simulate the interactions between a solvent, gas, and column's packing geometry while accounting for the thermodynamics, kinetics, heat, and mass transfer effects of the absorption process. These simulations can then be used explain a column's hydrodynamic characteristics and evaluate its CO 2 -capture efficiency. However, these approaches are computationally expensive, making it difficult to evaluate numerous designs and operating conditions to improve efficiency at industrial scales. In this work, we comprehensively explore the application of statistical ML methods, convolutional neural networks (CNNs), and graph neural networks (GNNs) to aid and accelerate the scale-up and design optimization of solvent-based post-combustion CCSs. We apply these methods to CFD datasets of countercurrent flows in absorption columns with structured packings characterized by several geometric parameters. We train models to use these parameters, inlet velocity conditions, and other model-specific representations of the column to estimate key determinants of CO 2 -capture efficiency without having to simulate additional CFD datasets. We also evaluate the impact of different input types on the accuracy and generalizability of each model. We discuss the strengths and limitations of each approach to further elucidate the role of CNNs, GNNs, and other machine learning approaches for CO 2 -capture property prediction and design optimization.

97 MATHEMATICS AND COMPUTING↗

The upper atmosphere of Uranus - EUV occultations observed by Voyager 2

EUV (52-170 nm) solar and stellar occultation observations of the Uranian atmosphere from 500 microbar to about 1 pbar, obtained with the UV spectrometer on Voyager 2 during its encounter with Uranus in January 1986, are reported. The data are presented in extensive tables and graphs and characterized in detail. The atmosphere is found to be dominated by H2 (with very small hydrocarbon mixing ratios) out to about 1.25 Uranian radii, where atomic H becomes important. Also noted are a small (relative to Jupiter and Saturn) homopause eddy-diffusion coefficient, little difference between the atmospheres of the day and night hemispheres, high temperatures (800 + or - 100 K) above about 1-10 nbar, and number densities of several hundred H/cu cm at 2 Uranian radii. The implications of the latter finding for ring dynamics and plasma populations are explored.

Herbert, Floyd↗

Cataclysmic variables

Recent observations of cataclysmic variables (CVs) at different wavelengths are reviewed, with a focus on their implications for theoretical models. Consideration is given to disk CVs (the flux distribution of the disk and changes during dwarf-nova outbursts), magnetic CVs (flux distributions and components), and the underlying stars. Typical data are presented in graphs, tables, and sample spectra, and it is concluded that more detailed multiwavelength observations are needed to improve models of radiative transfer and viscosity effects in accretion disks.

Szkody, Paula↗

Topological structure of complex predictions

Abstract Current complex prediction models are the result of fitting deep neural networks, graph convolutional networks or transducers to a set of training data. A key challenge with these models is that they are highly parameterized, which makes describing and interpreting the prediction strategies difficult. We use topological data analysis to transform these complex prediction models into a simplified topological view of the prediction landscape. The result is a map of the predictions that enables inspection of the model results with more specificity than dimensionality-reduction methods such as tSNE and UMAP. The methods scale up to large datasets across different domains. We present a case study of a transformer-based model previously designed to predict expression levels of a piece of DNA in thousands of genomic tracks. When the model is used to study mutations in the BRCA1 gene, our topological analysis shows that it is sensitive to the location of a mutation and the exon structure of BRCA1 in ways that cannot be found with tools based on dimensionality reduction. Moreover, the topological framework offers multiple ways to inspect results, including an error estimate that is more accurate than model uncertainty. Further studies show how these ideas produce useful results in graph-based learning and image classification.

Computer Science↗

Graph convolutional networks applied to unstructured flow field data

Abstract Many scientific and engineering processes produce spatially unstructured data. However, most data-driven models require a feature matrix that enforces both a set number and order of features for each sample. They thus cannot be easily constructed for an unstructured dataset. Therefore, a graph based data-driven model to perform inference on fields defined on an unstructured mesh, using a graph convolutional neural network (GCNN) is presented. The ability of the method to predict global properties from spatially irregular measurements with high accuracy is demonstrated by predicting the drag force associated with laminar flow around airfoils from scattered velocity measurements. The network can infer from field samples at different resolutions, and is invariant to the order in which the measurements within each sample are presented. The GCNN method, using inductive convolutional layers and adaptive pooling, is able to predict this quantity with a validation R 2 above 0.98, and a Normalized Mean Squared Error below 0.01, without relying on spatial structure.

Ogoke, Francis (ORCID:0000000224327783)↗

The problem of the man-space data interface during computer processing of data

The necessity is shown for data output at different processing stages to man, taking into account the processing level, the output objective, and the user. The use of the phototelegraph I/O computer device for this purpose is considered in detail, and several examples are given. It is shown that the type of output (shaded of halftone graphs), the scales, the compression, and the mutual position of the data are selected on the basis of the character of the data displayed.

Mamotko, Z. N.↗

Significance of light and social cues in the maintenance of temporal organization in man

The effects of light:darkness (LD) cycles and social interaction on the response to long-term confinement (105 days) were investigated experimentally in three groups of three male subjects aged 20-24 years. Data from measurements of physiological parameters indicating changes in circadian rhythms are presented in graphs and analyzed; it is found that the LD-induced rhythm changes observed in previous studies of subjects isolated singly do not appear when subjects are confined in groups of three, suggesting a positive adaptive effect of social contact. In one subject who was transferred to a different group at day 84, hostile social interactions and poor circadian-rhythm entrainment were observed; the possible reasons for this response are considered.

Winget, C. M.↗

Towards a General Equation for the Survival of Microbes Transferred between Solar System Bodies

It should be possible to construct a general equation describing the survival of microbes transferred between Solar System bodies. Such an equation will be useful for constraining the likelihood of transfer of viable organisms between bodies throughout the lifetime of the Solar System, and for refining Planetary Protection constraints placed on future missions. We will discuss the construction of such an equation, present a plan for definition of pertinent factors, and will describe what research will be necessary to quantify those factors. Description: We will examine the case of microbes transferred between Solar System bodies as residents in meteorite material ejected from one body (the "intial body") and deposited on another (the "target body"). Any microbes transferred in this fashion will experience four distinct phases between their initial state on the initial body, up to the point where they colonize the target body. Each of these phases features phenomena capable of reducing or exterminating the initial microbial population. They are: 1) Ejection: Material is ejected from the initial body, imparting shock followed by rapid desiccation and cooling. 2) Transport: Material travels through interplanetary space to the target body, exposing a hypothetical microbial population to extended desiccation, irradiation, and temperature extremes. 3) Infall: Material is deposited on the target body, diminishing the microbial population through shock, mass loss, and heating. 4) Adaptation: Any microbes which survive the previous three phases must then adapt to new chemophysical conditions of the target body. Differences in habitability between the initial and target bodies dominate this phase. A suitable general-form equation can be assembled from the above factors by defining the initial number of microbes in an ejected mass and applying multiplicitive factors based on the physical phenomena inherent to each phase. It should be possible to present the resulting equation in terms of initial ejection mass, ejection shock magnitude, transfer time, initial microbial load and/or other terms and generate graphs defining the number of surviving microbes. The general form of the equation is: x(sub f) = x(sub i) f(sub1) f(sub 2) f(sub 3) f(sub 4) Where x(sub f) is the final number of microbes to survive transfer, x(sub i) is the initial population prior to ejection, and f(sub 1-4) are mortality factors for the four phases described above. Among other considerations, f(sub 1) will vary with respect to impact shock magnitude and f(sub 2) will be time-dependent. Considerable research has been performed to date to quantify the survival rates of various microbes in response to portions of these four phases, both as vegetative cells and/or spores. Results indicate that many species tend to respond differently to the pertinent mortality factors, especially in the case of extremophiles. Therefore, a complete equation will include species-specific responses to the mortality factors.

Fries, M.↗

From Data to Knowledge: A Graph-Based Reliability Approach to Assess System Health

With the goal of maximizing plant reliability and availability, complex systems such as nuclear power plants continuously monitor and record the performance and the health status of many components, assets, and systems. Such data may take the form of online monitoring data, condition reports, and maintenance reports and it carries the potential to provide system engineers with insights into anomalous behaviors or degradation trends as well as the possible causes behind them and to predict their direct consequences. The analysis of such data poses however few challenges. While some of these challenges are technical in nature (i.e., data are often distributed over several physical servers or databases), others are conceptual in nature (i.e., data elements come in different formats, numeric or textual), and measured values have different scales (e.g., vibration spectra and oil temperature). This paper directly tackles these challenges, and it focuses on the integration of all these data elements in order to assist plant system engineers in analyzing component, assets, and systems performances and optimize maintenance activities. This is performed by 1) extracting knowledge from textual data via technical language processing methods, and 2) quantifying system, asset, and component health from numeric condition-based data. We rely on model-based system engineering (MBSE) models of systems and assets to identify their architecture and functional (i.e., cause and effect) relations. Numeric and textual data elements are then associated with an MBSE graph element, based on their nature. This bonding of MBSE models and data elements constitutes a first-of-its-kind knowledge graph of a nuclear power plants system, with data elements being organized in a structured manner that enables system engineers to identify cause-effect trends in data elements and carry out appropriate actions in response.

97 MATHEMATICS AND COMPUTING↗

EXAGRAPH: Graph and combinatorial methods for enabling exascale applications

Combinatorial algorithms in general and graph algorithms in particular play a critical enabling role in numerous scientific applications. However, the irregular memory access nature of these algorithms makes them one of the hardest algorithmic kernels to implement on parallel systems. With tens of billions of hardware threads and deep memory hierarchies, the exascale computing systems in particular pose extreme challenges in scaling graph algorithms. The codesign center on combinatorial algorithms, ExaGraph, was established to design and develop methods and techniques for efficient implementation of key combinatorial (graph) algorithms chosen from a diverse set of exascale applications. Algebraic and combinatorial methods have a complementary role in the advancement of computational science and engineering, including playing an enabling role on each other. In this paper, we survey the algorithmic and software development activities performed under the auspices of ExaGraph from both a combinatorial and an algebraic perspective. In particular, we detail our recent efforts in porting the algorithms to manycore accelerator (GPU) architectures. We also provide a brief survey of the applications that have benefited from the scalable implementations of different combinatorial algorithms to enable scientific discovery at scale. We believe that several applications will benefit from the algorithmic and software tools developed by the ExaGraph team.

97 MATHEMATICS AND COMPUTING↗

NaroNet: Discovery of tumor microenvironment elements from highly multiplexed images

Understanding the spatial interactions between the elements of the tumor microenvironment -i.e. tumor cells. fibroblasts, immune cells- and how these interactions relate to the diagnosis or prognosis of a tumor is one of the goals of computational pathology. We present NaroNet, a deep learning framework that models the multi-scale tumor microenvironment from multiplex-stained cancer tissue images and provides patient-level interpretable predictions using a seamless end-to-end learning pipeline. Trained only with multiplex-stained tissue images and their corresponding patient-level clinical labels, NaroNet unsupervisedly learns which cell phenotypes, cell neighborhoods, and neighborhood interactions have the highest influence to predict the correct label. To this end, NaroNet incorporates several novel and state-of-the-art deep learning techniques, such as patch-level contrastive learning, multi-level graph embeddings, a novel max-sum pooling operation, or a metric that quantifies the relevance that each microenvironment element has in the individual predictions. We validate NaroNet using synthetic data simulating multiplex-immunostained images where a patient label is artificially associated to the -adjustable- probabilistic incidence of different microenvironment elements. We then apply our model to two sets of images of human cancer tissues: 336 seven-color multiplex-immunostained images from 12 high-grade endometrial cancer patients; and 382 35-plex mass cytometry images from 215 breast cancer patients. In both synthetic and real datasets, NaroNet provides outstanding predictions of relevant clinical information while associating those predictions to the presence of specific microenvironment elements.

60 APPLIED LIFE SCIENCES↗