Probabilistic analysis of tunnel face seismic stability in layered rock masses using Polynomial Chaos Kriging metamodel

Face stability is an essential issue in tunnel design and construction.Layered rock masses are typical and ubiquitous;uncertainties in rock properties always exist.In view of this,a comprehensive method,which combines the Upper bound Limit analysis of Tunnel face stability,the Polynomial Chaos Kriging,the Monte-Carlo Simulation and Analysis of Covariance method(ULT-PCK-MA),is proposed to investigate the seismic stability of tunnel faces.A two-dimensional analytical model of ULT is developed to evaluate the virtual support force based on the upper bound limit analysis.An efficient probabilistic analysis method PCK-MA based on the adaptive Polynomial Chaos Kriging metamodel is then implemented to investigate the parameter uncertainty effects.Ten input parameters,including geological strength indices,uniaxial compressive strengths and constants for three rock formations,and the horizontal seismic coefficients,are treated as random variables.The effects of these parameter uncertainties on the failure probability and sensitivity indices are discussed.In addition,the effects of weak layer position,the middle layer thickness and quality,the tunnel diameter,the parameters correlation,and the seismic loadings are investigated,respectively.The results show that the layer distributions significantly influence the tunnel face probabilistic stability,particularly when the weak rock is present in the bottom layer.The efficiency of the proposed ULT-PCK-MA is validated,which is expected to facilitate the engineering design and construction.

Diophantine equations and Fermat's last theorem for multivariate(skew-)polynomials

Fermat’s Last Theorem is a famous theorem in number theory which is difficult to prove.However,it is known that the version of polynomials with one variable of Fermat’s Last Theorem over C can be proved very concisely.The aim of this paper is to study the similar problems about Fermat’s Last Theorem for multivariate(skew)-polynomials with any characteristic.

An Extended Numerical Method by Stancu Polynomials for Solution of Integro-Differential Equations Arising in Oscillating Magnetic Fields

In this study, the Bernstein collocation method has been expanded to Stancu collocation method for numerical solution of the charged particle motion for certain configurations of oscillating magnetic fields modelled by a class of linear integro-differential equations. As the method has been improved, the Stancu polynomials that are generalization of the Bernstein polynomials have been used. The method has been tested on a physical problem how the method can be applied. Moreover, numerical results of the method have been compared with the numerical results of the other methods to indicate the efficiency of the method.

Improving Video Watermarking through Galois Field GF(2^(4)) Multiplication Tables with Diverse Irreducible Polynomials and Adaptive Techniques

Video watermarking plays a crucial role in protecting intellectual property rights and ensuring content authenticity.This study delves into the integration of Galois Field(GF)multiplication tables,especially GF(2^(4)),and their interaction with distinct irreducible polynomials.The primary aim is to enhance watermarking techniques for achieving imperceptibility,robustness,and efficient execution time.The research employs scene selection and adaptive thresholding techniques to streamline the watermarking process.Scene selection is used strategically to embed watermarks in the most vital frames of the video,while adaptive thresholding methods ensure that the watermarking process adheres to imperceptibility criteria,maintaining the video's visual quality.Concurrently,careful consideration is given to execution time,crucial in real-world scenarios,to balance efficiency and efficacy.The Peak Signal-to-Noise Ratio(PSNR)serves as a pivotal metric to gauge the watermark's imperceptibility and video quality.The study explores various irreducible polynomials,navigating the trade-offs between computational efficiency and watermark imperceptibility.In parallel,the study pays careful attention to the execution time,a paramount consideration in real-world scenarios,to strike a balance between efficiency and efficacy.This comprehensive analysis provides valuable insights into the interplay of GF multiplication tables,diverse irreducible polynomials,scene selection,adaptive thresholding,imperceptibility,and execution time.The evaluation of the proposed algorithm's robustness was conducted using PSNR and NC metrics,and it was subjected to assessment under the impact of five distinct attack scenarios.These findings contribute to the development of watermarking strategies that balance imperceptibility,robustness,and processing efficiency,enhancing the field's practicality and effectiveness.

A Collocation Technique via Pell-Lucas Polynomials to Solve Fractional Differential EquationModel for HIV/AIDS with Treatment Compartment

In this study,a numerical method based on the Pell-Lucas polynomials(PLPs)is developed to solve the fractional order HIV/AIDS epidemic model with a treatment compartment.The HIV/AIDS mathematical model with a treatment compartment is divided into five classes,namely,susceptible patients(S),HIV-positive individuals(I),individuals with full-blown AIDS but not receiving ARV treatment(A),individuals being treated(T),and individuals who have changed their sexual habits sufficiently(R).According to the method,by utilizing the PLPs and the collocation points,we convert the fractional order HIV/AIDS epidemic model with a treatment compartment into a nonlinear system of the algebraic equations.Also,the error analysis is presented for the Pell-Lucas approximation method.The aim of this study is to observe the behavior of five populations after 200 days when drug treatment is applied to HIV-infectious and full-blown AIDS people.To demonstrate the usefulness of this method,the applications are made on the numerical example with the help of MATLAB.In addition,four cases of the fractional order derivative(p=1,p=0.95,p=0.9,p=0.85)are examined in the range[0,200].Owing to applications,we figured out that the outcomes have quite decent errors.Also,we understand that the errors decrease when the value of N increases.The figures in this study are created in MATLAB.The outcomes indicate that the presented method is reasonably sufficient and correct.

Sensitivity Analysis of Electromagnetic Scattering from Dielectric Targets with Polynomial Chaos Expansion and Method of Moments

In this paper,an adaptive polynomial chaos expansion method(PCE)based on the method of moments(MoM)is proposed to construct surrogate models for electromagnetic scattering and further sensitivity analysis.The MoM is applied to accurately solve the electric field integral equation(EFIE)of electromagnetic scattering from homogeneous dielectric targets.Within the bistatic radar cross section(RCS)as the research object,the adaptive PCE algorithm is devoted to selecting the appropriate order to construct the multivariate surrogate model.The corresponding sensitivity results are given by the further derivative operation,which is compared with those of the finite difference method(FDM).Several examples are provided to demonstrate the effectiveness of the proposed algorithm for sensitivity analysis of electromagnetic scattering from homogeneous dielectric targets.

Three-dimensional pseudo-dynamic reliability analysis of seismic shield tunnel faces combined with sparse polynomial chaos expansion

To address the seismic face stability challenges encountered in urban and subsea tunnel construction,an efficient probabilistic analysis framework for shield tunnel faces under seismic conditions is proposed.Based on the upper-bound theory of limit analysis,an improved three-dimensional discrete deterministic mechanism,accounting for the heterogeneous nature of soil media,is formulated to evaluate seismic face stability.The metamodel of failure probabilistic assessments for seismic tunnel faces is constructed by integrating the sparse polynomial chaos expansion method(SPCE)with the modified pseudo-dynamic approach(MPD).The improved deterministic model is validated by comparing with published literature and numerical simulations results,and the SPCE-MPD metamodel is examined with the traditional MCS method.Based on the SPCE-MPD metamodels,the seismic effects on face failure probability and reliability index are presented and the global sensitivity analysis(GSA)is involved to reflect the influence order of seismic action parameters.Finally,the proposed approach is tested to be effective by a engineering case of the Chengdu outer ring tunnel.The results show that higher uncertainty of seismic response on face stability should be noticed in areas with intense earthquakes and variation of seismic wave velocity has the most profound influence on tunnel face stability.

The Study of Root Subspace Decomposition between Characteristic Polynomials and Minimum Polynomial

Let Abe the linear transformation on the linear space V in the field P, Vλibe the root subspace corresponding to the characteristic polynomial of the eigenvalue λi, and Wλibe the root subspace corresponding to the minimum polynomial of λi. Consider the problem of whether Vλiand Wλiare equal under the condition that the characteristic polynomial of Ahas the same eigenvalue as the minimum polynomial (see Theorem 1, 2). This article uses the method of mutual inclusion to prove that Vλi=Wλi. Compared to previous studies and proofs, the results of this research can be directly cited in related works. For instance, they can be directly cited in Daoji Meng’s book “Introduction to Differential Geometry.”

A coupled Legendre-Laguerre polynomial method with analytical integration for the Rayleigh waves in a quasicrystal layered half-space with an imperfect interface

The Laguerre polynomial method has been successfully used to investigate the dynamic responses of a half-space.However,it fails to obtain the correct stress at the interfaces in a layered half-space,especially when there are significant differences in material properties.Therefore,a coupled Legendre-Laguerre polynomial method with analytical integration is proposed.The Rayleigh waves in a one-dimensional(1D)hexagonal quasicrystal(QC)layered half-space with an imperfect interface are investigated.The correctness is validated by comparison with available results.Its computation efficiency is analyzed.The dispersion curves of the phase velocity,displacement distributions,and stress distributions are illustrated.The effects of the phonon-phason coupling and imperfect interface coefficients on the wave characteristics are investigated.Some novel findings reveal that the proposed method is highly efficient for addressing the Rayleigh waves in a QC layered half-space.It can save over 99%of the computation time.This method can be expanded to investigate waves in various layered half-spaces,including earth-layered media and surface acoustic wave(SAW)devices.

Generalized polynomial chaos expansion by reanalysis using static condensation based on substructuring

This paper presents a new computational method for forward uncertainty quantification(UQ)analyses on large-scale structural systems in the presence of arbitrary and dependent random inputs.The method consists of a generalized polynomial chaos expansion(GPCE)for statistical moment and reliability analyses associated with the stochastic output and a static reanalysis method to generate the input-output data set.In the reanalysis,we employ substructuring for a structure to isolate its local regions that vary due to random inputs.This allows for avoiding repeated computations of invariant substructures while generating the input-output data set.Combining substructuring with static condensation further improves the computational efficiency of the reanalysis without losing accuracy.Consequently,the GPCE with the static reanalysis method can achieve significant computational saving,thus mitigating the curse of dimensionality to some degree for UQ under high-dimensional inputs.The numerical results obtained from a simple structure indicate that the proposed method for UQ produces accurate solutions more efficiently than the GPCE using full finite element analyses(FEAs).We also demonstrate the efficiency and scalability of the proposed method by executing UQ for a large-scale wing-box structure under ten-dimensional(all-dependent)random inputs.

Solving Some Problems and Elimination in Systems of Polynomial Equations

In a factorial ring, we can define the p.g.c.d. of two elements (defined to the nearest unit) and the notion of prime elements between them. More generally, Bezout’s identity characterizes two prime elements in a main ring. A ring that satisfies the property of the theorem is called a Bezout ring. We have given some geometry theorems that can be proved algebraically, although the methods of geometry and, in particular, of projective geometry are by far the most beautiful. Most geometric problems actually involve polynomial equations and can be translated into the language of polynomial ideals. We have given a few examples of a different nature without pretending to make a general theory.

Linear Functional Equations and Twisted Polynomials

A certain variety of non-switched polynomials provides a uni-figure representation for a wide range of linear functional equations. This is properly adapted for the calculations. We reinterpret from this point of view a number of algorithms.

Step memory polynomial predistorter for power amplifiers with memory

To reduce the number of digital predistortion coefficients, a step memory polynomial （SMP）predistorter is presented. The number of predistortion coefficients is decreased by adjusting the maximum nonlinear order for different memory orders in the traditional memory polynomial （MP）predistorter. The proposed SNIP predistorter is identified by an offline learning structure on which the coefficients can be extracted directly from the sampled input and output of a PA. Simulation results show that the SMP predistorter is not tied to a particular PA model and is, therefore, robust. The effectiveness of the SMP predistorter is demonstrated by simulations and experiments on an MP model, a parallel Wiener model, a Wiener-Hammerstein model, a sparsedelay memory polynomial model and a real PA which is fabricated based on the Freescale LDMOSFET MRF21030. Compared with the traditional MP predistorter, the SMP predistorter can reduce the number of coefficients by 60%.

OFDM blind channel estimation based on polynomial models

A two-dimensional （2-D） polynomial regression model is set up to approximate the time-frequency response of slowly time-varying orthogonal frequency-division multiplexing （OFDM） systems. With this model the estimation of the OFDM time-frequency response is turned into the optimization of some time-invariant model parameters. A new algorithm based on the expectation-maximization （EM） method is proposed to obtain the maximum-likelihood （ML） estimation of the polynomial model parameters over the 2-D observed data. At the same time, in order to reduce the complexity and avoid the computation instability, a novel recursive approach （RPEMTO） is given to calculate the values of the parameters. It is further shown that this 2-D polynomial EM-based algorithm for time-varying OFDM （PEMTO） can be simplified mathematically to handle the one-dimensional sequential estimation. Simulations illustrate that the proposed algorithms achieve a lower bit error rate （BER） than other blind algorithms.

Robust Stability Analysis of Edge Polynomials with Variable Length

The concept of edge polynomials with variable length is introduced. Stability of such polynomials is analyzed. Under the condition that one extreme of the edge is stable, the stability radius of edge polynomials with variable length is characterized in terms of the real spectral radius of the matrix H -1 ( f 0) H (g) , where both H (f 0) and H (g) are Hurwitz like matrices. Based on this result, stability radius of control systems with interval type plants and first order controllers are determined.

Ridge Polynomial神经网络带动量项异步梯度算法的收敛性

将动量项引入到Ridge Polynomial神经网络异步梯度训练算法的误差函数中,有效地改善了算法的收敛效率,并从理论上分析了Ridge Polynomial神经网络的带动量项的异步梯度算法的收敛性,给出了算法的单调性和收敛性(包括强收敛性和弱收敛性)。算法的这些收敛性质对于如何选取学习率和初始权值来进行高效的网络训练是非常重要的。最后通过计算机仿真实验验证了带动量项的异步梯度算法的高效性和理论分析的正确性。

Regional magnetic anomaly fields:3D Taylor polynomial and surface spline models

We used data from 1960.0,1970.0,1980.0,1990.0,and 2000.0 to study the geomagnetic anomaly field over the Chinese mainland by using the three-dimensional Taylor polynomial（3DTP） and the surface spline（SS） models.To obtain the pure anomaly field,the main field and the induced field of the ionospheric and magnetospheric fields were removed from measured data.We also compared the SS model anomalies and the data obtained with Kriging interpolation（KI）.The geomagnetic anomaly distribution over the mainland was analyzed based on the SS and 3DTP models by transferring all points from 1960.0-1990.0 to 2000.0.The results suggest that the total intensity F anomalies estimated based on the SS and KI for each year are basically consistent in distribution and intensity.The anomalous distributions in the X-,Y-,and Z-direction and F are mainly negative.The 3DTP model anomalies suggest that the intensity in the X-direction increases from-100 nT to 0 nT with longitude,whereas the intensity in the Y-direction decreases from 400 nT to 20 nT with longitude and over the eastern mainland is almost negative.The intensity in the Z-direction and F are very similar and in most areas it is about-50 nT and higher in western Tibet.The SS model anomalies overall reflect the actual distribution of the magnetic field anomalies;however,because of the uneven distribution of measurements,it yields several big anomalies.Owing to the added altitude term,the 3DTP model offers higher precision and is consistent with KI.

Polynomial rooting based frequency offset estimation for MIMO OFDM systems

Based on the frequency domain training sequences, the polynomial-based carrier frequency offset （CFO） estimation in multiple-input multiple-output （ MIMO ） orthogonal frequency division multiplexing （ OFDM ） systems is extensively investigated. By designing the training sequences to meet certain conditions and exploiting the Hermitian and real symmetric properties of the corresponding matrices, it is found that the roots of the polynomials corresponding to the cost functions are pairwise and that both meger CFO and fractional CFO can be estimated by the direct polynomial rooting approach. By analyzing the polynomials corresponding to the cost functions and their derivatives, it is shown that they have a common polynomial factor and the former can be expressed in a quadratic form of the common polynomial factor. Analytical results further reveal that the derivative polynomial rooting approach is equivalent to the direct one in estimation at the same signal-to-noise ratio（SNR） value and that the latter is superior to the former in complexity. Simulation results agree well with analytical results.

Fast algorithm for determining the minimal polynomial of up^n-periodic sequence

A fast algorithm for determining the minimal polynomial and linear complexity of a upn-periodic sequence over a finite field Fq is given.Let p,q,and u be distinct primes,q a primitive root modulo p2,m the smallest positive integer such that qm≡1 mod u,and gcd（m,p（p-1））=1.An algorithm is used to reduce a periodic upn sequence over Fq to several pn-periodic sequences over Fq（ζ）,where ζ is a u-th primitive root of unity,and an algorithm proposed by Xiao et al.is employed to obtain the minimal polynomial of each pn-periodic sequence.

Zero Distribution of a Class of Real Polynomial Systems

设P:IR^(2n)→IR~?(2n)是(q_1,…,q_(2n))次实多项式映射,满足q_(2j-1)-q_(2j),j=1,2,…,n。本文讨论这类多项式映射的实零点分布,并给出计算一批实零点的方法。