Logic Journal of the IGPL最新文献_第4页

Multi-agent reinforcement learning based algorithm detection of malware-infected nodes in IoT networks 基于多代理强化学习的物联网网络恶意软件感染节点算法检测

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-18 DOI: 10.1093/jigpal/jzae068

Marcos Severt, Roberto Casado-Vara, Á. M. del Rey, Héctor Quintián, José Luis Calvo-Rolle

{"title":"Multi-agent reinforcement learning based algorithm detection of malware-infected nodes in IoT networks","authors":"Marcos Severt, Roberto Casado-Vara, Á. M. del Rey, Héctor Quintián, José Luis Calvo-Rolle","doi":"10.1093/jigpal/jzae068","DOIUrl":"https://doi.org/10.1093/jigpal/jzae068","url":null,"abstract":"\u0000 The Internet of Things (IoT) is a fast-growing technology that connects everyday devices to the Internet, enabling wireless, low-consumption and low-cost communication and data exchange. IoT has revolutionized the way devices interact with each other and the internet. The more devices become connected, the greater the risk of security breaches. There is currently a need for new approaches to algorithms that can detect malware regardless of the size of the network and that can adapt to dynamic changes in the network. Through the use of a multi-agent reinforcement learning algorithm, this paper proposes a novel algorithm for malware detection in IoT devices. The proposed algorithm is not strongly dependent on the size of the IoT network due to the that its training is adapted using time differences if the IoT network size is small or Monte Carlo otherwise. To validate the proposed algorithm in an environment as close to reality as possible, we proposed a scenario based on a real IoT network, where we tested different malware propagation models. Different simulations varying the number of agents and nodes in the IoT network have been developed. The result of these simulations proves the efficiency and adaptability of the proposed algorithm in detecting malware, regardless of the malware propagation model.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141125042","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Model checking distributed temporal logic 分布式时态逻辑的模型检查

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-16 DOI: 10.1093/jigpal/jzae043

Francisco Dionísio, Jaime Ramos, Fernando Subtil, Luca Viganò

引用次数: 0

Novel adaptive approach for anomaly detection in nonlinear and time-varying industrial systems 用于非线性和时变工业系统异常检测的新型自适应方法

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae070

Álvaro Michelena, Francisco Zayas-Gato, Esteban Jove, J. Casteleiro-Roca, Héctor Quintián, Oscar Fontenla-Romero, José Luis Calvo-Rolle

引用次数: 0

From simple to complex: a sequential method for enhancing time series forecasting with deep learning 从简单到复杂：利用深度学习增强时间序列预测的连续方法

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae030

M J Jiménez-Navarro, M Martínez-Ballesteros, F Martínez-Álvarez, A Troncoso, G Asencio-Cortés

引用次数: 0

Blockchain self-update smart contract for supply chain traceability with data validation 通过数据验证实现供应链溯源的区块链自我更新智能合约

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae047

Cristian Valencia-Payan, David Griol, Juan Carlos Corrales

引用次数: 0

Estimation of distribution algorithms with solution subset selection for the next release problem 针对下一次发布问题的带有解决方案子集选择的分布算法估算

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae052

Víctor Pérez-Piqueras, Pablo Bermejo López, José A Gámez

{"title":"Estimation of distribution algorithms with solution subset selection for the next release problem","authors":"Víctor Pérez-Piqueras, Pablo Bermejo López, José A Gámez","doi":"10.1093/jigpal/jzae052","DOIUrl":"https://doi.org/10.1093/jigpal/jzae052","url":null,"abstract":"\u0000 The Next Release Problem (NRP) is a combinatorial optimization problem that aims to find a subset of software requirements to be delivered in the next software release, which maximize the satisfaction of a list of clients and minimize the effort required by developers to implement them. Previous studies have applied various metaheuristics, mostly genetic algorithms. Estimation of Distribution Algorithms (EDA), based on probabilistic modelling, have been proved to obtain good results in problems where genetic algorithms struggle. In this paper we propose to adapt three EDAs to tackle the multi-objective NRP in a fast and effective way. Results show that EDAs can be applicable to solve the NRP with rather good quality of solutions. Furthermore, we prove that their execution time can be significantly reduced using a per-iteration solution subset selection method while maintaining the overall quality of the solutions obtained, and they perform the best when limiting the search time as in an interactive tool that requires fast responsiveness. The experimental framework, code and datasets have been made public in a code repository.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140981276","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A robot-based surveillance system for recognising distress hand signal 识别求救手势的机器人监控系统

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae067

Virginia Riego del Castillo, Lidia Sánchez-González, Miguel Á. González-Santamarta, Francisco J Rodríguez Lera

{"title":"A robot-based surveillance system for recognising distress hand signal","authors":"Virginia Riego del Castillo, Lidia Sánchez-González, Miguel Á. González-Santamarta, Francisco J Rodríguez Lera","doi":"10.1093/jigpal/jzae067","DOIUrl":"https://doi.org/10.1093/jigpal/jzae067","url":null,"abstract":"\u0000 Unfortunately, there are still cases of domestic violence or situations where it is necessary to call for help without arousing the suspicion of the aggressor. In these situations, the help signal devised by the Canadian Women’s Foundation has proven to be effective in reporting a risky situation. By displaying a sequence of hand signals, it is possible to report that help is needed. This work presents a vision-based system that detects this sequence and implements it in a social robot, so that it can automatically identify unwanted situations and alert the authorities. The gesture recognition pipeline presented in this work is integrated into a cognitive architecture used to generate behaviours in robots. In this way, the robot interacts with humans and is able to detect if a person is calling for help. In that case, the robot will act accordingly without alerting the aggressor. The proposed vision system uses the MediaPipe library to detect people in an image and locate the hands, from which it extracts a set of hand landmarks that identify which gesture is being made. By analysing the sequence of detected gestures, it can identify whether a person is performing the distress hand signal with an accuracy of 96.43%.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140980810","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A comparative study of neural network architectures for software vulnerability forecasting 用于软件漏洞预测的神经网络架构比较研究

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae075

Ovidiu Cosma, Petrică C Pop, Laura Cosma

引用次数: 0

Source code obfuscation with genetic algorithms using LLVM code optimizations 使用 LLVM 代码优化遗传算法混淆源代码

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae069

J. C. de la Torre, Javier Jareño, J. M. Aragón-Jurado, Sébastien Varrette, B. Dorronsoro

{"title":"Source code obfuscation with genetic algorithms using LLVM code optimizations","authors":"J. C. de la Torre, Javier Jareño, J. M. Aragón-Jurado, Sébastien Varrette, B. Dorronsoro","doi":"10.1093/jigpal/jzae069","DOIUrl":"https://doi.org/10.1093/jigpal/jzae069","url":null,"abstract":"\u0000 With the advent of the cloud computing model allowing a shared access to massive computing facilities, a surging demand emerges for the protection of the intellectual property tied to the programs executed on these uncontrolled systems. If novel paradigm as confidential computing aims at protecting the data manipulated during the execution, obfuscating techniques (in particular at the source code level) remain a popular solution to conceal the purpose of a program or its logic without altering its functionality, thus preventing reverse-engineering on the program even with the help of computing resources. The many advantages of code obfuscation, together with its low cost, makes it a popular technique. This paper proposes a novel methodology for source code obfuscation that can be used together with other traditional obfuscation techniques, making the code more robust against reverse engineering attacks. Three program complexity metrics are used to define three different single-objective combinatorial optimization versions of the problem, which are solved and analysed. Additionally, three multi-objective problems are defined, those considering each of the selected metrics together with the program execution time, in order to avoid strong obfuscations penalizing the performance. The goal of the defined problems is to find sequences of LLVM optimizations that lead to highly obfuscated versions of the original code. These transformations are applied to the back-end pseudo-assembly code (i.e., LLVM Intermediate Representation), thus avoiding any further optimizations by the compiler. Classical genetic algorithms (GAs) are used to solve the studied problems, namely a basic cellular GA for the single-objective problems and the popular NSGA-II for the multi-objective ones. The promising results show the potential of the proposed technique.","PeriodicalId":51114,"journal":{"name":"Logic Journal of the IGPL","volume":null,"pages":null},"PeriodicalIF":1.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140978196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"数学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A game theoretic decision forest for feature selection and classification 用于特征选择和分类的博弈论决策森林

IF 1 4区数学

Logic Journal of the IGPL Pub Date : 2024-05-14 DOI: 10.1093/jigpal/jzae049

Mihai-Alexandru Suciu, Rodica Ioana Lung

引用次数: 0