Tese de mestrado integrado. Engenharia Electrotécnica e de Computadores. Universidade do Porto. Faculdade de Engenharia. 2011

Estágio realizado na Novabase e orientado pelo Eng.º Pedro Faúlha / Tese de mestrado integrado. Engenharia Informátca e Computação. Faculdade de Engenharia. Universidade do Porto. 2008

Estágio realizado na Sun Microsystems Ireland Inc / Tese de mestrado integrado. Engenharia Informática e Computação. Faculdade de Engenharia. Universidade do Porto. 2009

Sepsis is life-threatening organ dysfunction caused by a response to infection that causes multiorgan failure. This condition causes high mortality and morbidity rates and leaves permanent disabilities. The purpose of this project was to create a sepsis protocol and an education training program for clinical staff in a hospital setting where no sepsis protocol was in place. The practice-focused question examined whether an educational program would improve clinical staff perception of their knowledge of the early recognition and management of sepsis. A literature review was conducted to identify an evidence-based practice protocol; the results were used to develop the education program for the clinical staff at the site. Malcolm Knowles'€™s theory of adult learning framed the project that included a team of 9 content experts consisting of physicians, physician assistants, and an educator who reviewed and approved the protocol and education program prior to implementation. The education program was then presented to 45 staff members including physicians, licensed vocational nurses, registered nurses, physician assistants, and nurse practitioners. Results of a 14-item knowledge test before and after the education program were examined for percent correct; results were compared using a paired-samples t test. Participant knowledge increased significantly (p <.05) from 20% correctly answering 10 of the 14 questions on the pretest to 87% answering all of the posttest questions correctly. The results of this project may promote positive social change by supporting clinical staff in early recognition and treatment of sepsis thereby reducing the morbidity and mortality that accompanies sepsis.

Video games are an everyday experience for adolescents and have changed how adolescents interact with one another. Prior research has focused on positive and negative aspects of video game play in general, without distinguishing Voice Over Internet Protocol (VOIPing) as the mode of play. Grounded in entertainment theory, motivational theory, and psychological distress theory, this cross-sectional, correlational study examined the relationship between VOIPing and quality of life (Pediatric Quality of Life Inventory), Yee's motivation to play video games, and resilience (Child and Youth Resilience Measure). A series of linear regression and multivariate canonical correlation models analyzed self-report responses of 103 adolescents aged 13 to18. Results indicated that VOIPing was not statistically related to quality of life or resilience. However, VOIPing correlated positively with motivation to play video games, particularly with the subscales of socialization and relationships. Canonical analysis of motivation for gaming and quality of life indicated that adolescents with high scores on customization and escapism motivation for gaming subscales tended to also have high scores on each of the emotional, social, and school quality of life subscales. Canonical analysis of motivation for gaming and resilience indicated that adolescents with low scores on the escapism motivation for gaming subscale tended to also have high scores on the individual, relationships, and community resilience subscales. The positive aspects of VOIPing, particularly with increased motivation to play video games, can be effectively used in coaching adolescents in social skills and relationship building.

In Service-Oriented Architectures, everything is a service and services can interact with each other when needed. Web services (or simply services) are loosely coupled software components that are published, discovered, and invoked across the Web. As the use of Web services grows, in order to correctly interact with the growing services, it is important to understand the business protocols that provide clients with the information on how to interact with services. In dynamic Web services environments, service providers need to constantly adapt their business protocols for reflecting the restrictions and requirements proposed by new applications, new business strategies, and new laws, or for fixing the problems found in the protocol definition. However, the effective management of such a protocol evolution raises critical problems: one of the most critical issues is to handle instances running under the old protocol when their protocol has been changed. Simple solutions, such as aborting them or allowing them to continue to run according to the old protocol, can be considered, but they are inapplicable for many reasons (e.g., the lose of work already done and the critical nature of work). We present a framework that supports service administrators in managing the business protocol evolution by providing several features, such as a set of change operators allowing modifications of protocols, a variety of protocol change impact analyses automatically determining which ongoing instances can be migrated to the new version of protocol, and data mining techniques inducing a model for classifying ongoing instances migrateable to the new protocol. To support the protocol evolution process, we have also developed database-backed GUI tools on top of our existing system. The proposed approach and tools can help service administrators in managing the evolution of ongoing instances when the business protocols of services with which they are interacting have changed.

We address the security issue of the data which mobile agents gather as they are traversing the Internet. Our goal is to devise a security protocol that truly secures the data which mobile agents gather. Several cryptographic protocols were presented in the literature asserting the security of gathered data. Formal verification of the protocols reveals unforeseen security flaws, such as truncation or alteration of the collected data, breaching the privacy of the gathered data, sending others data under the private key of a malicious host, and replacing the collected data with data of similar agents. So the existing protocols are not truly secure. We present an accurate security protocol which aims to assert strong integrity, authenticity, and confidentiality of the gathered data. The proposed protocol is derived from the Multi-hops protocol. The protocol suffers from security flaws, e.g. an adversary might truncate/ replace collected data, or sign others data with its own private key without being detected. The proposed protocol refines the Multi-hops protocol by implementing the following security techniques: utilization of co-operating agents, scrambling the gathered offers, requesting a visited host to clear its memory from any data acquired as a result of executing the agent before the host dispatches the agent to the succeeding host in the agent???s itinerary, and carrying out verifications on the identity of the genuine initiator at the early execution of the agent at visited hosts, in addition to the verifications upon the agent???s return to the initiator. The proposed protocol also implements the common security techniques such as public key encryption, digital signature, etc. The implemented security techniques would rectify the security flaws revealed in the existing protocols. We use STA, an infinite-state exploration tool, to verify the security properties of a reasonably small instance of the proposed protocol in key configurations. The analysis using STA reports no attack. Moreover, we carefully reason the correctness of the security protocol for a general model and show that the protocol would be capable of preventing or at least detecting the attacks revealed in the existing protocols.

PhD / In design literature, how designers think and how they design have been identified as a reflection of how they interact with their sketches. Sketching in architectural design is still a central concern which shapes our understanding of the design process and the development of new tools. Sketching not only serves as a visual aid to store and retrieve conceptualisations, but as a medium to facilitate more ideas, and to revise and refine these ideas. This thesis examined how mental imagery and sketching is used in designing by conducting a protocol analysis study with six expert architects. Each architect was required to think aloud and design under two different conditions: one in which s/he had access to sketching and one in which s/he was blindfolded (s/he did not have access to sketching). At the end of the blindfold condition the architects were required to quickly sketch what they held in their minds. The architects were able to come up with satisfying design solutions and some reported that using their imagery could be another way of designing. The resulting sketches were assessed by judges and were found to have no significant differences in overall quality. Expert architects were able to construct and maintain the design of a building without having access to sketching. The analysis of the blindfold and sketching design protocols did not demonstrate any differences in the quantity of cognitive actions in perceptual, conceptual, functional and evaluative categories. Each architect’s cognitive structure and designing behaviour in the blindfold activity mimicked her/his cognitive structure and designing behaviour in the sketching activity. The analysis of links between the design ideas demonstrated that architects’ performance in idea development was higher under the blindfold condition, compared to their sketching condition. It was also found that architects’ blindfold design performance was improved when they were more familiar with the site layout. These results imply that expert designers may not need sketching as a medium for their reflective conversation with the situation. This study indicates that constructing internal representations can be a strong tool for designing. Future studies may show that designers may not need sketching for the generation of certain designs during the early phases of conceptual designing.

Anycast in next generation Internet Protocol is a hot topic in the research of computer networks. It has promising potentials and also many challenges, such as architecture, routing, Quality-of-Service, anycast in ad hoc networks, application-layer anycast, etc. In this thesis, we tackle some important topics among them. The thesis at first presents an introduction about anycast, followed by the related work. Then, as our major contributions, a number of challenging issues are addressed in the following chapters. We tackled the anycast routing problem by proposing a requirement based probing algorithm at application layer for anycast routing. Compared with the existing periodical based probing routing algorithm, the proposed routing algorithm improves the performance in terms of delay. We addressed the reliable service problem by the design of a twin server model for the anycast servers, providing a transparent and reliable service for all anycast queries. We addressed the load balance problem of anycast servers by proposing new job deviation strategies, to provide a similar Quality-of-Service to all clients of anycast servers. We applied the mesh routing methodology in the anycast routing in ad hoc networking environment, which provides a reliable routing service and uses much less network resources. We combined the anycast protocol and the multicast protocol to provide a bidirectional service, and applied the service to Web-based database applications, achieving a better query efficiency and data synchronization. Finally, we proposed a new Internet based service, minicast, as the combination of the anycast and multicast protocols. Such a service has potential applications in information retrieval, parallel computing, cache queries, etc. We show that the minicast service consumes less network resources while providing the same services. The last chapter of the thesis presents the conclusions and discusses the future work.

This thesis contributes toward the design of a reliable and energy-efficient transport system for Wireless Sensor Networks. Wireless Sensor Networks have emerged as a vital new area in networking research. In many Wireless Sensor Network systems, a common task of sensor nodes is to sense the environment and send the sensed data to a sink node. Thus, the effectiveness of a Wireless Sensor Network depends on how reliably the sensor nodes can deliver their sensed data to the sink. However, the sensor nodes are susceptible to loss for various reasons when there are dynamics in wireless transmission medium, environmental interference, battery depletion, or accidentally damage, etc. Therefore, assuring reliable data delivery between the sensor nodes and the sink in Wireless Sensor Networks is a challenging task. The primary contributions of this thesis include four parts. First, we design, implement, and evaluate a cross-layer communication protocol for reliable data transfer for data streaming applications in Wireless Sensor Networks. We employ reliable algorithms in each layer of the communication stack. At the MAC layer, a CSMA MAC protocol with an explicit hop-by-hop Acknowledgment loss recovery is employed. To ensure the end-to-end reliability, the maximum number of retransmissions are estimated and used at each sensor node. At the transport layer, an end-to-end Negative Acknowledgment with an aggregated positive Acknowledgment mechanism is used. By inspecting the sequence numbers on the packets, the sink can detect which packets were lost. In addition, to increase the robustness of the system, a watchdog process is implemented at both base station and sensor nodes, which enable them to power cycle when an unexpected fault occurs. We present extensive evaluations, including theoretical analysis, simulations, and experiments in the field based on Fleck-3 platform and the TinyOS operating system. The designed network system has been working in the field for over a year. The results show that our system is a promising solution to a sustainable irrigation system. Second, we present the design of a policy-based Sensor Reliability Management framework for Wireless Sensor Networks called SRM. SRM is based on hierarchical management architecture and on the policy-based network management paradigm. SRM allows the network administrators to interact with the Wireless Sensor Network via the management policies. SRM also provides a self-control capability to the network. This thesis restricts SRM to reliability management, but the same framework is also applicable for other management services by providing the management policies. Our experimental results show that SRM can offer sufficient reliability to the application users while reducing energy consumption by more than 50% compared to other approaches. Third, we propose an Energy-efficient and Reliable Transport Protocol called ERTP, which is designed for data streaming applications in Wireless Sensor Networks. ERTP is an adaptive transport protocol based on statistical reliability that ensures the number of data packets delivered to the sink exceeds the defined threshold while reducing the energy consumption. Using a statistical reliability metric when designing a reliable transport protocol guarantees the delivery of adequate information to the users, and reduces energy consumption when compared to the absolute reliability. ERTP uses hop-by-hop Implicit Acknowledgment with a dynamically updated retransmission timeout for packet loss recovery. In multihop wireless networks, the transmitter can overhear a forwarding transmission and interpret it as an Implicit Acknowledgment. By combining the statistical reliability and the hop-by-hop Implicit Acknowledgment loss recovery, ERTP can offer sufficient reliability to the application users with minimal energy expense. Our extensive simulations and experimental evaluations show that ERTP can reduce energy consumption by more than 45% when compared to the state-of- the-art protocol. Consequently, sensor nodes are more energy-efficient and the lifespan of the unattended Wireless Sensor Network is increased. In Wireless Sensor Networks, sensor node failures can create network partitions or coverage loss which can not be solved by providing reliability at higher layers of the protocol stack. In the final part of this thesis, we investigate the problem of maintaining the network connectivity and coverage when the sensor nodes are failed. We consider a hybrid Wireless Sensor Network where a subset of the nodes has the ability to move at a high energy expense. When a node has low remaining energy (dying node) but it is a critical node which constitutes the network such as a cluster head, it will seek a replacement. If a redundant node is located in the transmission range of the dying node and can fulfill the network connectivity and coverage requirement, it can be used for substitution. Otherwise, a protocol should be in place to relocate the redundant sensor node for replacement. We propose a distributed protocol for Mobile Sensor Relocation problem called Moser. Moser works in three phases. In the first phase, the dying node determines if network partition occurs, finds an available mobile node, and asks for replacement by using flooding algorithm. The dying node also decides the movement schedule of the available mobile node based on certain criteria. The second phase of the Moser protocol involves the actual movement of the mobile nodes to approach the location of the dying node. Finally, when the mobile node has reached the transmission of the dying node, it communicates to the dying nodes and moves to a desired location, where the network connectivity and coverage to the neighbors of the dying nodes are preserved.