Country
Malicious Code Execution Detection and Response Immune System inspired by the Danger Theory
Kim, Jungwon, Greensmith, Julie, Twycross, Jamie, Aickelin, Uwe
The analysis of system calls is one method employed by anomaly detection systems to recognise malicious code execution. Similarities can be drawn between this process and the behaviour of certain cells belonging to the human immune system, and can be applied to construct an artificial immune system. A recently developed hypothesis in immunology, the Danger Theory, states that our immune system responds to the presence of intruders through sensing molecules belonging to those invaders, plus signals generated by the host indicating danger and damage. We propose the incorporation of this concept into a responsive intrusion detection system, where behavioural information of the system and running processes is combined with information regarding individual system calls.
Mimicking the Behaviour of Idiotypic AIS Robot Controllers Using Probabilistic Systems
Whitbrook, Amanda, Aickelin, Uwe, Garibaldi, Jonathan
Previous work has shown that robot navigation systems that employ an architecture based upon the idiotypic network theory of the immune system have an advantage over control techniques that rely on reinforcement learning only. This is thought to be a result of intelligent behaviour selection on the part of the idiotypic robot. In this paper an attempt is made to imitate idiotypic dynamics by creating controllers that use reinforcement with a number of different probabilistic schemes to select robot behaviour. The aims are to show that the idiotypic system is not merely performing some kind of periodic random behaviour selection, and to try to gain further insight into the processes that govern the idiotypic mechanism. Trials are carried out using simulated Pioneer robots that undertake navigation exercises. Results show that a scheme that boosts the probability of selecting highly-ranked alternative behaviours to 50% during stall conditions comes closest to achieving the properties of the idiotypic system, but remains unable to match it in terms of all round performance.
Development of a Cargo Screening Process Simulator: A First Approach
Siebers, Peer-Olaf, Sherman, Galina, Aickelin, Uwe
The efficiency of current cargo screening processes at sea and air ports is largely unknown as few benchmarks exists against which they could be measured. Some manufacturers provide benchmarks for individual sensors but we found no benchmarks that take a holistic view of the overall screening procedures and no benchmarks that take operator variability into account. Just adding up resources and manpower used is not an effective way for assessing systems where human decision-making and operator compliance to rules play a vital role. Our aim is to develop a decision support tool (cargo-screening system simulator) that will map the right technology and manpower to the right commodity-threat combination in order to maximise detection rates. In this paper we present our ideas for developing such a system and highlight the research challenges we have identified. Then we introduce our first case study and report on the progress we have made so far.
Assisted Highway Lane Changing with RASCL
Frankel, Richard Oliver (Stanford University) | Gudmundsson, Olafur (Stanford University) | Miller, Brett (Stanford University) | Potter, Jordan (Stanford University) | Sullivan, Todd (Stanford University) | Syed, Salik (Stanford University) | Hoang, Doreen (Stanford University) | John, Jae min (Stanford University) | Liao, Ki-Shui (Stanford University) | Nahass, Pasha (Stanford University) | Schwab, Amanda (Stanford University) | Yuan, Jessica (Stanford University) | Stavens, David (Stanford University) | Plagemann, Christian (Stanford University) | Nass, Clifford (Stanford University) | Thrun, Sebastian (Stanford University)
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.
Towards Faceted Browsing over Linked Data
Shangguan, Zhenning (Rensselaer Polytechnic Institute) | McGuinness, Deborah L. (Rensselaer Polytechnic Institute)
As the pace of Linked data generation and usage increases, so does the interest in intelligent, usable, and scalable browsing tools. Faceted browsing has potential to provide a foundation for effective dataset navigation. In this paper, we will discuss some of the anticipated benefits along with some associated challenges in building the next-generation faceted browsing system for the Web of Linked Data. We also present our initial system design and implementation.
Actor-Critic Policy Learning in Cooperative Planning
Redding, Joshua (Massachusetts Institute of Technology) | Geramifard, Alborz (Massachusetts Institute of Technology) | How, Jonathan (Massachusetts Institute of Technology)
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.
Development Projects for the CausalityWorkbench
Guyon, Isabelle (Clopinet) | Pellet, Jean-Philippe (IBM Zurich Research Lab) | Statnikov, Alexander (New-York University)
The CausalityWorkbench project provides an environment to test causal discovery algorithms. Via a web portal, we provide a number of resources, including a repository of datasets, models, and software packages, and a virtual laboratory allowing users to benchmark causal discovery algorithms by performing virtual experiments to study artificial causal systems. We regularly organize competitions. In this paper, we explore the opportunities offered by development applications.
An Ontology of Socio-Cultural Time Expressions
Wennerberg, Pinar (Ludwig Maximillian University of Munich) | Schulz, Klaus (Ludwig Maximillian University of Munich)
Time is a concept that highly depends on the socio-cultural context. Its perception by humans is primarily based on the cultures, nations and social environment they belong to. Hence, different socio-cultural contexts imply different understandings of time. This leads to communication problems when their members start interacting with each other. In a dynamic and multi-cultural environment like today’s Web, where both billions of people with different socio-cultural contexts and numerous context dependent software applications interact, similar communication and inter-operability problems are expected. Expressing socio-cultural temporal information in an unambiguous, explicit and machine processable way can, however, help reduce such communication conflicts. In this way, heterogeneous temporal Web application systems can share the same concept of time. In this paper we present an ontology of socio-cultural time expressions that attempts to formalize the notion of socio-cultural time. The resulting model can then be used in a Web based temporal applications such as automated appointment scheduling services or calendars to provide more context sensitive service to its users.
Learning Maps of Indoor Environments Based on Human Activity
Grzonka, Slawomir (University of Freiburg) | Dijoux, Frederic (University of Freiburg) | Karwath, Andreas (University of Freiburg) | Burgard, Wolfram (University of Freiburg)
We present a novel approach to build approximate maps of structured environments utilizing human motion and activity. Our approach uses data recorded with a data suit which is equipped with several IMUs to detect movements of a person and door opening and closing events. In our approach we interpret the movements as motion constraints and door handling events as landmark detections in a graph-based SLAM framework. As we cannot distinguish between individual doors, we employ a multi-hypothesis approach on top of the SLAM system to deal with the high data-association uncertainty. As a result, our approach is able to accurately and robustly recover the trajectory of the person. We additionally take advantage of the fact that people traverse free space and that doors separate rooms to recover the geometric structure of the environment after the graph optimization. We evaluate our approach in several experiments carried out with different users and in environments of different types.
Quantifying Behavioral Data Sets of Criminal Activity
Toole, Jameson L. (University of Michigan) | Eagle, Nathan (The Santa Fe Institute) | Plotkin, Joshua B. (University of Pennsylvania)
With the increased availability of rich behavioral data sets, we present a novel combination of tools to analyze to analyze this information. Using criminal offense records as an example, we employ cross-correlation measures, eigenvalue spectrum analysis, and results from random matrix theory to identify spatiotemporal patterns. Finally, with multivariate autoregressive models, we demonstrate a possible source of structure within the data.