Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “VECTORS”

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,603 records · Page 89

Spatial Support Vector Regression to Detect Silent Errors in the Exascale Era

As the exascale era approaches, the increasing capacity of high-performance computing (HPC) systems with targeted power and energy budget goals introduces significant challenges in reliability. Silent data corruptions (SDCs) or silent errors are one of the major sources that corrupt the executionresults of HPC applications without being detected. In this work, we explore a low-memory-overhead SDC detector, by leveraging epsilon-insensitive support vector machine regression, to detect SDCs that occur in HPC applications that can be characterized by an impact error bound. The key contributions are three fold. (1) Our design takes spatialfeatures (i.e., neighbouring data values for each data point in a snapshot) into training data, such that little memory overhead (less than 1%) is introduced. (2) We provide an in-depth study on the detection ability and performance with different parameters, and we optimize the detection range carefully. (3) Experiments with eight real-world HPC applications show thatour detector can achieve the detection sensitivity (i.e., recall) up to 99% yet suffer a less than 1% of false positive rate for most cases. Our detector incurs low performance overhead, 5% on average, for all benchmarks studied in the paper. Compared with other state-of-the-art techniques, our detector exhibits the best tradeoff considering the detection ability and overheads.

Subasi, Omer↗

Fast and Accurate Support Vector Machines on Large Scale Systems

Support Vector Machines (SVM) is a supervised Machine Learning and Data Mining (MLDM) algorithm, which has become ubiquitous largely due to its high accuracy and obliviousness to dimensionality. The objective of SVM is to find an optimal boundary --- also known as hyperplane --- which separates the samples (examples in a dataset) of different classes by a maximum margin. Usually, very few samples contribute to the definition of the boundary. However, existing parallel algorithms use the entire dataset for finding the boundary, which is sub-optimal for performance reasons. In this paper, we propose a novel distributed memory algorithm to eliminate the samples which do not contribute to the boundary definition in SVM. We propose several heuristics, which range from early (aggressive) to late (conservative) elimination of the samples, such that the overall time for generating the boundary is reduced considerably. In a few cases, a sample may be eliminated (shrunk) pre-emptively --- potentially resulting in an incorrect boundary. We propose a scalable approach to synchronize the necessary data structures such that the proposed algorithm maintains its accuracy. We consider the necessary trade-offs of single/multiple synchronization using in-depth time-space complexity analysis. We implement the proposed algorithm using MPI and compare it with libsvm--- de facto sequential SVM software --- which we enhance with OpenMP for multi-core/many-core parallelism. Our proposed approach shows excellent efficiency using up to 4096 processes on several large datasets such as UCI HIGGS Boson dataset and Offending URL dataset.

Vishnu, Abhinav↗

Efficient Hierarchical State Vector Simulation of Quantum Circuits via Acyclic Graph Partitioning

Early but promising results in quantum computing have been enabled by the concurrent development of quantum algorithms, devices, and materials. Classical simulation of quantum programs has enabled the design and analysis of algorithms and implementation strategies targeting current and anticipated quantum device architectures. In this paper, we present a graph-based approach to achieve efficient quantum circuit simulation. Our approach involves partitioning the graph representation of a given quantum circuit into sub-graphs/circuits that exhibit better data locality. Simulation of each sub-circuit is organized hierarchically, with the iterative construction and simulation of smaller state vectors, improving overall performance. Also, this partitioning reduces the number of passes through data, improving the total computation time. We present three partitioning strategies and observe that acyclic graph partitioning typically results in the best time-to-solution. In contrast, other strategies reduce the partitioning time at the expense of potentially increased simulation times. Experimental evaluation demonstrates the effectiveness of our approach.

Fang, Bo↗

Fast Parallel Tensor Times Same Vector for Hypergraphs

Hypergraphs are a popular paradigm to rep- resent complex real-world networks exhibiting multi-way relationships of varying sizes. Mining centrality in hyper- graphs via symmetric adjacency tensors has only recently become computationally feasible for large and complex datasets. To enable scalable computation of these and related hypergraph analytics, here we focus on the Sparse Symmetric Tensor Times Same Vector (S3TTVC) oper- ation. We introduce the Compound Compressed Sparse Symmetric (CCSS) format, an extension of the compact CSS format for hypergraphs of varying hyperedge sizes and present a shared-memory parallel algorithm to compute S3TTVC. We experimentally show S3TTVC computation using the CCSS format achieves better performance than the naive baseline, and is subsequently more performant for hypergraph H-eigenvector centrality.

Shivakumar, Shruti↗

General Space Vector Modulation of A High-Frequency AC Linked Universal Converter for Distributed Generations

A high-frequency (HF) ac linked universal converter is proposed for distributed generations interfacing three-phase ac with single-phase ac or dc. The primary and secondary of the HF isolation transformer are, respectively, formed by a three-to-single-phase matrix converter and a cyclo converter. Based on the operating principle, a general and simple to be implemented space vector modulation (SVM) is developed from that for the conventional indirect matrix converter and constantly operated virtual dual-active-bridge converter. Simulation studies carried out on different amplitudes and frequencies of single-phase ac output and dc output demonstrate effectiveness and simplicity of the proposed converter with the SVM solution.

Liu, Yushan↗

Optimizing Sparse Matrix-Multiple Vectors Multiplication for Nuclear Configuration Interaction Calculations

Obtaining highly accurate predictions on the properties of light atomic nuclei using the configuration interaction (CI) approach requires computing a few extremal Eigen pairs of the many-body nuclear Hamiltonian matrix. In the Many-body Fermion Dynamics for nuclei (MFDn) code, a block Eigen solver is used for this purpose. Due to the large size of the sparse matrices involved, a significant fraction of the time spent on the Eigen value computations is associated with the multiplication of a sparse matrix (and the transpose of that matrix) with multiple vectors (SpMM and SpMM-T). Existing implementations of SpMM and SpMM-T significantly underperform expectations. Thus, in this paper, we present and analyze optimized implementations of SpMM and SpMM-T. We base our implementation on the compressed sparse blocks (CSB) matrix format and target systems with multi-core architectures. We develop a performance model that allows us to understand and estimate the performance characteristics of our SpMM kernel implementations, and demonstrate the efficiency of our implementation on a series of real-world matrices extracted from MFDn. In particular, we obtain 3-4 speedup on the requisite operations over good implementations based on the commonly used compressed sparse row (CSR) matrix format. The improvements in the SpMM kernel suggest we may attain roughly a 40% speed up in the overall execution time of the block Eigen solver used in MFDn.

97 MATHEMATICS AND COMPUTING↗

MIC-SVM: Designing A Highly Efficient Support Vector Machine For Advanced Modern Multi-Core and Many-Core Architectures

Support Vector Machine (SVM) has been widely used in data-mining and Big Data applications as modern commercial databases start to attach an increasing importance to the analytic capabilities. In recent years, SVM was adapted to the field of High Performance Computing for power/performance prediction, auto-tuning, and runtime scheduling. However, even at the risk of losing prediction accuracy due to insufficient runtime information, researchers can only afford to apply offline model training to avoid significant runtime training overhead. To address the challenges above, we designed and implemented MICSVM, a highly efficient parallel SVM for x86 based multi-core and many core architectures, such as the Intel Ivy Bridge CPUs and Intel Xeon Phi coprocessor (MIC).

42 ENGINEERING↗

Relevance Vector Machine Image Reconstruction Algorithm for Electrical Capacitance Tomography With Explicit Uncertainty Estimates

We present a Relevance Vector Machine (RVM) based algorithm for electrical capacitance tomography (ECT) applications that can concurrently provide image reconstruction results and uncertainty estimates about the reconstruction. To illustrate the RVM operation in ECT, we simulate typical ECT scenarios, making explicit the connection between the reconstructed pixel values and the corresponding uncertainty estimates in each case. We compare the RVM reconstruction performance with that of the Iterative Landweber Method (ILM) and the least absolute shrinkage and selection operator (LASSO) in all the considered scenarios. The results show that, in addition to the key advantage of providing uncertainty measures, RVM can achieve similar reconstruction results with either lower or similar computational complexity.

42 ENGINEERING↗

On the Investigation of Phase Fault Classification in Power Grid Signals: A Case Study for Support Vector Machines, Decision Tree and Random Forest

In monitoring the power grid, an ability to differentiate between fault types is essential to ensuring electrical safety. Accordingly, this study introduces a fault detection and classification method by considering different machine learning (ML) and feature extraction (FE) methods combinations. Specifically, the proposed method is established in two classification layers; the first layer determines the fault, and the second layer distinguishes the type of fault. Based on the proposed system model, this study seeks to determine the influential data attributes in a power grid signal using FE methods, including fast Fourier transform, power spectral density (PSD), auto-correlation, and wavelet transform (WT). A cross-comparison of the effectiveness of the Support Vector Machine (SVM), Decision Tree (DT), and Random Forest (RF) is also performed to accomplish the classification layers of the proposed method. The designed algorithm is analyzed under the various combinations of FE and ML methods, and outcomes are presented by considering the trade-off between computational complexity and prediction accuracy. The results reveal that the RF-based ML algorithm shows the most accurate classification performance with PSD, and the most time-saving of the models is the DT WT. Also, SVM emerges superior on a subsequent test of the simulated models on real-world signals.

Galbraith, Kelli↗

An Enhanced Model Predictive Control Using Virtual Space Vectors for Grid-Connected Three-Level Neutral-Point Clamped Inverters

Reliability of power systems can be improved by the use of voltage source inverters (VSIs) with fast dynamic control, which can handle uncertainties induced by renewable energy resources and nonlinear loads. To ensure fast-dynamic response and simplified controller design, various model predictive control (MPC) methods are investigated in this paper. In the conventional MPC design for three-level VSIs, the cost function requires an additional term to ensure the balance of the neutral-point voltage (NP-V), which however can considerably impact the main goal of the MPC. To address this issue, an enhanced MPC using virtual space vectors is proposed, which allows the use of a significantly reduced weighting factor for the term in the cost function for NP-V balancing, while retaining fast-dynamic response. Additionally, the proposed MPC leads to reduced harmonic distortion in the VSI output voltage and current. Both simulation and controller hardware-in-the-loop studies are performed to demonstrate the effectiveness of the proposed enhanced MPC in an operating microgrid under both steady-state and fast-transient conditions.

30 DIRECT ENERGY CONVERSION↗

Vector-Resolved Magnetooptic Kerr Effect Measurements of Spin–Orbit Torque

We demonstrate simultaneous detection of current-driven dampinglike and fieldlike spin-orbit torques in heavy metal/ferromagnetic metal bilayers by measuring all three magnetization components m x , m y and m z using a vector-resolved magnetooptic Kerr effect (MOKE) technique based on quadrant detection. Here, we investigate the magnitude and direction of spin-orbit torques in a series of platinum/permalloy samples, finding good agreement with results obtained via polar and quadratic MOKE measurements without quadrant detection

47 OTHER INSTRUMENTATION↗

Implementation of a Doppler-Free Saturation Spectroscopy (DFSS) Diagnostic for Helicon Wave Electric Field Vector Measurement in Edge Plasma in DIII-D

A laser-based technique known as Doppler-free saturation spectroscopy (DFSS) has been designed, fabricated, and installed on the DIII-D National Fusion Facility to measure the helicon wave electric field vector in the edge plasma. These experimental measurements quantify phenomena resulting in decreased current drive efficiency due to wave/edge plasma interactions. This implementation of DFSS on DIII-D is the first of its kind on a tokamak and thus presents unique engineering challenges, including integration of the system onto an existing multidiagnostic port flange without impacts to system serviceability, as well as maintaining precise laser alignment over a 2-m distance during disruptions and thermal drift of the vessel. Further, these challenges were resolved using innovative design approaches such as a novel decoupled shutter system to facilitate serviceability of the in-vessel mirror assemblies without the need for personnel vessel entry, as well as an ex-vessel piezo-mirror-based optical system for laser beam shaping and real-time steering of the measurement location. The solutions to these engineering challenges were demonstrated during the successful installation and operation of these diagnostic components during the 2022 DIII-D vent and subsequent experimental campaign.

70 PLASMA PHYSICS AND FUSION TECHNOLOGY↗

Situating the Vector Density Approach Among Contemporary Continuum Theories of Dislocation Dynamics

Abstract For the past century, dislocations have been understood to be the carriers of plastic deformation in crystalline solids. However, their collective behavior is still poorly understood. Progress in understanding the collective behavior of dislocations has primarily come in one of two modes: the simulation of systems of interacting discrete dislocations and the treatment of density measures of varying complexity that are considered as continuum fields. A summary of contemporary models of continuum dislocation dynamics is presented. These include, in order of complexity, the two-dimensional statistical theory of dislocations, the field dislocation mechanics treating the total Kröner–Nye tensor, vector density approaches that treat geometrically necessary dislocations on each slip system of a crystal, and high-order theories that examine the effect of dislocation curvature and distribution over orientation. Each of theories contain common themes, including statistical closure of the kinetic dislocation transport equations and treatment of dislocation reactions such as junction formation. An emphasis is placed on how these common themes rely on closure relations obtained by analysis of discrete dislocation dynamics experiments. The outlook of these various continuum theories of dislocation motion is then discussed.

Engineering↗

Comparison of Bayesian network and support vector machine models for two-year survival prediction in lung cancer patients treated with radiotherapy

Purpose: Classic statistical and machine learning models such as support vector machines (SVMs) can be used to predict cancer outcome, but often only perform well if all the input variables are known, which is unlikely in the medical domain. Bayesian network (BN) models have a natural ability to reason under uncertainty and might handle missing data better. In this study, the authors hypothesize that a BN model can predict two-year survival in non-small cell lung cancer (NSCLC) patients as accurately as SVM, but will predict survival more accurately when data are missing. Methods: A BN and SVM model were trained on 322 inoperable NSCLC patients treated with radiotherapy from Maastricht and validated in three independent data sets of 35, 47, and 33 patients from Ghent, Leuven, and Toronto. Missing variables occurred in the data set with only 37, 28, and 24 patients having a complete data set. Results: The BN model structure and parameter learning identified gross tumor volume size, performance status, and number of positive lymph nodes on a PET as prognostic factors for two-year survival. When validated in the full validation set of Ghent, Leuven, and Toronto, the BN model had an AUC of 0.77, 0.72, and 0.70, respectively. A SVM model based on the same variables had an overall worse performance (AUC 0.71, 0.68, and 0.69) especially in the Ghent set, which had the highest percentage of missing the important GTV size data. When only patients with complete data sets were considered, the BN and SVM model performed more alike. Conclusions: Within the limitations of this study, the hypothesis is supported that BN models are better at handling missing data than SVM models and are therefore more suitable for the medical domain. Future works have to focus on improving the BN performance by including more patients, more variables, and more diversity.

62 RADIOLOGY AND NUCLEAR MEDICINE↗

A support vector machine (SVM) for predicting preferred treatment position in radiotherapy of patients with breast cancer

Purpose: NYU 05-181 protocol compared the CT simulation in both supine and prone positions for 400 patients with breast cancer (200 left-breast and 200 right-breast) to identify which setup is better at sparing heart and lung involvement in the treatment process. The results demonstrated that all right-breast patients benefited from the prone treatment position, while for left-breast patients, 85% were better treated prone and 15% were better treated supine. Using the clinical data collected from this protocol, the authors aimed at developing an automated tool capable of identifying which of the left-breast cancer patients are better treated supine without obtaining a second CT scan in the supine position. Methods: Prone CT scans from 198 of the 200 left-breast cancer patients enrolled in NYU 05-181 protocol were deidentified and exported to a dedicated research planning workstation. Three-dimensional geometric features of the organs at risk and tumor bed were extracted. A two-stage classifier was used to classify patients into the prone class or the supine class. In the first stage, the authors use simple thresholding to divide the patients into two groups based on their in-field heart volume. For patients with in-field heart volume {<=}0.1 cc, the prone position was chosen as the preferred treatment position. Patients with in-field heart volume >0.1 cc will be further classified in the second stage by a weighted support vector machine (SVM). The weight parameters of the SVM were adjusted to maximize the specificity [true-supine/(true-supine+false-prone)] at the cost of lowering but still maintaining reasonable sensitivity [true-prone/(true-prone+false-supine)]. The authors used K-fold cross validations to test the performance of the SVM classifier. A feature selection algorithm was also used to identify features that give the best classification performance. Results: After the first stage, 49 of the 198 left-breast cancer patients were found to have >0.1 cc of in-field heart volume. The three geometric features of heart orientation, distance between heart and tumor, and in-field lung were selected by the feature selection algorithm in the second stage of the two-stage classifier to give the best predefined weighted accuracy. The overall sensitivity and specificity of the proposed method were found to be 90.4% and 99.3%, respectively. Using two-stage classification, the authors reduced the proportion of prone-treated patients that need a second supine CT scan down to 16.3/170 or 9.6%, as compared to 21/170 or 12.4% when the authors use only the first stage (thresholding) for classification. Conclusions: The authors' study showed that a feature-based classifier is feasible for predicting the preferred treatment position, based on features extracted from prone CT scans. The two-stage classifier achieved very high specificity at an acceptable expense of sensitivity.

60 APPLIED LIFE SCIENCES↗

Development and evaluation of a computer-aided diagnostic scheme for lung nodule detection in chest radiographs by means of two-stage nodule enhancement with support vector classification

Purpose: To develop a computer-aided detection (CADe) scheme for nodules in chest radiographs (CXRs) with a high sensitivity and a low false-positive (FP) rate. Methods: The authors developed a CADe scheme consisting of five major steps, which were developed for improving the overall performance of CADe schemes. First, to segment the lung fields accurately, the authors developed a multisegment active shape model. Then, a two-stage nodule-enhancement technique was developed for improving the conspicuity of nodules. Initial nodule candidates were detected and segmented by using the clustering watershed algorithm. Thirty-one shape-, gray-level-, surface-, and gradient-based features were extracted from each segmented candidate for determining the feature space, including one of the new features based on the Canny edge detector to eliminate a major FP source caused by rib crossings. Finally, a nonlinear support vector machine (SVM) with a Gaussian kernel was employed for classification of the nodule candidates. Results: To evaluate and compare the scheme to other published CADe schemes, the authors used a publicly available database containing 140 nodules in 140 CXRs and 93 normal CXRs. The CADe scheme based on the SVM classifier achieved sensitivities of 78.6% (110/140) and 71.4% (100/140) with averages of 5.0 (1165/233) FPs/image and 2.0 (466/233) FPs/image, respectively, in a leave-one-out cross-validation test, whereas the CADe scheme based on a linear discriminant analysis classifier had a sensitivity of 60.7% (85/140) at an FP rate of 5.0 FPs/image. For nodules classified as ''very subtle'' and ''extremely subtle,'' a sensitivity of 57.1% (24/42) was achieved at an FP rate of 5.0 FPs/image. When the authors used a database developed at the University of Chicago, the sensitivities was 83.3% (40/48) and 77.1% (37/48) at an FP rate of 5.0 (240/48) FPs/image and 2.0 (96/48) FPs /image, respectively. Conclusions: These results compare favorably to those described for other commercial and noncommercial CADe nodule detection systems.

60 APPLIED LIFE SCIENCES↗

Automated beam placement for breast radiotherapy using a support vector machine based algorithm

Purpose: To develop an automated beam placement technique for whole breast radiotherapy using tangential beams. We seek to find optimal parameters for tangential beams to cover the whole ipsilateral breast (WB) and minimize the dose to the organs at risk (OARs). Methods: A support vector machine (SVM) based method is proposed to determine the optimal posterior plane of the tangential beams. Relative significances of including/avoiding the volumes of interests are incorporated into the cost function of the SVM. After finding the optimal 3-D plane that separates the whole breast (WB) and the included clinical target volumes (CTVs) from the OARs, the gantry angle, collimator angle, and posterior jaw size of the tangential beams are derived from the separating plane equation. Dosimetric measures of the treatment plans determined by the automated method are compared with those obtained by applying manual beam placement by the physicians. The method can be further extended to use multileaf collimator (MLC) blocking by optimizing posterior MLC positions. Results: The plans for 36 patients (23 prone- and 13 supine-treated) with left breast cancer were analyzed. Our algorithm reduced the volume of the heart that receives >500 cGy dose (V5) from 2.7 to 1.7 cm{sup 3} (p = 0.058) on average and the volume of the ipsilateral lung that receives >1000 cGy dose (V10) from 55.2 to 40.7 cm{sup 3} (p = 0.0013). The dose coverage as measured by volume receiving >95% of the prescription dose (V95%) of the WB without a 5 mm superficial layer decreases by only 0.74% (p = 0.0002) and the V95% for the tumor bed with 1.5 cm margin remains unchanged. Conclusions: This study has demonstrated the feasibility of using a SVM-based algorithm to determine optimal beam placement without a physician's intervention. The proposed method reduced the dose to OARs, especially for supine treated patients, without any relevant degradation of dose homogeneity and coverage in general.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Estimation of breast percent density in raw and processed full field digital mammography images via adaptive fuzzy c-means clustering and support vector machine segmentation

Purpose: The amount of fibroglandular tissue content in the breast as estimated mammographically, commonly referred to as breast percent density (PD%), is one of the most significant risk factors for developing breast cancer. Approaches to quantify breast density commonly focus on either semiautomated methods or visual assessment, both of which are highly subjective. Furthermore, most studies published to date investigating computer-aided assessment of breast PD% have been performed using digitized screen-film mammograms, while digital mammography is increasingly replacing screen-film mammography in breast cancer screening protocols. Digital mammography imaging generates two types of images for analysis, raw (i.e., 'FOR PROCESSING') and vendor postprocessed (i.e., 'FOR PRESENTATION'), of which postprocessed images are commonly used in clinical practice. Development of an algorithm which effectively estimates breast PD% in both raw and postprocessed digital mammography images would be beneficial in terms of direct clinical application and retrospective analysis. Methods: This work proposes a new algorithm for fully automated quantification of breast PD% based on adaptive multiclass fuzzy c-means (FCM) clustering and support vector machine (SVM) classification, optimized for the imaging characteristics of both raw and processed digital mammography images as well as for individual patient and image characteristics. Our algorithm first delineates the breast region within the mammogram via an automated thresholding scheme to identify background air followed by a straight line Hough transform to extract the pectoral muscle region. The algorithm then applies adaptive FCM clustering based on an optimal number of clusters derived from image properties of the specific mammogram to subdivide the breast into regions of similar gray-level intensity. Finally, a SVM classifier is trained to identify which clusters within the breast tissue are likely fibroglandular, which are then aggregated into a final dense tissue segmentation that is used to compute breast PD%. Our method is validated on a group of 81 women for whom bilateral, mediolateral oblique, raw and processed screening digital mammograms were available, and agreement is assessed with both continuous and categorical density estimates made by a trained breast-imaging radiologist. Results: Strong association between algorithm-estimated and radiologist-provided breast PD% was detected for both raw (r= 0.82, p < 0.001) and processed (r= 0.85, p < 0.001) digital mammograms on a per-breast basis. Stronger agreement was found when overall breast density was assessed on a per-woman basis for both raw (r= 0.85, p < 0.001) and processed (0.89, p < 0.001) mammograms. Strong agreement between categorical density estimates was also seen (weighted Cohen's {kappa}{>=} 0.79). Repeated measures analysis of variance demonstrated no statistically significant differences between the PD% estimates (p > 0.1) due to either presentation of the image (raw vs processed) or method of PD% assessment (radiologist vs algorithm). Conclusions: The proposed fully automated algorithm was successful in estimating breast percent density from both raw and processed digital mammographic images. Accurate assessment of a woman's breast density is critical in order for the estimate to be incorporated into risk assessment models. These results show promise for the clinical application of the algorithm in quantifying breast density in a repeatable manner, both at time of imaging as well as in retrospective studies.

60 APPLIED LIFE SCIENCES↗