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

International Symposium on Parallel and Distributed Processing (IPDPS)

作者： Xiaohai Dai Guanxiong Wang Jiang Xiao Zhengxuan Guo Rui Hao Xia Xie Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China School of Computer Science and Artificial Intelligence Wuhan University of Technology China School of Computer Science and Technology Hainan University China

ISBN: (数字)9798350387117

ISBN: (纸本)9798350387124

To improve the throughput of Byzantine Fault Tolerance (BFT) consensus protocols, the Directed Acyclic Graph (DAG) topology has been introduced to parallel data processing, leading to the development of DAG-based BFT consensus. However, existing DAG-based works heavily rely on Reliable Broadcast (RBC) protocols for block broadcasting, which introduces significant latency due to the three communication steps involved in each RBC. For instance, DAGRider, a representative DAG-based protocol, exhibits the best latency of 12 steps, considerably higher than non-DAG protocols like PBFT, which only requires 3 steps. To tackle this issue, we propose LightDAG, which replaces RBC with lightweight broadcasting protocols such as Consistent Broadcast (CBC) and Plain Broadcast (PBC). Since CBC and PBC can be implemented in two and one communication steps, respectively, LightDAG achieves low *** our proposal, we present two variants of LightDAG, namely LightDAG1 and LightDAG2, each providing a trade-off between the best latency and the expected worst latency. In LightDAG1, every block is broadcast using CBC, which exhibits a best latency of 5 steps and an expected worst latency of 14 steps. Since CBC cannot guarantee the totality property, we design a block retrieval mechanism in LightDAG1 to assist replicas in retrieving missing blocks. LightDAG2 utilizes a combination of PBC and CBC for block broadcasting, resulting in the best latency of 4 steps and an expected worst latency of 12(t+1) steps, where t represents the number of actual Byzantine replicas. Since a Byzantine replica may equivocate through PBC, LightDAG2 prohibits blocks from directly referencing contradictory blocks. To ensure liveness, we propose a mechanism to identify and exclude Byzantine replicas if they engage in equivocation attacks. Extensive experiments have been conducted to evaluate LightDAG, and the results demonstrate its feasibility and efficiency.

关键词： Fault tolerance Distributed processing Directed acyclic graph Fault tolerant systems Broadcasting Throughput Data processing

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Graph-Sequence Anomaly Detection for 5G Core Network Control Plane Traffic 29

Unsupervised Graph-Sequence Anomaly Detection for 5G Core Ne...

引用

29th IEEE International Conference on Parallel and Distributed systems, ICPADS 2023

作者： Wang, Min Li, Peng Cheng, Zhang Liu, Wenmao Nie, Lei Bao, Haizhou Liu, Qin Zhang, Kai Wuhan University of Science and Technology School of Computer Science and Technology China Hubei Province Key Laboratory of Intelligent Information Processing and Real-Time Industrial System China Nsfocus Technologies Group Co. Ltd China Wuhan University School of Cyber Science and Engineering China

ISBN: (纸本)9798350330717

5G Core network (5GC) employs a Service Based Architecture (SBA). This architecture decomposes the control plane into multiple independent Network Functions (NFs). NFs open interfaces to provide services to other NFs, which makes the control plane more susceptible to external malicious attacks. However, existing anomaly detection methods focus more on traffic statistics features and are difficult to apply to the 5GC control plane. In this paper, we proposed GSAD, a Graph-Sequence analysis-based Anomaly Detection method for 5GC control plane traffic. We model control plane traffic as a directed graph to depict topological and NF interaction information. Further, we use the normalizing flows with temporal dependencies to mine the sequential information in the traffic. GSAD combines the topological and sequential information to provide fine-grained detection. We evaluate our proposed framework on the 5GC testbed using Free5GC and UERANSIM in various scenarios. Experimental results demonstrate that our framework outperforms the baselines significantly in terms of detection performance. © 2023 IEEE.

关键词： 5G core network anomaly detection control plane graph neural network normalizing flows

来源：评论

学校读者我要写书评

暂无评论

IntML-KNN: A Few-Shot Radio Frequency Fingerprint Identification Scheme for Lora Devices

引用

IEEE Signal Processing Letters 2025年 32卷 2259-2263页

作者： Cao, Xin Tan, Weijie Gao, Qiangqiang Hu, Zhilong Li, Chunguo Guizhou University College of Computer Science and Technology Guiyang550025 China Guizhou University State Key Laboratory of Public Big Data College of Computer Science and Technology Guiyang550025 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Ministry of Industry and Information Technology Laboratory of Cryptograph Application Technology Innovation and Testing Verification Beijing100015 China Southeast University School of Information Science and Engineering Nanjing210096 China

Deep learning (DL) is widely used in radio frequency fingerprint identification (RFFI). However, in few-shot case, traditional DL-based RFFI need to construct auxiliary dataset to realize radio frequency fingerprint identification. To address this issue, we propose a few-shot RFFI (FS-RFFI) method based on interpolating metric learning and KNN (IntML-KNN). Specifically, the method first extends the dataset with data augmentation, and CutMix interpolation. Secondly, combining with metric learning to enhance the generalization capacity of the model. Finally, KNN algorithm is designed to realize device classification and detection. The proposed IntML-KNN method is verified on the commercial available LoRa dataset. The experimental results indicate that the proposed scheme exhibits strong classification and generalization performance in FS-RFFI. Meanwhile, the recognition rate of the proposed IntML-KNN reaches 97.00% with only 10% samples. © 1994-2012 IEEE.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Invertible Mosaic Image Hiding Network for Very Large Capacity Image Steganography

Invertible Mosaic Image Hiding Network for Very Large Capaci...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Zihan Chen Tianrui Liu Jun-Jie Huang Wentao Zhao Xing Bi Meng Wang College of Computer Science and Technology National University of Defense Technology China College of System Engineering National University of Defense Technology China School of Computer Science and Information Engineering Hefei University of Technology China

The existing image steganography methods either sequentially conceal secret images or conceal a concatenation of multiple images. In such ways, the interference of information among multiple images will become increasingly severe when the number of secret images becomes larger, thus restrict the development of very large capacity image steganography. In this paper, we propose an Invertible Mosaic Image Hiding Network (InvMIHNet) which realizes very large capacity image steganography with high quality by concealing a single mosaic secret image. InvMIHNet consists of an Invertible Image Rescaling (IIR) module and an Invertible Image Hiding (IIH) module. The IIR module works for downscaling the single mosaic secret image form by spatially splicing the multiple secret images, and the IIH module then conceal this mosaic image under the cover image. The proposed InvMIHNet successfully conceal and reveal up to 16 secret images with a small number of parameters and memory consumption. Extensive experiments on ImageNet-1K, COCO and DIV2K show InvMIHNet outperforms state-of-the-art methods in terms of both the imperceptibility of stego image, recover accuracy of secret image and security against steganlysis methods. The code is available at https://***/Brittany-Chen/InvMIHNet.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Monocular Depth Estimation with Boundary Attention Mechanism and Shifted Window Adaptive Bins

SSRN

引用

SSRN 2024年

作者： Liang, Mengnan Wang, Congcong Zhao, Meng Shi, Fan Zhang, Chao Han, Yilin School of Computer Science and Engineering Tianjin University of Technology Tianjin300384 China Laboratory of Computer Vision System of Ministry of Education Tianjin University of Technology Tianjin300384 China

Monocular depth estimation is a classic research topic in computer vision. In recent years, development of Convolutional Neural Networks (CNNs) has facilitated significant breakthroughs in this field. However, there still are two challenges: 1) The network struggles to effectively fuse edge features in the feature fusion stage, which ultimately results in the loss of structure or distorted boundaries of objects in the scene. 2) Classification based studies typically depend on Transformers for global modeling, a process that often introduces substantial performance overhead. In this paper, we propose two modules to address the aforementioned issues. The first module is the Boundary Attention Module (BAM), which leverages the attention mechanism to enhance the ability of the network to perceive object boundaries during the feature fusion stage. In addition, to mitigate the performance overhead resulting from predicting adaptive bins, we propose a Shift Window Adaptive Bins (SWAB) module to reduce the amount of calculation in global modeling. The proposed method is evaluated on two public datasets, NYU Depth V2 and KITTI, and achieves state-of-the-art (SOTA) performance. © 2024, The Authors. All rights reserved.

关键词： computer vision

来源：评论

学校读者我要写书评

暂无评论

Virtual sample generation for model-based prognostics and health management of on-board high-speed train control system

引用

High-Speed Railway 2023年第3期1卷 153-161页

作者： Jiang Liu Baigen Cair Jinlan Wang Jian Wang School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China Frontiers Science Center for Smart High-speed Railway System Bejing Jiaotong UniversityBeijing 100044China School of Computer and Information Technology Bejing Jiaotong UniversityBejing 100044China Guangzhou Railway Polytechnic Guangzhou 511300China

In view of class imbalance in data-driven modeling for Prognostics and Health Management(PHM),existing classification methods may fail in generating effective fault prediction models for the on-board high-speed train control equipment.A virtual sample generation solution based on Generative Adversarial Network(GAN)is proposed to overcome this *** at augmenting the sample classes with the imbalanced data problem,the GAN-based virtual sample generation strategy is embedded into the establishment of fault prediction *** the PHM framework of the on-board train control system,the virtual sample generation principle and the detailed procedures are *** the enhanced class-balancing mechanism and the designed sample augmentation logic,the PHM scheme of the on-board train control equipment has powerful data condition adaptability and can effectively predict the fault probability and life cycle *** data from a specific type of on-board train control system is employed for the validation of the presented *** comparative results indicate that GAN-based sample augmentation is capable of achieving a desirable sample balancing level and enhancing the performance of correspondingly derived fault prediction models for the Condition-based Maintenance(CBM)operations.

关键词： High-speed railway Prognostics and health management Train control Virtual sample Generative adversarial network

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

arXiv

引用

arXiv 2025年

作者： Bi, Zhangqian Wan, Yao Chu, Zhaoyang Hu, Yufei Zhang, Junyi Zhang, Hongyu Xu, Guandong Jin, Hai National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is computationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks. © 2025, CC BY-NC-SA.

关键词： Adversarial machine learning

来源：评论

学校读者我要写书评

暂无评论

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-Preserving Talking Face Synthesis

DEGSTalk: Decomposed Per-Embedding Gaussian Fields for Hair-...

引用

International Conference on Acoustics, Speech, and Signal Processing (ICASSP)

作者： Kaijun Deng Dezhi Zheng Jindong Xie Jinbao Wang Weicheng Xie Linlin Shen Siyang Song Computer Vision Institute School of Computer Science and Software Engineering Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Guangdong Provincial Key Laboratory of Intelligent Information Processing Department of Computer Science University of Exeter

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Accurately synthesizing talking face videos and capturing fine facial features for individuals with long hair presents a significant challenge. To tackle these challenges in existing methods, we propose a decomposed per-embedding Gaussian fields (DEGSTalk), a 3D Gaussian Splatting (3DGS)-based talking face synthesis method for generating realistic talking faces with long hairs. Our DEGSTalk employs Deformable Pre-Embedding Gaussian Fields, which dynamically adjust pre-embedding Gaussian primitives using implicit expression coefficients. This enables precise capture of dynamic facial regions and subtle expressions. Additionally, we propose a Dynamic Hair-Preserving Portrait Rendering technique to enhance the realism of long hair motions in the synthesized videos. Results show that DEGSTalk achieves improved realism and synthesis quality compared to existing approaches, particularly in handling complex facial dynamics and hair preservation. Our code is available at https://***/CVI-SZU/DEGSTalk.

关键词： Hair Training Three-dimensional displays Dynamics Signal processing Rendering (computer graphics) Noise measurement Speech processing Faces Videos

来源：评论

学校读者我要写书评

暂无评论

Multi-secret Sharing Scheme for Zero Trust Environment 14

Multi-secret Sharing Scheme for Zero Trust Environment

引用

14th IEEE International Conference on Software engineering and Service Science, ICSESS 2023

作者： Zhou, Qin Yang, Rumiao Zhou, Hao Cai, Lei Yongyou Network Technology Co. Ltd Beijing China School of Computer and Communication Engineering University of Science and Technology Beijing Beijing China North China Institute of Computing Technology The 4th System Department Beijing China

ISBN: (纸本)9798350336269

The zero-trust concept of 'never trust, always verify' injected new vitality into the development of network security. However, the related research on zero trust is still preliminary, and the research on secure data transmission is relatively less. How to achieve secure data transmission in zero trust environment is a problem to be solved. Aiming the data transmission scenario of private data secret sharing among agents, this paper proposed a secure data transmission scheme based on multi-secret sharing to solve the problems of identity comparison confirmation of participants and adjust the access structure according to the security value of trust evaluation in existing secret sharing schemes. The proposed scheme adopts the secret sharing design without the trusted third party, which avoids the security risk of trusted third party disclosure in the traditional secret sharing scheme. Secondly, in the system parameter setting phase, the identity of participants and zero-trust identity database are compared to combine the characteristics of zero-trust 'identity authentication', to improve the security of secret sharing. Finally, during secret distribution, zero-trust trust evaluation security values are used to adjust the access structure based on zero-trust 'trust evaluation' to ensure secure data transmission. © 2023 IEEE.

关键词： Data communication systems

来源：评论

学校读者我要写书评

暂无评论

How to Select Pre-Trained Code Models for Reuse? A Learning Perspective

How to Select Pre-Trained Code Models for Reuse? A Learning ...

引用

IEEE International Conference on Software Analysis, Evolution and Reengineering (SANER)

作者： Zhangqian Bi Yao Wan Zhaoyang Chu Yufei Hu Junyi Zhang Hongyu Zhang Guandong Xu Hai Jin National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China School of Big Data and Software Engineering Chongqing University Chongqing China School of Computer Science University of Technology Sydney Sydney Australia

ISBN: (数字)9798331535100

ISBN: (纸本)9798331535117

Pre-training a language model and then fine-tuning it has shown to be an efficient and effective technique for a wide range of code intelligence tasks, such as code generation, code summarization, and vulnerability detection. However, pre-training language models on a large-scale code corpus is compu-tationally expensive. Fortunately, many off-the-shelf Pre-trained Code Models (PCMs), such as CodeBERT, CodeT5, CodeGen, and Code Llama, have been released publicly. These models acquire general code understanding and generation capability during pre-training, which enhances their performance on downstream code intelligence tasks. With an increasing number of these public pre-trained models, selecting the most suitable one to reuse for a specific task is essential. In this paper, we systematically investigate the reusability of PCMs. We first explore three intuitive model selection methods that select by size, training data, or brute-force fine-tuning. Experimental results show that these straightforward techniques either perform poorly or suffer high costs. Motivated by these findings, we explore learning-based model selection strategies that utilize pre-trained models without altering their parameters. Specifically, we train proxy models to gauge the performance of pre-trained models, and measure the distribution deviation between a model's latent features and the task's labels, using their closeness as an indicator of model transferability. We conduct experiments on 100 widely-used open-source PCMs for code intelligence tasks, with sizes ranging from 42.5 million to 3 billion parameters. The results demonstrate that learning-based selection methods reduce selection time to 100 seconds, compared to 2,700 hours with brute-force fine-tuning, with less than 6% performance degradation across related tasks.

关键词： Phase change materials Analytical models Adaptation models Codes Costs Computational modeling Training data Machine learning Software Software development management

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：