À medida que os dispositivos Bluetooth se tornam cada vez mais comuns, existe um potencial crescente para tirar partido das capacidades desta tecnologia assim como das infraestruturas j a existentes para cen arios de rastreio massivo de dispositivos. Todavia, a recolha de informa c~ao destes equipamentos pode criar problemas de privacidade, pois a cria c~ao de um registo permanente e/ou desprotegido dos dados r...
Comunicação publicada em "IEEE Conference on Decision & Control (CDC)", pag. 5215-5220 ; This paper presents a distributed algorithm to simultaneously compute the diameter, radius and node eccentricity in all nodes of a synchronous network. Such topological information may be useful as input to configure other algorithms. Previous approaches have been modular, progressing in sequential phases using building bl...
Available for individual study only. ; Although much of mathematics is algorithmic in nature, the skills needed to formulate and solve algorithmic problems do not form an integral part of mathematics education. In particular, logic, which is central to algorithm development, is rarely taught explicitly at preuniversity level, under the justification that it is implicit in mathematics and therefore does not nee...
The authors appear in alphabetical order. ; Flow-Updating (FU) is a fault-tolerant technique that has proved to be efficient in practice for the distributed computation of aggregate functions in communication networks where individual processors do not have access to global information. Previous distributed aggregation protocols, based on repeated sharing of input values (or mass) among processors, sometimes c...
Determining the size of a network and its diameter are important functions in distributed systems, as there are a number of algorithms which rely on such parameters, or at least on estimates of those values. The Extrema Propagation technique allows the estimation of the size of a network in a fast, distributed and fault tolerant manner. The technique was previously studied in a simulation setting where rounds a...
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 maxi...
Comunicação apresentada ao International Workshop on Software Support for Portable Storage (IWSSPS), San Francisco, 2005. ; In recent years, an increasing number of portable devices with large amounts of storage have become widely used. In this paper, we present the early design of the FEW system, a system that aims to ease file management in the new mobile environment. To this end, the system will manage fil...
Financiadores do RCAAP | |||||||
![]() |
![]() |
![]() |
![]() |
![]() |
![]() |