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

10th International Conference on Computing and Artificial Intelligence, ICCAI 2024

作者： Wu, Zhixi Liu, Baichen Zhu, Shunzhi Xiamen University of Technology School of Computer and Information Engineering China

ISBN: (纸本)9798400717055

In object tracking tasks, the use of a Siamese-based approach to construct trackers inevitably involves a crucial step-cross-correlation operations, which are employed to assess the similarity relationship between the template and the search area. However, this method is limited to obtaining only local information, lacking in global contextual understanding. Inspired by the Transformer's capability to capture long-Term dependencies, we propose a novel Siamese visual target tracking method with an attention mechanism, named SiamTr. Specifically, we design a feature enhancement fusion network to replace the cross-correlation computation, composed of a Hybrid Attention Module and a Cross-Attention Fusion Module. Additionally, we incorporate an Attention Feature Fusion(AFF) to merge shallow and deep features, thus acquiring diverse information. Experiments demonstrate that our proposed method achieves competitive results in multiple benchmark datasets, including OTB100, UAV123, and LaSOT. © 2024 ACM.

关键词： Target tracking

来源：评论

学校读者我要写书评

暂无评论

HASHL: Dynamic Hash Verification for Detecting and Preventing Eclipse Attacks

引用

IEEE Internet of Things Journal 2025年第13期12卷 23524-23535页

作者： He, Daojing Gong, Wei Tu, Chen Chan, Sammy Harbin Institute of Technology School of Computer Science and Technology Shenzhen China Jiangxi University of Science and Technology School of Information Engineering Jiangxi Ganzhou China City University of Hong Kong Department of Electrical Engineering Hong Kong

With the rapid development of blockchain technology, P2P networks are facing increasing security threats, among which Eclipse attacks, as a type of network isolation attack, have seriously affected the normal operation of the network and the integrity of data. To address this challenge, this study implements node authentication and dynamic reputation evaluation by leveraging a dynamic hash computation mechanism that integrates challenge strings, node identifiers, and the latest active time, ensuring the uniqueness of node identities and the authenticity of operations. Based on a dynamic hash chain behavior evaluation mechanism, node behaviors are quantified across three dimensions: integrity, consistency, and temporal consistency, enabling precise identification of anomalous nodes. Furthermore, a network prevention repository framework is proposed, which dynamically adjusts the trust index of nodes by combining historical behavior with real-time data, effectively detecting and defending against stealthy Eclipse attacks. In addition, extensive testing on both Bitcoin and Ethereum platforms has shown that the method proposed in this study not only can effectively coexist on these two platforms, but also significantly improves the security and stability of the network, effectively reducing the occurrence of Eclipse attacks. © 2014 IEEE.

关键词： Blockchain

来源：评论

学校读者我要写书评

暂无评论

A Combined Approach of Deep Reinforcement Learning and Simulated Annealing for Task offloading in Edge Computing 24

A Combined Approach of Deep Reinforcement Learning and Simul...

引用

4th International Conference on Artificial Intelligence, Automation and High Performance Computing, AIAHPC 2024

作者： Lin, Ke Liu, Yanggai Zhu, Zilu Li, Lin School of Computer and Information Engineering Xiamen University of Technology China

ISBN: (纸本)9798400710049

Edge computing paradigms shifts data processing tasks from remote cloud servers to the network’s edge, closer to data origination points. This approach reduces data transmission delays, enhances processing efficiency [1]. To further minimize latency, an effective policy for task offloading onto finite Edge Computing is crucial for maintaining the internet’s high-performance capabilities. However, traditional techniques often fail to achieve equitable task offloading and can converge on suboptimal solutions, leading to increased time and energy consumption. To address these limitations, we propose a novel resource allocation algorithm that leverages the strengths of Deep Reinforcement Learning (DRL) combined with the evolutionary capabilities of the Simulated Annealing (SA). Through simulation experiments, we evaluate the proposed strategy across various metrics, including cost, convergence speed, and reward, demonstrating its significant ability to improve overall system efficiency. © 2024 Copyright held by the owner/author(s).

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Robust copy-move detection and localization of digital audio based CFCC feature

引用

Multimedia Tools and Applications 2025年第11期84卷 9573-9589页

作者： Wang, Dongyu Li, Xiaojie Shi, Canghong Niu, Xianhua Xiong, Ling Wu, Hanzhou Qian, Qing Qi, Chao School of Computer and Software Engineering Xihua University Chengdu610039 China The College of Computer Science Chengdu University of Information Technology Chengdu610225 China School of Information Shanghai University Shanghai200444 China School of Information Guizhou University of Finance and Economics Guiyang550000 China

Copy-move forgery is a common audio tampering technique in which users copy the contents of one speech and paste them into another region of the same speech signal, thus achieving the effect of tampering with the semantics. To verify the authenticity of the audio, this paper proposes a method to detect and localize audio copy-move forgery based on the cochlear filter of cochlear filter cepstral coefficients (CFCC) feature. The pitch tracking algorithm is used to distinguish the voiced and unvoiced segments in the audio, and then the CFCC coefficients are extracted for each voiced segment. The CFCC feature simulates the entire transmission process of signals in the cochlear basilar membrane using wavelet transformation. Finally, we use Pearson correlation coefficients (PCCs) and dynamic time warping (DTW) in combination to compare the similarity of voiced segments, accurately determining the tampered locations in the audio through threshold judgment. Through extensive experiments on relevant datasets, this algorithm achieves a precision rate of 98.39% and a recall rate of 98.00% in detecting audio without post-processing. Even when detecting audio that has undergone different post-processing, the precision and recall rates remain above 90%. Compared to existing methods, this approach not only achieves precise localization of replicated segments but also demonstrates superior experimental results. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

Resource allocation for wireless networks based on enhanced Harris hawks optimisation algorithm

引用

International Journal of Security and Networks 2024年第4期19卷 178-187页

作者： Meng, Xianmeng Cai, Cuicui Tan, Linglong Wang, Qijian School of Electronics Engineering Anhui Xinhua University Hefei230088 China School of Computer Science and Information Engineering Hefei University of Technology Hefei230601 China School of Electronics and Information Engineering West Anhui University Lu’an237012 China

Efficient resource allocation is critical to improve the quality of service in wireless networks. The problem of resource allocation is usually non-convex and non-deterministic polynomial-hard. Meta-heuristic algorithms are widely used to solve non-convex optimisation problems due to their efficient execution and high iteration accuracy. The Harris hawk optimisation (HHO) algorithm has recently received attention as an effective approach for addressing various optimisation problems. However, the HHO algorithm is employed for resource allocation issues in WNs and suffers from early convergence and local optimal problems. To overcome these issues, we develop a novel enhanced HHO (EHHO) algorithm with low computational complexity and explore the performance of the EHHO in resource allocation. Firstly, we introduce the power allocation for secrecy rate maximisation and spectrum efficiency trade-off in wireless networks. Then, the fundamental of the basic HHO algorithm is described, and the EHHO algorithm is proposed with nonlinear control update and local search strategies. Finally, we demonstrate the remarkable capabilities of the EHHO in terms of the benchmark functions and resource allocation in wireless networks. Copyright © 2024 Inderscience Enterprises Ltd.

关键词： energy efficiency enhanced Harris hawks optimisation algorithm meta-heuristic optimisation resource allocation secrecy rate spectral efficiency

来源：评论

学校读者我要写书评

暂无评论

Automated object recognition in high-resolution optical remote sensing imagery

引用

National Science Review 2023年第6期10卷 38-41页

作者： Yazhou Yao Tao Chen Hanbo Bi Xinhao Cai Gensheng Pei Guoye Yang Zhiyuan Yan Xian Sun Xing Xu Hai Zhang School of Computer Science and Engineering Nanjing University of Science and Technology Aerospace Information Research Institute Chinese Academy of Sciences School of Electronic Electrical and Communication Engineering University of Chinese Academy of Sciences Key Laboratory of Network Information System Technology (NIST) Aerospace Information Research Institute Chinese Academy of Sciences Department of Computer Science and Technology Tsinghua University School of Computer Science and Engineering University of Electronic Science and Technology of China Pazhou Laboratory (Huangpu) School of Mathematics Northwest University

INTRODUCTION With the rapid development of remote sensing technology,high-quality remote sensing images have become widely *** automated object detection and recognition of these images,which aims to automatically locate objects of interest in remote sensing images and distinguish their specific categories,is an important fundamental task in the *** provides an effective means for geospatial object monitoring in many social applications,such as intelligent transportation,urban planning,environmental monitoring and homeland security.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Constructing a Secure Charity NFT Auction Platform Using Fisco Bcos Blockchain for Enhancing Transparency and Traceability

引用

IEEE Access 2024年 12卷 36924-36941页

作者： Chen, Chin-Ling Zhan, Wan-Bing Tsaur, Woei-Jiunn Huang, Der-Chen Liu, Ling-Chun Changchun Sci-Tech University Changchun School of Information Engineering Jilin130600 China Chaoyang University of Technology Department of Computer Science and Information Engineering Taichung413310 Taiwan Xiamen University of Technology Xiamen School of Computer and Information Engineering Fujian361024 China National Taipei University Computer Center New Taipei City237303 Taiwan National Taipei University Department of Computer Science and Information Engineering New Taipei City237303 Taiwan National Chung Hsing University Department of Computer Science and Engineering Taichung402202 Taiwan

In the charity sector, fundraising and transparency have long been key issues. Charity NFT (Non-Fungible Token) auctions, an emerging charity fundraising model integrating blockchain and NFT concepts, bring opportunities and challenges. Blockchain provides distributed data integrity and transparency via cryptography-linked data blocks, while NFTs enable unique digital ownership representation. This study designs a charity NFT auction platform on the Fisco Bcos blockchain, using multi-signature algorithms to ensure NFT authenticity, ECDSA (Elliptic Curve Digital Signature Algorithm) signatures for transaction integrity and traceability, NFTs and virtual currencies to reduce costs, and IPFS (InterPlanetary File System) for storage. The implemented system achieves 2104 TPS throughput with 492-millisecond latency, increasing transaction processing with low latency. Overall, the platform aims to address charity issues like opaque fund flows, high costs, and fake initiatives through the strategic application of blockchain and NFT functionality. © 2013 IEEE.

关键词： Smart contract

来源：评论

学校读者我要写书评

暂无评论

How graph convolutions amplify popularity bias for recommendation?

引用

Frontiers of computer Science 2024年第5期18卷 121-132页

作者： Jiajia CHEN Jiancan WU Jiawei CHEN Xin XIN Yong LI Xiangnan HE School of Information Science and Technology University of Science and Technology of ChinaHefei 230026China School of Computer Science and Technology Zhejiang UniversityHangzhou 310058China School of Computer Science and Technology Shandong UniversityQingdao 250100China Department of Electronic Engineering Tsinghua UniversityBeijing 100084China

Graphconvolutional networks(GCNs)have become prevalent in recommender system(RS)due to their superiority in modeling collaborative *** improving the overall accuracy,GCNs unfortunately amplify popularity bias-tail items are less likely to be *** effect prevents the GCN-based RS from making precise and fair recommendations,decreasing the effectiveness of recommender systems in the long *** this paper,we investigate how graph convolutions amplify the popularity bias in *** theoretical analyses,we identify two fundamental factors:(1)with graph convolution(i.e.,neighborhood aggregation),popular items exert larger influence than tail items on neighbor users,making the users move towards popular items in the representation space;(2)after multiple times of graph convolution,popular items would affect more high-order neighbors and become more *** two points make popular items get closer to almost users and thus being recommended more *** rectify this,we propose to estimate the amplified effect of popular nodes on each node's representation,and intervene the effect after each graph ***,we adopt clustering to discover highly-influential nodes and estimate the amplification effect of each node,then remove the effect from the node embeddings at each graph convolution *** method is simple and generic-it can be used in the inference stage to correct existing models rather than training a new model from scratch,and can be applied to various GCN *** demonstrate our method on two representative GCN backbones LightGCN and UltraGCN,verifying its ability in improving the recommendations of tail items without sacrificing the performance of popular *** are open-sourced^(1)).

关键词： recommendation graph convolution networks popularity bias

来源：评论

学校读者我要写书评

暂无评论

Representation learning via an integrated autoencoder for unsupervised domain adaptation

引用

Frontiers of computer Science 2023年第5期17卷 75-87页

作者： Yi ZHU Xindong WU Jipeng QIANG Yunhao YUAN Yun LI School of Information Engineering Yangzhou UniversityYangzhou 225127China Key Laboratory of Knowledge Engineering with Big Data(Ministry of Education of China) Hefei University of TechnologyHefei 230009China School of Computer Science and Information Engineering Hefei University of TechnologyHefei 230601China

The purpose of unsupervised domain adaptation is to use the knowledge of the source domain whose data distribution is different from that of the target domain for promoting the learning task in the target *** key bottleneck in unsupervised domain adaptation is how to obtain higher-level and more abstract feature representations between source and target domains which can bridge the chasm of domain ***,deep learning methods based on autoencoder have achieved sound performance in representation learning,and many dual or serial autoencoderbased methods take different characteristics of data into consideration for improving the effectiveness of unsupervised domain ***,most existing methods of autoencoders just serially connect the features generated by different autoencoders,which pose challenges for the discriminative representation learning and fail to find the real cross-domain *** address this problem,we propose a novel representation learning method based on an integrated autoencoders for unsupervised domain adaptation,called *** capture the inter-and inner-domain features of the raw data,two different autoencoders,which are the marginalized autoencoder with maximum mean discrepancy(mAE)and convolutional autoencoder(CAE)respectively,are proposed to learn different feature *** higher-level features are obtained by these two different autoencoders,a sparse autoencoder is introduced to compact these inter-and inner-domain *** addition,a whitening layer is embedded for features processed before the mAE to reduce redundant features inside a local *** results demonstrate the effectiveness of our proposed method compared with several state-of-the-art baseline methods.

关键词： unsupervised domain adaptation representation learning marginalized autoencoder convolutional autoen-coder sparse autoencoder

来源：评论

学校读者我要写书评

暂无评论

A dynamic and resource sharing virtual network mapping algorithm

引用

Digital Communications and Networks 2023年第5期9卷 1101-1112页

作者： Xiancui Xiao Xiangwei Zheng Ji Bian Cun Ji Xinchun Cui School of Information Science and Engineering Shandong Normal UniversityJinan250014China School of Information Engineering Shandong Management UniversityJinan250358China Shandong Provincial Key Laboratory for Distributed Computer Software Novel Technology Jinan250014China School of Computer Science and Technology Qufu Normal UniversityRizhao276800China

Network virtualization can effectively establish dedicated virtual networks to implement various network ***,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and *** addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation *** on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology *** the node mapping process,three properties of the node are used to measure its mapping ***,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link ***,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource *** former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision *** results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenu

关键词： Network virtualization VNRs Network frameworks Dynamic resource allocation Resource sharing

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：