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.

Feature extraction is one of the fundamental challenges in improving the accuracy of document classification. While there has been a large body of research literature on document classification, most existing approaches either do not have a high classification accuracy or require massive training sets. In this paper, we propose a simple feature extraction algorithm that can achieve high document classification accuracy in the context of development-centric topics. Our feature extraction algorithm exploits two distinct aspects in development-centric topics: most of these topics tend to be very focused (unlike semantically hard classification topics such as chemistry or banks) due to local language and cultural underpinnings in these topics, the authentic pages tend to use several region specific features. Our algorithm uses a combination of popularity and rarity as two separate metrics to extract features that describe a topic. Given a topic, our output feature set comprises of: (i) a list of popular keywords closely related to the topic; (ii) a list of rare keywords closely related to the topic. We show that a simple joint classifier based on these two feature sets can achieve high classification accuracy while each feature sub-set in itself is insufficient. We have tested our algorithm across a wide range of development-centric topics.

This paper gives a short overview of time representations in current symbol grounding architectures. Furthermore we report on a recently developed embodied language acquisition system that acquires object words from a linguistically unconstrained human-robot dialogue. Conceptual issues in future development of the system towards the acquisition of action words will be discussed briefly.

Medical experts routinely need to identify the shapes of anatomical structures, and surgeons report that they depend substantially on touch to help them with this process. In this paper, we discuss possible reasons why touch may be especially important for anatomical shape recognition in surgery, and why in this domain haptic cues may be at least as informative about shape as visual cues. We go on to discuss modern surgical methods, in which these haptic cues are substantially diminished. We conclude that a potential future challenge is to find ways to reinstate these important cues and to help surgeons recognize shapes in the restricted sensory conditions of minimally invasive surgery.

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.

The correct recognition of behaviours based on sensor observations in a smart home is a challenging problem; the sensor observations themselves can be noisy, and the pattern activity seen for a behaviour is rarely identical for different occurrences of the behaviour. For this reason, probabilistic methods such as Hidden Markov Models are preferred over symbolic reasoning approaches. However, these models do not deal well with interleaved behaviours, nor do they allow small variations in behaviour to be detected as abnormal, although this might be useful for the smart home, since changes in ingrained habit could be early signs of illness. We propose methods for using Allen's temporal relations in order to solve these problems, and demonstrate how they can be used to recognise the interleaving of different behaviours, as well as to reason about behaviours that are frequently seen together, and therefore form a behavioural pattern or habit. In this way we have been able to extend our behaviour recognition system to recognise unusual presentations of behaviours.

This paper presents a brief summary of a number of different approaches to the semantic representation and automated interpretation of engineering data. In this context, engineering data is represented as Computer-Aided Design (CAD) files, 3D models or assemblies. Representing and reasoning about these objects is a highly interdisciplinary problem, requiring techniques that can handle the complex interactions and data types that occur in the engineering domain. This paper presents several examples, taken from different problem areas that have occupied engineering and computer science researchers over the past 15 years. Many of the issues raised by these problems remain open, and the experience of past efforts can serve to identify fertile opportunities for investigation today.

Modern web sites provide easy access to large amounts of data via open application programming interfaces. Users interacting with these sites constantly change the underlying data sets, which can be represented in graph-structured form. Nodes in these dynamic graph structures exhibit dependencies over time. Analysing these dependencies is crucial for understanding and predicting the dynamics inherent to temporally changing graph structures on the web. When the graphs become large however, it is not feasible to take into account all properties of the graph and in general it is unclear how to choose the appropriate features. Moreover, comparing two nodes becomes difficult, if the nodes do not share exactly the same features. In this work we propose an algorithm that automatically learns the features that govern temporal dependencies between nodes in large dynamic graph structures. We present preliminary results of applying the algorithm to data collected from the web, discuss potential extensions of the framework and anticipate how a major problem in data mining, sparse data, could be tackled by leveraging Linked Data.

Several solutions exist for semantically describing Web Services (WSs) from the perspective of orchestration but little is known about how semantics benefit WS choreography. The most extreme example of a choreography problem occurs in peer-to-peer systems where shared semantics of data may need to be established via services interactions. We present a solution to this problem by sharing micro-data via interaction models. No pre-unified ontology is required in our approach so peers can make use of existing heterogeneous resources having been described in the RDF data model flexibly and compatibly. The experimental results indicate that our approach semantically enhances WS choreography in a lightweight way which complies with principles of Linked Data and republished Interaction Models (IMs) can further facilitate the progress of the Web of data as well as the formation of peer communities generated through peers' interactions.

This paper describes an online resource designed to aid in the creation of educational robotics programs where teams of mentors work with middle and high school students. This resource, The RoboCupJunior Primer, is based on five years of undergraduate mentoring experience in a local public school. The primary goals of the primer are threefold: first, to expose interested parties to the resources necessary for the creation of a RoboCup team; second, to provide a location for students to communicate with members of other teams and demonstrate specific examples of success; and third, to house an archive of lesson plans as well as tips for creating interesting and efficient lessons.