Regularized least-squares migration of simultaneous-source seismic data with adaptive singular spectrum analysis

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.

Application of Bayesian regularized BP neural network model for analysis of aquatic ecological data—A case study of chlorophyll-a prediction in Nanzui water area of Dongting Lake

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.

An iterative algorithm for solving ill-conditioned linear least squares problems

Linear Least Squares（LLS） problems are particularly difficult to solve because they are frequently ill-conditioned, and involve large quantities of data. Ill-conditioned LLS problems are commonly seen in mathematics and geosciences, where regularization algorithms are employed to seek optimal solutions. For many problems, even with the use of regularization algorithms it may be impossible to obtain an accurate solution. Riley and Golub suggested an iterative scheme for solving LLS problems. For the early iteration algorithm, it is difficult to improve the well-conditioned perturbed matrix and accelerate the convergence at the same time. Aiming at this problem, self-adaptive iteration algorithm（SAIA） is proposed in this paper for solving severe ill-conditioned LLS problems. The algorithm is different from other popular algorithms proposed in recent references. It avoids matrix inverse by using Cholesky decomposition, and tunes the perturbation parameter according to the rate of residual error decline in the iterative process. Example shows that the algorithm can greatly reduce iteration times, accelerate the convergence,and also greatly enhance the computation accuracy.

Tuning of Prior Covariance in Generalized Least Squares

Generalized Least Squares (least squares with prior information) requires the correct assignment of two prior covariance matrices: one associated with the uncertainty of measurements;the other with the uncertainty of prior information. These assignments often are very subjective, especially when correlations among data or among prior information are believed to occur. However, in cases in which the general form of these matrices can be anticipated up to a set of poorly-known parameters, the data and prior information may be used to better-determine (or “tune”) the parameters in a manner that is faithful to the underlying Bayesian foundation of GLS. We identify an objective function, the minimization of which leads to the best-estimate of the parameters and provide explicit and computationally-efficient formula for calculating the derivatives needed to implement the minimization with a gradient descent method. Furthermore, the problem is organized so that the minimization need be performed only over the space of covariance parameters, and not over the combined space of model and covariance parameters. We show that the use of trade-off curves to select the relative weight given to observations and prior information is not a form of tuning, because it does not, in general maximize the posterior probability of the model parameters, and can lead to a different weighting than the procedure described here. We also provide several examples that demonstrate the viability, and discuss both the advantages and limitations of the method.

A meshless method for the nonlinear generalized regularized long wave equation

This paper presents a meshless method for the nonlinear generalized regularized long wave （GRLW） equation based on the moving least-squares approximation. The nonlinear discrete scheme of the GRLW equation is obtained and is solved using the iteration method. A theorem on the convergence of the iterative process is presented and proved using theorems of the infinity norm. Compared with numerical methods based on mesh, the meshless method for the GRLW equation only requires the.scattered nodes instead of meshing the domain of the problem. Some examples, such as the propagation of single soliton and the interaction of two solitary waves, are given to show the effectiveness of the meshless method.

The posterior selection method for hyperparameters in regularized least squares method

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.

SUPERCONVERGENCE OF LEAST-SQUARES MIXED FINITE ELEMENTS FOR ELLIPTIC PROBLEMS ON TRIANGULATION

In this paper,we present the least-squares mixed finite element method and investigate superconvergence phenomena for the second order elliptic boundary-value problems over triangulations.On the basis of the L2-projection and some mixed finite element projections,we obtain the superconvergence result of least-squares mixed finite element solutions.This error estimate indicates an accuracy of O(h3/2)if the lowest order Raviart-Thomas elements are employed.

New normalized LMS adaptive filter with a variable regularization factor

A new normalized least mean square(NLMS) adaptive filter is first derived from a cost function, which incorporates the conventional one of the NLMS with a minimum-disturbance(MD)constraint. A variable regularization factor(RF) is then employed to control the contribution made by the MD constraint in the cost function. Analysis results show that the RF can be taken as a combination of the step size and regularization parameter in the conventional NLMS. This implies that these parameters can be jointly controlled by simply tuning the RF as the proposed algorithm does. It also demonstrates that the RF can accelerate the convergence rate of the proposed algorithm and its optimal value can be obtained by minimizing the squared noise-free posteriori error. A method for automatically determining the value of the RF is also presented, which is free of any prior knowledge of the noise. While simulation results verify the analytical ones, it is also illustrated that the performance of the proposed algorithm is superior to the state-of-art ones in both the steady-state misalignment and the convergence rate. A novel algorithm is proposed to solve some problems. Simulation results show the effectiveness of the proposed algorithm.

Constrained regularization for noninvasive glucose sensing using Raman spectroscopy

Multivariate calibration is an important tool for spectroscopic measurermnent of analyte con-centrations.We present a detailed study of a hybrid multivariate calibration technique,con-strained regularization(CR),and demonstrate its utility in noninvasive glucose sensing uasing Raman spectroscopy.Similar to partial least squares(PIS)and principal component regression(PCR),CR builds an implicit model and requires knowledge only of the concentrations of the analyte of interest.Calibration is treated as an inverse problem in which an optimal balance between model complexity and noise rejection is achieved.Prior information is included in the form of a spectroscopic constraint that can be obtained conveniently.When used with an appropriate constraint,CR provides a better calibration model compared to PLS in both numerical and experimental studies.

On Unsupervised Training of Multi-Class Regularized Least-Squares Classifiers

In this work we present the first efficient algorithm for unsupervised training of multi-class regularized least- squares classifiers. The approach is closely related to the unsupervised extension of the support vector machine classifier known as maximum margin clustering, which recently has received considerable attention, though mostly considering the binary classification case. We present a combinatorial search scheme that combines steepest descent strategies with powerful meta-heuristics for avoiding bad local optima. The regularized least-squares based formulation of the problem allows us to use matrix algebraic optimization enabling constant time checks for the intermediate candidate solutions during the search. Our experimental evaluation indicates the potential of the novel method and demonstrates its superior clustering performance over a variety of competing methods on real world datasets. Both time complexity analysis and experimental comparisons show that the method can scale well to practical sized problems.

The Principle of Square Hole Machining and It＇s Tooling Structure Design

In order to meet the rapid needs of processing square hole in mechanical equipment, the paper expounds the square hole processing method： planetary wheel method, and analyze the principle of tooling structure and process with computer graphics parameters design. The results that, as long as the appropriate parameters, using the above method not only can punch the square hole, can also be processed triangle, the five angle and hexagonal regular polygon holes. The square hole processing method can provide theoretical basis and engineering reliable reference for related engineering and technical personnel.

一种求解低秩矩阵补全的修正加速近端梯度算法

设计适应大规模数据的快速算法是求解低秩矩阵补全的重点。文章改变了加速近端梯度算法的步长,对近似函数的近端最优点和上一迭代点增加了一个仿射组合。通过控制仿射系数,能够使得到的新迭代点有靠近原函数的趋势,进而能在保持算法精度的同时提高算法效率。最后通过相应的数值实验证明了算法的有效性和稳定性。

Performance Analysis of ZF and RZF in Low-Resolution ADC/DAC Massive MIMO Systems

Large number of antennas and higher bandwidth usage in massive multiple-input-multipleoutput(MIMO)systems create immense burden on receiver in terms of higher power consumption.The power consumption at the receiver radio frequency(RF)circuits can be significantly reduced by the application of analog-to-digital converter(ADC)of low resolution.In this paper we investigate bandwidth efficiency(BE)of massive MIMO with perfect channel state information(CSI)by applying low resolution ADCs with Rician fadings.We start our analysis by deriving the additive quantization noise model,which helps to understand the effects of ADC resolution on BE by keeping the power constraint at the receiver in radar.We also investigate deeply the effects of using higher bit rates and the number of BS antennas on bandwidth efficiency(BE)of the system.We emphasize that good bandwidth efficiency can be achieved by even using low resolution ADC by using regularized zero-forcing(RZF)combining algorithm.We also provide a generic analysis of energy efficiency(EE)with different options of bits by calculating the energy efficiencies(EE)using the achievable rates.We emphasize that satisfactory BE can be achieved by even using low-resolution ADC/DAC in massive MIMO.

基于参数自修正的配电网故障定位数字孪生技术研究

配电网参数受天气条件和负载条件等因素影响会发生变化。由于传感装置安装有限、数据延时传输等因素,无法实时获得配电网准确参数,进而给传统故障定位方法的精度带来影响。针对以上问题,通过建立配电网数字孪生模型,基于配电网数字孪生模型的参数自修正技术,提出了一种定位模型随参数变化动态校正的配电网故障定位方法。同时,搭建了基于数字孪生服务器和实时数字仿真系统(real time digital system, RTDS)的数字孪生平台,实现了配电网实时的物理模型和数字孪生模型的同步运行。在算例仿真中,利用该数字孪生平台,验证了基于数字孪生技术的配电网故障定法方法。结果表明,该方法可在各类系统运行条件下实时修正配电网参数,显著提高配电网故障定位的速度和精度。

Regularized Kernel Forms of Minimum Squared Error Method

Minimum squared error(MSE)algorithm is one of the classical pattern recognition and regression analysis methods,whose objective is to minimize the squared error summation between the output of linear function and the desired output.In this paper,the MSE algorithm is modified by using kernel functions satisfying the Mercer condition and regularization technique;and the nonlinear MSE algorithms based on kernels and regularization term,that is,the regularized kernel forms of MSE algorithm,are proposed.Their objective functions include the squared error summation between the output of nonlinear function based on kernels and the desired output and a proper regularization term.The regularization technique can handle ill-posed problems,reduce the solution space,and control the generalization.Three squared regularization terms are utilized in this paper.In accordance with the probabilistic interpretation of regularization terms,the difference among three regularization terms is given in detail.The synthetic and real data are used to analyze the algorithm performance.

起伏地形大地电磁二维反演

为了适应地形起伏的实际地质情况,开展带地形的最小二乘二维反演研究。鉴于大地电磁(MT)反演的不适定问题,引入Tikhonov的正则化方法,从而获得关于总目标函数的方程,利用光滑约束最小二乘法求解总目标函数方程。由于正则化因子值与反演精度以及稳定性相关,采用主动约束平衡方法获取最优化的正则化因子,以确保反演精度和稳定性都达到最佳。与此同时,利用电磁场互易定理以节省反演迭代过程求解雅可比矩阵的计算时间。构建了若干地质构造模型进行试算,分别讨论TE、TM模式以及二者联合模式的反演结果,并与前人研究工作对比以说明本文方法的反演效果。

采用核相关滤波器的自适应尺度目标跟踪

由于现存的大多数基于检测的跟踪器都没有解决尺度变化问题,本文在传统的基于检测的目标跟踪框架下设计了一种尺度估计策略,并给出了基于核相关滤波器的自适应尺度目标跟踪算法。该算法利用核函数对正则化最小二乘分类器求解获得核相关滤波器,通过对核相关滤波器的在线学习完成目标位置和尺度的检测,并在线更新核相关滤波器。为了验证本文算法的有效性,选取了10组场景复杂的视频序列进行测试,并与其它5种优秀跟踪方法进行了对比。结果表明,本文提出的方法比上述5种优秀跟踪方法中的最优者的平均距离精度提高了6.9%,且在目标发生尺度变化、光照变化、部分遮挡、姿态变化、旋转、快速运动等复杂场景下有较强的鲁棒性。

单频GPS快速定位中病态问题的解法研究

研究只利用少数历元GPS载波相位观测值进行快速定位时的新解法。在分析病态法矩阵结构特性的基础上,基于TIKHONOV正则化原理,提出一种选择正则化矩阵R的新方法,减弱法方程的病态性。与其他方法相比,新方法得到与模糊度准确值更接近的浮动解及其相应的均方误差矩阵。结合LAMBDA方法,用均方误差矩阵代替协方差阵确定模糊度的搜索范围,可准确快速地确定模糊度,最后得到基线向量的解。结合算例,将新解法与最小二乘估计、岭估计和截断奇异值法分别结合LAMBDA方法解算模糊度的结果进行比较分析,展示新解法的效果。

岩土工程弹塑性物性辨识问题数值求解格式

本文提出了求解复杂结构弹塑性物性辨识问题的正则化最小二乘迭代反演算法。给出了差分近似导数的灵敏度计算格式。为克服不适定性带来的困难，并保证解的稳定性和合理性，提出了相应的数值处理方法。

均方误差意义下正则化解优于最小二乘解的条件

利用矩阵理论导出了均方误差意义下正则化解优于最小二乘解的条件 ,构造了相应的检验统计量 。