We use the Schrödinger–Newton equation to calculate the regularized self-energy of a particle using a regular self-gravitational and electrostatic potential derived in string T-duality.The particle mass M is no ...We use the Schrödinger–Newton equation to calculate the regularized self-energy of a particle using a regular self-gravitational and electrostatic potential derived in string T-duality.The particle mass M is no longer concentrated into a point but is diluted and described by a quantum-corrected smeared energy density resulting in corrections to the energy of the particle,which is interpreted as a regularized self-energy.We extend our results and find corrections to the relativistic particles using the Klein–Gordon,Proca and Dirac equations.An important finding is that we extract a form of the generalized uncertainty principle(GUP)from the corrected energy.This form of the GUP is shown to depend on the nature of particles;namely,for bosons(spin 0 and spin 1)we obtain a quadratic form of the GUP,while for fermions(spin 1/2)we obtain a linear form.The correlation we find between spin and GUP may offer insights for investigating quantum gravity.展开更多
Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior knowledge.This is achieved by leveraging the property of adversarial examples.That is,when generated from a surrogate model,they re...Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior knowledge.This is achieved by leveraging the property of adversarial examples.That is,when generated from a surrogate model,they retain their features if applied to other models due to their good transferability.However,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source models.Consequently,when attempting black-box transfer attacks on different target models,their effectiveness is decreased.To solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency components.Perturbations are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial examples.Afterward,a regularized loss function is used to enhance the black-box transferability between different target models.The proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.展开更多
Full waveform inversion(FWI)is a complex data fitting process based on full wavefield modeling,aiming to quantitatively reconstruct unknown model parameters from partial waveform data with high-resolution.However,this...Full waveform inversion(FWI)is a complex data fitting process based on full wavefield modeling,aiming to quantitatively reconstruct unknown model parameters from partial waveform data with high-resolution.However,this process is highly nonlinear and ill-posed,therefore achieving high-resolution imaging of complex biological tissues within a limited number of iterations remains challenging.We propose a multiscale frequency–domain full waveform inversion(FDFWI)framework for ultrasound computed tomography(USCT)imaging of biological tissues,which innovatively incorporates Sobolev space norm regularization for enhancement of prior information.Specifically,we investigate the effect of different types of hyperparameter on the imaging quality,during which the regularization weight is dynamically adapted based on the ratio of the regularization term to the data fidelity term.This strategy reduces reliance on predefined hyperparameters,ensuring robust inversion performance.The inversion results from both numerical and experimental tests(i.e.,numerical breast,thigh,and ex vivo pork-belly tissue)demonstrate the effectiveness of our regularized FWI strategy.These findings will contribute to the application of the FWI technique in quantitative imaging based on USCT and make USCT possible to be another high-resolution imaging method after x-ray computed tomography and magnetic resonance imaging.展开更多
Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant chal...Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.展开更多
A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inne...A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.展开更多
How to get the rapid and stable inversion results and reconstruct the clear subsurface resistivity structures is a focus problem in current magnetotelluric inversion. A stable solution of an ill-posed inverse problem ...How to get the rapid and stable inversion results and reconstruct the clear subsurface resistivity structures is a focus problem in current magnetotelluric inversion. A stable solution of an ill-posed inverse problem was obtained by the regularization methods in which some desired structures were imposed to stabilize the inverse problem. By the smoothness-constrained model and approximate sensitivity method, the stable subsurface resistivity structures were reconstructed. The synthetic examples show that the smoothness-constrained regularized inversion method is effective and can be reasonable to reconstruct three-dimensional subsurface resistivity structures.展开更多
Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of...Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of adjacent sources. To overcome this problem, we propose the regularized least-squares reverse time migration method （RLSRTM） using the singular spectrum analysis technique that imposes sparseness constraints on the inverted model. Additionally, the difference spectrum theory of singular values is presented so that RLSRTM can be implemented adaptively to eliminate the migration artifacts. With numerical tests on a fiat layer model and a Marmousi model, we validate the superior imaging quality, efficiency and convergence of RLSRTM compared with LSRTM when dealing with simultaneoussource data, incomplete data and noisy data.展开更多
This paper presents anew regularization method for solving operator equations of the first kind; the convergence rate of the regularized solution is improved, as compared with the ordinary Tikhonov regularization.
A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is oppo...A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.展开更多
A modified regularized robust filter is proposed for spacecraft attitude determination in the presence of relative misalignment of attitude sensors. The filter is designed to minimize the worst-possible residual norm ...A modified regularized robust filter is proposed for spacecraft attitude determination in the presence of relative misalignment of attitude sensors. The filter is designed to minimize the worst-possible residual norm on condition that there is parametric uncertainty in the measurement model. The weighting matrix of the residual norm is designed to minimize the upper bound of the estimation error variance. The performance of the proposed attitude determination robust filter is illustrated with the use of real test data from a real three-floated gyroscope. Simulation results demonstrate that the attitude estimation accuracy is improved by using the proposed algorithm.展开更多
This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information ...This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.展开更多
Bayesian regularized BP neural network（BRBPNN） technique was applied in the chlorophyll-α prediction of Nanzui water area in Dongting Lake. Through BP network interpolation method, the input and output samples of t...Bayesian regularized BP neural network（BRBPNN） technique was applied in the chlorophyll-α prediction of Nanzui water area in Dongting Lake. Through BP network interpolation method, the input and output samples of the network were obtained. After the selection of input variables using stepwise/multiple linear regression method in SPSS i1.0 software, the BRBPNN model was established between chlorophyll-α and environmental parameters, biological parameters. The achieved optimal network structure was 3-11-1 with the correlation coefficients and the mean square errors for the training set and the test set as 0.999 and 0.000？8426, 0.981 and 0.0216 respectively. The sum of square weights between each input neuron and the hidden layer of optimal BRBPNN models of different structures indicated that the effect of individual input parameter on chlorophyll- α declined in the order of alga amount 〉 secchi disc depth（SD） 〉 electrical conductivity （EC）. Additionally, it also demonstrated that the contributions of these three factors were the maximal for the change of chlorophyll-α concentration, total phosphorus（TP） and total nitrogen（TN） were the minimal. All the results showed that BRBPNN model was capable of automated regularization parameter selection and thus it may ensure the excellent generation ability and robustness. Thus, this study laid the foundation for the application of BRBPNN model in the analysis of aquatic ecological data（chlorophyll-α prediction） and the explanation about the effective eutrophication treatment measures for Nanzui water area in Dongting Lake.展开更多
Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presen...Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.展开更多
The mixed covolume method for the regularized long wave equation is devel- oped and studied. By introducing a transfer operator γh, which maps the trial function space into the test function space, and combining the ...The mixed covolume method for the regularized long wave equation is devel- oped and studied. By introducing a transfer operator γh, which maps the trial function space into the test function space, and combining the mixed finite element with the finite volume method, the nonlinear and linear Euler fully discrete mixed covolume schemes are constructed, and the existence and uniqueness of the solutions are proved. The optimal error estimates for these schemes are obtained. Finally, a numerical example is provided to examine the efficiency of the proposed schemes.展开更多
Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is...Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.展开更多
Considering the uncertainty of the electrical axis for two-dimensional audo-magnetotelluric(AMT) data processing, an AMT inversion method with the Central impedance tensor was presented. First, we present a calculatio...Considering the uncertainty of the electrical axis for two-dimensional audo-magnetotelluric(AMT) data processing, an AMT inversion method with the Central impedance tensor was presented. First, we present a calculation expression of the Central impedance tensor in AMT, which can be considered as the arithmetic mean of TE-polarization mode and TM-polarization mode in the twodimensional geo-electrical model. Second, a least-squares iterative inversion algorithm is established, based on a smoothnessconstrained model, and an improved L-curve method is adopted to determine the best regularization parameters. We then test the above inversion method with synthetic data and field data. The test results show that this two-dimensional AMT inversion scheme for the responses of Central impedance is effective and can reconstruct reasonable two-dimensional subsurface resistivity structures. We conclude that the Central impedance tensor is a useful tool for two-dimensional inversion of AMT data.展开更多
Dear Editor,This letter explores optimal formation control for a network of unmanned surface vessels(USVs).By designing an individual objective function for each USV,the optimal formation problem is transformed into a...Dear Editor,This letter explores optimal formation control for a network of unmanned surface vessels(USVs).By designing an individual objective function for each USV,the optimal formation problem is transformed into a noncooperative game.Under this game theoretic framework,the optimal formation is achieved by seeking the Nash equilibrium of the regularized game.A modular structure consisting of a distributed Nash equilibrium seeker and a regulator is proposed.展开更多
This paper is concerned with the convergence rates of ergodic limits and approximation for regularized resolvent families for a linear Volterra integral equation. The results contain C 0-semigroups, cosine operator fu...This paper is concerned with the convergence rates of ergodic limits and approximation for regularized resolvent families for a linear Volterra integral equation. The results contain C 0-semigroups, cosine operator functions and α-times integrated resolvent family as special cases.展开更多
In order to improve classification accuracy, the regularized logistic regression is used to classify single-trial electroencephalogram （EEG）. A novel approach, named local sparse logistic regression （LSLR）, is pro...In order to improve classification accuracy, the regularized logistic regression is used to classify single-trial electroencephalogram （EEG）. A novel approach, named local sparse logistic regression （LSLR）, is proposed. The LSLR integrates the locality preserving projection regularization term into the framework of sparse logistic regression. It tries to maintain the neighborhood information of original feature space, and, meanwhile, keeps sparsity. The bound optimization algorithm and component-wise update are used to compute the weight vector in the training data, thus overcoming the disadvantage of the Newton-Raphson method and iterative re-weighted least squares （IRLS）. The classification accuracy of 80% is achieved using ten-fold cross-validation in the self-paced finger tapping data set. The results of LSLR are compared with SLR, showing the effectiveness of the proposed method.展开更多
文摘We use the Schrödinger–Newton equation to calculate the regularized self-energy of a particle using a regular self-gravitational and electrostatic potential derived in string T-duality.The particle mass M is no longer concentrated into a point but is diluted and described by a quantum-corrected smeared energy density resulting in corrections to the energy of the particle,which is interpreted as a regularized self-energy.We extend our results and find corrections to the relativistic particles using the Klein–Gordon,Proca and Dirac equations.An important finding is that we extract a form of the generalized uncertainty principle(GUP)from the corrected energy.This form of the GUP is shown to depend on the nature of particles;namely,for bosons(spin 0 and spin 1)we obtain a quadratic form of the GUP,while for fermions(spin 1/2)we obtain a linear form.The correlation we find between spin and GUP may offer insights for investigating quantum gravity.
基金supported by the Intelligent Policing Key Laboratory of Sichuan Province(No.ZNJW2022KFZD002)This work was supported by the Scientific and Technological Research Program of Chongqing Municipal Education Commission(Grant Nos.KJQN202302403,KJQN202303111).
文摘Transfer-based Adversarial Attacks(TAAs)can deceive a victim model even without prior knowledge.This is achieved by leveraging the property of adversarial examples.That is,when generated from a surrogate model,they retain their features if applied to other models due to their good transferability.However,adversarial examples often exhibit overfitting,as they are tailored to exploit the particular architecture and feature representation of source models.Consequently,when attempting black-box transfer attacks on different target models,their effectiveness is decreased.To solve this problem,this study proposes an approach based on a Regularized Constrained Feature Layer(RCFL).The proposed method first uses regularization constraints to attenuate the initial examples of low-frequency components.Perturbations are then added to a pre-specified layer of the source model using the back-propagation technique,in order to modify the original adversarial examples.Afterward,a regularized loss function is used to enhance the black-box transferability between different target models.The proposed method is finally tested on the ImageNet,CIFAR-100,and Stanford Car datasets with various target models,The obtained results demonstrate that it achieves a significantly higher transfer-based adversarial attack success rate compared with baseline techniques.
基金supported by the National Natural Science Foundation of China(Grant No.12474461)the Basic and Frontier Exploration Project Independently Deployed by Institute of Acoustics,Chinese Academy of Sciences(Grant No.JCQY202402)the Goal-Oriented Project Independently Deployed by Institute of Acoustics,Chinese Academy of Sciences(Grant No.MBDX202113).
文摘Full waveform inversion(FWI)is a complex data fitting process based on full wavefield modeling,aiming to quantitatively reconstruct unknown model parameters from partial waveform data with high-resolution.However,this process is highly nonlinear and ill-posed,therefore achieving high-resolution imaging of complex biological tissues within a limited number of iterations remains challenging.We propose a multiscale frequency–domain full waveform inversion(FDFWI)framework for ultrasound computed tomography(USCT)imaging of biological tissues,which innovatively incorporates Sobolev space norm regularization for enhancement of prior information.Specifically,we investigate the effect of different types of hyperparameter on the imaging quality,during which the regularization weight is dynamically adapted based on the ratio of the regularization term to the data fidelity term.This strategy reduces reliance on predefined hyperparameters,ensuring robust inversion performance.The inversion results from both numerical and experimental tests(i.e.,numerical breast,thigh,and ex vivo pork-belly tissue)demonstrate the effectiveness of our regularized FWI strategy.These findings will contribute to the application of the FWI technique in quantitative imaging based on USCT and make USCT possible to be another high-resolution imaging method after x-ray computed tomography and magnetic resonance imaging.
文摘Multi-label feature selection(MFS)is a crucial dimensionality reduction technique aimed at identifying informative features associated with multiple labels.However,traditional centralized methods face significant challenges in privacy-sensitive and distributed settings,often neglecting label dependencies and suffering from low computational efficiency.To address these issues,we introduce a novel framework,Fed-MFSDHBCPSO—federated MFS via dual-layer hybrid breeding cooperative particle swarm optimization algorithm with manifold and sparsity regularization(DHBCPSO-MSR).Leveraging the federated learning paradigm,Fed-MFSDHBCPSO allows clients to perform local feature selection(FS)using DHBCPSO-MSR.Locally selected feature subsets are encrypted with differential privacy(DP)and transmitted to a central server,where they are securely aggregated and refined through secure multi-party computation(SMPC)until global convergence is achieved.Within each client,DHBCPSO-MSR employs a dual-layer FS strategy.The inner layer constructs sample and label similarity graphs,generates Laplacian matrices to capture the manifold structure between samples and labels,and applies L2,1-norm regularization to sparsify the feature subset,yielding an optimized feature weight matrix.The outer layer uses a hybrid breeding cooperative particle swarm optimization algorithm to further refine the feature weight matrix and identify the optimal feature subset.The updated weight matrix is then fed back to the inner layer for further optimization.Comprehensive experiments on multiple real-world multi-label datasets demonstrate that Fed-MFSDHBCPSO consistently outperforms both centralized and federated baseline methods across several key evaluation metrics.
基金The National Natural Science Foundation of China (No.61362001,61102043,61262084,20132BAB211030,20122BAB211015)the Basic Research Program of Shenzhen(No.JC201104220219A)
文摘A two-level Bregmanized method with graph regularized sparse coding （TBGSC） is presented for image interpolation. The outer-level Bregman iterative procedure enforces the observation data constraints, while the inner-level Bregmanized method devotes to dictionary updating and sparse represention of small overlapping image patches. The introduced constraint of graph regularized sparse coding can capture local image features effectively, and consequently enables accurate reconstruction from highly undersampled partial data. Furthermore, modified sparse coding and simple dictionary updating applied in the inner minimization make the proposed algorithm converge within a relatively small number of iterations. Experimental results demonstrate that the proposed algorithm can effectively reconstruct images and it outperforms the current state-of-the-art approaches in terms of visual comparisons and quantitative measures.
基金Project(20110162120064)supported by Higher School Doctor Subject Special Scientific Research Foundation of ChinaProject(10JJ6059)supported by the Natural Science Foundation of Hunan Province,China
文摘How to get the rapid and stable inversion results and reconstruct the clear subsurface resistivity structures is a focus problem in current magnetotelluric inversion. A stable solution of an ill-posed inverse problem was obtained by the regularization methods in which some desired structures were imposed to stabilize the inverse problem. By the smoothness-constrained model and approximate sensitivity method, the stable subsurface resistivity structures were reconstructed. The synthetic examples show that the smoothness-constrained regularized inversion method is effective and can be reasonable to reconstruct three-dimensional subsurface resistivity structures.
基金financial support from the National Natural Science Foundation of China (Grant Nos. 41104069, 41274124)National Key Basic Research Program of China (973 Program) (Grant No. 2014CB239006)+2 种基金National Science and Technology Major Project (Grant No. 2011ZX05014-001-008)the Open Foundation of SINOPEC Key Laboratory of Geophysics (Grant No. 33550006-15-FW2099-0033)the Fundamental Research Funds for the Central Universities (Grant No. 16CX06046A)
文摘Simultaneous-source acquisition has been recog- nized as an economic and efficient acquisition method, but the direct imaging of the simultaneous-source data produces migration artifacts because of the interference of adjacent sources. To overcome this problem, we propose the regularized least-squares reverse time migration method （RLSRTM） using the singular spectrum analysis technique that imposes sparseness constraints on the inverted model. Additionally, the difference spectrum theory of singular values is presented so that RLSRTM can be implemented adaptively to eliminate the migration artifacts. With numerical tests on a fiat layer model and a Marmousi model, we validate the superior imaging quality, efficiency and convergence of RLSRTM compared with LSRTM when dealing with simultaneoussource data, incomplete data and noisy data.
文摘This paper presents anew regularization method for solving operator equations of the first kind; the convergence rate of the regularized solution is improved, as compared with the ordinary Tikhonov regularization.
基金supported by the National Natural Science Foundation of China(51006052)the NUST Outstanding Scholar Supporting Program
文摘A method for fast 1-fold cross validation is proposed for the regularized extreme learning machine （RELM）. The computational time of fast l-fold cross validation increases as the fold number decreases, which is opposite to that of naive 1-fold cross validation. As opposed to naive l-fold cross validation, fast l-fold cross validation takes the advantage in terms of computational time, especially for the large fold number such as l 〉 20. To corroborate the efficacy and feasibility of fast l-fold cross validation, experiments on five benchmark regression data sets are evaluated.
基金National Natural Science Foundation of China （60702019 61074103）
文摘A modified regularized robust filter is proposed for spacecraft attitude determination in the presence of relative misalignment of attitude sensors. The filter is designed to minimize the worst-possible residual norm on condition that there is parametric uncertainty in the measurement model. The weighting matrix of the residual norm is designed to minimize the upper bound of the estimation error variance. The performance of the proposed attitude determination robust filter is illustrated with the use of real test data from a real three-floated gyroscope. Simulation results demonstrate that the attitude estimation accuracy is improved by using the proposed algorithm.
基金supported by the National Natural Science Foundation of China(61702251,61363049,11571011)the State Scholarship Fund of China Scholarship Council(CSC)(201708360040)+3 种基金the Natural Science Foundation of Jiangxi Province(20161BAB212033)the Natural Science Basic Research Plan in Shaanxi Province of China(2018JM6030)the Doctor Scientific Research Starting Foundation of Northwest University(338050050)Youth Academic Talent Support Program of Northwest University
文摘This paper proposes a Graph regularized Lpsmooth non-negative matrix factorization(GSNMF) method by incorporating graph regularization and L_p smoothing constraint, which considers the intrinsic geometric information of a data set and produces smooth and stable solutions. The main contributions are as follows: first, graph regularization is added into NMF to discover the hidden semantics and simultaneously respect the intrinsic geometric structure information of a data set. Second,the Lpsmoothing constraint is incorporated into NMF to combine the merits of isotropic(L_2-norm) and anisotropic(L_1-norm)diffusion smoothing, and produces a smooth and more accurate solution to the optimization problem. Finally, the update rules and proof of convergence of GSNMF are given. Experiments on several data sets show that the proposed method outperforms related state-of-the-art methods.
文摘Bayesian regularized BP neural network（BRBPNN） technique was applied in the chlorophyll-α prediction of Nanzui water area in Dongting Lake. Through BP network interpolation method, the input and output samples of the network were obtained. After the selection of input variables using stepwise/multiple linear regression method in SPSS i1.0 software, the BRBPNN model was established between chlorophyll-α and environmental parameters, biological parameters. The achieved optimal network structure was 3-11-1 with the correlation coefficients and the mean square errors for the training set and the test set as 0.999 and 0.000？8426, 0.981 and 0.0216 respectively. The sum of square weights between each input neuron and the hidden layer of optimal BRBPNN models of different structures indicated that the effect of individual input parameter on chlorophyll- α declined in the order of alga amount 〉 secchi disc depth（SD） 〉 electrical conductivity （EC）. Additionally, it also demonstrated that the contributions of these three factors were the maximal for the change of chlorophyll-α concentration, total phosphorus（TP） and total nitrogen（TN） were the minimal. All the results showed that BRBPNN model was capable of automated regularization parameter selection and thus it may ensure the excellent generation ability and robustness. Thus, this study laid the foundation for the application of BRBPNN model in the analysis of aquatic ecological data（chlorophyll-α prediction） and the explanation about the effective eutrophication treatment measures for Nanzui water area in Dongting Lake.
基金Supported by the National Natural Science Foundation of China (No. 61073079)the Fundamental Research Funds for the Central Universities (2011JBM216,2011YJS021)
文摘Sparsity Adaptive Matching Pursuit (SAMP) algorithm is a widely used reconstruction algorithm for compressive sensing in the case that the sparsity is unknown. In order to match the sparsity more accurately, we presented an improved SAMP algorithm based on Regularized Backtracking (SAMP-RB). By adapting a regularized backtracking step to SAMP algorithm in each iteration stage, the proposed algorithm can flexibly remove the inappropriate atoms. The experimental results show that SAMP-RB reconstruction algorithm greatly improves SAMP algorithm both in reconstruction quality and computational time. It has better reconstruction efficiency than most of the available matching pursuit algorithms.
基金supported by the National Natural Science Fundation of China (No. 11061021)the Science Research of Inner Mongolia Advanced Education (Nos. NJ10006, NJ10016, and NJZZ12011)the National Science Foundation of Inner Mongolia (Nos. 2011BS0102 and 2012MS0106)
文摘The mixed covolume method for the regularized long wave equation is devel- oped and studied. By introducing a transfer operator γh, which maps the trial function space into the test function space, and combining the mixed finite element with the finite volume method, the nonlinear and linear Euler fully discrete mixed covolume schemes are constructed, and the existence and uniqueness of the solutions are proved. The optimal error estimates for these schemes are obtained. Finally, a numerical example is provided to examine the efficiency of the proposed schemes.
基金supported by the National Natural Science Fundation of China (60736021)the Joint Funds of NSFC-Guangdong Province(U0735003)
文摘Kernel-based methods work by embedding the data into a feature space and then searching linear hypothesis among the embedding data points. The performance is mostly affected by which kernel is used. A promising way is to learn the kernel from the data automatically. A general regularized risk functional （RRF） criterion for kernel matrix learning is proposed. Compared with the RRF criterion, general RRF criterion takes into account the geometric distributions of the embedding data points. It is proven that the distance between different geometric distdbutions can be estimated by their centroid distance in the reproducing kernel Hilbert space. Using this criterion for kernel matrix learning leads to a convex quadratically constrained quadratic programming （QCQP） problem. For several commonly used loss functions, their mathematical formulations are given. Experiment results on a collection of benchmark data sets demonstrate the effectiveness of the proposed method.
基金supported by National Natural Science Foundation of China (grant 41674080)Higher School Doctor Subject Special Scientific Research Foundation (grant 20110162120064)
文摘Considering the uncertainty of the electrical axis for two-dimensional audo-magnetotelluric(AMT) data processing, an AMT inversion method with the Central impedance tensor was presented. First, we present a calculation expression of the Central impedance tensor in AMT, which can be considered as the arithmetic mean of TE-polarization mode and TM-polarization mode in the twodimensional geo-electrical model. Second, a least-squares iterative inversion algorithm is established, based on a smoothnessconstrained model, and an improved L-curve method is adopted to determine the best regularization parameters. We then test the above inversion method with synthetic data and field data. The test results show that this two-dimensional AMT inversion scheme for the responses of Central impedance is effective and can reconstruct reasonable two-dimensional subsurface resistivity structures. We conclude that the Central impedance tensor is a useful tool for two-dimensional inversion of AMT data.
基金supported by the National Key R&D Program of China(2022ZD0119604)the National Natural Science Foundation of China(NSFC),(62222308,62173181,62221004)+1 种基金the Natural Science Foundation of Jiangsu Province(BK20220139)the Young Elite Scientists Sponsorship Program by CAST(2021QNRC001)。
文摘Dear Editor,This letter explores optimal formation control for a network of unmanned surface vessels(USVs).By designing an individual objective function for each USV,the optimal formation problem is transformed into a noncooperative game.Under this game theoretic framework,the optimal formation is achieved by seeking the Nash equilibrium of the regularized game.A modular structure consisting of a distributed Nash equilibrium seeker and a regulator is proposed.
基金This project is supported by the Special Funds for Major Specialties of Shanghai Education Committee and the Natural Foundation ofShanghai City.
文摘This paper is concerned with the convergence rates of ergodic limits and approximation for regularized resolvent families for a linear Volterra integral equation. The results contain C 0-semigroups, cosine operator functions and α-times integrated resolvent family as special cases.
基金The National Natural Science Foundation of China(No.61075009)the Natural Science Foundation of Jiangsu Province(No.BK2011595)the Program for New Century Excellent Talents in University of China,the Qing Lan Project of Jiangsu Province
文摘In order to improve classification accuracy, the regularized logistic regression is used to classify single-trial electroencephalogram （EEG）. A novel approach, named local sparse logistic regression （LSLR）, is proposed. The LSLR integrates the locality preserving projection regularization term into the framework of sparse logistic regression. It tries to maintain the neighborhood information of original feature space, and, meanwhile, keeps sparsity. The bound optimization algorithm and component-wise update are used to compute the weight vector in the training data, thus overcoming the disadvantage of the Newton-Raphson method and iterative re-weighted least squares （IRLS）. The classification accuracy of 80% is achieved using ten-fold cross-validation in the self-paced finger tapping data set. The results of LSLR are compared with SLR, showing the effectiveness of the proposed method.
