Following Sethuraman, Teo and Vohra ((2003), (2006)), we apply integer programming tools to the analysis of fundamental issues in social choice theory. We generalize Sethuraman et al.’s approach specifying integer programs in which variables are allowed to assume values in the set {0, 12 , 1}. We show that there exists a one-to-one correspondence between the solutions of an integer program defi...

Many compiler optimization techniques depend on the ability to calculate the number of integer values that satisfy a given set of linear constraints. This count (the enumerator of a parametric polytope) is a function of the symbolic parameters that may appear in the constraints. In an extended problem (the “integer projection” of a parametric polytope), some of the variables that appear in the ...

We present and compare various algorithms, including a new one, allowing to perform multiplications by integer constants using elementary operations. Such algorithms are useful, as they occur in several problems, such as the Toom-Cook-like algorithms to multiply large multiple-precision integers, the approximate computation of consecutive values of a polynomial, and the generation of integer mu...

A quadratic form f is said to have semigroup property if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all binary integer quadratic forms with semigroup property. If there is an integer bilinear map s such that f(s(x,y)) = f(x)f(y) for all vectors x and y from the integer 2-dimensional lattice, then the form f has semigr...

A quadratic form f is said to be perfect if its values at points of the integer lattice form a semigroup under multiplication. A problem of V. Arnold is to describe all perfect binary integer quadratic forms. If there is an integer bilinear map s such that f(s(x, y)) = f(x)f(y) for all vectors x and y from the integer 2-dimensional lattice, then the form f is perfect. We give an explicit descri...

Résumé. Soit f ∈ Z[x] un polynôme de degré r ≥ 3 sans racines de multiplicité r ou (r − 1). Supposons que f(x) 6≡ 0 mod p admette une solution dans (Z/p) pour tout p. Erdős a conjecturé que f(p) est donc sans facteurs puissances (r − 1)ièmes pour un nombre infini de premiers p. On prouve cela pour toutes les fonctions f dont une racine génère le corps de décomposition, et également pour d’autre...

We consider the problem of active steganography, wherein the goal is to survive benign attacks in addition to maintaining statistical and perceptual transparency. The stego image can be “advertised” in uncompressed format, but they can survive JPEG compression upto a certain design quality factor while still resisting statistical steganalysis. The data is hidden in the discrete cosine transform...

Among the hyphomycetous endoparasites destructive to eelworms that abound in slowly decaying plant materials, as well as in agar plate cultures earlier inoculated with partly decomposed vegetable detritus, Harposporium anguillulae Lohde emend. Zopf (1888) is observed much more frequently than allied forms. In seeking an explanation for this more frequent occurrence it would seem highly signific...

This paper describes a physiologically based toxicokinetic model for 1,3-butadiene uptake, distribution, and metabolic clearance in mice. Model parameters for metabolic activity were estimated from the correspondence between computer simulation studies and experimental results as published in the literature. The parameterized model was validated with independent literature data. With the result...

For any integer  ‎, ‎a minus  k-dominating function is a‎function  f‎ : ‎V (G)  {-1,0‎, ‎1} satisfying w) for every  vertex v, ‎where N(v) ={u V(G) | uv  E(G)}  and N[v] =N(v)cup {v}. ‎The minimum of ‎the values of  v)‎, ‎taken over all minus‎k-dominating functions f,‎ is called the minus k-domination‎number and is denoted by $gamma_k^-(G)$ ‎. ‎In this paper‎, ‎we ‎introduce the study of minu...