Low bitwidth integer arithmetic has been widely adopted in hardware implementations of deep neural network inference applications. However, despite the promised energy-efficiency improvements demanding edge applications, use low for training remains limited. Unlike inference, demands high dynamic range and numerical accuracy quality results, making low-bitwidth particularly challenging. To addr...

This paper focuses on the usability of optimisation models to support the re-routing of air traffic flows in Europe. It discusses different modelling approaches and proposes three integer programming models, with different levels of detail, aimed at re-routing air traffic flows. The models are tested on a set of test data based on the actual traffic crossing the whole French upper airspace. The...

Examples are given to show that the support of a complex of modules over a commutative noetherian ring may not be read off the minimal semi-injective resolution of the complex. These also give examples of semiinjective complexes whose localization need not be homotopically injective. Let R be a commutative noetherian ring. Recall that the support of a finitely generated R-module M is the set of...

Deforestation is a transformation of functional programs to remove intermediate data structures. It is based on outermost unfolding of function calls where folding occurs when unfolding takes place within the same nested function call. Since unrestricted unfolding may encounter arbitrarily many terms, a termination analysis has to determine those subterms where unfolding is possibly dangerous. ...

The discovery of characteristic rules is a well-known data mining technique and has lead to several successful applications. Unfortunately, typically a (very) large number of rules is discovered during the mining stage. This makes monitoring and control of these rules extremely costly and difficult. Therefore, a selection of the most promising rules is desirable. In this paper, we propose an in...

We present a model for optimizing the placement of sensors in municipal water networks to detect maliciously-injected contaminants. An optimal sensor configuration minimizes the expected fraction of the population at risk. We formulate this problem as an integer program, which can be solved with generally available IP solvers. We find optimal sensor placements for three real networks with synth...

Electric power system operators make critical decisions based on remote measurements. If those measurements are compromised, it is possible to make decisions that could lead to critical consequences. Of particular concern are unobservable attacks in which compromised measurements are not flagged as erroneous by bad data detection algorithms. The use of secure measurement devices, such as PMUs, ...

We discuss the quantification of the local galaxy population and the impact of the " New Era of Wide-Field Astronomy " on this field, and, in particular, systematic errors in the measurement of the Luminosity Function. New results from the 2dFGRS are shown in which some of these selection effects have been removed. We introduce an INT-WFS project which will further reduce the selection biases. ...

In the last lecture, we discussed algorithms for integer sorting. In this lecture we will discuss the relationship between integer sorting algorithms and priority queue data structures. It is obvious that fast priority queues imply fast sorting, since if a priority queue can do Insert and Deletemin in O(f(n)), then we can sort in O(nf(n)) by inserting all elements into the queue then calling De...

Recently linear 0-1 programming methods have been successfully applied to the satissability problem of propositional logic. We present a preprocessing method that simpliies the linear 0-1 integer problem corresponding to a clausal satissability problem. Valid extended clauses, a generalization of classical clauses, are added to the problem as long as they dominate at least one extended clause o...