Refine my results

Specific Collection

Language

Università della Svizzera italiana

An empirical study of crude oil market

Roth, Yana ; Barone Adesi, Giovanni (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2008 ; 2008ECO004.

In this thesis I have tried to identify the risks and opportunities crude oil market offers. For this purpose I tested the performance of univariate and multivariate GARCH models. The first part of the work describes univariate GARCH models and their application to commodities markets. Physical ownership of the commodity carries an associated flow of services. The net flow of these services per...

Università della Svizzera italiana

Imprecise probabilistic graphical models : Equivalent representations, inference algorithms and applications

Antonucci, Alessandro ; Zaffalon, Marco (Dir.)

Thèse de doctorat : Università della Svizzera italiana, 2008 ; 2008INFO003.

Credal networks are probabilistic graphical models that extend Bayesian nets to deal with imprecision in probability, and can actually be regarded as sets of Bayesian nets. Credal nets appear to be powerful means to represent and deal with many important and challenging problems in uncertain reasoning. The counterpart of having more freedom in the modeling phase is an increased inferential...

Università della Svizzera italiana

Understanding content-based routing schemes

Carzaniga, Antonio ; Rembert, Aubrey J. ; Wolf, Alexander L.

Content-based networking is a message-oriented communication service in which a message is delivered to all destinations that have declared a selection predicate matching the content of that message. Analogous to that of a traditional address-based network, a routing scheme in a content-based network defines the router-local matching, forwarding, and header functions that collectively realize the...

Università della Svizzera italiana

DV/DRP : a content-based networking protocol for sensor networks

Hall, Cyrus P. ; Carzaniga, Antonio ; Wolf, Alexander L.

An ideal sensor network would minimize communication by routing information only to those nodes requiring the information. We are exploring the use of a content-based network for this purpose, where messages containing sensor readings and associated metadata are relayed from source nodes to destination nodes based solely on the fact that the destination nodes have expressed interest in specific...

Università della Svizzera italiana

A feedback-enhanced learning approach for routing in WSN

Egorova-Förster, Anna ; Murphy, Amy

Much research in sensor networks focuses on optimizing traffic originating at multiple sources destined for a single, base station sink. Our work reverses this assumption, targeting scenarios where individual sensor data is sent to multiple destinations. In this case, the data path that produces the least network cost is unlikely to overlap completely with any of the optimal routes between the...

Università della Svizzera italiana

Optimistic algorithms for partial database replication

Schiper, Nicolas ; Schmidt, Rodrigo ; Pedone, Fernando

In this paper, we study the problem of partial database replication. Numerous previous works have investigated database replication, however, most of them focus on full replication. We are here interested in genuine partial replication protocols, which require replicas to permanently store only information about data items they replicate. We define two properties to characterize partial...

Università della Svizzera italiana

Conflict-aware load-balancing techniques for database replication

Zuikeviciute, Vaide ; Pedone, Fernando

Middleware-based database replication protocols require few or no changes in the database engine. As a consequence, they are more portable and flexible than kernel-based protocols, but have coarser-grain information about transaction access data, resulting in reduced concurrency and increased aborts. This paper proposes conflict-aware load-balancing techniques to increase the concurrency and...

Università della Svizzera italiana

A highly available log service for distributed transaction processing

Camargos, Lásaro ; Wieloch, Marcin ; Pedone, Fernando

Processing distributed transactions hinges on enforcing atomicity and durability: resource managers participating in a transaction must agree on its outcome and the transaction updates must be permanent. We introduce the log service abstraction, which gathers resource managers’ votes to commit or abort a transaction and their updates, and outputs the transaction’s outcome. Updates are made...

Università della Svizzera italiana

Polynomial-time subgraph enumeration for automated instruction set extension

Bonzini, Paolo ; Pozzi, Laura

This paper proposes a novel algorithm that, given a data-flow graph and an input/output constraint, enumerates all convex subgraphs under the given constraint in polynomial time with respect to the size of the graph. These subgraphs have been shown to represent efficient Instruction Set Extensions for customizable processors. The search space for this problem is inherently polynomial but, to our...

Università della Svizzera italiana

Property templates and assertions supporting runtime failure detection

Wuttke, Jochen

In the context of our research program we addressed the question whether or not requirements documents contain information about system level properties that can be exploited to automatically create assertions for run-time checks of these properties. In this technical report we define the concept of property template and report details on the studies we carried out to address this question. The...