AI Solutions for MDS: Artificial Intelligence Techniques for Misuse Detection and Localisation in Telecommunication Environments

This report considers the application of Articial Intelligence (AI) techniques to the problem of misuse detection and misuse localisation within telecommunications environments. A broad survey of techniques is provided, that covers inter alia rule based systems, model-based systems, case based reasoning, pattern matching, clustering and feature extraction, articial neural networks, genetic algorithms, arti cial immune systems, agent based systems, data mining and a variety of hybrid approaches. The report then considers the central issue of event correlation, that is at the heart of many misuse detection and localisation systems. The notion of being able to infer misuse by the correlation of individual temporally distributed events within a multiple data stream environment is explored, and a range of techniques, covering model based approaches, `programmed' AI and machine learning paradigms. It is found that, in general, correlation is best achieved via rule based approaches, but that these suffer from a number of drawbacks, such as the difculty of developing and maintaining an appropriate knowledge base, and the lack of ability to generalise from known misuses to new unseen misuses. Two distinct approaches are evident. One attempts to encode knowledge of known misuses, typically within rules, and use this to screen events. This approach cannot generally detect misuses for which it has not been programmed, i.e. it is prone to issuing false negatives. The other attempts to `learn' the features of event patterns that constitute normal behaviour, and, by observing patterns that do not match expected behaviour, detect when a misuse has occurred. This approach is prone to issuing false positives, i.e. inferring misuse from innocent patterns of behaviour that the system was not trained to recognise. Contemporary approaches are seen to favour hybridisation, often combining detection or localisation mechanisms for both abnormal and normal behaviour, the former to capture known cases of misuse, the latter to capture unknown cases. In some systems, these mechanisms even work together to update each other to increase detection rates and lower false positive rates. It is concluded that hybridisation offers the most promising future direction, but that a rule or state based component is likely to remain, being the most natural approach to the correlation of complex events. The challenge, then, is to mitigate the weaknesses of canonical programmed systems such that learning, generalisation and adaptation are more readily facilitated

An Evolutionary Computation Based Feature Selection Method for Intrusion Detection

Data Availability: The data used to support the fndings of this study are available from the corresponding author upon request. This work was supported by the National Natural Science Foundation of China (61403206, 61771258, and 61876089), the Natural Science Foundation of Jiangsu Province (BK20141005 and BK20160910), the Natural Science Foundation of the Jiangsu Higher Education Institutions of China (14KJB520025), the Priority Academic Program Development of Jiangsu Higher Education Institutions, the Open Research Fund of Jiangsu Engineering Research Center of Communication and Network Technology, NJUPT (JSGCZX17001), and the Natural Science Foundation of Jiangsu Province of China under Grant BK20140883.Peer reviewedPublisher PD

A Comprehensive Survey on Particle Swarm Optimization Algorithm and Its Applications

Particle swarm optimization (PSO) is a heuristic global optimization method, proposed originally by Kennedy and Eberhart in 1995. It is now one of the most commonly used optimization techniques. This survey presented a comprehensive investigation of PSO. On one hand, we provided advances with PSO, including its modifications (including quantum-behaved PSO, bare-bones PSO, chaotic PSO, and fuzzy PSO), population topology (as fully connected, von Neumann, ring, star, random, etc.), hybridization (with genetic algorithm, simulated annealing, Tabu search, artificial immune system, ant colony algorithm, artificial bee colony, differential evolution, harmonic search, and biogeography-based optimization), extensions (to multiobjective, constrained, discrete, and binary optimization), theoretical analysis (parameter selection and tuning, and convergence analysis), and parallel implementation (in multicore, multiprocessor, GPU, and cloud computing forms). On the other hand, we offered a survey on applications of PSO to the following eight fields: electrical and electronic engineering, automation control systems, communication theory, operations research, mechanical engineering, fuel and energy, medicine, chemistry, and biology. It is hoped that this survey would be beneficial for the researchers studying PSO algorithms

Bio-inspired Computing and Smart Mobility

Por último, se aborda la predicción de plazas libres de aparcamiento utilizando técnicas de aprendizaje automático, tales como series temporales, agrupamiento, etc., incluyendo un prototipo de aplicación web. La tercera parte de esta tesis doctoral se enfoca en el diseño y evaluación de un nuevo algoritmo inspirado en la epigénesis, el Algoritmo Epigenético. Luego de la descripción del modelo en el que se basa y de sus partes, se utiliza este nuevo algoritmo para la resolución del problema de la mochila multidimensional y se comparan sus resultados con los de otros algoritmos del estado de arte. Por último se emplea también el Algoritmo Epigenético para la optimización de la arquitectura Yellow Swarm, un problema de movilidad inteligente resuelto por un nuevo algoritmo bioinspirado. A lo largo de esta tesis doctoral se han descrito los problemas de movilidad inteligente y propuesto nuevas herramientas para su optimización. A partir de los experimentos realizados se concluye que estas herramientas, basadas en algoritmos bioinspirados, son eficientes para abordar estos problemas, obteniendo resultados competitivos comparados con los del estado del arte, los cuales han sido validados estadísticamente. Esto representa un aporte científico pero también una serie de mejoras para la sociedad toda, tanto en su salud como en el aprovechamiento de su tiempo libre. Fecha de lectura de Tesis: 01 octubre 2018.Esta tesis doctoral propone soluciones a problemas de movilidad inteligente, concretamente la reducción de los tiempos de viajes en las vías urbanas, las emisiones de gases de efecto invernadero y el consumo de combustible, mediante el diseño y uso de nuevos algoritmos bioinspirados. Estos algoritmos se utilizan para la optimización de escenarios realistas, cuyo trazado urbano se obtiene desde OpenStreetMap, y que son luego evaluados en el microsimulador SUMO. Primero se describen las bases científicas y tecnológicas, incluyendo la definición y estado del arte de los problemas a abordar, las metaheurísticas que se utilizarán durante el desarrollo de los experimentos, así como las correspondientes validaciones estadísticas. A continuación se describen los simuladores de movilidad como principal herramienta para construir y evaluar los escenarios urbanos. Por último se presenta una propuesta para generar tráfico vehicular realista a partir de datos de sensores que cuentan el número de vehículos en la ciudad, utilizando herramientas incluidas en SUMO combinadas con algoritmos evolutivos. En la segunda parte se modelan y resuelven problemas de movilidad inteligente utilizando las nuevas arquitecturas Red Swarm y Green Swarm para sugerir nuevas rutas a los vehículos utilizando nodos con conectividad Wi-Fi. Red Swarm se centra en la reducción de tiempos de viajes evitando la congestión de las calles, mientras que Green Swarm está enfocado en la reducción de emisiones y consumo de combustible. Luego se propone la arquitectura Yellow Swarm que utiliza una serie de paneles LED para indicar desvíos que los vehículos pueden seguir en lugar de nodos Wi-Fi haciendo esta propuesta más accesible. Además se propone un método para genera rutas alternativas para los navegadores GPS de modo que se aprovechen mejor las calles secundarias de las ciudades, reduciendo los atascos

A Brief Review on Mathematical Tools Applicable to Quantum Computing for Modelling and Optimization Problems in Engineering

Since its emergence, quantum computing has enabled a wide spectrum of new possibilities and advantages, including its efficiency in accelerating computational processes exponentially. This has directed much research towards completely novel ways of solving a wide variety of engineering problems, especially through describing quantum versions of many mathematical tools such as Fourier and Laplace transforms, differential equations, systems of linear equations, and optimization techniques, among others. Exploration and development in this direction will revolutionize the world of engineering. In this manuscript, we review the state of the art of these emerging techniques from the perspective of quantum computer development and performance optimization, with a focus on the most common mathematical tools that support engineering applications. This review focuses on the application of these mathematical tools to quantum computer development and performance improvement/optimization. It also identifies the challenges and limitations related to the exploitation of quantum computing and outlines the main opportunities for future contributions. This review aims at offering a valuable reference for researchers in fields of engineering that are likely to turn to quantum computing for solutions. Doi: 10.28991/ESJ-2023-07-01-020 Full Text: PD

Applied (Meta)-Heuristic in Intelligent Systems

Engineering and business problems are becoming increasingly difficult to solve due to the new economics triggered by big data, artificial intelligence, and the internet of things. Exact algorithms and heuristics are insufficient for solving such large and unstructured problems; instead, metaheuristic algorithms have emerged as the prevailing methods. A generic metaheuristic framework guides the course of search trajectories beyond local optimality, thus overcoming the limitations of traditional computation methods. The application of modern metaheuristics ranges from unmanned aerial and ground surface vehicles, unmanned factories, resource-constrained production, and humanoids to green logistics, renewable energy, circular economy, agricultural technology, environmental protection, finance technology, and the entertainment industry. This Special Issue presents high-quality papers proposing modern metaheuristics in intelligent systems

Monte Carlo Method with Heuristic Adjustment for Irregularly Shaped Food Product Volume Measurement

Volume measurement plays an important role in the production and processing of food products. Various methods have been proposed to measure the volume of food products with irregular shapes based on 3D reconstruction. However, 3D reconstruction comes with a high-priced computational cost. Furthermore, some of the volume measurement methods based on 3D reconstruction have a low accuracy. Another method for measuring volume of objects uses Monte Carlo method. Monte Carlo method performs volume measurements using random points. Monte Carlo method only requires information regarding whether random points fall inside or outside an object and does not require a 3D reconstruction. This paper proposes volume measurement using a computer vision system for irregularly shaped food products without 3D reconstruction based on Monte Carlo method with heuristic adjustment. Five images of food product were captured using five cameras and processed to produce binary images. Monte Carlo integration with heuristic adjustment was performed to measure the volume based on the information extracted from binary images. The experimental results show that the proposed method provided high accuracy and precision compared to the water displacement method. In addition, the proposed method is more accurate and faster than the space carving method

Immunity-Based Framework for Autonomous Flight in GPS-Challenged Environment

In this research, the artificial immune system (AIS) paradigm is used for the development of a conceptual framework for autonomous flight when vehicle position and velocity are not available from direct sources such as the global navigation satellite systems or external landmarks and systems. The AIS is expected to provide corrections of velocity and position estimations that are only based on the outputs of onboard inertial measurement units (IMU). The AIS comprises sets of artificial memory cells that simulate the function of memory T- and B-cells in the biological immune system of vertebrates. The innate immune system uses information about invading antigens and needed antibodies. This information is encoded and sorted by T- and B-cells. The immune system has an adaptive component that can accelerate and intensify the immune response upon subsequent infection with the same antigen. The artificial memory cells attempt to mimic these characteristics for estimation error compensation and are constructed under normal conditions when all sensor systems function accurately, including those providing vehicle position and velocity information. The artificial memory cells consist of two main components: a collection of instantaneous measurements of relevant vehicle features representing the antigen and a set of instantaneous estimation errors or correction features, representing the antibodies. The antigen characterizes the dynamics of the system and is assumed to be correlated with the required corrections of position and velocity estimation or antibodies. When the navigation source is unavailable, the currently measured vehicle features from the onboard sensors are matched against the AIS antigens and the corresponding corrections are extracted and used to adjust the position and velocity estimation algorithm and provide the corrected estimation as actual measurement feedback to the vehicle’s control system. The proposed framework is implemented and tested through simulation in two versions: with corrections applied to the output or the input of the estimation scheme. For both approaches, the vehicle feature or antigen sets include increments of body axes components of acceleration and angular rate. The correction feature or antibody sets include vehicle position and velocity and vehicle acceleration adjustments, respectively. The impact on the performance of the proposed methodology produced by essential elements such as path generation method, matching algorithm, feature set, and the IMU grade was investigated. The findings demonstrated that in all cases, the proposed methodology could significantly reduce the accumulation of dead reckoning errors and can become a viable solution in situations where direct accurate measurements and other sources of information are not available. The functionality of the proposed methodology and its promising outcomes were successfully illustrated using the West Virginia University unmanned aerial system simulation environment

Optimizing artificial neural networks using LevyChaotic mapping on Wolf Pack optimization algorithm for detect driving sleepiness

Artificial Neural Networks (ANNs) are utilized to solve a variety of problems in many domains. In this type of network, training and selecting parameters that define networks architecture play an important role in enhancing the accuracy of the network's output; Therefore, Prior to training, those parameters must be optimized. Grey Wolf Optimizer (GWO) has been considered one of the efficient developed approaches in the Swarm Intelligence area that is used to solve real-world optimization problems. However, GWO still faces a problem of the slump in local optimums in some places due to insufficient diversity. This paper proposes a novel algorithm Levy Flight- Chaotic Chen mapping on Wolf Pack Algorithm in Neural Network. It efficiently exploits the search regions to detect driving sleepiness and balance the exploration and exploitation operators, which are considered implied features of any stochastic search algorithm. Due to the lack of dataset availability, a dataset of 15 participants has been collected from scratch to evaluate the proposed algorithm's performance. The results show that the proposed algorithm achieves an accuracy of 99.3%