Egyptian Informatics Journal最新文献

{"title":"A non-invasive computer-aided personalized diagnosis system for Osteopenia and Osteoporosis","authors":"Hadeel Osama El-Sisi,&nbsp;Fatma El-Zahraa Ahmed El-Gamal,&nbsp;Noha Ahmed Hikal","doi":"10.1016/j.eij.2025.100634","DOIUrl":"10.1016/j.eij.2025.100634","url":null,"abstract":"<div><h3>Background:</h3><div>Osteoporosis is a common bone related disease that is characterized by a severe decrease in bone mineral density and an elevated risk of fracture. To achieve an effective disease management and fractures avoidance, the detection of the disease at its early stage, the Osteopenia stage, is extremely beneficial.</div></div><div><h3>Methods:</h3><div>For this purpose, this paper presents a non-invasive computer aided diagnosis system for disease’s screening using knee X-ray scans in its two basic stages (i.e., Osteopenia and Osteoporosis). Furthermore, a probabilistic diagnosis is produced for each scan, offering a personalized diagnosis that in turn indicates the severity of the disease, if exist, for each individual independently. Accordingly, the proposed methodology consists of three main steps: (1) the X-ray scans of three groups (i.e., normal, Osteopenia, and Osteoporosis) are pre-processed to improve the scans’ quality, and to serve the feature extraction and the construction of the model; (2) the pre-trained VGG16 model is used to identify the descriminative characteristics of each studied group that are then; at stage (3) fed to the SVM classifier to accomplish the diagnosis task, including the severity grading task.</div></div><div><h3>Results:</h3><div>Evaluating the proposed framework showed promising results with an average overall accuracy of 94.85%. In the groups base, the results were around 93.75%, 96.77%, and 100% for the normal group’s recall, F1-score, and precision, respectively. For the Osteopenia group, the results were around 93.95%, 100%, and 88.60% for F1-score, recall, and precision, respectively. Finally, the Osteoporosis group’s results achieved an average of 93.91%, 90%, and 98% for F1-score, recall, and precision, respectively.</div></div><div><h3>Conclusion:</h3><div>These results reflect the powerful ability of the proposed work especially that it could outperform the related efforts. Accordingly, these results encourage further analysis to extract more related medical insights for consequent assistance in the relevant healthcare diagnosis and treatment plans.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100634"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143593154","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A hybrid GRASP and VND heuristic for vehicle routing problem with dynamic requests","authors":"Shifeng Chen ,&nbsp;Yanlan Yin ,&nbsp;Haitao Sang ,&nbsp;Wu Deng","doi":"10.1016/j.eij.2025.100638","DOIUrl":"10.1016/j.eij.2025.100638","url":null,"abstract":"<div><div>This paper describes a hybrid heuristic that integrates the Greedy Randomized Adaptive Search Procedure (GRASP) and Variable Neighborhood Descent (VND) to address the Vehicle Routing Problem with Dynamic Requests (VRPDR). The VRPDR, a dynamic offshoot of the classical Vehicle Routing Problem (VRP), features customer requests emerging over time, with the objective of minimizing the total travel distance by devising a set of routes to serve all customers. The proposed method initially employs GRASP to construct an initial solution, followed by VND for exploration and refinement. The hybrid approach aims to utilize the strengths of both algorithms. Through testing on two sets of benchmark instances, namely dynamic pickup instances and dynamic delivery instances, 15 new optimal solutions are identified for the former and 11 for the latter. These results clearly demonstrate that the proposed algorithm competes favorably with the algorithms documented in the literature.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100638"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143549452","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Spectral analysis of Cupric oxide (CuO) and Graphene Oxide (GO) via machine learning techniques","authors":"Zeeshan Saleem Mufti ,&nbsp;Kashaf Mahboob ,&nbsp;Muhammad Nauman Aslam ,&nbsp;Sadaf Hussain ,&nbsp;Abdoalrahman S.A. Omer ,&nbsp;Tanweer Sohail ,&nbsp;Sagheer Abbas ,&nbsp;Ilyas Khan ,&nbsp;Muhammad Adnan Khan","doi":"10.1016/j.eij.2025.100632","DOIUrl":"10.1016/j.eij.2025.100632","url":null,"abstract":"&lt;div&gt;&lt;div&gt;Chemical graph theory has recently gained much attraction among researchers due to its extensive use in mathematical chemistry. In this research article, We have studied the spectral properties such as eigenvalues, energy and Estrada index of some chemical structures such as Cupric oxide (&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;) and Graphene Oxide (GO). We have computed the energy &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;mrow&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;mo&gt;|&lt;/mo&gt;&lt;/mrow&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and the other invariant Estrada index &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;msubsup&gt;&lt;mrow&gt;&lt;mo&gt;∑&lt;/mo&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mn&gt;1&lt;/mn&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;n&lt;/mi&gt;&lt;/mrow&gt;&lt;/msubsup&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;e&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;λ&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;i&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; of the above mentioned graph structures and obtain the polynomial regression analysis using machine learning techniques. This approach permitted us to predict the spectral values more precisely and analyze the difference between the actual and predicted values. The actual values of energy and Estrada index is represented by &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;a&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;a&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; while the predicted values of energy and Estrada index is represented by &lt;span&gt;&lt;math&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/math&gt;&lt;/span&gt; and &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;msub&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/msub&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;, where &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;a&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; represents ”actual value” and &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; represents ”predicted value”. We first use traditional method based on softwares and get the actual values (&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;a&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;) (see section 2). Then we perform machine learning techniques to generate a best fit model and get the predicted values (&lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;p&lt;/mi&gt;&lt;mi&gt;v&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt;) of the energies and Estrada index of Cupric oxide &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; and Graphene Oxide &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;G&lt;/mi&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; by using the best fit second order polynomial for Energy and Estrada Index of &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;C&lt;/mi&gt;&lt;mi&gt;u&lt;/mi&gt;&lt;mi&gt;O&lt;/mi&gt;&lt;/mrow&gt;&lt;/math&gt;&lt;/span&gt; is obtained as &lt;span&gt;&lt;math&gt;&lt;mrow&gt;&lt;mi&gt;E&lt;/mi&gt;&lt;mrow&gt;&lt;mo&gt;(&lt;/mo&gt;&lt;mi&gt;CuO&lt;/mi&gt;&lt;mo&gt;)&lt;/mo&gt;&lt;/mrow&gt;&lt;mo&gt;=&lt;/mo&gt;&lt;mo&gt;−&lt;/mo&gt;&lt;mn&gt;0&lt;/mn&gt;&lt;mo&gt;.&lt;/mo&gt;&lt;mn&gt;007&lt;/mn&gt;&lt;msup&gt;&lt;mrow&gt;&lt;mi&gt;m&lt;/mi&gt;&lt;/mrow&gt;&lt;mrow&gt;&lt;mn&gt;2&lt;/mn&gt;&lt;/mrow&gt;&lt;/msup&gt;&lt;mo&gt;+&lt;/mo&gt;&lt;mn&gt;5&lt;","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100632"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143609489","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multi-strategy fusion binary SHO guided by Pearson correlation coefficient for feature selection with cancer gene expression data","authors":"Yu-Cai Wang,&nbsp;Hao-Ming Song,&nbsp;Jie-Sheng Wang,&nbsp;Xin-Ru Ma,&nbsp;Yu-Wei Song,&nbsp;Yu-Liang Qi","doi":"10.1016/j.eij.2025.100639","DOIUrl":"10.1016/j.eij.2025.100639","url":null,"abstract":"<div><div>Cancer gene expression data is extensively utilized to address the challenges of cancer subtype diagnosis. However, this data is often characterized by high-dimensional, multi-text and multi-classification, which requires an effective feature selection (FS) method. A multi-strategy fusion binary sea-horse optimizer guided by Pearson correlation coefficient was proposed for FS with cancer gene expression data. For the multi-strategy fusion, the rest strategy is introduced in the sea-horse motor behavior stage. Subsequently, a search strategy based on symbiotic organisms of sea horses is designed for the predation stage. Finally, the elementary function dynamic weight strategy is proposed. Multi-strategy fusion enables the sea-horse optimizer (SHO) to perform dynamic exploitation and exploration in the early stage of iteration, expand the search scope initially, and narrow the search scope in the middle and later stages of the algorithm, so as to avoid the algorithm falling into the local optimal and increase the possibility of the algorithm jumping out of the local optimal, and avoid the blind search caused by elite influence. In the FS part, Pearson correlation coefficient guided strategy is proposed firstly to add or delete features. Then eight binary algorithms are derived from S-type and V-type transfer functions. The simulation experiment was divided into four parts. Firstly, the CEC-2022 test functions were used to test the performance of the multi-strategy fusion SHO, from which the best variant TanASSHO was selected, and then compared with other nine swarm intelligent optimization algorithms. Performance tests of various algorithm variants on 18 UCI datasets show that V1PTASSHO is the most effective binary version. Finally, V1PTASSHO was compared with other nine swarm intelligent optimization algorithms on 18 cancer gene expression datasets. The results demonstrate that V1PTASSHO effectively reduces feature subsets, improve classification accuracy and obtain lower fitness value. Friedman test and Wilcoxon rank sum test were used for statistical analysis to verify the effectiveness of the proposed algorithm.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100639"},"PeriodicalIF":5.0,"publicationDate":"2025-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143576894","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"EFFSIP: Efficient forest fire system using IoT and parallel computing","authors":"Khalid Mohammad Jaber ,&nbsp;Ahmad A.A. Alkhatib","doi":"10.1016/j.eij.2025.100631","DOIUrl":"10.1016/j.eij.2025.100631","url":null,"abstract":"<div><div>The escalating issue of forest fires poses severe risks to ecosystems and human habitats, primarily due to the greenhouse effect and sudden climate changes. These fires, mostly occurring naturally, necessitate prompt detection and control. Addressing this, the paper introduces the Efficient Forest Fire System using an innovative Internet of Things (IoT) and Parallel computing (EFFSIP) solution. The EFFSIP system leverages a wireless sensor network to efficiently detect and analyze fire behavior, providing real-time data on fire spread, speed, and direction. The system processes environmental parameters such as temperature (T), relative humidity (RH), and the Chandler Burning Index (CBI) against set thresholds to enable early fire detection.</div><div>Designed for the challenging forest environment, the EFFSIP system prioritizes minimal power usage and simple components, crucial in areas with limited power resources. Its resilient design ensures that the wireless sensor network and sensor nodes withstand harsh weather and fire conditions, maintaining functionality and reliability. The system’s efficiency is enhanced through the use of Pthreads for parallel processing, allowing multiple tasks such as data collection, processing, and fire checking to be handled concurrently. This approach significantly reduces response time by processing sensor data in parallel, ensuring rapid detection and accurate prediction of fire behavior.</div><div>Field tests of the EFFSIP system in various Jordanian forest locations, including Burgish-Ajloun, demonstrated its effectiveness. The system detected a fire at 10:42 am with an initial CBI value of 32.5, which increased sharply to 97.92 as the fire progressed. Additionally, the system recorded a decrease in humidity from 53% to 22% and an increase in temperature from 28 °C to 48.6 °C. For example, the system predicted a fire at node 12 would occur in 0.477 min, allowing preemptive actions to be taken before the fire started. The system’s ability to provide real-time alerts and detailed analysis of fire spread, speed, and direction makes it a valuable tool for forest fire management. The strategic placement of sensor nodes and the use of durable components reduce the risk of system damage due to environmental extremities. The EFFSIP system offers a significant contribution to fighting forest fires, and future enhancements may include leveraging GPGPU (General-Purpose computing on Graphics Processing Units) technology to further increase computational power and system efficiency.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100631"},"PeriodicalIF":5.0,"publicationDate":"2025-02-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143479482","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A real-time framework for opinion spam detection in Arabic social networks","authors":"Cherry A. Ezzat ,&nbsp;Abdullah M. Alkadri ,&nbsp;Abeer Elkorany","doi":"10.1016/j.eij.2025.100626","DOIUrl":"10.1016/j.eij.2025.100626","url":null,"abstract":"<div><div>In today’s interconnected digital landscape, social media platforms serve as the primary avenue for global conversations, encompassing various topics and opinions. Opinion spam entails spreading misleading content masked as authentic opinions. The propagation of opinion spam poses a significant challenge, undermining the authenticity and trustworthiness of online interactions and disturbing the unrestricted exchange of ideas. One of the main challenges in spam detection is the rapid flow of spam content, which necessitates real-time detection mechanisms. Additionally, another important obstacle in detecting spam on Arabic social networks is the limited availability of labeled data. This paper proposes a framework for Real-Time Arabic Opinion Spam Detection (RTAOSD) that was developed to effectively detect opinion spam within Arabic social networks. This framework integrates advanced machine learning models, sentiment Analysis, and real-time processing techniques to achieve accurate and efficient detection of opinion spam. Furthermore, RTAOSD categorizes the non-spam content according to its relevance to topic of interest in to purify the content appear to social network users. Experimental evaluations conducted on real-world datasets demonstrate the effectiveness of RTAOSD in detecting opinion spam which leads to provide users with filtered content that match with their interest and overcome the problem of information overloading. The proposed framework achieved macro-F1 scores for spam detection ranging from 91% to 99% on different Arabic datasets surpassing previous work. While for topic relevance classification, RTAOSD achieved a macro-F1 of 86% for binary relevance and 78% for categorical relevance outperforming previous approaches used. The outcomes of this research is a real-time Arabic spam detector that accurately detects spam content and classifies non-spam text according to its relevance to topic . In addition to providing a visualization module for analyzing and reporting the characteristics of the filtered text.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100626"},"PeriodicalIF":5.0,"publicationDate":"2025-02-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143479481","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Optimizing fault prediction in software based on MnasNet/LSTM optimized by an improved lotus flower algorithm","authors":"Wang Long ,&nbsp;Zhao Qixin ,&nbsp;Michail A. Zakharov ,&nbsp;Sangkeum Lee","doi":"10.1016/j.eij.2025.100623","DOIUrl":"10.1016/j.eij.2025.100623","url":null,"abstract":"<div><div>Software quality and reliability are very important problems in the field of software production. Software error and defect detection technology is one of the most important research goals in the field of software system reliability that prevents software failure. Therefore, the performance of the defect prediction model in order to accurately predict defects is important in improving and effectiveness of models. In this paper, an attempt has been made to present a hybrid and efficient classification model based on deep learning and metaheuristic models for predicting defects of software. The basis of the suggested model is utilizing a combination of MnasNet (for extracting the semantics of AST tokens) and LSTM (for keeping the key features). It has been improved with the help of an improved variant of Lotus Flower Algorithm (ILFA) so that appropriate coefficients and acceptable results can be produced with the optimization power of metaheuristic algorithms and the learning power of the network. For evaluating the results of the suggested model, the model is applied to a practical dataset and the results are compared with some different methods. The new combined model worked best for the Xerces project, reaching 93% accuracy, which was much better than other models. It also performed well on different projects, improving accuracy by 3.3% to 7.9% after cleaning the data and fixing the issue of uneven class sizes. The results indicate that the proposed model can achieve the highest values ​​of efficiency.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100623"},"PeriodicalIF":5.0,"publicationDate":"2025-02-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143464251","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Multistep prediction for egg prices: An efficient sequence-to-sequence network","authors":"Minlan Jiang ,&nbsp;Liyun Mo ,&nbsp;Lingguo Zeng ,&nbsp;Azhi Zhang ,&nbsp;Youhai Du ,&nbsp;Yizhi Huo ,&nbsp;Xiaowei Shi ,&nbsp;Mohammed A.A. Al-qaness","doi":"10.1016/j.eij.2025.100628","DOIUrl":"10.1016/j.eij.2025.100628","url":null,"abstract":"<div><div>Egg price has the characteristics of non-stationary, non-linear, and high volatility, which is more difficult to predict accurately. In this paper, we comprehensively consider the multiple factors affecting egg prices and construct a sequence-to-sequence (Seq2seq) model to study the multi-step prediction method of egg prices. Seasonal-trend Decomposition Procedure Based on Loess (STL) is first used to decompose the historical egg price series into trend, seasonal, and residual terms to reduce the interference of sample noise on forecasting performance. Then, Principal Component Analysis (PCA) is used to analyze and downscale the multidimensional factors affecting egg prices, such as feed price, laying hen seedling price, culled chicken price, duck egg price, and consumer index, to eliminate the redundant information in the data. Finally, the above-processed data were introduced into the Seq2seq network for training to establish a multi-step prediction model for egg prices. The experimental results show that the STL-PCA-Seq2seq model proposed in this paper can broadly capture the long-term dependence information of the input series and model the complex nonlinear relationships among the multidimensional factors affecting egg prices with the lowest prediction errors compared to the Long Short-Term Memory (LSTM), Gated Recurrent Units (GRU), the Informer model, the Seq2seq model, and the STL-Seq2seq model. The method proposed in this paper can reach R² of 0.9867, 0.9569, and 0.9106 at prediction steps 6, 12, and 18. With a prediction step size of 6, the RMSE is 0.131, MAE is 0.086, and MAPE is 0.813, respectively, which realizes the accurate prediction of egg price at any number of steps, and the results of the study provide a reference for the multi-step prediction of egg prices.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100628"},"PeriodicalIF":5.0,"publicationDate":"2025-02-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143437077","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A road lane detection approach based on reformer model","authors":"Dan Li ,&nbsp;Zan Yang ,&nbsp;Wei Nai ,&nbsp;Yidan Xing ,&nbsp;Ziyu Chen","doi":"10.1016/j.eij.2025.100625","DOIUrl":"10.1016/j.eij.2025.100625","url":null,"abstract":"<div><div>Intelligent driving has now become the hot research topics in the field of intelligent transportation system (ITS), and its maturity has a significant impact on road traffic safety in information environment. As one of the key technologies of intelligent driving, lane detection is an important prerequisite for identifying driving environment and driving scenarios, and providing auxiliary decision-making for driving. At present, road lane detection methods based on Transformer model are currently considered to be most effective and accurate; however, Transformer model-based road lane detection methods still have their own drawbacks, like high computational complexity of attention mechanisms and defects in activation function and loss functions. Thus, in this paper, a road lane detection method based on Reformer model, which is in essence an improved version of Transformer model has been proposed. By utilizing local sensitive hashing (LSH) attention mechanism, reversible Transformer structure and partitioning mechanism introduced in Reformer model, the high complexity of Transformer model can be overcome; and by configuring the Mish activation function and Huber loss function, the difficulties in network training and parameter optimization in Transformer model can also be solved. Via numerical analysis and real vehicle scenario experiment on Shanghai-Jiaxing expressway in China, the effectiveness of the proposed Reformer model and its superiority over Transformer models has been demonstrated.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100625"},"PeriodicalIF":5.0,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143429697","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A multi-objective fuzzy model based on enhanced artificial fish Swarm for multiple RNA sequences alignment","authors":"Medhat A. Tawfeek ,&nbsp;Ibrahim Alrashdi ,&nbsp;Madallah Alruwaili ,&nbsp;Gamal Farouk Elhady","doi":"10.1016/j.eij.2025.100627","DOIUrl":"10.1016/j.eij.2025.100627","url":null,"abstract":"<div><div>Ribonucleic Acid (RNA) sequence alignment is a fundamental operation in bioinformatics, essential for analyzing the physicochemical and functional characteristics of RNA molecules. Traditional cross-alignment methods have significant challenges, particularly in optimizing multiple objectives during RNA sequencing. One of the biggest challenges is working to balance speed and accuracy. Fast methods are accompanied by low accuracy, unlike accurate methods which take a long computational time. Consequently, the alignment task becomes increasingly difficult as the number of RNA sequences grows, requiring tools that adequately handle these conflicting targets. To address these challenges, this study proposes an Enhanced Artificial Fish Swarm Algorithm (EAFSA) integrated with a fuzzy multi-objective model specifically designed for multiple RNA sequence alignment. The proposed EAFSA approach offers various advantages including significantly increased alignment accuracy, preservation of sequence integrity and the ability to search for similar fragments efficiently and quickly while reducing computational costs. Experimental comparisons of the proposed EAFSA with other relevant state-of-the-art alignment tools on benchmark RNA datasets demonstrate the efficiency of the proposed method. The efficiency is also proved by various metrics such as alignment score analysis, time complexity, and accuracy. This work demonstrates the potential of the proposed EAFSA to enhance RNA sequence alignment methods, facilitating additional biological interpretations through sequence alignment applications in genomics.</div></div>","PeriodicalId":56010,"journal":{"name":"Egyptian Informatics Journal","volume":"29 ","pages":"Article 100627"},"PeriodicalIF":5.0,"publicationDate":"2025-02-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"143429696","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}