In this essay I argue that it is logically and practically possible to secure the right to privacy under conditions of increasing social transparency. The argument is predicated on a particular analysis of the right to privacy as the right to the personal space required for the exercise of practical rationality. It also rests on the distinction between the unidirectional transparency required by repressive governments and the increasing omnidirectional transparency that liberal information societies are experiencing today. I claim that a properly administered omnidirectional transparency will not only enhance privacy and autonomy, but can also be a key development in the creation of a society that is more tolerant of harmless diversity and temperate in its punishment of anti-social behaviors.

Given the prevalence of data leaks, organizations appreciate the importance of implementing privacy policies to protect sensitive data. The growing field of Data Loss Prevention (DLP) offers tools to enforce such policies for both data stored within an organization and data being shared outside of an organization (e.g. through email). While the DLP community has given much attention to the problem of enforcing data privacy policies in a comprehensive manner, little has been done to support the development of such policies. We present a small user study demonstrating that developing such policies is also a very challenging problem. In our study, users were asked to evaluate various expressive file names for sensitivity; that it, they were asked to consider how broadly they were willing to share those filenames both inside and outside their place of employment. The study indicates that users interpret their employer’s privacy concerns in differing ways, resulting in complex, personalized privacy policies at the user end. These results suggest that it may be difficult for users to form a coherent organization-level privacy policy and that the results of a DLP-based enforcement of such policies (e.g. quarantined emails) may be confusing for many users in the organization.

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.

There is a growing awareness and interest in the issues of accountability and transparency in the pursuit of digital privacy. In previous work, we asserted that systems needed to be “policy aware” and able to compute the likely compliance of any digital transaction with the associated privacy policies (law, rule, or contract). This paper focuses on one critical step in respecting privacy in a digital environment, that of understanding the context associated with each digital transaction. For any individual transaction, the pivotal fact may be context information about the data, the party seeking to use it, the specific action to be taken, or the associated rules. We believe that the granularity of semantic web representation is well suited to this challenge and we support this position in the paper.

The present privacy legislation continue to be drafted on the basis of the Strasburg Convention of 1981. The mere fact that present privacy laws are based on principles drafted 29 years ago, when the web did not exist, shows that privacy legislation need to make a quantum leap to be in line with the realities of to-day’s real life operating environment. If the status quo is kept, the law and its application shall face serious (and sometimes insurmountable) obstacles to its implementation, making compliance costly for private business, at the same time jeopardizing effectiveness of privacy protection for individuals. A new set of rules should be drafted and established, addressing the changed environment of information and communication technology, in order to allow free flow of information at the same time assuring due protection of personal data.

RefereeToolbox is a java package implementing combination operators for fusing evidences. It is downloadable from: http://refereefunction.fredericdambreville.com/releases RefereeToolbox is based on an interpretation of the fusion rules by means of Referee Functions. This approach implies a dissociation between the definition of the combination and its actual implementation, which is common to all referee-based combinations. As a result, RefereeToolbox is designed with the aim to be generic and evolutive.

As historically acknowledged in the Reasoning about Actions and Change community, intuitiveness of a logical domain description cannot be fully automated. Moreover, like any other logical theory, action theories may also evolve, and thus knowledge engineers need revision methods to help in accommodating new incoming information about the behavior of actions in an adequate manner. The present work is about changing action domain descriptions in multimodal logic. Its contribution is threefold: first we revisit the semantics of action theory contraction proposed in previous work, giving more robust operators that express minimal change based on a notion of distance between Kripke-models. Second we give algorithms for syntactical action theory contraction and establish their correctness with respect to our semantics for those action theories that satisfy a principle of modularity investigated in previous work. Since modularity can be ensured for every action theory and, as we show here, needs to be computed at most once during the evolution of a domain description, it does not represent a limitation at all to the method here studied. Finally we state AGM-like postulates for action theory contraction and assess the behavior of our operators with respect to them. Moreover, we also address the revision counterpart of action theory change, showing that it benefits from our semantics for contraction.

Inspired by a growing interest in analyzing network data, we study the problem of node classification on graphs, focusing on approaches based on kernel machines. Conventionally, kernel machines are linear classifiers in the implicit feature space. We argue that linear classification in the feature space of kernels commonly used for graphs is often not enough to produce good results. When this is the case, one naturally considers nonlinear classifiers in the feature space. We show that repeating this process produces something we call "deep kernel machines." We provide some examples where deep kernel machines can make a big difference in classification performance, and point out some connections to various recent literature on deep architectures in artificial intelligence and machine learning.

When individuals independently recollect events or retrieve facts from memory, how can we aggregate these retrieved memories to reconstruct the actual set of events or facts? In this research, we report the performance of individuals in a series of general knowledge tasks, where the goal is to reconstruct from memory the order of historic events, or the order of items along some physical dimension. We introduce two Bayesian models for aggregating order information based on a Thurstonian approach and Mallows model. Both models assume that each individuals reconstruction is based on either a random permutation of the unobserved ground truth, or by a pure guessing strategy. We apply MCMC to make inferences about the underlying truth and the strategies employed by individuals. The models demonstrate a wisdom of crowds" effect, where the aggregated orderings are closer to the true ordering than the orderings of the best individual."

Networks are ubiquitous in science and have become a focal point for discussion in everyday life. Formal statistical models for the analysis of network data have emerged as a major topic of interest in diverse areas of study, and most of these involve a form of graphical representation. Probability models on graphs date back to 1959. Along with empirical studies in social psychology and sociology from the 1960s, these early works generated an active network community and a substantial literature in the 1970s. This effort moved into the statistical literature in the late 1970s and 1980s, and the past decade has seen a burgeoning network literature in statistical physics and computer science. The growth of the World Wide Web and the emergence of online networking communities such as Facebook, MySpace, and LinkedIn, and a host of more specialized professional network communities has intensified interest in the study of networks and network data. Our goal in this review is to provide the reader with an entry point to this burgeoning literature. We begin with an overview of the historical development of statistical network modeling and then we introduce a number of examples that have been studied in the network literature. Our subsequent discussion focuses on a number of prominent static and dynamic network models and their interconnections. We emphasize formal model descriptions, and pay special attention to the interpretation of parameters and their estimation. We end with a description of some open problems and challenges for machine learning and statistics.