159,992 research outputs found
Deep Learning for Link Prediction in Dynamic Networks using Weak Estimators
Link prediction is the task of evaluating the probability that an edge exists in a network, and it has useful applications in many domains. Traditional approaches rely on measuring the similarity between two nodes in a static context. Recent research has focused on extending link prediction to a dynamic setting, predicting the creation and destruction of links in networks that evolve over time. Though a difficult task, the employment of deep learning techniques have shown to make notable improvements to the accuracy of predictions. To this end, we propose the novel application of weak estimators in addition to the utilization of traditional similarity metrics to inexpensively build an effective feature vector for a deep neural network. Weak estimators have been used in a variety of machine learning algorithms to improve model accuracy, owing to their capacity to estimate changing probabilities in dynamic systems. Experiments indicate that our approach results in increased prediction accuracy on several real-world dynamic networks
Optimization of intersatellite routing for real-time data download
The objective of this study is to develop a strategy to maximise the available bandwidth to Earth of a satellite constellation through inter-satellite links. Optimal signal routing is achieved by mimicking the way in which ant colonies locate food sources, where the 'ants' are explorative data packets aiming to find a near-optimal route to Earth. Demonstrating the method on a case-study of a space weather monitoring constellation; we show the real-time downloadable rate to Earth
Potential field based navigation for planetary rovers using internal states
The work in this paper aims to introduce analysis and applications for the internal state model which is a new model for a swarm of rovers interacting via pair-wise attractive and repulsive potentials. The internal state model updates the state of the art in overcoming the local minima problem through solving the problem with comparatively lower computation cost than other methods. The simulations results show that using the internal state model, a swarm of planetary rovers, rather than moving in a static potential field, are able to manipulate the potential according to their estimation of whether they are moving towards or away from the goal, which allows them to escape from and maneuver around a local minimum in the potential field to reach a goal. An application of a swarm of rovers to solve the problem for different shaped obstacles is introduced to show the efficiency of the model. The model proves stable convergence to a goal and provides similarities with the behaviour of real groups of animals
A Multi-view Context-aware Approach to Android Malware Detection and Malicious Code Localization
Existing Android malware detection approaches use a variety of features such
as security sensitive APIs, system calls, control-flow structures and
information flows in conjunction with Machine Learning classifiers to achieve
accurate detection. Each of these feature sets provides a unique semantic
perspective (or view) of apps' behaviours with inherent strengths and
limitations. Meaning, some views are more amenable to detect certain attacks
but may not be suitable to characterise several other attacks. Most of the
existing malware detection approaches use only one (or a selected few) of the
aforementioned feature sets which prevent them from detecting a vast majority
of attacks. Addressing this limitation, we propose MKLDroid, a unified
framework that systematically integrates multiple views of apps for performing
comprehensive malware detection and malicious code localisation. The rationale
is that, while a malware app can disguise itself in some views, disguising in
every view while maintaining malicious intent will be much harder.
MKLDroid uses a graph kernel to capture structural and contextual information
from apps' dependency graphs and identify malice code patterns in each view.
Subsequently, it employs Multiple Kernel Learning (MKL) to find a weighted
combination of the views which yields the best detection accuracy. Besides
multi-view learning, MKLDroid's unique and salient trait is its ability to
locate fine-grained malice code portions in dependency graphs (e.g.,
methods/classes). Through our large-scale experiments on several datasets
(incl. wild apps), we demonstrate that MKLDroid outperforms three
state-of-the-art techniques consistently, in terms of accuracy while
maintaining comparable efficiency. In our malicious code localisation
experiments on a dataset of repackaged malware, MKLDroid was able to identify
all the malice classes with 94% average recall
Swarm-based Intelligent Routing (SIR) - a new approach for efficient routing in content centric delay tolerant networks
This paper introduces Swarm-based Intelligent Routing (SIR), a swarm intelligence based approach used for routing content in content centric Pocket Switched Networks. We first formalize the notion of optimal path in DTN, then introduce a swarm intelligence based routing protocol adapted to content centric DTN that use a publish/subscribe communication paradigm. The protocol works in a fully decentralized way in which nodes do not have any knowledge about the global topology. Nodes, via opportunistic contacts, update utility functions which synthesizes their spatio-temporal proximity from the content subscribers. This individual behavior applied by each node leads to the collective formation of gradient fields between content subscribers and content providers. Therefore, content routing simply sums up to follow the steepest slope along these gradient fields to reach subscribers who are located at the minima of the field. Via real traces analysis and simulation, we demonstrate the existence and relevance of such gradient field and show routing performance improvements when compared to classical routing protocols previously defined for information routing in DTN
Swarm robot social potential fields with internal agent dynamics
Swarm robotics is a new and promising approach to the design and control of multiagent robotic systems. In this paper we use a model for a second order non-linear system of self-propelled agents interacting via pair-wise attractive and repulsive potentials. We propose a new potential field method using dynamic agent internal states to successfully solve a reactive path-planning problem. The path planning problem cannot be solved using static potential fields due to local minima formation, but can be solved by allowing the agent internal states to manipulate the potential field. Simulation results demonstrate the ability of a single agent to perform reactive problem solving effectively, as well as the ability of a swarm of agents to perform problem solving using the collective behaviour of the entire swarm
Swarm potential fields with internal agent states and collective behaviour
Swarm robotics is a new and promising approach to the design and control of multi-agent robotic systems. In this paper we use a model for a system of self-propelled agents interacting via pairwise attractive and repulsive potentials. We develop a new potential field method using dynamic agent internal states, allowing the swarm agents' internal states to manipulate the potential field. This new method successfully solves a reactive path planning problem that cannot be solved using static potential fields due to local minima formation. Simulation results demonstrate the ability of a swarm of agents that use the model to perform reactive problem solving effectively using the collective behaviour of the entire swarm in a way that matches studies based on real animal group behaviour
Intelligent computational sketching support for conceptual design
Sketches, with their flexibility and suggestiveness, are in many ways ideal for expressing emerging design concepts. This can be seen from the fact that the process of representing early designs by free-hand drawings was used as far back as in the early 15th century [1]. On the other hand, CAD systems have become widely accepted as an essential design tool in recent years, not least because they provide a base on which design analysis can be carried out. Efficient transfer of sketches into a CAD representation, therefore, is a powerful addition to the designers' armoury.It has been pointed out by many that a pen-on-paper system is the best tool for sketching. One of the crucial requirements of a computer aided sketching system is its ability to recognise and interpret the elements of sketches. 'Sketch recognition', as it has come to be known, has been widely studied by people working in such fields: as artificial intelligence to human-computer interaction and robotic vision. Despite the continuing efforts to solve the problem of appropriate conceptual design modelling, it is difficult to achieve completely accurate recognition of sketches because usually sketches implicate vague information, and the idiosyncratic expression and understanding differ from each designer
- âŠ