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...
详细信息
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 th...
详细信息
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.
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 segmen...
详细信息
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...
详细信息
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.
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 Labe...
详细信息
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.
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 ...
详细信息
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...
详细信息
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
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 consumpt...
详细信息
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.
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 method...
详细信息
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 co...
详细信息
暂无评论