Multi-Agent Systems

A multi-agent system (MAS) is a system composed of multiple interacting intelligent agents. Multi-agent systems can be used to solve problems which are difficult or impossible for an individual agent or monolithic system to solve. Agent systems are open and extensible systems that allow for the deployment of autonomous and proactive software components. Multi-agent systems have been brought up and used in several application domains

Regulating competence-based access to agent societies

Advances in ubiquitous computing have resulted in changes to the way we access and use everyday applications, e.g. reading mail and booking tickets. At the same time, users interact with these applications in a variety of ways, each with different characteristics, e.g., different degrees of bandwidth, different payment schemes supported and so on. These are highly dynamic interactions, as some of the applications might become unavailable (either temporarily or permanently) or their behaviour may change. As the user has to deal with a large number of proactive and dynamic applications every day, he will need a personal assistant that possesses similar characteristics. The agent paradigm meets this requirement, since it exhibits the necessary features. As a result, the user will provide its personal agent assistant with a goal, e.g. I need a smartphone which costs less than three hundred pounds, and the agent will have to use a number of applications offering information on smartphones so that it finds the requested one. This, in turn, raises a number of issues regarding the organisation and the degrees of access to these services as well as the correctness of their descriptions. In this work, we propose the organisation of applications around the concept of artificial agent societies, to which access would be possible only by a positive evaluation of an agent's application. The agent will provide the Authority Agent with the role it is applying for and its competencies in the context of a protocol, i.e., the messages that it can utter/understand. The Authority Agent will then check to see if the applicant agent is a competent user of the protocols; if yes, entry is granted. Assuming that access is granted, the next issue is to decide on the protocol(s) that agent receives. As providing the full protocol will cause security and overload problems, we only need to provide the part required for the agent to play its role. We show how this can be done and how we can repair certain protocols so that they are indeed enactable once this role decomposition is performed

Regulating competence-based access to agent societies

Advances in ubiquitous computing have resulted in changes to the way we access and use everyday applications, e.g. reading mail and booking tickets. At the same time, users interact with these applications in a variety of ways, each with different characteristics, e.g., different degrees of bandwidth, different payment schemes supported and so on. These are highly dynamic interactions, as some of the applications might become unavailable (either temporarily or permanently) or their behaviour may change. As the user has to deal with a large number of proactive and dynamic applications every day, he will need a personal assistant that possesses similar characteristics. The agent paradigm meets this requirement, since it exhibits the necessary features. As a result, the user will provide its personal agent assistant with a goal, e.g. I need a smartphone which costs less than three hundred pounds, and the agent will have to use a number of applications offering information on smartphones so that it finds the requested one. This, in turn, raises a number of issues regarding the organisation and the degrees of access to these services as well as the correctness of their descriptions. In this work, we propose the organisation of applications around the concept of artificial agent societies, to which access would be possible only by a positive evaluation of an agent's application. The agent will provide the Authority Agent with the role it is applying for and its competencies in the context of a protocol, i.e., the messages that it can utter/understand. The Authority Agent will then check to see if the applicant agent is a competent user of the protocols; if yes, entry is granted. Assuming that access is granted, the next issue is to decide on the protocol(s) that agent receives. As providing the full protocol will cause security and overload problems, we only need to provide the part required for the agent to play its role. We show how this can be done and how we can repair certain protocols so that they are indeed enactable once this role decomposition is performed.EThOS - Electronic Theses Online ServiceGBUnited Kingdo

Implementation of second-life batteries as energy storage systems enhancing the interoperability and flexibility of the energy infrastructure in tertiary buildings

The main focus of this project is to evaluate the implementation of second-life batteries for a building stock enabling the energy flexibility schemes like Demand Response (DR). This project will focus particularly on how the building stock and its energy infrastructure (energy storage systems, legacy-assets, communication devices and grid architecture, among others) can participate as innovative energy solutions of the next generation of smart-grids, acting as virtual power plants (VPP) in order to deploy the distributed generation (DG) concept in the actual energy field and paving the way to unlock the demand response (DR) market in the distribution energy network. In addition, the implementation of these technologies will led to plan different business models and the scalability of them in the tertiary building sector. Battery energy storage systems (BESSs) are already being deployed for several stationary applications in a techno-economical feasible way. This project focuses in the study to obtain potential revenues from BESSs built from EVs lithium-ion batteries with varying states of health (SoH). For this analysis, a stationary BESS sizing model is done, using the parameters of a 14 kWh new battery, but also doing a comparison with parameters if the same battery would be 11.2 kWh second-life battery. The comprehensive sizing model consists of several detailed sub-models, considering battery specifications, aging and an operational strategy plan, which allow a technical assessment through a determined time frame. Therefore, battery depreciation and energy losses are considered in this techno-economic analysis. Potential economical feasible applications of new and second-life batteries, such the integration of a Building Integrated Photovoltaics (BIPV), self-consumption schemes, feed-in-tariff schemes and frequency regulation as well as their combined operation are compared. The research includes different electricity price scenarios mostly from the current Spanish energy market. The operation and integration of ICT-IoT technology upgrades is found to have the highest economic viability for this specific case study. A detailed study for this project will enhance the relevant importance of these topics in the energy field and how it will be a disruptive solution for the initial problem statement. A general context is given in order to introduce the main and specific objectives thus to trace an adequate way to follow and achieve them. The development of this master thesis will be coupled with the Demand Response Integration technologies (DRIvE) [10] H2020 EU funded project, currently on-going, considering some of the energy consumption data and initial parameters from the selected case study at COMSA Corporación office building in Barcelona, Spain

On the Existence of Characterization Logics and Fundamental Properties of Argumentation Semantics

Given the large variety of existing logical formalisms it is of utmost importance to select the most adequate one for a specific purpose, e.g. for representing the knowledge relevant for a particular application or for using the formalism as a modeling tool for problem solving. Awareness of the nature of a logical formalism, in other words, of its fundamental intrinsic properties, is indispensable and provides the basis of an informed choice. One such intrinsic property of logic-based knowledge representation languages is the context-dependency of pieces of knowledge. In classical propositional logic, for example, there is no such context-dependence: whenever two sets of formulas are equivalent in the sense of having the same models (ordinary equivalence), then they are mutually replaceable in arbitrary contexts (strong equivalence). However, a large number of commonly used formalisms are not like classical logic which leads to a series of interesting developments. It turned out that sometimes, to characterize strong equivalence in formalism L, we can use ordinary equivalence in formalism L0: for example, strong equivalence in normal logic programs under stable models can be characterized by the standard semantics of the logic of here-and-there. Such results about the existence of characterizing logics has rightly been recognized as important for the study of concrete knowledge representation formalisms and raise a fundamental question: Does every formalism have one? In this thesis, we answer this question with a qualified “yes”. More precisely, we show that the important case of considering only finite knowledge bases guarantees the existence of a canonical characterizing formalism. Furthermore, we argue that those characterizing formalisms can be seen as classical, monotonic logics which are uniquely determined (up to isomorphism) regarding their model theory. The other main part of this thesis is devoted to argumentation semantics which play the flagship role in Dung’s abstract argumentation theory. Almost all of them are motivated by an easily understandable intuition of what should be acceptable in the light of conflicts. However, although these intuitions equip us with short and comprehensible formal definitions it turned out that their intrinsic properties such as existence and uniqueness, expressibility, replaceability and verifiability are not that easily accessible. We review the mentioned properties for almost all semantics available in the literature. In doing so we include two main axes: namely first, the distinction between extension-based and labelling-based versions and secondly, the distinction of different kind of argumentation frameworks such as finite or unrestricted ones

Using MapReduce Streaming for Distributed Life Simulation on the Cloud

Distributed software simulations are indispensable in the study of large-scale life models but often require the use of technically complex lower-level distributed computing frameworks, such as MPI. We propose to overcome the complexity challenge by applying the emerging MapReduce (MR) model to distributed life simulations and by running such simulations on the cloud. Technically, we design optimized MR streaming algorithms for discrete and continuous versions of Conway’s life according to a general MR streaming pattern. We chose life because it is simple enough as a testbed for MR’s applicability to a-life simulations and general enough to make our results applicable to various lattice-based a-life models. We implement and empirically evaluate our algorithms’ performance on Amazon’s Elastic MR cloud. Our experiments demonstrate that a single MR optimization technique called strip partitioning can reduce the execution time of continuous life simulations by 64%. To the best of our knowledge, we are the first to propose and evaluate MR streaming algorithms for lattice-based simulations. Our algorithms can serve as prototypes in the development of novel MR simulation algorithms for large-scale lattice-based a-life models.https://digitalcommons.chapman.edu/scs_books/1014/thumbnail.jp

Computer Aided Verification

This open access two-volume set LNCS 11561 and 11562 constitutes the refereed proceedings of the 31st International Conference on Computer Aided Verification, CAV 2019, held in New York City, USA, in July 2019. The 52 full papers presented together with 13 tool papers and 2 case studies, were carefully reviewed and selected from 258 submissions. The papers were organized in the following topical sections: Part I: automata and timed systems; security and hyperproperties; synthesis; model checking; cyber-physical systems and machine learning; probabilistic systems, runtime techniques; dynamical, hybrid, and reactive systems; Part II: logics, decision procedures; and solvers; numerical programs; verification; distributed systems and networks; verification and invariants; and concurrency

Proof-theoretic Semantics for Intuitionistic Multiplicative Linear Logic

This work is the first exploration of proof-theoretic semantics for a substructural logic. It focuses on the base-extension semantics (B-eS) for intuitionistic multiplicative linear logic (IMLL). The starting point is a review of Sandqvist’s B-eS for intuitionistic propositional logic (IPL), for which we propose an alternative treatment of conjunction that takes the form of the generalized elimination rule for the connective. The resulting semantics is shown to be sound and complete. This motivates our main contribution, a B-eS for IMLL , in which the definitions of the logical constants all take the form of their elimination rule and for which soundness and completeness are established

Characterising and modeling the co-evolution of transportation networks and territories

The identification of structuring effects of transportation infrastructure on territorial dynamics remains an open research problem. This issue is one of the aspects of approaches on complexity of territorial dynamics, within which territories and networks would be co-evolving. The aim of this thesis is to challenge this view on interactions between networks and territories, both at the conceptual and empirical level, by integrating them in simulation models of territorial systems.Comment: Doctoral dissertation (2017), Universit\'e Paris 7 Denis Diderot. Translated from French. Several papers compose this PhD thesis; overlap with: arXiv:{1605.08888, 1608.00840, 1608.05266, 1612.08504, 1706.07467, 1706.09244, 1708.06743, 1709.08684, 1712.00805, 1803.11457, 1804.09416, 1804.09430, 1805.05195, 1808.07282, 1809.00861, 1811.04270, 1812.01473, 1812.06008, 1908.02034, 2012.13367, 2102.13501, 2106.11996