PeerJ Computer Science最新文献

{"title":"General retrieval network model for multi-class plant leaf diseases based on hashing.","authors":"Zhanpeng Yang, Jun Wu, Xianju Yuan, Yaxiong Chen, Yanxin Guo","doi":"10.7717/peerj-cs.2545","DOIUrl":"10.7717/peerj-cs.2545","url":null,"abstract":"<p><p>Traditional disease retrieval and localization for plant leaves typically demand substantial human resources and time. In this study, an intelligent approach utilizing deep hash convolutional neural networks (DHCNN) is presented to address these challenges and enhance retrieval performance. By integrating a collision-resistant hashing technique, this method demonstrates an improved ability to distinguish highly similar disease features, achieving over 98.4% in both precision and true positive rate (TPR) for single-plant disease retrieval on crops like apple, corn and tomato. For multi-plant disease retrieval, the approach further achieves impressive Precision of 99.5%, TPR of 99.6% and F-score of 99.58% on the augmented PlantVillage dataset, confirming its robustness in handling diverse plant diseases. This method ensures precise disease retrieval in demanding conditions, whether for single or multiple plant scenarios.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2545"},"PeriodicalIF":3.5,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11622960/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803345","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Classifying software security requirements into confidentiality, integrity, and availability using machine learning approaches.","authors":"Taghreed Bagies","doi":"10.7717/peerj-cs.2554","DOIUrl":"10.7717/peerj-cs.2554","url":null,"abstract":"<p><p>Security requirements are considered one of the most important non-functional requirements of software. The CIA (confidentiality, integrity, and availability) triad forms the basis for the development of security systems. Each dimension is expressed as having many security requirements that should be designed, implemented, and tested. However, requirements are written in a natural language and may suffer from ambiguity and inconsistency, which makes it harder to distinguish between different security dimensions. Recognizing the security dimensions in a requirements document should facilitate tracing the requirements and ensuring that a dimension has been implemented in a software system. This process should be automated to reduce time and effort for software engineers. In this paper, we propose to classify the security requirements into CIA triads using Term frequency-inverse document frequency and sentence-transformer embedding as two different technologies for feature extraction. For both techniques, we developed five models by using five well-known machine learning algorithms: (1) support vector machine (SVM), (2) K-nearest neighbors (KNN), (3) Random Forest (RF), (4) gradient boosting (GB), and (5) Bernoulli Naive Bayes (BNB). Also, we developed a web interface that facilitates real-time analysis and classifies security requirements into CIA triads. Our results revealed that SVM with the sentence-transformer technique outperformed all classifiers by 87% accuracy in predicting a type of security dimension.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2554"},"PeriodicalIF":3.5,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623117/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803371","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Application of collaborative filtering algorithm based on time decay function in music teaching recommendation model.","authors":"Yina Zhao, Xiang Hua","doi":"10.7717/peerj-cs.2533","DOIUrl":"10.7717/peerj-cs.2533","url":null,"abstract":"<p><p>To address the issues of data sparsity, scalability, and cold start in the traditional teaching resource recommendation process, this paper presents an enhanced collaborative filtering (CF) recommendation algorithm incorporating a time decay (TD) function. By aligning with the human memory forgetting curve, the TD function is employed as a weighting factor, enabling the calculation of similarity and user preferences constrained by the TD, thus amplifying the weight of user interest over a short period and achieving the integration of short-term and long-term interests. The results indicate that the RMSE of the proposed combined recommendation algorithm (TD-CF) is only 8.95 when the number of recommendations reaches 100, which is significantly lower than the comparison model, which exhibits higher accuracy across different recommended items, effectively utilizing music teaching resources and user characteristics to deliver more precise recommendations.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2533"},"PeriodicalIF":3.5,"publicationDate":"2024-11-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11639207/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142830802","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"A novel deep learning model for predicting marine pollution for sustainable ocean management.","authors":"Michael Onyema Edeh, Surjeet Dalal, Musaed Alhussein, Khursheed Aurangzeb, Bijeta Seth, Kuldeep Kumar","doi":"10.7717/peerj-cs.2482","DOIUrl":"10.7717/peerj-cs.2482","url":null,"abstract":"<p><p>Climate change has become a major source of concern to the global community. The steady pollution of the environment including our waters is gradually increasing the effects of climate change. The disposal of plastics in the seas alters aquatic life. Marine plastic pollution poses a grave danger to the marine environment and the long-term health of the ocean. Though technology is also seen as one of the contributors to climate change many aspects of it are being applied to combat climate-related disasters and to raise awareness about the need to protect the planet. This study investigated the amount of pollution in marine and undersea leveraging the power of artificial intelligence to identify and categorise marine and undersea plastic wastes. The classification was done using two types of machine learning algorithms: two-step clustering and a fully convolutional network (FCN). The models were trained using Kaggle's plastic location data, which was acquired <i>in situ</i>. An experimental test was conducted to validate the accuracy and performance of the trained models and the results were promising when compared to other conventional approaches and models. The model was used to create and test an automated floating plastic detection system in the required timeframe. In both cases, the trained model was able to correctly identify the floating plastic and achieved an accuracy of 98.38%. The technique presented in this study can be a crucial instrument for automatic detection of plastic garbage in the ocean thereby enhancing the war against marine pollution.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2482"},"PeriodicalIF":3.5,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11622943/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803116","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Introducing ProsperNN-a Python package for forecasting with neural networks.","authors":"Nico Beck, Julia Schemm, Claudia Ehrig, Benedikt Sonnleitner, Ursula Neumann, Hans Georg Zimmermann","doi":"10.7717/peerj-cs.2481","DOIUrl":"10.7717/peerj-cs.2481","url":null,"abstract":"<p><p>We present the package prosper_nn, that provides four neural network architectures dedicated to time series forecasting, implemented in PyTorch. In addition, prosper_nn contains the first sensitivity analysis suitable for recurrent neural networks (RNN) and a heatmap to visualize forecasting uncertainty, which was previously only available in Java. These models and methods have successfully been in use in industry for two decades and were used and referenced in several scientific publications. However, only now we make them publicly available on GitHub, allowing researchers and practitioners to benchmark and further develop them. The package is designed to make the models easily accessible, thereby enabling research and application in various fields like demand and macroeconomic forecasting.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2481"},"PeriodicalIF":3.5,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623060/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142802950","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"IMU-aided adaptive mesh-grid based video motion deblurring.","authors":"Ahmet Arslan, Gokhan Koray Gultekin, Afsar Saranli","doi":"10.7717/peerj-cs.2540","DOIUrl":"10.7717/peerj-cs.2540","url":null,"abstract":"<p><p>Motion blur is a problem that degrades the visual quality of images for human perception and also challenges computer vision tasks. While existing studies mostly focus on deblurring algorithms to remove uniform blur due to their computational efficiency, such approaches fail when faced with non-uniform blur. In this study, we propose a novel algorithm for motion deblurring that utilizes an adaptive mesh-grid approach to manage non-uniform motion blur with a focus on reducing the computational cost. The proposed method divides the image into a mesh-grid and estimates the blur point spread function (PSF) using an inertial sensor. For each video frame, the size of the grid cells is determined adaptively according to the in-frame spatial variance of blur magnitude which is a proposed metric for the blur non-uniformity in the video frame. The adaptive mesh-size takes smaller values for higher variances, increasing the spatial accuracy of the PSF estimation. Two versions of the adaptive mesh-size algorithm are studied, optimized for either best quality or balanced performance and computation cost. Also, a trade-off parameter is defined for changing the mesh-size according to application requirements. The experiments, using real-life motion data combined with simulated motion blur demonstrate that the proposed adaptive mesh-size algorithm can achieve 5% increase in PSNR quality gain together with a 19% decrease in computation time on the average when compared to the constant mesh-size method.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2540"},"PeriodicalIF":3.5,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11622971/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803410","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Enhanced related-key differential neural distinguishers for SIMON and SIMECK block ciphers.","authors":"Gao Wang, Gaoli Wang","doi":"10.7717/peerj-cs.2566","DOIUrl":"https://doi.org/10.7717/peerj-cs.2566","url":null,"abstract":"<p><p>At CRYPTO 2019, Gohr pioneered the application of deep learning to differential cryptanalysis and successfully attacked the 11-round NSA block cipher Speck32/64 with a 7-round and an 8-round single-key differential neural distinguisher. Subsequently, Lu et al. (DOI 10.1093/comjnl/bxac195) presented the improved related-key differential neural distinguishers against the SIMON and SIMECK. Following this work, we provide a framework to construct the enhanced related-key differential neural distinguisher for SIMON and SIMECK. In order to select input differences efficiently, we introduce a method that leverages weighted bias scores to approximate the suitability of various input differences. Building on the principles of the basic related-key differential neural distinguisher, we further propose an improved scheme to construct the enhanced related-key differential neural distinguisher by utilizing two input differences, and obtain superior accuracy than Lu et al. for both SIMON and SIMECK. Specifically, our meticulous selection of input differences yields significant accuracy improvements of 3% and 1.9% for the 12-round and 13-round basic related-key differential neural distinguishers of SIMON32/64. Moreover, our enhanced related-key differential neural distinguishers surpass the basic related-key differential neural distinguishers. For 13-round SIMON32/64, 13-round SIMON48/96, and 14-round SIMON64/128, the accuracy of their related-key differential neural distinguishers increases from 0.545, 0.650, and 0.580 to 0.567, 0.696, and 0.618, respectively. For 15-round SIMECK32/64, 19-round SIMECK48/96, and 22-round SIMECK64/128, the accuracy of their neural distinguishers is improved from 0.547, 0.516, and 0.519 to 0.568, 0.523, and 0.526, respectively.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2566"},"PeriodicalIF":3.5,"publicationDate":"2024-11-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623040/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803356","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"An enhanced integrated fuzzy logic-based deep learning techniques (EIFL-DL) for the recommendation system on industrial applications.","authors":"Yasir Rafique, Jue Wu, Abdul Wahab Muzaffar, Bilal Rafique","doi":"10.7717/peerj-cs.2529","DOIUrl":"10.7717/peerj-cs.2529","url":null,"abstract":"<p><p>Industrial organizations are turning to recommender systems (RSs) to provide more personalized experiences to customers. This technology provides an efficient solution to the over-choice problem by quickly combing through large amounts of information and supplying recommendations that fit each user's individual preferences. It is quickly becoming an integral part of operations, as it yields successful and convenient results. This research provides an enhanced integrated fuzzy logic-based deep learning technique (EIFL-DL) for recent industrial challenges. Extracting useful insights and making appropriate suggestions in industrial settings is difficult due to the fast development of data. Traditional RSs often struggle to handle the complexity and uncertainty inherent in industrial data. To address these limitations, we propose an EIFL-DL framework that combines fuzzy logic and deep learning techniques to enhance recommendation accuracy and interpretability. The EIFL-DL framework leverages fuzzy logic to handle uncertainty and vagueness in industrial data. Fuzzy logic enables the modelling of imprecise and uncertain information, and the system is able to capture nuanced relationships and make more accurate recommendations. Deep learning techniques, on the other hand, excel at extracting complex patterns and features from large-scale data. By integrating fuzzy logic with deep learning, the EIFL-DL framework harnesses the strengths of both approaches to overcome the limitations of traditional RSs. The proposed framework consists of three main stages: data preprocessing, feature extraction, and recommendation generation. In the data preprocessing stage, industrial data is cleaned, normalized, and transformed into fuzzy sets to handle uncertainty. The feature extraction stage employs deep learning techniques, such as convolutional neural networks (CNNs) and recurrent neural networks (RNNs), to extract meaningful features from the preprocessed data. Finally, the recommendation generation stage utilizes fuzzy logic-based rules and a hybrid recommendation algorithm to generate accurate and interpretable recommendations for industrial applications.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2529"},"PeriodicalIF":3.5,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623200/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803161","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"Cloud-based configurable data stream processing architecture in rural economic development.","authors":"Haohao Chen, Fadi Al-Turjman","doi":"10.7717/peerj-cs.2547","DOIUrl":"10.7717/peerj-cs.2547","url":null,"abstract":"<p><strong>Purpose: </strong>This study aims to address the limitations of traditional data processing methods in predicting agricultural product prices, which is essential for advancing rural informatization to enhance agricultural efficiency and support rural economic growth.</p><p><strong>Methodology: </strong>The RL-CNN-GRU framework combines reinforcement learning (RL), convolutional neural network (CNN), and gated recurrent unit (GRU) to improve agricultural price predictions using multidimensional time series data, including historical prices, weather, soil conditions, and other influencing factors. Initially, the model employs a 1D-CNN for feature extraction, followed by GRUs to capture temporal patterns in the data. Reinforcement learning further optimizes the model, enhancing the analysis and accuracy of multidimensional data inputs for more reliable price predictions.</p><p><strong>Results: </strong>Testing on public and proprietary datasets shows that the RL-CNN-GRU framework significantly outperforms traditional models in predicting prices, with lower mean squared error (MSE) and mean absolute error (MAE) metrics.</p><p><strong>Conclusion: </strong>The RL-CNN-GRU framework contributes to rural informatization by offering a more accurate prediction tool, thereby supporting improved decision-making in agricultural processes and fostering rural economic development.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2547"},"PeriodicalIF":3.5,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623176/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803314","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

{"title":"HierbaNetV1: a novel feature extraction framework for deep learning-based weed identification.","authors":"Justina Michael, Thenmozhi Manivasagam","doi":"10.7717/peerj-cs.2518","DOIUrl":"10.7717/peerj-cs.2518","url":null,"abstract":"<p><p>Extracting the essential features and learning the appropriate patterns are the two core character traits of a convolution neural network (CNN). Leveraging the two traits, this research proposes a novel feature extraction framework code-named 'HierbaNetV1' that retrieves and learns effective features from an input image. Originality is brought by addressing the problem of varying-sized region of interest (ROI) in an image by extracting features using diversified filters. For every input sample, 3,872 feature maps are generated with multiple levels of complexity. The proposed method integrates low-level and high-level features thus allowing the model to learn intensive and diversified features. As a follow-up of this research, a crop-weed research dataset termed 'SorghumWeedDataset_Classification' is acquired and created. This dataset is tested on HierbaNetV1 which is compared against pre-trained models and state-of-the-art (SOTA) architectures. Experimental results show HierbaNetV1 outperforms other architectures with an accuracy of 98.06%. An ablation study and component analysis are conducted to demonstrate the effectiveness of HierbaNetV1. Validated against benchmark weed datasets, the study also exhibits that our suggested approach performs well in terms of generalization across a wide variety of crops and weeds. To facilitate further research, HierbaNetV1 weights and implementation are made accessible to the research community on GitHub. To extend the research to practicality, the proposed method is incorporated with a real-time application named HierbaApp that assists farmers in differentiating crops from weeds. Future enhancements for this research are outlined in this article and are currently underway.</p>","PeriodicalId":54224,"journal":{"name":"PeerJ Computer Science","volume":"10 ","pages":"e2518"},"PeriodicalIF":3.5,"publicationDate":"2024-11-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.ncbi.nlm.nih.gov/pmc/articles/PMC11623067/pdf/","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"142803360","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}