Research on tomography algorithm of furnace flame temperature field based on acoustic method in thermal power station

An improved Tikhonov regularization algorithm MCTR based on Markov radial basis function is proposed to obtain the feedback of closed-loop control for pulverized coal injection process in thermal power plant, so as to solve the ill posed problem in temperature field reconstruction in furnace. The algorithm constructs a new regularization matrix to replace the standard Tikhonov regularization element matrix, so as to achieve the correction effect of the new algorithm. MCTR algorithm determines the boundary singular value of small singular value defined in this paper by determining the proportion between the standard deviation component corresponding to small singular value and the sum of standard deviation components corresponding to all singular values after singular value decomposition of coefficient matrix. After determining the boundary, a new regularization matrix is constructed according to the eigenvector corresponding to small singular value. Compared with the MTR algorithm using the identity matrix as the regularization matrix, MCTR algorithm only selectively modifies the parameters corresponding to small singular values after determining the regularization parameters, which improves the stability of the parameter solution and the reconstruction accuracy of the temperature field, and is helpful to the automatic control of thermal power plants and the efficiency of coal combustion.

Comparative Assessment and Novel Strategy on Methods for Imputing Proteomics Data

Missing values are a major issue in quantitative proteomics analysis. While many methods have been developed for imputing missing values in high-throughput proteomics data, a comparative assessment of imputation accuracy remains inconclusive, mainly because mechanisms contributing to true missing values are complex and existing evaluation methodologies are imperfect. Moreover, few studies have provided an outlook of future methodological development. We first re-evaluate the performance of eight representative methods targeting three typical missing mechanisms. These methods are compared on both simulated and masked missing values embedded within real proteomics datasets, and performance is evaluated using three quantitative measures. We then introduce fused regularization matrix factorization, a low-rank global matrix factorization framework, capable of integrating local similarity derived from additional data types. We also explore a biologically-inspired latent variable modeling strategy - convex analysis of mixtures - for missing value imputation and present preliminary experimental results. While some winners emerged from our comparative assessment, the evaluation is intrinsically imperfect because performance is evaluated indirectly on artificial missing or masked values not authentic missing values. Nevertheless, we show that our fused regularization matrix factorization provides a novel incorporation of external and local information, and the exploratory implementation of convex analysis of mixtures presents a biologically plausible new approach.

Placement Inverse Source Problem under Partition Hyperbolic Equation

In this article, the inverse source problem is determined by the partition hyperbolic equation under the left end flux tension of the string, where the extra measurement is considered. The approximate solution is obtained in the form of splitting and applying the finite difference method (FDM). Moreover, this problem is ill-posed, dealing with instability of force after adding noise to the additional condition. To stabilize the solution, the regularization matrix is considered. Consequently, it is proved by error estimates between the regularized solution and the exact solution. The numerical results show that the method is efficient and stable.

Comparative Assessment and Outlook on Methods for Imputing Proteomics Data

Background: Missing values are a major issue in quantitative proteomics data analysis. While many methods have been developed for imputing missing values in high-throughput proteomics data, comparative assessment on the accuracy of existing methods remains inconclusive, mainly because the true missing mechanisms are complex and the existing evaluation methodologies are imperfect. Moreover, few studies have provided an outlook of current and future development.Results: We first report an assessment of eight representative methods collectively targeting three typical missing mechanisms. The selected methods are compared on both realistic simulation and real proteomics datasets, and the performance is evaluated using three quantitative measures. We then discuss fused regularization matrix factorization, a popular low-rank matrix factorization framework with similarity and/or biological regularization, which is extendable to integrating multi-omics data such as gene expressions or clinical variables. We further explore the potential application of convex analysis of mixtures, a biologically-inspired latent variable modeling strategy, to missing value imputation. The preliminary results on proteomics data are provided together with an outlook into future development directions.Conclusion: While a few winners emerged from our comparative assessment, data-driven evaluation of imputation methods is imperfect because performance is evaluated indirectly on artificial missing or masked values not authentic missing values. Imputation accuracy may vary with signal intensity. Fused regularization matrix factorization provides a possibility of incorporating external information. Convex analysis of mixtures presents a biologically plausible new approach.

Conjugate gradient variants for $${\ell}_{p}$$-regularized image reconstruction in low-field MRI

We consider the MRI physics in a low-field MRI scanner, in which permanent magnets are used to generate a magnetic field in the millitesla range. A model describing the relationship between measured signal and image is derived, resulting in an ill-posed inverse problem. In order to solve it, a regularization penalty is added to the least-squares minimization problem. We generalize the conjugate gradient minimal error (CGME) algorithm to the weighted and regularized least-squares problem. Analysis of the convergence of generalized CGME (GCGME) and the classical generalized conjugate gradient least squares (GCGLS) shows that GCGME can be expected to converge faster for ill-conditioned regularization matrices. The $${\ell}_{p}$$ℓp-regularized problem is solved using iterative reweighted least squares for $$p=1$$p=1 and $$p=\frac{1}{2}$$p=12, with both cases leading to an increasingly ill-conditioned regularization matrix. Numerical results show that GCGME needs a significantly lower number of iterations to converge than GCGLS.

Acoustic source localization using the open spherical microphone array in the low-frequency range

Recently, spherical microphone arrays (SMA) have become increasingly significant for source localization and identification in three dimension due to its spherical symmetry. However, conventional Spherical Harmonic Beamforming (SHB) based on SMA has limitations, such as poor resolution and high side-lobe levels in image maps. To overcome these limitations, this paper employs the iterative generalized inverse beamforming algorithm with a virtual extrapolated open spherical microphone array. The sidelobes can be suppressed and the main-lobe can be narrowed by introducing the two iteration processes into the generalized inverse beamforming (GIB) algorithm. The instability caused by uncertainties in actual measurements, such as measurement noise and configuration problems in the process of GIB, can be minimized by iteratively redefining the form of regularization matrix and the corresponding GIB localization results. In addition, the poor performance of microphone arrays in the low-frequency range due to the array aperture can be improved by using a virtual extrapolated open spherical array (EA), which has a larger array aperture. The virtual array is obtained by a kind of data preprocessing method through the regularization matrix algorithm. Both results from simulations and experiments show the feasibility and accuracy of the method.