Most social networks have implemented extensive and complex controls in order to battle the host of privacy concerns that initially plagued their online communities. These controls have taken the form of a-priori access control, which allow users to construct barriers preventing unwanted users from viewing their personal information. However, in cases in which the access restriction mechanisms are bypassed or when the access restrictions are met but the data is later misused, this system leaves users unprotected. Our framework, Respect My Privacy, proposes an alternative approach to the protection of privacy. Our strategy is similar to how legal and social rules work in our societies where the vast majority of these rules are not enforced perfectly or automatically, yet most of us follow the majority of the rules because social systems built up over thousands of years encourage us to do so and often make compliance easier than violation. Our project aims to support similar functionality in social networks. Instead of focusing on enforcing privacy policies through restricted access, we focus on helping users conform to existing policies by making them aware of the usage restrictions associated with the data. The framework has two main functions - generating privacy or usage control policies for social networks, and visualizing these policies while exploring social networks. We have implemented this functionality across three platforms: Facebook, OpenSocial and Tabulator, a Semantic Web browser. These applications enable users to specify privacy preferences for their data and then display this privacy-annotated data prominently enabling other users to easily recognize and conform to these preferences.

While there is a plethora of mechanisms to ensure lawful access to privacy-protected data, additional research is required in order to reassure individuals that their personal data is being used for the purpose that they consented to. This is particularly important in the context of new data mining approaches, as used, for instance, in biomedical research and commercial data mining. We argue for the use of computational workflows to ensure and enforce appropriate use of sensitive personal data. Computational workflows describe in a declarative manner the data processing steps and the expected results of complex data analysis processes such as data mining (Gil et al. 2007b; Taylor et al. 2006). We see workflows as an artifact that captures, among other things, how data is being used and for what purpose. Existing frameworks for computational workflows need to be extended to incorporate privacy policies that can govern the use of data.

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.

We present an exact dynamic programming solution for a finite-horizon decentralized two-player Markov decision process, where player 1 only has access to its own states, while player 2 has access to both player’s states but cannot affect player 1’s states. The solution is obtained by solving several centralized partially-observable Markov decision processes. We then conclude with several computational examples.

In this paper, we introduce a method for learning and adapting cooperative control strategies in real-time stochastic domains. Our framework is an instance of the intelligent cooperative control architecture (iCCA). The agent starts by following the "safe" plan calculated by the planning module and incrementally adapting the policy to maximize rewards. Actor-critic and consensus-based bundle algorithm (CBBA) were employed as the building blocks of the iCCA framework. We demonstrate the performance of our approach by simulating limited fuel unmanned aerial vehicles aiming for stochastic targets. The integrated framework boosted the optimality of the solution by 10 percent compared to running each of the modules individually.

This paper presents an approach to integrating planning and execution in time-sensitive environments. We present a simple setting in which to consider the issue, that we call continual on-line planning. New goals arrive stochastically during execution, the agent issues actions for execution one at a time, and the environment is otherwise deterministic. We take the objective to be a form of time-dependent partial satisfaction planning reminiscent of discounted MDPs: goals offer reward that decays over time, actions incur fixed costs, and the agent attempts to maximize net utility. We argue that this setting highlights the central challenge of time-aware planning while excluding the complexity of non-deterministic actions. Our approach to this problem is based on real-time heuristic search. We view the two central issues as the decision of which partial plans to elaborate during search and the decision of when to issue an action for execution. We propose an extension of Russell and Wefald's decision-theoretic A* algorithm that can cope with our inadmissible heuristic. Our algorithm, DTOCS, handles the complexities of the on-line setting by balancing deliberative planning and real-time response.

This paper extends model-based diagnosis (MBD) (de Kleer and Williams 1987; Reiter 1987) to systems with hidden interaction faults. An interaction fault is present if an interaction among a set of components leads to an observable failure, even though each individual component individually meets the specifications. A naive approach to address interaction faults is to simply account for all possible interaction faults in the system model. However, the naive approach presumes that all possible faults, both component and interaction faults, are known and addressed in the model. This assumption is violated by most real world systems, such as shorts in circuits (Davis 1984) or unmodeled connections (de Kleer 2007). That leads to incomplete system models, hence possibly hidden interaction faults. The problem of hidden interactions has been known for a long time (Davis 1984), but until now no general solution has been proposed. Instead of pushing for complete models (Preist and Welham 1990) or relying on additional structural information (Davis 1984; Bottcher 1995; de Kleer 2007) we approach the challenge differently. We allow system models to be incomplete and introduce a general, domain independent extension to model-based diagnosis to account for resulting hidden interaction faults. This extends model-based diagnosis to systems with incomplete models, in particular to models with incomplete structural information. In the paper, we demonstrate the proposed diagnosis framework on a logic circuit with a hidden interaction fault.

Sensor-to-symbol conversion lies at the heart of all embedded intelligent systems. The everyday world occupied by human stakeholders is dominated by objects that have symbolic labels. For an embedded intelligent system to operate in such a world it must also be able to segment its sensory stream into objects and label those objects appropriately. It is our position that development of a consistent and flexible sensor-to-symbol reasoning system (or architecture) is a key component of embedded intelligence.

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.

Lane changing on highways is stressful. In this paper, we present RASCL, the Robotic Assistance System for Changing Lanes. RASCL combines state-of-the-art sensing and localization techniques with an accurate map describing road structure to detect and track other cars, determine whether or not a lane change to either side is safe, and communicate these safety statuses to the user using a variety of audio and visual interfaces. The user can interact with the system through specifying the size of their “comfort zone”, engaging the turn signal, or by simply driving across lane dividers. Additionally, RASCL provides speed change recommendations that are predicted to turn an unsafe lane change situation into a safe situation and enables communication with other vehicles by automatically controlling the turn signal when the driver attempts to change lanes without using the turn signal.