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...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.展开更多
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...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.展开更多
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))...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.展开更多
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 a...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.展开更多
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 ...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.”展开更多
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 gen...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.展开更多
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 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.展开更多
By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn...By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn-1(z)f((n-1))+…+P0(z)f=0 are of infinite order.An exponential polynomial coefficient plays a key role in these results.展开更多
Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex enviro...Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex environment.In this paper,a robust localization algorithm based on Gaussian mixture model and fitting polynomial is proposed to solve the problem of NLOS error.Firstly,fitting polynomials are used to predict the measured values.The residuals of predicted and measured values are clustered by Gaussian mixture model(GMM).The LOS probability and NLOS probability are calculated according to the clustering centers.The measured values are filtered by Kalman filter(KF),variable parameter unscented Kalman filter(VPUKF)and variable parameter particle filter(VPPF)in turn.The distance value processed by KF and VPUKF and the distance value processed by KF,VPUKF and VPPF are combined according to probability.Finally,the maximum likelihood method is used to calculate the position coordinate estimation.Through simulation comparison,the proposed algorithm has better positioning accuracy than several comparison algorithms in this paper.And it shows strong robustness in strong NLOS environment.展开更多
We study a class of quartic polynomial Poincare equations by applying a recurrence formula of focal value. We give the necessary and sufficient conditions for the origin to be a center, and prove that the order of fin...We study a class of quartic polynomial Poincare equations by applying a recurrence formula of focal value. We give the necessary and sufficient conditions for the origin to be a center, and prove that the order of fine focus at the origin for this class of equations is at most 6. Key words quartic polynomial Poincare equation - center - fine focus - order CLC number O 175. 12 Foundation item: Supported by the National Natural Science Foundation of China (19531070)Biography: TIAN De-sheng (1966-), male, Ph. D candidate, research direction: qualitative theory of differential equation.展开更多
Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted n...Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.展开更多
In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions...In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.展开更多
It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,...It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,a closed determinant expression for the degenerate Appell polynomials is derived.The determinant forms for the degenerate Bernoulli and Euler polynomials are also investigated.A new class of the degenerate Hermite-Appell polynomials is investigated and some novel identities for these polynomials are established.The degenerate Hermite-Bernoulli and degenerate Hermite-Euler polynomials are considered as special cases of the degenerate Hermite-Appell polynomials.Further,by using Mathematica,we draw graphs of degenerate Hermite-Bernoulli polynomials for different values of indices.The zeros of these polynomials are also explored and their distribution is presented.展开更多
In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and fo...In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.展开更多
In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynom...Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynomials, Bernoulli numbers;its recurrence formulae and a very simple formula for calculating simultaneously Euler numbers and Euler polynomials. The expansions of Euler polynomials into Fourier series are also obtained;the formulae for obtaining all π<sup>m</sup> as series on k<sup>-m</sup> and for expanding functions into series of Euler polynomials.展开更多
In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legen...In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.展开更多
In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely ma...In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely many multiple zeros,the zero distribution of difference polynomials of f (z+c)-af^(n)(z) and f (z)f (z+c_1)···f (z+c_n) are investigated.A number of examples are also presented to show that our results are best possible in a certain sense.展开更多
This paper presents a novel approach to improve aliasing rejection in comb-based decimation filters. The method is established on certain palindromic polynomials with all zeros on the unit circle and the sharpening te...This paper presents a novel approach to improve aliasing rejection in comb-based decimation filters. The method is established on certain palindromic polynomials with all zeros on the unit circle and the sharpening technique. As a result, aliasing rejection and the passband characteristic are improved. The method is illustrated with various examples and compared with the methods from the literature. .展开更多
In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to...In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to project into the subspaces of P<sub>n</sub>[x] where the function h ∈P<sub>n</sub>[x] represents the closets function to f ∈P<sub>n</sub>[x] in the least square sense. I also demonstrate that we can generalise projections by constructing operators i.e. in R<sup>n+1</sup> using the metric tensor on P<sub>n</sub>[x]. This allows one to project a polynomial function onto another by mapping it to its coefficient vector in R<sup>n+1</sup>. This can be also achieved with the Kronecker Product as detailed in this paper.展开更多
基金supported by Science and Technology Project of Yunnan Provincial Transportation Department(Grant No.25 of 2018)the National Natural Science Foundation of China(Grant No.52279107)The authors are grateful for the support by the China Scholarship Council(CSC No.202206260203 and No.201906690049).
文摘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.
基金supported by the National Natural Science Foundation of China(12131015,12071422).
文摘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.
文摘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.
基金supported by the Young Scientists Fund of the National Natural Science Foundation of China(No.62102444)a Major Research Project in Higher Education Institutions in Henan Province(No.23A560015).
文摘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.
文摘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.”
基金Project supported by the National Research Foundation of Korea(Nos.NRF-2020R1C1C1011970 and NRF-2018R1A5A7023490)。
文摘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.
文摘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.
基金supported partly by the National Natural Science Foundation of China(12171050,11871260)National Science Foundation of Guangdong Province(2018A030313508)。
文摘By looking at the situation when the coefficients Pj(z)(j=1,2,…,n-1)(or most of them) are exponential polynomials,we investigate the fact that all nontrivial solutions to higher order differential equations f((n))+Pn-1(z)f((n-1))+…+P0(z)f=0 are of infinite order.An exponential polynomial coefficient plays a key role in these results.
基金supported by the National Natural Science Foundation of China under Grant No.62273083 and No.61973069Natural Science Foundation of Hebei Province under Grant No.F2020501012。
文摘Wireless sensor network(WSN)positioning has a good effect on indoor positioning,so it has received extensive attention in the field of positioning.Non-line-of sight(NLOS)is a primary challenge in indoor complex environment.In this paper,a robust localization algorithm based on Gaussian mixture model and fitting polynomial is proposed to solve the problem of NLOS error.Firstly,fitting polynomials are used to predict the measured values.The residuals of predicted and measured values are clustered by Gaussian mixture model(GMM).The LOS probability and NLOS probability are calculated according to the clustering centers.The measured values are filtered by Kalman filter(KF),variable parameter unscented Kalman filter(VPUKF)and variable parameter particle filter(VPPF)in turn.The distance value processed by KF and VPUKF and the distance value processed by KF,VPUKF and VPPF are combined according to probability.Finally,the maximum likelihood method is used to calculate the position coordinate estimation.Through simulation comparison,the proposed algorithm has better positioning accuracy than several comparison algorithms in this paper.And it shows strong robustness in strong NLOS environment.
文摘We study a class of quartic polynomial Poincare equations by applying a recurrence formula of focal value. We give the necessary and sufficient conditions for the origin to be a center, and prove that the order of fine focus at the origin for this class of equations is at most 6. Key words quartic polynomial Poincare equation - center - fine focus - order CLC number O 175. 12 Foundation item: Supported by the National Natural Science Foundation of China (19531070)Biography: TIAN De-sheng (1966-), male, Ph. D candidate, research direction: qualitative theory of differential equation.
基金partly supported by the National Natural Science Foundation of China(61751303,U20A2068,11771013)the Zhejiang Provincial Natural Science Foundation of China(LD19A010001)the Fundamental Research Funds for the Central Universities。
文摘Weighted vertex cover(WVC)is one of the most important combinatorial optimization problems.In this paper,we provide a new game optimization to achieve efficiency and time of solutions for the WVC problem of weighted networks.We first model the WVC problem as a general game on weighted networks.Under the framework of a game,we newly define several cover states to describe the WVC problem.Moreover,we reveal the relationship among these cover states of the weighted network and the strict Nash equilibriums(SNEs)of the game.Then,we propose a game-based asynchronous algorithm(GAA),which can theoretically guarantee that all cover states of vertices converging in an SNE with polynomial time.Subsequently,we improve the GAA by adding 2-hop and 3-hop adjustment mechanisms,termed the improved game-based asynchronous algorithm(IGAA),in which we prove that it can obtain a better solution to the WVC problem than using a the GAA.Finally,numerical simulations demonstrate that the proposed IGAA can obtain a better approximate solution in promising computation time compared with the existing representative algorithms.
基金funded by Research Deanship at the University of Ha’il,Saudi Arabia,through Project No.RG-21144.
文摘In this article,we construct the generating functions for new families of special polynomials including two parametric kinds of Bell-based Bernoulli and Euler polynomials.Some fundamental properties of these functions are given.By using these generating functions and some identities,relations among trigonometric functions and two parametric kinds of Bell-based Bernoulli and Euler polynomials,Stirling numbers are presented.Computational formulae for these polynomials are obtained.Applying a partial derivative operator to these generating functions,some derivative formulae and finite combinatorial sums involving the aforementioned polynomials and numbers are also obtained.In addition,some remarks and observations on these polynomials are given.
文摘It is remarkable that studying degenerate versions of polynomials from algebraic point of view is not limited to only special polynomials but can also be extended to their hybrid polynomials.Indeed for the first time,a closed determinant expression for the degenerate Appell polynomials is derived.The determinant forms for the degenerate Bernoulli and Euler polynomials are also investigated.A new class of the degenerate Hermite-Appell polynomials is investigated and some novel identities for these polynomials are established.The degenerate Hermite-Bernoulli and degenerate Hermite-Euler polynomials are considered as special cases of the degenerate Hermite-Appell polynomials.Further,by using Mathematica,we draw graphs of degenerate Hermite-Bernoulli polynomials for different values of indices.The zeros of these polynomials are also explored and their distribution is presented.
文摘In expansions of arbitrary functions in Bessel functions or Spherical Bessel functions, a dual partner set of polynomials play a role. For the Bessel functions, these are the Chebyshev polynomials of first kind and for the Spherical Bessel functions the Legendre polynomials. These two sets of functions appear in many formulas of the expansion and in the completeness and (bi)-orthogonality relations. The analogy to expansions of functions in Taylor series and in moment series and to expansions in Hermite functions is elaborated. Besides other special expansion, we find the expansion of Bessel functions in Spherical Bessel functions and their inversion and of Chebyshev polynomials of first kind in Legendre polynomials and their inversion. For the operators which generate the Spherical Bessel functions from a basic Spherical Bessel function, the normally ordered (or disentangled) form is found.
文摘In this note, we first derive an exponential generating function of the alternating run polynomials. We then deduce an explicit formula of the alternating run polynomials in terms of the partial Bell polynomials.
文摘Utilization of the shift operator to represent Euler polynomials as polynomials of Appell type leads directly to its algebraic properties, its relations with powers sums;may be all its relations with Bernoulli polynomials, Bernoulli numbers;its recurrence formulae and a very simple formula for calculating simultaneously Euler numbers and Euler polynomials. The expansions of Euler polynomials into Fourier series are also obtained;the formulae for obtaining all π<sup>m</sup> as series on k<sup>-m</sup> and for expanding functions into series of Euler polynomials.
基金Supporting Project No.(PNURSP2022R 14),Princess Nourah bint A bdurahman University,Riyadh,Saudi Arabia.
文摘In this manuscript,an algorithm for the computation of numerical solutions to some variable order fractional differential equations(FDEs)subject to the boundary and initial conditions is developed.We use shifted Legendre polynomials for the required numerical algorithm to develop some operational matrices.Further,operational matrices are constructed using variable order differentiation and integration.We are finding the operationalmatrices of variable order differentiation and integration by omitting the discretization of data.With the help of aforesaid matrices,considered FDEs are converted to algebraic equations of Sylvester type.Finally,the algebraic equations we get are solved with the help of mathematical software like Matlab or Mathematica to compute numerical solutions.Some examples are given to check the proposed method’s accuracy and graphical representations.Exact and numerical solutions are also compared in the paper for some examples.The efficiency of the method can be enhanced further by increasing the scale level.
基金Supported by the National Natural Science Foundation of China (11926201)Natural Science Foundation of Guangdong Province (2018A030313508)。
文摘In this paper,suppose that a,c∈C{0},c_(j)∈C(j=1,2,···,n) are not all zeros and n≥2,and f (z) is a finite order transcendental entire function with Borel finite exceptional value or with infinitely many multiple zeros,the zero distribution of difference polynomials of f (z+c)-af^(n)(z) and f (z)f (z+c_1)···f (z+c_n) are investigated.A number of examples are also presented to show that our results are best possible in a certain sense.
文摘This paper presents a novel approach to improve aliasing rejection in comb-based decimation filters. The method is established on certain palindromic polynomials with all zeros on the unit circle and the sharpening technique. As a result, aliasing rejection and the passband characteristic are improved. The method is illustrated with various examples and compared with the methods from the literature. .
文摘In this article, I consider projection groups on function spaces, more specifically the space of polynomials P<sub>n</sub>[x]. I will show that a very similar construct of projection operators allows us to project into the subspaces of P<sub>n</sub>[x] where the function h ∈P<sub>n</sub>[x] represents the closets function to f ∈P<sub>n</sub>[x] in the least square sense. I also demonstrate that we can generalise projections by constructing operators i.e. in R<sup>n+1</sup> using the metric tensor on P<sub>n</sub>[x]. This allows one to project a polynomial function onto another by mapping it to its coefficient vector in R<sup>n+1</sup>. This can be also achieved with the Kronecker Product as detailed in this paper.