of execution. Our goal is to develop automatic techniques that are ca-pable of finding and exploiting the Large Scale Behavior of programs (behavior seen over billions of instructions). The first step towards this goal is the development of a hardware independent metric that can concisely summarize the behav

from an extensive literature essential principles that ensure stability and use these to present a concise characterization of most of the model predictive controllers that have been proposed in the literature. In some cases the finite horizon optimal control problem solved on-line is exactly

Abstract not found

Abstract. Astex, Automatic Speculative Thread EXtractor, is a compiler front-end we devellop for automatic C-code partitioning in speculative codelets, i.e. pure function that can be distributed over computing units of a system. It is an hybrid approach mixing static analysis and speculative data from profiles to offline generating a partition of the input C sequential code. In addition to the generated C partitioned application, we provide all the information on extracted kernels for a distributed memory heterogeneous system implementation and optimization. Astex makes a full abstraction of the target system for the programmer and provide useful guideline for code refactoring, if needed. It includes time profiling, communication, data layout information and data value prediction. Each codelet can be generated as a stand-alone program with associated input data set for effective iterative optimisation. Astex results on NAS, SPEC 2006 and H264 benchmarks are relevant, and future works are on the way toward automatic specialized coprocessor programming. 1

of an object in order to characterize its simple points. In order to prove this result, we do not use the fact that “the number of holes of X is equal to the number of holes in X ” which is not sufficient for our purpose but we use the linking number defined in [FM00]. In so doing, we formalize the proofs

finite set of beamformers. The universal lower bound provides a concise characterization of the gain with each additional bit of feedback information regarding the channel. Using the bound, it is shown that finite information systems approach the perfect information case as (t 1)2 , where B

the field of software reuse. The taxonomy characterizes each reuse approach interms of its reusable artifacts and the way these artifacts are abstracted, selected, speciahzed, and integrated. Abstraction plays a central role in software reuse. Concise and expressive abstractions are essential if software

of up to four group-specific peptide configurations at these loci [4, 5]. gH (gp86) was initially characterized by sequencing and reactivity with a neutraliz-ing murine monoclonal antibody [6]. In its glycosylated form, it has a size of 86 kDa and appears to bind a 92.5-kDa cellular receptor [7

to turn rate and heading. Our new approach shows great promise as a technique for ascertaining concise track characterization of maneuvering targets.

We investigate the conditions under which least bisimulations exist with respect to set inclusion. In particular, we describe a natural way to remove redundant pairs from a given bisimulation. We then introduce the conciseness property on process graphs, which characterizes the existence