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

DMF: A Deep Multimodal Fusion-Based Network Traffic Classification Model

computers, Materials & Continua 2025年第5期83卷 2267-2285页

作者： Xiangbin Wang Qingjun Yuan Weina Niu Qianwei Meng Yongjuan Wang Chunxiang Gu Henan Key Laboratory of Network Cryptography Technology Information Engineering UniversityZhengzhou450001China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu611731China

With the rise of encrypted traffic,traditional network analysis methods have become less effective,leading to a shift towards deep learning-based *** these,multimodal learning-based classification methods have gained attention due to their ability to leverage diverse feature sets from encrypted traffic,improving classification ***,existing research predominantly relies on late fusion techniques,which hinder the full utilization of deep features within the *** address this limitation,we propose a novel multimodal encrypted traffic classification model that synchronizes modality fusion with multiscale feature ***,our approach performs real-time fusion of modalities at each stage of feature extraction,enhancing feature representation at each level and preserving inter-level correlations for more effective *** continuous fusion strategy improves the model’s ability to detect subtle variations in encrypted traffic,while boosting its robustness and adaptability to evolving network *** results on two real-world encrypted traffic datasets demonstrate that our method achieves a classification accuracy of 98.23% and 97.63%,outperforming existing multimodal learning-based methods.

关键词： Deep fusion intrusion detection multimodal learning network traffic classification

来源：评论

学校读者我要写书评

暂无评论

Solving the subset sum problem by the quantum Ising model with variational quantum optimization based on conditional values at risk

引用

science China(Physics,Mechanics & Astronomy) 2024年第8期67卷 43-55页

作者： Qilin Zheng Miaomiao Yu Pingyu Zhu Yan Wang Weihong Luo Ping Xu Institute for Quantum Information and State Key Laboratory of High Performance Computing College of Computer Science and TechnologyNational University of Defense TechnologyChangsha 410073China Hefei National Laboratory Hefei 230088China

The subset sum problem is a combinatorial optimization problem,and its complexity belongs to the nondeterministic polynomial time complete(NP-Complete)*** problem is widely used in encryption,planning or scheduling,and integer *** accurate search algorithm with polynomial time complexity has not been found,which makes it challenging to be solved on classical *** effectively solve this problem,we translate it into the quantum Ising model and solve it with a variational quantum optimization method based on conditional values at *** proposed model needs only n qubits to encode 2ndimensional search space,which can effectively save the encoding quantum *** model inherits the advantages of variational quantum algorithms and can obtain good performance at shallow circuit depths while being robust to noise,and it is convenient to be deployed in the Noisy Intermediate Scale Quantum *** investigate the effects of the scalability,the variational ansatz type,the variational depth,and noise on the ***,we also discuss the performance of the model under different conditional values at *** computer simulation,the scale can reach more than nine *** selecting the noise type,we construct simulators with different QVs and study the performance of the model with *** addition,we deploy the model on a superconducting quantum computer of the Origin Quantum technology Company and successfully solve the subset sum *** model provides a new perspective for solving the subset sum problem.

关键词： subset sum problem quantum Ising model conditional values at risk variational quantum optimization

来源：评论

学校读者我要写书评

暂无评论

PBCounter:weighted model counting on pseudo-boolean formulas

引用

Frontiers of computer science 2025年第3期19卷 55-63页

作者： Yong LAI Zhenghang XU Minghao YIN College of Computer Science and Technology Jilin UniversityChangchun 130012China Key Laboratory of Symbolic Computation and Knowledge Engineering of Ministry of Education Jilin UniversityChangchun 130012China School of Computer Science and Information Technology Northeast Normal UniversityChangchun 130017China

In Weighted Model Counting(WMC),we assign weights to literals and compute the sum of the weights of the models of a given propositional formula where the weight of an assignment is the product of the weights of its *** current WMC solvers work on Conjunctive Normal Form(CNF)***,CNF is not a natural representation for human-being in many *** by the stronger expressive power of Pseudo-Boolean(PB)formulas than CNF,we propose to perform WMC on PB *** on a recent dynamic programming algorithm framework called ADDMC for WMC,we implement a weighted PB counting tool *** compare PBCounter with the state-of-the-art weighted model counters SharpSAT-TD,ExactMC,D4,and ADDMC,where the latter tools work on CNF with encoding methods that convert PB constraints into a CNF *** experiments on three domains of benchmarks show that PBCounter is superior to the model counters on CNF formulas.

关键词： weighted model counting pseudo-boolean constraint algebraic decision diagrams preprocessing techniques

来源：评论

学校读者我要写书评

暂无评论

Heuristic Search with Cut Point Based Strategy for Critical Node Problem

引用

Journal of computer science & technology 2024年第6期39卷 1328-1340页

作者： Zhi-Han Chen Shao-Wei Cai Jian Gao Shi-Ke Ge Chan-Juan Liu Jin-Kun Lin School of Computer Science and Technology University of Chinese Academy of SciencesBeijing 101408China Key Laboratory of System Software(Chinese Academy of Sciences)and State Key Laboratory of Computer Science Institute of SoftwareChinese Academy of SciencesBeijing 100190China College of Information Science and Technology Northeast Normal UniversityChangchun 130024China School of Computer Science and Technology Dalian University of TechnologyDalian 116024China SeedMath Technology Limited Beijing 100086China

The critical node problem(CNP)aims to deal with critical node identification in a graph,which has extensive applications in many *** CNP is a challenging task due to its computational complexity,and it attracts much attention from both academia and *** this paper,we propose a population-based heuristic search algorithm called CPHS(Cut Point Based Heuristic Search)to solve CNP,which integrates two main *** first one is a cut point based greedy strategy in the local search,and the second one involves the functions used to update the solution pool of the ***,a mutation strategy is applied to solutions with probability based on the overall average similarity to maintain the diversity of the solution *** are performed on a synthetic benchmark,a real-world benchmark,and a large-scale network benchmark to evaluate our *** with state-of-the-art algorithms,our algorithm has better performance in terms of both solution quality and run time on all the three benchmarks.

关键词： local search cut point heuristic search critical node problem

来源：评论

学校读者我要写书评

暂无评论

An Improved Iterated Greedy Algorithm for Solving Rescue Robot Path Planning Problem with Limited Survival Time

引用

computers, Materials & Continua 2024年第7期80卷 931-947页

作者： Xiaoqing Wang Peng Duan Leilei Meng Kaidong Yang School of Computer Science Liaocheng UniversityLiaocheng252000China Shandong Key Laboratory of Optical Communication Science and Technology School of Physics Science and Information TechnologyLiaocheng UniversityLiaocheng252059China

Effective path planning is crucial for mobile robots to quickly reach rescue destination and complete rescue tasks in a post-disaster *** this study,we investigated the post-disaster rescue path planning problem and modeled this problem as a variant of the travel salesman problem(TSP)with life-strength *** address this problem,we proposed an improved iterated greedy(IIG)***,a push-forward insertion heuristic(PFIH)strategy was employed to generate a high-quality initial ***,a greedy-based insertion strategy was designed and used in the destruction-construction stage to increase the algorithm’s exploration ***,three problem-specific swap operators were developed to improve the algorithm’s exploitation ***,an improved simulated annealing(SA)strategy was used as an acceptance criterion to effectively prevent the algorithm from falling into local *** verify the effectiveness of the proposed algorithm,the Solomon dataset was extended to generate 27 instances for ***,the proposed IIG was compared with five state-of-the-art *** parameter analysiswas conducted using the design of experiments(DOE)Taguchi method,and the effectiveness analysis of each component has been verified one by *** results indicate that IIGoutperforms the compared algorithms in terms of the number of rescue survivors and convergence speed,proving the effectiveness of the proposed algorithm.

关键词： Rescue robot path planning life strength improved iterative greedy algorithm problem-specific swap operators

来源：评论

学校读者我要写书评

暂无评论

Traffic sign recognition model based on scale sequence features and high-order spatial interactions

引用

Neural Computing and Applications 2025年第5期37卷 3605-3620页

作者： Zhang, Gan Wang, Yafei Li, Wenju Fu, Xianping School of Information Science and Technology Dalian Maritime University Dalian116026 China School of Computer Science and Information Engineering Shanghai Institute of Technology Shanghai201418 China Pengcheng Laboratory Shenzhen518055 China

Traffic sign recognition is an integral part of driver assistance systems play a crucial role in enhancing road safety. Due to a large number of challenging targets, such as occlusion, distortion, and small targets in actual scenes, existing methods still have bottlenecks in the accuracy of detection and recognition. Therefore, this paper proposes a real-time traffic sign recognition model based on scale sequence features (SSFs) and high-order spatial interactions (HOSIs) on the basis of YOLOv5. This model extracted scale-invariant SSF using a high-dimensional convolution on the underlying feature map to improve the detection effect of multi-scale targets. At the same time, recursive gated convolution modules are integrated into the feature pyramid network, expanding the interactions to arbitrary order and providing richer feature information for high-order convolutions. In addition, a cross-stage partial (CSP) structure is incorporated into the spatial pooling pyramid, which improves the structure’s performance without introducing excessive computational complexity. The experimental results show that the proposed model achieves 95.5% and 99.92% of mAP on Tsinghua–Tencent 100K (TT100K) and German Traffic Sign Recognition Benchmark (GTSRB), respectively, which surpass the performance of the most advanced model and meets the requirements of real-time detection. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Convolution

来源：评论

学校读者我要写书评

暂无评论

Restage:Relation Structure-Aware Hierarchical Heterogeneous Graph Embedding

引用

Tsinghua science and technology 2025年第1期30卷 198-214页

作者： Huanjing Zhao Pinde Rui Jie Chen Shu Zhao Yanping Zhang School of Computer Science and Technology Anhui UniversityInformation Materials and Intelligent Sensing Laboratory of Anhui ProvinceHefei 230601China

Heterogeneous graphs contain multiple types of entities and relations,which are capable of modeling complex *** on heterogeneous graphs has become an essential tool for analyzing and understanding such *** these meticulously designed methods make progress,they are limited by model design and computational resources,making it difficult to scale to large-scale heterogeneous graph data and hindering the application and promotion of these *** this paper,we propose Restage,a relation structure-aware hierarchical heterogeneous graph embedding *** this framework,embedding only a smaller-scale graph with existing graph representation learning methods is sufficient to obtain node representations on the original heterogeneous *** consider two types of relation structures in heterogeneous graphs:interaction relations and affiliation ***,we design a relation structure-aware coarsening method to successively coarsen the original graph to the top-level layer,resulting in a smaller-scale ***,we allow any unsupervised representation learning methods to obtain node embeddings on the top-level ***,we design a relation structure-aware refinement method to successively refine the node embeddings from the top-level graph back to the original graph,obtaining node embeddings on the original *** results on three public heterogeneous graph datasets demonstrate the enhanced scalability of representation learning methods by the proposed *** another large-scale graph,the speed of existing representation learning methods is increased by up to eighteen times at most.

关键词： heterogeneous graph graph embedding relation structure hierarchical

来源：评论

学校读者我要写书评

暂无评论

B+-Tree-Quantization-Based Shared Secret Key Extraction Scheme From Atmospheric Optical Wireless Channel

引用

IEEE Transactions on Communications 2025年第5期73卷 3394-3408页

作者： Pan, Gang Chen, Chunyi Changchun University of Science and Technology School of Computer Science and Technology Changchun130022 China Changchun University of Science and Technology School of Computer Science and Technology Key Laboratory of Photoelectric Measurement & Control and Optical Information Transfer Technology Changchun130022 China Chongqing Research Institute Changchun University of Science and Technology Chongqing401135 China

To reduce key disagreement rate and increase key generation rate, this paper proposes a lightweight and robust shared secret key extraction scheme from atmospheric optical wireless channel. A conception of grouping samples by using B+ tree and quantizing groups is introduced to improve the balance of distribution of channel measurement values in quantization intervals. Based on the conception, a basic B+ tree quantization algorithm (B-BPTQ) and a compensation-technology-based B+ tree quantization algorithm (C-BPTQ) are designed. A LDPC-based multi-scale information reconciliation algorithm (LDPC-MSIR) is put forward to simplify information reconciliation and reduce its computation complexity. An enhanced randomness post-processing algorithm is formulated to increase statistical randomness of initial key sequence. Finally, the performance of the proposed scheme is validated by numerical simulations and field experiments. The experimental results show that it has better performance in terms of key disagreement rate, key generation rate and key randomness compared with other schemes. © 1972-2012 IEEE.

关键词： Optical communication

来源：评论

学校读者我要写书评

暂无评论

Cat Swarm Algorithm Generated Based on Genetic Programming Framework Applied in Digital Watermarking

引用

computers, Materials & Continua 2025年第5期83卷 3135-3163页

作者： Shu-Chuan Chu Libin Fu Jeng-Shyang Pan Xingsi Xue Min Liu School of Artificial Intelligence Nanjing University of Information Science and TechnologyNanjing210000China College of Computer Science and Engineering Shandong University of Science and TechnologyQingdao266000China Department of Information Management Chaoyang University of TechnologyTaichung40601TaiwanChina School of Information Science and Engineering Fujian University of TechnologyFuzhou350000China Key Laboratory of Hydrometeorological Disaster Mechanism and Warning of Ministry of Water Resource Nanjing University of Information Science and TechnologyNanjing210000China

Evolutionary algorithms have been extensively utilized in practical ***,manually designed population updating formulas are inherently prone to the subjective influence of the *** programming(GP),characterized by its tree-based solution structure,is a widely adopted technique for optimizing the structure of mathematical models tailored to real-world *** paper introduces a GP-based framework(GPEAs)for the autonomous generation of update formulas,aiming to reduce human *** modifications to tree-based GP have been instigated,encompassing adjustments to its initialization process and fundamental update operations such as crossover and mutation within the *** designing suitable function sets and terminal sets tailored to the selected evolutionary algorithm,and ultimately derive an improved update *** Cat Swarm Optimization Algorithm(CSO)is chosen as a case study,and the GP-EAs is employed to regenerate the speed update formulas of the *** validate the feasibility of the GP-EAs,the comprehensive performance of the enhanced algorithm(GP-CSO)was evaluated on the CEC2017 benchmark ***,GP-CSO is applied to deduce suitable embedding factors,thereby improving the robustness of the digital watermarking *** experimental results indicate that the update formulas generated through training with GP-EAs possess excellent performance scalability and practical application proficiency.

关键词： Cat swarm algorithm genetic programming digital watermarking update mode mode generation framework

来源：评论

学校读者我要写书评

暂无评论

Residual diverse ensemble for long-tailed multi-label text classification

引用

science China(information sciences) 2024年第11期67卷 92-105页

作者： Jiangxin SHI Tong WEI Yufeng LI National Key Laboratory for Novel Software Technology Nanjing University School of Artificial Intelligence Nanjing University School of Computer Science and Engineering Southeast University Key Laboratory of Computer Network and Information Integration Southeast UniversityMinistry of Education

Long-tailed multi-label text classification aims to identify a subset of relevant labels from a large candidate label set, where the training datasets usually follow long-tailed label distributions. Many of the previous studies have treated head and tail labels equally, resulting in unsatisfactory performance for identifying tail labels. To address this issue, this paper proposes a novel learning method that combines arbitrary models with two steps. The first step is the “diverse ensemble” that encourages diverse predictions among multiple shallow classifiers, particularly on tail labels, and can improve the generalization of tail *** second is the “error correction” that takes advantage of accurate predictions on head labels by the base model and approximates its residual errors for tail labels. Thus, it enables the “diverse ensemble” to focus on optimizing the tail label performance. This overall procedure is called residual diverse ensemble(RDE). RDE is implemented via a single-hidden-layer perceptron and can be used for scaling up to hundreds of thousands of labels. We empirically show that RDE consistently improves many existing models with considerable performance gains on benchmark datasets, especially with respect to the propensity-scored evaluation ***, RDE converges in less than 30 training epochs without increasing the computational overhead.

关键词： multi-label learning extreme multi-label learning long-tailed distribution multi-label text classification ensemble learning

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：