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

ETFIDS: An Entropy-Driven, Time-Frequency Analysis Framework for In-Vehicle CAN Signal Intrusion Detection

IEEE Internet of Things Journal 2025年

作者： Liu, Wanning Qin, Guihe Liang, Yanhua Song, Jiaru Liu, Qingxin Zhou, Xue Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education College of Computer Science and Technology Changchun130012 China

In recent years, cyberattacks against automobiles have exposed significant security threats to in-vehicle networks. The vulnerability of communication signals to malicious interference and manipulation can lead to serious system failures or abnormal behavior. The existing in-vehicle network intrusion detection methods do not fully exploit the time-frequency characteristics of Controller Area Network (CAN) signals. This limitation reduces their effectiveness in capturing subtle changes and signal complexity. Based on the above motivation, from the perspective of signal perception, we propose an entropy-driven, time-frequency analysis framework for in-vehicle network intrusion detection. The framework integrates a signal sampler, a frequency-domain detector, and a time-domain detector. The signal sampler, as the system's front-end module, extracts real-time physical signal data streams from CAN messages. The frequency-domain detector identifies frequency components, detecting high-frequency disturbances and cyclic variations. Meanwhile, the time-domain detector captures instantaneous changes and sudden anomalies. It analyzes signal complexity and anomalies through both stream and block detection. Experimental results demonstrate that the proposed method performs well under various attack scenarios, offering superior detection and real-time performance. It effectively senses multiple signal anomalies, providing a robust intrusion detection solution for modern in-vehicle networks. © 2025 IEEE.

关键词： Network intrusion

来源：评论

学校读者我要写书评

暂无评论

An Area Optimization Approach for Large-Scale RM-TB Dual Logic Circuits Based on a Multitasking Optimization Algorithm

引用

IEEE Transactions on Computers 2025年

作者： Wu, Xiaoqian Wang, Peng Li, Shaoquan Liu, Huaxiao Liu, Lei Jilin University College of Computer Science and Technology Changchun China Key Laboratory of Symbolic Computation China Knowledge Engineering of Ministry of Education China

Logic synthesis is a crucial step in integrated circuit design, and area optimization is an indispensable part of this process. However, the area optimization problem for large-scale Fixed Polarity Reed-Muller (FPRM) circuits is an NP-hard problem. To address this problem, we divide Boolean circuits into small-scale circuits based on the idea of divide-and-conquer using the proposed grouping decomposition mechanism. Each small-scale Boolean circuit is transformed into an FPRM circuit by a polarity transformation algorithm. To ensure the circuit’s functionality remains unaffected, we integrate FPRM circuits into an FPRM and Boolean (RM-TB) dual logic circuit based on the proposed gate-level integration. However, the area optimization problem of RM-TB dual logic circuits is a multi-task, high-dimensional, and multi-extremal combinatorial optimization problem. Therefore, we propose a Multipopulation Multitasking Optimization Algorithm (MMuOA) that integrates self-evolution with a multitasking equilibrium optimizer and cross-task evolution through knowledge sharing and transfer. This forms a dynamic optimization framework for simultaneously searching for the optimal polarity corresponding to the minimal area of RM-TB dual logic circuits. Moreover, we propose an Area Optimization Approach (AOA) for an RM-TB dual logic circuit with the minimum area using the MMuOA. Experimental results based on the Microelectronics Center of North Carolina (MCNC) Benchmark test circuits demonstrate the effectiveness and superiority of the AOA compared to the state-of-the-art area optimization approach. © 1968-2012 IEEE.

关键词： Combinatorial optimization

来源：评论

学校读者我要写书评

暂无评论

Dual-level Mixup for Graph Few-shot Learning with Fewer Tasks 34

Dual-level Mixup for Graph Few-shot Learning with Fewer Task...

引用

34th ACM Web Conference, WWW 2025

作者： Liu, Yonghao Li, Mengyu Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu College of Computer Science and Technology Jilin University Changchun China Department of Information Engineering and Computer Science University of Trento Trento Italy Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education China

ISBN: (纸本)9798400712746

Graph neural networks have been demonstrated as a powerful paradigm for effectively learning graph-structured data on the web and mining content from it. Current leading graph models require a large number of labeled samples for training, which unavoidably leads to overfitting in few-shot scenarios. Recent research has sought to alleviate this issue by simultaneously leveraging graph learning and meta-learning paradigms. However, these graph meta-learning models assume the availability of numerous meta-training tasks to learn transferable meta-knowledge. Such assumption may not be feasible in the real world due to the difficulty of constructing tasks and the substantial costs involved. Therefore, we propose a SiMple yet effectIve approach for graph few-shot Learning with fEwer tasks, named SMILE. We introduce a dual-level mixup strategy, encompassing both within-task and across-task mixup, to simultaneously enrich the available nodes and tasks in meta-learning. Moreover, we explicitly leverage the prior information provided by the node degrees in the graph to encode expressive node representations. Theoretically, we demonstrate that SMILE can enhance the model generalization ability. Empirically, SMILE consistently outperforms other competitive models by a large margin across all evaluated datasets with in-domain and cross-domain settings. Our anonymous code can be found here. © 2025 Copyright held by the owner/author(s).

关键词： Few-shot learning Graph neural network Node classification

来源：评论

学校读者我要写书评

暂无评论

Dual Space Representation Learning for Skeleton-based Action Recognition

引用

IEEE Signal Processing Letters 2025年 32卷 2104-2108页

作者： Yang, Yuheng Chen, Haipeng Liu, Zhenguang Hu, Sihao Jiao, Yingying Jilin University College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Changchun130012 China Zhejiang University School of Cyber Science and Technology Hangzhou310007 China Georgia Institute of Technology College of Computing GA United States

Skeleton-based action recognition is crucial for machine intelligence. Current methods generally learn from 3D articulated motion sequences in the straightforward Euclidean space. Yet, the vanilla Euclidean space may not be the optimal choice for modeling the intricate correlations among human body joints. This challenge arises from the non-Euclidean nature of human anatomy, where joint correlations often vary non-linearly during movement. To address this, we propose a dual space representation learning method. Specifically, we represent the motion sequences in Hyperbolic space, leveraging its intrinsic properties to capture the non-Euclidean latent anatomy of human motions. We then incorporate the motion features from both Hyperbolic and Euclidean spaces, allowing us to precisely model the non-linear joint correlations while effectively sketching human poses. The proposed method empirically achieves state-of-the-art performance on the NTU RGB+D 60, NTURGB+D 120, and NW-UCLA datasets. © 1994-2012 IEEE.

关键词： Digital arithmetic

来源：评论

学校读者我要写书评

暂无评论

Auxiliary Tasks Benefit Skeleton-based Action Recognition

Auxiliary Tasks Benefit Skeleton-based Action Recognition

引用

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

作者： Yuheng Yang Haipeng Chen College of Computer Science and Technology Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Skeleton-based action recognition has long been a fundamental and intriguing problem in machine intelligence. This task is challenging due to pose occlusion and rapid motion, which typically results in incomplete or noisy skeleton data. State-of-the-art methods tend to learn human motion directly from these corrupted skeletons as if they were reliable. Unfortunately, this might lead to unsatisfactory results when key regions of the skeleton are occluded or disturbed. To tackle the problem, we propose a novel framework that integrates auxiliary tasks into a motion modeling network. These auxiliary tasks corrupt partial human skeletons with masking or noise and then force the network to recover the corrupted data, explicitly facilitating robust feature representation learning. We further propose supervising the auxiliary tasks with mutual information losses, mathematically ensuring feature consistency and spatial alignment between the recovered and original skeleton data. Empirically, our approach sets the new state-of-the-art performance on three benchmark datasets.

关键词： Representation learning Noise Speech recognition Benchmark testing Skeleton Mathematical models Reliability Noise measurement Speech processing Mutual information

来源：评论

学校读者我要写书评

暂无评论

Structure-Based Uncertainty Estimation for Source-Free Active Domain Adaptation

引用

IET Computer Vision 2025年第1期19卷

作者： Ouyang, Jihong Zhang, Zhengjie Meng, Qingyi Chi, Jinjin College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

Active domain adaptation (active DA) provides an effective solution by selectively labelling a limited number of target samples to significantly enhance adaptation performance. However, existing active DA methods often struggle in real-world scenarios where, due to data privacy concerns, only a pre-trained source model is available, rather than the source samples. To address this issue, we propose a novel method called the structure-based uncertainty estimation model (SUEM) for source-free active domain adaptation (SFADA). To be specific, we introduce an innovative active sample selection strategy that combines both uncertainty and diversity sampling to identify the most informative samples. We assess the uncertainty in target samples using structure-wise probabilities and implement a diversity selection method to minimise redundancy. For the selected samples, we not only apply standard-supervised loss but also conduct interpolation consistency training to further explore the structural information of the target domain. Extensive experiments across four widely used datasets demonstrate that our method is comparable to or outperforms current UDA and active DA methods. © 2025 The Author(s). IET Computer Vision published by John Wiley & Sons Ltd on behalf of The Institution of engineering and Technology.

关键词： computer vision convolutional neural nets image classification

来源：评论

学校读者我要写书评

暂无评论

Task-oriented Multi-domain Adversarial Network for fake news detection

引用

Applied Soft Computing 2025年 177卷

作者： Zeqi, Guo Jihong, Ouyang Ximing, Li Changchun, Li College of Computer Science and Technology Jilin University Changchun China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun China

The proliferation of fake news on online social media has severely misled public perception of event authenticity. To combat this, various Fake News Detection (FND) methods have been developed for specific domains, typically requiring large amounts of labeled data for effective training. However, in some domains, labeled data remains scarce. Multi-domain Fake News Detection (MFND) provides a solution by training a model with data from multiple domains to identify news veracity across domains. Despite its potential, discrepancies in feature distributions across domains, known as domain shift, can negatively impact the effectiveness of joint training. To mitigate this, we propose the Task-oriented Multi-domain Adversarial Network (TMDA-NET), a novel MFND model designed to align feature distributions across domains within a unified feature space using domain adversarial learning. This approach enhances generalization in data-scarce domains. Given that FND is domain-dependent, we also propose a fusion mechanism with adjustable weights to incorporate domain-specific characteristics. Additionally, we introduce two task-oriented auxiliary classification tasks to efficiently align and integrate features, ultimately improving FND accuracy. Extensive experiments on publicly available Chinese and English datasets validate the effectiveness of our proposed model. © 2025

关键词： Labeled data

来源：评论

学校读者我要写书评

暂无评论

A Simple Graph Contrastive Learning Framework for Short Text Classification

arXiv

引用

arXiv 2025年

作者： Liu, Yonghao Giunchiglia, Fausto Huang, Lan Li, Ximing Feng, Xiaoyue Guan, Renchu Key Laboratory of Symbolic Computation and Knowledge Engineering of the Ministry of Education College of Computer Science and Technology Jilin University China University of Trento Italy

Short text classification has gained significant attention in the information age due to its prevalence and real-world applications. Recent advancements in graph learning combined with contrastive learning have shown promising results in addressing the challenges of semantic sparsity and limited labeled data in short text classification. However, existing models have certain limitations. They rely on explicit data augmentation techniques to generate contrastive views, resulting in semantic corruption and noise. Additionally, these models only focus on learning the intrinsic consistency between the generated views, neglecting valuable discriminative information from other potential views. To address these issues, we propose a Simple graph contrastive learning framework for Short Text Classification (SimSTC). Our approach involves performing graph learning on multiple text-related component graphs to obtain multi-view text embeddings. Subsequently, we directly apply contrastive learning on these embeddings. Notably, our method eliminates the need for data augmentation operations to generate contrastive views while still leveraging the benefits of multi-view contrastive learning. Despite its simplicity, our model achieves outstanding performance, surpassing large language models on various datasets. Copyright © 2025, The Authors. All rights reserved.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

Enhancing diabetes complications prediction through knowledge graphs and convolutional networks

引用

engineering Applications of Artificial Intelligence 2025年 153卷

作者： Cheng, Haitao Zheng, Qunli Li, Peng Xu, He School of Computer Science Nanjing University of Posts and Telecommunications Nanjing210023 China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin University Changchun130012 China

Early prediction of diabetes complications is crucial for timely intervention and effective disease management. However, current deep learning approaches often lack sufficient representation of diabetes knowledge and rely on large-scale annotated data. To address this, we propose a knowledge Graphs-enhanced Diabetes Complications Prediction (KGDCP) model, which integrates a physical examination knowledge graph and an improved Diabetes knowledge Graph (DiaKG) using self-attention-based convolutional neural networks. We construct the physical examination knowledge graph based on normal reference ranges of examination indicators and enhance DiaKG through knowledge deduplication and coreference resolution, improving its accuracy and comprehensiveness. Furthermore, we employ the embeddings of these two knowledge graphs to represent examination data and diagnostic information. A token-to-token (token2token) self-attention is utilized to explore dependencies among examination indicators, and convolutional neural networks extract local features to generate representation vectors. Additionally, source-to-token (source2token) self-attention assesses dependencies between diagnostic entities and the entire entity set, with entity-to-Physical Examination (entity2PE) attention gauging entity relevance to examination data representation vectors. Our model combines these features to enhance diabetes complications prediction, outperforming traditional models in predicting cerebral infarction and peripheral neuropathy. © 2025

关键词： knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Enabling Generalized Zero-Shot Vulnerability Classification

引用

IEEE Transactions on Dependable and Secure Computing 2025年

作者： Hu, Jinghao Guo, Jinsong Luo, Chen Hu, Yang Lanzinger, Matthias Li, Zhanshan Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Software Changchun130012 China University College London Department of Computer Science United Kingdom Amazon United States United Kingdom University of Oxford Department of Computer Science United Kingdom Jilin University Key Laboratory of Symbolic Computation and Knowledge Engineering Ministry of Education College of Computer Science and Technology Changchun130012 China

Regarding computer security, the growth of code vulnerability types presents a persistent challenge. These vulnerabilities, which may cause severe consequences, necessitate precise classification for effective mitigation. However, the rapid emergence of new vulnerability types complicates the classification process. Traditional methodologies, which often involve human expertise and the manual labeling or generation of example instances, are not only resource-intensive but also struggle to adapt to the dynamic nature of these vulnerabilities. This paper introduces VulnSense, an innovative method that harnesses the capabilities of Generalized Zero-Shot Learning (GZSL) to address the vulnerability classification problem. VulnSense learns about unseen vulnerability classes from the descriptions of these unseen classes, while not requiring to see any instances of these unseen classes. Specifically, VulnSense learns from three main resources: (1) seen classes with labeled code instances;(2) descriptions of these seen classes;and (3) descriptions of "unseen"classes which have no labeled instances. Our experiments underscore VulnSense's superiority over existing GZSL methods in classifying instances of unseen classes. Concurrently, it maintains a performance parity with traditional labeled-example based learning methods in classifying instances of seen vulnerabilities. VulnSense demonstrates the potential of using GZSL for vulnerability classification, while also highlighting challenges that inspire future work. © 2004-2012 IEEE.

关键词： Zero-shot learning

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：