Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “algorithmic efficiency”

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 559 records · Page 31

Empirical binary tomography calibration (EBTC) for the precorrection of beam hardening and scatter for flat panel CT

Purpose: Scatter and beam hardening are prominent artifacts in x-ray CT. Currently, there is no precorrection method that inherently accounts for tube voltage modulation and shaped prefiltration. Methods: A method for self-calibration based on binary tomography of homogeneous objects, which was proposed by B. Li et al. [''A novel beam hardening correction method for computed tomography,'' in Proceedings of the IEEE/ICME International Conference on Complex Medical Engineering CME 2007, pp. 891-895, 23-27 May 2007], has been generalized in order to use this information to preprocess scans of other, nonbinary objects, e.g., to reduce artifacts in medical CT applications. Further on, the method was extended to handle scatter besides beam hardening and to allow for detector pixel-specific and ray-specific precorrections. This implies that the empirical binary tomography calibration (EBTC) technique is sensitive to spectral effects as they are induced by the heel effect, by shaped prefiltration, or by scanners with tube voltage modulation. The presented method models the beam hardening correction by using a rational function, while the scatter component is modeled using the pep model of B. Ohnesorge et al. [''Efficient object scatter correction algorithm for third and fourth generation CT scanners,'' Eur. Radiol. 9(3), 563-569 (1999)]. A smoothness constraint is applied to the parameter space to regularize the underdetermined system of nonlinear equations. The parameters determined are then used to precorrect CT scans. Results: EBTC was evaluated using simulated data of a flat panel cone-beam CT scanner with tube voltage modulation and bow-tie prefiltration and using real data of a flat panel cone-beam CT scanner. In simulation studies, where the ground truth is known, the authors' correction model proved to be highly accurate and was able to reduce beam hardening by 97% and scatter by about 75%. Reconstructions of measured data showed significantly less artifacts than the standard reconstruction. Conclusions: EBTC appears to be an efficient algorithm to precorrect CT raw data for beam hardening and scatter and it can account for ray-dependent spectral variations as they occur due to the heel effect, due to shaped prefiltration, or due to variations in tube voltage.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

Landau discriminants

Scattering amplitudes in quantum field theories have intricate analytic properties as functions of the energies and momenta of the scattered particles. In perturbation theory, their singularities are governed by a set of nonlinear polynomial equations, known as Landau equations, for each individual Feynman diagram. The singularity locus of the associated Feynman integral is made precise with the notion of the Landau discriminant, which characterizes when the Landau equations admit a solution. In order to compute this discriminant, we present approaches from classical elimination theory, as well as a numerical algorithm based on homotopy continuation. These methods allow us to compute Landau discriminants of various Feynman diagrams up to 3 loops, which were previously out of reach. For instance, the Landau discriminant of the envelope diagram is a reducible surface of degree 45 in the three-dimensional space of kinematic invariants. We investigate geometric properties of the Landau discriminant, such as irreducibility, dimension and degree. In particular, we find simple examples in which the Landau discriminant has codimension greater than one. Furthermore, we describe a numerical procedure for determining which parts of the Landau discriminant lie in the physical regions. In order to study degenerate limits of Landau equations and bounds on the degree of the Landau discriminant, we introduce Landau polytopes and study their facet structure. Finally, we provide an efficient numerical algorithm for the computation of the number of master integrals based on the connection to algebraic statistics.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Multi-track reconstruction algorithm in the Mu2e experiment

The Mu2e experiment, under construction at Fermilab, will search for the neutrino-less coherent $\mu^-N\rightarrow e^-N$ conversion in the field of a $^{27}$Al nucleus. Such a process violates lepton flavor conservation. About $60\%$ of muons stopped by an $^{27}$Al nucleus will undergo nuclear capture, while about $40\%$ will decay in orbit. To quantify the conversion probability, we define $R_{\mu e}$, which is given by the ratio between the $\mu^-\rightarrow e^-$ conversion rate and the nuclear capture rate [1]: \begin{equation} R_{\mu e}= \frac{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow e^- + N\left(Z,A\right)\right)}{\Gamma\left(\mu^- + N\left(Z,A\right)\rightarrow \nu^-_\mu + N\left(Z-1,A\right)\right)}\,. \end{equation} The upper limit on $R_{\mu e}$ is $7\cdot 10^{-13}$ at $90\%$ CL, set by the SINDRUM II experiment~\cite{SINDRUM II:limit}. The goal of the Mu2e experiment is to reach a sensitivity on $R_{\mu e}$ of $8\cdot 10^{-17}$ at $90\%$ CL. This represents a four-order of magnitude improvement over the current experimental limit. Mu2e will take its first data in 2027. The signature for the muon conversion is a monochromatic electron of $104.97$~\si{\mega\eV}/c, an energy slightly below the muon rest mass. While the main experiment goal is to reconstruct the conversion electron, i.e., an event with a single track, there are motivations to develop an efficient tracking algorithm for reconstructing more simultaneous tracks. This could better constrain the background generated by $p\bar{p}$-annihilation in the Al target and to search for other Beyond the Standard Model processes. In this paper, we present an algorithm designed to reconstruct multi-particle events.

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

In silico discovery of metal-organic frameworks for precombustion CO 2 capture using a genetic algorithm

Discovery of new adsorbent materials with a high CO 2 working capacity could help reduce CO 2 emissions from newly commissioned power plants using precombustion carbon capture. High-throughput computational screening efforts can accelerate the discovery of new adsorbents but sometimes require significant computational resources to explore the large space of possible materials. Here in this paper we report the in silico discovery of high-performing adsorbents for precombustion CO 2 capture by applying a genetic algorithm to efficiently search a large database of metal-organic frameworks (MOFs) for top candidates. High-performing MOFs identified from the in silico search were synthesized and activated and show a high CO 2 working capacity and a high CO 2 /H 2 selectivity. One of the synthesized MOFs shows a higher CO 2 working capacity than any MOF reported in the literature under the operating conditions investigated here.

36 MATERIALS SCIENCE↗

Composition-dependent stability of the medium-range order responsible for metallic glass formation

The competition between the characteristic medium-range order corresponding to amorphous alloys and that in ordered crystalline phases is central to phase selection and morphology evolution under various processing conditions. We examine the stability of a model glass system, Cu–Zr, by comparing the energetics of various medium-range structural motifs over a wide range of compositions using first-principles calculations. Furthermore, we focus specifically on motifs that represent possible building blocks for competing glassy and crystalline phases, and we employ a genetic algorithm to efficiently identify the energetically favored decorations of each motif for specific compositions. These results show that a Bergman-type motif with crystallization-resisting icosahedral symmetry is energetically most favorable in the composition range 0.63 < xCu < 0.68, and is the underlying motif for one of the three optimal glass-forming ranges observed experimentally for this binary system (Li et al., 2008). This work establishes an energy-based methodology to evaluate specific medium-range structural motifs which compete with stable crystalline nuclei in deeply undercooled liquids.

36 MATERIALS SCIENCE↗

Internal quantum efficiency analysis of solar cell by genetic algorithm

To investigate factors limiting the performance of a GaAs solar cell, genetic algorithm is employed to fit the experimentally measured internal quantum efficiency (IQE) in the full spectra range. The device parameters such as diffusion lengths and surface recombination velocities are extracted. Electron beam induced current (EBIC) is performed in the base region of the cell with obtained diffusion length agreeing with the fit result. The advantage of genetic algorithm is illustrated. (author)

14 SOLAR ENERGY↗

Seasonal Reconfiguration of Electrical Distribution Systems to Mitigate the Impact of Electric Vehicle Charging

Power grids face challenges in their infrastructure related to the integration of electric vehicles (EV). In particular, EV charging stations may induce instability in key system parameters such as substantial voltage drops, active power losses, and transformer overload due to high demand during charging periods. This article presents a seasonal reconfiguration strategy based on the differential evolution (DE) algorithm, aimed at enhancing system performance under highly variable and stochastic load profiles, particularly those driven by EV charging. The DEA algorithm is hybridized with the find-union (FU) algorithm to efficiently ensure network radiality throughout the optimization process. The proposed methodology is validated on a hybrid distribution system composed of the IEEE 33-bus network, a modified IEEE 13-bus system, and a specific 13-bus microgrid. Results have demonstrated that seasonal reconfiguration significantly reduces active power losses and mitigates transformer loading during critical demand hours, thereby quantifiably increasing the system’s performance. As an integral component of the proposed approach, an analysis of CO2 emissions associated with energy losses is included, allowing a contextualized assessment of the environmental benefits of seasonal reconfiguration in various geographical areas.

24 POWER TRANSMISSION AND DISTRIBUTION↗

Quantum Filtering and Analysis of Multiplicities in Eigenvalue Spectra

Fine-grained spectral properties of quantum Hamiltonians, including both eigenvalues and their multiplicities, provide useful information for characterizing many-body quantum systems as well as for understanding phenomena such as topological order. Extracting such information with small additive error is #BQP-complete in the worst case. In this work, we introduce QFAMES (quantum filtering and analysis of multiplicities in eigenvalue spectra), a quantum algorithm that efficiently identifies clusters of closely spaced dominant eigenvalues and determines their multiplicities under physically motivated assumptions, which allows us to bypass worst-case complexity barriers. QFAMES also enables the estimation of observable expectation values within targeted energy clusters, providing a powerful tool for studying quantum phase transitions and other physical properties. We validate the effectiveness of QFAMES through numerical demonstrations, including its applications to characterizing quantum phases in the transverse-field Ising model and estimating the ground-state degeneracy of a topologically ordered phase in the two-dimensional toric code model. We also generalize QFAMES to the setting of mixed initial states. Our approach offers rigorous theoretical guarantees and significant advantages over existing subspace-based quantum spectral analysis methods, particularly in terms of the sample complexity and the ability to resolve degeneracies.

97 MATHEMATICS AND COMPUTING↗

Controller-Based Energy-Aware Wireless Sensor Network Routing Using Quantum Algorithms

Energy-efficient routing in wireless sensor networks has attracted attention from researchers in both academia and industry, most recently motivated by the opportunity to use software-defined network-inspired approaches. These problems are NP-hard, with algorithms needing computation time that scales faster than polynomials in the problem size. Consequently, heuristic algorithms are used in practice, which are unable to guarantee optimally. In this article, we show proof-of-principle for the use of a quantum annealing processor instead of a classical processor, to find optimal or nearly optimal solutions very quickly. Our preliminary results for small networks show that this approach using quantum computing has great promise and may open the door for other significant improvements in the efficacy of network algorithms.

42 ENGINEERING↗

Implementation of the Crank‐Nicolson Douglas‐Gunn finite‐difference time domain with complex frequency‐shifted perfectly matched layer for modeling unbounded isotropic dispersive media in two dimensions

Abstract To model open‐domain problems with Drude, Lorentz, and Debye media, the complex frequency‐shifted perfectly matched layer (CFS‐PML) is adopted to truncate the Crank‐Nicolson Douglas‐Gunn finite‐difference time‐domain (CNDG‐FDTD) region. The auxiliary differential equation (ADE) and the bilinear Z ‐transform methods are incorporated separately into the implementations of CNDG‐CFS‐PML formulations, while the ADE, piecewise linear recursive convolution (RC), and trapezoidal RC methods are utilized to model dispersive media. The proposed formulations can not only circumvent the stability condition, but also have the advantages of the CFS‐PML in attenuating the evanescent waves and reducing the late‐time reflection. Three numerical examples have been carried out to validate these formulations. The simulation results show that the proposed CNDG‐CFS‐PML algorithm is efficient in absorbing performance and saving more computational time compared with the conventional FDTD method, which leads to extensive applicability and acts as a very good prospect.

Shi, Xue‐Yang↗

A coupled DEM-IMB-LBM model for simulating methane hydrate exploitation involving particle dissolution

The coupled discrete element and lattice Boltzmann method using an immersed moving boundary scheme was extended to simulate methane hydrate exploitation involving mass transport and particle dissolution. In this coupled DEM-IMB-LBM model, a new Dirichlet-type thermal boundary condition is extended to simulate moving curved boundaries with constant concentration. A novel periodic boundary including an efficient searching algorithm for particle contact is proposed to reduce the computational cost and boundary effect. So, this model is validated by two numerical examples: a circular particle with concentration convection-diffusion moving in a horizontal channel and mass transport from a cylinder particle in a simple shear flow. The numerical results obtained from the proposed model agree well with previous studies. To further demonstrate the capacity of the proposed model, simulations of methane hydrate exploitation including two formations in marine sediments are carried out. The numerical results indicate that the coupled DEM-IMB-LBM is not only capable of simulating the dissolution of hydrate particles at the grain level, but also recover the sand erosion and migration process in a fundamental perspective during the methane hydrate exploitation process.

42 ENGINEERING↗

e RPCA : Robust Principal Component Analysis for Exponential Family Distributions

Abstract Robust principal component analysis (RPCA) is a widely used method for recovering low‐rank structure from data matrices corrupted by significant and sparse outliers. These corruptions may arise from occlusions, malicious tampering, or other causes for anomalies, and the joint identification of such corruptions with low‐rank background is critical for process monitoring and diagnosis. However, existing RPCA methods and their extensions largely do not account for the underlying probabilistic distribution for the data matrices, which in many applications are known and can be highly non‐Gaussian. We thus propose a new method called RPCA for exponential family distributions (), which can perform the desired decomposition into low‐rank and sparse matrices when such a distribution falls within the exponential family. We present a novel alternating direction method of multiplier optimization algorithm for efficient decomposition, under either its natural or canonical parametrization. The effectiveness of is then demonstrated in two applications: the first for steel sheet defect detection and the second for crime activity monitoring in the Atlanta metropolitan area.

Zheng, Xiaojun↗

Phoenix: A Scalable Streaming Hypergraph Analysis Framework

We present Phoenix, a scalable hypergraph analytics framework for data analytics and knowledge discovery that was implemented on the leadership class computing platforms at Oak Ridge National Laboratory (ORNL). Our software framework comprises a distributed implementation of a streaming server architecture which acts as a gateway for various hypergraph generators/external sources to connect. Phoenix has the capability to utilize diverse hypergraph generators, including HyGen, a very large-scale hypergraph generator developed by ORNL. Phoenix incorporates specific algorithms for efficient data representation by exploiting hidden structures of the hypergraphs. Our experimental results demonstrate Phoenix’s scalable and stable performance on massively parallel computing platforms. Phoenix’s superior performance is due to the merging of high-performance computing with data analytic.

Kurte, Kuldeep↗

Efficiently embedding QUBO problems on adiabatic quantum computers

Adiabatic quantum computers like the D-Wave 2000Q can approximately solve the QUBO problem, which is an NP-hard problem, and have been shown to outperform classical computers on several instances. Solving the QUBO problem literally means solving virtually any NP-hard problem like the traveling salesman problem, airline scheduling problem, protein folding problem, genotype imputation problem, thereby enabling significant scientific progress, and potentially saving millions/billions of dollars in logistics, airlines, healthcare and many other industries. Yet, before QUBO problems are solved on quantum computers, they must be embedded (or compiled) onto the hardware of quantum computers, which in itself is a very hard problem. Here, we propose an efficient embedding algorithm, that lets us embed QUBO problems fast, uses less qubits and gets the objective function value close to the global minimum value. We then compare the performance of our embedding algorithm to that of D-Wave’s embedding algorithm, which is the current state of the art, and show that our embedding algorithm convincingly outperforms D-Wave’s embedding algorithm. Our embedding approach works with perfect Chimera graphs, i.e., Chimera graphs with no missing qubits.

97 MATHEMATICS AND COMPUTING↗

Benchmark Comparison for a Multi-Processing Ion Mobility Calculator in the Free Molecular Regime

A benchmark comparison between two ion mobility and collision cross-section (CCS) calculators, MOBCAL and IMoS, is presented here as a standard to test the efficiency and performance of both programs. Utilizing 47 organic ions, results are in excellent agreement between IMoS and MOBCAL in He and N{sub 2,} when both programs use identical input parameters. Due to a more efficiently written algorithm and to its parallelization, IMoS is able to calculate the same CCS (within 1%) with a speed around two orders of magnitude faster than its MOBCAL counterpart when seven cores are used. Due to the high computational cost of MOBCAL in N{sub 2}, reaching tens of thousands of seconds even for small ions, the comparison between IMoS and MOBCAL is stopped at 70 atoms. Large biomolecules (>10000 atoms) remain computationally expensive when IMoS is used in N{sub 2} (even when employing 16 cores). Approximations such as diffuse trajectory methods (DHSS, TDHSS) with and without partial charges and projected area approximation corrections can be used to reduce the total computational time by several folds without hurting the accuracy of the solution. These latter methods can in principle be used with coarse-grained model structures and should yield acceptable CCS results. .

46 INSTRUMENTATION RELATED TO NUCLEAR SCIENCE AND ↗

A modified iterative method for split problem of variational inclusions and fixed point problems

In this paper, we study a new split problem of variational inclusions and fixed point problems. With the help of averaged mappings, we introduce a new iterative method to solve the stated split problem. Strong convergence results are obtained under mild conditions. Also, we present some preliminary numerical examples to demonstrate the convergence and efficiency of our proposed algorithms.

97 MATHEMATICS AND COMPUTING↗

Definition and solution of a stochastic inverse problem for the Manning’s n parameter field in hydrodynamic models

The uncertainty in spatially heterogeneous Manning’s n fields is quantified using a novel formulation and numerical solution of stochastic inverse problems for physics-based models. The uncertainty is quantified in terms of a probability measure and the physics-based model considered here is the state-of-the-art ADCIRC model although the presented methodology applies to other hydrodynamic models. An accessible overview of the formulation and solution of the stochastic inverse problem in a mathematically rigorous framework based on measure theory is presented in this paper. Technical details that arise in practice by applying the framework to determine the Manning’s n parameter field in a shallow water equation model used for coastal hydrodynamics are presented and an efficient computational algorithm and open source software package are developed. A new notion of “condition” for the stochastic inverse problem is defined and analyzed as it relates to the computation of probabilities. Finally, this notion of condition is investigated to determine effective output quantities of interest of maximum water elevations to use for the inverse problem for the Manning’s n parameter and the effect on model predictions is analyzed.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Topological insulators and C*-algebras: Theory and numerical practice

Research Highlights: > We classify topological insulators using C* algebras. > We present new K-theory invariants. > We develop efficient numerical algorithms based on this technique. > We observe unexpected quantum phase transitions using our algorithm. - Abstract: We apply ideas from C*-algebra to the study of disordered topological insulators. We extract certain almost commuting matrices from the free Fermi Hamiltonian, describing band projected coordinate matrices. By considering topological obstructions to approximating these matrices by exactly commuting matrices, we are able to compute invariants quantifying different topological phases. We generalize previous two dimensional results to higher dimensions; we give a general expression for the topological invariants for arbitrary dimension and several symmetry classes, including chiral symmetry classes, and we present a detailed K-theory treatment of this expression for time reversal invariant three dimensional systems. We can use these results to show non-existence of localized Wannier functions for these systems. We use this approach to calculate the index for time-reversal invariant systems with spin-orbit scattering in three dimensions, on sizes up to 12{sup 3}, averaging over a large number of samples. The results show an interesting separation between the localization transition and the point at which the average index (which can be viewed as an 'order parameter' for the topological insulator) begins to fluctuate from sample to sample, implying the existence of an unsuspected quantum phase transition separating two different delocalized phases in this system. One of the particular advantages of the C*-algebraic technique that we present is that it is significantly faster in practice than other methods of computing the index, allowing the study of larger systems. In this paper, we present a detailed discussion of numerical implementation of our method.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗