اشترك بالحزمة الذهبية واحصل على وصول غير محدود شمرا أكاديميا
تسجيل مستخدم جديدAGNOSCO - Identification of Infected Nodes with artificial Ant Colonies
90
0
0.0
(
0
)
اسأل ChatGPT حول البحث
ﻻ يوجد ملخص باللغة العربية
If a computer node is infected by a virus, worm or a backdoor, then this is a security risk for the complete network structure where the node is associated. Existing Network Intrusion Detection Systems (NIDS) provide a certain amount of support for the identification of such infected nodes but suffer from the need of plenty of communication and computational power. In this article, we present a novel approach called AGNOSCO to support the identification of infected nodes through the usage of artificial ant colonies. It is shown that AGNOSCO overcomes the communication and computational power problem while identifying infected nodes properly.
قيم البحث
اقرأ أيضاً
The human immune system has numerous properties that make it ripe for exploitation in the computational domain, such as robustness and fault tolerance, and many different algorithms, collectively termed Artificial Immune Systems (AIS), have been insp
ired by it. Two generations of AIS are currently in use, with the first generation relying on simplified immune models and the second generation utilising interdisciplinary collaboration to develop a deeper understanding of the immune system and hence produce more complex models. Both generations of algorithms have been successfully applied to a variety of problems, including anomaly detection, pattern recognition, optimisation and robotics. In this chapter an overview of AIS is presented, its evolution is discussed, and it is shown that the diversification of the field is linked to the diversity of the immune system itself, leading to a number of algorithms as opposed to one archetypal system. Two case studies are also presented to help provide insight into the mechanisms of AIS; these are the idiotypic network approach and the Dendritic Cell Algorithm.
The traditional production paradigm of large batch production does not offer flexibility towards satisfying the requirements of individual customers. A new generation of smart factories is expected to support new multi-variety and small-batch customi
zed production modes. For that, Artificial Intelligence (AI) is enabling higher value-added manufacturing by accelerating the integration of manufacturing and information communication technologies, including computing, communication, and control. The characteristics of a customized smart factory are to include self-perception, operations optimization, dynamic reconfiguration, and intelligent decision-making. The AI technologies will allow manufacturing systems to perceive the environment, adapt to the external needs, and extract the process knowledge, including business models, such as intelligent production, networked collaboration, and extended service models. This paper focuses on the implementation of AI in customized manufacturing (CM). The architecture of an AI-driven customized smart factory is presented. Details of intelligent manufacturing devices, intelligent information interaction, and construction of a flexible manufacturing line are showcased. The state-of-the-art AI technologies of potential use in CM, i.e., machine learning, multi-agent systems, Internet of Things, big data, and cloud-edge computing are surveyed. The AI-enabled technologies in a customized smart factory are validated with a case study of customized packaging. The experimental results have demonstrated that the AI-assisted CM offers the possibility of higher production flexibility and efficiency. Challenges and solutions related to AI in CM are also discussed.
Ant species such as Temnothorax albipennis select a new nest site in a distributed fashion that, if modeled correctly, can serve as useful information for site selection algorithms for robotic swarms and other applications. Studying and replicating t
he ants house hunting behavior will also illuminate useful distributed strategies that have evolved in nature. Many of the existing models of househunting behaviour for T. albipennis make the assumption that all candidate nest sites are equally distant from the ants home nest, or that an ant has an equal probability of finding each candidate nest site. However, realistically this is not the case, as nests that are further away from the home nest and nests that are difficult to access are less likely to be found, even if they are of higher quality. We extend previous house-hunting models to account for a pairwise distance metric between nests, compare our results to those of real colonies, and use our results to examine the effects of house hunting in nests of different spatial orientations. Our incorporation of distances in the ant model appear to match empirical data in situations where a distance-quality tradeoff between nests is relevant. Furthermore, the model continues to be on par with previous house-hunting models in experiments where all candidate nests are equidistant from the home nest, as is typically assumed.
When testing for infections, the standard method is to test each subject individually. If testing methodology is such that samples from multiple subjects can be efficiently combined and tested at once, yielding a positive results if any one subject i
n the subgroup is positive, then one can often identify the infected sub-population with a considerably lower number of tests compared to the number of test subjects. We present two such methods that allow an increase in testing efficiency (in terms of total number of test performed) by a factor of $approx$ 10 if population infection rate is $10^{-2}$ and a factor of $approx$50 when it is $10^{-3}$. Such methods could be useful when testing large fractions of the total population, as will be perhaps required during the current coronavirus pandemic.
The paper presents an exponential pheromone deposition approach to improve the performance of classical Ant System algorithm which employs uniform deposition rule. A simplified analysis using differential equations is carried out to study the stabili
ty of basic ant system dynamics with both exponential and constant deposition rules. A roadmap of connected cities, where the shortest path between two specified cities are to be found out, is taken as a platform to compare Max-Min Ant System model (an improved and popular model of Ant System algorithm) with exponential and constant deposition rules. Extensive simulations are performed to find the best parameter settings for non-uniform deposition approach and experiments with these parameter settings revealed that the above approach outstripped the traditional one by a large extent in terms of both solution quality and convergence time.
الأسئلة المقترحة
سجل دخول لتتمكن من نشر تعليقات
التعليقات
جاري جلب التعليقات
سجل دخول لتتمكن من متابعة معايير البحث التي قمت باختيارها
