OPTIMIZATION OF NONSTANDARD REASONING SERVICES

The increasing adoption of semantic technologies and the corresponding increasing complexity of application requirements are motivating extensions to the standard reasoning paradigms and services supported by such technologies. This thesis focuses on two of such extensions: nonmonotonic reasoning and inference-proof access control. Expressing knowledge via general rules that admit exceptions is an approach that has been commonly adopted for centuries in areas such as law and science, and more recently in object-oriented programming and computer security. The experiences in developing complex biomedical knowledge bases reported in the literature show that a direct support to defeasible properties and exceptions would be of great help. On the other hand, there is ample evidence of the need for knowledge confidentiality measures. Ontology languages and Linked Open Data are increasingly being used to encode the private knowledge of companies and public organizations. Semantic Web techniques facilitate merging different sources of knowledge and extract implicit information, thereby putting at risk security and the privacy of individuals. But the same reasoning capabilities can be exploited to protect the confidentiality of knowledge. Both nonmonotonic inference and secure knowledge base access rely on nonstandard reasoning procedures. The design and realization of these algorithms in a scalable way (appropriate to the ever-increasing size of ontologies and knowledge bases) is carried out by means of a diversified range of optimization techniques such as appropriate module extraction and incremental reasoning. Extensive experimental evaluation shows the efficiency of the developed optimization techniques: (i) for the first time performance compatible with real-time reasoning is obtained for large nonmonotonic ontologies, while (ii) the secure ontology access control proves to be already compatible with practical use in the e-health application scenario.

Reasoning in Description Logic Ontologies for Privacy Management

A rise in the number of ontologies that are integrated and distributed in numerous application systems may provide the users to access the ontologies with different privileges and purposes. In this situation, preserving confidential information from possible unauthorized disclosures becomes a critical requirement. For instance, in the clinical sciences, unauthorized disclosures of medical information do not only threaten the system but also, most importantly, the patient data. Motivated by this situation, this thesis initially investigates a privacy problem, called the identity problem, where the identity of (anonymous) objects stored in Description Logic ontologies can be revealed or not. Then, we consider this problem in the context of role-based access control to ontologies and extend it to the problem asking if the identity belongs to a set of known individuals of cardinality smaller than the number k. If it is the case that some confidential information of persons, such as their identity, their relationships or their other properties, can be deduced from an ontology, which implies that some privacy policy is not fulfilled, then one needs to repair this ontology such that the modified one complies with the policies and preserves the information from the original ontology as much as possible. The repair mechanism we provide is called gentle repair and performed via axiom weakening instead of axiom deletion which was commonly used in classical approaches of ontology repair. However, policy compliance itself is not enough if there is a possible attacker that can obtain relevant information from other sources, which together with the modified ontology still violates the privacy policies. Safety property is proposed to alleviate this issue and we investigate this in the context of privacy-preserving ontology publishing. Inference procedures to solve those privacy problems and additional investigations on the complexity of the procedures, as well as the worst-case complexity of the problems, become the main contributions of this thesis.:1. Introduction 1.1 Description Logics 1.2 Detecting Privacy Breaches in Information System 1.3 Repairing Information Systems 1.4 Privacy-Preserving Data Publishing 1.5 Outline and Contribution of the Thesis 2. Preliminaries 2.1 Description Logic ALC 2.1.1 Reasoning in ALC Ontologies 2.1.2 Relationship with First-Order Logic 2.1.3. Fragments of ALC 2.2 Description Logic EL 2.3 The Complexity of Reasoning Problems in DLs 3. The Identity Problem and Its Variants in Description Logic Ontologies 3.1 The Identity Problem 3.1.1 Description Logics with Equality Power 3.1.2 The Complexity of the Identity Problem 3.2 The View-Based Identity Problem 3.3 The k-Hiding Problem 3.3.1 Upper Bounds 3.3.2 Lower Bound 4. Repairing Description Logic Ontologies 4.1 Repairing Ontologies 4.2 Gentle Repairs 4.3 Weakening Relations 4.4 Weakening Relations for EL Axioms 4.4.1 Generalizing the Right-Hand Sides of GCIs 4.4.2 Syntactic Generalizations 4.5 Weakening Relations for ALC Axioms 4.5.1 Generalizations and Specializations in ALC w.r.t. Role Depth 4.5.2 Syntactical Generalizations and Specializations in ALC 5. Privacy-Preserving Ontology Publishing for EL Instance Stores 5.1 Formalizing Sensitive Information in EL Instance Stores 5.2 Computing Optimal Compliant Generalizations 5.3 Computing Optimal Safe^{\exists} Generalizations 5.4 Deciding Optimality^{\exists} in EL Instance Stores 5.5 Characterizing Safety^{\forall} 5.6 Optimal P-safe^{\forall} Generalizations 5.7 Characterizing Safety^{\forall\exists} and Optimality^{\forall\exists} 6. Privacy-Preserving Ontology Publishing for EL ABoxes 6.1 Logical Entailments in EL ABoxes with Anonymous Individuals 6.2 Anonymizing EL ABoxes 6.3 Formalizing Sensitive Information in EL ABoxes 6.4 Compliance and Safety for EL ABoxes 6.5 Optimal Anonymizers 7. Conclusion 7.1 Main Results 7.2 Future Work Bibliograph

Advances in Reinforcement Learning

Reinforcement Learning (RL) is a very dynamic area in terms of theory and application. This book brings together many different aspects of the current research on several fields associated to RL which has been growing rapidly, producing a wide variety of learning algorithms for different applications. Based on 24 Chapters, it covers a very broad variety of topics in RL and their application in autonomous systems. A set of chapters in this book provide a general overview of RL while other chapters focus mostly on the applications of RL paradigms: Game Theory, Multi-Agent Theory, Robotic, Networking Technologies, Vehicular Navigation, Medicine and Industrial Logistic

Kernel Estimation of Spot Volatility and Its Application in Volatility Functional Estimation

It\^o semimartingale models for the dynamics of asset returns have been widely studied in financial econometrics. A key component of the model, spot volatility, plays a crucial role in option pricing, portfolio management, and financial risk assessment. In this dissertation, we consider three problems related to the estimation of spot volatility using high-frequency asset returns. We first revisit the problem of estimating the spot volatility of an It\^o semimartingale using a kernel estimator. We prove a Central Limit Theorem with an optimal convergence rate for a general two-sided kernel under quite mild assumptions, which includes leverage effects and jumps of bounded and unbounded variations on both the return and volatility processes. For our second project, we introduce a new pre-averaging/kernel estimator for spot volatility to handle the microstructure noise of ultra-high-frequency observations of the asset returns. We establish a new Central Limit Theorem for the estimation error with an optimal rate and, as an application, we study the optimal selection of the bandwidth and kernel functions. We show that the pre-averaging/kernel estimator\u27s asymptotic variance is minimal for two-sided exponential kernels, hence, justifying the need of working with kernels of unbounded support as opposed to the most commonly used uniform kernel. We also develop a feasible implementation of the proposed estimators with optimal bandwidth. Monte Carlo experiments confirm the superior performance of the devised method. Lastly, as an application of spot volatility estimation, we study the problem of estimating integrated volatility functionals; that is, integrals of any given function of the volatility over a specified period (typically, one day). We propose a Riemann sum based estimator with kernel spot volatility estimators as plug-ins. We prove a Central Limit Theorem for the estimator with optimal convergence rate. We show our estimator\u27s bias can be reduced by adopting a general kernel, and we provide an unbiased central limit theorem for the estimator with a proper de-biasing term. Monte Carlo experiments confirm the advantage of using a general kernel estimator

Automated Deduction – CADE 28

This open access book constitutes the proceeding of the 28th International Conference on Automated Deduction, CADE 28, held virtually in July 2021. The 29 full papers and 7 system descriptions presented together with 2 invited papers were carefully reviewed and selected from 76 submissions. CADE is the major forum for the presentation of research in all aspects of automated deduction, including foundations, applications, implementations, and practical experience. The papers are organized in the following topics: Logical foundations; theory and principles; implementation and application; ATP and AI; and system descriptions

MIMO designs for filter bank multicarrier and multiantenna systems based on OQAM

From the perspective of increasingly data rate requirements in mobile communications, it is deemed necessary to do further research so that the future goals can be reached. To that end, the radio-based communications are resorting to multicarrier modulations and spatial diversity. Until today, the orthogonal frequency division multiplexing (OFDM) modulation is regarded as the dominant technology. On one hand, the OFDM modulation is able to accommodate multiantenna configurations in a very straightforward manner. On the other hand, the poor stopband attenuation exhibited by the OFDM modulation, highlights that a definitely tight synchronization is required. In addition, the cyclic prefix (CP) has to be sufficiently long to avoid inter-block interference, which may substantially reduce the spectral efficiency. In order to overcome the OFDM drawbacks, the filter bank multicarrier modulation based on OQAM (FBMC/OQAM) is introduced. This modulation does not need any CP and benefits from pulse shaping techniques. This aspect becomes crucial in cognitive radio networks and communication systems where nodes are unlikely to be synchronized. In principle, the poor frequency confinement exhibited by OFDM should tip the balance towards FBMC/OQAM. However, the perfect reconstruction property of FBMC/OQAM systems does not hold in presence of multipath fading. This means that the FBMC/OQAM modulation is affected by inter-symbol and inter-carrier interference, unless the channel is equalized to some extent. This observation highlights that the FBMC/OQAM extension to MIMO architectures becomes a big challenge due to the need to cope with both modulation- and multiantenna-induced interference. The goal of this thesis is to study how the FBMC/OQAM modulation scheme can benefit from the degrees of freedom provided by the spatial dimension. In this regard, the first attempt to put the research on track is based on designing signal processing techniques at reception. In this case the emphasis is on single-input-multiple-output (SIMO) architectures. Next, the possibility of pre-equalizing the channel at transmission is investigated. It is considered that multiple antennas are placed at the transmit side giving rise to a multiple-input-single-output (MISO) configuration. In this scenario, the research is not only focused on counteracting the channel but also on distributing the power among subcarriers. Finally, the joint transmitter and receiver design in multiple-input-multiple-output (MIMO) communication systems is covered. From the theory developed in this thesis, it is possible to conclude that the techniques originally devised in the OFDM context can be easily adapted to FBMC/OQAM systems if the channel frequency response is flat within the subchannels. However, metrics such as the peak to average power ratio or the sensitivity to the carrier frequency offset constraint the number of subcarriers, so that the frequency selectivity may be appreciable at the subcarrier level. Then, the flat fading assumption is not satisfied and the specificities of FBMC/OQAM systems have to be considered. In this situation, the proposed techniques allow FBMC/OQAM to remain competitive with OFDM. In addition, for some multiantenna configurations and propagation conditions FBMC/OQAM turns out to be the best choice. The simulation-based results together with the theoretical analysis conducted in this thesis contribute to make progress towards the application of FBMC/OQAM to MIMO channels. The signal processing techniques that are described in this dissertation allow designers to exploit the potentials of FBMC/OQAM and MIMO to improve the link reliability as well as the spectral efficiency

Book of abstracts of the 10th International Chemical and Biological Engineering Conference: CHEMPOR 2008

This book contains the extended abstracts presented at the 10th International Chemical and Biological Engineering Conference - CHEMPOR 2008, held in Braga, Portugal, over 3 days, from the 4th to the 6th of September, 2008. Previous editions took place in Lisboa (1975, 1889, 1998), Braga (1978), Póvoa de Varzim (1981), Coimbra (1985, 2005), Porto (1993), and Aveiro (2001). The conference was jointly organized by the University of Minho, “Ordem dos Engenheiros”, and the IBB - Institute for Biotechnology and Bioengineering with the usual support of the “Sociedade Portuguesa de Química” and, by the first time, of the “Sociedade Portuguesa de Biotecnologia”. Thirty years elapsed since CHEMPOR was held at the University of Minho, organized by T.R. Bott, D. Allen, A. Bridgwater, J.J.B. Romero, L.J.S. Soares and J.D.R.S. Pinheiro. We are fortunate to have Profs. Bott, Soares and Pinheiro in the Honor Committee of this 10th edition, under the high Patronage of his Excellency the President of the Portuguese Republic, Prof. Aníbal Cavaco Silva. The opening ceremony will confer Prof. Bott with a “Long Term Achievement” award acknowledging the important contribution Prof. Bott brought along more than 30 years to the development of the Chemical Engineering science, to the launch of CHEMPOR series and specially to the University of Minho. Prof. Bott’s inaugural lecture will address the importance of effective energy management in processing operations, particularly in the effectiveness of heat recovery and the associated reduction in greenhouse gas emission from combustion processes. The CHEMPOR series traditionally brings together both young and established researchers and end users to discuss recent developments in different areas of Chemical Engineering. The scope of this edition is broadening out by including the Biological Engineering research. One of the major core areas of the conference program is life quality, due to the importance that Chemical and Biological Engineering plays in this area. “Integration of Life Sciences & Engineering” and “Sustainable Process-Product Development through Green Chemistry” are two of the leading themes with papers addressing such important issues. This is complemented with additional leading themes including “Advancing the Chemical and Biological Engineering Fundamentals”, “Multi-Scale and/or Multi-Disciplinary Approach to Process-Product Innovation”, “Systematic Methods and Tools for Managing the Complexity”, and “Educating Chemical and Biological Engineers for Coming Challenges” which define the extended abstracts arrangements along this book. A total of 516 extended abstracts are included in the book, consisting of 7 invited lecturers, 15 keynote, 105 short oral presentations given in 5 parallel sessions, along with 6 slots for viewing 389 poster presentations. Full papers are jointly included in the companion Proceedings in CD-ROM. All papers have been reviewed and we are grateful to the members of scientific and organizing committees for their evaluations. It was an intensive task since 610 submitted abstracts from 45 countries were received. It has been an honor for us to contribute to setting up CHEMPOR 2008 during almost two years. We wish to thank the authors who have contributed to yield a high scientific standard to the program. We are thankful to the sponsors who have contributed decisively to this event. We also extend our gratefulness to all those who, through their dedicated efforts, have assisted us in this task. On behalf of the Scientific and Organizing Committees we wish you that together with an interesting reading, the scientific program and the social moments organized will be memorable for all.Fundação para a Ciência e a Tecnologia (FCT