Compilation for QCSP

We propose in this article a framework for compilation of quantified constraint satisfaction problems (QCSP). We establish the semantics of this formalism by an interpretation to a QCSP. We specify an algorithm to compile a QCSP embedded into a search algorithm and based on the inductive semantics of QCSP. We introduce an optimality property and demonstrate the optimality of the interpretation of the compiled QCSP.Comment: Proceedings of the 13th International Colloquium on Implementation of Constraint LOgic Programming Systems (CICLOPS 2013), Istanbul, Turkey, August 25, 201

Quantified weighted constraint satisfaction problems.

Mak, Wai Keung Terrence.Thesis (M.Phil.)--Chinese University of Hong Kong, 2011.Includes bibliographical references (p. 100-104).Abstracts in English and Chinese.Chapter 1 --- Introduction --- p.1Chapter 1.1 --- Constraint Satisfaction Problems --- p.1Chapter 1.2 --- Weighted Constraint Satisfaction Problems --- p.2Chapter 1.3 --- Quantified Constraint Satisfaction Problems --- p.3Chapter 1.4 --- Motivation and Goal --- p.4Chapter 1.5 --- Outline of the Thesis --- p.6Chapter 2 --- Background --- p.7Chapter 2.1 --- Constraint Satisfaction Problems --- p.7Chapter 2.1.1 --- Backtracking Tree Search --- p.9Chapter 2.1.2 --- Local Consistencies for solving CSPs --- p.11Node Consistency (NC) --- p.13Arc Consistency (AC) --- p.14Searching by Maintaining Arc Consistency --- p.16Chapter 2.1.3 --- Constraint Optimization Problems --- p.17Chapter 2.2 --- Weighted Constraint Satisfaction Problems --- p.19Chapter 2.2.1 --- Branch and Bound Search (B&B) --- p.23Chapter 2.2.2 --- Local Consistencies for WCSPs --- p.25Node Consistency --- p.26Arc Consistency --- p.28Chapter 2.3 --- Quantified Constraint Satisfaction Problems --- p.32Chapter 2.3.1 --- Backtracking Free search --- p.37Chapter 2.3.2 --- Consistencies for QCSPs --- p.38Chapter 2.3.3 --- Look Ahead for QCSPs --- p.45Chapter 3 --- Quantified Weighted CSPs --- p.48Chapter 4 --- Branch & Bound with Consistency Techniques --- p.54Chapter 4.1 --- Alpha-Beta Pruning --- p.54Chapter 4.2 --- Consistency Techniques --- p.57Chapter 4.2.1 --- Node Consistency --- p.62Overview --- p.62Lower Bound of A-Cost --- p.62Upper Bound of A-Cost --- p.66Projecting Unary Costs to Cθ --- p.67Chapter 4.2.2 --- Enforcing Algorithm for NC --- p.68Projection Phase --- p.69Pruning Phase --- p.69Time Complexity --- p.71Chapter 4.2.3 --- Arc Consistency --- p.73Overview --- p.73Lower Bound of A-Cost --- p.73Upper Bound of A-Cost --- p.75Projecting Binary Costs to Unary Constraint --- p.75Chapter 4.2.4 --- Enforcing Algorithm for AC --- p.76Projection Phase --- p.77Pruning Phase --- p.77Time complexity --- p.79Chapter 5 --- Performance Evaluation --- p.83Chapter 5.1 --- Definitions of QCOP/QCOP+ --- p.83Chapter 5.2 --- Transforming QWCSPs into QCOPs --- p.90Chapter 5.3 --- Empirical Evaluation --- p.91Chapter 5.3.1 --- Random Generated Problems --- p.92Chapter 5.3.2 --- Graph Coloring Game --- p.92Chapter 5.3.3 --- Min-Max Resource Allocation Problem --- p.93Chapter 5.3.4 --- Value Ordering Heuristics --- p.94Chapter 6 --- Concluding Remarks --- p.96Chapter 6.1 --- Contributions --- p.96Chapter 6.2 --- Limitations and Related Works --- p.97Chapter 6.3 --- Future Works --- p.99Bibliography --- p.10

Applications of CSP solving in computer games (camera control)

While camera control systems of commercial 3D games have improved greatly in recent years, they are not as fully developed as are other game components such as graphics and physics engines. Bourne and Sattar (2006) have proposed a reactive constraint based third person perspective camera control system. We have extended the capability of their system to handle occlusion while following the main character, and have used camera cuts to find appropriate camera positions for a few difficult situations. We have developed a reactive constraint based third person perspective chase camera control system to follow a character in a 3D environment. The camera follows the character from (near) optimal positions defined by a camera profile. The desired values of the height and distance constraints of the camera profile are changed appropriately whenever the character enters a semi-enclosed or an enclosed area, and the desired value of the orientation constraint of the camera profile is changed incrementally whenever theoptimal camera view is obstructed. Camera cuts are used whenever the main character backs up to a wall or any other obstructions, or comes out of a semi-enclosed or an enclosed area. Two auxiliary cameras to observe the main camera positions from top and side views have been added. The chase camera control system achieved real-time performance while following the main character in a typical 3D environment, and maintained an optimal view based on a user specified/selected camera profile

Spandex: Secure password tracking for android

Abstract This paper presents SpanDex, a set of extensions to Android's Dalvik virtual machine that ensures apps do not leak users' passwords. The primary technical challenge addressed by SpanDex is precise, sound, and efficient handling of implicit information flows (e.g., information transferred by a program's control flow). SpanDex handles implicit flows by borrowing techniques from symbolic execution to precisely quantify the amount of information a process' control flow reveals about a secret. To apply these techniques at runtime without sacrificing performance, SpanDex runs untrusted code in a data-flow sensitive sandbox, which limits the mix of operations that an app can perform on sensitive data. Experiments with a SpanDex prototype using 50 popular Android apps and an analysis of a large list of leaked passwords predicts that for 90% of users, an attacker would need over 80 login attempts to guess their password. Today the same attacker would need only one attempt for all users

Practical Dynamic Information-Flow Tracking on Mobile Devices

<p>Today's consumer mobile platforms such as Android and iOS manage large ecosystems of untrusted third-party applications. It is common for an application to request one or more types of sensitive data. Unfortunately, users have no insight into how their data is used. Given the sensitivity of the data accessible by these applications, it is paramount that mobile operating systems prevent apps from leaking it.</p><p>This dissertation shows that it is possible to improve the soundness of dynamic information-flow tracking on a mobile device without sacrificing precision, performance, or transparency. We extend the state of the art in dynamic information-flow tracking on Android and address two major limitations: quantifying implicit flow leaks in Dalvik bytecode and tracking explicit flows in native code. Our goal is to deliver seamless end-to-end taint tracking across Dalvik bytecode and native code.</p><p>We propose SpanDex, a system that quantifies implicit flow leaks in Dalvik bytecode for apps handling password data. SpanDex computes a bound of revealed tainted data by recording the control-flow dependencies and for each password character, keeps track of the possible set of values that have been inferred. We also propose TaintTrap, a taint tracking system for native code in third party apps. We explore native taint tracking performance bottlenecks and hardware acceleration techniques to improve instrumentation performance.</p>Dissertatio

Interactive narrative generation using computational verb theory

Interactive narrative extends traditional story-telling techniques by enabling previously passive observers to become active participants in the narrative events that unfold. A variety of approaches have attempted to construct such interactive narrative spaces and reconcile the goals of interactivity and dramatic story-telling. With the advent of the linguistic variable in 1972, a means was established for modelling natural language words and phrases mathematically and computationally. Over the past decade, the computational verb, first introduced in 1997, has been developed as a mathematical means of modelling natural language verbs in terms of dynamic systems, and vice versa. Computational verb theory extends the initial concept of the linguistic variable beyond being able to model adjectives, nouns, and passive states, into the realm of actions as denoted by natural language verbs. This thesis presents the framework and implementation of a system that generates interactive narrative spaces from narrative text. The concept of interactive narrative is introduced and recent developments in the area of interactive narrative are discussed. Secondly, a brief history of the development of the linguistic variable and the computational verb are provided. With the context of the computational verb (interactive) narrative generation (CVTNG) system presented, the underlying theoretical principles of the system are established. The CVTNG system principles are described in terms of fuzzy set, computational verb, and constraint satisfaction theory. The fuzzy set, computational verb, and constraint satisfaction principles are organised according to a CVTNG architecture. The CVTNG architecture is then described in terms of its subsystems, structures, algorithms, and interfaces. Each CVTNG system component is related to the overall design considerations and goals. A prototype of the CVTNG system is implemented and tested against a suite of natural language sentences. The behaviour and performance of the CVTNG system prototype are discussed in relation to the CVTNG system’s design principles. Results are calculated and stored as variable values that are dynamically and generically associated with representational means, specifically computer graphics, to illustrate the generation of interactive narrative spaces. Plans for future work are discussed to show the immense development potential of this application. The thesis concludes that the CVTNG system provides a solid and extendable base for the intuitive generation of interactive narrative spaces from narrative text, computational verb models, and freely associated media. CopyrightDissertation (MSc)--University of Pretoria, 2009.Computer ScienceUnrestricte

Proceedings of the NASA Conference on Space Telerobotics, volume 1

The theme of the Conference was man-machine collaboration in space. Topics addressed include: redundant manipulators; man-machine systems; telerobot architecture; remote sensing and planning; navigation; neural networks; fundamental AI research; and reasoning under uncertainty

On the Control of Active End-nodes in the Smart Grid

The electrical grid has substantially changed in recent years due to the integration of several disruptive load and generation technologies into low-voltage distribution networks, which are meant to smarten it and improve its efficiency. These technologies have subjected the grid to unprecedented amounts of variability and uncertainty that threaten its reliability and could reduce its efficiency. Even a low penetration of these disruptive technologies may cause equipment overloads, voltage deviations beyond permissible operating thresholds, and bidirectional power flows in distribution networks. The smart grid will comprise a vast number of active end-nodes, including electric vehicle chargers, solar inverters, storage systems, and other elastic loads, that can be quickly controlled to adjust their real and reactive power contributions. Given the availability of inexpensive measurement devices and a broadband communication network that connects measurement devices to controllers, it is possible to incorporate potentially disruptive technologies into distribution networks while maintaining service reliability, using some novel control mechanisms, which are the focus of this thesis. In this thesis, we propose a new paradigm for the control of active end-nodes at scale. This control paradigm relies on real-time measurements of the states of the distribution network and the end-nodes rather than long-term predictions. We use an optimal control framework to design mechanisms that balance a set of system-level and user-level objectives. We study control of active end-nodes in two different contexts: a radial distribution system and a grid-connected public electric vehicle charging station powered by on-site solar generation. We develop both a feedback controller and an open-loop controller, and propose centralized and distributed algorithms for solving optimal control problems. We implement and validate these control mechanisms using extensive numerical simulations and power flow analysis on a standard test system

An analysis of the relationship between individuals’ perceptions of privacy and mobile phone location data - a grounded theory study

The mobile phone is a ubiquitous tool in today’s society, a daily companion for the majority of British citizens. The ability to trace a mobile phone’s geographic position at all times via mobile phone networks generates potentially sensitive data that can be stored and shared for significant lengths of time, particularly for the purpose of crime and terrorism investigations. This thesis examines the implications of the storage and use of mobile phone location data on individuals’ perceptions of privacy. The grounded theory methodology has been used to illustrate patterns and themes that are useful in understanding the broader discourses concerning location data relating to privacy, technology and policy-setting. The main contribution of this thesis is the development of a substantive theory grounded in empirical data from interviews, mobile phone location tracking and a survey. This theory is specific to a particular area, as it maps the relationship between mobile phone location data and perceptions of privacy within the UK. The theory confirms some arguments in the literature that argue that the concept of privacy is changing with individuals' increased dependence on electronic communications technologies in day-to-day life. However, whilst individuals tend to hold a rather traditional picture of privacy, not influenced by technology and solely related to their own personal lives, scholars paint a picture of privacy that is affected by technology and relates to society as a whole. Digital mass data collections, such as communications data retention, are not perceived as privacy invasive by individuals. Mobile phone location data is not seen as related to a citizen's daily life but instead primarily as a crime investigation tool. A recognition and understanding of the divergence between the perceptions and definitions of privacy between individuals and the academic literature in relation to mobile phone location data is of relevance, as it should impact on future policies regulating the gathering, storage and analysis of personal data