The Polynomial Function Model in Born-Infeld Theory

Based on the Lagrangian action density under Born-Infeld type dynamics and motivated by the one-dimensional prescribed mean curvature equation,we investigate the polynomial function model in Born-Infeld theory in this paper with the form of-([10α(φ′)^(2)]φ′)′=λf(φ(x)),whereλ>0 is a real parameter,f∈C 2(0,+∞)is a nonlinear function.We are interested in the exact number of positive solutions of the above nonlinear equation.We specifically develop for the problem combined with a careful analysis of a time-map method.

On Polynomial Functions over Finite Commutative Rings

Let R be an arbitrary finite commutative local ring. In this paper, we obtain a necessary and sufficient condition for a function over R to be a polynomial function. Before this paper, necessary and sufficient conditions for a function to be a polynomial function over some special finite commutative local rings were obtained.

Multi-criteria classification approach with polynomial aggregation function and incomplete certain information

The relationship between the importance of criterion and the criterion aggregation function is discussed, criterion＇s weight and combinational weights between some criteria are defined, and a multi-criteria classification method with incomplete certain information and polynomial aggregation function is proposed. First, linear programming is constructed by classification to reference alternative set （assignment examples） and incomplete certain information on criterion＇s weights. Then the coefficient of the polynomial aggregation function and thresholds of categories are gained by solving the linear programming. And the consistency index of alternatives is obtained, the classification of the alternatives is achieved. The certain criteria＇s values of categories and uncertain criteria＇s values of categories are discussed in the method. Finally, an example shows the feasibility and availability of this method.

On the Number Counting of Polynomial Functions

Polynomial functions （in particular, permutation polynomials） play an important role in the design of modern cryptosystem. In this note the problem of counting the number of polynomial functions over finite commutative rings is discussed. Let A be a general finite commutative local ring. Under a certain condition, the counting formula of the number of polynomial functions over A is obtained. Before this paper, some results over special finite commutative rings were obtained by many authors.

Extended Kantorovich method for local stresses in composite laminates upon polynomial stress functions

The extended Kantorovich method is employed to study the local stress concentrations at the vicinity of free edges in symmetrically layered composite laminates subjected to uniaxial tensile load upon polynomial stress functions. The stress fields are initially assumed by means of the Lekhnitskii stress functions under the plane strain state. Applying the principle of complementary virtual work,the coupled ordinary differential equations are obtained in which the solutions can be obtained by solving a generalized eigenvalue problem. Then an iterative procedure is established to achieve convergent stress distributions. It should be noted that the stress function based extended Kantorovich method can satisfy both the traction-free and free edge stress boundary conditions during the iterative processes. The stress components near the free edges and in the interior regions are calculated and compared with those obtained results by finite element method（FEM）. The convergent stresses have good agreements with those results obtained by three dimensional（3D） FEM. For generality, various layup configurations are considered for the numerical analysis. The results show that the proposed polynomial stress function based extended Kantorovich method is accurate and efficient in predicting the local stresses in composite laminates and computationally much more efficient than the 3D FEM.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO LINEAR MATRIX MOMENT FUNCTION ALS:THEORY AND APPLICATIONS

In this paper orthogonal matrix polynomials with respect to a right matrix moment functional an introduced. Basic results, important examples and applications to the approximation of matrix integrals are studied. Error bounds for the proposed matrix quadrature rules are given.

SIMULTANEOUSE APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVES BY LAGRANGE INTERPOLATING POLYNOMIALS

This paper establishes the following pointwise result for simultancous Lagrange imterpolating approxima- tion:,then |f^(k)(x)-P_n^(k)(f,x)|=O(1)△_n^(q-k)(x)ω where P_n(f,x)is the Lagrange interpolating potynomial of deereeon the nodes X_nUY_n(see the definition of the next).

Lacunary Generating Functions of Hybrid Type Polynomials in Viewpoint of Symbolic Approach

In this paper,we introduce mon-symbolic method to obtain the generating functions of the hybrid class of Hermite-associated Laguerre and its associated polynomials.We obtain the series definitions of these hybrid special polynomials.Also,we derive the double lacunary generating functions of the Hermite-Laguerre polynomials and the Hermite-Laguerre-Wright polynomials.Further,we find multiplicative and derivative operators for the Hermite-Laguerre-Wright polynomials which helps to find the symbolic differential equation of the Hermite-Laguerre-Wright polynomials.Some concluding remarks are also given.

ORTHOGONAL MATRIX POLYNOMIALS WITH RESPECT TO A CONJUGATE BILINEAR MATRIX MOMENT FUNCTIONAL: BASIC THEORY

In this paper basic results for a theory of orthogonal matrix polynomials with respect to a conjugate bilinear matrix moment functional are proposed. Properties of orthogonal matrix polynomial sequences including a three term matrix relationship are given. Positive definite conjugate bilinear matrix moment functionals are introduced and a characterization of positive definiteness in terms of a block Haenkel moment matrix is established. For each positive definite conjugate bilinear matrix moment functional an associated matrix inner product is defined.

ON APPROXIMATION OF A FUNCTION AND ITS DERIVATIVES BY A POLYNOMIAL AND ITS DERIVATIVES

Let g∈C^q[-1, 1] be such that g^((k))(±1)=0 for k=0,…,q. Let P_n be an algebraic polynomial of degree at most n, such that P_n^((k))(±1)=0 for k=0,…,[_2~ (q+1)]. Then P_n and its derivatives P_n^((k)) for k≤q well approximate g and its respective derivatives, provided only that P_n well approxi- mates g itself in the weighted norm ‖g(x)-P_n(x) (1-x^2)^(1/2)~q‖ This result is easily extended to an arbitrary f∈C^q[-1, 1], by subtracting from f the polynomial of minnimal degree which interpolates f^((0))…,f^((q)) at±1. As well as providing easy criteria for judging the simultaneous approximation properties of a given Polynomial to a given function, our results further explain the similarities and differences between algebraic polynomial approximation in C^q[-1, 1] and trigonometric polynomial approximation in the space of q times differentiable 2π-periodic functions. Our proofs are elementary and basic in character, permitting the construction of actual error estimates for simultaneous approximation proedures for small values of q.

ON SIMULTANEOUS APPROXIMATION TO A DIFFERENTIABLE FUNCTION AND ITS DERIVATIVE BY INVERSE PAL-TYPE INTERPOLATION POLYNOMIALS

Let ξn-1<ξn-2 <ξn-2 <… < ξ1 be the zeros of the the (n -1)-th Legendre polynomial Pn-1(x) and - 1 = xn < xn-1 <… < x1 = 1 the zeros of the polynomial W n(x) =- n(n - 1) Pn-1(t)dt = (1 -x2)P'n-1(x). By the theory of the inverse Pal-Type interpolation, for a function f(x) ∈ C[-1 1], there exists a unique polynomial Rn(x) of degree 2n - 2 (if n is even) satisfying conditions Rn(f,ξk) = f(∈ek)(1≤ k≤ n - 1) ;R'n(f,xk) = f'(xk)(1≤ k≤ n). This paper discusses the simultaneous approximation to a differentiable function f by inverse Pal-Type interpolation polynomial {Rn(f,x)} (n is even) and the main result of this paper is that if f ∈ C'[1,1], r≥2, n≥ + 2> and n is even thenholds uniformly for all x ∈ [- 1,1], where h(x) = 1 +

ON HERMITE MATRIX POLYNOMIALS AND HERMITE MATRIX FUNCTIONS

In this paper properties of Hermite matrix polynomials and Hermite matrix functions are studied. The concept ot total set with respect to a matrix functional is introduced and the total property of the Hermite matrix polynomials is proved. Asymptotic behaviour of Hermite matrix polynomials is studied and the relationship of Hermite matrix functions with certain matrix differential equations is developed. A new expression of the matrix exponential for a wide class of matrices in terms of Hermite matrix polynomials is proposed.

V-BILIPSCHITZ DETERMINACY OF WEIGHTED HOMOGENEOUS ANALYTIC FUNCTION-GERMS ON WEIGHTED HOMOGENEOUS REAL ANALYTIC VARIETIES

In this article, we provide estimates for the degree of V bilipschitz determinacy of weighted homogeneous function germs defined on weighted homogeneous analytic variety V satisfying a convenient Lojasiewicz condition.The result gives an explicit order such that the geometrical structure of a weighted homogeneous polynomial function germs is preserved after higher order perturbations.

A Secure Anonymous Internet Electronic Voting Scheme Based on the Polynomial

In this paper, we use the polynomial function and Chaum＇s RSA （Rivest, Shamir, Adleman） blind signature scheme to construct a secure anonymous internet electronic voting scheme. In our scheme, each vote does not need to be revealed in the tallying phase. The ballot number of each candidate gets is counted by computing the degrees of two polynomials＇ greatest common divisor. Our scheme does not require a special voting channel and communication can occur entirely over the current internet.

Convergence Phenomenon with Fourier Series of tg(x2)and Alike

The Fourier series of the 2π-periodic functions tg(x2)and 1sin(x)and some of their relatives (first of their integrals) are investigated and illustrated with respect to their convergence. These functions are Generalized functions and the convergence is weak convergence in the sense of the convergence of continuous linear functionals defining them. The figures show that the approximations of the Fourier series possess oscillations around the function which they represent in a broad band embedding them. This is some analogue to the Gibbs phenomenon. A modification of Fourier series by expansion in powers cosn(x)for the symmetric part of functions and sin(x)cosn−1(x)for the antisymmetric part (analogous to Taylor series) is discussed and illustrated by examples. The Fourier series and their convergence behavior are illustrated also for some 2π-periodic delta-function-like sequences connected with the Poisson theorem showing non-vanishing oscillations around the singularities similar to the Gibbs phenomenon in the neighborhood of discontinuities of functions. .

Fuzzy smooth support vector machine with different smooth functions

Smooth support vector machine （SSVM） changs the normal support vector machine （SVM） into the unconstrained op- timization by using the smooth sigmoid function. The method can be solved under the Broyden-Fletcher-Goldfarb-Shanno （BFGS） algorithm and the Newdon-Armijio （NA） algorithm easily, however the accuracy of sigmoid function is not as good as that of polyno- mial smooth function. Furthermore, the method cannot reduce the influence of outliers or noise in dataset. A fuzzy smooth support vector machine （FSSVM） with fuzzy membership and polynomial smooth functions is introduced into the SVM. The fuzzy member- ship considers the contribution rate of each sample to the optimal separating hyperplane and makes the optimization problem more accurate at the inflection point. Those changes play a positive role on trials. The results of the experiments show that those FSSVMs can obtain a better accuracy and consume the shorter time than SSVM and lagrange support vector machine （LSVM）.

DIFFERENTIAL POLYNOMIALS SHARING ONE VALUE

In this paper, we investigate uniqueness problems of differential polynomials of meromorphic functions. Let a, b be non-zero constants and let n, k be positive integers satisfying n ≥ 3k ＋ 12. If f^n＋ af^（k）and g^n＋ ag^（k）share b CM and the b-points of f^n＋ af^（k）are not the zeros of f and g, then f and g are either equal or closely related.

New useful special function in quantum optics theory

By virtue of the operator Hermite polynomial method [Fan H Y and Zhan D H 2014 Chin. Phys. B 23 060301] we find a new special function which is useful in quantum optics theory, whose expansion involves both power-series and Hermite polynomials, i.e.,min（m,n）∑l=0^min（m,n）n!m!（-1）^l/l!（n-1）!（m-l）!/Hn-l（x）y^m-l≡ n,m（x,y）.By virtue of the operator Hermite polynomial method and the technique of integration within ordered product of operators（IWOP） we derive its generating function. The circumstance in which this new special function appears and is applicable is considered.

Nonlinear Sampled-Data Systems with a Generalized Hold Polynomial-Function for Fast Sampling Rates

It is well-known that such non-conventional digital control schemes,such as generalized sampled-data hold functions,have clear advantages over the conventional single-rate digital control systems.However,they have theoretical negative aspects that deviation of the input can lead to intersample oscillations or intersample ripples.This paper investigates the zero dynamics of sampleddata models,as the sampling period tends to zero,composed of a new generalized hold polynomial function,a nonlinear continuous-time plant and a sampler in cascade.For a new design of generalized hold circuit,the authors give the approximate expression of the resulting sampled-data systems as power series with respect to a sampling period up to the some order term on the basis of the normal form representation for the nonlinear continuous-time systems,and remarkable improvements in the stability properties of discrete system zero dynamics may be achieved by using proper adj us tment.Of particular interest are the stability conditions of sampling zero dynamics in the case of a new hold proposed.Also,an insightful interpretation of the obtained sampled-data models can be made in terms of minimal intersample ripple by design,where the ordinary multirate sampled systems have a poor intersample behavior.It has shown that the intersample behavior arising from the multirate input polynomial function can be localised by appropriately selecting the design parameters based on the stability condition of the sampling zero dynamics.The results presen ted here generalize the well-known notion of sampling zero dynamics from the linear case to nonlinear systems.

On Types of Isolated KKT Points in Polynomial Optimization

Let f be a real polynomial function with n variables and S be a basic closed semialgebraic set in R^(n).In this paper,the authors are interested in the problem of identifying the type(local minimizer,maximizer or not extremum point)of a given isolated KKT point x^(*)of f over S.To this end,the authors investigate some properties of the tangency variety of f on S at x^(*),by which the authors introduce the definition of faithful radius of f over S at x^(*).Then,the authors show that the type of x^(*)can be determined by the global extrema of f over the intersection of S and the Euclidean ball centered at x^(*)with a faithful radius.Finally,the authors propose an algorithm involving algebraic computations to compute a faithful radius of x*and determine its type.