Sagbi-Gr?bner Bases Under Composition

The process of substituting variables in a polynomial with other polynomials is dubbed polynomial composition. The behaviour of Gr?bner bases and Sagbi bases under composition is well known. In this paper, the authors provide a sufficient and necessary condition on a set Θ of polynomials under which the Sagbi-Gr?bner basis computation commutes with composition. This has natural applications to the computations of Sagbi-Gr?bner bases for subsets of composed polynomials of subalgebra.     

On computing uniform Gröbner bases for ideals generated by polynimials with parametric exponents

Pan and Wang presented a method for computing uniform Gr?bner bases for certain ideals generated by polynomials with parametric exponents in 2006,and two criteria were proposed to determine if a uniform Gr?bner basis can be obtained.This paper gives a new algorithmic approach for computing the uniform Gr?bner basis such that Pan and Wang’s method could be concluded as a special case.The authors use the method of reduced term order under ring homomorphism to get the reduced uniform Gr?bner basis.Also the authors point and correct a mistake in Pan and Wang’s method.The result is a generalization of approach of Pan and Wang and one could compute the uniform Gr?bner basis more efficiently by the new approach.     

Normalization in Riemann Tensor Polynomial Ring

It is one of the oldest research topics in computer algebra to determine the equivalence of Riemann tensor indexed polynomials. However, it remains to be a challenging problem since Grbner basis theory is not yet powerful enough to deal with ideals that cannot be finitely generated. This paper solves the problem by extending Grbner basis theory. First, the polynomials are described via an infinitely generated free commutative monoid ring. The authors then provide a decomposed form of the Grbner basis of the defining syzygy set in each restricted ring. The canonical form proves to be the normal form with respect to the Grbner basis in the fundamental restricted ring, which allows one to determine the equivalence of polynomials. Finally, in order to simplify the computation of canonical form, the authors find the minimal restricted ring.     

A New Algorithm for Computing the Extended Hensel Construction of Multivariate Polynomials

This paper presents a new algorithm for computing the extended Hensel construction(EHC) of multivariate polynomials in main variable x and sub-variables u_1, u_2, ···, u_m over a number field K. This algorithm first constructs a set by using the resultant of two initial coprime factors w.r.t. x, and then obtains the Hensel factors by comparing the coefficients of x~i on both sides of an equation. Since the Hensel factors are polynomials of the main variable with coefficients in fraction field K(u_1, u_2, ···, u_m), the computation cost of handling rational functions can be high. Therefore,the authors use a method which multiplies resultant and removes the denominators of the rational functions. Unlike previously-developed algorithms that use interpolation functions or Gr?bner basis, the algorithm relies little on polynomial division, and avoids multiplying by different factors when removing the denominators of Hensel factors. All algorithms are implemented using Magma, a computational algebra system and experiments indicate that our algorithm is more efficient.     

Quantum Algorithm for Boolean Equation Solving and Quantum Algebraic Attack on Cryptosystems

This paper presents a quantum algorithm to decide whether a Boolean equation system F has a solution and to compute one if F does have solutions with any given success probability. The runtime complexity of the algorithm is polynomial in the size of F and the condition number of certain Macaulay matrix associated with F. As a consequence, the authors give a polynomial-time quantum algorithm for solving Boolean equation systems if their condition numbers are polynomial in the size of F. The autho...     

A New RCS Statistical Model of Radar Target

In this paper, the drawbacks of conventional target fluctuation models used in radar target modeling are set out. It is usually difficult to statistically model a real target because there are very few parameters which can be used to approximate the probability density function (PDF) of a real target's radar cross section (RCS) in conventional target models. A new method of statistical modeling is suggested, according to which the first nth central moment of real target's RCS, combined with the Legendre orthogonal polynomials, is used to reconstruct the PDF of the target's RCS. The relationship between the coefficients of the Legendre polynomials and the central moments of RCS are deduced mathematically. Through a practical computing example, the error-of-fit is shown as a function of the orders of Legendre coefficients. By comparing the errors-of-fit caused by both the new model and the conventional models, it is concluded that the new nonparametric method for statistical modeling of radar targets is s     

On the observability of free Boolean networks via the semi-tensor product method

This paper investigates the observabihty of free Boolean networks by using the semi-tensor product method,and presents some new results.First,the concept of observability for free Boolean networks is proposed,based on which and the algebraic form of Boolean networks,a kind of observabihty matrix is constructed.Second,by the observability matrix,a new necessary and sufficient condition is given for the observability of Boolean networks.Third,the concept of observabihty index for observable Boolean networks is defined,and an algorithm is established to calculate the observability index.Finally,a practical example of D.Melanogaster segmentation polarity gene networks is studied to support our new results.The study of the illustrative example shows that the new results obtained in this paper are very effective in investigating the observability of free Boolean networks.     

A characteristic set method for solving boolean equations and applications in cryptanalysis of stream ciphers*

This paper presents a characteristic more efficient and has better properties than the set method for solving Boolean equations, which is general characteristic set method. In particular, the authors give a disjoint and monic zero decomposition algorithm for the zero set of a Boolean equation system and an explicit formula for the number of solutions of a Boolean equation system. The authors also prove that a characteristic set can be computed with a polynomial number of multiplications of Boolean polynomials in terms of the number of variables. As experiments, the proposed method is used to solve equations from cryptanalysis of a class of stream ciphers based on nonlinear filter generators. Extensive experiments show that the method is quite effective.     

Solving Multivariate Polynomial Matrix Diophantine Equations with Gr?bner Basis Method

Different from previous viewpoints, multivariate polynomial matrix Diophantine equations are studied from the perspective of modules in this paper, that is, regarding the columns of matrices as elements in modules. A necessary and sufficient condition of the existence for the solution of equations is derived. Using powerful features and theoretical foundation of Gr?bner bases for modules, the problem for determining and computing the solution of matrix Diophantine equations can be solved. Meanwh...     

NSHV trajectory prediction algorithm based on aerodynamic acceleration EMD decomposition

Aiming at the problem of gliding near space hypersonic vehicle(NSHV)trajectory prediction,a trajectory prediction method based on aerodynamic acceleration empirical mode decomposition(EMD)is proposed.The method analyzes the motion characteristics of the skipping gliding NSHV and verifies that the aerodynamic acceleration of the target has a relatively stable rule.On this basis,EMD is used to extract the trend of aerodynamic acceleration into multiple sub-items,and aggregate sub-items with similar attributes.Then,a prior basis function is set according to the aerodynamic acceleration stability rule,and the aggregated data are fitted by the basis function to predict its future state.After that,the prediction data of the aerodynamic acceleration are used to drive the system to predict the target trajectory.Finally,experiments verify the effectiveness of the method.In addition,the distribution of prediction errors in space is discussed,and the reasons are analyzed.     

THE UNIVERSAL GROEBNER BASIS UNDER COMPOSITION

Composition is the operation of replacing variables in a polynomial with other polynomials. The main question in this paper is: when does composition commute with universal Groebner basis computation? We prove that this happens iff the composition is single variable. This has a natural application in the computation of universal Groebner bases of composed polynomials.     

The Numerical Simulation of Flow Field of Jet System

In this paper, the internal fluid motion of a jet system is described by the Navier Stokes mechanics equations. For the simulation of the motion, the penalty function finite element method is used, and the velocity vectors and stream function curves are obtained. Using the Prandtl theory, this paper derives the free jet velocity and the jet bunch width in a half-space, the latter of which is amended by experiment. The results obtained in this paper are applied to micro-type high pressure water jet cleaner and the ejector of rocket engine.     

Design of continuous long slot leaky-wave antenna for millimeter wave application

A simple and efficient design scheme of the continuous long slot leaky-wave antenna is developed. The key steps involved in the scheme are summarized. First, the cut-off frequencies of slot waveguides with different slot offsets are obtained by 3D finite-difference time-domain (FDTD) method. Second, the attenuation function αra is estimated by the aperture distribution, and the attenuation function αrs is determined by the slot radiation.Finally, the attenuation function αra is combined with the attenuation function αrs by the coefficient K. And an example in Ka band is presented. Moreover, the return loss of the E-plane Tee-junction (ET) and the radiation pattern of leaky-wave antenna are simulated. The scheme is verified by comparing with the experimental result.     

AN ADAPTIVE TRUST REGION METHOD FOR EQUALITY CONSTRAINED OPTIMIZATION

In this paper, a trust region method for equality constrained optlmization based on nondiferentiable exact penalty is proposed. In this algorithin, the trail step is characterized by computation of its normal component being separated from computation of its tangential component, i.e., only the tangential component of the trail step is constrained by trust radius while the normal component and trail step itself have no constraints. The other main characteristic of the algorithm is the decision of trust region radius. Here, the decision of trust region radius uses the information of the gradient of objective function and reduced Hessian. However, Maratos effect will occur when we use the nondifferentiable exact penalty function as the merit function. In order to obtain the superlinear convergence of the algorithm, we use the twice order correction technique. Because of the speciality of the adaptive trust region method, we use twice order correction when p= 0 (the definition is as in Section 2) and this is different from the traditional trust region methods for equality constrained opthnization. So the computation of the algorithm in this paper is reduced. What is more, we can prove that the algorithm is globally and superlinearly convergent.     

On the Topology and Isotopic Meshing of Plane Algebraic Curves

This paper presents a symbolic algorithm to compute the topology of a plane curve. This is a full version of the authors' CASC15 paper. The algorithm mainly involves resultant computations and real root isolation for univariate polynomials. Compared to other symbolic methods based on elimination techniques, the novelty of the proposed method is that the authors use a technique of interval polynomials to solve the system f(α, y),?f/?y(α, y)and simultaneously obtain numerous simple roots of f(α, y) = 0 on the α fiber. This significantly improves the efficiency of the lifting step because the authors are no longer required to compute the simple roots of f(α, y) = 0. After the topology is computed, a revised Newton's method is presented to compute an isotopic meshing of the plane algebraic curve. Though the approximation method is numerical, the authors can ensure that the proposed method is a certified one, and the meshing is topologically correct. Several nontrivial examples confirm that the proposed algorithm performs well.     

Dembowski-Ostrom polynomials from reversed Dickson polynomials

This paper gives a full classification of Dembowski-Ostrom polynomials derived from the compositions of reversed Dickson polynomials and monomials over finite fields of characteristic 2.The authors also classify almost perfect nonlinear functions among all such Dembowski-Ostrom polynomials based on a general result describing when the composition of an arbitrary linearized polynomial and a monomial of the form x~(2+2~α) is almost perfect nonlinear.It turns out that almost perfect nonlinear functions derived from reversed Dickson polynomials are all extended affine equivalent to the well-known Gold functions.     

Decentralized adaptive fuzzy control of time-delayed interconnected systems with unknown backlash-like hysteresis

The problem of decentralized adaptive fuzzy control for a class of time-delayed interconnected nonlinear systems with unknown backlash-like hystersis is discussed. On the basis of the principle of variable structure control （VSC） and by using the fuzzy systems with linear adjustable parameters that are used to approximate plant unknown functions, a novel decentralized adaptive fuzzy control strategy with a supervisory controller is developed. A general method, which is modeled the backlash-like hysteresis, is proposed and removes the assumption that the boundedness of disturbance, and the slope of the backlash-like hystersis are known constants. Furthermore, the interconnection term is supposed to be pth-order polynomial in time-delayed states. In addition, the plant dynamic uncertainty and modeling errors are adaptively compensated by adjusting the parameters and gains on-line for each subsystems. By theoretical analysis, it is shown that the closed-loop fuzzy control systems are globally stable, with tracking error converging to zero. Simulation results demonstrate the effectiveness of the approach.     

Efficiently counting affine roots of mixed trigonometric polynomial systems

Estimating the number of isolated roots of a polynomial system is not only a fundamental study theme in algebraic geometry but also an important subproblem of homotopy methods for solving polynomial systems. For the mixed trigonometric polynomial systems, which are more general than polynomial systems and rather frequently occur in many applications, the classical B′ezout number and the multihomogeneous B′ezout number are the best known upper bounds on the number of isolated roots. However, for the deficient mixed trigonometric polynomial systems, these two upper bounds are far greater than the actual number of isolated roots. The BKK bound is known as the most accurate upper bound on the number of isolated roots of a polynomial system. However, the extension of the definition of the BKK bound allowing it to treat mixed trigonometric polynomial systems is very difficult due to the existence of sine and cosine functions. In this paper, two new upper bounds on the number of isolated roots of a mixed trigonometric polynomial system are defined and the corresponding efficient algorithms for calculating them are presented. Numerical tests are also given to show the accuracy of these two definitions, and numerically prove they can provide tighter upper bounds on the number of isolated roots of a mixed trigonometric polynomial system than the existing upper bounds, and also the authors compare the computational time for calculating these two upper bounds.     

One AES S-box to increase complexity and its cryptanalysis

It is well known that the algebraic expression of ASS S-box is very simple and only 9 terms are involved. Hence, AES security is suspected although there is no vulnerability on it so far. To eliminate the weakness of extremely small terms in the algebraic expression of AES S-box, one improved AES S-box is proposed, which preserves the algebraic degree invariable but significantly increases the number of its algebraic expression terms from 9 to 255. At the same time, Boolean function has good characters in balance and strict avalanche criterion (SAC), etc. Finally, it is proved that the improved AES S-box scheme is secure gainst the powerful known differential and linear cryptanalysis.     

Kind of deadlock-free scheduling method

Deadlock must be avoided in a manufacturing system. In this paper, an efficient algorithm for finding an optimal deadlock-free schedules in a manufacturing system with very limited buffer is presented. This algorithm is based on the effective genetic algorithm (GA) search method, and a formal Petri net structure is introduced to detect the token player assuring deadlock-free. In order to make the scheduling strategy generated by GA meet the required constraint of deadlock-free, some results of the structure analysis of Petri net are involved as a criterion to select deadlock-free schedule from the population generated by GA. The effectiveness and efficiency of the proposed approach is illustrated by using an example.