International Journal of Intelligent Systems最新文献

{"title":"An Intelligent COVID-19-Related Arabic Text Detection Framework Based on Transfer Learning Using Context Representation","authors":"Abdullah Y. Muaad,&nbsp;Shaina Raza,&nbsp;Md Belal Bin Heyat,&nbsp;Amerah Alabrah,&nbsp;Hanumanthappa J.","doi":"10.1155/2024/8014111","DOIUrl":"10.1155/2024/8014111","url":null,"abstract":"<div>\u0000 <p>The misleading information during the coronavirus disease 2019 (COVID-19) pandemic’s peak time is very sensitive and harmful in our community. Analyzing and detecting COVID-19 information on social media are a crucial task. Early detection of COVID-19 information is very helpful and minimizes the risk of psychological security which leads to inconvenience in daily life. In this paper, a deep ensemble transfer learning framework with an understanding of the context of Arabic text COVID-19 information is proposed. This framework is inspired to spontaneously analyze and recognize the text about COVID-19. The ArCOVID-19Vac dataset has been used to train and test our proposed model. A comprehensive experimental study for each scenario is performed. For the binary classification scenario, the proposed framework records better evaluation results with 83.0%, 84.0%, 83.0%, and 84.0% in terms of accuracy, precision, recall, and <i>F</i>1-score, respectively. For the second scenario (three classes), the overall performance is recorded with an accuracy of 82.0%, precision of 80.0%, recall of 82.0%, and <i>F</i>1-score of 80.0%, respectively. In the last scenario with ten classes, the best evaluation performance results are recorded with an accuracy of 67.0%, a precision of 58.0%, a recall of 67.0%, and <i>F</i>1-score of 59.0%, respectively. In addition, we have applied an ensemble transfer learning model for this scenario to get 64.0%, 66.0%, 66.0%, and 65.0% in terms of accuracy, precision, recall, and <i>F</i>1-score, respectively. The results show that the proposed model through transfer learning provides better results for Arabic text than all state-of-the-art methods.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/8014111","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141108867","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":"Anime Audio Retrieval Based on Audio Separation and Feature Recognition","authors":"De Li,&nbsp;Wenying Xu,&nbsp;Xun Jin","doi":"10.1155/2024/6668582","DOIUrl":"10.1155/2024/6668582","url":null,"abstract":"<div>\u0000 <p>This paper proposes an anime audio retrieval method based on audio separation and feature recognition techniques, aiming to help users conveniently locate their desired audio segments and enhance the overall user experience. Additionally, by establishing an audio fingerprint database and a corresponding copyright information management system, it becomes possible to track and manage the audio content within anime, effectively preventing piracy and unauthorized use, thereby improving the management and protection of audio resources. Traditional methods for anime audio feature recognition suffer from issues like low efficiency and subjective factors. In contrast, the proposed approach overcomes these limitations by automatically separating and extracting audio fingerprints from different audio sources within anime and creating an anime audio fingerprint database for fast retrieval. The paper utilizes an improved audio separation model based on the efficient channel attention mechanism to separate the anime audio. Subsequently, feature recognition is performed on the separated anime audio, employing a contrastive learning-based audio fingerprint retrieval method for anime audio fingerprinting. Experimental results demonstrate that the proposed algorithm effectively alleviates the issue of poor audio separation performance in anime audio, while also improving retrieval efficiency and accuracy, meeting the demands for anime audio content retrieval.</p>\u0000 </div>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://onlinelibrary.wiley.com/doi/epdf/10.1155/2024/6668582","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141117860","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 Genetic Algorithm with Lower Neighborhood Search for the Three-Dimensional Multiorder Open-Size Rectangular Packing Problem","authors":"Jianglong Yang,&nbsp;Huwei Liu,&nbsp;Kaibo Liang,&nbsp;Man Shan,&nbsp;Lingjie Kong,&nbsp;Li Zhou","doi":"10.1155/2024/4456261","DOIUrl":"10.1155/2024/4456261","url":null,"abstract":"<p>This paper addresses the multiorder open-dimension three-dimensional rectangular packing problem (3D-MOSB-ODRPP), which involves packing rectangular items from multiple orders into a single, size-adjustable container. We propose a novel metaheuristic approach combining a genetic algorithm with the Gurobi solver. The algorithm incorporates a lower neighborhood search strategy and is underpinned by a mathematical model representing the multiorder open-dimension packing scenario. Extensive experiments validate the effectiveness of the proposed approach. The LNSGA algorithm outperforms Gurobi and the traditional genetic algorithm in solution quality and computational efficiency. For small-scale instances, LNSGA achieves optimal values in most cases. LNSGA demonstrates significant optimization improvements over Gurobi and the genetic algorithm for large-scale instances. The superior performance is attributed to the effective integration of the lower neighborhood search mechanism and the Gurobi solver. This study offers valuable insights for optimizing the packing process in e-commerce warehousing and logistics operations.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140974286","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Dynamics and Control Strategies for SLBRS Model of Computer Viruses Based on Complex Networks","authors":"Wei Tang,&nbsp;Hui Yang,&nbsp;Jinxiu Pi","doi":"10.1155/2024/3943882","DOIUrl":"10.1155/2024/3943882","url":null,"abstract":"<p>The proliferation of computer viruses has escalated in recent years, posing threats not only to individuals’ safety and property but also to societal well-being. Consequently, effectively curtailing virus spread has become an urgent imperative. To address this issue, our paper introduces a new virus propagation model and associated control strategy. First, diverging from conventional approaches in network virus literature, we propose a susceptible-latent-breaking-out-recovered-susceptible (SLBRS) virus propagation model tailored to the topological characteristics of scale-free networks, thus comprehensively incorporating network structure’s impact on virus propagation. Second, we analyze the model’s foundational properties, derive the basic reproduction number, and demonstrate the existence and global asymptotic stability of disease-free equilibrium. Finally, leveraging global stability of the model at the disease-free equilibrium, we integrate the target immunization strategy (TIS) and the acquaintance immunization strategy (AIS) to devise an optimal control strategy. The paper’s findings offer fresh insights into disease-free equilibrium existence and stability, furnishing a more dependable approach to curbing network virus dissemination. The simulation results demonstrate the persistent presence of network viruses in the absence of control measures and the instability of the disease-free equilibrium. However, effective control is achieved after implementing immunization measures.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140978623","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal Gasoline Price Predictions: Leveraging the ANFIS Regression Model","authors":"Entesar Hamed I. Eliwa,&nbsp;Amr Mohamed El Koshiry,&nbsp;Tarek Abd El-Hafeez,&nbsp;Ahmed Omar","doi":"10.1155/2024/8462056","DOIUrl":"10.1155/2024/8462056","url":null,"abstract":"<p>This study presents an in-depth analysis of gasoline price forecasting using the adaptive network-based fuzzy inference system (ANFIS), with an emphasis on its implications for policy-making and strategic decisions in the energy sector. The model leverages a comprehensive dataset from the U.S. Energy Information Administration, spanning over 30 years of historical price data from 1993 to 2023, along with relevant temporal features. By combining the strengths of fuzzy logic and neural networks, the ANFIS approach can effectively capture the complex, nonlinear relationships present in the data, enabling reliable price predictions. The dataset’s preprocessing involved decomposing the date into year, month, and day components to enhance the model’s input features. Our methodology entailed a systematic approach to ANFIS regression, including data preparation, model training with the inclusion of the previous week’s prices as an additional feature, and rigorous performance evaluation using MSE, RMSE, and correlation coefficients. The results indicate that incorporating previous prices significantly enhances the model’s accuracy, as reflected by improved scores and correlation metrics. The findings have significant implications for the energy sector, where stakeholders can leverage the ANFIS model’s insights for strategic decision-making. Accurate gasoline price forecasts are instrumental in devising pricing strategies, managing risks associated with price volatility, and guiding policy formulation. The model’s predictive capability enables energy companies to optimize resource allocation, plan for future investments, and maintain competitive advantage in a market influenced by fluctuating prices. Moreover, policymakers can utilize these predictions to assess the impact of energy policies on market prices and consumer behavior, ensuring that regulatory measures align with market dynamics and sustainability goals. In addition to the ANFIS model, we also employed Vector Autoregression (VAR) and Autoregressive Integrated Moving Average (ARIMA) models to validate our approach and provide a comprehensive understanding of time series forecasting within the energy sector. Notably, the ANFIS model achieves a score of 0.9970 and a robust correlation of 0.9985, demonstrating its ability to accurately forecast gasoline prices based on historical data and features. The integration of these traditional techniques with advanced ANFIS modeling offers a robust framework for accurate and reliable gasoline price prediction, which is vital for informed policy-making and strategic planning in the energy industry.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140989933","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Novel Approach to Optimizing Convolutional Neural Networks for Improved Digital Image Segmentation","authors":"Kongduo Xing,&nbsp;Junhua Ku,&nbsp;Jie Zhao","doi":"10.1155/2024/4337255","DOIUrl":"10.1155/2024/4337255","url":null,"abstract":"<p>To divide a digital image into individual parts that share similar characteristics is known as digital image segmentation, and it is a vital research subject in the field of computer vision. Object recognition, medical imaging, surveillance, and video processing are just a few of the many real-world contexts where this study could prove useful. While digital image segmentation research has come a long way, there are still certain obstacles to overcome. Segmentation algorithms frequently encounter challenges in achieving both accuracy and efficiency when confronted with intricate settings, noisy pictures, or fluctuating lighting conditions. The absence of established evaluation standards adds complexity to the process of performing equitable comparisons among different segmentation methodologies. Due to the subjective nature of photo segmentation, attaining consistent results among specialists can be challenging. The integration of machine learning and deep neural networks into segmentation algorithms has introduced new challenges, including the need for large amounts of annotated data and the interpretability of the outcomes. Given these challenges, the objective of this study is to enhance the segmentation model. To this end, this research suggests a model of convolutional neural networks that is optimal for digital picture segmentation. The model is based on a dense convolution neural network, and it incorporates a transfer learning technique to significantly boost the model’s robustness and the quality of picture segmentation. The model’s adaptability to new datasets is improved by the incorporation of a transfer learning method. As demonstrated by experimental results on two publicly available datasets, the suggested methodology considerably enhances the resilience of digital picture segmentation.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140997886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimal Maintenance Decision Method for a Sensor Network Based on Belief Rule Base considering Attribute Correlation","authors":"Shaohua Li,&nbsp;Bingxin Liu,&nbsp;Jingying Feng,&nbsp;Ruihua Qi,&nbsp;Wei He,&nbsp;Ming Xu,&nbsp;Linxin Yuan,&nbsp;Shiwen Wang","doi":"10.1155/2024/6616366","DOIUrl":"https://doi.org/10.1155/2024/6616366","url":null,"abstract":"<p>Optimal maintenance decision for a sensor network aims to intelligently determine the optimal repair time. The accuracy of the optimal maintenance decision method directly affects the reliability and safety of the sensor network. This paper develops a new optimal maintenance decision method based on belief rule base considering attribute correlation (BRB-c), which is designed to address three challenges: the lack of observation data, complex system mechanisms, and characteristic correlation. This method consists of two sections: the health state assessment model and the health state prediction model. Firstly, the former is accomplished through a BRB-c-based health assessment model that considers characteristic correlation. Subsequently, based on the current health state, a Wiener process is used to predict the health state of the sensor network. After predicting the health state, experts are then required to establish the minimum threshold, which in turn determines the optimal maintenance time. To demonstrate the proposed method is effective, a case study for the wireless sensor network (WSN) of oil storage tank was conducted. The experimental data were collected from an actual storage tank sensor network in Hainan Province, China. The experimental results validate the accuracy of the developed optimal maintenance decision model, confirming its capability to efficiently predict the optimal maintenance time.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-04-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141164782","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Incorporating Adaptive Sparse Graph Convolutional Neural Networks for Segmentation of Organs at Risk in Radiotherapy","authors":"Junjie Hu,&nbsp;Chengrong Yu,&nbsp;Shengqian Zhu,&nbsp;Haixian Zhang","doi":"10.1155/2024/1728801","DOIUrl":"https://doi.org/10.1155/2024/1728801","url":null,"abstract":"<p>Precisely segmenting the organs at risk (OARs) in computed tomography (CT) plays an important role in radiotherapy’s treatment planning, aiding in the protection of critical tissues during irradiation. Renowned deep convolutional neural networks (DCNNs) and prevailing transformer-based architectures are widely utilized to accomplish the segmentation task, showcasing advantages in capturing local and contextual characteristics. Graph convolutional networks (GCNs) are another specialized model designed for processing the nongrid dataset, e.g., citation relationship. The DCNNs and GCNs are considered as two distinct models applicable to the grid and nongrid datasets, respectively. Motivated by the recently developed dynamic-channel GCN (DCGCN) that attempts to leverage the graph structure to enhance the feature extracted by the DCNNs, this paper proposes a novel architecture termed adaptive sparse GCN (ASGCN) to mitigate the inherent limitations in DCGCN from the aspect of node’s representation and adjacency matrix’s construction. For the node’s representation, the global average pooling used in the DCGCN is replaced by the learning mechanism to accommodate the segmentation task. For the adjacency matrix, an adaptive regularization strategy is leveraged to penalize the coefficient in the adjacency matrix, resulting in a sparse one that can better exploit the relationships between nodes. Rigorous experiments on multiple OARs’ segmentation tasks of the head and neck demonstrate that the proposed ASGCN can effectively improve the segmentation accuracy. Comparison between the proposed method and other prevalent architectures further confirms the superiority of the ASGCN.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141164790","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A Branch-and-Price Algorithm for an Integrated Online and Offline Retailing Distribution System with Product Return","authors":"Wanchen Jie,&nbsp;Cheng Pei,&nbsp;Jiating Xu,&nbsp;Hong Yan","doi":"10.1155/2024/8880791","DOIUrl":"10.1155/2024/8880791","url":null,"abstract":"<p>This study identifies critical inefficiencies within a dual-channel operation model employed by a fast fashion company, particularly the independent operation of three logistics distribution systems. These systems result in high operational costs and low resource utilization, primarily due to redundant vehicle dispatches to meet the distinct demands of retail store replenishment, online customer orders, and customer return demands, as well as random and scattered return requests leading to vehicle underutilization. To address these challenges, we propose a novel integrated logistics distribution system design and management method tailored for dual-channel sales and distribution businesses. The approach consolidates the three distribution systems into one cohesive framework, thus streamlining the delivery process and reducing vehicle trips by combining retail and customer visits. An optimization algorithm is introduced to factor in inventory and distribution distance, aiming to achieve global optimization in pairing retail store inventory with online customer orders and unifying the distribution of replenishment products, online products, and returned products. The paper contributes to the field by introducing a new variation of the Vehicle Routing Problem (VRP) that arises from an integrated distribution system, combining common VRP issues with more complex challenges. A custom Branch-and-Price (B&amp;P) algorithm is developed to efficiently find optimal routes. Furthermore, we demonstrate the benefits of the integrated system over traditional, segregated systems through real-world data analysis and assess various factors including return rates and inventory conditions. The study also enhances the model by allowing inventory transfers between retail stores, improving inventory distribution balance, and offering solutions for scenarios with critically low inventory levels. Our findings highlight a significant reduction in total operating cost savings of up to 49.9% and vehicle usage when using the integrated distribution system compared to independent two-stage and three-stage systems. The integrated approach enables the utilization of vacant vehicle space and the dynamic selection and combination of tasks, preventing unnecessary mileage and space wastage. Notably, the integration of inventory sharing among retail stores has proven to be a key factor in generating feasible solutions under tight inventory conditions and reducing operational costs and vehicle numbers, with the benefits amplified in large-scale problem instances.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-04-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140659334","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"DLLog: An Online Log Parsing Approach for Large-Scale System","authors":"Hailong Cheng,&nbsp;Shi Ying,&nbsp;Xiaoyu Duan,&nbsp;Wanli Yuan","doi":"10.1155/2024/5961993","DOIUrl":"10.1155/2024/5961993","url":null,"abstract":"<p>Syslog is a critical data source for analyzing system problems. Converting unstructured log entries into structured log data is necessary for effective log analysis. However, existing log parsing methods demonstrate promising accuracy on limited datasets, but their generalizability and precision are uncertain when applied to diverse log data. Enhancements in these areas are necessary. This paper proposes an online log parsing method called DLLog, which is based on deep learning and has the longest common subsequence. DLLog utilizes the GRU neural network to mine template words and applies the longest common subsequence to parse log entries in real-time. In the offline stage, DLLog combines multiple log features to accurately extract the template words, creating a log template set to assist online log parsing. In the online stage, DLLog parses log entries by calculating the matching degree between the real-time log entry and the log template in the log template set. This method also supports the incremental update of the log template set to handle new log entries generated by systems. We summarized the previous works and validated DLLog using real log data collected from 16 systems. The results demonstrate that DLLog achieves high parsing accuracy, universality, and adaptability.</p>","PeriodicalId":14089,"journal":{"name":"International Journal of Intelligent Systems","volume":"2024 1","pages":""},"PeriodicalIF":7.0,"publicationDate":"2024-04-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140698794","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}