A New Approach for the Calculation of Slope Failure Probability with Fuzzy Limit-State Functions

This study presents an innovative approach to calculating the failure probability of slopes by incorporating fuzzylimit-state functions,a method that significantly enhances the accuracy and efficiency of slope stability analysis.Unlike traditional probabilistic techniques,this approach utilizes a least squares support vector machine(LSSVM)optimized with a grey wolf optimizer(GWO)and K-fold cross-validation(CV)to approximate the limit-statefunction,thus reducing computational complexity.The novelty of this work lies in its application to one-dimensional(1D),two-dimensional(2D),and three-dimensional(3D)slope models,demonstrating its versatility andhigh precision.The proposed method consistently achieves error margins within 3%of Monte Carlo simulation(MCS)results,while substantially reducing computation time,particularly for 2D and 3D models.This makes theapproach highly practical for real-world engineering applications.Furthermore,by applying fuzzy mathematics tohandle uncertainties in geotechnical properties,the method offers a more realistic and comprehensive understandingof slope stability.As water is the main factor influencing the stability of slopes,this aspect is investigatedby calculating the phreatic line after the change in water level.Relevant examples are used to show that the failureprobability of a slope under water wading condition can increase by more than 20%(increase rates in 1D,2D and3D conditions being 25%,27%and 31%,respectively)compared with the natural condition.The influence ofdiverse fuzzy membership functions—linear,normal,and Cauchy—on failure probability is also considered.Thisresearch not only provides a strategy for better calculation of the slope failure probability but also pioneers theintegration of computational intelligence,fuzzy logic and fluid-dynamics in geotechnical engineering,presentingan innovative and efficient tool for slope stability analysis.

Comparative Study of Probabilistic and Least-Squares Methods for Developing Predictive Models

This article explores the comparison between the probability method and the least squares method in the design of linear predictive models. It points out that these two approaches have distinct theoretical foundations and can lead to varied or similar results in terms of precision and performance under certain assumptions. The article underlines the importance of comparing these two approaches to choose the one best suited to the context, available data and modeling objectives.

Properties of the total least squares estimation

Through theoretical derivation, some properties of the total least squares estimation are found. The total least squares estimation is the linear transformation of the least squares estimation, and the total least squares estimation is unbiased. The condition number of the total least squares estimation is greater than the least squares estimation, so the total least squares estimation is easier to be affected by the data error than the least squares estimation. Then through the further derivation, the relationships of solutions, residuals and unit weight variance estimations between the total least squares and the least squares are given.

ASYMPTOTIC PROPERTY STUDY OF THE LEAST SQUARE ESTIMATES OF 2-D EXPONENTIAL SIGNALS VIA COMPLEX SIGNAL PROCESSING APPROACH

By use of the approach of complex random signal processing, the asymptotic statistical properties of the least square estimates of 2-D exponential signals are studied. In doing so it is found that the representation is considerably more intuitive, and is analytically more tractable.

THE INEFFICIENCY OF THE LEAST SQUARES ESTIMATOR AND ITS BOUND

It was suggested by Pantanen that the mean squared error may be used to measure the inefficiency of the least squares estimator. Styan[2] and Rao[3] et al. discussed this inefficiency and it's bound later. In this paper we propose a new inefficiency of the least squares estimator with the measure of generalized variance and obtain its bound.

LEAST SQUARES ESTIMATION FOR ORNSTEIN-UHLENBECK PROCESSES DRIVEN BY THE WEIGHTED FRACTIONAL BROWNIAN MOTION

In this article, we study a least squares estimator （LSE） of θ for the Ornstein- Uhlenbeck process X0=0,dXt=θXtdt＋dBt^ab, t ≥ 0 driven by weighted fractional Brownian motion B^a,b with parameters a, b. We obtain the consistency and the asymptotic distribution of the LSE based on the observation {Xs, s∈[0,t]} as t tends to infinity.

ERRATUM TO： LEAST SQUARES ESTIMATION FOR ORNSTEIN-UHLENBECK PROCESSES DRIVEN BY THE WEIGHTED FRACTIONAL BROWNIAN MOTION （ACTA MATHEMATICA SCIENTIA 2016,36B （2） ：394-408）

We give a correction of Theorem 2.2 of Shen, Yin and Yan （2016）.

THE LEAST SQUARES ESTIMATOR FOR AN ORNSTEIN-UHLENBECK PROCESS DRIVEN BY A HERMITE PROCESS WITH A PERIODIC MEAN

We consider the least square estimator for the parameters of Ornstein-Uhlenbeck processes dY_(s)=(∑_(j=1)^(k)μ_(j)φ_(j)(s)-βY_(s))ds+dZ_(s)^(q,H),driven by the Hermite process Z_(s)^(q,H)with order q≥1 and a Hurst index H∈(1/2,1),where the periodic functionsφ_(j)(s),,j=1,...,κare bounded,and the real numbersμ_(j),,j=1,...,κtogether withβ>0 are unknown parameters.We establish the consistency of a least squares estimation and obtain the asymptotic behavior for the estimator.We also introduce alternative estimators,which can be looked upon as an application of the least squares estimator.In terms of the fractional Ornstein-Uhlenbeck processes with periodic mean,our work can be regarded as its non-Gaussian extension.

AN ASSESSMENT OF THE MESHLESS WEIGHTED LEAST-SQUARE METHOD

The meshless weighted least-square (MWLS) method was developed based on the weighted least-square method. The method possesses several advantages, such as high accuracy, high stability and high e?ciency. Moreover, the coe?cient matrix obtained is symmetric and semi- positive de?nite. In this paper, the method is further examined critically. The e?ects of several parameters on the results of MWLS are investigated systematically by using a cantilever beam and an in?nite plate with a central circular hole. The numerical results are compared with those obtained by using the collocation-based meshless method (CBMM) and Galerkin-based meshless method (GBMM). The investigated parameters include the type of approximations, the type of weight functions, the number of neighbors of an evaluation point, as well as the manner in which the neighbors of an evaluation point are determined. This study shows that the displacement accuracy and convergence rate obtained by MWLS is comparable to that of the GBMM while the stress accuracy and convergence rate yielded by MWLS is even higher than that of GBMM. Furthermore, MWLS is much more e?cient than GBMM. This study also shows that the instability of CBMM is mainly due to the neglect of the equi- librium residuals at boundary nodes. In MWLS, the residuals of all the governing equations are minimized in a weighted least-square sense.

A Study of EM Algorithm as an Imputation Method: A Model-Based Simulation Study with Application to a Synthetic Compositional Data

Compositional data, such as relative information, is a crucial aspect of machine learning and other related fields. It is typically recorded as closed data or sums to a constant, like 100%. The statistical linear model is the most used technique for identifying hidden relationships between underlying random variables of interest. However, data quality is a significant challenge in machine learning, especially when missing data is present. The linear regression model is a commonly used statistical modeling technique used in various applications to find relationships between variables of interest. When estimating linear regression parameters which are useful for things like future prediction and partial effects analysis of independent variables, maximum likelihood estimation (MLE) is the method of choice. However, many datasets contain missing observations, which can lead to costly and time-consuming data recovery. To address this issue, the expectation-maximization (EM) algorithm has been suggested as a solution for situations including missing data. The EM algorithm repeatedly finds the best estimates of parameters in statistical models that depend on variables or data that have not been observed. This is called maximum likelihood or maximum a posteriori (MAP). Using the present estimate as input, the expectation (E) step constructs a log-likelihood function. Finding the parameters that maximize the anticipated log-likelihood, as determined in the E step, is the job of the maximization (M) phase. This study looked at how well the EM algorithm worked on a made-up compositional dataset with missing observations. It used both the robust least square version and ordinary least square regression techniques. The efficacy of the EM algorithm was compared with two alternative imputation techniques, k-Nearest Neighbor (k-NN) and mean imputation (), in terms of Aitchison distances and covariance.

Outliers, inliers and the generalized least trinuned squares estimator in system identification

The least trimmed squares estimator (LTS) is a well known robust estimator in terms of protecting the estimate from the outliers. Its high computational complexity is however a problem in practice. We show that the LTS estimate can be obtained by a simple algorithm with the complexity 0( N In N) for large N, where N is the number of measurements. We also show that though the LTS is robust in terms of the outliers, it is sensitive to the inliers. The concept of the inliers is introduced. Moreover, the Generalized Least Trimmed Squares estimator (GLTS) together with its solution are presented that reduces the effect of both the outliers and the inliers. Keywords Least squares - Least trimmed squares - Outliers - System identification - Parameter estimation - Robust parameter estimation This work was supported in part by NSF ECS — 9710297 and ECS — 0098181.

A NONLINEAR GALERKIN/PETROV-LEAST SQUARES MIXED ELEMENT METHOD FOR THE STATIONARY NAVIER-STOKES EQUATIONS

A nonlinear Galerkin/Petrov-least squares mixed element (NGPLSME) method for the stationary Navier-Stokes equations is presented and analyzed. The scheme is that Petrov-least squares forms of residuals are added to the nonlinear Galerkin mixed element method so that it is stable for any combination of discrete velocity and pressure spaces without requiring the Babu*lka-Brezzi stability condition. The existence, uniqueness and convergence (at optimal rate) of the NGPLSME solution is proved in the case of sufficient viscosity (or small data).

A new method of weight choice in InSAR least squares unwrapping

The de-coherence phenomena such as Low-SNR radar signal, shadows and layover caused by topography, etc. , causing phase data discontinuity, makes the result of unwrapping phase inaccuracy or even completely wrong. Based on the analysis of influencing factors to weight choice, this thesis develops a new method to choose the weights based on the measure of the confidence in the frequency domain. Experiments show that it could overcome the defect of sub-estimate to the slope of least squares method very well, which has a better rationale, stability and performance.

A new method of weighted choice in InSAR Least Squares unwrapping

The decorelation phenomena such as Low-SNR radar signal, shadows and layover caused by topography etc, causes phase data discontinuous and makes the result of unwrapping phase inaccurate or completely wrong. Based on the analysis of influencing factors to the weight selection, this paper develops a new method to choose the weights based on the measurement of confidence in frequency domain. Results show that it is more precise and robust than other methods, and can make up for the defect of sub-estimate to the slope of least squares method.

Moving least squares-based multi-functional sensing technique for estimating viscosity and density of ternary solution

In the osmotic dehydration process of food,on-line estimation of concentrations of two components in ternary solution with NaCl and sucrose was performed based on multi-functional sensing technique.Moving Least Squares were adopted in approximation procedure to estimate the viscosity of such interested ternary solution with the given data set.As a result,in one mode of using total experimental data as calibration data and validation data,the relative deviations of estimated viscosities are less than ±1.24%.In the other mode,by taking total experimental data except the ones for estimation as calibration data,the relative deviations are less than ±3.47%.In the same way,the density of ternary solution can be also estimated with deviations less than ± 0.11% and ± 0.30% respectively in these two models.The satisfactory and accurate results show the extraordinary efficiency of Moving Least Squares behaved in signal approximation for multi-functional sensors.

Mathematical Analysis of Two Approaches for Optimal Parameter Estimates to Modeling Time Dependent Properties of Viscoelastic Materials

Mathematical models for phenomena in the physical sciences are typically parameter-dependent, and the estimation of parameters that optimally model the trends suggested by experimental observation depends on how model-observation discrepancies are quantified. Commonly used parameter estimation techniques based on least-squares minimization of the model-observation discrepancies assume that the discrepancies are quantified with the L2-norm applied to a discrepancy function. While techniques based on such an assumption work well for many applications, other applications are better suited for least-squared minimization approaches that are based on other norm or inner-product induced topologies. Motivated by an application in the material sciences, the new alternative least-squares approach is defined and an insightful analytical comparison with a baseline least-squares approach is provided.

Comparison of Two Time Series Decomposition Methods: Least Squares and Buys-Ballot Methods

This paper discusses comparison of two time series decomposition methods: The Least Squares Estimation (LSE) and Buys-Ballot Estimation (BBE) methods. As noted by Iwueze and Nwogu (2014), there exists a research gap for the choice of appropriate model for decomposition and detection of presence of seasonal effect in a series model. Estimates of trend parameters and seasonal indices are all that are needed to fill the research gap. However, these estimates are obtainable through the Least Squares Estimation (LSE) and Buys-Ballot Estimation (BBE) methods. Hence, there is need to compare estimates of the two methods and recommend. The comparison of the two methods is done using the Accuracy Measures (Mean Error (ME)), Mean Square Error (MSE), the Mean Absolute Error (MAE), and the Mean Absolute Percentage Error (MAPE). The results from simulated series show that for the additive model;the summary statistics (ME, MSE and MAE) for the two estimation methods and for all the selected trending curves are equal in all the simulations both in magnitude and direction. For the multiplicative model, results show that when a series is dominated by trend, the estimates of the parameters by both methods become less precise and differ more widely from each other. However, if conditions for successful transformation (using the logarithmic transform in linearizing the multiplicative model to additive model) are met, both of them give similar results.

LEAST-SQUARES MIXED FINITE ELEMENT METHOD FOR A CLASS OF STOKES EQUATION

A least-squares mixed finite element method was formulated for a class of Stokes equations in two dimensional domains. The steady state and the time-dependent Stokes' equations were considered. For the stationary equation, optimal H-t and L-2-error estimates are derived under the standard regularity assumption on the finite element partition ( the LBB-condition is not required). Far the evolutionary equation, optimal L-2 estimates are derived under the conventional Raviart-Thomas spaces.

RIS辅助的OFDM系统中时变信道估计方法

为了克服在可重构智能反射面(reconfigurable intelligent surface,RIS)辅助的正交频分复用(orthogonal frequency division multiplexing,OFDM)系统中现有基于深度学习的信道估计方法计算复杂度过高的问题,在RIS下利用基扩展模型(base extension model,BEM)对时变信道进行建模,并提出基于残差链接超分辨率卷积神经网络的时变信道估计方法。具体来说,所提方法首先将参数较多的信道系数估计转换为参数较少的基系数估计,以降低所提方法计算复杂度。在线下训练中,利用低分辨率的基系数估计对神经网络进行训练,仅需要少量的输入即可获取高分辨率的信道估计。为了提高所提方法的实用性,将网络训练的标签设置为具有高精度的信道估计值,而非理想的信道信息。仿真实验验证,所提方法在RIS辅助移动通信系统下能够准确获取时变信道信息,且具有更高的估计精度和更低的计算复杂度。