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

VKFQ:A Verifiable Keyword Frequency Query Framework with Local Differential Privacy in Blockchain

computers, Materials & Continua 2024年第3期78卷 4205-4223页

作者： Youlin Ji Bo Yin Ke Gu School of Computer and Communication Engineering Changsha University of Science and TechnologyChangsha410114China

With its untameable and traceable properties,blockchain technology has been widely used in the field of data *** to preserve individual privacy while enabling efficient data queries is one of the primary issues with secure data *** this paper,we study verifiable keyword frequency(KF)queries with local differential privacy in *** the numerical and the keyword attributes are present in data objects;the latter are sensitive and require privacy ***,prior studies in blockchain have the problem of trilemma in privacy protection and are unable to handle KF *** propose an efficient framework that protects data owners’privacy on keyword attributes while enabling quick and verifiable query processing for KF *** framework computes an estimate of a keyword’s frequency and is efficient in query time and verification object(VO)size.A utility-optimized local differential privacy technique is used for privacy *** data owner adds noise locally into data based on local differential privacy so that the attacker cannot infer the owner of the keywords while keeping the difference in the probability distribution of the KF within the privacy *** propose the VB-cm tree as the authenticated data structure(ADS).The VB-cm tree combines the Verkle tree and the Count-Min sketch(CM-sketch)to lower the VO size and query *** VB-cm tree uses the vector commitment to verify the query *** fixed-size CM-sketch,which summarizes the frequency of multiple keywords,is used to estimate the KF via hashing *** conduct an extensive evaluation of the proposed *** experimental results show that compared to theMerkle B+tree,the query time is reduced by 52.38%,and the VO size is reduced by more than one order of magnitude.

关键词： Security data sharing blockchain data query privacy protection

来源：评论

学校读者我要写书评

暂无评论

Hybrid optimization assisted deep ensemble classification framework for skin cancer detection

引用

Multimedia Tools and Applications 2025年第1期84卷 63-94页

作者： Pukhta, Irfan Rashid Rout, Ranjeet Kumar Department of Computer Science and Engineering National Institute of Technology Srinagar190006 India

In 2018, there were 1 million occurrences of non-melanoma cancer and 288,000 occurrences of malignant skin cancer (MM) recorded worldwide. Given the aging of the population and limited resources for medical care, a complete strategy to prevent skin cancer must include both practical detection and accurate diagnosis. Dermatologists and family physicians may find it challenging to identify skin cancer, particularly MM, at an early phase. The purpose of this paper is to suggest a paradigm for skin cancer detection, where pre-processing is the initial step for which median filter (MF) is employed. The pre-processed image undergoes segmentation, which is done by an Improved DBSCAN approach. Once the segmentation is over, features like "GLCM, Local Binary pattern (LBP), Local Vector Pattern (LVP), and Improved Center Symmetric Local Ternary Pattern (CSLTP)" are extracted. This is the final phase, where an ensemble classifier (EC) that combines the models like "Convolutional Neural network (CNN), Long Short Term Memory (LSTM), and Bidirectional Gated Recurrent Unit (Bi-GRU)" is deployed. Further, weights of CNN, Bi-GRU, and LSTM are tuned by Hawks Updated Blue Monkey Algorithm with Gaussian Map Randomness (HUBM-GMR) based hybrid optimization. The study will ultimately validate the HUBM-GMR model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Time Series Segmentation Network Based on Eddy Current Testing for Detecting Surface Metal Defects

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 528-538页

作者： Xiaorui Li Xiaojuan Ban Haoran Qiao Zhaolin Yuan Hong-Ning Dai Chao Yao Yu Guo Mohammad S.Obaidat George Q.Huang the School of Intelligence Science and Technology University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering the Key Laboratory of Intelligent Bionic Unmanned Systems and the Institute of Materials Intelligent Technology Liaoning Academy of Materials IEEE the Department of Computer Science Hong Kong Baptist University the School of Computer and Communication Engineering Key Laboratory of Advanced Materials and Devices for Post-Moore Chips Ministry of Education University of Science and Technology Beijing the Beijing Advanced Innovation Center for Materials Genome Engineering University of Science and Technology Beijing the School of Computer and Communication Engineering University of Science and Technology Beijing the King Abdullah Ⅱ School of Information Technology The University of Jordan the Department of Computational Intelligence the School of Computing SRM University the School of Engineering The Amity University The Hong Kong Polytechnic University

In high-risk industrial environments like nuclear power plants, precise defect identification and localization are essential for maintaining production stability and safety. However, the complexity of such a harsh environment leads to significant variations in the shape and size of the defects. To address this challenge, we propose the multivariate time series segmentation network(MSSN), which adopts a multiscale convolutional network with multi-stage and depth-separable convolutions for efficient feature extraction through variable-length templates. To tackle the classification difficulty caused by structural signal variance, MSSN employs logarithmic normalization to adjust instance distributions. Furthermore, it integrates classification with smoothing loss functions to accurately identify defect segments amid similar structural and defect signal subsequences. Our algorithm evaluated on both the Mackey-Glass dataset and industrial dataset achieves over 95% localization and demonstrates the capture capability on the synthetic dataset. In a nuclear plant's heat transfer tube dataset, it captures 90% of defect instances with75% middle localization F1 score.

关键词： Eddy current testing nondestructive testing semantic segmentation time series analysis

来源：评论

学校读者我要写书评

暂无评论

A threefold chaotic image encryption technique for efficacious image data protection

引用

International Journal of computers and Applications 2024年第11期46卷 974-982页

作者： Anwar, Shamama Srivastava, Anshuman Department of Computer Science and Engineering Birla Institute of Technology Ranchi India

With the profound use of digital contents in education and social media, multimedia content have become a prevalent means of communication and with such rapid increase, information security is still a major concern. This paper provides a summary of the techniques of securing image data focusing primarily on encryption. This paper additionally also explores the contribution of chaos theory in the domain of image encryption and applies a threefold chaotic map sequence to design an image encryption technique. This chaos-based encryption technique renders characteristics like sensitivity, determinacy, and ergodicity, and hence provides a better trade-off between security and computational speed. The efficacy of proposed algorithm is also evaluated based on well-known statistical metrics like Number of Changing Pixel Rate (NPCR), Unified Average Changing Intensity (UACI), Information Entropy, local Entropy, Correlation analysis, key sensitivity analysis, and NIST Randomness test. Furthermore, the key sensitivity analysis is also discussed which is a major part of any encryption algorithm analysis. © 2024 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Sensitivity analysis

来源：评论

学校读者我要写书评

暂无评论

An Apricot Detection Algorithm in Complex Environments Based on Improved YOLOv7

IAENG International Journal of Computer Science

引用

IAENG International Journal of computer science 2024年第12期51卷 2135-2144页

作者： Guo, Qiang Ma, Chi Hu, Hui School of Computer Science and Software Engineering University of Science and Technology LiaoNing AnShan114051 China School of Computer Science and Engineering Huizhou University Huizhou516007 China

Apricot detection is a prerequisite for counting and harvesting tasks. Existing algorithms face challenges in adapting to the impacts of complex environmental factors such as lighting variations, shadows, dense foliage, and the uneven distribution of samples in mechanized apricot harvesting. This paper proposes an enhanced model, YOLOv7-DC, based on YOLOv7, to address these challenges. YOLOv7-DC preprocesses diverse apricot tree samples to accommodate real-world harvesting detection scenarios. To improve model inference speed and detection accuracy, the detection network is redesigned with a new feature fusion method. DCNv2 is embedded within the efficient layer aggregation network (ELAN), and PConv is introduced to replace conventional convolutions, reducing the parameter impact of DCNv2. The training process incorporates the CBAM attention mechanism to enhance spatial and channel information. The ConvMixer architecture captures spatial and channel relationships transmitted to the detection head through the attention mechanism, improving the model’s detection accuracy for each specific classification sample. Experimental results show that YOLOv7-DC maintains good detection speed and recognition rates across various classification tasks. The improved model achieves a 6.2% increase in average detection accuracy compared to previous algorithms, with a 13% reduction in model parameters. YOLOv7-DC is better suited for handling imbalanced samples and complex environmental scenarios. © (2024), (International Association of Engineers). All rights reserved.

关键词： Apricot biloba detection Attention mechanism Feature fusion YOLOv7

来源：评论

学校读者我要写书评

暂无评论

Software Test Data Management Based on Knowledge Graph

Informatica (Slovenia)

引用

Informatica (Slovenia) 2024年第16期48卷 27-36页

作者： Gao, Li Qiu, Junlin Chen, Guanhua Faculty of Computer and Software Engineering Huaiyin Institute of Technology Huai’an223003 China

As software development models and methods mature, large-scale software systems emerge. However, a critical challenge remains: the lack of a comprehensive software test data management model that integrates basic data management with advanced knowledge reasoning. To address this issue, we developed a software test data management model based on knowledge graphs, enabling intelligent management and reasoning of software test data. The model incorporates an entity extraction model based on a feed-forward neural network, a knowledge graph integration method based on graph databases, and a knowledge reasoning submodule based on deep learning. To validate the effectiveness of our model, we evaluated the performance of each component individually. Our deep learning-based entity extraction model achieved an accuracy of 0.92, a recall of 0.88, and an F1 score of 0.90, significantly outperforming traditional methods such as regular expressions and dictionary-based approaches. Utilizing Cypher for graph database querying, our system provides accurate answers with a response time of 0.12 seconds, outperforming SQL and SPARQL-based querying methods. Furthermore, our approach excels in knowledge-based reasoning with an accuracy of 0.89 and site coverage of 0.81, surpassing both ontology-based and graph-based reasoning methods. These results highlight the enhanced construction, querying, and reasoning capabilities of our knowledge graph-based approach for managing software testing data. © 2024 Slovene Society Informatika. All rights reserved.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Slender loris optimization algorithm for solving optimization problems

引用

Journal of Intelligent and Fuzzy Systems 2024年第4期46卷 8799-8810页

作者： Lakshmi, A. Vijaya Vaitheki, K. Joseph, K. Suresh Department of Computer Science School of Engineering and Technology Pondicherry University India

Over the years, numerous optimization problems have been addressed utilizing meta-heuristic algorithms. Continuing initiatives have always been to create and develop new, practical algorithms. This work proposes a novel meta-heuristic approach employing the slender Loris optimization algorithm (SLOA), miming slender Loris behavior. The behavior includes foraging, hunting, migration and communication with each other. The ultimate goal of the devised algorithm is to replicate the food-foraging behaviour of Slender Loris (SL) and the quick movement of SL when threatened (i.e.) their escape from predators and also mathematically modelled the special communication techniques of SL using their urine scent smell. SLOA modelled SL’s slow food foraging behaviour as the exploitation phase, and moving between the tree and escaping from a predator is modelled as the exploration phase. The Eyesight of slender Loris plays a vital role in food foraging during nighttime in dim light. The operator’s Eyesight is modelled based on the angle of inclination of SL. The urine scent intensity is used here to be instrumental in preventing already exploited territory activities, which improves algorithm performance. The suggested algorithm is assessed and tested against nineteen benchmark test operations and evaluated for effectiveness with standard widely recognized meta-heuristics algorithms. The result shows SLOA performing better and achieving near-optimal solutions and dominance in exploration–exploitation balance in most cases than the existing state-of-the-art algorithms. © 2024 – IOS Press. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Question classification task based on deep learning models with self-attention mechanism

引用

Multimedia Tools and Applications 2025年第10期84卷 7777-7806页

作者： Mondal, Subhash Barman, Manas Nag, Amitava Computer Science and Engineering Central Institute of Technology Kokrajhar Assam Kokrajhar India Computer Science and Engineering [AI & ML Dayananda Sagar University Karnataka Bengaluru India

Question classification (QC) is a process that involves classifying questions based on their type to enable systems to provide accurate responses by matching the question type with relevant information. To understand and respond to natural language questions posed by humans, machine learning models or systems must comprehend the type of information requested, which can often be inferred from the structure and wording of the question. The high dimensionality and sparse nature of text data lead to challenges for text classification. These tasks can be improved using deep learning (DL) approaches to process complex patterns and features within input data. By training on large amounts of labeled data, deep learning algorithms can automatically extract relevant features and representations from text, resulting in more accurate and robust classification. This study utilizes a dataset comprising 5452 instances of questions and six output labels and uses two different word embedding techniques, like GloVe and Word2Vec, tested on the dataset using three deep learning models, LSTM, BiLSTM, and GRU, followed by a convolution layer. Additionally, a self-attention layer is included, which helps the model to focus on more relevant information when making predictions. Finally, an analytical discussion of the proposed models and their performance results provide insight into how GloVe and Word2Vec perform on the above-mentioned models. The GloVe embedding outperforms by achieving 97.68% accuracy and a moderate loss of 16.98 with the GRU model. © The Author(s), under exclusive licence to Springer science+Business Media, LLC, part of Springer Nature 2024.

关键词： Embeddings

来源：评论

学校读者我要写书评

暂无评论

A BERT-encoded ensembled CNN model for suicide risk identification in social media posts

引用

Neural Computing and Applications 2024年第18期36卷 10955-10970页

作者： Gorai, Joy Shaw, Dilip Kumar Department of Computer Science and Engineering National Institute of Technology Jamshedpur India

Suicide is a significant public health issue that devastates individuals and society. Early warning systems are crucial in preventing suicide. The purpose of this research is to create a deep learning model to identify suicide risk using a combination of bidirectional encoder representations from transformers (BERT) and an ensemble of multiple convolutional neural networks (CNN). BERT is used to encode the text data into numerical representations that capture the context-aware meaning of words and phrases, while ensemble CNN is used to analyze the encoded text data to identify patterns and relationships relevant to suicide risk. The model is trained on a large corpus of text data from social media and suicide notes and evaluated on a validation set of labeled data. The results of the proposed model perform better than the recent approaches in detecting suicide risk and can potentially be a valuable tool for suicide prevention efforts. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

An influence-based k-nearest neighbour classifier for classification of data with different densities

引用

International Journal of Business Intelligence and Data Mining 2024年第2期25卷 147-167页

作者： Motallebi, Hassan Fakhteh, Amir-Hossein Faculty of Electrical and Computer Engineering Graduate University of Advanced Technology Kerman Iran

The k-nearest neighbour (KNN) is a simple and yet effective classification rule. To achieve robustness against outliers, several local mean-based extensions of the KNN classifier have been proposed which assign the query to the class with nearest local mean. However, using the conventional proximity measures causes poor performance in situations with multi-scale classes. Here, we propose a new local mean-based KNN classifier that uses a new modified distance measure which adjusts the proximity around each sample with respect to the situation and density. We scale the distance from the sample to each class with respect to the size of its influence set such that the sample seems closer to classes in which it has a higher number of reverse neighbours. We apply the proposed method on three local mean-based KNN classifiers. Our results show that the proposed method improves the performance of the local mean-based classifiers. © 2024 Inderscience Enterprises Ltd.

关键词： Nearest neighbor search

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：