Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Automatic”

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 631 records · Page 35

AUTOMATIC DETECTION ALGORITHM OF DYNAMIC PRESSURE PULSES IN THE SOLAR WIND

Dynamic pressure pulses (DPPs) in the solar wind are a significant phenomenon closely related to the solar-terrestrial connection and physical processes of solar wind dynamics. In order to automatically identify DPPs from solar wind measurements, we develop a procedure with a three-step detection algorithm that is able to rapidly select DPPs from the plasma data stream and simultaneously define the transition region where large dynamic pressure variations occur and demarcate the upstream and downstream region by selecting the relatively quiet status before and after the abrupt change in dynamic pressure. To demonstrate the usefulness, efficiency, and accuracy of this procedure, we have applied it to the Wind observations from 1996 to 2008 by successfully obtaining the DPPs. The procedure can also be applied to other solar wind spacecraft observation data sets with different time resolutions.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Beam Path Analysis of Laser Wakefield Particle Acceleration Data

Numerical simulations of laser wakefield particle accelerators play a key role in the understanding of the complex acceleration process and in the design of expensive experimental facilities. As the size and complexity of simulation output grows, an increasingly acute challenge is the practical need for computational techniques that aid in scientific knowledge discovery. To that end, we present a set of data-understanding algorithms that work in concert in a pipeline fashion to automatically locate and analyze high energy particle bunches undergoing acceleration in very large simulation datasets. These techniques work cooperatively by first identifying features of interest in individual timesteps, then integrating features across timesteps, and based on the information derived perform analysis of temporally dynamic features. This combination of techniques supports accurate detection of particle beams enabling a deeper level of scientific understanding of physical phenomena than hasbeen possible before. By combining efficient data analysis algorithms and state-of-the-art data management we enable high-performance analysis of extremely large particle datasets in 3D. We demonstrate the usefulness of our methods for a variety of 2D and 3D datasets and discuss the performance of our analysis pipeline.

43 PARTICLE ACCELERATORS↗

Clusterdv: a simple density-based clustering method that is robust, general and automatic

Abstract Motivation How to partition a dataset into a set of distinct clusters is a ubiquitous and challenging problem. The fact that data vary widely in features such as cluster shape, cluster number, density distribution, background noise, outliers and degree of overlap, makes it difficult to find a single algorithm that can be broadly applied. One recent method, clusterdp, based on search of density peaks, can be applied successfully to cluster many kinds of data, but it is not fully automatic, and fails on some simple data distributions. Results We propose an alternative approach, clusterdv, which estimates density dips between points, and allows robust determination of cluster number and distribution across a wide range of data, without any manual parameter adjustment. We show that this method is able to solve a range of synthetic and experimental datasets, where the underlying structure is known, and identifies consistent and meaningful clusters in new behavioral data. Availability and implementation The clusterdv is implemented in Matlab. Its source code, together with example datasets are available on: https://github.com/jcbmarques/clusterdv. Supplementary information Supplementary data are available at Bioinformatics online.

Marques, João C.↗

Automatic extraction of cancer registry reportable information from free-text pathology reports using multitask convolutional neural networks

Objective: In this work we implement 2 different multitask learning (MTL) techniques, hard parameter sharing and cross-stitch, to train a word-level convolutional neural network (CNN) specifically designed for automatic extraction of cancer data from unstructured text in pathology reports. We show the importance of learning related information extraction (IE) tasks leveraging shared representations across the tasks to achieve state-of-the-art performance in classification accuracy and computational efficiency. Materials and Methods: Multitask CNN (MTCNN) attempts to tackle document information extraction by learning to extract multiple key cancer characteristics simultaneously. We trained our MTCNN to perform 5 information extraction tasks: (1) primary cancer site (65 classes), (2) laterality (4 classes), (3) behavior (3 classes), (4) histological type (63 classes), and (5) histological grade (5 classes). We evaluated the performance on a corpus of 95 231 pathology documents (71 223 unique tumors) obtained from the Louisiana Tumor Registry. We compared the performance of the MTCNN models against single-task CNN models and 2 traditional machine learning approaches, namely support vector machine (SVM) and random forest classifier (RFC). Results: MTCNNs offered superior performance across all 5 tasks in terms of classification accuracy as compared with the other machine learning models. Based on retrospective evaluation, the hard parameter sharing and cross-stitch MTCNN models correctly classified 59.04% and 57.93% of the pathology reports respectively across all 5 tasks. The baseline models achieved 53.68% (CNN), 46.37% (RFC), and 36.75% (SVM). Based on prospective evaluation, the percentages of correctly classified cases across the 5 tasks were 60.11% (hard parameter sharing), 58.13% (cross-stitch), 51.30% (single-task CNN), 42.07% (RFC), and 35.16% (SVM). Moreover, hard parameter sharing MTCNNs outperformed the other models in computational efficiency by using about the same number of trainable parameters as a single-task CNN. Conclusions: The hard parameter sharing MTCNN offers superior classification accuracy for automated coding support of pathology documents across a wide range of cancers and multiple information extraction tasks while maintaining similar training and inference time as those of a single task–specific model.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Automatic information extraction from childhood cancer pathology reports

The International Classification of Childhood Cancer (ICCC) facilitates the effective classification of a heterogeneous group of cancers in the important pediatric population. However, there has been no development of machine learning models for the ICCC classification. We developed deep learning-based information extraction models from cancer pathology reports based on the ICD-O-3 coding standard. In this article, we describe extending the models to perform ICCC classification. We developed 2 models, ICD-O-3 classification and ICCC recoding (Model 1) and direct ICCC classification (Model 2), and 4 scenarios subject to the training sample size. We evaluated these models with a corpus consisting of 29206 reports with age at diagnosis between 0 and 19 from 6 state cancer registries. Our findings suggest that the direct ICCC classification (Model 2) is substantially better than reusing the ICD-O-3 classification model (Model 1). Applying the uncertainty quantification mechanism to assess the confidence of the algorithm in assigning a code demonstrated that the model achieved a micro-F1 score of 0.987 while abstaining (not sufficiently confident to assign a code) on only 14.8% of ambiguous pathology reports. Our experimental results suggest that the machine learning-based automatic information extraction from childhood cancer pathology reports in the ICCC is a reliable means of supplementing human annotators at state cancer registries by reading and abstracting the majority of the childhood cancer pathology reports accurately and reliably.

60 APPLIED LIFE SCIENCES↗

Automatic detection of low surface brightness galaxies from Sloan Digital Sky Survey images

ABSTRACT Low surface brightness (LSB) galaxies are galaxies with central surface brightness fainter than the night sky. Due to the faint nature of LSB galaxies and the comparable sky background, it is difficult to search LSB galaxies automatically and efficiently from large sky survey. In this study, we established the low surface brightness galaxies autodetect (LSBG-AD) model, which is a data-driven model for end-to-end detection of LSB galaxies from Sloan Digital Sky Survey (SDSS) images. Object-detection techniques based on deep learning are applied to the SDSS field images to identify LSB galaxies and estimate their coordinates at the same time. Applying LSBG-AD to 1120 SDSS images, we detected 1197 LSB galaxy candidates, of which 1081 samples are already known and 116 samples are newly found candidates. The B-band central surface brightness of the candidates searched by the model ranges from 22 to 24 mag arcsec−2, quite consistent with the surface brightness distribution of the standard sample. A total of 96.46 per cent of LSB galaxy candidates have an axial ratio (b/a) greater than 0.3, and 92.04 per cent of them have $fracDev\_r$ < 0.4, which is also consistent with the standard sample. The results show that the LSBG-AD model learns the features of LSB galaxies of the training samples well, and can be used to search LSB galaxies without using photometric parameters. Next, this method will be used to develop efficient algorithms to detect LSB galaxies from massive images of the next-generation observatories.

79 ASTRONOMY AND ASTROPHYSICS↗

Automatic Kalman-filter-based wavelet shrinkage denoising of 1D stellar spectra

We propose a non-parametric method to denoise 1D stellar spectra based on wavelet shrinkage followed by adaptive Kalman thresholding. Wavelet shrinkage denoising involves applying the discrete wavelet transform (DWT) to the input signal, ‘shrinking’ certain frequency components in the transform domain, and then applying inverse DWT to the reduced components. The performance of this procedure is influenced by the choice of base wavelet, the number of decomposition levels, and the thresholding function. Typically, these parameters are chosen by ‘trial and error’, which can be strongly dependent on the properties of the data being denoised. We here introduce an adaptive Kalman-filter-based thresholding method that eliminates the need for choosing the number of decomposition levels. We use the ‘Haar’ wavelet basis, which we found to provide excellent filtering for 1D stellar spectra, at a low computational cost. We introduce various levels of Poisson noise into synthetic PHOENIX spectra, and test the performance of several common denoising methods against our own. It proves superior in terms of noise suppression and peak shape preservation. Finally, we expect it may also be of use in automatically and accurately filtering low signal-to-noise galaxy and quasar spectra obtained from surveys such as SDSS, Gaia, LSST, PESSTO, VANDELS, LEGA-C, and DESI.

79 ASTRONOMY AND ASTROPHYSICS↗

Reconstructing the neutron star equation of state from observational data via automatic differentiation

Neutron star observables like masses, radii, and tidal deformability are direct probes to the dense matter equation of state (EoS). Here, a novel deep learning method that optimizes an EoS in the automatic differentiation framework of solving inverse problems is presented. The trained neural network EoS yields narrow bands for the relationship between the pressure and speed of sound as a function of the mass density. The results are consistent with those obtained from conventional approaches and the observational bound on the tidal deformability inferred from the gravitational wave event, GW170817.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Automatized full one-loop renormalization of the MSSM: The Higgs sector, the issue of tan{beta} and gauge invariance

We give an extensive description of the renormalization of the Higgs sector of the minimal supersymmetric model in sloops. sloops is an automatized code for the computation of one-loop processes in the MSSM. In this paper, the first in a series, we study in detail the nongauge invariance of some definitions of tan{beta}. We rely on a general nonlinear gauge-fixing constraint to make the gauge parameter dependence of different schemes for tan{beta} explicit at one loop. In so doing, we update, within these general gauges, an important Ward-Slavnov-Taylor identity on the mixing between the pseudoscalar Higgs, A{sup 0}, and Z{sup 0}. We then compare the tan{beta} scheme dependence of a few observables. We find that the best tan{beta} scheme is the one based on the decay A{sup 0}{yields}{tau}{sup +}{tau}{sup -} because of its gauge invariance, because it is unambiguously defined from a physical observable, and because it is numerically stable. The oft used DR scheme performs almost as well on the last count, but is usually defined from nongauge-invariant quantities in the Higgs sector. The use of the heavier scalar Higgs mass in lieu of tan{beta}, though related to a physical parameter, induces radiative corrections that are too large in many instances, and is therefore not recommended.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Machine learning of consistent thermodynamic models using automatic differentiation

In this study, we propose a data-driven method to describe consistent equations of state (EOS) for arbitrary systems. Complex EOS are traditionally obtained by fitting suitable analytical expressions to thermophysical data. A key aspect of EOS is that the relationships between state variables are given by derivatives of the system free energy. In this work, we model the free energy with an artificial neural network and utilize automatic differentiation to directly learn the derivatives of the free energy. We demonstrate this approach on two different systems, the analytic van der Waals EOS and published data for the Lennard-Jones fluid, and we show that it is advantageous over direct learning of thermodynamic properties (i.e., not as derivatives of the free energy but as independent properties), in terms of both accuracy and the exact preservation of the Maxwell relations. Furthermore, the method implicitly provides the free energy of a system without explicit integration.

75 CONDENSED MATTER PHYSICS, SUPERCONDUCTIVITY AND↗

Automatic multiple-zone rigid-body refinement with a large convergence radius

Rigid-body refinement is the constrained coordinate refinement of one or more groups of atoms that each move (rotate and translate) as a single body. The goal of this work was to establish an automatic procedure for rigid-body refinement which implements a practical compromise between runtime requirements and convergence radius. This has been achieved by analysis of a large number of trial refinements for 12 classes of random rigid-body displacements (that differ in magnitude of introduced errors), using both least-squares and maximum-likelihood target functions. The results of these tests led to a multiple-zone protocol. The final parameterization of this protocol was optimized empirically on the basis of a second large set of test refinements. This multiple-zone protocol is implemented as part of the phenix.refine program.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Automatic 3D image registration for nano-resolution chemical mapping using synchrotron spectro-tomography

Nano-resolution synchrotron X-ray spectro-tomography has been demonstrated as a powerful tool for probing the three-dimensional (3D) structural and chemical heterogeneity of a sample. By reconstructing a number of tomographic data sets recorded at different X-ray energy levels, the energy-dependent intensity variation in every given voxel fingerprints the corresponding local chemistry. The resolution and accuracy of this method, however, could be jeopardized by non-ideal experimental conditions, e.g. instability in the hardware system and/or in the sample itself. Herein is presented one such case, in which unanticipated sample deformation severely degrades the data quality. Here, to address this issue, an automatic 3D image registration method is implemented to evaluate and correct this effect. The method allows the redox heterogeneity in partially delithiated Li x Ta 0.3 Mn 0.4 O 2 battery cathode particles to be revealed with significantly improved fidelity.

3D image registration↗

Iterative Bragg peak removal on X-ray absorption spectra with automatic intensity correction

This study introduces a novel iterative Bragg peak removal with automatic intensity correction (IBR-AIC) methodology for X-ray absorption spectroscopy (XAS), specifically addressing the challenge of Bragg peak interference in the analysis of crystalline materials. The approach integrates experimental adjustments and sophisticated post-processing, including an iterative algorithm for robust calculation of the scaling factor of the absorption coefficients and efficient elimination of the Bragg peaks, a common obstacle in accurately interpreting XAS data, particularly in crystalline samples. The method was thoroughly evaluated on dilute catalysts and thin films, with fluorescence mode and large-angle rotation. The results underscore the technique's effectiveness, adaptability and substantial potential in improving the precision of XAS data analysis. While demonstrating significant promise, the method does have limitations related to signal-to-noise ratio sensitivity and the necessity for meticulous angle selection during experimentation. Overall, IBR-AIC represents a significant advancement in XAS, offering a pragmatic solution to Bragg peak contamination challenges, thereby expanding the applications of XAS in understanding complex materials under diverse experimental conditions.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

A new MR-SAD algorithm for the automatic building of protein models from low-resolution X-ray data and a poor starting model

Determining macromolecular structures from X-ray data with resolution worse than 3Å remains a challenge. Even if a related starting model is available, its incompleteness or its bias together with a low observation-to-parameter ratio can render the process unsuccessful or very time-consuming. Yet, many biologically important macromolecules, especially large macromolecular assemblies, membrane proteins and receptors, tend to provide crystals that diffract to low resolution. A new algorithm to tackle this problem is presented that uses a multivariate function to simultaneously exploit information from both an initial partial model and low-resolution single-wavelength anomalous diffraction data. The new approach has been used for six challenging structure determinations, including the crystal structures of membrane proteins and macromolecular complexes that have evaded experts using other methods, and large structures from a 3.0 Å resolution F1-ATPase data set an a 4.5Å resolution SecYEG–SecA complex data set. All of the models were automatically built by the method to Rfree values of between 28.9 and 39.9% and were free from the initial model bias.

37 INORGANIC, ORGANIC, PHYSICAL, AND ANALYTICAL CH↗

Distributed Automatic Load-Frequency Control with Optimality in Power Systems

With the increasing penetration of renewable energy resources, power systems face new challenges in balancing power supply and demand and maintaining the nominal frequency. This paper studies load control to handle these challenges. In particular, a fully distributed automatic load control algorithm, which only needs local measurement and local communication, is proposed. We prove that the control algorithm globally converges to an optimal operating point which minimizes the total disutility of users, restores the nominal frequency and the scheduled tie-line power flows, and respects the thermal constraints of transmission lines. It is also shown that the convergence still holds even when inaccurate system parameters are used in the control algorithm. Lastly, the effectiveness, optimality, and robustness of the proposed algorithm are demonstrated via numerical simulations.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Deep Learning-Based Data Forgery Detection in Automatic Generation Control

Automatic Generation Control (AGC) is a key control system in the power grid. It is used to calculate the Area Control Error (ACE) based on frequency and tie-line power flow between balancing areas, and then adjust power generation to maintain the power system frequency in an acceptable range. However, attackers might inject malicious frequency or tie-line power flow measurements to mislead AGC to do false generation correction which will harm the power grid operation. Such attacks are hard to be detected since they do not violate physical power system models. In this work, we propose algorithms based on Neural Network and Fourier Transform to detect data forgery attacks in AGC. Different from the few previous work that rely on accurate load prediction to detect data forgery, our solution only uses the ACE data already available in existing AGC systems. In particular, our solution learns the normal patterns of ACE time series and detects abnormal patterns caused by artificial attacks. Evaluations on the real ACE dataset show that our methods have high detection accuracy.

32 ENERGY CONSERVATION, CONSUMPTION, AND UTILIZATI↗

ScienceSearch: Enabling Search through Automatic Metadata Generation

© 2018 IEEE. Scientific facilities are increasingly generating and handling large amounts of data from experiments and simulations. Next-generation scientific discoveries rely on insights derived from data, especially across domain boundaries. Search capabilities are critical to enable scientists to discover datasets of interest. However, scientific datasets often lack the signals or metadata required for effective searches. Thus, we need formalized methods and systems to automatically annotate scientific datasets from the data and its surrounding context. Additionally, a search infrastructure needs to account for the scale and rate of application data volumes. In this paper, we present ScienceSearch, a system infrastructure that uses machine learning techniques to capture and learn the knowledge, context, and surrounding artifacts from data to generate metadata and enable search. Our current implementation is focused on a dataset from the National Center for Electron Microscopy (NCEM), an electron microscopy facility at Lawrence Berkeley National Laboratory sponsored by the Department of Energy which supports hundreds of users and stores millions of micrographs. In this paper, we describe a) our search infrastructure and model, b) methods for generating metadata using machine learning techniques, and c) optimizations to improve search latency, and deployment on an HPC system. We demonstrate that ScienceSearch is capable of producing valid metadata for NCEM's dataset and providing low-latency good quality search results over a scientific dataset.

Rodrigo, Gonzalo P.↗

Towards Automatically Matching Security Advisories to CPEs: String Similarity-based Vendor Matching

When a vulnerability is reported by the National Vulnerability Database (NVD), affected products are listed in the structured Common Platform Enumeration (CPE) format. Unfortunately, if the vulnerability is in a software library (e.g., Log4j), it will not include CPEs for each product containing that library. In these cases, security operators need to manually read the vendor's or third-party security advisories to see if their product is affected. However, these advisories do not report affected products in a structured format, which prevents automated processing, This paper makes the first effort towards automatically constructing structured CPEs for the vulnerable products in a non-NVD security advisory from the unstructured data in the advisory. Since this is a very challenging problem, this paper specifically focuses on the initial but key step of matching the un-structured vendor names in security advisories to the structured vendor representations in the standard CPE format. We explore the feasibility of using string similarity to solve the problem. The basic idea is to compare a vendor name from the non-NVD advisory with each vendor in the official CPE dictionary. The CPE vendor with the highest similarity score to the advisory's vendor will be considered as the match. We first conduct an experimental, comparative study of multiple mainstream string similarity metrics for this matching problem. To improve the performance, we then design a new string similarity metric that is adapted from an existing metric by weighing different tokens in the advisory's vendor name differently.

McClanahan, Kylie↗