Engineering Papers⌕ Search

SEARCH · Engineering Papers

Results for “logs”

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 397 records · Page 22

The frequency and sizes of inner bars and nuclear rings in barred galaxies and their dependence on galaxy properties

ABSTRACT Using a volume- and mass-limited (D < 30 Mpc, $\log \, (M_{\star }/M_{\odot })\ge 9.75$) sample of 155 barred S0–Sd galaxies, I determine the fraction with secondary structures within their bars. Some 20 ± 3 per cent have a separate inner bar, making them double-barred; an identical fraction have nuclear rings, with $11^{+3}_{-2}$ per cent hosting both. The inner-bar frequency is a strong, monotonic function of stellar mass: only $4^{+3}_{-2}$ per cent of barred galaxies with $\log \, (M_{\star }/M_{\odot })= 9.75$–10.25 are double-barred, while 47 ± 8 per cent of those with $\log \, (M_{\star }/M_{\odot })\gt 10.5$ are. The nuclear-ring frequency is a strong function of absolute bar size: only $1^{+2}_{-1}$ per cent of bars with semimajor axes <2 kpc have nuclear rings, while $39^{+6}_{-5}$ per cent of larger bars do. Both inner bars and nuclear rings are absent in very late-type (Scd–Sd) galaxies. Inner bar size correlates with galaxy stellar mass, but is clearly offset to smaller sizes from the main population of bars. This makes it possible to define ‘nuclear bars’ in a consistent fashion, based on stellar mass. There are eight single-barred galaxies where the bars are nuclear-bar-sized; some of these may be systems where an outer bar failed to form, or previously double-barred galaxies where the outer bar has dissolved. Inner bar size is even more tightly correlated with host bar size, which is likely the primary driver. In contrast, nuclear ring size is only weakly correlated with galaxy mass or bar size, with more scatter in size than is true of inner bars.

Astronomy & Astrophysics↗

Probing supermassive black hole growth and its dependence on stellar mass and star formation rate in low-redshift galaxies

ABSTRACT We present an improved study of the relation between supermassive black hole growth and their host galaxy properties in the local Universe (z < 0.33). To this end, we build an extensive sample combining spectroscopic measurements of star formation rate (SFR) and stellar mass from Sloan Digital Sky Survey, with specific Black Hole accretion rate (sBHAR, $\lambda _{\mathrm{sBHAR}} \propto L_{\rm X}/\mathcal {M}_{\ast }$) derived from the XMM–Newton Serendipitous Source Catalogue (3XMM–DR8) and the Chandra Source Catalogue (CSC2.0). We find that the sBHAR probability distribution for both star-forming and quiescent galaxies has a power-law shape peaking at log λsBHAR ∼ −3.5 and declining towards lower sBHAR in all stellar mass ranges. This finding confirms the decrease of active galactic nucleus (AGN) activity in the local Universe compared to higher redshifts. We observe a significant correlation between $\log \, \lambda _{\rm sBHAR}$ and $\log \, {\rm SFR}$ in almost all stellar mass ranges, but the relation is shallower compared to higher redshifts, indicating a reduced availability of accreting material in the local Universe. At the same time, the BHAR-to-SFR ratio for star-forming galaxies strongly correlates with stellar mass, supporting the scenario where both AGN activity and stellar formation primarily depend on the stellar mass via fuelling by a common gas reservoir. Conversely, this ratio remains constant for quiescent galaxies, possibly indicating the existence of the different physical mechanisms responsible for AGN fuelling or different accretion mode in quiescent galaxies.

Torbaniuk, O. (ORCID:0000000344652564)↗

A strong blend in the morning: studying the circumgalactic medium before cosmic noon with strong, blended Ly α forest systems

ABSTRACT We study of the properties of a new class of circumgalactic medium absorbers identified in the Ly α forest: ‘Strong, Blended Lyman-α’ (or SBLA) absorption systems. We study SBLAs at 2.4 < z < 3.1 in SDSS-IV/eBOSS spectra by their strong extended Ly α absorption complexes covering 138 $\, \, {\rm km}\, {\rm s}^{-1}$ with an integrated $\log (N_{\rm H\, {\small I}}/\mathrm{cm}^{-2}) =16.04$$\substack{+0.05 \\ -0.06}$ and Doppler parameter b = 18.1$\substack{+0.7 \\ -0.4}$$\, \, {\rm km}\, {\rm s}^{-1}$. Clustering with the Ly α forest provides a large-scale structure bias of b = 2.34 ± 0.06 and halo mass estimate of $M_h \approx 10^{12}\, h^{-1}\, {\rm M_{\odot }}$ for our SBLA sample. We measure the ensemble mean column densities of 22 metal features in the SBLA composite spectrum and find that no single-population multiphase model for them is viable. We therefore explore the underlying SBLA population by forward modelling the SBLA absorption distribution. Based on covariance measurements and favoured populations we find that ≈25 per cent of our SBLAs have stronger metals. Using silicon only we find that our strong metal SBLAs trace gas with a log (nH/cm−3) > −2.40 for T = 103.5 K and show gas clumping on <210 parsec scales. We fit multiphase models to this strong subpopulation and find a low ionization phase with nH = 1 cm−3, T = 103.5 K, and [X/H] = 0.8, an intermediate ionization phase with log (nH/cm−3) = −3.05, T = 103.5 K and [X/H] = −0.8, and a poorly constrained higher ionization phase. We find that the low ionization phase favours cold, dense super-solar metallicity gas with a clumping scale of just 0.009 parsecs.

Morrison, Sean (ORCID:0000000267702627)↗

Atmospheric parameters and chemical abundances within 100 pc: a sample of G, K, and M main-sequence stars

ABSTRACT To date, we have access to enormous inventories of stellar spectra that allow the extraction of atmospheric parameters and chemical abundances essential in stellar studies. However, characterizing such a large amount of data is complex and requires a good understanding of the studied object to ensure reliable and homogeneous results. In this study, we present a methodology to measure homogenously the basic atmospheric parameters and detailed chemical abundances of over 1600 thin disc main-sequence stars in the 100 pc solar neighbourhood, using APOGEE-2 infrared spectra. We employed the code tonalli to determine the atmospheric parameters using a prior on $\log {g}$. The $\log {g}$ prior in tonalli implies an understanding of the treated population and helps to find physically coherent answers. Our atmospheric parameters agree within the typical uncertainties (100 K in $\mathrm{T_{eff}}$, 0.15 dex in $\log {g}$ and [M/H]) with previous estimations of ASPCAP and Gaia DR3. We use our temperatures to determine a new infrared colour–temperature sequence, in good agreement with previous works, that can be used for any main-sequence star. Additionally, we used the bacchus code to determine the abundances of Mg, Al, Si, Ca, and Fe in our sample. The five elements (Mg, Al, Si, Ca, Fe) studied have an abundance distribution centred around slightly subsolar values in agreement with previous results for the solar neighbourhood. The over 1600 main-sequence stars’ atmospheric parameters and chemical abundances presented here are useful in follow-up studies of the solar neighbourhood or as a training set for data-driven methods.

López-Valdivia, Ricardo (ORCID:0000000277950018)↗

The DESI one-per cent survey: exploring the halo occupation distribution of luminous red galaxies and quasi-stellar objects with AbacusSummit

ABSTRACT We present the first comprehensive halo occupation distribution (HOD) analysis of the Dark Energy Spectroscopic Instrument (DESI) One-Percent Survey luminous red galaxy (LRG) and Quasi Stellar Object (QSO) samples. We constrain the HOD of each sample and test possible HOD extensions by fitting the redshift-space galaxy 2-point correlation functions in 0.15 < r < 32 h−1 Mpc in a set of fiducial redshift bins. We use AbacusSummit cubic boxes at Planck 2018 cosmology as model templates and forward model galaxy clustering with the AbacusHOD package. We achieve good fits with a standard HOD model with velocity bias, and we find no evidence for galaxy assembly bias or satellite profile modulation at the current level of statistical uncertainty. For LRGs in 0.4 < z < 0.6, we infer a satellite fraction of $f_\mathrm{sat} = 11\pm 1~{y{\ \mathrm{per\,cent}}}$, a mean halo mass of $\log _{10}\overline{M}_h/M_\odot =13.40^{+0.02}_{-0.02}$, and a linear bias of $b_\mathrm{lin} = 1.93_{-0.04}^{+0.06}$. For LRGs in 0.6 < z < 0.8, we find $f_\mathrm{sat}=14\pm 1~{{\ \mathrm{per\,cent}}}$, $\log _{10}\overline{M}_h/M_\odot =13.24^{+0.02}_{-0.02}$, and $b_\mathrm{lin}=2.08_{-0.03}^{+0.03}$. For QSOs, we infer $f_\mathrm{sat}=3^{+8}_{-2}\mathrm{per\,cent}$, $\log _{10}\overline{M}_h/M_\odot = 12.65^{+0.09}_{-0.04}$, and $b_\mathrm{lin} = 2.63_{-0.26}^{+0.37}$ in redshift range 0.8 < z < 2.1. Using these fits, we generate a large suite of high fidelity galaxy mocks, forming the basis of systematic tests for DESI Y1 cosmological analyses. We also study the redshift-evolution of the DESI LRG sample from z = 0.4 up to z = 1.1, revealling significant and interesting trends in mean halo mass, linear bias, and satellite fraction.

79 ASTRONOMY AND ASTROPHYSICS↗

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↗

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↗

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↗

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↗

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↗

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↗

Fate of Listeria monocytogenes Serotypes on Frozen Mixed Vegetables During Consumer‐Simulated Thawing and Storage

ABSTRACT Recent outbreaks and recalls associated with frozen vegetables in the United States and Europe have been linked to Listeria monocytogenes . This study aims to understand the extent to which frozen vegetables support the growth of L. monocytogenes once thawed and held at different temperatures. Six L. monocytogenes strains, two of each from serotypes 1/2a, 1/2b, and 4b, were individually inoculated onto frozen vegetables and stored at −18°C for 7 days. After 7 days, the vegetables were thawed and stored at 5°C or 10°C for up to 14 days or at 25°C for up to 7 days. L. monocytogenes was enumerated from the thawed vegetables throughout the storage period. Population data were fitted to the primary Baranyi model to estimate growth rates and lag phase durations; the secondary Ratkowsky square root model was used to model the relationship of the growth rates with storage temperature. Five of the L. monocytogenes strains survived and grew on the thawed vegetables (population increases of > 1 log CFU/g) stored at 5°C, and all six of the strains proliferated at 10°C and 25°C (population increases of > 3 log CFU/g after 14 days and > 4 log CFU/g after 7 days, respectively). A secondary model was successfully generated based on the growth rates of the six L. monocytogenes strains on the thawed vegetables ( r 2 = 0.8888, RMSE = 0.2057). Results from this study fill a data gap associated with L. monocytogenes survival on thawed vegetables and can be used to determine safe handling and storage practices for these products to protect public health.

Salazar, Joelle K. [Division of Food Processing Sc↗

Butterfly Factorization Via Randomized Matrix-Vector Multiplications

This paper presents an adaptive randomized algorithm for computing the butterfly factorization of an m × n matrix with m ≈ n provided that both the matrix and its transpose can be rapidly applied to arbitrary vectors. The resulting factorization is composed of O(log n) sparse factors, each containing O(n) nonzero entries. The factorization can be attained using O(n 3/2 log n) computation and O(n log n) memory resources. Furthermore, the proposed algorithm can be implemented in parallel and can apply to matrices with strong or weak admissibility conditions arising from surface integral equation solvers as well as multi-frontal-based finite-difference, finite-element, or finite-volume solvers. A distributed-memory parallel implementation of the algorithm demonstrates excellent scaling behavior.

97 MATHEMATICS AND COMPUTING↗

Statistical interpretation of sterile neutrino oscillation searches at reactors

A considerable experimental effort is currently under way to test the persistent hints for oscillations due to an eV-scale sterile neutrino in the data of various reactor neutrino experiments. The assessment of the statistical significance of these hints is usually based on Wilks’ theorem, whereby the assumption is made that the log-likelihood is χ 2 -distributed. However, it is well known that the preconditions for the validity of Wilks’ theorem are not fulfilled for neutrino oscillation experiments. In this work we derive a simple asymptotic form of the actual distribution of the log-likelihood based on reinterpreting the problem as fitting white Gaussian noise. From this formalism we show that, even in the absence of a sterile neutrino, the expectation value for the maximum likelihood estimate of the mixing angle remains non-zero with attendant large values of the log-likelihood. Our analytical results are then confirmed by numerical simulations of a toy reactor experiment. Finally, we apply this framework to the data of the Neutrino-4 experiment and show that the null hypothesis of no-oscillation is rejected at the 2.6 σ level, compared to 3.2 σ obtained under the assumption that Wilks’ theorem applies.

71 CLASSICAL AND QUANTUM MECHANICS, GENERAL PHYSIC↗

Brief Announcement: Communication Optimal Sparse LU Factorization for Planar Matrices

We introduce a new parallel algorithm for solving sparse LU factorization of planar matrices, which commonly arise in the finite element method for 2D PDEs. Existing scalable methods, such as the multifrontal approach with subtree-to-subcube mapping by Gupta et al. [1] and right-looking with 3D mapping by Sao et al. [2] fail to achieve optimal communication costs for these matrices. Our new algorithm combines 3D mapping and subtree-to-subcube mapping to minimize communication costs while allowing trade-offs between extra memory and reduced communication. We demonstrate that our proposed algorithm attains the communication lower bound up to a factor of O(log log n) in the memory-optimal case and up to a factor of O(log P) in the memory-independent case for an n-dimensional planar sparse matrix on P processors.

Sao, Piyush↗