Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithm selection”

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,171 records · Page 65

Performance Comparison of Machine Learning Models for Ultrasonic Nondestructive Evaluation of Alkali-Silica Reaction in Concrete

Alkali-silica reaction (ASR) causes concrete degradation, leading to cracking, rebar corrosion, and reduced structural integrity, which raises safety concerns. Ultrasonic nondestructive evaluation (NDE) effectively assesses concrete properties and monitors ASR progression. However, its deployment and analysis require specialized expertise and subjective interpretation. As computational power increases, artificial intelligence (AI) and machine learning (ML) algorithms are increasingly being used to automate NDE data analysis across various industries for AI-assisted automation. Regulatory agencies are adapting to this technological shift, prompting a need to evaluate current ML technologies’ capabilities and limitations in assessing concrete material properties and damage. This report presents a comparative analysis of four ML regression models for predicting concrete material damage induced by ASR expansion using long-term ultrasonic data monitoring. The models investigated include linear regression (LR), support vector regression (SVR), shallow neural networks (NN), and deep neural networks (DNN). LR, SVR, and shallow NN models use features extracted from ultrasonic signals, whereas the DNN model processes time-domain ultrasonic signals and frequency spectra directly. The study systematically compared the models’ performance from various perspectives, including model input, prediction performance, and generalization ability. The findings indicate significant variability in model performance, with some ML algorithms achieving very high or very low prediction accuracy depending on the preprocessing and feature engineering (extraction and selection) applied. Key insights include the observation that shallow ML models (LR, SVR, and shallow NNs) require meticulous preprocessing and feature extraction to achieve high accuracy. In contrast, the DNN model, although it bypasses the need for feature engineering, necessitates extensive preprocessing to mitigate noise and computational demands. The SVR model emerged as the top performer among the shallow models, and the DNN model exhibited superior performance on specific datasets but struggled with generalization across specimens from different batches. Additionally, the SVR model is sensitive to temperature variations, whereas the DNN model is robust in this regard. Using recurrent neural networks is recommended for future ASR expansion prediction studies. Recurrent neural networks’ inherent ability to capture temporal dependencies and long-term patterns makes them well suited for analyzing sequential ultrasonic monitoring data. Overall, the results and conclusions of this study could provide insights into the capabilities and effectiveness of ML when applied to ultrasonic NDE data and help identify best practices for using ML for ultrasonic NDE of concrete material properties.

36 MATERIALS SCIENCE↗

Optimization Through Multi-Fidelity Modeling

We present a novel method for optimizing parameter selection for simulations with an evaluation budget. We start with an existing method for building a multi-fidelity model out of many low-fidelity simulations and few high-fidelity simulations. We propose a novel method to simplify parameter selection without sacrificing performance. We verify these results and compare with existing literature. Next, we propose a novel algorithm which uses this difference model to suggest new points in the parameter design space to simulate. We add each point we simulate to the model to improve its quality for the next iteration. The algorithm trades off reducing the uncertainty of the existing model with optimization of the objective. The first is more useful when a large fraction of the computation budget remains. The second is more useful when a small fraction of the computation budget remains. Our method converges to the optimum by using a high-fidelity evaluation for just 16 of the 427 points. Our method is general enough to work if there is no low-fidelity model. Furthermore, it is agnostic to the underlying physics of the problem. Therefore, both the low-fidelity and high-fidelity models can be generated by any arbitrary function, including simulations and physical experiments.

97 MATHEMATICS AND COMPUTING↗

Automated shaker placement and regularized input estimation for MIMO testing.

Multi-input, multi-output (MIMO) testing is used in component qualification to reproduce operational responses in the laboratory. It is often preferred to single-input and base-shake testing because of the potential for equivalent or better tests using smaller actuators and shorter test suites. Given a target response, two key steps in MIMO test design are selecting actuator locations and solving for input loads. Actuator locations are often manually selected using expert judgment. If an automatic method is used, locations are usually determined by simulating the vibration control problem and minimizing a combination of the input energy and control residuals. To select a configuration, the relative importance of input energy and residuals must be specified. Specifying relative weights is, in general, a manual and subjective process. This paper develops an objective function that compares actuator configurations based on control accuracy and required input energy without any manual parameter tuning. The objective function uses an optimally selected tradeoff parameter for each candidate configuration. To choose actuator locations using the new objective function, a pivoting algorithm for integer programming problems is developed. Starting with an initial configuration (such as the one generated by a greedy algorithm), the pivoting algorithm guarantees an objective function decrease in each iteration until convergence is reached. In a simulation featuring a structure excited by a diffuse acoustic field, electrodynamic shaker locations and regularized inputs are solved for without any analyst-specified parameters. Simulations are performed in MIMO configurations where the number of target responses is less than, equal to, and greater than the number of actuators.

Multi-input multi-output↗

Nondestructive Evaluation of Thick Concrete Structures

Materials issues are a key concern for the existing nuclear reactor fleet in the United States as material degradation can lead to increased maintenance, increased downtime, and increased risk. Extending reactor life to 60 years and beyond will likely increase susceptibility and severity of both known and new forms of degradation. A multitude of concrete-based structures are typically part of a light water reactor plant to provide foundation, support, shielding, and containment functions. The size and complexity of nuclear power plant containment structures and the heterogeneity of Portland cement concrete make characterization of the degradation extent a difficult task. This paper examines the benefits of using time-frequency analysis with Synthetic Aperture Focusing Technique (SAFT). By using wavelet packet decomposition, the original ultrasound signals are decomposed into various frequency bands that facilitates highly selective analysis of the signal’s frequency content and can be visualized using the familiar SAFT image reconstruction algorithm.

21 SPECIFIC NUCLEAR REACTORS AND ASSOCIATED PLANTS↗

Orbital Advection with Magnetohydrodynamics and Vector Potential

Orbital advection is a significant bottleneck in disk simulations, and a particularly tricky one when used in connection with magnetohydrodynamics. We have developed an orbital advection algorithm suitable for the induction equation with magnetic potential. The electromotive force is split into advection and shear terms, and we find that we do not need an advective gauge since solving the orbital advection implicitly precludes the shear term from canceling the advection term. We prove and demonstrate the third order in time accuracy of the scheme. The algorithm is also suited to non-magnetic problems. Benchmarked results of (hydrodynamical) planet–disk interaction and of the magnetorotational instability are reproduced. We include detailed descriptions of the construction and selection of stabilizing dissipations (or high-frequency filters) needed to generate practical results. The scheme is self-consistent, accurate, and elegant in its simplicity, making it particularly efficient for straightforward finite-difference methods. As a result of the work, the algorithm is incorporated in the public version of the Pencil Code, where it can be used by the community.

79 ASTRONOMY AND ASTROPHYSICS↗

Reproducibility and Variability of I/O Performance on BG/Q: Lessons Learned from a Data Aggregation Algorithm

Reading and writing data efficiently from different tiers of storage is necessary for most scientific simulations to achieve good performance at scale. Many software solutions have been developed to decrease the I/O bottleneck. One wellknown strategy, in the context of collective I/O operations, is the two-phase I/O scheme. This strategy consists of selecting a subset of processes to aggregate contiguous pieces of data before performing reads/writes. In our previous work, we implemented the two-phase I/O scheme with a MPI-based topology-aware algorithm. Our algorithm showed very good performance at scale compared to the standard I/O libraries such as POSIX I/O and MPI I/O. However, the algorithm had several limitations hindering a satisfying reproducibility of our experiments. In this paper, we extend our work by 1) identifying the obstacles we face to reproduce our experiments and 2) discovering solutions that reduce the unpredictability of our results.

97 MATHEMATICS AND COMPUTING↗

Genetic algorithm optimization of nuclear criticality experiment for reduction of intermediate-energy 239 Pu nuclear data uncertainties

Nuclear criticality experiments are conducted to investigate specific nuclear data important for safe handling and storage of fissile materials, reactor design and operation, and the validation of radiation transport codes. Incorrect or uncertain nuclear data can prohibitively impact operational safety limits, reactor licensing, and predictive simulation capability; therefore, integral measurements from criticality experiments are necessary and should be performed frequently. To maximize the impact of the integral measurements, it is important to consider experiment geometry, material selection, and component dimensions. When taking these considerations into account, the experiment design process becomes iterative and very time intensive. This work utilizes a genetic algorithm to efficiently explore potential nuclear criticality experiment designs for the Laboratory Directed Research & Development project PARADIGM (PARallel Approach of Differential and InteGral Measurements) at Los Alamos National Laboratory. In this paper, the building blocks of the genetic algorithm are discussed in detail, the genetic algorithm methodology is verified, and the genetic algorithm is used to produce three candidate experiment models for the final PARADIGM design. The three candidate models produced by the genetic algorithm consist of copper-reflected assemblies containing 14 repeating units of alumina, graphite, boron, and plutonium plates. Furthermore, in addition to the optimization results, final design considerations are also discussed for designs with a height and/or weight very close to or slightly above assembly machine operational limits.

22 GENERAL STUDIES OF NUCLEAR REACTORS↗

Estimation of Tropical Cyclone Intensity in the North Atlantic and Northeastern Pacific Basins Using TRMM Satellite Passive Microwave Observations

Here, a statistical passive microwave intensity estimation (PMW-IE) algorithm for estimating the intensity of tropical cyclones (TCs) in the North Atlantic and northeastern and central Pacific basins is developed and tested. The algorithm is derived from Tropical Rainfall Measuring Mission (TRMM) Microwave Imager (TMI) 85-GHz brightness temperatures and near-surface rain-rate retrievals to provide objective estimates of current maximum sustained surface winds (Vmax) and 6-h future Vmax of TCs. The full record of TRMM data (1998–2013) including 2326 TMI overpasses of 503 TCs is separated into dependent samples (1998–2010) for model development and independent samples (2011–13) for model verification. The best track intensities are used as dependent variables in a stepwise multiple-regression approach. Separately for each basin, three regression models are derived using selected 1) 85-GHz-only variables, 2) rain-rate-only variables, and 3) combined 85-GHz and rain variables. The algorithms are assessed using independent samples and those with contemporaneous aircraft-reconnaissance measurements. Rain-only and combined models perform better than the 85-GHz-only model. Lower errors are found for estimating the 6-h future Vmax than estimating the current Vmax using all three models. This implies that it is optimal to use passive-microwave-retrieved rain variables observed a few hours earlier to estimate TC intensity. The MAE (RMSE) of 6-h future Vmax is 9 (12) kt (1 kt ≈ 0.51 m s -1 ) when testing the combined models with ATL and EPA independent samples. Aircraft-reconnaissance-based independent samples yields a MAE of 9.6 kt and RMSE of 12.6 kt for estimating 6-h future Vmax.

58 GEOSCIENCES↗

Searching for the Optimal Working Point of the MEIC at JLab Using an Evolutionary Algorithm

The Medium-energy Electron Ion Collider (MEIC), a proposed medium-energy ring-ring electron-ion collider based on CEBAF at Jefferson Lab. The collider luminosity and stability are sensitive to the choice of a working point - the betatron and synchrotron tunes of the two colliding beams. Therefore, a careful selection of the working point is essential for stable operation of the collider, as well as for achieving high luminosity. Here we describe a novel approach for locating an optimal working point based on evolutionary algorithm techniques.

43 PARTICLE ACCELERATORS↗

SmartApps: Middle-ware for Adaptive Applications on Reconfigurable Platforms

There are several reasons why the performance of current distributed and heterogeneous systems is often disappointing. For example, the characteristics of the application may be input sensitive and evolve during execution causing dramatic changes in memory reference patterns, resource requirements, or degree of concurrency between different phases of the computation. Or, the system may change dynamically with nodes failing or appearing, some network links severed and other links established with different latencies and bandwidths. Another important reason for poor performance is the fairly compartmentalized approach to optimization: applications, compilers, operating systems and hardware configurations are designed and optimized in isolation and without the knowledge of instance specific information and needs of a running application. There is too little information flow across these boundaries and no global optimization is even attempted. For example, most operating systems services like paging, virtual-to-physical page mapping, I/O, or data layout in disks, provide little or no application customization. Similarly, the off-the-shelf hardware used by most commercial systems is optimized to give best average-case performance. To address this problem, we have proposed application-centric computing, or Smart Applications (SAS). In the SAS executable, the compiler embeds most run-time system services, and a performance-optimizing feedback loop that monitors the application's performance and adaptively reconfigures the application and the OS/system platform. At run-time, after incorporating the code's input and determining the system's resources and state, the SAS performs an *instance* specific optimization, which is more tractable than a global generic optimization between application, OS and system. The overriding philosophy of SAS is ``measure, compare, and adapt if beneficial.'' That is, the application will continually monitor its performance and the available resources to determine if, and by how much, performance could be improved if the application was restructured. Then, if the potential performance benefit outweighs the projected overhead costs, the application will restructure itself and the underlying system accordingly. The SAS framework includes performance monitoring and modeling components and mechanisms for performing the actual restructuring at various levels including: (i) algorithmic adaptation, (ii) run-time software optimization (e.g., input sensitivity analysis, etc.), (iii) tuning reconfigurable OS services (scheduling policy, page size, etc), and (iv) system configuration (e.g., selecting which, and how many, computational resources to use). SmartApps is being developed in the STAPL infrastructure. STAPL (the Standard Template Adaptive Parallel Library) is a framework for developing highly-optimizable, adaptable, and portable parallel and distributed applications. It consists of a relatively new and still evolving collection of generic parallel algorithms and distributed containers and a run-time system (RTS) through which the application and compiler interact with the OS and hardware.

97 MATHEMATICS AND COMPUTING↗

Search for collective phenomena in hadron interactions

New results of the search for collective phenomena have been obtained and analyzed in the present report. The experimental studies are carried out on U-70 accelerator of IHEP in Protvino. It is suggested that these phenomena can be discovered at the energy range of 50-70 GeV in the extreme multiplicity region since the high-density matter can form in this very region. The collective behavior of secondary particles is considered to manifest itself in the Bose-Einstein condensation of pions, Vavilov-Cherenkov gluon radiation, excess of soft-photon yield, and other unique phenomena. The perceptible peak in the angular distribution has been revealed. It was interpreted as the gluon radiation and so the parton matter refraction index was determined. The new software was designed for the track reconstruction based on Kalman Filter technique. This algorithm allows one to estimate more precisely the track parameters (especially momentum). The search for Bose-Einstein condensation can be continued by using the selected events with the multiplicity of more than eight charged particles. The gluon dominance model predictions have shown good agreement with the multiplicity distribution at high multiplicity and confirmed the guark-gluon medium formation under these conditions.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

SU-D-201-06: Random Walk Algorithm Seed Localization Parameters in Lung Positron Emission Tomography (PET) Images

Purpose: The objective of this study was to find the best seed localization parameters in random walk algorithm application to lung tumor delineation in Positron Emission Tomography (PET) images. Methods: PET images suffer from statistical noise and therefore tumor delineation in these images is a challenging task. Random walk algorithm, a graph based image segmentation technique, has reliable image noise robustness. Also its fast computation and fast editing characteristics make it powerful for clinical purposes. We implemented the random walk algorithm using MATLAB codes. The validation and verification of the algorithm have been done by 4D-NCAT phantom with spherical lung lesions in different diameters from 20 to 90 mm (with incremental steps of 10 mm) and different tumor to background ratios of 4:1 and 8:1. STIR (Software for Tomographic Image Reconstruction) has been applied to reconstruct the phantom PET images with different pixel sizes of 2×2×2 and 4×4×4 mm{sup 3}. For seed localization, we selected pixels with different maximum Standardized Uptake Value (SUVmax) percentages, at least (70%, 80%, 90% and 100%) SUVmax for foreground seeds and up to (20% to 55%, 5% increment) SUVmax for background seeds. Also, for investigation of algorithm performance on clinical data, 19 patients with lung tumor were studied. The resulted contours from algorithm have been compared with nuclear medicine expert manual contouring as ground truth. Results: Phantom and clinical lesion segmentation have shown that the best segmentation results obtained by selecting the pixels with at least 70% SUVmax as foreground seeds and pixels up to 30% SUVmax as background seeds respectively. The mean Dice Similarity Coefficient of 94% ± 5% (83% ± 6%) and mean Hausdorff Distance of 1 (2) pixels have been obtained for phantom (clinical) study. Conclusion: The accurate results of random walk algorithm in PET image segmentation assure its application for radiation treatment planning and diagnosis.

60 APPLIED LIFE SCIENCES↗

Selection and Assessment of Phenomenological Models of Tumor Growth

We address general approaches to the rational selection and validation of mathematical and computational models of tumor growth using methods of Bayesian inference. The model classes are derived from a general diffuse-interface, continuum mixture theory and focus on mass conservation of mixtures with up to four species. Synthetic data are generated using higher-order base models. We discuss general approaches to model calibration, validation, plausibility, and selection based on Bayesian-based methods, information theory, and maximum information entropy. We also address computational issues and provide numerical experiments based on Markov chain Monte Carlo algorithms and high performance computing implementations.

59 BASIC BIOLOGICAL SCIENCES↗

Two-Step Hyperparameter Optimization Method: Accelerating Hyperparameter Search by Using a Fraction of a Training Dataset

Abstract Hyperparameter optimization (HPO) is an important step in machine learning (ML) model development, but common practices are archaic—primarily relying on manual or grid searches. This is partly because adopting advanced HPO algorithms introduces added complexity to the workflow, leading to longer computation times. This poses a notable challenge to ML applications, as suboptimal hyperparameter selections curtail the potential of ML model performance, ultimately obstructing the full exploitation of ML techniques. In this article, we present a two-step HPO method as a strategic solution to curbing computational demands and wait times, gleaned from practical experiences in applied ML parameterization work. The initial phase involves a preliminary evaluation of hyperparameters on a small subset of the training dataset, followed by a reevaluation of the top-performing candidate models postretraining with the entire training dataset. This two-step HPO method is universally applicable across HPO search algorithms, and we argue it has attractive efficiency gains. As a case study, we present our recent application of the two-step HPO method to the development of neural network emulators for aerosol activation. Although our primary use case is a data-rich limit with many millions of samples, we also find that using up to 0.0025% of the data—a few thousand samples—in the initial step is sufficient to find optimal hyperparameter configurations from much more extensive sampling, achieving up to 135× speedup. The benefits of this method materialize through an assessment of hyperparameters and model performance, revealing the minimal model complexity required to achieve the best performance. The assortment of top-performing models harvested from the HPO process allows us to choose a high-performing model with a low inference cost for efficient use in global climate models (GCMs).

97 MATHEMATICS AND COMPUTING↗

Considerations for using Privacy Preserving Machine Learning Techniques for Safeguards

In international nuclear safeguards, the International Atomic Energy Agency (IAEA) is tasked with inspecting and verifying nuclear facilities and their activities. Data analytics and machine learning to support inspections require large amounts of data that nuclear facility operators may consider proprietary or sensitive, so the IAEA may not have full access. Allowing computation over private data without compromising its security therefore has value for safeguards inspections and analysis. Privacy-preserving machine learning (PPML) consists of security-focused techniques that allow data analytics and machine learning algorithms to run on sensitive data without revealing it. This includes ideas like homomorphic encryption (HE), secure multiparty computation (SMPC), and secure enclaves. HE allows algorithms and mathematical operations to be conducted directly on the encrypted data instead of first decrypting it. With SMPC, multiple entities collaboratively compute over distributed data such that no party is able to directly view any others’ original data. Secure enclaves allow computation to take place in a separate and heavily blocked-off section of a CPU. Techniques like these allow for several potential use cases in which the security of data is essential. With SMPC, machine learning models can be trained over the input data from multiple entities, resulting in a model that all users can benefit from without leaking the input data from any particular entity. With SMPC or a zero-knowledge proof (ZKP), an algorithm returning some single answer or truth value can be run on someone else’s data without ever needing to see that data, potentially allowing for verification or proof of some underlying question. HE can allow for outsourcing computation on data to a hostile or untrusted environment. Although most of the research in this field resides within the health and financial domains, tools from PPML may have similar applications in nuclear safeguards. Allowing the IAEA to compute over proprietary information, such as process models and raw sensor data using PPML techniques, provides the baseline for running complex analytics without needing direct unencrypted access to the underlying data, maintaining its privacy. Important limitations to consider for these techniques include the efficiency and level of security required. The security of HE and SMPC come at the cost of speed—the significant amount of overhead means that algorithms implemented in these protocols and encryption schemes are slower than when run on plaintext. Additionally, several important parameters determine what techniques or protocols are used based on the security requirements. SMPC protocols may need to be selected for resistance against a party that attempts to deviate from the protocol to distort the result or gain access to additional information, and a protocol secure against these attacks may further increase the overhead of the algorithm.

97 MATHEMATICS AND COMPUTING↗

Identifying Muon Neutrino Charged-Current Interactions in the MicroBooNE Detector

The MicroBooNE experiment is a short-baseline neutrino experiment at the Fermi National Accelerator Laboratory (FNAL) in the US, receiving a highly pure muon neutrino beam from the Booster Neutrino Beam (BNB) and taking data since October 2015. The main physics goal of MicroBooNE is to clarify the nature of the low-energy excess of electron-like events observed by the MiniBooNE Cherenkov detector, which due to its detector technology is unable to resolve whether the observed excess shower-like events are due to electrons or photons. Instead, MicrooBooNE employs cutting-edge liquid argon time projection chamber (LArTPC) technology, which offers excellent spatial and calorimetric resolution, which makes it possible to reconstruct complex neutrino interactions and to efficiently distinguish different final state particle types. This thesis presents a fully-automated event selection of interactions of the types ν μ +Ar → μ - + X and ν μ + Ar → μ - + p + X developed using the Pandora multi-algorithm approach to pattern recognition for LArTPC experiments. The analysis in this work is performed on a subset of the MicroBooNE Run 1 dataset corresponding to 4.52 × 10 19 protons on target acquired by the MicroBooNE detector between February and October 2016. The analysis quantifies the main signal and background interaction channels that produce a reconstructed neutrino interaction with one and two particles in the final state, and quantifies the extent to which different aspects of the Pandora reconstruction affect the selection performance. MicroBooNE is a surface detector, and therefore cosmic-ray tracks are the main observed background. A direction fitting procedure has been implemented in this analysis to formulate directional probabilities, using the Bethe equation and the high-resolution calorimetric information of MicroBooNE, to reduce this cosmic-ray background. This functionality is used to enhance the efficiency of the Pandora cosmic ray tagging logic, and the impact of this procedure on the reconstruction and event selection performance is analysed. The result of this study is two fully-automated selections of ν μ +Ar → μ - + X (57.91% pure) and ν μ + Ar → μ - + p + X (78.30% pure) with efficiencies of 64.35% and 62.65%, respectively.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

A Selective Overview and Comparison of Robust Mixture Regression Estimators

Summary Mixture regression models have been widely used in business, marketing and social sciences to model mixed regression relationships arising from a clustered and thus heterogeneous population. The unknown mixture regression parameters are usually estimated by maximum likelihood estimators using the expectation–maximisation algorithm based on the normality assumption of component error density. However, it is well known that the normality‐based maximum likelihood estimation is very sensitive to outliers or heavy‐tailed error distributions. This paper aims to give a selective overview of the recently proposed robust mixture regression methods and compare their performance using simulation studies.

Yu, Chun↗

Chemometric Analysis of Gas Chromatography – Mass Spectrometry Data using Fast Retention Time Alignment via a Total Ion Current Shift Function

A critical comparison of methods for correcting severely retention time shifted gas chromatography-mass spectrometry (GC-MS) data is presented. The method reported herein is an adaptation to the Piecewise Alignment Algorithm to quickly align severely shifted one-dimensional (1D) total ion current (TIC) data, then applying these shifts to broadly align all mass channels throughout the separation, referred to as a TIC shift function (SF). The maximum shift varied from (-) 5 s in the beginning of the chromatographic separation to (+) 20 s toward the end of the separation, equivalent to a maximum shift of over 5 peak widths. Implementing the TIC shift function (TIC SF) prior to Fisher Ratio (F-Ratio) feature selection and then principal component analysis (PCA) was found to be a viable approach to classify complex chromatograms, that in this study were obtained from GC-MS separations of three gasoline samples serving as complex test mixtures, referred to as types C, M and S. The reported alignment algorithm via the TIC SF approach corrects for large dynamic shifting in the data as well as subtle peak-to-peak shifts. The benefits of the overall TIC SF alignment and feature selection approach were quantified using the degree-of-class separation (DCS) metric of the PCA scores plots using the type C and M samples, since they were the most similar, and thus the most challenging samples to properly classify. The DCS values showed an increase from an initial value of essentially zero for the unaligned GC-TIC data to a value of 7.9 following alignment; however, the DCS was unchanged by feature selection using F-Ratios for the GC-TIC data. The full mass spectral data provided an increase to a final DCS of 13.7 after alignment and two-dimensional (2D) F-Ratio feature selection.

02 PETROLEUM↗