Reactive hybrid knowledge bases

Hybrid knowledge bases are knowledge bases that combine ontologies with non-monotonic rules, allowing to join the best of both open world ontologies and close world rules. Ontologies shape a good mechanism to share knowledge on theWeb that can be understood by both humans and machines, on the other hand rules can be used, e.g., to encode legal laws or to do a mapping between sources of information. Taking into account the dynamics present today on the Web, it is important for these hybrid knowledge bases to capture all these dynamics and thus adapt themselves. To achieve that, it is necessary to create mechanisms capable of monitoring the information flow present on theWeb. Up to today, there are no such mechanisms that allow for monitoring events and performing modifications of hybrid knowledge bases autonomously. The goal of this thesis is then to create a system that combine these hybrid knowledge bases with reactive rules, aiming to monitor events and perform actions over a knowledge base. To achieve this goal, a reactive system for the SemanticWeb is be developed in a logic-programming based approach accompanied with a language for heterogeneous rule base evolution having as its basis RIF Production Rule Dialect, which is a standard for exchanging rules over theWeb.

Design and implementation of a behaviorally typed programming system for web services

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do Grau de Mestre em Engenharia Informática.

Efficient middleware for database replication

Dissertação de Mestrado em Engenharia Informática

Type System for the ComponentJ Programming Language

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Informática.

Design and implementation of an autonomous, proactive, and reactive software infrastructure to help improving the management level of projects

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do grau de Mestre em Engenharia Electrotécnica e de Computadores

Petri nets based components within globally asynchronous locally synchronous systems

Dissertação apresentada na Faculdade de Ciências e Tecnologias da Universidade Nova de Lisboa para a obtenção do grau de Mestre em Engenharia Electrotécnica e Computadores

Database repairs with answer set programming

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Parallel programming in biomedical signal processing

Dissertação para obtenção do Grau de Mestre em Engenharia Biomédica

Reductive scavenging of reactive oxygen species in prokaryotes

Dissertação para a obtenção de grau de doutor em Bioquímica pelo Instituto de Tecnologia Química e Biológica. Universidade Nova de Lisboa.

C-reactive protein in early risk assessment in acute pancreatitis

ABSTRACT:C-reactive protein (CRP) has been widely used in the early risk assessment of patients with acute pancreatitis (AP), but unclear aspects about its prognostic accuracy in this setting persist. This project evaluated first CRP prognostic accuracy for severity, pancreatic necrosis (PNec), and in-hospital mortality (IM) in AP in terms of the best timing for CRP measurement and the optimal CRP cutoff points. Secondly it was evaluated the CRP measured at approximately 24 hours after hospital admission (CRP24) prognostic accuracy for IM in AP individually and in a combined model with a recent developed tool for the early risk assessment of patients with AP, the Bedside Index for Severity in AP (BISAP). Two single-centre retrospective cohort studies were held. The first study included 379 patients and the second study included 134 patients. Statistical methods such as the Hosmer-Lemeshow goodness-of-fit test, the area under the receiver-operating characteristic curve, the net reclassification improvement, and the integrated discrimination improvement were used. It was found that CRP measured at approximately 48 hours after hospital admission (CRP48) had a prognostic accuracy for severity, PNec, and IM in AP better than CRP measured at any other timing. It was observed that the optimal CRP48 cutoff points for severity, PNec, and IM in AP varied from 170mg/l to 190mg/l, values greater than the one most often recommended in the literature – 150mg/l. It was found that CRP24 had a good prognostic accuracy for IM in AP and that the cutoff point of 60mg/l had a negative predictive value of 100%. Finally it was observed that the prognostic accuracy of a combined model including BISAP and CRP24 for IM in AP could perform better than the BISAP alone model. These results might have a direct impact on the early risk assessment of patients with AP in the daily clinical practice.--------- RESUMO: A proteina c-reactiva (CRP) tem sido largamente usada na avaliação precoce do risco em doentes com pancreatite aguda (AP), mas aspectos duvidosos acerca do seu valor prognóstico neste contexto persistem. Este projecto avaliou primeiro o valor prognóstico da CRP para a gravidade, a necrose pancreática (PNec) e a mortalidade intra-hospitalar (IM) na AP em termos do melhor momento para efectuar a sua medição e dos seus pontos-de-corte óptimos. Em segundo lugar foi avaliado o valor prognóstico da proteína c-reactiva medida aproximadamente às 24 horas após a admissão hospitalar (CRP24) para a IM na AP isoladamente e num modelo combinado, que incluiu uma ferramenta de avaliação precoce do risco em doentes com AP recentemente desenvolvida, o Bedside Index for Severity in Acute Pancreatitis (BISAP). Dois estudos unicêntricos de coorte retrospectivo foram realizados. O primeiro estudo incluiu 379 doentes e o segundo estudo incluiu 134 doentes. Metodologias estatísticas como o teste de Hosmer-Lemeshow goodness-of-fit, a area under the receiver-operating characteristic curve, o net reclassification improvement e o integrated discrimination improvement foram usadas. Verificou-se que a CRP medida às 48 horas após a admissão hospitalar (CRP48) teve um valor prognóstico para a gravidade, a PNec e a IM na AP melhor do que a CRP medida em qualquer outro momento. Observou-se que os pontos de corte óptimos da CRP48 para a gravidade, a PNec e a IM na AP variaram entre 170mg/l e 190mg/l, valores acima do valor mais frequentemente recomendado na literatura – 150mg/l. Verificou-se que a CRP medida aproximadamente às 24 horas após a admissão hospitalar (CRP24) teve um bom valor prognóstico para a IM na AP e que o ponto de corte 60mg/l teve um valor preditivo negativo de 100%. Finalmente observou-se que o valor prognóstico de um modelo combinado incluindo o BISAP e a CRP24 para a IM na AP pode ter um desempenho melhor do que o do BISAP isoladamente. Estes resultados podem ter um impacto directo na avaliação precoce do risco em doentes com AP na prática clínica diária.

Data-centric concurrency control on the java programming language

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Child programming: an adequate domain specific language for programming specific robots

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Petri net based development of globally-asynchronous locally-synchronous distributed embedded systems

Dissertação para obtenção do Grau de Doutor em Engenharia Electrotécnica e de Computadores

Towards an algorithmic skeleton framework for programming the Intel R Xeon PhiTM processor

The Intel R Xeon PhiTM is the first processor based on Intel’s MIC (Many Integrated Cores) architecture. It is a co-processor specially tailored for data-parallel computations, whose basic architectural design is similar to the ones of GPUs (Graphics Processing Units), leveraging the use of many integrated low computational cores to perform parallel computations. The main novelty of the MIC architecture, relatively to GPUs, is its compatibility with the Intel x86 architecture. This enables the use of many of the tools commonly available for the parallel programming of x86-based architectures, which may lead to a smaller learning curve. However, programming the Xeon Phi still entails aspects intrinsic to accelerator-based computing, in general, and to the MIC architecture, in particular. In this thesis we advocate the use of algorithmic skeletons for programming the Xeon Phi. Algorithmic skeletons abstract the complexity inherent to parallel programming, hiding details such as resource management, parallel decomposition, inter-execution flow communication, thus removing these concerns from the programmer’s mind. In this context, the goal of the thesis is to lay the foundations for the development of a simple but powerful and efficient skeleton framework for the programming of the Xeon Phi processor. For this purpose we build upon Marrow, an existing framework for the orchestration of OpenCLTM computations in multi-GPU and CPU environments. We extend Marrow to execute both OpenCL and C++ parallel computations on the Xeon Phi. We evaluate the newly developed framework, several well-known benchmarks, like Saxpy and N-Body, will be used to compare, not only its performance to the existing framework when executing on the co-processor, but also to assess the performance on the Xeon Phi versus a multi-GPU environment.

Transactions in dynamic reactive environments

Most of today’s systems, especially when related to the Web or to multi-agent systems, are not standalone or independent, but are part of a greater ecosystem, where they need to interact with other entities, react to complex changes in the environment, and act both over its own knowledge base and on the external environment itself. Moreover, these systems are clearly not static, but are constantly evolving due to the execution of self updates or external actions. Whenever actions and updates are possible, the need to ensure properties regarding the outcome of performing such actions emerges. Originally purposed in the context of databases, transactions solve this problem by guaranteeing atomicity, consistency, isolation and durability of a special set of actions. However, current transaction solutions fail to guarantee such properties in dynamic environments, since they cannot combine transaction execution with reactive features, or with the execution of actions over domains that the system does not completely control (thus making rolling back a non-viable proposition). In this thesis, we investigate what and how transaction properties can be ensured over these dynamic environments. To achieve this goal, we provide logic-based solutions, based on Transaction Logic, to precisely model and execute transactions in such environments, and where knowledge bases can be defined by arbitrary logic theories.