The impacts of a GTL plant on Brazil's oil products supply and refinery expansion

This paper assesses the impacts of a GTL plant on the expansion of Brazil's oil refining segment. The GTL plant (50,000 bpd) was sized to start up operations in 2015, producing diesel and naphtha through the indirect route (FT-synthesis). This plant will consume the non-associated natural gas production from the recent discoveries at the Santos Basin (around 419 Bm³), and the associated gas production from the Campos Basin. Both basins are located in the Southeast of Brazil, the most populated, rich and industrialized region of the country. Two different criteria for refinery expansion were simulated in order to meet oil product demand scenarios. Findings show that depending on the refinery expansion criteria considered GTL will play a fundamental hole to meet the oil product demand forecast to Brazil in the next 10 years.     

A URI-based approach for addressing fragments of media resources on the Web

To make media resources a prime citizen on the Web, we have to go beyond simply replicating digital media files. The Web is based on hyperlinks between Web resources, and that includes hyperlinking out of resources (e.g., from a word or an image within a Web page) as well as hyperlinking into resources (e.g., fragment URIs into Web pages). To turn video and audio into hypervideo and hyperaudio, we need to enable hyperlinking into and out of them. The W3C Media Fragments Working Group is taking on the challenge to further embrace W3C??s mission to lead the World Wide Web to its full potential by developing a Media Fragment protocol and guidelines that ensure the long-term growth of the Web. The major contribution of this paper is the introduction of Media Fragments as a media-format independent, standard means of addressing media resources using URIs. Moreover, we explain how the HTTP protocol can be used and extended to serve Media Fragments and what the impact is for current Web-enabled media formats.     

Conception assistée par ordinateur des circuits intégrés monolithiques hyperfréquences

Computer aided design of microwave monolithic integrated circuits must combine two different fields. The first domain is the simulation of microwave circuits taking into account non linear aspects development of time domain and harmonic balance simulation algorithms specialized for microwave circuits. In the second place are found, the layout algorithms which were developed for logic circuits (on Si or GaAs). The association of these two types of algorithms leads to the constitution of aCad workstation for microwave monolithic integrated circuits. Two examples of design and realization of integrated circuits with these tools are presented.     

On the Black-Box Complexity of Sperner’s Lemma

We present several results on the complexity of various forms of Sperner’s Lemma in the black-box model of computing. We give a deterministic algorithm for Sperner problems over pseudo-manifolds of arbitrary dimension. The query complexity of our algorithm is linear in the separation number of the skeleton graph of the manifold and the size of its boundary. As a corollary we get an deterministic query algorithm for the black-box version of the problem 2D-SPERNER, a well studied member of Papadimitriou’s complexity class PPAD. This upper bound matches the deterministic lower bound of Crescenzi and Silvestri. The tightness of this bound was not known before. In another result we prove for the same problem an lower bound for its probabilistic, and an lower bound for its quantum query complexity, showing that all these measures are polynomially related. Research supported by the European Commission IST Integrated Project Qubit Application (QAP) 015848, the OTKA grants T42559 and T46234, and by the ANR Blanc AlgoQP grant of the French Research Ministry.     

Solving subgraph isomorphism problems with constraint programming

The subgraph isomorphism problem consists in deciding if there exists a copy of a pattern graph in a target graph. We introduce in this paper a global constraint and an associated filtering algorithm to solve this problem within the context of constraint programming. The main idea of the filtering algorithm is to label every node with respect to its relationships with other nodes of the graph, and to define a partial order on these labels in order to express compatibility of labels for subgraph isomorphism. This partial order over labels is used to filter domains. Labelings can also be strengthened by adding information from the labels of neighbors. Such a strengthening can be applied iteratively until a fixpoint is reached. Practical experiments illustrate that our new filtering approach is more effective on difficult instances of scale free graphs than state-of-the-art algorithms and other constraint programming approaches.     

A method to select a successful interoperability solution through a simulation approach

Enterprise applications and software systems need to be interoperable in order to achieve seamless business across organizational boundaries and thus realize virtual networked organizations. Our proposition can be considered as an interoperability project selection approach and is based on three steps: (1) Modelling both collaborative business processes and potential related interoperability projects; (2) Evaluating the accessibility of each project regarding the current state of the organization; (3) Simulating each project and assessing the associated performance. These results are finally projected on a comparison matrix used as a decision support to select the most appropriate interoperability solution. An application case extracted from the French aerospace sector demonstrates the applicability and the benefits of the proposition.     

Static worksharing strategies for heterogeneous computers with unrecoverable interruptions

One has a large computational workload that is “divisible” (its constituent tasks’ granularity can be adjusted arbitrarily) and one has access to p remote computers that can assist in computing the workload. How can one best utilize the computers? Two features complicate this question. First, the remote computers may differ from one another in speed. Second, each remote computer is subject to interruptions of known likelihood that kill all work in progress on it. One wishes to orchestrate sharing the workload with the remote computers in a way that maximizes the expected amount of work completed. We deal with three versions of this problem. The simplest version ignores communication costs but allows computers to differ in speed (a heterogeneous set of computers). The other two versions account for communication costs, first with identical remote computers (a homogeneous set of computers), and then with computers that may differ in speed. We provide exact expressions for the optimal work expectation for all three versions of the problem - via explicit closed-form expressions for the first two versions, and via a recurrence that computes this optimal value for the last, most general version.