Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “Logging”

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 847 records · Page 47

Synthesis of single-qutrit circuits from Clifford+𝑅 gates

Here, we present two deterministic compilation algorithms for single-qutrit unitaries with O ( log 1 / ɛ ) gate depth. Each algorithm selects a nearby approximation to the target unitary and then exactly synthesizes the approximation over the Clifford + R basis. The first algorithm exhaustively searches over the group; while the second algorithm searches only for Householder reflections. The exhaustive search algorithm yields an average R count of 2.193 ( 11 ) + 8.621 ( 7 ) log 10 ( 1 / ɛ ) , albeit with a time complexity of O ( ɛ − 4.4 ) . The Householder search algorithm results in a larger average R count of 3.20 ( 13 ) + 10.77 ( 3 ) log 10 ( 1 / ɛ ) at a reduced time complexity of O ( ɛ − 0.42 ) , greatly extending the reach in ɛ . These costs correspond asymptotically to 35% and 69% more non-Clifford gates compared with synthesizing the same unitary with two qubits. Such initial results are encouraging for using the R gate as the nontransversal gate for qutrit-based computation.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Spectral-density estimation with the Gaussian integral transform

The spectral-density operator $\hat{ρ}(ω) = δ(ω–\hat{H})$ plays a central role in linear response theory as its expectation value, the dynamical response function, can be used to compute scattering cross sections. In this work, we describe a near optimal quantum algorithm providing an approximation to the spectral density with energy resolution $\Delta$ and error $\epsilon$ using $O(\sqrt{\text{log}_2 (1/ε)[\text{log}_2 (1 / Δ) + \text{log}_2 (1/ε)]/ Δ)}$ operations. This is achieved without using expensive approximations to the time-evolution operator, but instead exploiting qubitization to implement an approximate Gaussian integral transform of the spectral density. Finally, we also describe appropriate error metrics to assess the quality of the spectral function approximations more generally.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Digitization of scalar fields for quantum computing

Qubit, operator, and gate resources required for the digitization of lattice λΦ 4 scalar field theories onto quantum computers are considered, building upon the foundational work by Jordan et al. [Quantum Inf. Comput. 14, 1014 (2014); Science 336, 1130 (2012)], with a focus towards noisy intermediate-scale quantum devices. The Nyquist-Shannon sampling theorem, introduced in this context by Macridin et al. [Phys. Rev. A 98, 042312 (2018)] building on the work of Somma [Quantum Inf. Comput. 16, 1125 (2016)], provides a guide with which to evaluate the efficacy of two field-space bases, the eigenstates of the field operator, as used by Jordan et al., and eigenstates of a harmonic oscillator, to describe ( 0 + 1 )- and ( d + 1 )-dimensional scalar field theory. We show how techniques associated with improved actions, which are heavily utilized in lattice QCD calculations to systematically reduce lattice-spacing artifacts, can be used to reduce the impact of the field digitization in λΦ 4 , but are found to be inferior to a complete digitization improvement of the Hamiltonian using a quantum Fourier transform. When the Nyquist-Shannon sampling theorem is satisfied, digitization errors scale as | log | log | ε dig | | | ~ n Q (number of qubits describing the field at a given spatial site) for the low-lying states, leaving the familiar power-law lattice-spacing and finite-volume effects that scale as | log | ε latt | | ~ N Q (total number of qubits in the simulation). For localized (delocalized) field-space wave functions, it is found that n Q ~ 4 ( 7 ) qubits per spatial lattice site are sufficient to reduce theoretical digitization errors below error contributions associated with approximation of the time-evolution operator and noisy implementation on near-term quantum devices. Only classical computing resources have been used to obtain the results presented in this work.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Constraints on f ( R ) and normal-branch Dvali-Gabadadze-Porrati modified gravity model parameters with cluster abundances and galaxy clustering

In this report we present forecasted cosmological constraints from combined measurements of galaxy cluster abundances from the Simons Observatory and galaxy clustering from a DESI-like experiment on two well-studied modified gravity models, the chameleon-screened Hu-Sawicki f(R) model and the nDGP braneworld Vainshtein model. A Fisher analysis is conducted using σ 8 constraints derived from thermal Sunyaev-Zel’dovich (tSZ) selected galaxy clusters as well as linear and quasilinear redshift-space 2-point galaxy correlation functions. We find that the cluster abundances drive the constraints on the nDGP model while f(R) constraints are led by galaxy clustering. The two tracers of the cosmological gravitational field are found to be complementary, and their combination significantly improves constraints on the f(R) in particular in comparison to each individual tracer alone. For a model of f(R) with a general relativity (GR) fiducial case (f R0 = 0), we find a 2-σ upper limit of f R0 ≤ 5.68 x10 -7 . For the well-studied log-based fiducial parameter value in f(R), log 10 (f R0 ) = -5, paired with the parameter value n = 1, we find combined 1-σ constraints of σ(log 10 (f R0 )) = 0.12 and σ(n) = 0.36. For the nDGP model with fiducial n nDGP = 1 we find σ( n nDGP ) = 0.087. Our results present the exciting potential to utilize upcoming galaxy and CMB survey data available in the near future to discern and/or constrain cosmic deviations from GR.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Realistic lattice determination of {alpha}{sub s}(M{sub Z}) revisited

We revisit the earlier determination of {alpha}{sub s}(M{sub Z}) via perturbative analyses of short-distance-sensitive lattice observables, incorporating new lattice data and performing a modified version of the original analysis. We focus on two high-intrinsic-scale observables, log(W{sub 11}) and log(W{sub 12}), and one lower-intrinsic-scale observable, log(W{sub 12}/u{sub 0}{sup 6}), finding improved consistency among the values extracted using the different observables and a final result, {alpha}{sub s}(M{sub Z})=0.1192{+-}0.0011, {approx}2{sigma} higher than the earlier result, in excellent agreement with recent nonlattice determinations and, in addition, in good agreement with the results of a similar, but not identical, reanalysis by the HPQCD Collaboration. A discussion of the relation between the two reanalyses is given, focusing on the complementary aspects of the two approaches.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Factorization structure of gauge theory amplitudes and application to hard scattering processes at the LHC

Previous work on electroweak radiative corrections to high-energy scattering using soft-collinear effective theory (SCET) has been extended to include external transverse and longitudinal gauge bosons and Higgs bosons. This allows one to compute radiative corrections to all parton-level hard scattering amplitudes in the standard model to next-to-leading-log order, including QCD and electroweak radiative corrections, mass effects, and Higgs exchange corrections, if the high-scale matching, which is suppressed by two orders in the log counting, and contains no large logs, is known. The factorization structure of the effective theory places strong constraints on the form of gauge theory amplitudes at high energy for massless and massive gauge theories, which are discussed in detail in the paper. The radiative corrections can be written as the sum of process-independent one-particle collinear functions, and a universal soft function. We give plots for the radiative corrections to qq{yields}W{sub T}W{sub T}, Z{sub T}Z{sub T}, W{sub L}W{sub L}, and Z{sub L}H, and gg{yields}W{sub T}W{sub T} to illustrate our results. The purely electroweak corrections are large, ranging from 12% at 500 GeV to 37% at 2 TeV for transverse W pair production, and increasing rapidly with energy. The estimated theoretical uncertainty to the partonic (hard) cross section in most cases is below 1%, smaller than uncertainties in the parton distribution functions. We discuss the relation between SCET and other factorization methods, and derive the Magnea-Sterman equations for the Sudakov form factor using SCET, for massless and massive gauge theories, and for light and heavy external particles.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Soft-Collinear Mode for Jet Rates in Soft-Collinear Effective Theory

We propose the addition of a new "soft-collinear" mode to soft collinear effective theory (SCET) below the usual soft scale to factorize and resum logarithms of jet radii R in jet cross sections. We consider exclusive 2-jet cross sections in e + e - collisions with an energy veto Λ on additional jets. The key observation is that there are actually two pairs of energy scales whose ratio is R: the transverse momentum QR of the energetic particles inside jets and their total energy Q, and the transverse momentum ΛR of soft particles that are cut out of the jet cones and their energy Λ. The soft-collinear mode is necessary to factorize and resum logarithms of the latter hierarchy. We show how this factorization occurs in the jet thrust cross section for cone and k T -type algorithms at O(α s ) and using the thrust cone algorithm at O(α$2\atop{s}$). We identify the presence of hard-collinear, in-jet soft, global (veto) soft, and soft-collinear modes in the jet thrust cross section. We also observe here that the in-jet soft modes measured with thrust are actually the "csoft" modes of the theory SCET + . We dub the new theory with both csoft and soft-collinear modes "SCET ++ ". We go on to explain the relation between the "unmeasured" jet function appearing in total exclusive jet cross sections and the hard-collinear and csoft functions in measured jet thrust cross sections. We do not resum logs that are non-global in origin, arising from the ratio of the scales of soft radiation whose thrust is measured at Q${{\tau}}$/R and of the soft-collinear radiation at 2ΛR. Their resummation would require the introduction of additional operators beyond those we consider here. The steps we outline here are a necessary part of summing logs of R that are global in nature and have not been factorized and resummed beyond leading-log level previously.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Slow dynamics in a single bead with mechanical conditioning and transient heating

The contact stiffness of an aluminum bead confined between two slabs diminishes upon mechanical conditioning, and then recovers like log(t) after the conditioning ceases. Here that structure is evaluated for its response to transient heating and cooling, with and without accompanying conditioning vibrations. It is found that, under heating or cooling alone, stiffness changes are mostly consistent with temperature dependent material moduli; there is little or no slow dynamics. Hybrid tests in which vibration conditioning is followed by heating or cooling lead to recoveries that begin like log(t) and then become more complex. On subtracting the known response to heating or cooling alone we discern the influence of higher or lower temperatures on slow dynamic recovery from vibrations. It is found that heating accelerates the initial log(t) recovery, but by an amount more than predicted by an Arrhenius model of thermally activated barrier penetrations. Furthermore, transient cooling has no discernable effect, in contrast to the Arrhenius prediction that it slows recovery.

36 MATERIALS SCIENCE↗

Measurement of Bottom Versus Charm as a Function of Transverse Momentum with Electron-Hadron Correlations in p+p Collisions at sq root(s)=200 GeV

The momentum distribution of electrons from semileptonic decays of charm and bottom quarks for midrapidity |y|<0.35 in p+p collisions at sq root(s)=200 GeV is measured by the PHENIX experiment at the Relativistic Heavy Ion Collider over the transverse momentum range 2<p{sub T}<7 GeV/c. The ratio of the yield of electrons from bottom to that from charm is presented. The ratio is determined using partial D/D->e{sup +}-K{sup +}-X (K unidentified) reconstruction. It is found that the yield of electrons from bottom becomes significant above 4 GeV/c in p{sub T}. A fixed-order-plus-next-to-leading-log perturbative quantum chromodynamics calculation agrees with the data within the theoretical and experimental uncertainties. The extracted total bottom production cross section at this energy is sigma{sub bb}=3.2{sub -1.1}{sup +1.2}(stat){sub -1.3}{sup +1.4}(syst)mub.

72 PHYSICS OF ELEMENTARY PARTICLES AND FIELDS↗

Rodeo Algorithm for Quantum Computing

We present a stochastic quantum computing algorithm that can prepare any eigenvector of a quantum Hamiltonian within a selected energy interval $\ [E-\epsilon, E+\epsilon]$. In order to reduce the spectral weight of all other eigenvectors by a suppression factor δ, the required computational effort scales as $\ O[|\log \delta|/(p \epsilon)]$, where p s the squared overlap of the initial state with the target eigenvector. The method, which we call the rodeo algorithm, uses auxiliary qubits to control the time evolution of the Hamiltonian minus some tunable parameter E . In this manner, we converge to the target eigenvector with exponential accuracy in the number of measurements. In addition to preparing eigenvectors, the method can also compute the full spectrum of the Hamiltonian. We illustrate the performance with several examples. For energy eigenvalue determination with error $\epsilon$, the computational scaling is $\ O[(\log \epsilon)^2/(p \epsilon)]$. For eigenstate preparation, the computational scaling is $\ O(\log \Delta/p)$, where $\Delta$ is the magnitude of the orthogonal component of the residual vector. The speed for eigenstate preparation is exponentially faster than that for phase estimation or adiabatic evolution.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Generalized Quantum Signal Processing

Quantum signal processing (QSP) and quantum singular value transformation (QSVT) currently stand as the most efficient techniques for implementing functions of block-encoded matrices, a central task that lies at the heart of most prominent quantum algorithms. However, current QSP approaches face several challenges, such as the restrictions imposed on the family of achievable polynomials and the difficulty of calculating the required phase angles for specific transformations. In this paper, we present a generalized quantum signal processing (GQSP) approach, employing general SU(2) rotations as our signal-processing operators, rather than relying solely on rotations in a single basis. Our approach lifts all practical restrictions on the family of achievable transformations, with the sole remaining condition being that | P | ≤ 1 , a restriction necessary due to the unitary nature of quantum computation. Furthermore, GQSP provides a straightforward recursive formula for determining the rotation angles needed to construct the polynomials in cases where P and Q are known. In cases where only P is known, we provide an efficient optimization algorithm capable of identifying in under a minute of GPU time, a corresponding Q for polynomials of degree on the order of 10 7 . We further illustrate GQSP simplifies QSP-based strategies for Hamiltonian simulation, offer an optimal solution to the ϵ -approximate fractional query problem that requires O ( ( 1 / δ ) + log ( 1 / ϵ ) ) queries to perform where O ( 1 / δ ) is a proved lower bound, and introduces novel approaches for implementing bosonic operators. Moreover, we propose a novel framework for the implementation of normal matrices, demonstrating its applicability through synthesis of diagonal matrices, as well as the development of a new algorithm for convolution through synthesis of circulant matrices using only O ( d log N + log 2 N ) 1 and 2-qubit gates for a filter of lengths d . Published by the American Physical Society 2024

Motlagh, Danial↗

Malicious Cyber Activity Detection using Zigzag Persistence

In this study we synthesize zigzag persistence from topological data analysis with autoencoder-based approaches to detect malicious cyber activity, and derive analytic insights. Cybersecurity aims to safeguard computers, networks, and servers from various forms of malicious attacks, including network damage, data theft, and activity monitoring. We focus on the cybersecurity domain and investigate the detection of malicious activity using log data. We consider the dynamics of the log data and explore the changing topology of a hypergraph representation of this data to gain insights into the underlying activity. These hypergraphs capture complex interactions between processes, together with their temporal information. To study the changing topology we use zigzag persistence, which captures how topological features persist at multiple dimensions over time. We observe that this detects malicious activity in a cyber data set. To automate this detection we implement an autoencoder trained on a vectorization of the resulting zigzag persistence barcodes. Our experimental results demonstrate the effectiveness of the autoencoder in detecting malicious activity. Overall, this study highlights the potential of zigzag persistence and its combination with temporal hypergraphs for analyzing cybersecurity log data and detecting malicious behavior.

hypergraphs, temporal hypergraph, topological data↗

Combining Tensor Decompositions and Graph Analytics to Provide Cyber Situational Awareness at HPC Scale

This paper describes MADHAT (Multidimensional Anomaly Detection fusing HPC, Analytics, and Tensors), an integrated workflow that demonstrates the applicability of HPC resources to the problem of maintaining cyber situational awareness. MADHAT combines two high-performance packages: ENSIGN for large-scale sparse tensor decompositions and HAGGLE for graph analytics. Tensor decompositions isolate coherent patterns of network behavior in ways that common clustering methods based on distance metrics cannot. Parallelized graph analysis then uses directed queries on a representation that combines the elements of identified patterns with other available information (such as additional log fields, domain knowledge, network topology, whitelists and blacklists, prior feedback, and published alerts) to confirm or reject a threat hypothesis, collect context, and raise alerts. MADHAT was developed using the collaborative HPC Architecture for Cyber Situational Awareness (HACSAW) research environment and evaluated on structured network sensor logs collected from Defense Research and Engineering Network (DREN) sites using HPC resources at the U.S. Army Engineer Research and Development Center DoD Supercomputing Resource Center (ERDC DSRC). To date, MADHAT has analyzed logs with over 650 million entries.

Cyber security, Tensor decomposition, graph analyt↗

Understanding the Interplay between Hardware Errors and User Job Characteristics on the Titan Supercomputer

Designing dependable supercomputers begins with an understanding of errors in real-world, large-scale systems. The Titan supercomputer at Oak Ridge National Laboratory provides a unique opportunity to investigate errors when an actual system is actively used by multiple concurrent users and workloads from diverse domains at varying scales. This study presents a thorough analysis of 6, 908, 497 hardware errors from 18, 688 compute nodes of Titan for 312, 215 user jobs over a 3-year time period. Through careful joining of two system logs – the Machine Check Architecture (MCA) log and the job scheduler log – we show the correlated pattern of hardware errors for each job and user, in addition to individual descriptive statistics of errors, jobs, and users. Since the majority of hardware errors are memory errors, this study also shows the importance of error correcting in memory systems.

Lim, Seung-Hwan↗

PATHA: Performance Analysis Tool for HPC Applications

Large science projects rely on complex workflows to analyze terabytes or petabytes of data. These jobs are often running over thousands of CPU cores and simultaneously performing data accesses, data movements, and computation. It is difficult to identify bottlenecks or to debug the performance issues in these large workflows. In order to address these challenges, we have developed Performance Analysis Tool for HPC Applications (PATHA) using the state-of-art open source big data processing tools. Our framework can ingest system logs to extract key performance measures, and apply the most sophisticated statistical tools and data mining methods on the performance data. Furthermore, it utilizes an efficient data processing engine to allow users to interactively analyze a large amount of different types of logs and measurements. To illustrate the functionality of PATHA, we conduct a case study on the workflows from an astronomy project known as the Palomar Transient Factory (PTF). This study processed 1.6 TB of system logs collected on the NERSC supercomputer Edison. Using PATHA, we were able to identify performance bottlenecks, which reside in three tasks of PTF workflow with the dependency on the density of celestial objects.

96 KNOWLEDGE MANAGEMENT AND PRESERVATION↗

Salmonella Inactivation During Extrusion of an Oat Flour Model Food

Abstract Little research exists on Salmonella inactivation during extrusion processing, yet many outbreaks associated with low water activity foods since 2006 were linked to extruded foods. The aim of this research was to study Salmonella inactivation during extrusion of a model cereal product. Oat flour was inoculated with Salmonella enterica serovar Agona, an outbreak strain isolated from puffed cereals, and processed using a single‐screw extruder at a feed rate of 75 kg/h and a screw speed of 500 rpm. Extrudate samples were collected from the barrel outlet in sterile bags and immediately cooled in an ice–water bath. Populations were determined using standard plate count methods or a modified most probable number when populations were low. Reductions in population were determined and analyzed using a general linear model. The regression model obtained for the response surface tested was Log ( N R / N O ) = 20.50 + 0.82 T − 141.16a w – 0.0039 T 2 + 87.91 a w 2 ( R 2 = 0.69). The model showed significant ( p < 0.05) linear and quadratic effects of a w and temperature and enabled an assessment of critical control parameters. Reductions of 0.67 ± 0.14 to 7.34 ± 0.02 log CFU/g were observed over ranges of a w (0.72 to 0.96) and temperature (65 to 100 °C) tested. Processing conditions above 82 °C and 0.89 a w achieved on average greater than a 5‐log reduction of Salmonella . Results indicate that extrusion is an effective means for reducing Salmonella as most processes commonly employed to produce cereals and other low water activity foods exceed these parameters. Thus, contamination of an extruded food product would most likely occur postprocessing as a result of environmental contamination or through the addition of coatings and flavorings.

Anderson, Nathan M.↗

Biofilm Detection in a Model Well-Bore Environment Using Low-Field NMR

This research addresses the challenges of the lack of non-invasive methods and poor spatiotemporal resolution associated with monitoring biogeochemical activity central to bioremediation of subsurface contaminants. Remediation efforts often include growth of biofilm to contain or degrade chemical contaminants, such as nitrates, hydrocarbons, heavy metals, and some chlorinated solvents. Previous research indicates that nuclear magnetic resonance (NMR) is sensitive to the biogeochemical processes of biofilm accumulation. The current research focuses on developing methods to use low-cost NMR technology to support in situ monitoring of biofilm growth and geochemical remediation processes in the subsurface. Biofilm was grown in a lab-scale radial flow bioreactor designed to model the near wellbore subsurface environment. The Vista Clara Javelin NMR logging device, a slim down-the-borehole probe, collected NMR measurements over the course of eight days while biofilm was cultivated in the sand-packed reactor. Measured NMR mean log T 2 relaxation times decreased from approximately 710 to 389 ms, indicating that the pore environment and bulk fluid properties were changing due to biofilm growth. Destructive sampling employing drop plate microbial population analysis and scanning electron and stereoscopic microscopy confirmed biofilm formation. Here our findings demonstrate that the NMR logging tool can detect small to moderate changes in T 2 distribution associated with environmentally relevant quantities of biofilm in quartz sand.

58 GEOSCIENCES↗

Morphological traits for allometric scaling of the European Sea Bass Dicentrarchus labrax (Linnaeus, 1758) from Southern Portugal population

Abstract The present study aimed to determine the allometric scaling among a selection of morphological traits in European sea bass ( Dicentrarchus labrax ) to estimate fish body weight. A set of morphological traits (fish body weight, length, height, and width) were directly measured in 146 fish of a recirculating aquaculture system, with body weights ranging from 17.11 to 652.21 g. In addition, a collection of digital imagery of each anesthetized fish from the side and top views were used to estimate other traits (indirect measures). Multiple regression analysis and regression coefficients were calculated using all possible combinations of biometric data (predictors) to estimate fish body weight, applying different numerical fitting models (linear, log‐linear, quadratic, exponential). The results showed that the best combination of traits for estimating fish body weight were fish body width, length and height, collected from direct measure ( R 2 = 0.995), for a log‐linear model fitting, which revealed more accurate determinations than the most commonly used length–weight relationship. Nevertheless, other combinations of morphological traits and fitting models were also found to be suitable in successfully predict fish body weight, with variability ranging between 92.5% and 98.5%. For indirect measures, the best predictor was a combination of traits from top view (width, eye distance and area without fins) fitted with a log‐linear function. These results comprise a relevant baseline in supporting the high potential of noninvasive methods to accurately follow the growth of European sea bass juveniles, recurring to imagery analysis of anesthetized fish. It has major potential applications in feeding consumption trials and fish growth models, as it allows for continuously following up fish growth under different experimental conditions without therein distress derived from manipulation.

Azevedo, Ana↗