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

A Linked List Encryption Scheme for Image Steganography without Embedding

computer Modeling in Engineering & Sciences 2024年第10期141卷 331-352页

作者： Pengbiao Zhao Qi Zhong Jingxue Chen Xiaopei Wang Zhen Qin Erqiang Zhou Network and Data Security Key Laboratory of Sichuan Province University of Electronic Science and Technology of ChinaChengdu610054China Faculty of Data Science City University of MacaoMacao999078China Department of Computer Science and Engineering University of CaliforniaRiversideCA 92521USA

Information steganography has received more and more attention from scholars nowadays,especially in the area of image steganography,which uses image content to transmit information and makes the existence of secret information *** enhance concealment and security,the Steganography without Embedding(SWE)method has proven effective in avoiding image distortion resulting from cover *** this paper,a novel encrypted communication scheme for image SWE is *** reconstructs the image into a multi-linked list structure consisting of numerous nodes,where each pixel is transformed into a single node with data and pointer *** employing a special addressing algorithm,the optimal linked list corresponding to the secret information can be *** receiver can restore the secretmessage fromthe received image using only the list header position *** scheme is based on the concept of coverless steganography,eliminating the need for any modifications to the cover *** boasts high concealment and security,along with a complete message restoration rate,making it resistant to ***,this paper proposes linked-list construction schemeswithin theproposedframework,which caneffectively resist a variety of attacks,includingnoise attacks and image compression,demonstrating a certain degree of *** validate the proposed framework,practical tests and comparisons are conducted using multiple *** results affirm the framework’s commendable performance in terms of message reduction rate,hidden writing capacity,and robustness against diverse attacks.

关键词： Steganography encryption steganography without embedding coverless steganography

来源：评论

学校读者我要写书评

暂无评论

DBKEM-AACS: a distributed key escrow model in blockchain with anonymous authentication and committee selection

引用

Science China(Information Sciences) 2023年第3期66卷 289-290页

作者： Axin XIANG Hongfeng GAO Youliang TIAN Liang WAN College of Computer Science and Technology Guizhou University Institute of Cryptography and Data Security Guizhou University Network and Information Management Center Guizhou University State Key Laboratory of Public Big Data Guizhou University Institute of Computer Software and Theory Guizhou University

Dear editor, key security is of great practical significance and demand to guarantee the security of digital assets in the blockchain system. At present, users prefer to escrow their assets on centralized institutions, but this phenomenon has gone against the unique characteristics of decentralization and anonymity in the blockchain. Among them, the suspense incidents of assets lock or lost are enough to prove that the security of escrowed keys on the exchanges is questionable.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Long-Tail Learning with Foundation Model: Heavy Fine-Tuning Hurts 41

Long-Tail Learning with Foundation Model: Heavy Fine-Tuning ...

引用

41st International Conference on Machine Learning, ICML 2024

作者： Shi, Jiang-Xin Wei, Tong Zhou, Zhi Shao, Jie-Jing Han, Xin-Yan Li, Yu-Feng National Key Laboratory for Novel Software Technology Nanjing University China School of Artificial Intelligence Nanjing University China School of Computer Science and Engineering Southeast University China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education China

The fine-tuning paradigm in addressing long-tail learning tasks has sparked significant interest since the emergence of foundation models. Nonetheless, how fine-tuning impacts performance in long-tail learning was not explicitly quantified. In this paper, we disclose that heavy fine-tuning may even lead to non-negligible performance deterioration on tail classes, and lightweight fine-tuning is more effective. The reason is attributed to inconsistent class conditions caused by heavy fine-tuning. With the observation above, we develop a low-complexity and accurate long-tail learning algorithms LIFT with the goal of facilitating fast prediction and compact models by adaptive lightweight fine-tuning. Experiments clearly verify that both the training time and the learned parameters are significantly reduced with more accurate predictive performance compared with state-of-the-art approaches. The implementation code is available at https://***/shijxcs/LIFT. Copyright 2024 by the author(s)

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Structure-based Street Tree Extraction from Mobile Laser Scanning Point Clouds 2022

Structure-based Street Tree Extraction from Mobile Laser Sca...

引用

5th International Conference on Image and Graphics Processing, ICIGP 2022

作者： Hao, Wen Zuo, Zhanbin Liang, Wei School of Computer Science and Engineering Shaanxi Key Laboratory for Network Computing and Security Technology Xi'an University of Technology China Shaanxi Key Laboratory for Network Computing and Security Technology China

ISBN: (纸本)9781450395465

We present an automatic method based on structure analysis for extracting street trees from mobile laser scanning (MLS) data. Tree trunk and canopy can be characterized by the shape information and height above the ground level. Therefore, MLS point clouds are firstly divided into three layers (ground, low layer above the ground, high layer above the ground) with respect to the vertical height. For the points above the ground, the DBSCAN (Density-Based Spatial Clustering of Applications with Noise) clustering method is applied to cluster the points into segments and geometrical features are used to extract trunk candidates and canopy candidates. Then, a "structure-matching" strategy is proposed based on minimum bounding rectangle (MBR) mapping to extract the tree candidates. Finally, a slicing method based on axial symmetry is proposed to segment the overlapped canopy. The experimental results show that the proposed method can quickly extract individual trees from massive street point clouds. © 2022 ACM.

关键词： Extraction

来源：评论

学校读者我要写书评

暂无评论

A Survey on Task Scheduling of CPU-GPU Heterogeneous Cluster

引用

ZTE Communications 2024年第3期22卷 83-90页

作者： ZHOU Yiheng ZENG Wei ZHENG Qingfang LIU Zhilong CHEN Jianping University of Shanghai for Science and Technology Shanghai 200093China National Key Laboratory for Multimedia Information Processing School of Computer SciencePeking UniversityBeijing 100871China State Key Laboratory of Mobile Network and Mobile Multimedia Technology Shenzhen 518055China ZTE Corporation Shenzhen 518057China

This paper reviews task scheduling frameworks,methods,and evaluation metrics of central processing unit-graphics processing unit(CPU-GPU)heterogeneous *** scheduling of CPU-GPU heterogeneous clusters can be carried out on the system level,nodelevel,and device *** task-scheduling technologies are heuristic based on the experts’experience,while some technologies are based on statistic methods using machine learning,deep learning,or reinforcement *** metrics have been adopted to evaluate and compare different task scheduling technologies that try to optimize different goals of task *** statistic task scheduling has reached fewer research achievements than heuristic task scheduling,the statistic task scheduling still has significant research potential.

关键词： CPU-GPU heterogeneous cluster task scheduling heuristic task scheduling statistic task scheduling parallelization

来源：评论

学校读者我要写书评

暂无评论

TAKAP: A Lightweight Three-Party Authenticated key Agreement Protocol with User Anonymity

引用

Chinese Journal of Electronics 2021年第4期30卷 686-696页

作者： QIAO Hui DONG Xuewen SHEN Yulong LIU Haozhe YANG Lingxiao School of Computer Science and Technology Xidian University Shaanxi Key Laboratory of Network and System Security Xidian University

The three-party authenticated key agreement protocol is a significant cryptographic mechanism for secure communication, which encourages two entities to authenticate each other and generate a shared session key with the assistance of a trusted party(remote server) via a public channel. Recently, Wang et al. put forward a three-party key agreement protocol with user anonymity and alleged that their protocol is able to resist all kinds of attacks and provide multifarious security features in computer Engineering & Science, No.3, ***, we show that Wang et al.'s protocol is vulnerable to the password guessing attack and fails to satisfy user anonymity and perfect secrecy. To solve the aforementioned problems, a lightweight chaotic mapbased Three-party authenticated key agreement protocol(short for TAKAP) is proposed, which not only could provide privacy protection but also resist a wide variety of security attacks. Furthermore, it is formally proved under Burrows-Abadi-Needham(BAN) logic. Simultaneously,the performance analysis in this paper demonstrates that the proposed TAKAP protocol is more secure and efficient compared with other relevant protocols.

关键词： Three-party Authenticated key agreement Chaotic map Anonymity Security attacks

来源：评论

学校读者我要写书评

暂无评论

Robust Voice Activity Detection using Locality-Sensitive Hashing and Residual Frequency-Temporal Attention 25

Robust Voice Activity Detection using Locality-Sensitive Has...

引用

25th Interspeech Conferece 2024

作者： Li, Shu Zhang, Peng Li, Ye Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan Qilu University of Technology Shandong Academy of Sciences China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science China

For voice activity detection (VAD), recent works focus on learning the attention distribution on contextual information of speech to reduce the impact of irrelevant noise. However, contextual frames selected with specific steps may not be relevant, and these attention mechanisms can not fully discover the structure and characteristics of speech. In this paper, we explore a self-attention-inspired locality-sensitive hashing algorithm (SALSH) for dynamic and efficient contextual frame selection to enrich the frame-level features into a 2D partial spectrogram. Then, we propose a residual frequency-temporal attention model (FTAM) for VAD, consisting of an interval branch, an analogous hourglass structure with channel attention, and an attention learning mechanism for speech based on frequency-temporal attention. On the LibriSpeech and TIMIT datasets, the proposed method outperforms the others in terms of area under the curve (AUC), even under extremely low signal-to-noise ratio of -15dB. © 2024 International Speech Communication Association. All rights reserved.

关键词： Speech recognition

来源：评论

学校读者我要写书评

暂无评论

Mobility-Aware Multi-Task Migration and Offloading Scheme for Internet of Vehicles

引用

Chinese Journal of Electronics 2023年第6期32卷 1192-1202页

作者： LI Xujie TANG Jing XU Yuan SUN Ying College of Computer and Information Hohai University State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Key Lab for Wireless Sensor Network and Communication Shanghai Institute of Microsystem School of Information Engineering Jiangsu Open University

In Internet of vehicles, vehicular edge computing(VEC) as a new paradigm can effectively accomplish various tasks. Due to limited computing resources of the roadside units(RSUs), computing ability of vehicles can be a powerful supplement to computing resources. Then the task to be processed in data center can be offloaded to the vehicles by the RSUs. Due to mobility of the vehicles, the tasks will be migrated among the RSUs. How to effectively offload multiple tasks to the vehicles for processing is a challenging problem. A mobility-aware multi-task migration and offloading scheme for Internet of vehicles is presented and analyzed. Considering the coupling between migration and offloading, the joint migration and offloading optimization problem is formulated. The problem is a NP-hard problem and it is very hard to be solved by the conventional methods. To tackle the difficult problem, the idea of alternating optimization and divide and conquer is introduced. The problem can be decoupled into two sub-problems: computing resource allocation problem and vehicle node selection problem. If the vehicle node selection is given, the problem can be solved based on Lagrange function. And if the allocation of computing resource is given, the problem turns into a 0-1 integer programming problem, and the linear relaxation of branch bound algorithm is introduced to solve it. Then the optimization value is obtained through continuous iteration. Simulation results show that the proposed algorithm can effectively improve system performance.

关键词： Costs Computational modeling System performance Simulation Programming Multitasking Resource management

来源：评论

学校读者我要写书评

暂无评论

RFID network planning based on improved brain storm optimization algorithm

引用

The Journal of China Universities of Posts and Telecommunications 2022年第5期29卷 30-39页

作者： Lin Zihan Zheng Jiali Xie Xiaode Feng Minyu He Siyi School of Computer Electrics and InformationGuangxi UniversityNanning 530004China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi UniversityNanning 530004China

In order to improve the service quality of radio frequency identification(RFID) systems, multiple objectives should be comprehensively considered. An improved brain storm optimization algorithm GABSO, which incorporated adaptive learning operator and golden sine operator into the original brain storm optimization(BSO) algorithm, was proposed to solve the problem of RFID network planning(RNP). GABSO algorithm introduces learning operator and golden sine operator to achieve a balance between exploration and development. Based on GABSO algorithm, an optimization model is established to optimize the position of the reader. The GABSO algorithm was tested on the RFID model and dataset, and was compared with other methods. The GABSO algorithm’s tag coverage was increased by 9.62% over the Cuckoo search(CS) algorithm, and 7.70% over BSO. The results show that the GABSO algorithm could be successfully applied to solve the problem of RNP.

关键词： radio frequency identification(RFID) RFID network planning(RNP) brain storm optimization golden sine operator

来源：评论

学校读者我要写书评

暂无评论

Random mating mayfly algorithm for RFID network planning

引用

The Journal of China Universities of Posts and Telecommunications 2022年第5期29卷 40-50页

作者： Xie Xiaode Zheng Jiali Lin Zihan He Siyi Feng Minyu School of Computer Electrics and InformationGuangxi UniversityNanning 530004China Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi UniversityNanning 530004China

In order to improve robustness and efficiency of the radio frequency identification(RFID)network,a random mating mayfly algorithm(RMMA)was ***,RMMA introduced the mechanism of random mating into the mayfly algorithm(MA),which improved the population diversity and enhanced the exploration ability of the algorithm in the early stage,and find a better solution to the RFID nework planning(RNP)***,in RNP,tags are usually placed near the boundaries of the working space,so the minimum boundary mutation strategy was proposed to make sure the mayflies which beyond the boundary can keep the original search direction,as to enhance the ability of searching near the ***,in order to measure the performance of RMMA,the algorithm is then benchmarked on three well-known classic test functions,and the results are verified by a comparative study with particle swarm optimization(PSO),grey wolf optimization(GWO),and *** results show that the RMMA algorithm is able to provide very competitive results compared to these well-known meta-heuristics,RMMA is also applied to solve RNP *** performance evaluation shows that RMMA achieves higher coverage than the other three *** the number of readers is the same,RMMA can obtain lower interference and get a better load balance in each instance compared with other *** can also solve RNP problem stably and efficiently when the number and position of tags change over time.

关键词： radio frequency identification(RFID) RFID network planning(RNP) reader deployment mayfly algorithm(MA) random mating

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：