首页 > 最新文献

Systems and Soft Computing最新文献

英文 中文
Optimization of university management based on reptile search algorithm combined with short-duration memory neural network 基于爬行动物搜索算法与短时记忆神经网络相结合的高校管理优化
Pub Date : 2024-05-08 DOI: 10.1016/j.sasc.2024.200101
Qinquan Sun , Jing Su

Due to the lack of accuracy and difficulty to meet the actual requirements of the poor students' financial assistance in the management of smart colleges and universities. Therefore, a precise funding model for poor students is constructed on the basis of improved reptile search algorithm and short-term memory neural network. The performance of the algorithm is evaluated by test function, rank sum test and combinatorial model validation. In test function 5, the algorithm is 2.90E+01±6.04E-03, which is lower than the comparison algorithm, and begins to converge after about 10 iterations, and the convergence speed is significantly higher than that of the comparison algorithm. In the rank sum test, the experimental results of the comparison algorithm on most test functions are less than 5 %. In the combined model verification, the fitness result of the maximum convergence times was 0.2203 %, and the classification accuracy reached 98.7 %, which was better than the comparison model. The precise funding model of poor students proposed in this study has important application value in the management of smart colleges and universities, which can effectively improve the accuracy of poor students' funding and meet the actual needs. At the same time, the high accuracy and fast convergence of the model provide a new idea and method for smart university management.

由于智慧高校管理中贫困生资助缺乏精准性,难以满足贫困生资助的实际要求。因此,在改进爬虫搜索算法和短时记忆神经网络的基础上,构建了贫困生精准资助模型。通过测试函数、秩和检验和组合模型验证来评价算法的性能。在测试函数5中,算法的迭代次数为2.90E+01±6.04E-03,低于对比算法,大约迭代10次后开始收敛,收敛速度明显高于对比算法。在秩和检验中,对比算法在大多数检验函数上的实验结果都小于 5%。在组合模型验证中,最大收敛次数的拟合结果为 0.2203 %,分类准确率达到 98.7 %,优于对比模型。本研究提出的贫困生精准资助模型在智慧高校管理中具有重要的应用价值,可有效提高贫困生资助的精准度,满足实际需求。同时,该模型精度高、收敛快,为智慧高校管理提供了新的思路和方法。
{"title":"Optimization of university management based on reptile search algorithm combined with short-duration memory neural network","authors":"Qinquan Sun ,&nbsp;Jing Su","doi":"10.1016/j.sasc.2024.200101","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200101","url":null,"abstract":"<div><p>Due to the lack of accuracy and difficulty to meet the actual requirements of the poor students' financial assistance in the management of smart colleges and universities. Therefore, a precise funding model for poor students is constructed on the basis of improved reptile search algorithm and short-term memory neural network. The performance of the algorithm is evaluated by test function, rank sum test and combinatorial model validation. In test function 5, the algorithm is 2.90E+01±6.04E-03, which is lower than the comparison algorithm, and begins to converge after about 10 iterations, and the convergence speed is significantly higher than that of the comparison algorithm. In the rank sum test, the experimental results of the comparison algorithm on most test functions are less than 5 %. In the combined model verification, the fitness result of the maximum convergence times was 0.2203 %, and the classification accuracy reached 98.7 %, which was better than the comparison model. The precise funding model of poor students proposed in this study has important application value in the management of smart colleges and universities, which can effectively improve the accuracy of poor students' funding and meet the actual needs. At the same time, the high accuracy and fast convergence of the model provide a new idea and method for smart university management.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200101"},"PeriodicalIF":0.0,"publicationDate":"2024-05-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000309/pdfft?md5=03aa2b14a4bfb8eae2549552c69cd61e&pid=1-s2.0-S2772941924000309-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140910275","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Application of VR motion intelligent capture based on DLPMA algorithm in sports training 基于 DLPMA 算法的 VR 运动智能捕捉在体育训练中的应用
Pub Date : 2024-05-05 DOI: 10.1016/j.sasc.2024.200100
Xiaojie Li

With the rapid development of Virtual Reality (VR) technology, its application in the field of sports training is also receiving increasing attention. This study applies the Distance Likelihood Based Probabilistic Model Averaging (DLPMA) algorithm to the VR motion intelligent capture system, aiming to provide an efficient and accurate motion data collection method to improve existing sports training methods. Introduced the design and implementation of a VR motion intelligent capture system based on DLPMA algorithm, and applied it to sports training. By conducting comparative experiments with traditional training methods, the advantages of the system in motion capture accuracy, real-time performance, and user experience are verified. The research results indicate that the system can accurately capture the movements of athletes and provide timely feedback to users, providing an effective auxiliary means for sports training. Although the system has shown good performance in sports training, there are still some limitations. Future research can further optimize algorithms, enhance system stability and flexibility, to meet a wider range of sports training needs.

随着虚拟现实(VR)技术的快速发展,其在体育训练领域的应用也日益受到关注。本研究将基于距离似然的概率模型平均(DLPMA)算法应用于 VR 运动智能捕捉系统,旨在提供一种高效、准确的运动数据采集方法,以改进现有的运动训练方法。介绍了基于 DLPMA 算法的 VR 运动智能捕捉系统的设计与实现,并将其应用于体育训练。通过与传统训练方法的对比实验,验证了该系统在动作捕捉精度、实时性和用户体验方面的优势。研究结果表明,该系统能准确捕捉运动员的动作并及时反馈给用户,为体育训练提供了有效的辅助手段。虽然该系统在运动训练中表现良好,但仍存在一些局限性。未来的研究可以进一步优化算法,增强系统的稳定性和灵活性,以满足更广泛的运动训练需求。
{"title":"Application of VR motion intelligent capture based on DLPMA algorithm in sports training","authors":"Xiaojie Li","doi":"10.1016/j.sasc.2024.200100","DOIUrl":"10.1016/j.sasc.2024.200100","url":null,"abstract":"<div><p>With the rapid development of Virtual Reality (VR) technology, its application in the field of sports training is also receiving increasing attention. This study applies the Distance Likelihood Based Probabilistic Model Averaging (DLPMA) algorithm to the VR motion intelligent capture system, aiming to provide an efficient and accurate motion data collection method to improve existing sports training methods. Introduced the design and implementation of a VR motion intelligent capture system based on DLPMA algorithm, and applied it to sports training. By conducting comparative experiments with traditional training methods, the advantages of the system in motion capture accuracy, real-time performance, and user experience are verified. The research results indicate that the system can accurately capture the movements of athletes and provide timely feedback to users, providing an effective auxiliary means for sports training. Although the system has shown good performance in sports training, there are still some limitations. Future research can further optimize algorithms, enhance system stability and flexibility, to meet a wider range of sports training needs.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200100"},"PeriodicalIF":0.0,"publicationDate":"2024-05-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000292/pdfft?md5=8a4f7109757fcee172f9f3b5497bf5d4&pid=1-s2.0-S2772941924000292-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141049243","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
RFM user value tags and XGBoost algorithm for analyzing electricity customer demand data 用于分析电力客户需求数据的 RFM 用户价值标签和 XGBoost 算法
Pub Date : 2024-04-23 DOI: 10.1016/j.sasc.2024.200098
Zhu Tang , Yang Jiao , Mingmin Yuan

With the increasing demand for electricity, predicting user electricity demand has become an essential task. The electricity demand characteristics of users in the electricity market are different, so it is necessary to classify and predict users. Aiming at the above problems, a classified forecasting model of electricity demand based on recent consumption, frequency, monetary (RFM), K-means, XGBoost and dynamic time warping (DTW) algorithm is proposed. The experiment showcases that among the electricity consumption of commercial users, the first type of load has the lowest proportion in autumn, at around 18.6 %; The second type of load has the highest proportion in autumn, about 81.3 %; Accurate classification has been made for the consuming quantity of electricity of commercial users. The average error in the forecasting results of the RFM-KM-XGboost model and the actual value of commercial electricity demand is about 0.07 kW; The average errors between the forecasting results of SVM model and RF model and the true values are about 0.2 kW and 0.14 kW, respectively; It indicates that the forecasting error of the RFM-KM-XGBoost model is smaller. The above results indicate that the RFM-KM-XGBoost model can extract users' electricity demand characteristics by classifying user types and load types, and make more accurate predictions of electricity demand for different types of users.

随着电力需求的不断增长,预测用户用电需求已成为一项重要任务。电力市场中用户的用电需求特征各不相同,因此有必要对用户进行分类和预测。针对上述问题,本文提出了一种基于近期用电量、频率、货币(RFM)、K-means、XGBoost 和动态时间扭曲(DTW)算法的用电需求分类预测模型。实验表明,在商业用户的用电量中,第一类负荷在秋季所占比例最低,约为 18.6%;第二类负荷在秋季所占比例最高,约为 81.3%;对商业用户的用电量进行了精确分类。RFM-KM-XGboost 模型的预测结果与商业用电需求实际值的平均误差约为 0.07 kW;SVM 模型和 RF 模型的预测结果与真实值的平均误差分别约为 0.2 kW 和 0.14 kW;说明 RFM-KM-XGBoost 模型的预测误差较小。以上结果表明,RFM-KM-XGBoost 模型可以通过对用户类型和负荷类型的划分,提取用户的用电需求特征,对不同类型用户的用电需求做出较为准确的预测。
{"title":"RFM user value tags and XGBoost algorithm for analyzing electricity customer demand data","authors":"Zhu Tang ,&nbsp;Yang Jiao ,&nbsp;Mingmin Yuan","doi":"10.1016/j.sasc.2024.200098","DOIUrl":"10.1016/j.sasc.2024.200098","url":null,"abstract":"<div><p>With the increasing demand for electricity, predicting user electricity demand has become an essential task. The electricity demand characteristics of users in the electricity market are different, so it is necessary to classify and predict users. Aiming at the above problems, a classified forecasting model of electricity demand based on recent consumption, frequency, monetary (RFM), K-means, XGBoost and dynamic time warping (DTW) algorithm is proposed. The experiment showcases that among the electricity consumption of commercial users, the first type of load has the lowest proportion in autumn, at around 18.6 %; The second type of load has the highest proportion in autumn, about 81.3 %; Accurate classification has been made for the consuming quantity of electricity of commercial users. The average error in the forecasting results of the RFM-KM-XGboost model and the actual value of commercial electricity demand is about 0.07 kW; The average errors between the forecasting results of SVM model and RF model and the true values are about 0.2 kW and 0.14 kW, respectively; It indicates that the forecasting error of the RFM-KM-XGBoost model is smaller. The above results indicate that the RFM-KM-XGBoost model can extract users' electricity demand characteristics by classifying user types and load types, and make more accurate predictions of electricity demand for different types of users.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200098"},"PeriodicalIF":0.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000279/pdfft?md5=a47a516e77ffcb23a2413fdfc67521ab&pid=1-s2.0-S2772941924000279-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140762373","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Machine learning analysis of breast cancer treatment protocols and cycle counts: A case study at Mohammed vi hospital, Morocco 乳腺癌治疗方案和周期计数的机器学习分析:摩洛哥穆罕默德六世医院案例研究
Pub Date : 2024-04-23 DOI: 10.1016/j.sasc.2024.200097
Houda AIT BRAHIM, Salah EL-HADAJ, Abdelmoutalib METRANE

This paper presents a new study of predicting patients' breast cancer treatment protocol and the corresponding treatment cycle based on machine learning algorithms. The data used were collected at Mohammed VI Hospital in Morocco, and it contains patient information with two targets (protocol and treatment cycle).

After preparing the data and testing several machine learning algorithms, two models were developed: The first one, based on Gradient Boosting Classifier algorithm, successfully classified patient treatment protocols with an overall accuracy of 64 % across all categories and an impressive 94 % accuracy for the mode category, widely adopted in the hospital. The second model, based on Random Forest Regressor algorithm, which integrates the results of the first model during the training, predicted the treatment cycle of patients with a Root Mean Square Error (RMSE) score of 0.050 and a Mean Absolute Percentage Error (MAPE) score of 0.020. Furthermore, feature importance analysis was performed to highlight the importance of variables, and show the positive influence of some variables on the models.

Finally, this study can help doctors quickly make decisions about the treatment needed for each patient and also gives an idea of which molecules should exist in the hospital stock based on the patient's treatment cycle predicted.

本文介绍了一项基于机器学习算法预测乳腺癌患者治疗方案和相应治疗周期的新研究。所使用的数据是在摩洛哥穆罕默德六世医院收集的,其中包含两个目标(治疗方案和治疗周期)的患者信息:第一个模型基于梯度提升分类器算法,成功地对患者治疗方案进行了分类,所有类别的总体准确率为 64%,而医院广泛采用的模式类别的准确率高达 94%,令人印象深刻。第二个模型基于随机森林回归算法,在训练过程中整合了第一个模型的结果,以 0.050 的均方根误差 (RMSE) 和 0.020 的平均绝对百分比误差 (MAPE) 预测了患者的治疗周期。最后,这项研究可以帮助医生快速决定每位患者所需的治疗方法,还可以根据预测的患者治疗周期了解医院库存中应该有哪些分子。
{"title":"Machine learning analysis of breast cancer treatment protocols and cycle counts: A case study at Mohammed vi hospital, Morocco","authors":"Houda AIT BRAHIM,&nbsp;Salah EL-HADAJ,&nbsp;Abdelmoutalib METRANE","doi":"10.1016/j.sasc.2024.200097","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200097","url":null,"abstract":"<div><p>This paper presents a new study of predicting patients' breast cancer treatment protocol and the corresponding treatment cycle based on machine learning algorithms. The data used were collected at Mohammed VI Hospital in Morocco, and it contains patient information with two targets (protocol and treatment cycle).</p><p>After preparing the data and testing several machine learning algorithms, two models were developed: The first one, based on Gradient Boosting Classifier algorithm, successfully classified patient treatment protocols with an overall accuracy of 64 % across all categories and an impressive 94 % accuracy for the mode category, widely adopted in the hospital. The second model, based on Random Forest Regressor algorithm, which integrates the results of the first model during the training, predicted the treatment cycle of patients with a Root Mean Square Error (RMSE) score of 0.050 and a Mean Absolute Percentage Error (MAPE) score of 0.020. Furthermore, feature importance analysis was performed to highlight the importance of variables, and show the positive influence of some variables on the models.</p><p>Finally, this study can help doctors quickly make decisions about the treatment needed for each patient and also gives an idea of which molecules should exist in the hospital stock based on the patient's treatment cycle predicted.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200097"},"PeriodicalIF":0.0,"publicationDate":"2024-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000267/pdfft?md5=3d44564af720b01d03732c06b67ff0e2&pid=1-s2.0-S2772941924000267-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140644838","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Cultural tourism attraction recommendation model based on optimized weighted association rule algorithm 基于优化加权关联规则算法的文化旅游景点推荐模型
Pub Date : 2024-04-19 DOI: 10.1016/j.sasc.2024.200094
Rui Jiang , Bin Dai

To address the challenge of users selecting rich tourism resources, this study proposes a model for cultural tourism attraction recommendation using an optimized weighted association rule algorithm. This model includes time and season weight for tourist attraction recommendations. This model proposes improvement methods to address some inherent issues in traditional tourism recommendation models. Firstly, it constructed a recommendation model for cultural tourism attractions, and then optimized the weighted association rule algorithm by incorporating dynamic time weights. It takes into account the user's intended time in the recommendation outcome. Moreover, it incorporated seasonal weights to optimize the weighted rule algorithm for factors such as user travel time and the attractions' peak season during the recommendation process. The experiment indicates that the F1 value of the improved algorithm model proposed in this study reaches 0.952, the accuracy reaches 0.985, the area under the curve reaches 0.955, the Recall value reaches 0.812, and the fitting degree reaches 0.971. The results suggest that the proposed cultural tourism attraction recommendation model, based on an optimized weighted association algorithm, performs well in recommending tourist destinations. This model can have a positive impact on the development of the tourism industry.

为解决用户选择丰富旅游资源的难题,本研究利用优化的加权关联规则算法提出了一种文化旅游景点推荐模型。该模型包括旅游景点推荐的时间和季节权重。针对传统旅游推荐模型中存在的一些固有问题,该模型提出了改进方法。首先,它构建了一个文化旅游景点推荐模型,然后通过加入动态时间权重优化了加权关联规则算法。它在推荐结果中考虑了用户的预期时间。此外,它还在推荐过程中加入了季节权重,针对用户旅行时间和景点旺季等因素优化了加权规则算法。实验表明,本研究提出的改进算法模型的 F1 值达到 0.952,准确率达到 0.985,曲线下面积达到 0.955,Recall 值达到 0.812,拟合度达到 0.971。结果表明,所提出的基于优化加权关联算法的文化旅游景点推荐模型在推荐旅游目的地方面表现良好。该模型可对旅游业的发展产生积极影响。
{"title":"Cultural tourism attraction recommendation model based on optimized weighted association rule algorithm","authors":"Rui Jiang ,&nbsp;Bin Dai","doi":"10.1016/j.sasc.2024.200094","DOIUrl":"10.1016/j.sasc.2024.200094","url":null,"abstract":"<div><p>To address the challenge of users selecting rich tourism resources, this study proposes a model for cultural tourism attraction recommendation using an optimized weighted association rule algorithm. This model includes time and season weight for tourist attraction recommendations. This model proposes improvement methods to address some inherent issues in traditional tourism recommendation models. Firstly, it constructed a recommendation model for cultural tourism attractions, and then optimized the weighted association rule algorithm by incorporating dynamic time weights. It takes into account the user's intended time in the recommendation outcome. Moreover, it incorporated seasonal weights to optimize the weighted rule algorithm for factors such as user travel time and the attractions' peak season during the recommendation process. The experiment indicates that the F1 value of the improved algorithm model proposed in this study reaches 0.952, the accuracy reaches 0.985, the area under the curve reaches 0.955, the Recall value reaches 0.812, and the fitting degree reaches 0.971. The results suggest that the proposed cultural tourism attraction recommendation model, based on an optimized weighted association algorithm, performs well in recommending tourist destinations. This model can have a positive impact on the development of the tourism industry.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200094"},"PeriodicalIF":0.0,"publicationDate":"2024-04-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000231/pdfft?md5=e60b8cb0f6e02d3f55d613610293804e&pid=1-s2.0-S2772941924000231-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140786767","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
CNN based plant disease identification using PYNQ FPGA 使用PYNQ FPGA 进行基于 CNN 的植物病害识别
Pub Date : 2024-04-13 DOI: 10.1016/j.sasc.2024.200088
Vivek Karthick Perumal , Supriyaa T , Santhosh P R , Dhanasekaran S

This research presents a novel approach for plant disease identification utilizing Convolutional Neural Networks (CNNs) and the PYNQ FPGA platform. The study leverages the parallel processing capabilities of FPGAs to accelerate CNN inference, aiming to enhance the efficiency of plant disease detection in agricultural settings. The implementation involves optimizing the CNN architecture for deployment on the PYNQ FPGA, considering factors such as image size and learning rates. Through experimentation, the research refines hyper parameters, achieving improved accuracy and F1 scores. Visualizations using heat maps highlight the CNN's reliance on color, shape, and texture for feature extraction in disease identification. The integration of FPGA technology demonstrates promising advancements in real-time, high-performance plant disease classification, offering potential benefits for precision agriculture and crop management. This research contributes to the growing field of FPGA-accelerated deep learning applications in agro technology, addressing challenges in plant health monitoring and fostering sustainable agricultural practices.

本研究提出了一种利用卷积神经网络(CNN)和PYNQ FPGA 平台进行植物病害识别的新方法。该研究利用 FPGA 的并行处理能力加速 CNN 推断,旨在提高农业环境中植物病害检测的效率。实施过程包括优化 CNN 架构,以便在PYNQ FPGA 上部署,同时考虑图像大小和学习率等因素。通过实验,研究改进了超参数,提高了准确率和 F1 分数。使用热图的可视化效果突出了 CNN 在疾病识别中对颜色、形状和纹理特征提取的依赖。FPGA 技术的集成展示了在实时、高性能植物病害分类方面的巨大进步,为精准农业和作物管理提供了潜在的好处。这项研究有助于FPGA加速深度学习在农业技术中的应用,应对植物健康监测和促进可持续农业实践方面的挑战。
{"title":"CNN based plant disease identification using PYNQ FPGA","authors":"Vivek Karthick Perumal ,&nbsp;Supriyaa T ,&nbsp;Santhosh P R ,&nbsp;Dhanasekaran S","doi":"10.1016/j.sasc.2024.200088","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200088","url":null,"abstract":"<div><p>This research presents a novel approach for plant disease identification utilizing Convolutional Neural Networks (CNNs) and the PYNQ FPGA platform. The study leverages the parallel processing capabilities of FPGAs to accelerate CNN inference, aiming to enhance the efficiency of plant disease detection in agricultural settings. The implementation involves optimizing the CNN architecture for deployment on the PYNQ FPGA, considering factors such as image size and learning rates. Through experimentation, the research refines hyper parameters, achieving improved accuracy and F1 scores. Visualizations using heat maps highlight the CNN's reliance on color, shape, and texture for feature extraction in disease identification. The integration of FPGA technology demonstrates promising advancements in real-time, high-performance plant disease classification, offering potential benefits for precision agriculture and crop management. This research contributes to the growing field of FPGA-accelerated deep learning applications in agro technology, addressing challenges in plant health monitoring and fostering sustainable agricultural practices.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200088"},"PeriodicalIF":0.0,"publicationDate":"2024-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000176/pdfft?md5=2f62ffd93970e4cfa9b45e376c6ca258&pid=1-s2.0-S2772941924000176-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140620635","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
People counting using IR-UWB radar sensors and machine learning techniques 使用 IR-UWB 雷达传感器和机器学习技术进行人员计数
Pub Date : 2024-04-04 DOI: 10.1016/j.sasc.2024.200095
Ange Joel Nounga Njanda , Jocelyn Edinio Zacko Gbadoubissa , Emanuel Radoi , Ado Adamou Abba Ari , Roua Youssef , Aminou Halidou

This study aims to detect and count people using impulse radio ultra-wideband radar and machine learning algorithms. However, the data quality, difficulty distinguishing human signals from noise and clutter, and instances where human presence is not detected make it challenging to count multiple humans. To overcome these challenges, we apply wavelet transformation to reduce signal size and use simple moving averages to eliminate noise. Next, we create features based on statistical and entropic properties of the signal and apply several classification algorithms, including ANN, Random Forest, KNN, XGBOOST, and multiple linear regression, to predict the number of people present. Our findings reveal that using the ANN classifier with the Daubechies 4 (db4) wavelet provides better results than other classifiers, with an accuracy rate of 99%. Additionally, filtering the data improves accuracy, and labeling the data after extracting essential characteristics significantly improves the model’s accuracy.

这项研究旨在利用脉冲无线电超宽带雷达和机器学习算法探测和计算人数。然而,数据质量、从噪声和杂波中区分人类信号的难度,以及未检测到人类存在的情况,使得对多个人类进行计数具有挑战性。为了克服这些挑战,我们采用小波变换来缩小信号大小,并使用简单的移动平均来消除噪音。接下来,我们根据信号的统计和熵属性创建特征,并应用多种分类算法(包括 ANN、随机森林、KNN、XGBOOST 和多元线性回归)来预测存在的人数。我们的研究结果表明,使用带有 Daubechies 4 (db4) 小波的 ANN 分类器比其他分类器效果更好,准确率高达 99%。此外,对数据进行过滤可提高准确率,而在提取基本特征后对数据进行标注可显著提高模型的准确率。
{"title":"People counting using IR-UWB radar sensors and machine learning techniques","authors":"Ange Joel Nounga Njanda ,&nbsp;Jocelyn Edinio Zacko Gbadoubissa ,&nbsp;Emanuel Radoi ,&nbsp;Ado Adamou Abba Ari ,&nbsp;Roua Youssef ,&nbsp;Aminou Halidou","doi":"10.1016/j.sasc.2024.200095","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200095","url":null,"abstract":"<div><p>This study aims to detect and count people using impulse radio ultra-wideband radar and machine learning algorithms. However, the data quality, difficulty distinguishing human signals from noise and clutter, and instances where human presence is not detected make it challenging to count multiple humans. To overcome these challenges, we apply wavelet transformation to reduce signal size and use simple moving averages to eliminate noise. Next, we create features based on statistical and entropic properties of the signal and apply several classification algorithms, including ANN, Random Forest, KNN, XGBOOST, and multiple linear regression, to predict the number of people present. Our findings reveal that using the ANN classifier with the Daubechies 4 (db4) wavelet provides better results than other classifiers, with an accuracy rate of 99%. Additionally, filtering the data improves accuracy, and labeling the data after extracting essential characteristics significantly improves the model’s accuracy.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200095"},"PeriodicalIF":0.0,"publicationDate":"2024-04-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000243/pdfft?md5=157f931722794a82b7c54f187d1d02cb&pid=1-s2.0-S2772941924000243-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140533340","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Design of fruit fly optimization algorithm based on Gaussian distribution and its application to image processing 基于高斯分布的果蝇优化算法设计及其在图像处理中的应用
Pub Date : 2024-04-02 DOI: 10.1016/j.sasc.2024.200090
Huiying Jia

The Fruit Fly Optimization Algorithm (FOA) has strong applicability, which can be optimized directly after the objective is determined not by building a complex model. Due to the problems of the algorithm such as easy prematureness, low solution accuracy, and easy to fall into local optimality. Therefore, the Gaussian Distribution Fruit Fly Optimization Algorithm (GaussFOA) based on Gaussian distribution was first proposed to solve the shortcomings of FOA. Then GaussFOA was applied to image segmentation processing. Finally, the experimental results were compared with FOA, the improved Fruit Fly Optimization Algorithm with Changing Step and Strategy (CSSFOA), and the Linear Generation Mechanism of Candidate Solution of Fruit Fly Optimization Algorithm (LGMSFOA). The results showed that GaussFOA had 100 % success rate compared with FOA, CSSFOA, and LGMSFOA under the same function. This algorithm also had the best finding mean and standard deviation. The low and high threshold division was compared in terms of the number of segmentation thresholds. The GaussFOA had the best value of both the average and the standard deviation of the search for merit. The segmentation results under high threshold were more obvious when compared with the segmentation results of low threshold GaussFOA. The image immunity of GaussFOA was 8.57 %, 10 %, and 29.97 % higher than that of FOA, Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). This indicated that the model constructed based on GaussFOA had improved the image segmentation effect and stability compared with other algorithms. The findings of the research can offer a new path for the processing techniques of images.

果蝇优化算法(FOA)具有很强的适用性,它可以在目标确定后直接进行优化,而不需要建立复杂的模型。由于该算法存在易早熟、求解精度低、易陷入局部最优等问题。因此,首先提出了基于高斯分布的高斯分布果蝇优化算法(Gaussian Distribution Fruit Fly Optimization Algorithm,GaussFOA)来解决 FOA 的缺点。然后,将 GaussFOA 应用于图像分割处理。最后,实验结果与 FOA、改进的改变步骤和策略的果蝇优化算法(CSSFOA)和果蝇优化算法候选解的线性生成机制(LGMSFOA)进行了比较。结果表明,在相同函数下,高斯FOA与FOA、CSSFOA和LGMSFOA相比,成功率均为100%。该算法的平均值和标准偏差也最好。在分割阈值数方面,对低阈值和高阈值划分进行了比较。GaussFOA 的搜索平均值和标准偏差都是最好的。与低阈值 GaussFOA 的分割结果相比,高阈值下的分割结果更为明显。与 FOA、粒子群优化(PSO)和遗传算法(GA)相比,GaussFOA 的图像抗干扰度分别高出 8.57%、10% 和 29.97%。这表明,与其他算法相比,基于高斯FOA构建的模型提高了图像分割效果和稳定性。该研究成果可为图像处理技术提供一条新的途径。
{"title":"Design of fruit fly optimization algorithm based on Gaussian distribution and its application to image processing","authors":"Huiying Jia","doi":"10.1016/j.sasc.2024.200090","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200090","url":null,"abstract":"<div><p>The Fruit Fly Optimization Algorithm (FOA) has strong applicability, which can be optimized directly after the objective is determined not by building a complex model. Due to the problems of the algorithm such as easy prematureness, low solution accuracy, and easy to fall into local optimality. Therefore, the Gaussian Distribution Fruit Fly Optimization Algorithm (GaussFOA) based on Gaussian distribution was first proposed to solve the shortcomings of FOA. Then GaussFOA was applied to image segmentation processing. Finally, the experimental results were compared with FOA, the improved Fruit Fly Optimization Algorithm with Changing Step and Strategy (CSSFOA), and the Linear Generation Mechanism of Candidate Solution of Fruit Fly Optimization Algorithm (LGMSFOA). The results showed that GaussFOA had 100 % success rate compared with FOA, CSSFOA, and LGMSFOA under the same function. This algorithm also had the best finding mean and standard deviation. The low and high threshold division was compared in terms of the number of segmentation thresholds. The GaussFOA had the best value of both the average and the standard deviation of the search for merit. The segmentation results under high threshold were more obvious when compared with the segmentation results of low threshold GaussFOA. The image immunity of GaussFOA was 8.57 %, 10 %, and 29.97 % higher than that of FOA, Particle Swarm Optimization (PSO), and Genetic Algorithm (GA). This indicated that the model constructed based on GaussFOA had improved the image segmentation effect and stability compared with other algorithms. The findings of the research can offer a new path for the processing techniques of images.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200090"},"PeriodicalIF":0.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S277294192400019X/pdfft?md5=524fc28108ade5ccd6d627a5636840e6&pid=1-s2.0-S277294192400019X-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140557907","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
VR interactive input system based on INS and binocular vision fusion 基于 INS 和双目视觉融合的 VR 交互式输入系统
Pub Date : 2024-04-02 DOI: 10.1016/j.sasc.2024.200089
Hongxia Zhao, Bei Wang

In virtual reality interactive input systems, real-time and accurate spatial position and pose measurement is key to achieving a natural user interface. This study explores the application of inertial measurement units and binocular vision fusion technology in virtual reality interactive input systems, with the aim of improving the tracking accuracy of the system through optimized pose models and visual algorithms. A virtual reality measurement technology that integrates inertial measurement units and binocular vision is proposed by using an improved Kalman filtering algorithm to process inertial measurement units data, and combining it with the SURF algorithm optimized binocular vision system. Experimental results showed that fusion technology could reduce sensor noise and bias, improve the accuracy of pose estimation, and promote stable and robust motion tracking in virtual reality systems. In the angle range of -90 ° to 90 °, the average absolute error of the fusion system compared to the simple inertial measurement units pose calculation decreased from 3.371 ° to 1.369 ° In the experiment of measuring distance with a binocular vision system, the average absolute error value decreased to 1.532 mm, and the error range of the marker within the distance range of 500 mm to 650 mm was controlled within -1.3 mm to 1.2 mm. This study provides an effective solution for achieving high-precision virtual reality interactive input systems and is meaningful for the advancement of virtual reality technology.

在虚拟现实交互式输入系统中,实时准确的空间位置和姿态测量是实现自然用户界面的关键。本研究探讨了惯性测量单元和双目视觉融合技术在虚拟现实交互式输入系统中的应用,旨在通过优化姿势模型和视觉算法提高系统的跟踪精度。通过使用改进的卡尔曼滤波算法处理惯性测量单元数据,并结合 SURF 算法优化双目视觉系统,提出了一种融合惯性测量单元和双目视觉的虚拟现实测量技术。实验结果表明,融合技术可以降低传感器噪声和偏差,提高姿态估计的准确性,促进虚拟现实系统中稳定和鲁棒的运动跟踪。在-90°到90°的角度范围内,融合系统与简单惯性测量单元姿态计算相比,平均绝对误差从3.371°下降到1.369°。在用双目视觉系统测量距离的实验中,平均绝对误差值下降到1.532毫米,在500毫米到650毫米的距离范围内,标记的误差范围控制在-1.3毫米到1.2毫米之内。这项研究为实现高精度虚拟现实交互式输入系统提供了有效的解决方案,对虚拟现实技术的发展具有重要意义。
{"title":"VR interactive input system based on INS and binocular vision fusion","authors":"Hongxia Zhao,&nbsp;Bei Wang","doi":"10.1016/j.sasc.2024.200089","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200089","url":null,"abstract":"<div><p>In virtual reality interactive input systems, real-time and accurate spatial position and pose measurement is key to achieving a natural user interface. This study explores the application of inertial measurement units and binocular vision fusion technology in virtual reality interactive input systems, with the aim of improving the tracking accuracy of the system through optimized pose models and visual algorithms. A virtual reality measurement technology that integrates inertial measurement units and binocular vision is proposed by using an improved Kalman filtering algorithm to process inertial measurement units data, and combining it with the SURF algorithm optimized binocular vision system. Experimental results showed that fusion technology could reduce sensor noise and bias, improve the accuracy of pose estimation, and promote stable and robust motion tracking in virtual reality systems. In the angle range of -90 ° to 90 °, the average absolute error of the fusion system compared to the simple inertial measurement units pose calculation decreased from 3.371 ° to 1.369 ° In the experiment of measuring distance with a binocular vision system, the average absolute error value decreased to 1.532 mm, and the error range of the marker within the distance range of 500 mm to 650 mm was controlled within -1.3 mm to 1.2 mm. This study provides an effective solution for achieving high-precision virtual reality interactive input systems and is meaningful for the advancement of virtual reality technology.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200089"},"PeriodicalIF":0.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000188/pdfft?md5=ce5a361b0ba460fbce8ef186f3229a7b&pid=1-s2.0-S2772941924000188-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140549588","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Learning path planning methods based on learning path variability and ant colony optimization 基于学习路径可变性和蚁群优化的学习路径规划方法
Pub Date : 2024-04-02 DOI: 10.1016/j.sasc.2024.200091
Jing Zhao , Haitao Mao , Panpan Mao , Junyong Hao

With the advancement of education information, the scale of online education has been expanding, which brings challenges to students' learning path planning, i.e., course and learning method planning. To address the limitations of learning path planning such as insufficient personalization, the study proposes a learning path planning method based on learning path variability and ant colony optimization. First, dynamic time regularization is used to obtain learning path variability, and the K-means algorithm is used to classify students' learning types. Subsequently, an ant colony optimization algorithm is used to generate learning paths. Finally, the effectiveness of the method is tested. The results show that the loss value of the ant colony optimization algorithm converges to a minimum value of 0.1, which has the best stability of the loss function curve and the fastest convergence speed compared to other algorithms. Under the same experimental environment, the accuracy of the algorithm is as high as 0.9, which is conducive to the search for the optimal solution. The path planning method designed by the research can effectively grasp the learning characteristics and habits of students, and the accurate classification degree can reach 96.6%. With this learning path planning method, the average video learning time of students reaches a maximum of 80 min, while the average completion rate of students' course objectives is stable at 90%, which is about 20% higher than that of the GA-based learning path planning method. The method can significantly improve academic performance and educational outcomes. The method thus grasps the type of student learning, stimulates students' interest in learning, improves the effect of online learning, helps to promote education informatization and provides a boost to the deep reform of education.

随着教育信息化的发展,在线教育的规模不断扩大,这给学生的学习路径规划,即课程和学习方法规划带来了挑战。针对学习路径规划个性化不足等局限性,本研究提出了一种基于学习路径可变性和蚁群优化的学习路径规划方法。首先,利用动态时间正则化获得学习路径可变性,并利用 K-means 算法对学生的学习类型进行分类。随后,使用蚁群优化算法生成学习路径。最后,测试了该方法的有效性。结果表明,蚁群优化算法的损失值收敛到最小值 0.1,与其他算法相比,损失函数曲线的稳定性最好,收敛速度最快。在相同的实验环境下,该算法的精度高达 0.9,有利于寻找最优解。研究设计的路径规划方法能有效把握学生的学习特点和习惯,分类准确率可达 96.6%。采用这种学习路径规划方法,学生的平均视频学习时间最多可达 80 分钟,学生课程目标的平均完成率稳定在 90%,比基于 GA 的学习路径规划方法高出约 20%。该方法能明显提高学习成绩和教学效果。该方法把握了学生的学习类型,激发了学生的学习兴趣,提高了在线学习的效果,有助于推进教育信息化,为深化教育改革提供助力。
{"title":"Learning path planning methods based on learning path variability and ant colony optimization","authors":"Jing Zhao ,&nbsp;Haitao Mao ,&nbsp;Panpan Mao ,&nbsp;Junyong Hao","doi":"10.1016/j.sasc.2024.200091","DOIUrl":"https://doi.org/10.1016/j.sasc.2024.200091","url":null,"abstract":"<div><p>With the advancement of education information, the scale of online education has been expanding, which brings challenges to students' learning path planning, i.e., course and learning method planning. To address the limitations of learning path planning such as insufficient personalization, the study proposes a learning path planning method based on learning path variability and ant colony optimization. First, dynamic time regularization is used to obtain learning path variability, and the K-means algorithm is used to classify students' learning types. Subsequently, an ant colony optimization algorithm is used to generate learning paths. Finally, the effectiveness of the method is tested. The results show that the loss value of the ant colony optimization algorithm converges to a minimum value of 0.1, which has the best stability of the loss function curve and the fastest convergence speed compared to other algorithms. Under the same experimental environment, the accuracy of the algorithm is as high as 0.9, which is conducive to the search for the optimal solution. The path planning method designed by the research can effectively grasp the learning characteristics and habits of students, and the accurate classification degree can reach 96.6%. With this learning path planning method, the average video learning time of students reaches a maximum of 80 min, while the average completion rate of students' course objectives is stable at 90%, which is about 20% higher than that of the GA-based learning path planning method. The method can significantly improve academic performance and educational outcomes. The method thus grasps the type of student learning, stimulates students' interest in learning, improves the effect of online learning, helps to promote education informatization and provides a boost to the deep reform of education.</p></div>","PeriodicalId":101205,"journal":{"name":"Systems and Soft Computing","volume":"6 ","pages":"Article 200091"},"PeriodicalIF":0.0,"publicationDate":"2024-04-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2772941924000206/pdfft?md5=9778c7fea541c4b0203e9c7d5156b2e5&pid=1-s2.0-S2772941924000206-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140535012","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Systems and Soft Computing
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1