Abstract

Abstract
Knowledge is central to the modern economy and society. Indeed, the knowledge society has transformed the concept of knowledge and is more and more aware of the need to overcome the lack of knowledge when has to make options or address its problems and dilemmas. One's knowledge is less based on exact facts and more on hypotheses, perceptions or indications. Even when we use new computational artefacts and novel methodologies for problem solving, like the use of Group Decision Support Systems (GDSSs), the question of incomplete information is in most of the situations marginalized. On the other hand, common sense tells us that when a decision is made it is impossible to have a perception of all the information involved and the nature of its intrinsic quality. Therefore, something has to be made in terms of the information available and the process of its evaluation. It is under this framework that a Multi-valued Extended Logic Programming language will be used for knowledge representation and reasoning, leading to a model that embodies the Quality-of-Information (QoI) and its quantification, along the several stages of the decision-making process. In this way, it is possible to provide a measure of the value of the QoI that supports the decision itself. This model will be here presented in the context of a GDSS for VirtualECare, a system aimed at sustaining online healthcare services.

Abstract
Ambient Assisted Living environments projects arise as technological responses of the scientific community to problems associated with the population-ageing phenomenon. In theory, these environments should allow de-localization of healthcare services delivery and management to the home, thus containing the economic and social costs associated with old age. The VirtualECare project is one of those environments, enhanced with proactive techniques for a better user experience, focused on elderly chronic patients, through the ability of constant learning and adaption based in user interaction and its contexts. This learning and, consequently, adaption needs, however, unequivocally user identification, especially in multi-user environments. Traditional identification techniques and methodologies are not suitable for these scenario since, usually, require user interaction and wireless identification technique (e.g. RFID, Bluetooth) are very exposed to personification. In order to obtain the expected results we needed a more advanced technology. One possible, appropriate and already fairly developed technique is Facial Recognition. In this paper we present the VirtualECare project approach to Facial Recognition authentication techniques its advantages, disadvantages and possible implementations paths.

Abstract
Data-mining over software can reveal similar patterns on software code. This can give important insights for the design of hardware cores, especially considering the benefits of the merge of software kernels and their implementation as a single hardware core. However, software codes have characteristics that make inadequate the direct use of typical data mining tools, mainly related to their large number of samples and the imprecise definition of code features for mining. Those characteristics affect negatively the performance of the most known data mining methods. To solve this problem, we propose in this paper the use of three techniques: the Normalized Compression Distance, the Neighbor Joining, and the Fast Newman algorithm. We combine these three techniques and propose a new approach for data mining of code repositories (DAMICORE). DAMICORE works with different types of code representations. Experiments reveal DAMICORE can indicate important software similarities at source code level. Specifically, merging soft-ware kernels identified by DAMICORE results in FPGA cores with size smaller than the overall hardware size needed when implementing a core for each kernel. © 2011 IEEE.

Abstract
In embedded reconfigurable computing systems, general purpose processors (GPPs) are typically extended with coprocessors to meet specific goals, such as higher performance and/or energy savings. Coprocessors can range from specialized modules which execute a specific task to reconfigurable arrays of ALUs. This paper presents our ongoing work on techniques to dynamically offload computations being executed by a GPP to a coprocessor. We present our method for identifying repetitive instruction traces, named as Mega blocks, as well as transformations which can be applied over those Mega blocks. We also present a proof-of-concept implementation of a system which transparently moves computations from a GPP to a Specialized Reconfigurable Array (SRA). Finally, we present our current and planned work. © 2011 IEEE.

Abstract
Context-aware mobile applications can benefit from context inference adaptation based on run-time operating conditions, such as battery life or sensor availability. Developing applications with such adaptable behavior, however, is notoriously cumbersome, as developers need to deal with low-level system interfacing and programming issues. In this paper we describe a domain-specific language (DSL) and a middleware infrastructure to support the specification, deployment and maintenance of run-time adaptable context inference processes. We illustrate the benefits of our approach via a case study, highlighting the new abstractions that facilitate the specification of adaptable behavior using different algorithms and the corresponding varying parameter settings, with a specific goal of minimizing the energy while maintaing acceptable end-application performance and accuracy. © 2011 IEEE.