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

An Unsupervised Malicious Web Request Detection based on Transformer and Contrastive Learning

IEEE Transactions on Network and Service Management 2025年

作者： He, Shiming Zhang, Ying Liang, Diqing Sharma, Pradip Kumar Changsha University of Science and Technology School of Computer Science and Technology Hunan Provincial Key Laboratory of Intelligent Processing of Big Data on Transportation Changsha410114 China University of Aberdeen Department of Computing Science AberdeenAB24 3UE United Kingdom

The World Wide Web (Web) is a crucial part of the Internet. Web attacks are becoming more and more serious and complex. Malicious Web request detection aims to rapidly and accurately identify abnormal attacks on the network. Deep learning is being applied to malicious Web request detection, resulting in high detection performance. However, most deep learning-based methods are supervised and ignore special characters, which are hard to detect unknown malicious Web requests. The labels of Web request are fewer and Web request data is insufficient. Therefore, we propose an unsupervised malicious Web request detection based on transformer and contrastive learning (UTCDetector). UTCDetector exploits preprocessing and 2-gram word segmentationto preserve special characters, extracts semantic feature by Transformer, and leverages hypersphere loss function and contrastive learning to handle insufficient Web data without abnormal label. Since the public Web request datasets (CSIC 2010, CSIC TORPEDA 2012, and ECML/PKDD 2007) were created before 2012, we collected Web requests from a university Web application server in 2023 to build a private dataset named School 2023. This dataset contains more modern and complex attacks. The experimental results on the four datasets demonstrate that our method achieves a higher F1-score than other existing methods and ablation variants. © 2004-2012 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed Problems in Malicious Traffic Detection

DSDIR: A Two-Stage Method for Addressing Noisy Long-Tailed P...

引用

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

作者： Guoliang Li Ruiqi Zhang Zhe Sun Lingkai Xing Yu Zhang College of Cyber Science Nankai University China Tianjin Key Laboratory of Network and Data Security Technology China Key Laboratory of Data and Intelligent System Security Ministry of Education China College of Computer Science Nankai University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

In recent years, deep learning based malicious traffic detection (MTD) systems have demonstrated remarkable success. However, their effectiveness tend to decrease because most malicious traffic datasets are suffered from noisy-labeled and long-tailed problems. While numerous approaches have been developed to address these two problems individually, they become inefficient when confronting the combined challenge of noisy long-tailed data, as they typically tackle only a single adverse factor at a time. This paper proposes a two-stage method called Distribution-aware sample Selection and Dynamic Instance-based Relabeling (DSDIR), which simultaneously addresses the impacts of noisy-labeled and long-tailed problems. In the first stage, a noise-independent clean sample selection method is designed to obtain a clean dataset, which converts negative effects of the long-tailed problem into positive ones. In the second stage, dynamic instance-based relabeling is designed to train a model and improve the dataset’s quality simultaneously. Eventually, DSDIR not only produces a balanced and noise-tolerant model but also obtains a clean dataset. Experimental results demonstrate that in the high noise condition of 60% and 80%, the accuracy rate of DSDIR is 5% higher than the state-of-the-art methods. Our code is available at https://***/nku-ligl/DSDIR.

关键词： Deep learning Computer vision Heavily-tailed distribution Codes Accuracy Noise Speech recognition Acoustics Noise measurement Speech processing

来源：评论

学校读者我要写书评

暂无评论

SolBERT: Advancing solidity smart contract similarity analysis via self-supervised pre-training and contrastive fine-tuning

引用

Information and Software Technology 2025年 184卷

作者： Tian, Zhenzhou Teng, Yudong Ke, Xianqun Chen, Yanping Chen, Lingwei School of Computer Science and Technology Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Shaanxi Key Laboratory of Network Data Analysis and Intelligent Processing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Xi'an Key Laboratory of Big Data and Intelligent Computing Xi'an University of Posts and Telecommunications Shaanxi Xi'an710121 China Department of Computer Science and Engineering Wright State University DaytonOH45435 United States

Context: Reliable and effective similarity analysis for the smart contracts facilitates the maintenance and quality assurance of the smart contract ecosystem. However, existing signature-based methods and code representation learning-based methods suffer from limitations such as heavy-weight program analysis payloads or suboptimal contract encodings. Objective: This paper aims to design a fully unsupervised language model for better capturing the syntactic and semantic richness of Solidity code, and utilizes it for advancing the effectiveness of smart contract similarity analysis. Methods: Inspired by the impressive semantic learning capability of pre-trained language models (PLMs), we propose SolBERT, a PLM specifically tailored for enhancing Solidity smart contracts similarity detection. To ensure it produces high-quality encodings, SolBERT leverages BERT-style pre-training with the masked language modeling (MLM) and token type prediction (TTP) tasks applied on code-structure-aware token sequences derived from the contracts’ abstract syntax trees (ASTs) through structure-retaining tree linearization and light-weight normalization to learn a base model. On this basis, self-supervised contrastive fine-tuning and unsupervised whitening operations are further performed to optimize contract encoding generation. Results: Experiments are conducted on three contract similarity-related tasks, including contract clone detection, bug detection, and code clustering. The results indicate that SolBERT significantly outperforms state-of-the-art approaches with average absolute gains of 21.33% and 21.50% in terms of F1, and 17.78% and 26.60% in terms of accuracy for the clone detection and bug detection tasks, respectively;and an average absolute gain of 17.97% for code clustering task. When applying both contrastive fine-tuning and whitening optimizations, SolBERT also shows superior performance than the case of lacking any of them. Conclusion: The proposed approach, SolBERT, ca

关键词： Reliability analysis

来源：评论

学校读者我要写书评

暂无评论

Comments and extensions on "State-equivalent form and minimum-order compensator design for rectangular descriptor systems"

arXiv

引用

arXiv 2025年

作者： Shi, Shuo Zhang, Juan Hunan Key Laboratory for Computation and Simulation in Science and Engineering Key Laboratory of Intelligent Computing and Information Processing Ministry of Education School of Mathematics and Computational Science Xiangtan University Xiangtan411105 China

This technical note presents a counterexample showing that the equivalence conditions proposed by Geng et al. (IEEE Trans. Automat. Control, 2024), which use a minimum-order compensator (MOC) to achieve desired designs, including generalized regularity or both generalized regularity and free of impulse, are sufficient but not necessary. Furthermore, revised equivalence conditions are introduced, along with an equivalence condition ensuring the closed-loop system remains generalized regular, impulse-free, and stable using MOC. Additionally, it is shown that output feedback can replace the MOC, achieving the same design without increasing dimensionality. These findings are validated through a circuit *** Codes 93B05, 93B52, 15A03 Copyright © 2025, The Authors. All rights reserved.

关键词： Feedback

来源：评论

学校读者我要写书评

暂无评论

A Lightweight and High-Fidelity Model for Generalized Audio-Driven 3D Talking Face Synthesis 27th

A Lightweight and High-Fidelity Model for Generalized Audi...

引用

27th International Conference on Pattern Recognition, ICPR 2024

作者： Liu, Shunce Zhong, Yuwei Wang, Huixuan Peng, Jingliang Shandong Provincial Key Laboratory of Network Based Intelligent Computing University of Jinan Jinan China School of Information Science and Engineering University of Jinan Jinan China School of Software and Microelectronics Peking University Beijing China School of Software Shandong University Jinan China

ISBN: (纸本)9783031781247

We present LW-GeneFace, a lightweight and high-fidelity model for generalized audio-driven facial animation, in this paper. We develop this model by reducing the size while maintaining the synthetic quality of GeneFace, an audio-driven facial animation model known for its high fidelity and generalization capabilities. Specifically, we compress the first and the third stages of GeneFace as they dominate the model size. In the first stage, we propose a lightweight version of the WaveNet-based network inspired by MobileNetV3 and DP-block. It utilizes depthwise separable convolution and dual-path feature extraction to compress the network while maintaining effective feature extraction. The shared network structure in the dual-path feature extraction further reduces model complexity and improves training efficiency. In the third stage, we generate realistic 3D renderings at reduced model size by introducing novelties in RAD-NeRF. Technically, we reduce the hash table sizes in the grid-based encoding modules, as well as present a lightweight bottleneck MLP architecture to increase the non-linearity of the model. Experimental results demonstrate that LW-GeneFace achieves state-of-the-art performance with both model size and synthetic quality considered. The source code of LW-GeneFace will be released after acceptance of this paper. © The Author(s), under exclusive license to Springer Nature Switzerland AG 2025.

关键词： Animation

来源：评论

学校读者我要写书评

暂无评论

Time-independent Spiking Neuron via Membrane Potential Estimation for Efficient Spiking Neural Networks

Time-independent Spiking Neuron via Membrane Potential Estim...

引用

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

作者： Hanqi Chen Lixing Yu Shaojie Zhan Penghui Yao Jiankun Shao Yunnan Key Laboratory of Intelligent Systems and Computing School of Information Science and Engineering Yunnan University China State Key Laboratory of Explosion Science and Technology Beijing Institute of Technology Beijing China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

The computational inefficiency of spiking neural networks (SNNs) is primarily due to the sequential updates of membrane potential, which becomes more pronounced during extended encoding periods compared to artificial neural networks (ANNs). This highlights the need to parallelize SNN computations effectively to leverage available hardware parallelism. To address this, we propose Membrane Potential Estimation Parallel Spiking Neurons (MPE-PSN), a parallel computation method for spiking neurons that enhances computational efficiency by enabling parallel processing while preserving the intrinsic dynamic characteristics of SNNs. Our approach exhibits promise for enhancing computational efficiency, particularly under conditions of elevated neuron density. Empirical experiments demonstrate that our method achieves state-of-the-art (SOTA) accuracy and efficiency on neuromorphic datasets. Codes are available at https://***/chrazqee/MPE-PSN.

关键词： Neuromorphics Computational modeling Neurons Membrane potentials Estimation Spiking neural networks Parallel processing Signal processing Computational efficiency Speech processing

来源：评论

学校读者我要写书评

暂无评论

Simplicial complexes graph convolution networks with higher-order features learning for limited samples diagnosis

引用

Control Engineering Practice 2025年 162卷

作者： Zhang, Xian-Jie Zhang, Hai-Feng Zhong, Kai Zhang, Xiao-Ming The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education School of Mathematical Science Anhui University Hefei 230601 Anhui China The Key Laboratory of Intelligent Computing and Signal Processing of the Ministry of Education Institutes of Physical Science and Information Technology Anhui University Hefei 230601 Anhui China

With the advancement of industrial automation, there is an increasing focus on research concerning limited fault samples. Although meta-learning and other methods can address this issue, they often necessitate the incorporation of additional data and are unable to directly diagnose faults using only unlabeled data along with a small amount of labeled data. In response, this article proposes the use of simplicial complexes graph convolutional networks for fault diagnosis, which simultaneously account for both higher-order and lower-order topological structures among samples. This approach effectively addresses the challenge of limited samples by extracting relevant information from unlabeled data without the need to introduce new knowledge. Initially, simplices of varying dimensions are employed within a constructed simple graph to represent different relationships among samples. Subsequently, the simplicial complexes convolutional network is introduced to capture the higher-order information, while the graph convolutional network is utilized to obtain the lower-order information. The combined feature information is then input into a classifier for fault diagnosis. Finally, experiments conducted on two datasets characterized by small sample sizes or imbalanced samples demonstrate the method's commendable diagnostic performance, as well as its robustness and practicality. © 2025 Elsevier Ltd

关键词： Industrial research

来源：评论

学校读者我要写书评

暂无评论

A Model-Agnostic Hierarchical Framework Towards Trajectory Prediction

引用

Journal of Computer science and Technology 2025年第2期40卷 322-339页

作者： Qian, Tang-Wen Wang, Yuan Xu, Yong-Jun Zhang, Zhao Wu, Lin Qiu, Qiang Wang, Fei Domain-Oriented Intelligent System Research Center Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China University of Chinese Academy of Sciences Beijing100190 China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences Beijing100190 China

Predicting the future trajectories of multiple agents is essential for various applications in real life, such as surveillance systems, autonomous driving, and social robots. The trajectory prediction task is influenced by many factors, including the individual historical trajectory, interactions between agents, and the fuzzy nature of the observed agents’ motion. While existing methods have made great progress on the topic of trajectory prediction, they treat all the information uniformly, which limits the effectiveness of information utilization. To this end, in this paper, we propose and utilize a model-agnostic framework to regard all the information in a two-level hierarchical view. Particularly, the first-level view is the inter-trajectory view. In this level, we observe that the difficulty in predicting different trajectory samples varies. We define trajectory difficulty and train the proposed framework in an "easy-to-hard" schema. The second-level view is the intra-trajectory level. We find the influencing factors for a particular trajectory can be divided into two parts. The first part is global features, which keep stable within a trajectory, i.e., the expected destination. The second part is local features, which change over time, i.e., the current position. We believe that the two types of information should be handled in different ways. The hierarchical view is beneficial to take full advantage of the information in a fine-grained way. Experimental results validate the effectiveness of the proposed model-agnostic framework. © Institute of computing Technology, Chinese Academy of sciences 2025.

关键词： Hierarchical systems

来源：评论

学校读者我要写书评

暂无评论

Joint Multi-Scale Contextual and Noise Suppression for Group Emotion Recognition

Joint Multi-Scale Contextual and Noise Suppression for Group...

引用

2025 IEEE International Conference on Acoustics, Speech, and Signal Processing, ICASSP 2025

作者： Guo, Wangdong Zhu, Qing Mao, Qirong School of Computer Science and Communication Engineering Jiangsu University China Jiangsu Engineering Research Center of Big Data Ubiquitous Perception and Intelligent Agriculture Applications China Provincial Key Laboratory of Computational Intelligence and New Technologies in Low-Altitude Digital Agriculture Zhenjiang China

ISBN: (纸本)9798350368741

Group Emotion Recognition (GER) seeks to identify emotional states within multi-person groups. The complexity of the environment and the reliance on a single group emotion label often result in noisy individuals with inconsistent emotional expressions, hampering accurate emotion classification. Mainstream GER networks attempt to downweight noisy individuals, but when their numbers are high and over-relying on a single group label, the negative impact of noise on individuals remains significant, further complicating classification and diminishing accuracy. To address these limitations, we propose the Multi-Scale Contextual and Noise Suppression Model (MCon-NSM), a novel framework that enhances GER by capturing fine-grained interaction contexts and collaboratively suppressing noise at both the individual and group label levels. Extensive experiments on the GAF series datasets demonstrate that our method achieves results comparable to state-of-the-art techniques, validating its effectiveness in mitigating noise in GER. © 2025 IEEE.

关键词： Emotion analysis Group emotion recognition Multi-Scale context learning Noise suppression

来源：评论

学校读者我要写书评

暂无评论

Location Privacy Preservation Crowdsensing With Federated Reinforcement Learning

引用

IEEE Transactions on Dependable and Secure computing 2025年第3期22卷 1877-1894页

作者： You, Zhichao Dong, Xuewen Liu, Ximeng Gao, Sheng Wang, Yongzhi Shen, Yulong Xidian University School of Computer Science and Technology The Engineering Research Center of Blockchain Technology Application and Evaluation Ministry of Education Xi'an710071 China Shaanxi Key Laboratory of Blockchain and Secure Computing Xi'an710071 China Fuzhou University College of Computer and Data Science Fuzhou350025 China Central University of Finance and Economics School of Information Beijing102206 China California State Polytechnic University Pomona Department of Computer Information Systems PomonaCA91768 United States Xidian University School of Computer Science and Technology Xi'an710071 China Shaanxi Key Laboratory of Network and System Security Xi'an710071 China

Crowdsensing has become a popular method of sensing data collection while facing the problem of protecting participants' location privacy. Existing location-privacy crowdsensing mechanisms focus on static tasks and participants without considering sensing tasks' time requirements and participants' mobility, which cannot achieve satisfactory collected data quality and task completion in crowdsensing with dynamic tasks and participants. Inspired by this, we proposed a location-preservation crowdsensing mechanism, FedSense, considering dynamic tasks and participants based on federated learning (FL) and reinforcement learning (RL). In FedSense, through RL's outstanding decision-making ability, participants select sensing tasks to perform by well-trained RL models without uploading location information to servers for task allocation. We propose an independent tasks selection environment that defines actions, states, and rewards of RL to enable FedSense to achieve satisfactory task completion and data quality while preserving location privacy. Besides, FedSense applies an asynchronous FL aggregation algorithm that reduces participants' network stabilization and device computing ability requirements. Analysis proves that participants' location information does not leave the local device during the model training and task selection process, effectively avoiding privacy leakage. Simulation shows that compared with existing location-preservation crowdsensing mechanisms, FedSense achieves the highest task completion and sensing accuracy for dynamic tasks and participants. © 2024 IEEE.

关键词： data privacy

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：