Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “NETWORK”

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 1,261 records · Page 70

Waveform processing using neural network algorithms on the front-end electronics

In a multi-channel radiation detector readout system, waveform sampling, digitization, and raw data transmission to the data acquisition system constitute a conventional processing chain. The deposited energy on the sensor is estimated by extracting peak amplitudes, area under pulse envelopes from the raw data, and starting times of signals or time of arrivals. However, such quantities can be estimated using machine learning algorithms on the front-end Application-Specific Integrated Circuits (ASICs), often termed as “edge computing”. Edge computation offers enormous benefits, especially when the analytical forms are not fully known or the registered waveform suffers from noise and imperfections of practical implementations. In this work, we aim to predict peak amplitude from a single waveform snippet whose rising and falling edges containing only 3 to 4 samples. We thoroughly studied two well-accepted neural network algorithms, Multi-Layer Perceptron (MLP) and Convolutional Neural Network (CNN) by varying their model sizes. Further, to better fit front-end electronics, neural network model reduction techniques, such as network pruning methods and variable-bit quantization approaches, were also studied. By combining pruning and quantization, our best performing model has the size of 1.5 KB, reduced from 16.6 KB of its full model counterpart. It can reach mean absolute error of 0.034 comparing to that of a naive baseline of 0.135. Such parameter-efficient and predictive neural network models established feasibility and practicality of their deployment on front-end ASICs.

47 OTHER INSTRUMENTATION↗

Generative adversarial networks for scintillation signal simulation in EXO-200

Generative Adversarial Networks trained on samples of simulated or actual events have been proposed as a way of generating large simulated datasets at a reduced computational cost. In this work, a novel approach to perform the simulation of photodetector signals from the time projection chamber of the EXO-200 experiment is demonstrated. The method is based on a Wasserstein Generative Adversarial Network — a deep learning technique allowing for implicit non-parametric estimation of the population distribution for a given set of objects. Our network is trained on real calibration data using raw scintillation waveforms as input. We find that it is able to produce high-quality simulated waveforms an order of magnitude faster than the traditional simulation approach and, importantly, generalize from the training sample and discern salient high-level features of the data. In particular, the network correctly deduces position dependency of scintillation light response in the detector and correctly recognizes dead photodetector channels. Furthermore, the network output is then integrated into the EXO-200 analysis framework to show that the standard EXO-200 reconstruction routine processes the simulated waveforms to produce energy distributions comparable to that of real waveforms. Finally, the remaining discrepancies and potential ways to improve the approach further are highlighted.

47 OTHER INSTRUMENTATION↗

Compressing deep neural networks on FPGAs to binary and ternary precision with hls4ml

We present the implementation of binary and ternary neural networks in the hls4ml library, designed to automatically convert deep neural network models to digital circuits with FPGA firmware. Starting from benchmark models trained with floating point precision, we investigate different strategies to reduce the network's resource consumption by reducing the numerical precision of the network parameters to binary or ternary. We discuss the trade-off between model accuracy and resource consumption. In addition, we show how to balance between latency and accuracy by retaining full precision on a selected subset of network components. As an example, we consider two multiclass classification tasks: handwritten digit recognition with the MNIST data set and jet identification with simulated proton-proton collisions at the CERN Large Hadron Collider. The binary and ternary implementation has similar performance to the higher precision implementation while using drastically fewer FPGA resources.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

PRODeepSyn: predicting anticancer synergistic drug combinations by embedding cell lines with protein–protein interaction network

Abstract Although drug combinations in cancer treatment appear to be a promising therapeutic strategy with respect to monotherapy, it is arduous to discover new synergistic drug combinations due to the combinatorial explosion. Deep learning technology holds immense promise for better prediction of in vitro synergistic drug combinations for certain cell lines. In methods applying such technology, omics data are widely adopted to construct cell line features. However, biological network data are rarely considered yet, which is worthy of in-depth study. In this study, we propose a novel deep learning method, termed PRODeepSyn, for predicting anticancer synergistic drug combinations. By leveraging the Graph Convolutional Network, PRODeepSyn integrates the protein–protein interaction (PPI) network with omics data to construct low-dimensional dense embeddings for cell lines. PRODeepSyn then builds a deep neural network with the Batch Normalization mechanism to predict synergy scores using the cell line embeddings and drug features. PRODeepSyn achieves the lowest root mean square error of 15.08 and the highest Pearson correlation coefficient of 0.75, outperforming two deep learning methods and four machine learning methods. On the classification task, PRODeepSyn achieves an area under the receiver operator characteristics curve of 0.90, an area under the precision–recall curve of 0.63 and a Cohen’s Kappa of 0.53. In the ablation study, we find that using the multi-omics data and the integrated PPI network’s information both can improve the prediction results. Additionally, the case study demonstrates the consistency between PRODeepSyn and previous studies.

Wang, Xiaowen↗

Deep graph representations embed network information for robust disease marker identification

We report that the accurate disease diagnosis and prognosis based on omics data rely on the effective identification of robust prognostic and diagnostic markers that reflect the states of the biological processes underlying the disease pathogenesis and progression. In this article, we present GCNCC, a Graph Convolutional Network-based approach for Clustering and Classification, that can identify highly effective and robust network-based disease markers. Based on a geometric deep learning framework, GCNCC learns deep network representations by integrating gene expression data with protein interaction data to identify highly reproducible markers with consistently accurate prediction performance across independent datasets possibly from different platforms. GCNCC identifies these markers by clustering the nodes in the protein interaction network based on latent similarity measures learned by the deep architecture of a graph convolutional network, followed by a supervised feature selection procedure that extracts clusters that are highly predictive of the disease state. By benchmarking GCNCC based on independent datasets from different diseases (psychiatric disorder and cancer) and different platforms (microarray and RNA-seq), we show that GCNCC outperforms other state-of-the-art methods in terms of accuracy and reproducibility.

59 BASIC BIOLOGICAL SCIENCES↗

RF-Net 2: fast inference of virus reassortment and hybridization networks

Abstract Motivation A phylogenetic network is a powerful model to represent entangled evolutionary histories with both divergent (speciation) and convergent (e.g. hybridization, reassortment, recombination) evolution. The standard approach to inference of hybridization networks is to (i) reconstruct rooted gene trees and (ii) leverage gene tree discordance for network inference. Recently, we introduced a method called RF-Net for accurate inference of virus reassortment and hybridization networks from input gene trees in the presence of errors commonly found in phylogenetic trees. While RF-Net demonstrated the ability to accurately infer networks with up to four reticulations from erroneous input gene trees, its application was limited by the number of reticulations it could handle in a reasonable amount of time. This limitation is particularly restrictive in the inference of the evolutionary history of segmented RNA viruses such as influenza A virus (IAV), where reassortment is one of the major mechanisms shaping the evolution of these pathogens. Results Here, we expand the functionality of RF-Net that makes it significantly more applicable in practice. Crucially, we introduce a fast extension to RF-Net, called Fast-RF-Net, that can handle large numbers of reticulations without sacrificing accuracy. In addition, we develop automatic stopping criteria to select the appropriate number of reticulations heuristically and implement a feature for RF-Net to output error-corrected input gene trees. We then conduct a comprehensive study of the original method and its novel extensions and confirm their efficacy in practice using extensive simulation and empirical IAV evolutionary analyses. Availability and implementation RF-Net 2 is available at https://github.com/flu-crew/rf-net-2. Supplementary information Supplementary data are available at Bioinformatics online.

Markin, Alexey (ORCID:0000000332809050)↗

Causal network inference using biochemical kinetics

Motivation: Networks are widely used as structural summaries of biochemical systems. Statistical estimation of networks is usually based on linear or discrete models. However, the dynamics of biochemical systems are generally non-linear, suggesting that suitable non-linear formulations may offer gains with respect to causal network inference and aid in associated prediction problems. Results: We present a general framework for network inference and dynamical prediction using time course data that is rooted in nonlinear biochemical kinetics. This is achieved by considering a dynamical system based on a chemical reaction graph with associated kinetic parameters. Both the graph and kinetic parameters are treated as unknown; inference is carried out within a Bayesian framework. This allows prediction of dynamical behavior even when the underlying reaction graph itself is unknown or uncertain. Results, based on (i) data simulated from a mechanistic model of mitogen-activated protein kinase signaling and (ii) phosphoproteomic data from cancer cell lines, demonstrate that non-linear formulations can yield gains in causal network inference and permit dynamical prediction and uncertainty quantification in the challenging setting where the reaction graph is unknown. Availability and implementation: MATLAB R2014a software is available to download from warwick.ac.uk/chrisoates.

60 APPLIED LIFE SCIENCES↗

Temporal network alignment via GoT-WAVE

Abstract Motivation Network alignment (NA) finds conserved regions between two networks. NA methods optimize node conservation (NC) and edge conservation. Dynamic graphlet degree vectors are a state-of-the-art dynamic NC measure, used within the fastest and most accurate NA method for temporal networks: DynaWAVE. Here, we use graphlet-orbit transitions (GoTs), a different graphlet-based measure of temporal node similarity, as a new dynamic NC measure within DynaWAVE, resulting in GoT-WAVE. Results On synthetic networks, GoT-WAVE improves DynaWAVE’s accuracy by 30% and speed by 64%. On real networks, when optimizing only dynamic NC, the methods are complementary. Furthermore, only GoT-WAVE supports directed edges. Hence, GoT-WAVE is a promising new temporal NA algorithm, which efficiently optimizes dynamic NC. We provide a user-friendly user interface and source code for GoT-WAVE. Availability and implementation http://www.dcc.fc.up.pt/got-wave/ Supplementary information Supplementary data are available at Bioinformatics online.

Aparício, David↗

False alarms and the IMS infrasound network: Understanding the factors influencing the creation of false events

The International Monitoring System (IMS) infrasound network has been designed to acquire the necessary data to detect and locate explosions in the atmosphere with a yield equivalent to 1 kiloton of TNT anywhere on Earth. A major associated challenge is the task of automatically processing data from all IMS infrasound stations to identify possible nuclear tests for subsequent review by analysts. This paper is the first attempt to quantify the false alarm rate (FAR) of the IMS network, and in particular to assess how the FAR is affected by the numbers and distributions of detections at each infrasound station. To ensure that the results are sufficiently general, and not dependent entirely on one detection algorithm, the assessment is based on two detection algorithms that can be thought of as end members in their approach to the trade-off between missed detections and false alarms. The results show that the FAR for events formed at only two arrays is extremely high (ranging from 10’s to 100’s of false events per day across the IMS network, depending on the detector tuning). It is further shown that the FAR for events formed at three or more IMS arrays is driven by ocean-generated waves (microbaroms), despite efforts within both detection algorithms for avoiding these signals, indicating that further research into this issue is merited. Overall, the results highlight the challenge of processing data from a globally sparse network of stations to detect and form events. On the basis of these results, it is shown that further work on understanding signal and noise characteristics is needed before attempting to automatically form events detected at only two arrays on the global network. In particular, more work is required to reduce false alarms caused by the detection of microbarom signals.

47 OTHER INSTRUMENTATION↗

Generalization Across Experimental Parameters in Neural Network Analysis of High-Resolution Transmission Electron Microscopy Datasets

Neural networks are promising tools for high-throughput and accurate transmission electron microscopy (TEM) analysis of nanomaterials, but are known to generalize poorly on data that is “out-of-distribution” from their training data. Given the limited set of image features typically seen in high-resolution TEM imaging, it is unclear which images are considered out-of-distribution from others. Here, we investigate how the choice of metadata features in the training dataset influences neural network performance, focusing on the example task of nanoparticle segmentation. We train and validate neural networks across curated, experimentally collected high-resolution TEM image datasets of nanoparticles under various imaging and material parameters, including magnification, dosage, nanoparticle diameter, and nanoparticle material. Overall, we find that our neural networks are not robust across microscope parameters, but do generalize across certain sample parameters. Additionally, data preprocessing can have unintended consequences on neural network generalization. Our results highlight the need to understand how dataset features affect deployment of data-driven algorithms.

42 ENGINEERING↗

Detecting optical transients using artificial neural networks and reference images from different surveys

ABSTRACT We present a technique to detect optical transients based on an artificial neural networks method. We describe the architecture of two networks capable of comparing images of the same part of the sky taken by different telescopes. One image corresponds to the epoch in which a potential transient could exist; the other is a reference image of an earlier epoch. We use data obtained by the Dr. Cristina V. Torres Memorial Astronomical Observatory and archival reference images from the Sloan Digital Sky Survey. We trained a convolutional neural network and a dense layer network on simulated source samples and then tested the trained networks on samples created from real image data. Autonomous detection methods replace the standard process of detecting transients, which is normally achieved by source extraction of a difference image followed by human inspection of the detected candidates. Replacing the human inspection component with an entirely autonomous method would allow for a rapid and automatic follow-up of interesting targets of opportunity. The toy-model pipeline that we present here is not yet able to replace human inspection, but it might provide useful hints to identify potential candidates. The method will be further expanded and tested on telescopes participating in the Transient Optical Robotic Observatory of the South Collaboration.

79 ASTRONOMY AND ASTROPHYSICS↗

Photometric redshifts from SDSS images with an interpretable deep capsule network

ABSTRACT Studies of cosmology, galaxy evolution, and astronomical transients with current and next-generation wide-field imaging surveys like the Rubin Observatory Legacy Survey of Space and Time are all critically dependent on estimates of photometric redshifts. Capsule networks are a new type of neural network architecture that is better suited for identifying morphological features of the input images than traditional convolutional neural networks. We use a deep capsule network trained on ugriz images, spectroscopic redshifts, and Galaxy Zoo spiral/elliptical classifications of ∼400 000 Sloan Digital Sky Survey galaxies to do photometric redshift estimation. We achieve a photometric redshift prediction accuracy and a fraction of catastrophic outliers that are comparable to or better than current methods for SDSS main galaxy sample-like data sets (r ≤ 17.8 and zspec ≤ 0.4) while requiring less data and fewer trainable parameters. Furthermore, the decision-making of our capsule network is much more easily interpretable as capsules act as a low-dimensional encoding of the image. When the capsules are projected on a two-dimensional manifold, they form a single redshift sequence with the fraction of spirals in a region exhibiting a gradient roughly perpendicular to the redshift sequence. We perturb encodings of real galaxy images in this low-dimensional space to create synthetic galaxy images that demonstrate the image properties (e.g. size, orientation, and surface brightness) encoded by each dimension. We also measure correlations between galaxy properties (e.g. magnitudes, colours, and stellar mass) and each capsule dimension. We publicly release our code, estimated redshifts, and additional catalogues at https://biprateep.github.io/encapZulate-1.

79 ASTRONOMY AND ASTROPHYSICS↗

Alternating and Gaussian Fermionic Isometric Tensor Network States

Isometric tensor networks in two dimensions enable efficient and accurate study of quantum many-body states, yet the effect of the isometric restriction on the represented quantum states is not fully understood. We address this question in two main contributions. First, we introduce an improved variant of isometric tensor network states (isoTNS) in two dimensions, where the isometric arrows on the columns of the network alternate between pointing upward and downward; hence the name alternating isometric tensor network states. Second, we introduce a numerical tool—the isometric Gaussian fermionic TNS (isoGfTNS)—that incorporates isometric constraints into the framework of Gaussian fermionic tensor network states. We demonstrate in numerous ways that alternating isoTNSs represent many-body ground states of two-dimensional quantum systems significantly better than the original isoTNSs. First, we show that the entanglement in an isoTNS is mediated along the isometric arrows and that alternating isoTNSs mediate entanglement more efficiently than conventional isoTNSs. Second, alternating isoTNSs correspond to a deeper, and thus more representative, sequential-circuit construction of depth 𝒪⁢(𝐿𝑥 ⋅𝐿𝑦) compared to the original isoTNSs of depth 𝒪⁢(𝐿𝑥 +𝐿𝑦). Third, using the Gaussian framework and gradient-based energy minimization, we provide numerical evidence of better bond-dimension scaling and variational energy of alternating isoGfTNSs for ground states of various free-fermionic models, including the Fermi surface, the band insulator, and the 𝑝𝑥 +𝑖⁢𝑝𝑦 mean-field superconductor. Finally, benchmarking on the transverse-field Ising model, we demonstrate that an alternating isoTNS provides substantially improved performance and stability relative to the original isoTNS for the ground-state search algorithm in interacting systems.

Wu, Yantao [Chinese Academy of Sciences, Beijing (↗

Flow-Driven Stretch Fluctuations Govern the Nonlinear Viscoelasticity of Elongating Associative Polymer Networks

We use nonequilibrium molecular dynamics simulations to verify recent tube-model predictions that associative polymer networks exhibit broad stretch fluctuations during elongational flow. Simulations further show that these fluctuating dynamics give rise to the rate-dependent extensional viscosity 𝜂 𝐸 measured in filament stretching experiments on H-bonding networks. Simulations model bivalent associative networks with a reactive bead-spring model for varying association strength and extensional strain rate. We observe that stretch fluctuations are driven by a new form of chain tumbling, where chains continually collapse and elongate as their associations break and reform within the advecting network. This produces a broad, nearly uniform distribution of chain stretch over a wide range of strain rates, manifesting as a rate-independent plateau in the extensional stress. Our results show that the nonlinear viscoelasticity of associative networks is dominated by large fluctuations in molecular response, which cannot be captured by current mean-field models.

biomimetic & bio-inspired materials↗

Training toward significance with the decorrelated event classifier transformer neural network

Experimental particle physics uses machine learning for many tasks, where one application is to classify signal and background events. This classification can be used to bin an analysis region to enhance the expected significance for a mass resonance search. In natural language processing, one of the leading neural network architectures is the transformer. In this work, an event classifier transformer is proposed to bin an analysis region, in which the network is trained with special techniques. The techniques developed here can enhance the significance and reduce the correlation between the network’s output and the reconstructed mass. It is found that this trained network can perform better than boosted decision trees and feed-forward networks. Published by the American Physical Society 2024

Astronomy & Astrophysics↗

From ionic clusters dynamics to network constraints in ionic polymer solutions

Physical networks formed by ionizable polymers with ionic clusters as crosslinks are controlled by coupled dynamics that transcend from ionic clusters through chain motion to macroscopic response. Here, the coupled dynamics, across length scales, from the ionic clusters to the networks in toluene swollen polystyrene sulfonate networks, were directly correlated, as the electrostatic environment of the physical crosslinks was altered. The multiscale insight is attained by coupling neutron spin echo measurements with molecular dynamics simulations, carried out to times typical of relaxation of polymers in solutions. The experimental dynamic structure factor is in outstanding agreement with the one calculated from computer simulations, as the networks are perturbed by elevating the temperature and changing the electrostatic environment. In toluene, the long-lived clusters remain stable over hundreds of ns across a broad temperature range, while the polymer network remains dynamic. In conclusion, though the size of the clusters changes as the dielectric constant of the solvent is modified through the addition of ethanol, they remain stable but morph, enhancing the polymer chain dynamics.

36 MATERIALS SCIENCE↗

Structural transformation in Ge x S 100–x (10 ≤ x ≤ 40) network glasses: Structural varieties in short-range, medium-range, and nanoscopic scale

Precise x-ray diffraction measurements using high-energy x rays of synchrotron radiation and systematic Raman scattering measurements were carried out for Ge x S 100–x (10 ≤ x ≤ 40) network glasses. The structural models of the network glasses were proposed based on the results. In the stoichiometric composition Ge 33 S 67 , GeS 4 tetrahedral units are connected forming either corner-sharing or edge-sharing structures. In the S-rich glasses, S atoms are inserted between two neighboring GeS 4 tetrahedra, resulting in a flexible floppy network. In a much more S-rich region, some S 8 ring molecules are isolated from the network, and assemble to form a crystal in nanoscopic scale. In this respect, Ge 10 S 90 samples are regarded as crystallized glasses. In the Ge-rich region, the GeS 4 tetrahedra are connected with bridging Ge atoms. The connection makes a new rigid network. Furthermore, the bridging Ge-S bond is weaker than the intratetrahedron bond, and this leads to drastic changes in the optical properties.

36 MATERIALS SCIENCE↗

Optimal Network Reconfiguration and Scheduling With Hardware-in-the-Loop Validation for Improved Microgrid Resilience

With the increased occurrence of various major extreme weather events, power outages and prompt power system restorations have recently drawn more attention to the resilience and recovery of power systems. From the perspective of a more resilient power delivery at the distribution grid, system restoration using network topology reconfiguration together with optimal scheduling of distributed energy resources are adopted in this paper. The proposed optimization model aims at minimizing the total load shedding cost and other operational costs, in which linearized topological constraints borrowed from graph theory and linearized DistFlow models are respectively used to maintain the radial network topology and power flow balance after system contingencies. To demonstrate the applicability of the proposed strategy, a real-world case study of a networked three-microgrid system in Adjuntas, Puerto Rico, is used with the consideration of different independent/interconnected microgrid scenarios, contingencies, and fairness settings. Furthermore, hardware-in-the-loop testing is conducted for the same three-microgrid network, where the closely matched results with the simulated ones have validated the effectiveness of the proposed restoration strategy, which is now ready to move one step forward towards field deployment. Finally, to test the proposed restoration strategy in a larger networked system, the modified IEEE-33 bus test distribution system is considered, and the results show a more resilient power delivery for critical loads under three and four line outages.

24 POWER TRANSMISSION AND DISTRIBUTION↗