This paper presents two efficient implementations of fast and pipelined bit-parallel polynomial basis multipliers over GF (2m) by irreducible pentanomials and trinomials. The architecture of the first multiplier is based on a parallel and independent computation of powers of the polynomial variable. In the second structure only even powers of the polynomial variable are used. The par...

This paper presents a static analysis of laminated composite doubly-curved shells using refined kinematic models with polynomial and non-polynomial functions recently introduced in the literature. To be specific, Maclaurin, trigonometric, exponential and zig-zag functions are employed. The employed refined models are based on the equivalent single layer theories. A simply supported shell is sub...

We consider the following problem: given a program, find tight asymptotic bounds on values of some variables at end computation (or any program point) in terms its input values. focus case polynomially-bounded variables, and weak programming language for which we have recently shown that are computable. These sets multivariate polynomials. While their computability has been settled, complexity ...

in this paper we define ?-independent (a weak-version of independence), kronecker and dissociate sets on hypergroups and study their properties and relationships among them and some other thin sets such as independent and sidon sets. these sets have the lacunarity or thinness property and are very useful indeed. for example varopoulos used the kronecker sets to prove the malliavin theorem. in t...

in some statistical process control applications, quality of a process or product can be characterized by a relationship between a response and one or more independent variables, which is typically referred to a profile. in this paper, polynomial profiles are considered to monitor processes in which there is a first order autoregressive relation between the error terms in each profile. a remedi...

Let G be a graph. The first Zagreb polynomial M1(G, x) and the third Zagreb polynomial M3(G, x) of the graph G are defined as:     ( ) ( , ) [ ] e uv E G G x x d(u) + d(v) M1 , ( , )  euvE(G) G x x|d(u) - d(v)| M3 . In this paper, we compute the first and third Zagreb polynomials of Cartesian product of two graphs and a type of dendrimers.

By summarizing Khachiyan's algorithm and Karmarkar's algorithm forlinear program (LP) a unified methodology for the design of polynomial-time algorithms for LP is presented in this paper. A key concept is the so-called extended binary search (EBS) algorithm introduced by the author. It is used as a unified model to analyze the complexities of the existing modem LP algorithms and possibly, help ...