检索结果-内蒙古大学图书馆

Infield disease detection in citrus plants: integrating semantic segmentation and dynamic deep learning object detection model for enhanced agricultural yield

引用

Neural computing and Applications 2024年第35期36卷 22485-22510页

作者： Rani, N. Shobha Krishna, Arun Sri Sunag, M. Sangamesha, M.A. Pushpa, B.R. University Bengaluru India Department of Computer Science School of Computing Amrita Vishwa Vidyapeetham Mysuru India Department of Chemistry The National Institute of Engineering Mysuru India

Simultaneous and dynamic detection of diseases from infield images of citrus plants is the primary objective of this investigation. Refraining from discarding the disease-related issues would reduce agricultural yield and production, resulting in significant crop loss and economic instability. computer Vision offers an inexpensive and efficient solution for detecting and predicting multiple diseases from infield images of citrus plants in various stages of plant growth. This study aims to perform simultaneous detection and prediction of cankers, mites, and nutritional deficiencies from infield images of citrus plants. For this purpose, over 4914 samples are annotated that are obtained from 441 image samples collected from orchards of citrus plants. Initially, the input image is subject to preprocessing followed by segmentation of prominent leaf regions and disease prediction. Contributions investigated in this work are two-fold: a deep semantic segmentation model named Dynamic U-Net is employed to extract prominent regions of interest, and a dynamic, lightweight object detection deep learning model for predicting diseases. From experimental outcomes, the segmentation efficiency is found to be 89.07% foreground accuracy, 0.7881 of IoU, and 0.9188 of the Dice coefficient. The object detection performance is quantified using the mapped metric, resulting in 0.85, 0.71, 0.64, and 0.27 efficiency concerning plant diseases, cankers, mites, and nutritional deficiency. As per the findings, the proposed approach is an effective solution to perform automated detection and prediction from infield images of citrus plants. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Citrus fruits

来源：评论

学校读者我要写书评

暂无评论

An Encoding-Decoding Framework Based on CNN for circ RNA-RBP Binding Sites Prediction

引用

Chinese Journal of Electronics 2024年第1期33卷 256-263页

作者： Yajing GUO Xiujuan LEI Yi PAN School of Computer Science Shaanxi Normal University Faculty of Computer Science and Control Engineering Shenzhen Institute of Advanced TechnologyChinese Academy of Sciences Department of Computer Science Georgia State University

Predicting RNA binding protein(RBP) binding sites on circular RNAs(circ RNAs) is a fundamental step to understand their interaction mechanism. Numerous computational methods are developed to solve this problem, but they cannot fully learn the features. Therefore, we propose circ-CNNED, a convolutional neural network(CNN)-based encoding and decoding framework. We first adopt two encoding methods to obtain two original matrices. We preprocess them using CNN before fusion. To capture the feature dependencies, we utilize temporal convolutional network(TCN) and CNN to construct encoding and decoding blocks, respectively. Then we introduce global expectation pooling to learn latent information and enhance the robustness of circ-CNNED. We perform circ-CNNED across 37 datasets to evaluate its effect. The comparison and ablation experiments demonstrate that our method is superior. In addition, motif enrichment analysis on four datasets helps us to explore the reason for performance improvement of circ-CNNED.

关键词： Circular RNAs (circRNAs) RNA binding proteins Convolutional neural network Temporal convolutional network Encoder-decoder network

来源：评论

学校读者我要写书评

暂无评论

Advanced U-Net++ Architecture for Precise Brain Tumor Segmentation in MRI Images: A Robust Solution for Medical Image Analysis

Advanced U-Net++ Architecture for Precise Brain Tumor Segmen...

引用

2024 IEEE International Conference on Signal Processing and Advance Research in computing, SPARC 2024

作者： Nair, Rekha R Babu, Tina Ramasamy, Gayatri Singh, Tripty Yuan, Xiaohui Alliance University Alliance School of Advanced Computing Department of Computer Science and Engineering Bengaluru India Amrita School of Computing Bengaluru Amrita Vishwavidyapeetham Department of Computer Science and Engineering India University of North Texas Department of Computer Science and Engineering DentonTX United States

ISBN: (纸本)9798350385199

Tumor segmentation in MRI images is a crucial process in medical imaging, aimed at accurately identifying and delineating tumor regions within the brain or other tissues. Hence proposed a modified U-Net++ based segmentation with predicted mask. To further improve the performance of the proposed method, incorporated additional layers into the U Net++ architecture. U-Net++ consists of Encoder Decoder and the encoder captures image content, while the decoder delineates object boundaries. U-Net++ excels in capturing both high-level and intricate details, which significantly boosts segmentation performance. This helps in accurate tumor segmentation of complex MRI images. To measure the effectiveness of the proposed model for segmentation and detection, Accuracy, Intersection over Union(IOU), Dice Coefficient and Area under the ROC Curve(AUC) scores are used. The proposed U-Net++ brought accuracy to 99 percent, which could significantly help in the process of accurate segmentation of human tissues. Accuracy of 39 % for IOU of 80, Dice Coefficient of 89%, and 33% for the test set. This is equivalent to 8% sensitivity and accuracy and AUC of 78. The proposed method can be used as an additional diagnosis aid to help doctors determine the suitability of the treatment and the changes occurring in the body during the development of the disease © 2024 IEEE.

关键词： Magnetic resonance imaging

来源：评论

学校读者我要写书评

暂无评论

Privacy-preserving explainable AI: a survey

引用

science China(Information sciences) 2025年第1期68卷 23-56页

作者： Thanh Tam NGUYEN Thanh Trung HUYNH Zhao REN Thanh Toan NGUYEN Phi Le NGUYEN Hongzhi YIN Quoc Viet Hung NGUYEN School of Information and Communication Technology Griffith University School of Computer and Communication Sciences Ecole Polytechnique Federale de Lausanne Faculty of Mathematics and Computer Science University of Bremen Faculty of Information Technology HUTECH University Department of Computer Science Hanoi University of Science and Technology School of Electrical Engineering and Computer Science The University of Queensland

As the adoption of explainable AI(XAI) continues to expand, the urgency to address its privacy implications intensifies. Despite a growing corpus of research in AI privacy and explainability, there is little attention on privacy-preserving model explanations. This article presents the first thorough survey about privacy attacks on model explanations and their countermeasures. Our contribution to this field comprises a thorough analysis of research papers with a connected taxonomy that facilitates the categorization of privacy attacks and countermeasures based on the targeted explanations. This work also includes an initial investigation into the causes of privacy leaks. Finally, we discuss unresolved issues and prospective research directions uncovered in our analysis. This survey aims to be a valuable resource for the research community and offers clear insights for those new to this domain. To support ongoing research, we have established an online resource repository, which will be continuously updated with new and relevant findings.

关键词： privacy-preserving explainable AI privacy attacks privacy defences PrivEx PPXAI

来源：评论

学校读者我要写书评

暂无评论

Answering reachability queries with ordered label constraints over labeled graphs

引用

Frontiers of computer science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

Improving agility in projects using machine learning algorithm

引用

Multimedia Tools and Applications 2024年第38期83卷 85987-86005页

作者： Varun, Janani Karthika, R.A. Department of Computer Science and Engineering Vels Institute of Science Technology and Advanced Studies Chennai India Department of Computer Science and Engineering Saveetha School of Engineering SIMATS Chennai India

All the software products developed will need testing to ensure the quality and accuracy of the product. It makes the life of testers much easier when they can optimize on the effort spent and predict defects for the upcoming modules in the Agile era. The functionality being discussed in this paper is to predict the defects using Random Forest Algorithm. Predictive analytics draws on information from the past to create forecasts about the outcomes of future events. Product team always have the difficulty in delivering the product as per schedule. As we are in the agile era, the requirement keeps changing and team is unsure on upcoming releases. Prediction helps the team to focus on the complex and error prone modules in upcoming releases. The Predictive analytics model designed, can predict defects with an accuracy rate of 88% with the help of historical data. By predicting, testers can focus on the module where there are a greater number of defects predicted by the model and left shift the delivery. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Predictive analytics

来源：评论

学校读者我要写书评

暂无评论

Graph Convolutional Networks for SEO: A Comprehensive Framework for Healthcare Information Ranking

引用

Journal of The Institution of Engineers (India): Series B 2025年 1-16页

作者： RR, Prianka M, Vedaraj R, Anto Arockia Rosaline Department of Artificial Intelligence and Machine Learning New Horizon College of Engineering Bangalore India Department of Computer Science and Engineering R.M.D. Engineering College RSM Nagar Kavaraipettai Thiruvallur India Department of Computing Technologies School of Computing SRM Institute of Science and Technology Kattankulathur Campus Chennai India

Internet’s remarkable surge, ubiquitous accessibility, and serviceability have increased users’ dependency on web services for fast search and recovery of wide sources of information. Search engine optimization (SEO) has become paramount in healthcare industries, which helps patients enhance and understand their health status based on their records. In the context of healthcare, it is more significant to improve search results from specific keywords related to clinical conditions, treatments, and healthcare services. So, this research work proposes a Graph Convolutional Network (GCN)-based Search Engine Optimization (SEO) algorithm for healthcare applications. The algorithm utilizes two distinct datasets: MIMIC-III Clinical Database and Consumer Health Search Queries to optimize search engine rankings for health related queries. Following data acquisition, data pre-processing is performed for better enrichment of analysis. The preprocessing steps involve data cleaning, data integration, feature engineering, and knowledge graph construction procedures to remove noisy data, integrate medical data with user search behavior, compute significant features, and construct knowledge graphs, correspondingly. The relation between the data entities is examined within constructed graph through link analysis. The pre-processed data including medical knowledge weights, content relevance scores, and user interaction signals are processed further on GCN model with Adam-tuned weights and bias for ranking healthcare data based on relevance score in response to user query using cosine similarity. The search relevance estimation indicators namely recall, precision, f1-score, and normalized discounted cumulative gain (NDCG) are computed to measure search optimization performance. The proposed GCN-SEO approach benchmarked its effectiveness over existing methods in optimizing web searches related to healthcare with a high performance rate of 95.75% accuracy and 48.25 s dwell time. This sho

关键词： Clinical research

来源：评论

学校读者我要写书评

暂无评论

Optimized Consensus for Blockchain in Internet of Things Networks via Reinforcement Learning

引用

Tsinghua science and Technology 2023年第6期28卷 1009-1022页

作者： Yifei Zou Zongjing Jin Yanwei Zheng Dongxiao Yu Tian Lan Institute of Intelligent Computing School of Computer Science and TechnologyShandong UniversityQingdao 266237China Department of Electrical and Computer Engineering George Washington UniversityWashingtonDC 20052USA

Most blockchain systems currently adopt resource-consuming protocols to achieve consensus between miners;for example,the Proof-of-Work(PoW)and Practical Byzantine Fault Tolerant(PBFT)schemes,which have a high consumption of computing/communication resources and usually require reliable communications with bounded ***,these protocols may be unsuitable for Internet of Things(IoT)networks because the IoT devices are usually lightweight,battery-operated,and deployed in an unreliable wireless ***,this paper studies an efficient consensus protocol for blockchain in IoT networks via reinforcement ***,the consensus protocol in this work is designed on the basis of the Proof-of-Communication(PoC)scheme directly in a single-hop wireless network with unreliable communications.A distributed MultiAgent Reinforcement Learning(MARL)algorithm is proposed to improve the efficiency and fairness of consensus for miners in the blockchain *** this algorithm,each agent uses a matrix to depict the efficiency and fairness of the recent consensus and tunes its actions and rewards carefully in an actor-critic framework to seek effective *** results from the simulation show that the fairness of consensus in the proposed algorithm is guaranteed,and the efficiency nearly reaches a centralized optimal solution.

关键词： consensus in blockchain Proof-of-Communication(PoC) MultiAgent Reinforcement Learning(MARL) Internet of Things(IoT)networks

来源：评论

学校读者我要写书评

暂无评论

PeriodicMFD: A Periodic-based Framework for Multi-source Fault Diagnosis

引用

IEEE Transactions on Transportation Electrification 2025年第3期11卷 7252-7260页

作者： Zheng, Jianbo Yang, Chao Zhang, Tairui Jiang, Bin Fan, Xuhui Wu, Xiao-Ming Shao, Haidong Hunan University College of Computer Science and Electronic Engineering Changsha China Macquarie University School of Computing Australia Sun Yat-sen University School of Computer Science and Engineering China Hunan University College of Mechanical and Vehicle Engineering Changsha China

Cross-speed bearing fault diagnosis based on multiple source domains and their data enables high-performance condition monitoring for variable-speed equipment, such as engines and turbines. Current multi-source methods typically employ a fixed-length sampling strategy to construct samples and then align the distributions of these samples from different domains. However, these methods neglect the inherent periodic characteristics of bearing data, resulting in incomplete or redundant periodic features in the samples. To address this challenge, we propose a periodic-based framework, PeriodicMFD, for multi-source cross-speed fault diagnosis, which ensures complete periodic information. Our PeriodicMFD framework begins with a periodic sampling strategy designed to construct periodic samples that effectively capture periodic features while maintaining their periodic integrity. Nevertheless, periodic samples from different domains exhibit inconsistencies at both the sample and domain levels. To reconcile these inconsistencies, we introduce sample-level matching to address inconsistencies in feature dimensions and fault patterns among samples from various domains. Additionally, we propose domain-level alignment to handle inconsistencies in space and distribution across different domains. Extensive experiments across three datasets highlight the effectiveness of the PeriodicMFD framework, with a stable average accuracy of 99.55%. © 2015 IEEE.

关键词： Fault detection

来源：评论

学校读者我要写书评

暂无评论

Enhancing pre-trained models for text summarization: a multi-objective genetic algorithm optimization approach

引用

Multimedia Tools and Applications 2024年 1-17页

作者： Mohan, G. Bharathi Kumar, R. Prasanna Elakkiya, R. Department of Computer Science and Engineering Amrita School of Computing Amrita Vishwa Vidyapeetham Chennai India Birla Institute of Technology and Science Dubai345055 United Arab Emirates

Pre-trained language models have significantly advanced text summarization by leveraging extensive pre-training data to enhance performance. Many cutting-edge models undergo an initial pre-training phase on a large corpus before being fine-tuned specifically for text summarization tasks. The challenge arises when the limited data available for these summarization tasks and the high complexity of the models lead to aggressive fine-tuning, which can cause the models to over fit the training data and fail to generalize well to new, unseen data. To address these challenges, the study proposes a multi-objective based Genetic Algorithm (MOGA) approach for optimizing pre-trained models for summarization The proposed approach first compares the performance of various pre-trained models by fine-tuning them with the CNN/Daily Mail dataset. Secondly, the proposed Multi-Objective Genetic Algorithm (MOGA) is applied to all validated pre-trained models and compared using a statistical approach. Experimental results reveal that Pre-training with Extracted Gap-sentences for Abstractive Summarization Sequence-to-sequence (PEGASUS) model performs best among the pre-trained models. Further optimization with the proposed MOGA method yields even better results, with the optimized model achieving a Recall-Oriented Understudy for Gisting Evaluation) ROUGE-1 score of 0.514, a ROUGE-2 score of 0.4, and a ROUGE-L score of 0.5. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Genetic algorithms

来源：评论

学校读者我要写书评

暂无评论

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

建议与咨询 留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案： 新增检索档案 确定 取消

请选择收藏分类： 新增自定义分类 确定 取消

通借通还

建议与咨询留下您的常用邮箱和电话号码，以便我们向您反馈解决方案和替代方法

请选择保存的检索档案：

请选择收藏分类：