This work presents a hybrid method for motif discovery in DNA sequences. The proposed method called SPSO-Lk, borrows the concept of Chebyshev polynomials and uses the stochastic local search to improve the performance of the basic PSO algorithm as a motif finder. The Chebyshev polynomial concept encourages us to use a linear combination of previously discovered velocities beyond that proposed b...

the topological index of a graph g is a numeric quantity related to g which is invariant underautomorphisms of g. the vertex pi polynomial is defined as piv (g)  euv nu (e)  nv (e).then omega polynomial (g,x) for counting qoc strips in g is defined as (g,x) =cm(g,c)xc with m(g,c) being the number of strips of length c. in this paper, a new infiniteclass of fullerenes is constructed. the ...

This paper presents the raSAT SMT solver for polynomial constraints, which aims to handle them over both reals and integers with simple unified methodologies: (1) raSAT loop for inequalities, which extends the interval constraint propagation with testing to accelerate SAT detection, and (2) a non-constructive reasoning for equations over reals, based on the generalized intermediate value theorem.

The topological zeta function and Igusa's local zeta function are respectively a geometrical invariant associated to a complex polynomial f and an arithmetical invariant associated to a polynomial f over a p{adic eld. When f is a polynomial in two variables we prove a formula for both zeta functions in terms of the so{called log canonical model of f ?1 f0g in A 2. This result yields moreover a ...

Let F be a number field and f ∈ F [x1, . . . , xn] \ F . To any completion K of F and any character κ of the group of units of the valuation ring of K one associates Igusa’s local zeta function Z(κ, f, s). The holomorphy conjecture states that for all except a finite number of completions K of F we have that if the order of κ does not divide the order of any eigenvalue of the local monodromy of...

In 1891, Weierstrass presented his famous iterative method for finding all the zeros of a polynomial simultaneously. In this paper we establish three new local convergence theorems for the Weierstrass method with a posteriori and a priori error estimates. The main result of the paper generalizes, improves and complements some well known results of Dochev (1962), Kjurkchiev and Markov (1983) and...

We study a class of super-rough growth models whose structure factor satisfies the Family-Vicsek scaling. We demonstrate that a macroscopic background spontaneously develops in the local surface profile, which dominates the scaling of the local surface width and the height difference. The shape of the macroscopic background takes a form of a finite-order polynomial whose order is decided from t...

This paper presents an overview of the existing literature on the nonparametric local polynomial (LPR) estimator of the regression function and its derivatives when the observations are dependent. When the errors of the regression model are correlated and follow an ARMA process, Vilar-Fernández and Francisco-Fernández (2002) proposed a modification of the LPR estimator, called the generalized l...

Local polynomial regression LPR is applied to solve the partial differential equations PDEs . Usually, the solutions of the problems are separation of variables and eigenfunction expansion methods, so we are rarely able to find analytical solutions. Consequently, we must try to find numerical solutions. In this paper, two test problems are considered for the numerical illustration of the method...