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.展开更多
In this paper,we study the three-dimensional regularized MHD equations with fractional Laplacians in the dissipative and diffusive terms.We establish the global existence of mild solutions to this system with small in...In this paper,we study the three-dimensional regularized MHD equations with fractional Laplacians in the dissipative and diffusive terms.We establish the global existence of mild solutions to this system with small initial data.In addition,we also obtain the Gevrey class regularity and the temporal decay rate of the solution.展开更多
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.展开更多
The selection of hyperparameters in regularized least squares plays an important role in large-scale system identification. The traditional methods for selecting hyperparameters are based on experience or marginal lik...The selection of hyperparameters in regularized least squares plays an important role in large-scale system identification. The traditional methods for selecting hyperparameters are based on experience or marginal likelihood maximization method, which are inaccurate or computationally expensive. In this paper, two posterior methods are proposed to select hyperparameters based on different prior knowledge (constraints), which can obtain the optimal hyperparameters using the optimization theory. Moreover, we also give the theoretical optimal constraints, and verify its effectiveness. Numerical simulation shows that the hyperparameters and parameter vector estimate obtained by the proposed methods are the optimal ones.展开更多
Dynamic mode decomposition(DMD) aims at extracting intrinsic mechanisms in a time sequence via linear recurrence relation of its observables, thereby predicting later terms in the sequence. Stability is a major concer...Dynamic mode decomposition(DMD) aims at extracting intrinsic mechanisms in a time sequence via linear recurrence relation of its observables, thereby predicting later terms in the sequence. Stability is a major concern in DMD predictions. We adopt a regularized form and propose a Regularized DMD(Re DMD) algorithm to determine the regularization parameter. This leverages stability and accuracy. Numerical tests for Burgers' equation demonstrate that Re DMD effectively stabilizes the DMD prediction while maintaining accuracy. Comparisons are made with the truncated DMD algorithm.展开更多
The existing multi-view subspace clustering algorithms based on tensor singular value decomposition(t-SVD)predominantly utilize tensor nuclear norm to explore the intra view correlation between views of the same sampl...The existing multi-view subspace clustering algorithms based on tensor singular value decomposition(t-SVD)predominantly utilize tensor nuclear norm to explore the intra view correlation between views of the same samples,while neglecting the correlation among the samples within different views.Moreover,the tensor nuclear norm is not fully considered as a convex approximation of the tensor rank function.Treating different singular values equally may result in suboptimal tensor representation.A hypergraph regularized multi-view subspace clustering algorithm with dual tensor log-determinant(HRMSC-DTL)was proposed.The algorithm used subspace learning in each view to learn a specific set of affinity matrices,and introduced a non-convex tensor log-determinant function to replace the tensor nuclear norm to better improve global low-rankness.It also introduced hyper-Laplacian regularization to preserve the local geometric structure embedded in the high-dimensional space.Furthermore,it rotated the original tensor and incorporated a dual tensor mechanism to fully exploit the intra view correlation of the original tensor and the inter view correlation of the rotated tensor.At the same time,an alternating direction of multipliers method(ADMM)was also designed to solve non-convex optimization model.Experimental evaluations on seven widely used datasets,along with comparisons to several state-of-the-art algorithms,demonstrated the superiority and effectiveness of the HRMSC-DTL algorithm in terms of clustering performance.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which...Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.展开更多
The global fast dynamics for the generalized symmetric regularized long wave equation with damping term is considered. The squeezing property of the nonlinear semi_group associated with this equation and the existence...The global fast dynamics for the generalized symmetric regularized long wave equation with damping term is considered. The squeezing property of the nonlinear semi_group associated with this equation and the existence of exponential attractor are proved. The upper bounds of its fractal dimension are also estimated.展开更多
Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the di...Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the disease may affect some local connectivity in the brain functional network.That is,there are functional abnormalities in the sub-network.Therefore,it is crucial to accurately identify them in pathological diagnosis.To solve these problems,we proposed a sub-network extraction method based on graph regularization nonnegative matrix factorization(GNMF).The dynamic functional networks of normal subjects and early mild cognitive impairment(eMCI)subjects were vectorized and the functional connection vectors(FCV)were assembled to aggregation matrices.Then GNMF was applied to factorize the aggregation matrix to get the base matrix,in which the column vectors were restored to a common sub-network and a distinctive sub-network,and visualization and statistical analysis were conducted on the two sub-networks,respectively.Experimental results demonstrated that,compared with other matrix factorization methods,the proposed method can more obviously reflect the similarity between the common subnetwork of eMCI subjects and normal subjects,as well as the difference between the distinctive sub-network of eMCI subjects and normal subjects,Therefore,the high-dimensional features in brain functional networks can be best represented locally in the lowdimensional space,which provides a new idea for studying brain functional connectomes.展开更多
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.展开更多
基金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.
基金supported by the Opening Project of Guangdong Province Key Laboratory of Cyber-Physical System(20168030301008)supported by the National Natural Science Foundation of China(11126266)+4 种基金the Natural Science Foundation of Guangdong Province(2016A030313390)the Quality Engineering Project of Guangdong Province(SCAU-2021-69)the SCAU Fund for High-level University Buildingsupported by the National Key Research and Development Program of China(2020YFA0712500)the National Natural Science Foundation of China(11971496,12126609)。
文摘In this paper,we study the three-dimensional regularized MHD equations with fractional Laplacians in the dissipative and diffusive terms.We establish the global existence of mild solutions to this system with small initial data.In addition,we also obtain the Gevrey class regularity and the temporal decay rate of the solution.
基金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.
文摘The selection of hyperparameters in regularized least squares plays an important role in large-scale system identification. The traditional methods for selecting hyperparameters are based on experience or marginal likelihood maximization method, which are inaccurate or computationally expensive. In this paper, two posterior methods are proposed to select hyperparameters based on different prior knowledge (constraints), which can obtain the optimal hyperparameters using the optimization theory. Moreover, we also give the theoretical optimal constraints, and verify its effectiveness. Numerical simulation shows that the hyperparameters and parameter vector estimate obtained by the proposed methods are the optimal ones.
基金supported by the National Nature Science Foundation of China (Grant No.11988102)National Undergraduate Training Program for Innovation and Entrepreneurship。
文摘Dynamic mode decomposition(DMD) aims at extracting intrinsic mechanisms in a time sequence via linear recurrence relation of its observables, thereby predicting later terms in the sequence. Stability is a major concern in DMD predictions. We adopt a regularized form and propose a Regularized DMD(Re DMD) algorithm to determine the regularization parameter. This leverages stability and accuracy. Numerical tests for Burgers' equation demonstrate that Re DMD effectively stabilizes the DMD prediction while maintaining accuracy. Comparisons are made with the truncated DMD algorithm.
基金supported by National Natural Science Foundation of China(No.61806006)Priority Academic Program Development of Jiangsu Higher Education Institutions。
文摘The existing multi-view subspace clustering algorithms based on tensor singular value decomposition(t-SVD)predominantly utilize tensor nuclear norm to explore the intra view correlation between views of the same samples,while neglecting the correlation among the samples within different views.Moreover,the tensor nuclear norm is not fully considered as a convex approximation of the tensor rank function.Treating different singular values equally may result in suboptimal tensor representation.A hypergraph regularized multi-view subspace clustering algorithm with dual tensor log-determinant(HRMSC-DTL)was proposed.The algorithm used subspace learning in each view to learn a specific set of affinity matrices,and introduced a non-convex tensor log-determinant function to replace the tensor nuclear norm to better improve global low-rankness.It also introduced hyper-Laplacian regularization to preserve the local geometric structure embedded in the high-dimensional space.Furthermore,it rotated the original tensor and incorporated a dual tensor mechanism to fully exploit the intra view correlation of the original tensor and the inter view correlation of the rotated tensor.At the same time,an alternating direction of multipliers method(ADMM)was also designed to solve non-convex optimization model.Experimental evaluations on seven widely used datasets,along with comparisons to several state-of-the-art algorithms,demonstrated the superiority and effectiveness of the HRMSC-DTL algorithm in terms of clustering performance.
基金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.
文摘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.
基金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 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 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 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 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 Hi-Tech Research and Development Program of China (No. 2009AAJ130)
文摘Non-collaborative radio transmitter recognition is a significant but challenging issue, since it is hard or costly to obtain labeled training data samples. In order to make effective use of the unlabeled samples which can be obtained much easier, a novel semi-supervised classification method named Elastic Sparsity Regularized Support Vector Machine (ESRSVM) is proposed for radio transmitter classification. ESRSVM first constructs an elastic-net graph over data samples to capture the robust and natural discriminating information and then incorporate the information into the manifold learning framework by an elastic sparsity regularization term. Experimental results on 10 GMSK modulated Automatic Identification System radios and 15 FM walkie-talkie radios show that ESRSVM achieves obviously better performance than KNN and SVM, which use only labeled samples for classification, and also outperforms semi-supervised classifier LapSVM based on manifold regularization.
基金ProjectsupportedbytheNationalNaturalScienceFoundationofChina (No .1 0 2 71 0 3 4)
文摘The global fast dynamics for the generalized symmetric regularized long wave equation with damping term is considered. The squeezing property of the nonlinear semi_group associated with this equation and the existence of exponential attractor are proved. The upper bounds of its fractal dimension are also estimated.
基金supported by the National Natural Science Foundation of China(No.51877013),(ZJ),(http://www.nsfc.gov.cn/)the Natural Science Foundation of Jiangsu Province(No.BK20181463),(ZJ),(http://kxjst.jiangsu.gov.cn/)sponsored by Qing Lan Project of Jiangsu Province(no specific grant number),(ZJ),(http://jyt.jiangsu.gov.cn/).
文摘Currently,functional connectomes constructed from neuroimaging data have emerged as a powerful tool in identifying brain disorders.If one brain disease just manifests as some cognitive dysfunction,it means that the disease may affect some local connectivity in the brain functional network.That is,there are functional abnormalities in the sub-network.Therefore,it is crucial to accurately identify them in pathological diagnosis.To solve these problems,we proposed a sub-network extraction method based on graph regularization nonnegative matrix factorization(GNMF).The dynamic functional networks of normal subjects and early mild cognitive impairment(eMCI)subjects were vectorized and the functional connection vectors(FCV)were assembled to aggregation matrices.Then GNMF was applied to factorize the aggregation matrix to get the base matrix,in which the column vectors were restored to a common sub-network and a distinctive sub-network,and visualization and statistical analysis were conducted on the two sub-networks,respectively.Experimental results demonstrated that,compared with other matrix factorization methods,the proposed method can more obviously reflect the similarity between the common subnetwork of eMCI subjects and normal subjects,as well as the difference between the distinctive sub-network of eMCI subjects and normal subjects,Therefore,the high-dimensional features in brain functional networks can be best represented locally in the lowdimensional space,which provides a new idea for studying brain functional connectomes.
基金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.
