Results 51 to 60 of about 5,105 (201)
Compile‐Once Block Encodings for Masked Similarity‐Transformed Effective Hamiltonians
Composer transforms structured electronic‐structure operators into a reusable quantum‐circuit fabric. Once compiled, the same block‐encoding architecture is re‐dialed through coefficients, rotation angles, and masks to generate similarity‐transformed effective Hamiltonians across related problem instances, avoiding repeated structural recompilation ...
Bo Peng, Yuan Liu, Karol Kowalski
wiley +1 more source
Local Asymmetric Least Squares (LAsLS) for Noisy and Complex Baseline Correction
ABSTRACT The asymmetric least squares (AsLS) method is commonly used and works well when baseline characteristics are relatively uniform, but can be less accurate for non‐uniform, complex, or noisy baselines. Here, we present local AsLS (LAsLS), a local extension of AsLS that preserves the original penalized least‐squares framework while allowing ...
Adrián Gómez‐Sánchez +2 more
wiley +1 more source
An Algebraic Solution for the Candecomp/PARAFAC Decomposition with Circulant Factors [PDF]
The Candecomp/PARAFAC decomposition (CPD) is an important mathematical tool used in several fields of application. Yet, its computation is usually performed with iterative methods which are subject to reaching local minima and to exhibiting slow convergence.
de Morais Goulart, José Henrique +1 more
openaire +3 more sources
Angle-Polarization Estimation for Coherent Sources with Linear Tripole Sensor Arrays
We propose a parallel factor (PARAFAC) analysis-based angle and polarization estimation algorithm for multiple coherent sources using a uniformly-spaced linear tripole sensor array.
Kun Wang, Jin He, Ting Shu, Zhong Liu
doaj +1 more source
Efficient Tensor Completion Algorithms for Highly Oscillatory Operators
ABSTRACT We address the problem of recovering highly oscillatory operators, represented as n×n$$ n\times n $$ matrices with a fixed set of observed entries. Given that these matrices can be well compressed by butterfly matrix decomposition of L=𝒪(logn) levels requiring only O(nlogn)$$ O\left(n\log n\right) $$ degrees of freedom, we propose a novel ...
Navjot Singh +3 more
wiley +1 more source
Tensor Decomposition for Fast Parsing with Latent-Variable PCFGs [PDF]
We describe an approach to speed-up inference with latent-variable PCFGs, whichhave been shown to be highly effective for natural language parsing. Our approachis based on a tensor formulation recently introduced for spectral estimation oflatent-variable
Collins, Michael, Cohen, Shay
core
Carbon quantum dots engineered through heteroatom doping and surface functionalization enable selective tetracycline sensing via fluorescence modulation. Integration of machine learning with portable sensing platforms enhances discrimination accuracy, matrix tolerance, and real‐world applicability for intelligent antibiotic monitoring in food and ...
Mohamed Abu Shuheil +8 more
wiley +1 more source
Cramer-Rao Bound and Fitting Algorithm for PARAFAC Decomposition Under Constant-Modulus Constraints
:To analyze the parameter estimation performance of PARAFAC decomposition under Constant Modulus (CM) constraint, Cramer Rao Bound (CRB) expressions for PARAFAC decomposition under “First Row Known” and CM constraints were proposed.
Liu XU, XU Zong-ze
doaj
Superoxide (O2-) is a short lived reactive oxygen species (ROS) formed in seawater by photochemical or biological sources, it is important in the redox cycling of trace elements and organic matter in the ocean.
Maija Iris Heller +5 more
doaj +1 more source
Abstract Evaluating multiple competing biotic and abiotic processes and how they interact with carbon dioxide (CO2) in aquatic systems, is critical to understanding regional and global carbon cycles. Here, we used an aquatic continuum of the Bahe watershed, within a semi‐arid region, to establish a comprehensive conceptual framework for identifying CO2
Mingyu Shao +11 more
wiley +1 more source

