a 5 : 1, pp. 30 – 42, 2009 FEATURE-PLACING SENTENCES AND THE CANONICAL SCHEME

Dataflow analysis framework based on Static Single Assignment (SSA) form and Sparse Evaluation Graphs (SEGs) demand fast computation of program points where data flow information must be merged, the so-called -nodes. In this paper, we present a surprisingly simple algorithm for computing -nodes for arbitrary flowgraphs (reducible or irreducible) that runs in linear time. We employ a novel progr...

In this paper we give all pairs of non mutually placeable (p, q)bipartite graphs G and H such that 2 ≤ p ≤ q, e(H) ≤ p and e(G) + e(H) ≤ 2p+ q − 1.

In this paper we consider several different problems of placing an obnoxious facility on geometric networks. In particular, our main results show how to obtain efficient polynomial time algorithms for locating an obnoxious facility on the given network under various distance functions such as maximizing the total sum of distances or maximizing the smallest of the distances from the facility to ...

This paper presents the benefits of using a generic FPGA tool set developed at the university of Brest for programming virtual FPGA structures. From a high level FPGA description, the basic FPGA tools such a placer, a router or an editor are automatically generated. The FPGA description is not constrained by any model, so that abstract FPGA structures, such as virtual FPGAs, can directly exploi...

The provisioning of dynamic forms of services is becoming the main stream of today’s network. In this paper, we focus on services assisted by network servers and different forms of associated sessions. We identify two types of services: transparent, where the session is unaware of the server location, and configurable, where the sessions need to be configured to use their closest server. For bo...

We present the results of a system that georeferences Flickr videos using a combination of language models and similarity search. The system extends our approach from last year by using language models with a more adaptive granularity, and by taking into account the home location of the user.

Given a linear time-invariant control system, it is well known that the transmission zeroes are the generalized eigenvalues of a matrix pencil. Adding outputs to place additional zeroes is equivalent to appending rows to this pencil to place new generalized eigenvalues. Adding inputs is likewise equivalent to appending columns. Since both problems are dual to each other, we only show in this pa...

In this paper we describe some work carried out for a major UK high street retailer. This work necessitated the development of a system for the effective design of stockroom layouts. The basic problem faced by this retailer, that of placing boxes on shelves so as to minimise the space used, is described. We also briefly describe a number of complicating factors that had to be considered in arri...

We discuss the pole placement problem for single-input or multi-input control models of the form _ x = Ax + Bu. This is the problem of determining a linear state feedback of the form u = Fx such that in the closed-loop system _ x = (A + BF)x, the matrix A + BF has a prescribed set of eigenvalues. We analyze the conditioning of this problem and show that it is an intrinsically ill-conditioned pr...