Cookies Policy
The website need some cookies and similar means to function. If you permit us, we will use those means to collect data on your visits for aggregated statistics to improve our service. Find out More
Accept Reject
  • Menu
Publications

2007

Implementing range queries with a decentralized balanced tree over distributed hash tables

Authors
Lopes, N; Baquero, C;

Publication
NETWORK-BASED INFORMATION SYSTEMS, PROCEEDINGS

Abstract
Range queries, retrieving all keys within a given range, is an important add-on for Distributed Hash Tables (DHTs), as they rely only on exact key matching lookup. In this paper we support range queries through a balanced tree algorithm, Decentralized Balanced Tree, that runs over any DHT system. Our algorithm is based on the B(+)-tree design that efficiently stores clustered data while maintaining a balanced load on hosts. The internal structure of the balanced tree is suited for range queries operations over many data distributions since it easily handles clustered data without losing performance. We analyzed, and evaluated our algorithm under a simulated environment, to show it's operation scalability for both insertions and queries. We will show that the system design. imposes a fixed penalty over the DHT access cost, and thus inherits the scalability properties of the chosen underlying DHT.

2007

Context-dependent beat tracking of musical audio

Authors
Davies, MEP; Plumbley, MD;

Publication
IEEE TRANSACTIONS ON AUDIO SPEECH AND LANGUAGE PROCESSING

Abstract
We present a simple and efficient method for beat tracking of musical audio. With the aim of replicating the human ability of tapping in time to music, we formulate our approach using a two state model. The first state performs tempo induction and tracks tempo changes, while the second maintains contextual continuity within a single tempo hypothesis. Beat times are recovered by passing the output of an onset detection function through adaptively weighted comb filterbank matrices to separately identify the beat period and alignment. We evaluate our beat tracker both in terms of the accuracy of estimated beat locations and computational complexity. In a direct comparison with existing algorithms, we demonstrate equivalent performance at significantly reduced computational cost.

2007

Grid e-Services for Multi-Layer SOM Neural Network Simulation

Authors
Lima, R; Silva, R;

Publication
IBERGRID: 1ST IBERIAN GRID INFRASTRUCTURE CONFERENCE PROCEEDINGS

Abstract
In this paper it is presented a framework environment for neural network simulation through the development of e-Services running on the EGEE Grid infrastructure. Parallel computing and distribution of jobs can be synchronized by the e-Service through a web interface. This interface provides an easy to use environment and can be requested over the internet. This simulation tool is based on a neural network agent approach that implements the e-Service using software agents and services offered by the Grid middleware. As an example, it is hereby presented an e-Service based on an implementation of the Self-Organizing Map (SOM) neural network algorithm which indicates that significant improvements in performance can be gained. In particular, users of SOM neural networks can take advantage of these widely available computer networks to obtain the computing power that they require.

2007

International duopoly with unknown costs

Authors
Ferreira, FA; Pinto, AA;

Publication
Proc. Appl. Math. Mech. - PAMM

Abstract

2007

Scalable Bloom Filters

Authors
Almeida, PS; Baquero, C; Preguica, N; Hutchison, D;

Publication
INFORMATION PROCESSING LETTERS

Abstract
Bloom filters provide space-efficient storage of sets at the cost of a probability of false positives on membership queries. The size of the filter must be defined a priori based on the number of elements to store and the desired false positive probability, being impossible to store extra elements without increasing the false positive probability. This leads typically to a conservative assumption regarding maximum set size, possibly by orders of magnitude, and a consequent space waste. This paper proposes Scalable Bloom Filters, a variant of Bloom filters that can adapt dynamically to the number of elements stored, while assuring a maximum false positive probability.

2007

Generation expansion planning in competitive electricity markets

Authors
Pereira, AJC; Saraiva, JT;

Publication
2007 IEEE LAUSANNE POWERTECH, VOLS 1-5

Abstract
This paper describes a formulation to solve the long-term power generation expansion planning assuming a competitive electricity market. In a competitive environment each company aims at maximizing its profit through its individual expansion plan. In this formulation there is an inter connection between the expansion plans proposed by each company in the sense that the decisions taken by each company are influenced by decisions of the other players. In this formulation we assume there a centralized entity in charge of evaluating each plan both technically and economically taking into account a set of pre established constraints. As a result of that assessment, this centralized entity sends new information to the players. Using this scheme it is possible to assess the influence that the decisions of each company have in the decisions of its competitors, leading to the referred interconnection. The adopted solution approach is based in the decomposition of the global problem in a main problem to be solved by the Independent System Operator (ISO), and in several sub problems one per generating company. Finally, the paper includes a Case Study designed to illustrate this approach as well as its interest for several agents acting in the electricity market.

  • 4128
  • 4537