International Journal of Intelligent Systems最新文献

{"title":"Joint Power Control and Resource Allocation With Task Offloading for Collaborative Device-Edge-Cloud Computing Systems","authors":"Shumin Xie,&nbsp;Kangshun Li,&nbsp;Wenxiang Wang,&nbsp;Hui Wang,&nbsp;Hassan Jalil","doi":"10.1155/2024/6852701","DOIUrl":"https://doi.org/10.1155/2024/6852701","url":null,"abstract":"<div>\u0000 <p>Collaborative edge and cloud computing is a promising computing paradigm for reducing the task response delay and energy consumption of devices. In this paper, we aim to jointly optimize task offloading strategy, power control for devices, and resource allocation for edge servers within a collaborative device-edge-cloud computing system. We formulate this problem as a constrained multiobjective optimization problem and propose a joint optimization algorithm (JO-DEC) based on a multiobjective evolutionary algorithm to solve it. To address the tight coupling of the variables and the high-dimensional decision space, we propose a decoupling encoding strategy (DES) and a boundary point sampling strategy (BPS) to improve the performance of the algorithm. The DES is utilized to decouple the correlations among decision variables, and BPS is employed to enhance the convergence speed and population diversity of the algorithm. Simulation results demonstrate that JO-DEC outperforms three state-of-the-art algorithms in terms of convergence and diversity, enabling it to achieve a smaller task response delay and lower energy consumption.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/6852701","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142707786","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Security Analysis of Large Language Models on API Misuse Programming Repair","authors":"Rui Zhang,&nbsp;Ziyue Qiao,&nbsp;Yong Yu","doi":"10.1155/2024/7135765","DOIUrl":"https://doi.org/10.1155/2024/7135765","url":null,"abstract":"<div>\u0000 <p>Application programming interface (API) misuse refers to misconceptions or carelessness in the anticipated usage of APIs, threatening the software system’s security. Moreover, API misuses demonstrate significant concealment and are challenging to uncover. Recent advancements have explored enhanced LLMs in a variety of software engineering (SE) activities, such as code repair. Nonetheless, the security implications of using LLMs for these purposes remain underexplored, particularly concerning the issue of API misuse. In this paper, we present an empirical study to observe the bug-fixing capabilities of LLMs in addressing API misuse related to monitoring resource management (MRM API misuse). Initially, we propose APImisRepair, a real-world benchmark for repairing MRM API misuse, including buggy programs, corresponding fixed programs, and descriptions of API misuse. Subsequently, we assess the performance of several LLMs using the APImisRepair benchmark. Findings reveal the vulnerabilities of LLMs in repairing MRM API misuse and find several reasons, encompassing factors such as fault localization and a lack of awareness regarding API misuse. Additionally, we have insights on improving LLMs in terms of their ability to fix MRM API misuse and introduce a crafted approach, APImisAP. Experimental results demonstrate that APImisAP exhibits a certain degree of improvement in the security of LLMs.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7135765","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142707705","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Secure and Fair Client Selection Based on DDPG for Federated Learning","authors":"Tao Wan,&nbsp;Shun Feng,&nbsp;Weichuan Liao,&nbsp;Nan Jiang,&nbsp;Jie Zhou","doi":"10.1155/2024/2314019","DOIUrl":"https://doi.org/10.1155/2024/2314019","url":null,"abstract":"<div>\u0000 <p>Federated learning (FL) is a machine learning technique in which a large number of clients collaborate to train models without sharing private data. However, FL’s integrity is vulnerable to unreliable models; for instance, data poisoning attacks can compromise the system. In addition, system preferences and resource disparities preclude fair participation by reliable clients. To address this challenge, we propose a novel client selection strategy that introduces a security-fairness value to measure client performance in FL. The value in question is a composite metric that combines a security score and a fairness score. The former is dynamically calculated from a beta distribution reflecting past performance, while the latter considers the client’s participation frequency in the aggregation process. The weighting strategy based on the deep deterministic policy gradient (DDPG) determines these scores. Experimental results confirm that our method fairly effectively selects reliable clients and maintains the security and fairness of the FL system.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/2314019","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142707706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"K-Means Centroids Initialization Based on Differentiation Between Instances Attributes","authors":"Ali Akbar Khan,&nbsp;Muhammad Salman Bashir,&nbsp;Asma Batool,&nbsp;Muhammad Summair Raza,&nbsp;Muhammad Adnan Bashir","doi":"10.1155/2024/7086878","DOIUrl":"https://doi.org/10.1155/2024/7086878","url":null,"abstract":"<div>\u0000 <p>The conventional K-Means clustering algorithm is widely used for grouping similar data points by initially selecting random centroids. However, the accuracy of clustering results is significantly influenced by the initial centroid selection. Despite different approaches, including various K-Means versions, suboptimal outcomes persist due to inadequate initial centroid choices and reliance on common normalization techniques like min-max normalization. In this study, we propose an improved algorithm that selects initial centroids more effectively by utilizing a novel formula to differentiate between instance attributes, creating a single weight for differentiation. We introduce a preprocessing phase for dataset normalization without forcing values into a specific range, yielding significantly improved results compared to unnormalized datasets and those normalized using min-max techniques. For our experiments, we used five real datasets and five simulated datasets. The proposed algorithm is evaluated using various metrics and an external benchmark measure, such as the Adjusted Rand Index (ARI), and compared with the traditional K-Means algorithm and 11 other modified K-Means algorithms. Experimental evaluations on these datasets demonstrate the superiority of our proposed methodologies, achieving an impressive average accuracy rate of up to 95.47% and an average ARI score of 0.95. Additionally, the number of iterations required is reduced compared to the conventional K-Means algorithm. By introducing innovative techniques, this research provides significant contributions to the field of data clustering, particularly in addressing modern data-driven clustering challenges.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7086878","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142666133","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"ViT-AMD: A New Deep Learning Model for Age-Related Macular Degeneration Diagnosis From Fundus Images","authors":"Ngoc Thien Le,&nbsp;Thanh Le Truong,&nbsp;Sunchai Deelertpaiboon,&nbsp;Wattanasak Srisiri,&nbsp;Pear Ferreira Pongsachareonnont,&nbsp;Disorn Suwajanakorn,&nbsp;Apivat Mavichak,&nbsp;Rath Itthipanichpong,&nbsp;Widhyakorn Asdornwised,&nbsp;Watit Benjapolakul,&nbsp;Surachai Chaitusaney,&nbsp;Pasu Kaewplung","doi":"10.1155/2024/3026500","DOIUrl":"https://doi.org/10.1155/2024/3026500","url":null,"abstract":"<div>\u0000 <p>Age-related macular degeneration (AMD) diagnosis using fundus images is one of the critical missions of the eye-care screening program in many countries. Various proposed deep learning models have been studied for this research interest, which aim to achieve the mission and outperform human-based approaches. However, research efforts are still required for the improvement of model classification accuracy, sensitivity, and specificity values. In this study, we proposed the model named as ViT-AMD, which is based on the latest Vision Transformer (ViT) structure, to diagnosis a fundus image as normal, dry AMD, or wet AMD types. Unlike convolution neural network models, ViT consists of the attention map layers, which show more effective performance for image classification task. Our training process is based on the 5-fold cross-validation and transfer learning techniques using Chula-AMD dataset at the Department of Ophthalmology, the King Chulalongkorn Memorial Hospital, Bangkok. Furthermore, we also test the performance of trained model using an independent image datasets. The results showed that for the 3-classes AMD classification (normal vs. dry AMD vs. wet AMD) on the Chula-AMD dataset, the averaged accuracy, precision, sensitivity, and specificity of our trained model are about 93.40%, 92.15%, 91.27%, and 96.57%, respectively. For result testing on independent datasets, the averaged accuracy, precision, sensitivity, and specificity of trained model are about 74, 20%, 75.35%, 74.13%, and 87.07%, respectively. Compared with the results from the baseline CNN-based model (DenseNet201), the trained ViT-AMD model has outperformed significantly. In conclusion, the ViT-AMD model have proved their usefulness to assist the ophthalmologist to diagnosis the AMD disease.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/3026500","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142664876","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Switched Observer-Based Event-Triggered Safety Control for Delayed Networked Control Systems Under Aperiodic Cyber attacks","authors":"Shuqi Li,&nbsp;Yiren Chen,&nbsp;Wenli Shang,&nbsp;Feiqi Deng,&nbsp;Xiaobin Gao","doi":"10.1155/2024/6971338","DOIUrl":"https://doi.org/10.1155/2024/6971338","url":null,"abstract":"<div>\u0000 <p>The networked control systems (NCSs) under cyberattacks have received much attention in both industrial and academic fields, with rare attention on the delayed networked control systems (DNCSs). In order to well address the control problem of DNCSs, in this study, we consider the resilient event-triggered safety control problem of the NCSs with time-varying delays based on the switched observer subject to aperiodic denial-of-service (DoS) attacks. The observer-based switched event-triggered control (ETC) strategy is devised to cope with the DNCSs under aperiodic cyberattacks for the first time so as to decrease the transmission of control input under limited network channel resources. A new piecewise Lyapunov functional is proposed to analyze and synthesize the DNCSs with exponential stability. The quantitative relationship among the attack activated/sleeping period, exponential decay rate, event-triggered parameters, sampling period, and maximum time-delay are explored. Finally, we use both a numerical example and a practical example of offshore platform to show the effectiveness of our results.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/6971338","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142664736","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An Innovative Application of Swarm-Based Algorithms for Peer Clustering","authors":"Vesna Šešum-Čavić,&nbsp;Eva Kühn,&nbsp;Laura Toifl","doi":"10.1155/2024/5571499","DOIUrl":"https://doi.org/10.1155/2024/5571499","url":null,"abstract":"<div>\u0000 <p>In most peer-to-peer (P2P) networks, peers are placed randomly or based on their geographical position, which can lead to a performance bottleneck. This problem can be solved by using peer clustering algorithms. In this paper, the significant results of the paper can be described in the following sentences. We propose two innovative swarm-based metaheuristics for peer clustering, slime mold and slime mold K-means. They are competitively benchmarked, evaluated, and compared to nine well-known conventional and swarm-based algorithms: artificial bee colony (ABC), ABC combined with K-means, ant-based clustering, ant K-means, fuzzy C-means, genetic K-means, hierarchical clustering, K-means, and particle swarm optimization (PSO). The benchmarks cover parameter sensitivity analysis and comparative analysis made by using 5 different metrics: execution time, Davies–Bouldin index (DBI), Dunn index (DI), silhouette coefficient (SC), and averaged dissimilarity coefficient (ADC). Furthermore, a statistical analysis is performed in order to validate the obtained results. Slime mold and slime mold K-means outperform all other swarm-inspired algorithms in terms of execution time and quality of the clustering solution.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-12","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/5571499","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142664793","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Deepfake Detection Based on the Adaptive Fusion of Spatial-Frequency Features","authors":"Fei Wang,&nbsp;Qile Chen,&nbsp;Botao Jing,&nbsp;Yeling Tang,&nbsp;Zengren Song,&nbsp;Bo Wang","doi":"10.1155/2024/7578036","DOIUrl":"https://doi.org/10.1155/2024/7578036","url":null,"abstract":"<div>\u0000 <p>Detecting deepfake media remains an ongoing challenge, particularly as forgery techniques rapidly evolve and become increasingly diverse. Existing face forgery detection models typically attempt to discriminate fake images by identifying either spatial artifacts (e.g., generative distortions and blending inconsistencies) or predominantly frequency-based artifacts (e.g., GAN fingerprints). However, a singular focus on a single type of forgery cue can lead to limited model performance. In this work, we propose a novel cross-domain approach that leverages a combination of both spatial and frequency-aware cues to enhance deepfake detection. First, we extract wavelet features using wavelet transformation and residual features using a specialized frequency domain filter. These complementary feature representations are then concatenated to obtain a composite frequency domain feature set. Furthermore, we introduce an adaptive feature fusion module that integrates the RGB color features of the image with the composite frequency domain features, resulting in a rich, multifaceted set of classification features. Extensive experiments conducted on benchmark deepfake detection datasets demonstrate the effectiveness of our method. Notably, the accuracy of our method on the challenging FF++ dataset is mostly above 98%, showcasing its strong performance in reliably identifying deepfake images across diverse forgery techniques.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/7578036","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142664498","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Construction of the Information Dissemination Model and Calculation of User Influence Based on Attenuation Coefficient","authors":"Lin Guo,&nbsp;Su Zhang,&nbsp;Xiaoying Liu","doi":"10.1155/2024/2103945","DOIUrl":"https://doi.org/10.1155/2024/2103945","url":null,"abstract":"<div>\u0000 <p>Users’ online activities serve as a mirror, reflecting their unique personas, affiliations, interests, and hobbies within the real world. Network information dissemination is inherently targeted, as users actively seek information to facilitate precise and swift communication. Delving into the nuances of information propagation on the Internet holds immense potential for facilitating commercial endeavors such as targeted advertising, personalized product recommendations, and insightful consumer behavior analyses. Recognizing that the intensity of information transmission diminishes with the proliferation of competing messages, increased transmission distances, and the passage of time, this paper draws inspiration from the concept of heat attenuation to formulate an innovative information propagation model. This model simulates the “heat index” of each node in the transmission process, thereby capturing the dynamic nature of information flow. Extensive experiments, bolstered by comparative analyses of multiple datasets and relevant algorithms, validate the correctness, feasibility, and efficiency of our proposed algorithm. Notably, our approach demonstrates remarkable accuracy and stability, underscoring its potential for real-world applications.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/2103945","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142588198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Efficient Based on Improved Random Forest Defense System Against Application-Layer DDoS Attacks","authors":"Junjiang He,&nbsp;Wenbo Fang,&nbsp;Xiaolong Lan,&nbsp;Geying Yang,&nbsp;Ziyu Chen,&nbsp;Yang Chen,&nbsp;Tao Li,&nbsp;Jiangchuan Chen","doi":"10.1155/2024/9044391","DOIUrl":"https://doi.org/10.1155/2024/9044391","url":null,"abstract":"<div>\u0000 <p>Application-layer distributed denial of service (DDoS) attacks have become the main threat to Web server security. Because application-layer DDoS attacks have strong concealability and high authenticity, intrusion detection technologies that rely solely on judging client authenticity cannot accurately detect such attacks. In addition, application-layer DDoS attacks are periodic and repetitive, and attack targets suddenly in a short period. In this study, we propose an efficient application-layer DDoS detection system based on improved random forest. Firstly, the Web logs are preprocessed to extract the user session characteristics. Subsequently, we propose a Session Identification based on Separation and Aggregation (SISA) method to accurately capture user sessions. Lastly, we propose an improved random forest classification algorithm based on feature weighting to address the issue of an increasing number of features leading to prolonged calculation times in the random forest algorithm, and as the feature dimension increases, there might be instances where no subfeature is related to the category to be classified. More importantly, we compare the request source IP with the malicious IP in the threat intelligence library to deal with the periodicity and repetition of application-layer DDoS attacks. We conducted a comprehensive experiment on the publicly available Web log dataset and the threat intelligence database of the laboratory as well as the simulated generated attack log dataset in the laboratory environment. The experimental results show that the proposed detection system can control the false alarm rate and false alarm rate within a reasonable range, improving the detection efficiency further, the detection rate is 99.85%. In secondary attack detection experiments, our proposed detection method achieves a higher detection rate in a shorter time.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":5.0,"publicationDate":"2024-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/9044391","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142561565","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}