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 ...

Suppose ai indicates the number of orbits size i in graph G. A new counting polynomial, namely an orbit is defined as OG(x) = ?i aixi. Its modified version obtained by subtracting polynomial from 1. In present paper, we studied conditions under which integer can arise a graph. Additionally, surveyed graphs with small and characterized several classes respect to their polynomials.

This paper studies the application of principal component analysis, multiple polynomial regression, and artificial neural network ANN techniques to the quantitative analysis of binary mixture of dye solution. The binary mixtures of three textile dyes including blue, red and yellow colors were analyzed by PCA-Multiple polynomial Regression and PCA-Artificial Neural network PCA-ANN methods. The o...