Core TuLiP

We propose CoreTuLiP - the core of a trust management language based on Logic Programming. CoreTuLiP is based on a subset of moded logic programming, but enjoys the features of TM languages such as RT; in particular clauses are issued by different authorities and stored in a distributed manner. We present a lookup and inference algorithm which we prove to be correct and complete w.r.t. the declarative semantics. CoreTuLiP enjoys uniform syntax and the well-established semantics and is expressive enough to model scenarios which are hard to deal with in RT

Natively Implementing Deep Reinforcement Learning into a Game Engine

Artificial intelligence (AI) increases the immersion that players can have while playing games. Modern game engines, a middleware software used to create games, implement simple AI behaviors that developers can use. Advanced AI behaviors must be implemented manually by game developers, which decreases the likelihood of game developers using advanced AI due to development overhead. A custom game engine and custom AI architecture that handled deep reinforcement learning was designed and implemented. Snake was created using the custom game engine to test the feasibility of natively implementing an AI architecture into a game engine. A snake agent was successfully trained using the AI architecture, but the learned behavior was suboptimal. Although the learned behavior was suboptimal, the AI architecture was successfully implemented into a custom game engine because a behavior was successfully learned

GEM: a Distributed Goal Evaluation Algorithm for Trust Management

Trust management is an approach to access control in distributed systems where access decisions are based on policy statements issued by multiple principals and stored in a distributed manner. In trust management, the policy statements of a principal can refer to other principals' statements; thus, the process of evaluating an access request (i.e., a goal) consists of finding a "chain" of policy statements that allows the access to the requested resource. Most existing goal evaluation algorithms for trust management either rely on a centralized evaluation strategy, which consists of collecting all the relevant policy statements in a single location (and therefore they do not guarantee the confidentiality of intensional policies), or do not detect the termination of the computation (i.e., when all the answers of a goal are computed). In this paper we present GEM, a distributed goal evaluation algorithm for trust management systems that relies on function-free logic programming for the specification of policy statements. GEM detects termination in a completely distributed way without disclosing intensional policies, thereby preserving their confidentiality. We demonstrate that the algorithm terminates and is sound and complete with respect to the standard semantics for logic programs.Comment: To appear in Theory and Practice of Logic Programming (TPLP

A flexible architecture for privacy-aware trust management

In service-oriented systems a constellation of services cooperate, sharing potentially sensitive information and responsibilities. Cooperation is only possible if the different participants trust each other. As trust may depend on many different factors, in a flexible framework for Trust Management (TM) trust must be computed by combining different types of information. In this paper we describe the TAS3 TM framework which integrates independent TM systems into a single trust decision point. The TM framework supports intricate combinations whilst still remaining easily extensible. It also provides a unified trust evaluation interface to the (authorization framework of the) services. We demonstrate the flexibility of the approach by integrating three distinct TM paradigms: reputation-based TM, credential-based TM, and Key Performance Indicator TM. Finally, we discuss privacy concerns in TM systems and the directions to be taken for the definition of a privacy-friendly TM architecture.\u

Progressive Analytics: A Computation Paradigm for Exploratory Data Analysis

Exploring data requires a fast feedback loop from the analyst to the system, with a latency below about 10 seconds because of human cognitive limitations. When data becomes large or analysis becomes complex, sequential computations can no longer be completed in a few seconds and data exploration is severely hampered. This article describes a novel computation paradigm called Progressive Computation for Data Analysis or more concisely Progressive Analytics, that brings at the programming language level a low-latency guarantee by performing computations in a progressive fashion. Moving this progressive computation at the language level relieves the programmer of exploratory data analysis systems from implementing the whole analytics pipeline in a progressive way from scratch, streamlining the implementation of scalable exploratory data analysis systems. This article describes the new paradigm through a prototype implementation called ProgressiVis, and explains the requirements it implies through examples.Comment: 10 page

The POLIPO Security Framework

Systems of systems are dynamic coalitions of distributed, autonomous and heterogeneous systems that collaborate to achieve a common goal. While offering several advantages in terms of scalability and flexibility, the systems of systems paradigm has a significant impact on systems interoperability and on the security requirements of the collaborating systems. In this chapter we introduce POLIPO, a security framework that protects the information exchanged among the systems in a system of systems, while preserving systems’ autonomy and interoperability. Information is protected from unauthorized access and improper modification by combining context-aware access control with trust management. Autonomy and interoperability are enabled by the use of ontology-based services. More precisely, each authority may refer to different ontologies to define the semantics of the terms used in the security policy of the system it governs and to describe domain knowledge and context information. A semantic alignment technique is then employed to map concepts from different ontologies and align the systems’ vocabularies. We demonstrate the applicability of our solution with a prototype implementation of the framework for a scenario in the maritime safety and security domain

GEM : a distributed goal evaluation algorithm for trust management

Trust Management (TM) is an approach to distributed access control where access decisions are based on policy statements issued by multiple principals and stored in a distributed manner. Most of the existing goal evaluation algorithms for TM either rely on a centralized evaluation strategy, which consists of collecting all the relevant policy statements in a single location (and therefore they do not guarantee the confidentiality of intensional policies), or do not detect the termination of the computation (i.e., when all the answers of a goal are computed). In this paper we present GEM, a distributed goal evaluation algorithm for TM systems. GEM detects termination in a completely distributed way without the need of disclosing intensional policies, thereby preserving their confidentiality. We demonstrate that the algorithm terminates and is sound and complete w.r.t. the standard semantics for logic programs

THE USE OF ELECTRONIC SURVEILLANCE AND PERFORMANCE MEASURES IN THE WORKPLACE: A QUALITATIVE INVESTIGATION

Electronic workplace surveillance takes many forms. It includes CCTV, recording telephone conversations, employee ID cards, and electronically gathering and measuring work performance. The increased incidences of electronic surveillance have had a number of effects on employees. This research concentrated on the use of quantified electronic performance measurement. It specifically examined the impact on managers and managing. It examined surveillance from an employment relationship perspective, taking as its primary lens that of exchange and exchange theory. The research demonstrated that the exchange relationships managers have with other managers, workers, or employers, as part of the psychological contract, is being compromised. Managers feel under pressure to manage based on the surfeit of electronic measures rather than by using innate or acquired management skills. Many managers in this research are no longer managers in the conventional sense; instead, they have become “Performance Intermediary Executives” invariably reliant on a plethora of electronic measures provided for them to help them manage successfully. Managers have also started questioning the equitable nature of the psychological contract between them and their employer/line manager. The result of this equity disjuncture was made manifest by the subtle forms of resistance used on a daily basis. Managers are being led down a managerial path leading to further resistance and inequitable employment and exchange relationships. This research suggests that claimed improvements in performance and performance management using electronic surveillance could be wiped out by poor and de-professionalised management. Organisations should be aware that surveillance for surveillance sake is not necessarily always the best way forward. Electronic workplace surveillance is not intrinsically all good or all bad, but judging from the findings in this research, its impact is broadly perceived by managers negatively, which is not good for all parties in the employment relationship

Social mobilisations, politics and society in contemporary Kyrgyzstan

This dissertation is about social mobilizations in rural Kyrgyzstan from 2010-2015. Following a constructivist approach, I aim to answer a puzzling question in regard to multiple but rarely sustainable protests in this global periphery: Under what conditions can provisional episodes of mobilization be transformed into sustained mobilization? In particularly, I consider Eric Hirsch’s insight that the commitment of participants of mobilization to the cause is formed within collective instances, i.e. ‘group processes’, and I employ it in the Kyrgyzstani context of generalized distrust and discredited corrupt politics. I explore the conditions in which participants of episodes of mobilization create trust in organizers and into the cause of mobilization. I investigate these conditions in two case studies: one concerns a fragmented labour force at a state-owned gas and oil company in which, in the course of four years, workers succeeded to empower themselves as a collective actor within the group processes of collective learning and collective decision-making. The second tells a story about a fragmented rural community that goes against mining operations but sees the decline of an initially successful mobilization within group processes of monitoring. These findings point to the presence of a specific ‘pre-condition’ for any lasting mobilization: trust between organizers and participants of episodes of mobilization must be established in the process of monitoring the commitment to collective interests. With this insight I contribute to the literature on social movements and mobilizations that tends to take commitment and trust as pre-established resources. Furthermore, this work intervenes in the ongoing discussion on social change in the former Soviet Union. First, my observations of the difficult formation of protest groups lead, surprisingly, to the conclusion that the weak state produces a weak society. Second, due to the fragmented and localized nature of these mobilizations, social and political change in Kyrgyzstan is most likely to occur at the local level.University of Central Asia University of Exete

GEM: a Distributed Goal Evaluation Algorithm for Trust Management

ABSTRACT Trust Management (TM) is an approach to distributed access control where access decisions are based on policy statements issued by multiple principals and stored in a distributed manner. Most of the existing goal evaluation algorithms for TM either rely on a centralized evaluation strategy, which consists of collecting all the relevant policy statements in a single location (and therefore they do not guarantee the confidentiality of intensional policies), or do not detect the termination of the computation (i.e., when all the answers of a goal are computed). In this paper we present GEM, a distributed goal evaluation algorithm for TM systems. GEM detects termination in a completely distributed way without the need of disclosing intensional policies, thereby preserving their confidentiality. We demonstrate that the algorithm terminates and is sound and complete w.r.t. the standard semantics for logic programs