Probabilistic databases play a crucial role in the management and understanding of uncertain data. However, incorporating probabilities into the semantics of incomplete databases has posed many challenges, forcing systems to sacrifice modeling power, scalability, or restrict the class of relational algebra formula under which they are closed. We propose an alternative approach where the underlying relational database always represents a single world, and an external factor graph encodes a distribution over possible worlds; Markov chain Monte Carlo (MCMC) inference is then used to recover this uncertainty to a desired level of fidelity. Our approach allows the efficient evaluation of arbitrary queries over probabilistic databases with arbitrary dependencies expressed by graphical models with structure that changes during inference. MCMC sampling provides efficiency by hypothesizing {\em modifications} to possible worlds rather than generating entire worlds from scratch. Queries are then run over the portions of the world that change, avoiding the onerous cost of running full queries over each sampled world. A significant innovation of this work is the connection between MCMC sampling and materialized view maintenance techniques: we find empirically that using view maintenance techniques is several orders of magnitude faster than naively querying each sampled world. We also demonstrate our system's ability to answer relational queries with aggregation, and demonstrate additional scalability through the use of parallelization.

Measuring the inconsistency degree of a knowledge base can help us to deal with inconsistencies. Several inconsistency measures have been given under different multi-valued semantics, including 4-valued semantics, 3-valued semantics, LPm and Quasi Classical semantics. In this paper, we first carefully analyze the relationship between these inconsistency measures by showing that the inconsistency degrees under 4-valued semantics, 3-value semantics, LPm are the same, but different from the one based on Quasi Classical semantics. We then consider the computation of these inconsistency measures and show that computing inconsistency measurement under multi-valued semantics is usually intractable. To tackle this problem, we propose two novel algorithms that respectively encode the problems of computing inconsistency degrees under 4-valued semantics (3-valued semantics, LPm) and under Quasi Classical semantics into the partial Max-SAT problems. We implement these algorithms and do experiments on some benchmark data sets. The preliminary but encouraging experimental results show that our approach is efficient to handle large knowledge bases.

We present Shopper, a plan execution engine that facilitates experimental evaluation of plans and makes it easier for planning researchers to incorporate replanning. Shopper interprets the LTML plan language, which extends PDDL in two major ways: with more expressive control structures, and with support for semantic web services modeled on OWL-S. LTML's command structures include not only conventional ones such as branching, iteration, and procedure calls, but also features needed to handle HTN plans, such as precondition-filtered method choice. Unlike conventional programming languages, LTML supports interaction with the agent's belief store, so that its execution semantics line up with those assumed by planners. LTML actions extend PDDL actions in having outputs as well as effects, which means that they can support actions that sense the world; an important special case of this is semantic web services, which reveal information about a state hidden from the agent. To support experimentation as well as action in the real world, Shopper accommodates multiple, swappable implementations of its primitive action API. For example, one may interact with real web services through SOAP and WSDL, or with simulated web services through local procedure calls. We describe novel features of LTML, the interpretation strategy, swappable back-ends, and the implementation.

We describe a timeline-based scheduling algorithm developed for mission operations of the EO-1 earth observing satellite. We first describe the range of operational constraints for operations focusing on maneuver and thermal constraints that cannot be modeled in typical planner/schedulers. We then describe a greedy heuristic scheduling algorithm and compare its performance to both the prior scheduling algorithm - documenting an over 50% increase in scenes scheduled with estimated value of millions of dollars US. We also compare to a relaxed optimal scheduler showing that the greedy scheduler produces schedules with scene count within 15% of an upper bound on optimal schedules.

Representing human behavior and cognition, from individuals to societies, presents a range of challenges to the modeling and simulation community. A common thread through many of these challenges is formulating an authentic representation of time. Many of the issues related to time representation, from the sequencing of cognitive decision processes and information processing, to communication and interaction between agents, to the longer term time scales associated with ideas such as belief revision, remain open research areas throughout the community. The inherent variability between human subjects makes generalization difficult even with data from designed experiments. Discrete event simulation (DES) provides a well-documented alternative to time-step simulation and shows potential for applications across the domain of human behavior representation. This paper provides an overview of a modular discrete event framework for social simulation, along with the social and behavioral theories underlying the currently implemented modules. We discuss the practical challenges presented by time in the representation of human cognition, and provide a case study analysis of the output of the discrete event social simulation.

One of the most significant challenges in achieving digital privacy is incorporating privacy policy directly in computer systems. While rule systems have long existed, translating privacy laws, regulations, policies, and contracts into processor amenable forms is slow and difficult because the legal text is scattered, run-on, and unstructured, antithetical to the lean and logical forms of computer science. We are using and developing intermediate isomorphic forms as a Rosetta Stone-like tool to accelerate the translation process and in hopes of providing support to future domain-specific Natural Language Processing technology. This report describes our experience, thoughts about how to improve the form, and discoveries about the form and logic of the legal text that will affect the successful development of a rules tool to implement real-world complex privacy policies.

Functional or end user requirements are the tasks that the system - Protection and control of consolidated data under development is expected to perform. However, nonfunctional - Data retrieval requirements are the qualities that the system is - Equitable treatment of users to adhere to. Functional requirements are not as difficult - Data retention and disposal to tackle, as it is easier to test their implementation in the - User monitoring and protection against unauthorized system under development. Security and privacy requirements monitoring are considered nonfunctional requirements, although in many instances they do have functionality. To identify Several laws and regulations provide a set of guidelines privacy risks early in the design process, privacy requirements that can be used to assess privacy risks. For example, engineering is used (Chiasera et al. 2008). However, the Health Insurance Portability and Accountability Act unlike security requirements engineering, little attention is (HIPAA) addresses privacy concerns of health information paid to privacy requirements engineering, thus it is less mature systems by enforcing data exchange standards.

The privacy dangers of data proliferation on the Web are well-known. Information on the Web has facilitated the deanonymization of anonymous bloggers, the de-sanitization of government records and the identification of individuals based on search engine queries. What has received less attention is Web-mining in support of privacy. In this position paper we argue that the very ability ofWeb data to breach privacy demonstrates its value as a laboratory for the detection of privacy breaches before they happen. In addition, we argue that privacy-invasive services may become privacy-respecting by mining publicly available Web data, with little decrease in performance and efficiency.

This paper addresses the use of unmanned aircraft systems to provide embedded reasoning for atmospheric science. In particular, a specific form of heterogeneous unmanned aircraft system (UAS) is introduced. This UAS is comprised of two classes of aircraft with significantly different, though complementary, attributes: miniature daughterships that provide improved flexibility and spatio-temporal diversity of sensed data and larger motherships that carry and deploy the daughterships while facilitating coordination through increased mobility, computation, and communication. Current efforts designing unmanned aircraft for in situ sensing are described as well as future architectures for embedded reasoning by autonomous systems within complex atmospheric phenomena.

Human trafficking is a multi-dimensional problem for which we have incomplete data, limited knowledge of the exploiters, and no understanding of the dynamics of the process. It is a problem that requires a larger, more complete database, understanding of key actors and their interactions in a dynamic environment. These methods exist in the areas of Data Mining, Machine Learning, Network Analysis, and Multi-agent systems. Using these methods, it is possible to create a model which is unique to detecting and preventing human trafficking. These methods can give applicable and successful solutions for different components of the problem of human trafficking. The goal is to build an intelligent system to enable collaboration and analysis, to identify and profile victims, traffickers, buyers, and exploiters, to predict human trafficking patterns, and to disrupt and destabilize human trafficking networks. In this paper, I will outline how some of these methods may be able to help analyze and model the dynamic phenomenon of human trafficking. The purpose is to see whether, using intelligent systems and appropriate collaboration and analysis tools, optimized intervention strategies can be created to profile victims and traffickers as well as impact, dissolve, and disrupt the human trafficking network in such a way that the network is unable to recover.