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

11th Joint International information Technology and Artificial Intelligence Conference, ITAIC 2023

作者： Ding, Wenkang Sun, Ruirui Meng, Qinglong Wan, Zhong Cheng, Guanghe Hao, Huijuan Bai, Jinqiang 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: (纸本)9798350333664

With the continuous increase of IoT devices, the management and optimization of devices become particularly important. The update cycle of device functions is short, and in order to facilitate management and optimize device performance, a fast and convenient upgrade method is needed to solve this problem. Remote upgrade technology is mainly divided into full package upgrade and differential upgrade. Compared to full package upgrade, differential upgrade has obvious advantages in remote upgrade of large files. The main problem with current differential upgrade is the problem of slow generation speed while ensuring a certain size range of differential packages. This article proposes an improved Bsdiff algorithm to solve the problem of slow generation speed of differential packages. Experimental verification shows that the efficiency of remote upgrade has been improved, Improved the speed of differential packet generation and upgrade efficiency while ensuring the size of differential packets. © 2023 IEEE.

关键词： Block Optimization Strategy Bsdiff Difference Algorithm IoT Firmware Libdivsufsort Remote Upgrade

来源：评论

学校读者我要写书评

暂无评论

JTEA: Implementing Semi-Supervised Entity Alignment Using Joint Teaching Strategies

JTEA: Implementing Semi-Supervised Entity Alignment Using Jo...

引用

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

作者： Lu, Kai Zhao, Jing Ding, Lichao Hao, Zenghao Key Laboratory of Computing Power Network and Information Security Ministry of Education Jinan China Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China

ISBN: (纸本)9781665410205

Entity alignment(EA) aims to identify equivalent entities in different knowledge graphs or data sources and establish correspondences between them. In recent years, embedding-based methods have made significant progress in the field of entity alignment, yet the shortage of adequate training data (i.e., seed entity pairs) continues to be a primary challenge. Traditional semi-supervised methods typically address this issue by generating potential mappings (i.e., pseudo-mappings) for unlabeled entities. However, these methods often suffer from the influence of erroneous potential mappings or overlook the uncertainty of potential mappings. Therefore, we propose a novel semi-supervised entity alignment method called JTEA. This method combines seed entity pairs with potential mappings through end-to-end joint training, providing strong guidance for model training. In constructing potential mappings, we propose a bidirectional matching strategy (BMS), which generates more detailed potential mappings by jointly adjusting decisions in different directions and uses a joint matching confidence score to characterize its uncertainty. Furthermore, we also introduce a method of matching diversity alignment selection, aiming to screen out more reliable entity alignments to further improve the performance and stability of the model. We conducted a large number of experiments on the benchmark dataset to fully validate the effectiveness of the JTEA method. © 2024 IEEE.

关键词： Mapping

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Improving User QoE via Joint Trajectory and Resource Optimization in Multi-UAV Assisted MEC

引用

IEEE Transactions on Services Computing 2025年第3期18卷 1472-1486页

作者： Gao, Yang Tao, Jun Xu, Yifan Wang, Zuyan Gao, Yu Wang, Meiling Hainan University School of Cyberspace Security Haikou570228 China Ministry of Education Key Laboratory of Computer Network and Information Integration Southeast University Nanjing211189 China Southeast University School of Cyber Science and Engineering Nanjing211189 China ZTE Communications Co. Ltd Nanjing210012 China

As a promising network architecture, Mobile Edge Computing (MEC), has been proven that can effectively reduce the end-to-end latency and the energy consumption. The Unmanned Aerial Vehicle (UAV) assisted MEC network, where the UAV can provide the computation offloading services for the mobile users, can further alleviate the huge deployment cost of static edge servers. However, it remains unsolved how multiple cooperative flying UAVs serve the ground users, especially considering that these UAVs may share the same wireless channel and can communicate with the users while flying. In this paper, we first propose the Age of Task (AoT) metric to measure the quality of experience, and then formulate the joint optimization problem to minimize the worst AoT among all the users. Based on the block coordinate descent (BCD) method, this problem is transformed into three non-convex programming sub-problems (i.e., the UAV-user association sub-problem, the UAV trajectory planning sub-problem and the transmit power optimization sub-problem). Specifically, the successive convex approximation (SCA) technique is exploited iteratively to deal with the non-convexity in the UAV trajectory and transmit power optimization. Numerical results show that the proposed scheme outperforms the benchmark offloading schemes in terms of AoT. © 2008-2012 IEEE.

关键词： Drones

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Speed Master: Quick or Slow Play to Attack Speaker Recognition 39

Speed Master: Quick or Slow Play to Attack Speaker Recogniti...

引用

39th Annual AAAI Conference on Artificial Intelligence, AAAI 2025

作者： Ye, Zhe Zhang, Wenjie Ren, Ying Kang, Xiangui Yan, Diqun Ma, Bin Wang, Shiqi Guangdong Key Lab of Information Security School of Computer Science and Engineering Sun Yat-sen University Guangzhou China Faculty of Electrical Engineering and Computer Science Ningbo University Ningbo China Key Laboratory of Computing Power Network and Information Security Ministry of Education Qilu University of Technology Shandong Academy of Sciences Jinan China Department of Computer Science City University of Hong Kong Hong Kong

ISBN: (纸本)157735897X

Backdoor attacks pose a significant threat during the model’s training phase. Attackers craft pre-defined triggers to break deep neural networks, ensuring the model accurately classifies clean samples during inference yet erroneously classifies samples added with these triggers. Recent studies have shown that speaker recognition systems trained on large-scale data are susceptible to backdoor attacks. Existing attackers employ unnoticed ambient sounds as triggers. However, these sounds are not inherently part of the training samples themselves. In essence, triggers can be designed to maintain an intrinsic connection with the original speech to enhance stealthiness. Our paper presents a novel attack methodology named Speed Master, which undermines deep neural networks by manipulating the speed of speech samples. Specifically, we execute poison-only backdoor attacks using speed or tempo adjustment. Changes in speech rate have become a common occurrence, as seen on platforms that allow users to adjust playback speed. In real-world scenarios, people naturally adjust their speaking rate depending on the context. As a result, changes in a speaker’s speech rate are typically perceived as normal and are unlikely to raise suspicion. Furthermore, detecting such subtle adjustments becomes challenging for users without reference speech. Our comprehensive experiments demonstrate that Speed Master can achieve an ASR over 99% in the digital domain, with only a 0.6% poisoning rate. Additionally, we validate the feasibility of Speed Master in the real world and its resistance to typical defensive measures. Copyright © 2025, Association for the Advancement of Artificial Intelligence (***). All rights reserved.

关键词： Deep neural networks

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：