We present the design and implementation of RICH (Run-time Integer CHecking), a tool for efficiently detecting integer-based attacks against C programs at run time. C integer bugs, a popular avenue of attack and frequent programming error [1–15], occur when a variable value goes out of the range of the machine word used to materialize it, e.g. when assigning a large 32-bit int to a 16-bit short...

Peak-shaving is a very efficient and practical strategy for day-ahead hydropower scheduling in power systems, usually aiming to appropriately schedule hourly (or less time interval) generations of individual plants so as smooth the load curve while enforcing energy production target each plant. Nowadays, marketization booming development renewable resources are complicating constraints diversif...

We show that a 2-variable integer program, defined by m constraints involving coefficients with at most φ bits can be solved with O(m+φ) arithmetic operations on rational numbers of size O(φ).

Many inequalities for Mixed-Integer Linear Programs (MILPs) or pure Integer Linear Programs (ILPs) are derived from the Gomory corner relaxation, where all the nonbinding constraints at an optimal LP vertex are relaxed. Computational results show that the corner relaxation gives a good approximation of the integer hull for problems with general-integer variables, but the approximation is less s...

We show that the Alexander-Conway polynomial ∆ is obtainable via a particular one-variable reduction of each two-variable Links– Gould invariant LG , where m is a positive integer. Thus there exist infinitely many two-variable generalisations of ∆. This result is not obvious since in the reduction, the representation of the braid group generator used to define LG does not satisfy a second-order...

In this paper the branching trees for attacking MILP are reviewed. Under certain circumstances branches can be done concurrently. This is fully investigated with the result that there are restrictions for certain dual values and reduced costs. As a sideeffect of this study a new class of cuts for MILP is found, which are defined by those values. 1 Motivation of the following thoughts Nowadays t...

Variable block size motion estimation (VBS-ME) is one of the contributors to H.264/AVC’s excellent coding efficiency. Due to its high computational complexity, however, VBS-ME needs acceleration for real-time high-resolution applications. This paper proposes a high throughput and cost efficient VLSI architecture for integer full-search VBS-ME in H.264/AVC. A new scan order is introduced to re-u...

n-Fold integer programming is a fundamental problem with a variety of natural applications in operations research and statistics. Moreover, it is universal and provides a new, variable-dimension, parametrization of all of integer programming. The fastest algorithm for n-fold integer programming predating the present article runs in time O ( ng(A)L ) with L the binary length of the numerical par...

This paper proposes a new challenging optimization problem, called COOLING-AWARE WORKLOAD PLACEMENT PROBLEM, that looks for a workload placement that optimizes the overall data center power consumption given by the sum of the server power consumption and of the computer room air conditioner power consumption. We formulate CWPP as a Mixed Integer Non Linear Problem using a cross-interference mat...