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

Privacy-Preserving Multi-keyword Fuzzy Adjacency Search Strategy for Encrypted Graph in Cloud Environment

computers, Materials & Continua 2024年第3期78卷 3177-3194页

作者： Bin Wu Xianyi Chen Jinzhou Huang Caicai Zhang Jing Wang Jing Yu Zhiqiang Zhao Zhuolin Mei School of Computer and Big Data Science Jiujiang UniversityJiujiang332005China Jiujiang Key Laboratory of Network and Information Security Jiujiang332005China School of Computer and Software Nanjing University of Information Science&TechnologyNanjing210044China School of Computer Engineering Hubei University of Arts and ScienceXiangyang441053China School of Modern Information Technology Zhejiang Institute of Mechanical and Electrical EngineeringHangzhou310053China Information Center Jiangxi Changjiang Chemical Co.Ltd.Jiujiang332005China School of Mathematics and Computer Science Ningxia Normal UniversityGuyuan756099China

In a cloud environment,outsourced graph data is widely used in companies,enterprises,medical institutions,and so *** owners and users can save costs and improve efficiency by storing large amounts of graph data on cloud *** on cloud platforms usually have some subjective or objective attacks,which make the outsourced graph data in an insecure *** issue of privacy data protection has become an important obstacle to data sharing and *** to query outsourcing graph data safely and effectively has become the focus of *** query is a basic and frequently used operation in graph,and it will effectively promote the query range and query ability if multi-keyword fuzzy search can be supported at the same *** work proposes to protect the privacy information of outsourcing graph data by encryption,mainly studies the problem of multi-keyword fuzzy adjacency query,and puts forward a *** our scheme,we use the Bloom filter and encryption mechanism to build a secure index and query token,and adjacency queries are implemented through indexes and query tokens on the cloud *** proposed scheme is proved by formal analysis,and the performance and effectiveness of the scheme are illustrated by experimental *** research results of this work will provide solid theoretical and technical support for the further popularization and application of encrypted graph data processing technology.

关键词： Privacy-preserving adjacency query multi-keyword fuzzy search encrypted graph

来源：评论

学校读者我要写书评

暂无评论

Semantic Relation-Based Cross Attention network for Image-Text Retrieval

Semantic Relation-Based Cross Attention Network for Image-Te...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Zhou, Huanxiao Geng, Yushui Zhao, Jing Ma, Xishan Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China Jinan China

ISBN: (纸本)9781665410205

Image-text retrieval refers to querying the text or image of another modality given an image or text, and its key lies in the ability to accurately measure the similarity between text and image. Most of the existing retrieval methods only utilize the intramodal relations of each modality or the intermodal relations of the two modalities to perform the retrieval task. To address the above problems, we integrate the intra-modal and inter-modal relations and propose a Semantic Relation-based Cross Attention network(SRCAN). In our proposed method, we first mine the possible intra-modal associations between regions in an image and between words in a text to obtain features with semantic relationships, and then capture the fine-grained associations between segments through the cross-attention mechanism. Finally, we balance the intra-modal and inter-modal relationships to improve the performance of the model. Our proposed method is experimentally validated on two datasets, Flickr30K and MS-COCO, and the experimental results show that our method achieves superior results. © 2024 IEEE.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Received value flipping based sphere decoding algorithm for polar codes

引用

Intelligent and Converged networks 2024年第4期5卷 370-379页

作者： Rui Wang Haiqiang Chen Yan Chen Yuanbo Liu Xiangcheng Li Youming Sun Qingnian Li School of Computer and Electronic Information Guangxi UniversityNanning 530004China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi UniversityNanning 530004China College of Information Engineering Nanning UniversityNanning 530004China

Polar codes are considered as one of the most competitive channel coding schemes for the future wireless communication *** improve the performance of polar codes with short code-length for control channels,a sphere decoding algorithm based on received value flipping is proposed in this *** a codeword fails the cyclic redundancy check,the algorithm flips the received value with low reliability and forms a new received ***,this new sequence is sent to the decoder for another decoding *** addition,we also compare the performance of different flipping sets and evaluate the influence of the associated flipping set *** results show that,the proposed algorithm can achieve performance improvement over additive white Gaussian noise channel with acceptable *** the(64,16)polar code,the proposed algorithm can achieve about 0.23 dB 10-3performance gain at frame error rate=,compared to the conventional sphere decoding ***,we also verify the applicability of the proposed algorithm over Rayleigh fading channel and observe similar results.

关键词： polar codes sphere decoding bit flipping row weight polarization weight

来源：评论

学校读者我要写书评

暂无评论

Knowledge Distillation Using Global Fusion and Feature Restoration for Industrial Defect Detectors

Knowledge Distillation Using Global Fusion and Feature Resto...

引用

2024 IEEE International Conference on Systems, Man, and Cybernetics, SMC 2024

作者： Feng, Zhengqian Yue, Xiyao Li, Wang Zhou, Mingle Han, Delong Li, Gang Shandong Scicom Information and Economy Research Institute CO.. Ltd China Key Laboratory of Computing Power Network and Information Security Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Deep learning technology has been widely applied in industrial quality inspection tasks to improve the accuracy of defect detection, object recognition, and classification. However, in the task of object detection, both feature-based and regression-based traditional knowledge distillation methods impose overly strict constraints on the student model. To address the above issues, this article proposes Global Fusion and Feature Restoration Knowledge Distillation(FRD). FRD integrates contextual information into the channel through a Global Fusion Module (GFM), and further utilizes attention mechanisms to adaptively focus on the distillation region after separating the foreground background. FRD also uses a Mask Feature Restoration (MFR) to mask and restore a portion of student features, improving the learnability of the model. At the same time, FRD adopts a comprehensive approach of multiple loss superposition constraints, rather than simply using MSE losses to imitate the features of teachers. Experiments have shown that FRD can effectively improve model performance in industrial defect detection tasks. On the aluminum surface defect dataset, FRD increased the mAP index of RetinaNet-Res50 from 57.7% to 61.7%. We also confirmed the effectiveness of FRD for general object detection on the Coco dataset. On a randomly selected COCO dataset containing 4000 images, FRD increased the mAP metric of RetinaNet-Res50 from 21.5% to 43.6%. © 2024 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

Dynamic detection technology of encryption algorithm based on Pin 9

Dynamic detection technology of encryption algorithm based o...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Qu, Junpeng Du, Gaolei Sun, Yunge Fu, Yong Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

Aiming at the problem that malicious software uses encryption algorithm to hide its own malicious code and avoid detection, a dynamic detection technology based on Pin encryption algorithm is proposed. Use Pin to get the instruction flow of executable file running, then identify the function call in the instruction flow to get the function call framework, find the loop body in the calling function, and then carry out the encryption algorithm instruction detection and encryption algorithm constant detection on the loop body. If the detection passes, it can be considered that a component of the encryption algorithm is found. Then the complete encryption algorithm is found according to the generated function call framework. Experiments show that this method can effectively identify the encryption algorithms hidden in executable files. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

A Semi-supervised Protein Complex Identification Algorithm Based on Sparseness Constraint

A Semi-supervised Protein Complex Identification Algorithm B...

引用

2024 International Conference on Applied Mathematics, Modelling and Statistics Application, AMMSA 2024

作者： Liu, Guangming Dang, Fengqing Wang, Bin Peng, Yonghong Wang, Xiaofan Tan, Li School of Computer Science and Engineering Shaanxi Key Laboratory for Network Computing and Security Technology Xi'An University of Technology Shaanxi Xi'an China Faculty of Science and Engineering Computing and Information Science Cambridge United Kingdom School of Computer and Information Engineering Beijing Technology and Business University Beijing China

Recognising protein complexes in protein interaction networks is crucial, but poses a major challenge due to the frequency of noisy interactions. These networks typically involve numerous protein complexes, with each protein generally only participating in a few complexes. Current recognition models often ignore this aspect. To address this problem, we present a semi-supervised protein complex identification algorithm that extends non-negative matrix factorization (NMF) with sparsity constraints. In contrast to conventional approaches that apply a global sparsity constraint to the entire matrix, our method imposes individual sparsity constraints on protein membership indicator vectors. This targeted strategy controls the algorithm more effectively. Our experimental results with yeast and human protein interaction networks show that our algorithm achieves higher accuracy in identifying protein complexes than leading contemporary methods. © Published under licence by IOP Publishing Ltd.

关键词： Non-negative matrix factorization

来源：评论

学校读者我要写书评

暂无评论

ERNN: Error-Resilient RNN for Encrypted Traffic Detection towards network-Induced Phenomena

引用

IEEE Transactions on Dependable and Secure Computing 2023年 1-18页

作者： Zhao, Ziming Li, Zhaoxuan Jiang, Jialun Yu, Fengyuan Zhang, Fan Xu, Congyuan Zhao, Xinjie Zhang, Rui Guo, Shize College of Computer Science and Technology Zhejiang University Hangzhou China State Key Laboratory of Information Security CAS Beijing China Jiaxing University College of Information Science and Engineering Jiaxing Zhejiang China

Traffic detection systems based on machine learning have been proposed to defend against cybersecurity threats, such as intrusion attacks and malware. However, they did not take the impact of network-induced phenomena into consideration, such as packet loss, retransmission, and out-of-order. These phenomena will introduce additional misclassifications in the real world. In this paper, we present ${\sf ERNN}$, a robust and end-to-end RNN model that is specially designed against network-induced phenomena. As its core, ${\sf ERNN}$ is designed with a novel gating unit named as session gate that includes: (i) four types of actions to simulate common network-induced phenomena during model training;and (ii) the Mealy machine to update states of session gate that adjusts the probability distribution of network-induced phenomena. Taken together, ${\sf ERNN}$ advances state-of-the-art by realizing the model robustness for network-induced phenomena in an error-resilient manner. We implement ${\sf ERNN}$ and evaluate it extensively on both intrusion detection and malware detection systems. By practical evaluation with dynamic bandwidth utilization and different network topologies, we demonstrate that ${\sf ERNN}$ can still identify 98.63% of encrypted intrusion traffic when facing about 16% abnormal packet sequences on a 10 Gbps dataplane. Similarly, ${\sf ERNN}$ can still robustly identify more than 97% of the encrypted malware traffic in multi-user concurrency scenarios. ${\sf ERNN}$ can realize $\sim$4% accuracy more than SOTA methods. Based on the Integrated Gradients method, we interpret the gating mechanism can reduce the dependencies on local packets (termed dependency dispersion). Moreover, we demonstrate that ${\sf ERNN}$ possesses superior stability and scalability in terms of parameter settings and feature selection. IEEE

关键词： Malware

来源：评论

学校读者我要写书评

暂无评论

Enhancing Parameter-Efficient Transformers with Contrastive Syntax and Regularized Dropout for Neural Machine Translation 21st

Enhancing Parameter-Efficient Transformers with Contrastive...

引用

21st Pacific Rim International Conference on Artificial Intelligence, PRICAI 2024

作者： Fan, Yunlong Yang, Zhiheng Li, Baixuan Gao, Zhiqiang School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing China

ISBN: (纸本)9789819601219

Transformers have significantly improved Neural Machine Translation (NMT) models, accompanied by the inherent space complexity of O(n2). While recent approaches aim to be parameter-efficient, they often exhibit limited generalization capabilities with fewer parameters and decreased performances in longer sentences. To this end, we propose two methods, Syntax-enhanced Contrastive Learning (Syn-CL) and JS divergence-based Regularized Dropout (JSR-Drop) for the cross-layer parameter-sharing Transformer (baseline) in NMT. In Syn-CL, we add the corresponding target-to-source instances for the same batch in an extra bidirectional training phase, and minimize the distances of syntax-enhanced representation between the bilingual sentence-pair while maximizing the ones among others. In JSR-Drop, we refine the regularized dropout strategy with JS divergence, and improve generalization capabilities by reducing Transformers’ inconsistencies between training and inference introduced by dropout. Extensive experiments on six NMT tasks, IWSLT2014 (German↔English) and IWSLT2017 (English↔French and English↔Romanian), show an average BLEU score of 37.55, surpassing the vanilla Transformer and the baseline up to 1.75 BLEU, and outperforming models with 1.5×, 2.0× parameters in translating long sentences. Our code is available at https://***/Anon1214/EnPeNMT. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

An automated construction method for symmetric encryption round function models based on dynamic analysis 9

An automated construction method for symmetric encryption ro...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Du, Gaolei Sun, Yunge Qu, Junpeng Fu, Yong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

With the deepening of informatization, the incidence of cybercrimes utilizing malicious software for attacks is on the rise. This paper addresses the detection issue of symmetric encryption in malicious software from the perspective of cryptography, proposing an automated method for constructing a symmetric encryption round function model based on dynamic analysis. This method tracks data flow at the granularity of registers to characterize Directed Acyclic Graph (DAG) construction of round function models. Initially, dynamic execution traces of binary files are captured using Intel Pin, identifying loops within them. Data flow tracking at the register level within loops is performed, creating DAG, and analyzing whether the loops exhibit characteristics of symmetric cipher round functions, thus constructing the round function model. This approach enables the detection of symmetric encryption within binary files and the construction of round function models, offering a novel solution for fine-grained symmetric cipher recognition and laying a foundation for detecting malicious software containing symmetric encryption. © 2024 IEEE.

关键词： Data flow graphs

来源：评论

学校读者我要写书评

暂无评论

An Encryption Algorithm Cycle Identification Method Based on Bit Execution 9

An Encryption Algorithm Cycle Identification Method Based on...

引用

9th IEEE International Conference on Data Science in Cyberspace, DSC 2024

作者： Sun, Yunge Du, Gaolei Qu, Junpeng Fu, Yong Qilu University of Technology Shandong Academy of Sciences Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Jinan250014 China Quan Cheng Laboratory Jinan250103 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan China

ISBN: (纸本)9798350391367

Ransomware uses symmetric encryption algorithms to lock user files to extort money. This paper proposes a cryptographic algorithm loop identification method based on bit-precise execution, aiming to solve the problem of identifying unknown loops. The structure of the loop body of encryption algorithms is fixed and usually includes nonlinear operations and linear operations. This article converts the loop body in the unknown software into a set of Boolean formulas, and converts the malware into a register data flow through the symbolic executor, thereby converting it into a set of Boolean formulas for execution. Execute known encryption algorithms with bit accuracy and establish a Boolean formula input-output relationship library for cryptographic components. The two sets of Boolean formulas are passed through a designed input matrix to achieve the Boolean formula mapping and input variable mapping of the confirmation algorithm, which can effectively judge the encryption algorithms in some malware. © 2024 IEEE.

关键词： Encryption algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：