Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Vector”

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,621 records · Page 90

Precise Extraction of the Induced Polarization in the {sup 4}He(e,e{sup '}p-vector){sup 3}H Reaction

We measured with unprecedented precision the induced polarization P{sub y} in {sup 4}He(e,e{sup '}p-vector){sup 3}H at Q{sup 2}=0.8 and 1.3 (GeV/c){sup 2}. The induced polarization is indicative of reaction-mechanism effects beyond the impulse approximation. Our results are in agreement with a relativistic distorted-wave impulse approximation calculation but are overestimated by a calculation with strong charge-exchange effects. Our data are used to constrain the strength of the spin-independent charge-exchange term in the latter calculation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Ballistic protons in incoherent exclusive vector meson production as a measure of rare parton fluctuations at an electron-ion collider

We argue that the proton multiplicities measured in Roman pot detectors at an electron ion collider can be used to determine centrality classes in incoherent diffractive scattering. Incoherent diffraction probes the fluctuations in the interaction strengths of multi-parton Fock states in the nuclear wavefunctions. In particular, the saturation scale that characterizes this multi-parton dynamics is significantly larger in central events relative to minimum bias events. As an application, we examine the centrality dependence of incoherent diffractive vector meson production. We identify an observable which is simultaneously very sensitive to centrality triggered parton fluctuations and insensitive to details of the model.

73 NUCLEAR PHYSICS AND RADIATION PHYSICS↗

Probing Heavy Majorana Neutrinos and the Weinberg Operator through Vector Boson Fusion Processes in Proton-Proton Collisions at s = 13 TeV

The first search exploiting the vector boson fusion process to probe heavy Majorana neutrinos and the Weinberg operator at the LHC is presented. The search is performed in the same-sign dimuon final state using a proton-proton collision dataset recorded at s = 13 TeV , collected with the CMS detector and corresponding to a total integrated luminosity of 138 fb -1 . The results are found to agree with the predictions of the standard model. For heavy Majorana neutrinos, constraints on the squared mixing element between the muon and the heavy neutrino are derived in the heavy neutrino mass range 50 GeV–25 TeV; for masses above 650 GeV these are the most stringent constraints from searches at the LHC to date. A first test of the Weinberg operator at colliders provides an observed upper limit at 95% confidence level on the effective $μμ$ Majorana neutrino mass of 10.8 GeV.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Light and Strange Vector Resonances from Lattice QCD at Physical Quark Masses

We present the first ab initio calculation at physical quark masses of scattering amplitudes describing the lightest pseudoscalar mesons interacting via the strong force in the vector channel. Using lattice quantum chromodynamics, we postdict the defining parameters for two short-lived resonances, the ρ(770) and K*(892) which manifest as complex energy poles in ππ and Kπ scattering amplitudes, respectively. The calculation proceeds by first computing the finite-volume energy spectrum of the two-hadron systems and then determining the amplitudes from the energies using the Lüscher formalism. The error budget includes a data-driven systematic error, obtained by scanning possible fit ranges and fit models to extract the spectrum from Euclidean correlators, as well as the scattering amplitudes from the latter. The final results, obtained by analytically continuing multiple parametrizations into the complex energy plane, are M ρ = 796(5)(50)MeV, Γ ρ = 192(10)(31) MeV, M K* = 893(2)(54) MeV, and Γ K = 51(2)(11) MeV, where the subscript indicates the resonance and M and Γ stand for the mass and width, respectively, and where the first bracket indicates the statistical and the second bracket the systematic uncertainty.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Observation of an Axial-Vector State in the Study of the Decay ψ ( 3686 ) → ϕ η η ′

Using ( 2712.4 ± 14.3 ) × 10 6 ψ ( 3686 ) events collected with the BESIII detector at BEPCII, a partial wave analysis of the decay ψ ( 3686 ) → ϕ η η ′ is performed with the covariant tensor approach. In addition to the established states h 1 ( 1900 ) and ϕ ( 2170 ) , an axial-vector state with a mass near 2.3 GeV / c 2 is observed for the first time. Its mass and width are measured to be 2316 ± 9 stat ± 3 0 syst MeV / c 2 and 89 ± 1 5 stat ± 2 6 syst MeV , respectively. The product branching fractions of B [ ψ ( 3686 ) → X ( 2300 ) η ′ ] B [ X ( 2300 ) → ϕ η ] and B [ ψ ( 3686 ) → X ( 2300 ) η ] B [ X ( 2300 ) → ϕ η ′ ] are determined to be ( 4.8 ± 1.3 stat ± 0.7 syst ) × 10 − 6 and ( 2.2 ± 0.7 stat ± 0.7 syst ) × 10 − 6 , respectively. The branching fraction B [ ψ ( 3686 ) → ϕ η η ′ ] is measured for the first time to be ( 3.14 ± 0.1 7 stat ± 0.2 4 syst ) × 10 − 5 . The first uncertainties are statistical and the second are systematic. Published by the American Physical Society 2025

Ablikim, M.↗

Search for a Neutral Gauge Boson with Nonuniversal Fermion Couplings in Vector Boson Fusion Processes in Proton-Proton Collisions at $\sqrt{𝑠}$ = 13 TeV

The first search for a heavy neutral spin-1 gauge boson (𝑍′) with nonuniversal fermion couplings produced via vector boson fusion processes and decaying to tau leptons or 𝑊 bosons is presented. The analysis is performed using LHC data at $\sqrt{𝑠}$ = 13 TeV, collected from 2016 to 2018 with the CMS experiment and corresponding to an integrated luminosity of 138 fb −1 . The data are consistent with the standard model predictions. Upper limits are set on the product of the cross section for production of the 𝑍′ boson and its branching fraction to 𝜏⁢𝜏 or 𝑊⁢𝑊. The presence of a 𝑍′ boson decaying to 𝜏 + ⁢𝜏 − (𝑊 + ⁢𝑊 − ) is excluded for masses up to 2.45(1.60) TeV, depending on the 𝑍′ boson coupling to standard model weak bosons, and assuming a 𝑍′→𝜏 + ⁢𝜏 − (𝑊 + ⁢𝑊 − ) branching fraction of 50%.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Coherent Spin Pumping Originated from Sub-Terahertz Néel Vector Dynamics in Easy Plane α -Fe 2 O 3 /Pt

We present a thorough study of spin-to-charge current interconversion in bulk and thin films of (0001) 𝛼-Fe2O3/Pt heterostructures by all-optical polarization-controlled microwave excitation at sub-Terahertz frequencies. Our results demonstrate that coherent spin pumping is generated through excitations of both the q-FM and q-AFM modes of antiferromagnetic resonance, provided that the corresponding selection rules are met. Our findings significantly advance current understanding of spin pumping in easy-plane antiferromagnets not only by claiming a substantial contribution from the Néel-vector dynamics of the q-AFM mode but also by experimentally determining the relative strength of the intra- and cross-sublattice components of the spin-mixing conductance, challenging recent reports where the absence of spin pumping from the q-AFM mode in Hematite was interpreted as a complete cancellation between these two components. We also provide an explanation for the previously reported observations and show how the q-AFM spin pumping actually vanishes for thin films, which we speculate being either due to an increased level of inhomogeneities or to insufficient film thickness for the q-AFM mode to fully realize.

Fritjofson, Gregory [University of Central Florida↗

1.45 Å resolution structure of SRPN18 from the malaria vector Anopheles gambiae

Serine protease inhibitors (serpins) in insects function within development, wound healing and immunity. The genome of the African malaria vector, Anopheles gambiae , encodes 23 distinct serpin proteins, several of which are implicated in disease-relevant physiological responses. A. gambiae serpin 18 (SRPN18) was previously categorized as non-inhibitory based on the sequence of its reactive-center loop (RCL), a region responsible for targeting and initiating protease inhibition. The crystal structure of A. gambiae SRPN18 was determined to a resolution of 1.45 Å, including nearly the entire RCL in one of the two molecules in the asymmetric unit. The structure reveals that the SRPN18 RCL is extremely short and constricted, a feature associated with noncanonical inhibitors or non-inhibitory serpin superfamily members. Furthermore, the SRPN18 RCL does not contain a suitable protease target site and contains a large number of prolines. The SRPN18 structure therefore reveals a unique RCL architecture among the highly conserved serpin fold.

36 MATERIALS SCIENCE↗

Analytical Analysis of Ac and Dc Side Harmonics of Three-level Active Neutral Point Clamped Inverter with Space Vector Modulation

This paper presents a comprehensive analytical analysis of the ac and dc side harmonics of the three-level active neutral point clamped (ANPC) inverter with space vector modulation (SVM) scheme. An analytical model to calculate the harmonics of a three-level converter with SVM is developed. The ac side output voltage harmonics and dc side current harmonics characteristics are calculated and analyzed. With the developed models, the impact of interleaving on both sides harmonics are studied which considers the modulation index, interleaving angle, and power factor. The analysis provides guideline for interleaving angle optimization to reduce the ac side power filter and dc side dc-link capacitor. The relationship between electromagnetic interference (EMI) filter corner frequency and switching frequency is also analytically derived which provides guideline for switching frequency and EMI filter design optimization. Two paralleled three-level ANPC inverters are constructed and experimental results are presented to verify the analytical analysis.

Chen, Ruirui↗

A Model Predictive Voltage Control using Virtual Space Vectors for Grid-Forming Energy Storage Converters

Sinusoidal output voltages with low harmonic distortion can be achieved using three-level converters along with LC filters, which have been proven to be suitable for energy storage systems (ESSs). Model predictive control (MPC) as been applied to such energy storage converters due to its simplicity and effectiveness. However, selecting the weighting factor of the additional neutral-point (NP) voltage balancing term in the cost function is time consuming and may also affect the main objective of MPC. To address this issue, in this paper, additional virtual space vectors (VSVs), which do not affect the NP capacitor voltages, are adopted in the proposed MPC. Both simulation and experimental results using controller hardware-in-the-loop are presented to show that NP capacitor voltages can be well controlled using a particularly small NP voltage balancing weighting factor in the cost function. In addition, the total harmonic distortion of the voltage at the point of common coupling is reduced while retaining the fast dynamic response of MPC.

Alhosaini, Waleed↗

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↗