Abstract
Memory is one of our most precious goods has it gives us the ability to store, retain and recall information thus giving a meaning to our past and help us to envision our future, dreams and expectations. However, ageing decreases the capacity of remembering and the capacity to store new memories, thus affecting our life quality. These presented problems configure a social and human dilemma. With the presented work we intend to address some of these problems, thru the use of the Personal Memory Assistant (PMA) concept in order to help its user to remember things and occurrences in a proactive manner. We will also address socialization and relaxation events that should be part of the user's life. With the use of a Multi-Agent System to implement the PMA, the objectives can be achieved in a ubiquitous and highly configurable manner. It is presented here the platform concept, scheme and the agent characteristics and their contribution to each and every agent.

Abstract

Abstract
The study of the blogosphere can provide sociologically relevant data. We analyze the links between blogs in the portuguese blogosphere, in order to understand how they group and interact, to identify clusters and to characterize them. Our data set contains post data for more than 70,000 blogs, with over 400,000 links. The linkage data is represented as a blog graph and partitioned into several slices, according to their in-degree. We then study the evolution of blog features, and observe a consistent pattern of decrease in posting frequency, number of out-links, and post length, as we move from the highly-cited blogs to the less cited ones. Copyright 2010 ACM.

Abstract
This paper describes the participation of FEUP, from the University of Porto, in the TREC 2010 Blog Track. FEUP participated in the baseline blog distillation task with work focused on the use of link features available in the TREC Blogs08 collection. The approach presented in this paper uses the link information available in most individual posts to amplify each post's score. Blog scores, and subsequent ranks, are obtained by combining individual post scores. We boost post scores using the in-degree of each post and the h-index of each blog. This results in an improvement of P@10, over our baseline, for the in-degree and the h-index runs. When compared to the in- degree, the h-index run results in higher performance values for each of the applied evaluation metrics.

Abstract
The identification of patterns on large repositories of code can be of paramount importance to guide the design of new hardware accelerators, To acquire the suitability of a certain hardware accelerator and to generate application-specific architectures that maximize hardware reuse. This work intends to research and develop methods to both acquire the presence of a given pattern (map-suitability) and to identify common and highly similar patterns in code repositories (design-suggestions). The approach being proposed is based on a number of identification layers that refine the selections at each stage. We analyze two possible complementary options for a high-level layer. A first option is based on the representation of programs as a sequence of symbols and string matching and clustering algorithms are then used to expose similar patterns. A second option is based on tree matching techniques for identifying the presence of user's input patterns in the programs under inspection. We are evaluating our approach using the MiBench, Media-Bench, UTDSP, and SNU code repositories. The results show the potential of our approach to identify approximate patterns that can be implemented by merging highly similar structures. © 2010 IEEE.

Abstract
Typical computing systems based on general purpose processors (GPPs) are extended with coarse-grained reconfigurable arrays (CGRAs) to provide higher performance and/or energy savings. In order for applications to take advantage of these computing systems, efficient dynamic mapping techniques are required. Those dynamic mapping techniques will be responsible for automatically moving computations originally running in the GPP to the CGRA. The concept of dynamic compilation, widespread in the context of JIT compilation to GPPs, is receiving more attention by the reconfigurable computing community. This paper presents our approach to dynamically map computations to CGRAs coupled to a GPP. Specifically, we present the identification of large sequences of instructions, MegaBlocks, being executed in a GPP. These MegaBlocks are then mapped to the target CGRA. We evaluate the potential of the MegaBlocks over Basic Blocks and SuperBlocks to increase the IPC when targeting a CGRA and considering the execution of a number of representative benchmarks. © 2010 IEEE.