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

Network intrusion detection based on feature fusion of attack dimension

Journal of Supercomputing 2025年第6期81卷 1-33页

作者： Sun, Xiaolong Gu, Zhengyao Zhang, Hao Gu, Jason Liu, Yanhua Dong, Chen Ye, Junwei College of Computer and Data Science Fuzhou University Fuzhou350116 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350116 China Engineering Research Center of Big Data Intelligence Chinese Ministry of Education Fuzhou350116 China Department of Electrical and Computer Engineering Dalhousie University HalifaxNSB3J 1Z1 Canada

Network traffic anomaly detection involves the rapid identification of intrusions within a network through the detection, analysis, and classification of network traffic data. The variety of cyberattacks encompasses diverse attack principles. Employing an indiscriminate feature selection strategy may lead to the neglect of key features highly correlated with specific attack types. This oversight could diminish the recognition rate for that category, thereby impacting the overall performance of the detection model. To address this issue, this paper proposes a network traffic anomaly detection model based on the fusion of attack-dimensional features. Firstly, construct binary classification datasets independently for each attack class and perform individual feature selection to extract positively correlated features for each class. The features are then fused by employing a combination methods. Subsequently, based on the fused sub-datasets, base classifiers are trained. Finally, an ensemble learning approach is introduced to integrate the predictions of individual classifiers, enhancing the robustness of the model. The proposed approach, validated on NSL-KDD and UNSW-NB15 benchmark datasets, outperforms the latest methods in the field by achieving a 2% and 7% increase in precision on weighted averages. © The Author(s), under exclusive licence to Springer Science+Business Media, LLC, part of Springer Nature 2025.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

A Tetrahedral Spectral Element Method for Thermo-Mechanical Analysis of Electronic Devices

引用

IEEE Transactions on Components, Packaging and Manufacturing Technology 2025年

作者： Feng, Naixing Zhang, Shuai Huang, Zhixiang Liu, Qi Qiang Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Information Materials and Intelligent Sensing Laboratory of Anhui Province Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes Hefei China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou310018 China

For the coupled thermo-mechanical simulation of complex electronic devices, we propose a Tetrahedral Spectral Element Method (TSEM), which truly combines the high accuracy of spectral methods with the strong geometric adaptability of Finite Element Methods (FEMs). The TSEM employs a collapse transformation method and successfully converts the orthogonal Gauss-Lobatto-Legendre (GLL) basis functions from a hexahedron to a tetrahedral reference element. This ensures numerical accuracy and stability for arbitrary high-order interpolation. We also generate non-equidistant GLL spectral interpolation nodes for tetrahedral elements through Warp&Blend transformation, enabling direct nodal numerical integration calculation through Vandermonde matrices. This approach replaces the classical Gaussian quadrature in the FEM, not only significantly enhancing the computational efficiency of element matrix but also avoiding potential numerical dissipation and dispersion associated with Gaussian integration, thus achieving rapid convergence. In the TSEM thermo-mechanical coupling, we further construct a separate solver based on the implicit Newmark-β method, which realizes unconditional stability for temporal integration for arbitrary time step increment. Moreover, it supports independent inversion of system matrices for temperature and stress fields, without increasing computational resource consumption due to the coupling of multi-physics equations. By quantitatively comparing with the COMSOL Multiphysics software, several typical case studies are used to demonstrate the significant advantages of the TSEM in numerical accuracy, efficiency, and stability. © 2025 IEEE. All rights reserved.

关键词： Orthogonal functions

来源：评论

学校读者我要写书评

暂无评论

A Nonconformal SETI-DP Method for Transient Thermal Simulation

引用

IEEE Transactions on Components, Packaging and Manufacturing Technology 2025年

作者： Feng, Naixing Li, Hongyang Huang, Zhixiang Liu, Qi Qiang Anhui University Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education The Information Materials and Intelligent Sensing Laboratory of Anhui Province The Key Laboratory of Electromagnetic Environmental Sensing of Anhui Higher Education Institutes Hefei China Hangzhou Dianzi University School of Electronics and Information Engineering Hangzhou310018 China

This paper proposes a novel nonconformal meshbased dual-primal spectral element tearing and interconnecting (SETI-DP) method designed for the efficient transient simulation of complex large-scale heat conduction problems utilizing a domain decomposition method (DDM). This method allows for the division of complex, large-scale problems into smaller subdomain problems. By applying Robin-type transmission conditions at the subdomain interfaces, rapid convergence of the global interface iterative solution is achieved for arbitrary non-conformal subdomain problems. This non-conformal DDM approach supports independent meshing of subdomains, eliminating the need to generate a globally continuous mesh for large-scale problems, thereby significantly enhancing meshing efficiency. In addition, this non-conformal meshing strategy enables high-contrast spatial discretization and mixed-order spectral interpolation between different subdomains. This significantly increases meshing flexibility, minimizes the number of degrees of freedom (DoF) in multi-scale problems, and reduces computational costs. In addition, by developing a subdomain-coupled time iteration scheme, the global corner problem of residual transfer is explicitly given, which greatly improves the versatility and flexibility of the algorithm. Finally, to demonstrate the accuracy, efficiency, and robustness of our algorithm, we conduct benchmark tests on several representative examples. © 2011-2012 IEEE.

关键词： Domain decomposition methods

来源：评论

学校读者我要写书评

暂无评论

Transductive Few-shot Learning via Joint Message Passing and Prototype-based Soft-label Propagation

引用

ACM Transactions on Multimedia computing, Communications and Applications 2025年第4期21卷

作者： Wang, Jiahui Xu, Qin Jiang, Bo Luo, Bin The Key Laboratory of Intelligent Computing and Signal Processing Ministry of Education Anhui Provincial Key Laboratory of Multimodal Cognitive Computation School of Computer Science and Technology Anhui University Hefei230601 China The Information Materials and Intelligent Sensing Laboratory of Anhui Province School of Computer Science and Technology Anhui University The Institute of Artificial Intelligence Hefei Comprehensive National Science Center Hefei China

The transductive Few-shot Learning (FSL) mostly employs either prototype learning or label propagation methods to generalize to new classes by using the information of all query samples. However, existing methods have several main limitations. First, the prototype methods mainly focus on support samples which fail to fully exploit the relationships of query samples. Second, existing label propagation methods are generally not effective for the class-imbalanced problem. Third, existing works usually optimize the learnable parameters during inference which significantly reduces the efficiency of existing methods. To address these limitations, this article proposes an efficient and robust method for transductive FSL problem, termed Prototype-based Soft-label Propagation (PSLP), which combines the prototype learning and label propagation together for FSL problem. In our proposed method, first, the soft-label presentation for each query sample is estimated by leveraging prototypes. Then, the soft-label propagation is conducted on the learned query-support graph and the prototype representation is rectified. Both steps are conducted progressively for boosting the performance. Moreover, to learn effective prototypes for soft-label estimation and the desirable query-support graph for soft-label propagation, we design a new joint message passing scheme to learn the sample presentation and relational graph jointly. The PSLP method is parameter-free and can be implemented very efficiently. The experiments conducted on four popular benchmarks show that our method achieves competitive results on both balanced and imbalanced settings compared to the state-of-the-art methods. The code is released at https://***/mobulan/PSLP. © 2025 Copyright held by the owner/author(s).

关键词： Few-shot learning Transductive learning Message passing Label propagation

来源：评论

学校读者我要写书评

暂无评论

Relaxing Distillation Constraints for Improved New Class Learning in Continual Semantic Segmentation

Relaxing Distillation Constraints for Improved New Class Lea...

引用

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

作者： Zheng Ti Xuze Hao Renhai Chen College of Intelligence and Computing Tianjin University Tianjin China School of Computer Science Shanghai Key Laboratory of Intelligent Information Processing Fudan University China

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Continual Semantic Segmentation (CSS) aims to continuously learn new classes while mitigating catastrophic forgetting. Existing CSS methods primarily address this challenge through knowledge distillation. While they focus on maintaining stability for old classes, this emphasis often restricts plasticity in learning new ones. In this work, we propose two plug-and-play methods to better balance stability and plasticity. First, for feature map distillation, we replace pixel-level constraints with statistical information extraction within a window, improving the learning of new classes while preserving structural integrity to overcome forgetting. Second, we use relative ranks of predictions to replace exact probabilistic values to loosen the constraints in the logit distribution of old classes. Extensive experiments demonstrate that our methods outperform state-of-the-art methods when integrating into several baselines across various CSS scenarios.

关键词： Semantic segmentation Semantics Signal processing Feature extraction Probabilistic logic information retrieval Acoustics Data mining Speech processing

来源：评论

学校读者我要写书评

暂无评论

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 High-Quality and Efficient Bus-Aware Global Router

引用

Chinese Journal of Electronics 2025年第2期34卷 444-456页

作者： Liu, Genggeng Wei, Ling Yu, Yantao Xu, Ning College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou350108 China School of Information Engineering Wuhan University of Technology Wuhan430070 China

As advanced technology nodes enter the nanometer era, the complexity of integrated circuit design is increasing, and the proportion of bus in the net is also increasing. The bus routing has become a key factor affecting the performance of the chip. In addition, the existing research does not distinguish between bus and non-bus in the complete global routing process, which directly leads to the expansion of bus deviation and the degradation of chip performance. In order to solve these problems, we propose a high-quality and efficient bus-aware global router, which includes the following key strategies: By introducing the routing density graph, we propose a routing model that can simultaneously consider the routability of non-bus and the deviation value of bus;A dynamic routing resource adjustment algorithm is proposed to optimize the bus deviation and wirelength simultaneously, which can effectively reduce the bus deviation;We propose a layer assignment algorithm consider deviation to significantly reduce the bus deviation of the 3D routing solution;And a depth-first search (DFS)-based algorithm is proposed to obtain multiple routing solutions, from which the routing result with the lowest deviation is selected. Experimental results show that the proposed algorithms can effectively reduce bus deviation compared with the existing algorithms, so as to obtain high-quality 2D and 3D routing solutions considering bus deviation. © 2015 Chinese Institute of Electronics.

关键词： Integrated circuit layout

来源：评论

学校读者我要写书评

暂无评论

Unified Feature Selection Approach for Complex Data Based on Fuzzy β-Covering Reduction via information Granulation

引用

IEEE Transactions on Neural Networks and Learning Systems 2025年 PP卷 PP页

作者： Zou, Xiongtao Dai, Jianhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering School of Mathematics and Statistics Changsha410081 China

Feature selection, as an important step of data analysis, is widely used in the fields of data mining, machine learning, and artificial intelligence. It can not only effectively alleviate the curse of dimensionality and improve model performance but also enhance model interpretability. In the real world, data is usually complex such as different feature types, the presence of missing values, and so on. However, most existing feature selection approaches are only capable of handling data with a single feature type. To address the issue of feature selection under the environment of complex data, this article proposes a unified feature selection (UFS) approach for complex data based on fuzzy β-covering reduction via information granulation. To begin with, several monotonic uncertainty measures for fuzzy β-covering are constructed from the viewpoints of algebra and information theory. Based on the proposed measures, two forward heuristic algorithms are designed for fuzzy β-covering reduction. Meanwhile, the complex data with multiple features is represented by fuzzy β-covering via information granulation. On this basis, a UFS approach is put forward for complex data. Finally, the effectiveness and superiority of the proposed approach are verified through a series of experiments compared with 12 state-of-the-art feature selection approaches. © 2012 IEEE.

关键词： Granular computing

来源：评论

学校读者我要写书评

暂无评论

FGCM: Modality-behavior Fusion Model Integrated with Graph Contrastive Learning for Multimodal Recommendation

引用

IEEE Multimedia 2025年

作者： Mo, Feng Xiao, Lin Song, Qiya Gao, Xieping Song, Wenzhuo Wang, Shoujin Hunan Normal University Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Changsha410081 China Northeast Normal University Changchun China University of Technology Sydney Sydney Australia

Multimodal recommender systems (MRSs) aim to integrate information from multiple modalities, for better capturing users' preferences. However, existing MRSs usually face the challenge of data sparsity, especially for the limited user-item interactions. It is not uncommon that a user interacts with only a few items out of millions. More importantly, the interaction information is easy to be overwhelmed, leading to poor recommendation performance. To tackle these significant gaps for further improving the performance of MRSs, we propose a Modality-behavior Fusion Model Integrated with Graph Contrastive Learning for Multimodal Recommendation (FGCM). First, through the introduction of random noise into graph contrastive learning, FGCM adeptly mitigates data sparsity. Then, a modality-behavior fuser is proposed to effectively fuse interaction data and multimodal side information data by taking cooperative signals and multimodal signals as the guidance. Extensive experiments on three datasets demonstrate that our proposed approach outperforms several state-of-the-art methods. © 2025 IEEE.

关键词： Contrastive Learning

来源：评论

学校读者我要写书评

暂无评论

A New Dual-Population Evolutionary Algorithm Leveraging Objective-Constraint Relationships for Constrained Multi-Objective Optimization

SSRN

引用

SSRN 2025年

作者： Ye, Jialu Tan, Chaogui Xia, Yizhang Hou, Zhanglu Liu, Yuan Zou, Juan Hunan Engineering Research Center of intelligent System Optimization and Security Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Hunan National Applied Mathematics Center China Xiangtan University China

Population co-evolution strategies are widely used to handle constrained multi-objective optimization problems (CMOPs). However, existing coevolutionary algorithms oversimplify population collaboration and are rigid in evolving the auxiliary population, ignoring the importance of maintaining population diversity, especially for CMOPs with irregular feasible regions. To tackle this issue, we propose a new dual-population evolutionary algorithm, denoted as AACMO, which attempts to mine the relational features between the unconstrained Pareto front (UPF) and the constrained Pareto front (CPF) to better adapt to CMOPs with various constraints. Specifically, the method is categorized into two phases: a learning phase and an evolving phase. First, the main population (MP) aims to quickly learn the relationships between the UPF and the CPF by leveraging the advantages of different operators, namely, genetic algorithm operators and differential evolution operators, during the learning phase. Secondly, two auxiliary strategies are designed to collaborate with the MP during the evolving phase. These strategies are capable of employing a more effective co-evolution method to assist the MP in maintaining diversity, based on the degree of alignment between the learned UPF and CPF at the end of the learning phase. The effectiveness of AACMO is confirmed through comparative analysis with eight state-of-the-art algorithms across four CMOP benchmark suites. © 2025, The Authors. All rights reserved.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：