2011
Authors
Meireles, FA; Araujo, AJ;
Publication
VLSI CIRCUITS AND SYSTEMS V
Abstract
The evaluation of elementary functions can be performed by approximations using minimax polynomials requiring simple hardware resources. The general method to calculate an elementary function is composed by three steps: range reduction, computation of the polynomial in the reduced argument and range reconstruction. This approach allows a low-degree polynomial approximation but range reduction and reconstruction introduce a computation overhead. This work proposes an evaluation methodology without range reduction and range reconstruction steps. Applications that need to compute elementary functions may benefit from avoiding these steps if the argument belongs to a sub-domain of the function. Particularly in the context of embedded systems, applications related to digital signal processing most of the times require function evaluation within a specific interval. As a consequence of not doing range reduction, the degree of the approximant polynomials increases to maintain the required precision. Interval segmentation is an effective way to overcome this issue because the approximations are computed in smaller intervals. The proposed methodology uses non-uniform segmentation as a way to mitigate the problem arising from not carrying out range reduction. The benefits that come from applying interval segmentation to the general evaluation technique are limited by the range reduction and reconstruction steps because the segmentation only applies to the approximation step. However, when used in the proposed methodology it reveals more effective. Some elementary functions were implemented using the proposed methodology in a FPGA device. The metric used to characterize the proposed technique are the area occupation and the corresponding latency. The results of each implementation without range reduction were compared with the corresponding ones of the general method using range reduction. The results show that latency can be significantly reduced while the area is approximately the same.
2011
Authors
Mendes, J;
Publication
2011 IEEE SYMPOSIUM ON VISUAL LANGUAGES AND HUMAN-CENTRIC COMPUTING (VL/HCC 2011)
Abstract
Spreadsheet systems are well known and widely used in all kinds of business applications. They are used by tens of millions of people who create hundreds of millions of spreadsheets every day [1]. Spreadsheet systems are easy to use and very intuitive, allowing the aggregation of all types of data. © 2011 IEEE.
2011
Authors
de Castro, AV; de Carvalho, CV; Carrapatoso, E;
Publication
2011 FRONTIERS IN EDUCATION CONFERENCE (FIE)
Abstract
This article aims to present the steps for creating a learning methodology to the health area based on open source software and digital health learning contents. We intend to apply some common practices of engineering to the health area in order to enhance the preservation, sharing, production and re-use of contents. For this purpose, we created a thematic repository named MELOR (Medical Learning Objects Repository), an e-learning platform named MEDUCA (Medical Education), a social network, a ip-TV channel and several learning resources and learning objects in order to investigate new mechanisms to increase health education and enhance the sharing overall. We also created a main portal where other researchers can participate.
2011
Authors
Goncalves, N; Jose, R; Baquero, C;
Publication
ON THE MOVE TO MEANINGFUL INTERNET SYSTEMS: OTM 2011 WORKSHOPS
Abstract
Due to its pervasiveness and communication capabilities, Bluetooth can be used as an infrastructure for several situated interaction and massive sensing scenarios. This paper shows how Bluetooth scanning can be used in gate counting scenarios, where the main goal is to provide an accurate count for the number of unique devices sighted. To this end, we present an analysis of several stochastic counting techniques that not only provide an accurate count for the number of unique devices, but offer privacy guarantees as well.
2011
Authors
Marik, V; Vrba, P; Leitao, P;
Publication
Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
Abstract
2011
Authors
Garcia, F; Resende, J;
Publication
DYNAMICS, GAMES AND SCIENCE II
Abstract
Network effects occur when the benefit that agents derive from a good or service depends on how many other agents adopt the same good or service. This strategic complementarity between consumers' actions has several implications on tie behavior of firms: For instance, firms need to gain advantage from early marketing stages. Network effects are intrinsically a dynamic phenomenon: past consumption of the good influences the utility of present consumers. This effect can be either direct, when consumers value interaction with their peers, and/or indirect, through an increase in the quality of the good. This chapter surveys the literature on dynamic network effects. First we provide general formulations for the modelization of network effects in a dynamic setting. Second, we analyse recent developments in the literature on firms' strategies in the context of dynamic network effects. We survey the literature both on monopoly and oligopoly markets. In the case of oligopoly markets, we distinguish between situations in which firms produce horizontally and vertically differentiated goods. Main results on pricing and evolution of market shares are exposed.
The access to the final selection minute is only available to applicants.
Please check the confirmation e-mail of your application to obtain the access code.