2,519 research outputs found
Artificial intelligence in the cyber domain: Offense and defense
Artificial intelligence techniques have grown rapidly in recent years, and their applications in practice can be seen in many fields, ranging from facial recognition to image analysis. In the cybersecurity domain, AI-based techniques can provide better cyber defense tools and help adversaries improve methods of attack. However, malicious actors are aware of the new prospects too and will probably attempt to use them for nefarious purposes. This survey paper aims at providing an overview of how artificial intelligence can be used in the context of cybersecurity in both offense and defense.Web of Science123art. no. 41
Optimizing community detection in social networks using antlion and K-median
Antlion Optimization (ALO) is one of the latest population based optimization methods that proved its good performance in a variety of applications. The ALO algorithm copies the hunting mechanism of antlions to ants in nature. Community detection in social networks is conclusive to understanding the concepts of the networks. Identifying network communities can be viewed as a problem of clustering a set of nodes into communities. k-median clustering is one of the popular techniques that has been applied in clustering. The problem of clustering network can be formalized as an optimization problem where a qualitatively objective function that captures the intuition of a cluster as a set of nodes with better in ternal connectivity than external connectivity is selected to be optimized. In this paper, a mixture antlion optimization and k-median for solving the community detection problem is proposed and named as K-median Modularity ALO. Experimental results which are applied on real life networks show the ability of the mixture antlion optimization and k-median to detect successfully an optimized community structure based on putting the modularity as an objective function
A Model for Collective Dynamics in Ant Raids
Ant raiding, the process of identifying and returning food to the nest or
bivouac, is a fascinating example of collective motion in nature. During such
raids ants lay pheromones to form trails for others to find a food source. In
this work a coupled PDE/ODE model is introduced to study ant dynamics and
pheromone concentration. The key idea is the introduction of two forms of ant
dynamics: foraging and returning, each governed by different environmental and
social cues. The model accounts for all aspects of the raiding cycle including
local collisional interactions, the laying of pheromone along a trail, and the
transition from one class of ants to another. Through analysis of an order
parameter measuring the orientational order in the system, the model shows
self-organization into a collective state consisting of lanes of ants moving in
opposite directions as well as the transition back to the individual state once
the food source is depleted matching prior experimental results. This indicates
that in the absence of direct communication ants naturally form an efficient
method for transporting food to the nest/bivouac. The model exhibits a
continuous kinetic phase transition in the order parameter as a function of
certain system parameters. The associated critical exponents are found,
shedding light on the behavior of the system near the transition.Comment: Preprint Version, 30 pgs., 18 figures, complete version with
supplementary movies to appear in Journal of Mathematical Biology (Springer
Energy Efficient Hybrid Routing Protocol Based on the Artificial Fish Swarm Algorithm and Ant Colony Optimisation for WSNs
Wireless Sensor Networks (WSNs) are a particular type of distributed self-managed network with limited energy supply and communication ability. The most significant challenge of a routing protocol is the energy consumption and the extension of the network lifetime. Many energy-efficient routing algorithms were inspired by the development of Ant Colony Optimisation (ACO). However, due to the inborn defects, ACO-based routing algorithms have a slow convergence behaviour and are prone to premature, stagnation phenomenon, which hinders further route discovery, especially in a large-scale network. This paper proposes a hybrid routing algorithm by combining the Artificial Fish Swarm Algorithm (AFSA) and ACO to address these issues. We utilise AFSA to perform the initial route discovery in order to find feasible routes quickly. In the route discovery algorithm, we present a hybrid algorithm by combining the crowd factor in AFSA and the pseudo-random route select strategy in ACO. Furthermore, this paper presents an improved pheromone update method by considering energy levels and path length. Simulation results demonstrate that the proposed algorithm avoids the routing algorithm falling into local optimisation and stagnation, whilst speeding up the routing convergence, which is more prominent in a large-scale network. Furthermore, simulation evaluation reports that the proposed algorithm exhibits a significant improvement in terms of network lifetime
Optimizing parameter search for community detection in time evolving networks of complex systems
Network representations have been effectively employed to analyze complex
systems across various areas and applications, leading to the development of
network science as a core tool to study systems with multiple components and
complex interactions. There is a growing interest in understanding the temporal
dynamics of complex networks to decode the underlying dynamic processes through
the temporal changes in network structure. Community detection algorithms,
which are specialized clustering algorithms, have been instrumental in studying
these temporal changes. They work by grouping nodes into communities based on
the structure and intensity of network connections over time aiming to maximize
modularity of the network partition. However, the performance of these
algorithms is highly influenced by the selection of resolution parameters of
the modularity function used, which dictate the scale of the represented
network, both in size of communities and the temporal resolution of dynamic
structure. The selection of these parameters has often been subjective and
heavily reliant on the characteristics of the data used to create the network
structure. Here, we introduce a method to objectively determine the values of
the resolution parameters based on the elements of self-organization. We
propose two key approaches: (1) minimization of the biases in spatial scale
network characterization and (2) maximization of temporal scale-freeness. We
demonstrate the effectiveness of these approaches using benchmark network
structures as well as real-world datasets. To implement our method, we also
provide an automated parameter selection software package that can be applied
to a wide range of complex systems.Comment: 28 pages, 7 figure
- …