Orientation system for people with cognitive disabilities

In health care there has been a growing interest and investment in new tools to have a constant monitoring of patients. The increasing of average life ex-pectation and, consequently, the costs in health care due to elderly population are the motivation for this investment. However, healthmonitoring is not only important to elderly people, it can be also applied to people with cognitive disabilities. In this article we present some systems, which try to support these persons on doing their day-to-day activities and how it can improve their life quality. Also, we present an idea to a project that tries to help the persons with cognitive disabilities by providing assistance in geo-guidance and keep their caregivers aware of their location.

Lightweight user modeling – a case study

In the context of previous publications, we propose a new lightweight UM process, intended to work as a tourism recommender system in a commercial environment. The new process tackles issues like cold start, gray sheep and over specialization through a rich user model and the application of a gradual forgetting function to the collected user action history. Also, significant performance improvements were achieved regarding the previously proposed UM process.

Adaptation model for PCMAT – Mathematics collaborative learning platform

The aim of this paper is to present an adaptation model for an Adaptive Educational Hypermedia System, PCMAT. The adaptation of the application is based on progressive self-assessment (exercises, tasks, and so on) and applies the constructivist learning theory and the learning styles theory. Our objective is the creation of a better, more adequate adaptation model that takes into account the complexities of different users.

Scheduling in holonic manufacturing systems

This chapter presents some of the issues with holonic manufacturing systems. It starts by presenting the current manufacturing scenario and trends and then provides some background information on the holonic concept and its application to manufacturing. The current limitations and future trends of manufacturing suggest more autonomous and distributed organisations for manufacturing systems; holonic manufacturing systems are proposed as a way to achieve such autonomy and decentralisation. After a brief literature survey a specific research work is presented to handle scheduling in holonic manufacturing systems. This work is based on task and resource holons that cooperate with each other based on a variant of the contract net protocol that allow the propagation of constraints between operations in the execution plan. The chapter ends by presenting some challenges and future opportunities of research.

Semantic social network analysis

Mestrado em Engenharia Informática

Visualização personalizada sensível ao contexto e às emoções

Mestrado em Engenharia Informática

Influência da espessura do substrato dental sobre a eficácia clareadora e citotoxicidade de diferentes protocolos de clareamento

Conselho Nacional de Desenvolvimento Científico e Tecnológico (CNPq)

Maximização da produção de paraxileno

Pretendeu-se, com o presente trabalho, efectuar um estudo sobre a possibilidade de aumentar a produção de paraxileno na unidade processual existente na refinaria da Galp no Porto. Foram estudados o conjunto de colunas T-0306 e T-0307 e a coluna T-0303, recorrendo ao uso do AspenPlus, na realização da simulação do processo nas condições actuais e para a realização da análise de sensibilidade, que permitiu verificar se o equipamento existente possui capacidade para satisfazer as necessidades exigidas pelo processo quando se pretende aumentar a produção. Com a simulação do processo, foi verificado que este já se encontra a laborar em condições óptimas. Na realização da análise de sensibilidade foram variados para o conjunto T-0306 e T- 0307, o caudal de alimentação entre 62780 e 95000 kg/h, o caudal de destilado da T-0306 entre 15833 e 23911 kg/h e o caudal de destilado da T-0307 entre 139 e os 235 kg/h. No caso da T-0303, foi variado o caudal de refinado entre 201240 e 304600 kg/h, o caudal de destilado e o caudal da corrente lateral, variam entre 77290 a 116930 kg/h. Pretendeu-se obter soluções que conseguissem cumprir as especificações relativas aos produtos obtidos, nomeadamente paraxileno com uma pureza de 99,6% e uma recuperação de 99%, tolueno com uma pureza de 97% e uma recuperação de 90% (T-0306 e T-0307). No caso da T- 0303, obter paraxileno com uma pureza de 2,23% e paradietilbenzeno com uma pureza de 99,0% e ambos com uma recuperação de 99%. Para as simulações que cumpriram as especificações anteriores, verificou-se se a energia transferida em aeroarrefecedores, fornalhas e permutadores excedem em 25% o seu valor de projecto. Em caso afirmativo isso significou o acréscimo de uma peça de equipamento idêntica à existente. A análise de sensibilidade permitiu concluir a separação é possível para os caudais actuais de extracto e refinado e para um aumento destes de 32, 40 e 50%. Foi ainda possível concluir que para os caudais actuais é necessária a colocação de novos aeroarrefecedores para as colunas T-0306 e T-0303 e de uma nova fornalha para a coluna T-0303. Para um aumento dos caudais de 32% para além das alterações referidas anteriormente é necessária a colocação de um novo aeroarrefecedor na coluna T-0307 e de uma nova fornalha da coluna T-0306. Se aumentarmos os caudais em 40% será também necessário o acréscimo de permutadores para a coluna T-0307. Para o aumento de 50%, os calores de permuta são excedidos em bastante mais do que 25%, em todos os aeroarrefecedores, permutadores e fornalhas. Uma vez que todas as colunas se encontram a funcionar acima da sua capacidade, concluiu-se que em ambos os casos seria necessária a montagem de uma segunda linha em paralelo e igual à existente. Implicando com esta alteração um investimento total de 10.439.574,36€.

RiSeG: a ring based secure group communication protocol for resource-constrained wireless sensor networks

Securing group communication in wireless sensor networks has recently been extensively investigated. Many works have addressed this issue, and they have considered the grouping concept differently. In this paper, we consider a group as being a set of nodes sensing the same data type, and we alternatively propose an efficient secure group communication scheme guaranteeing secure group management and secure group key distribution. The proposed scheme (RiSeG) is based on a logical ring architecture, which permits to alleviate the group controller’s task in updating the group key. The proposed scheme also provides backward and forward secrecy, addresses the node compromise attack, and gives a solution to detect and eliminate the compromised nodes. The security analysis and performance evaluation show that the proposed scheme is secure, highly efficient, and lightweight. A comparison with the logical key hierarchy is preformed to prove the rekeying process efficiency of RiSeG. Finally, we present the implementation details of RiSeG on top of TelosB sensor nodes to demonstrate its feasibility.

Revisiting transactions in Ada

Classical lock-based concurrency control does not scale with current and foreseen multi-core architectures, opening space for alternative concurrency control mechanisms. The concept of transactions executing concurrently in isolation with an underlying mechanism maintaining a consistent system state was already explored in fault-tolerant and distributed systems, and is currently being explored by transactional memory, this time being used to manage concurrent memory access. In this paper we discuss the use of Software Transactional Memory (STM), and how Ada can provide support for it. Furthermore, we draft a general programming interface to transactional memory, supporting future implementations of STM oriented to real-time systems.

Job phasing aware preemption deferral

Preemptions account for a non-negligible overhead during system execution. There has been substantial amount of research on estimating the delay incurred due to the loss of working sets in the processor state (caches, registers, TLBs) and some on avoiding preemptions, or limiting the preemption cost. We present an algorithm to reduce preemptions by further delaying the start of execution of high priority tasks in fixed priority scheduling. Our approaches take advantage of the floating non-preemptive regions model and exploit the fact that, during the schedule, the relative task phasing will differ from the worst-case scenario in terms of admissible preemption deferral. Furthermore, approximations to reduce the complexity of the proposed approach are presented. Substantial set of experiments demonstrate that the approach and approximations improve over existing work, in particular for the case of high utilisation systems, where savings of up to 22% on the number of preemption are attained.

A vision of cyber-physical internet

When the Internet was born, the purpose was to interconnect computers to share digital data at large-scale. On the other hand, when embedded systems were born, the objective was to control system components under real-time constraints through sensing devices, typically at small to medium scales. With the great evolution of the Information and Communication Technology (ICT), the tendency is to enable ubiquitous and pervasive computing to control everything (physical processes and physical objects) anytime and at a large-scale. This new vision gave recently rise to the paradigm of Cyber-Physical Systems (CPS). In this position paper, we provide a realistic vision to the concept of the Cyber-Physical Internet (CPI), discuss its design requirements and present the limitations of the current networking abstractions to fulfill these requirements. We also debate whether it is more productive to adopt a system integration approach or a radical design approach for building large-scale CPS. Finally, we present a sample of realtime challenges that must be considered in the design of the Cyber-Physical Internet.

Collision-free beacon scheduling mechanisms for IEEE 802.15.4/Zigbee cluster-tree wireless sensor networks

The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This paper tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collision-free beacon frame scheduling schemes. We strongly believe that the results provided in this paper trigger a significant step towards the practical and efficient use of IEEE 802.15.4/Zigbee cluster-tree networks.

Beacon scheduling in cluster-tree IEEE 802.15.4/ZigBee wireless sensor networks

The recently standardized IEEE 802.15.4/Zigbee protocol stack offers great potentials for ubiquitous and pervasive computing, namely for Wireless Sensor Networks (WSNs). However, there are still some open and ambiguous issues that turn its practical use a challenging task. One of those issues is how to build a synchronized multi-hop cluster-tree network, which is quite suitable for QoS support in WSNs. In fact, the current IEEE 802.15.4/Zigbee specifications restrict the synchronization in the beacon-enabled mode (by the generation of periodic beacon frames) to star-based networks, while it supports multi-hop networking using the peer-to-peer mesh topology, but with no synchronization. Even though both specifications mention the possible use of cluster-tree topologies, which combine multi-hop and synchronization features, the description on how to effectively construct such a network topology is missing. This report tackles this problem, unveils the ambiguities regarding the use of the cluster-tree topology and proposes two collisionfree beacon frame scheduling schemes.

Penalty fuzzy function for derivative-free optimization

Penalty and Barrier methods are normally used to solve Nonlinear Optimization Problems constrained problems. The problems appear in areas such as engineering and are often characterised by the fact that involved functions (objective and constraints) are non-smooth and/or their derivatives are not know. This means that optimization methods based on derivatives cannot net used. A Java based API was implemented, including only derivative-free optimizationmethods, to solve both constrained and unconstrained problems, which includes Penalty and Barriers methods. In this work a new penalty function, based on Fuzzy Logic, is presented. This function imposes a progressive penalization to solutions that violate the constraints. This means that the function imposes a low penalization when the violation of the constraints is low and a heavy penalisation when the violation is high. The value of the penalization is not known in beforehand, it is the outcome of a fuzzy inference engine. Numerical results comparing the proposed function with two of the classic penalty/barrier functions are presented. Regarding the presented results one can conclude that the prosed penalty function besides being very robust also exhibits a very good performance.