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

arXiv 2025年

作者： Wang, Zhenglin Wu, Jialong Li, Pengfei Jiang, Yong Zhou, Deyu School of Computer Science and Engineering Key Laboratory of Computer Network and Information Integration Ministry of Education Southeast University China Tongyi Lab Alibaba Group China

Temporal reasoning is fundamental to human cognition and is crucial for various real-world applications. While recent advances in Large Language Models have demonstrated promising capabilities in temporal reasoning, existing benchmarks primarily rely on rule-based construction, lack contextual depth, and involve a limited range of temporal entities. To address these limitations, we introduce Chinese Time Reasoning (CTM), a benchmark designed to evaluate LLMs on temporal reasoning within the extensive scope of Chinese dynastic chronology. CTM emphasizes cross-entity relationships, pairwise temporal alignment, and contextualized and culturally-grounded reasoning, providing a comprehensive evaluation. Extensive experimental results reveal the challenges posed by CTM and highlight potential avenues for improvement. Copyright © 2025, The Authors. All rights reserved.

关键词： Benchmarking

来源：评论

学校读者我要写书评

暂无评论

Malicious Traffic Detection with Noise Labels Based on Cross-Modal Consistency

IEEE Networking Letters

引用

IEEE networking Letters 2024年第2期6卷 148-151页

作者： Yuan, Qingjun Niu, Weina Wang, Yongjuan Gou, Gaopeng Lu, Bin Henan Key Laboratory of Network Cryptography Technology Zhengzhou450001 China Institute for Cyber Security School of Computer Science and Engineering University of Electronic Science and Technology of China Chengdu611731 China Shenzhen Institute for Advanced Study University of Electronic Science and Technology of China Shenzhen518110 China Institute of Information Engineering Chinese Academy of Sciences Beijing100093 China

To train robust malicious traffic identification models under noisy labeled datasets, a number of learning with noise labels approaches have been introduced, among which parallel training methods have been proved to be effective. Parallel training methods tend to select samples with disagreement to mitigate the risk of self-control degradation. However, it also introduces noisy knowledge into training. In this letter, we try to avoid introducing noisy knowledge by enhancing the consistency of the representations of parallel networks. Meanwhile, the two networks are heterogeneous and introduce information from different modalities, thus mitigating the risk of self-control degradation from multiple perspectives. © 2019 IEEE.

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

UAV Swarm Path Planning for Sensor Data Collection via Double Pre-Partitioned Deep Q-network

引用

IEEE Sensors Journal 2025年

作者： Zhang, Heng Gao, Yuan Wang, Xin He, Yunpeng Yang, Ming Wu, Xiaoming Yang, Chaoqun Cao, Xianghui Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan250014 China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Industrial Network and Information System Security Jinan250014 China Jiangsu Ocean University School of Computer Engineering Lianyungang222000 China Southeast University School of Automation Nanjing210096 China

Collision-free path planning is a significant challenge in deploying unmanned aerial vehicle (UAV) swarms for sensor data collection tasks, particularly in uncertain environments. This paper addresses the problem of designing flight strategies for energy-constrained UAV swarms using deep reinforcement learning. We propose a locally-aware double pre-partitioned deep Q-network (DPPDQN) for flight planning of multiple UAVs in large-scale uncertain industrial environments. This algorithm aims to collect data from ground sensors with communication constraints while avoiding mutual collisions. In the proposed algorithm, we first introduce a node pre-partitioning scheme using an improved clustering algorithm, which efficiently reduces the number of access points for UAVs through effective data aggregation. Subsequently, we employ an area pre-partitioning algorithm that segments the detection area into several subregions based on the number of UAVs available for operation, thereby preventing collisions among the UAV swarm during task execution. Finally, we propose a deep Q-network algorithm incorporating a convolutional neural network, which utilizes the local perceptions of UAVs as state inputs to address the 'curse of dimensionality"occurring in large-scale environments. Systematic simulation experiments validate the effectiveness and advantages of the proposed method. © 2025 IEEE.

关键词： Convolutional neural networks

来源：评论

学校读者我要写书评

暂无评论

DDoS Detection and Defense Based on FLAD and SDN 20

DDoS Detection and Defense Based on FLAD and SDN

引用

20th International Conference on Natural Computation, Fuzzy Systems and Knowledge Discovery, ICNC-FSKD 2024

作者： Dong, Jie Fang, Wenyu Zheng, Wanling Liu, Jinkun Liu, Yanhua College of Computer and Data Science Fuzhou University Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China

ISBN: (纸本)9798350356328

In order to achieve more efficient and accurate DDoS detection while ensuring data privacy, this paper proposes a DDoS detection method based on FLAD. Firstly, this paper uses the FLAD algorithm to train a global DDoS detection model without leaving local traffic data, protecting the privacy and security of traffic data between different hosts, and improving aggregation efficiency by dynamically adjusting the aggregation weights to adapt to different sub-dataset increments. Secondly, a DDoS traffic detection method based on the integration of LSTM and CNN is proposed, which extracts and analyzes the temporal correlation of traffic data by calculating the statistical characteristics of traffic data within a time period, to achieve real-time detection of traffic feature data. Again, combined with the concept of SDN, real-time defense against DDoS based on ODL-API is implemented, and precise matching of DDoS detection results with network entity information is achieved, realizing the technology of real-time and precise issuance of multiple flow rules, effectively blocking DDoS malicious attack traffic, protecting important entities in the topology, and maintaining stable traffic in the topology. This paper focuses on solving the detection problem of DDoS traffic data increments and uneven data distribution through the FLAD algorithm. Experimental results show that the proposed method improves the accuracy of DDoS attack detection by more than 4% and the F1 Score by more than 7% compared to the FedAvg aggregation algorithm. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

Attribute-Based Data Sharing Scheme with Flexible Search Functionality for Cloud-Assisted Autonomous Transportation System

引用

IEEE Transactions on Industrial Informatics 2023年第11期19卷 10977-10986页

作者： Xiong, Hu Wang, Hanxiao Meng, Weizhi Yeh, Kuo-Hui University of Electronic Science and Technology of China School of Information and Software Engineering Network and Data Security Key Laboratory of Sichuan Province Chengdu610054 China Advanced Cryptography and System Security Key Laboratory of Sichuan Province Chengdu610025 China Technical University of Denmark Department of Applied Mathematics and Computer Science Kongens Lyngby2800 Denmark National Dong Hwa University Department of Information Management Hualien97401 Taiwan National Sun Yat-sen University Department of Computer Science and Engineering Kaohsiung804201 Taiwan

The existing group public key encryption with equality test schemes could only support one-to-one data sharing and are not suitable for cloud-assisted autonomous transportation systems, which demand one-to-many data sharing. To tackle this problem efficiently, in this article, we put forward the group-attribute-based encryption with equality test (G-ABEET) scheme. The presented G-ABEET allows sensors equipped in vehicles to encrypt traffic data with an expressive access policy before sharing it. Only users with attributes required by the access policy ought to access the shared ciphertexts, thus achieving selective one-to-many data sharing. Meanwhile, the authorized cloud server could provide group users with equality tests over the ciphertexts, realizing ciphertext search ability. Furthermore, with the group mechanism, the G-ABEET scheme could resist offline message recovery attacks. Besides, in the standard model, we give rigorous security proof of the G-ABEET construction. The feasibility and efficiency of G-ABEET are demonstrated by experimental simulations. © 2005-2012 IEEE.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Source-free Domain Adaptation with Multiple Alignment for Efficient Image Retrieval

Source-free Domain Adaptation with Multiple Alignment for Ef...

引用

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

作者： Jinghui Ni Hui Cui Lihai Zhao Fengling Li Xiaohui Han Lijuan Xu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Shandong Provincial Key Laboratory of Industrial Network and Information System Security Shandong Fundamental Research Center for Computer Science Quan Cheng Laboratory Shandong Open University University of Technology Sydney

ISBN: (数字)9798350368741

ISBN: (纸本)9798350368758

Domain adaptation techniques help models generalize to target domains by addressing domain discrepancies between the source and target domain data distributions. These techniques are particularly valuable for cross-domain hashing retrieval, as they reduce training costs while maintaining high retrieval efficiency. However, existing unsupervised domain adaptative hashing methods often require access to both source and target domain data, which may raise privacy concerns regarding source domain data. To address these concerns, restricting access to source domain data is crucial, but this restriction also makes the alignment process between domains more challenging. In this paper, we propose a Source-free Domain Adaptive Hashing with Multiple Alignment (SFDAH-MA) approach for image retrieval. SFDAH-MA integrates model structure alignment, class moment alignment, and semantic relationship alignment to maximize inter-domain knowledge transfer. This comprehensive alignment strategy not only enhances retrieval performance across domains but also minimizes reliance on source domain data, thereby supporting data privacy protection. Extensive experiments show that SFDAH-MA achieves state-of-the-art performance in source-free settings and achieves comparable results to existing unsupervised domain adaptive hashing methods under conventional settings. The source codes of our method are available at: https://***/Nikphyc/SFDAH-MA.

关键词： Training Data privacy Adaptation models Source coding Semantics Image retrieval Signal processing Protection Speech processing Knowledge transfer

来源：评论

学校读者我要写书评

暂无评论

On the -differential spectra of two classes of power functions over finite fields

引用

Applicable Algebra in Engineering, Communication and Computing 2025年 1-30页

作者： Liu, Qian Huang, Zhiwei Chen, Zhixiong Jiang, Rong Zhang, Liupiao Key Laboratory of Information Security of Network Systems College of Computer and Data Science Fuzhou University Fuzhou China Hubei Key Laboratory of Applied Mathematics Faculty of Mathematics and Statistics Hubei University Wuhan China Yunnan Key Laboratory of Service Computing Yunnan University of Finance and Economics Kunming China Fujian Key Laboratory of Financial Information Processing Putian University Putian China School of Computer Science and Technology Dongguan University of Technology Dongguan China

Recently, a new concept called multiplicative differential was introduced by Ellingsen et al. [7]. As an extension of the differential uniformity, it is theoretically appealing to determine the properties of c-differential uniformity and the corresponding c-differential spectrum. In this paper, based on certain quadratic character sums and two special elliptic curves over $$\mathbb {F}_p$$ , the $$(-1)$$ -differential spectra of the following two classes of power functions over $$\mathbb {F}_{p^n}$$ is completely determined: (1) $$f_1(x)=x^{\frac{p^n+3}{2}}$$ , where $$p>3$$ and $$p\equiv 3\pmod 4$$ ; (2) $$f_2(x)=x^{p^n-3}$$ , where $$p>3$$ . The obtained result shows that the $$(-1)$$ -differential spectra of $$f_1(x)$$ and $$f_2(x)$$ can be expressed explicitly in terms of n. Moreover, an upper bound of the c-differential uniformity of $$f_2(x)$$ is given.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Compositional metric learning for multi-label classification

引用

Frontiers of computer Science 2021年第5期15卷 1-12页

作者： Yan-Ping SUN Min-Ling ZHANG School of Computer Science and Engineering Southeast UniversityNanjing 210096China Key Laboratory of Computer Network and Information Integration(Southeast University) Ministry of EducationChina Collaborative Innovation Center for Wireless Communications Technology Nanjing 211100China

Multi-label classification aims to assign a set of proper labels for each instance,where distance metric learning can help improve the generalization ability of instance-based multi-label classification *** multi-label metric learning techniques work by utilizing pairwise constraints to enforce that examples with similar label assignments should have close distance in the embedded feature *** this paper,a novel distance metric learning approach for multi-label classification is proposed by modeling structural interactions between instance space and label *** one hand,compositional distance metric is employed which adopts the representation of a weighted sum of rank-1 PSD matrices based on com-ponent *** the other hand,compositional weights are optimized by exploiting triplet similarity constraints derived from both instance and label *** to the compositional nature of employed distance metric,the resulting problem admits quadratic programming formulation with linear optimization complexity *** number of training *** also derive the generalization bound for the proposed approach based on algorithmic robustness analysis of the compositional *** experiments on sixteen benchmark data sets clearly validate the usefulness of compositional metric in yielding effective distance metric for multi-label classification.

关键词： machine learning multi-label learning metric learning compositional metric positive semidefinite matrix decomposition

来源：评论

学校读者我要写书评

暂无评论

Cooperative Caching Strategy Based on Two-Layer Caching Model for Remote Sensing Satellite networks

引用

computers, Materials & Continua 2023年第5期75卷 3903-3922页

作者： Rui Xu Xiaoqiang Di Hao Luo Hui Qi Xiongwen He Wenping Lei School of Computer Science and Technology Changchun University of Science and TechnologyChangchun130022China School of Information Engineering Henan Institute of Science and TechnologyXinxiang453003China Jilin Province Key Laboratory of Network and Information Security Changchun University of Science and TechnologyChangchun130022China Information Center Changchun University of Science and TechnologyChangchun130022China Beijing Institute of Spacecraft System Engineering Beijing100094China Beijing Institute of Space Mechanic and Electricity Beijing100094China

In information Centric networking(ICN)where content is the object of exchange,in-network caching is a unique functional feature with the ability to handle data storage and distribution in remote sensing satellite *** up cache space at any node enables users to access data nearby,thus relieving the processing pressure on the ***,the existing caching strategies still suffer from the lack of global planning of cache contents and low utilization of cache resources due to the lack of fine-grained division of cache *** address the issues mentioned,a cooperative caching strategy(CSTL)for remote sensing satellite networks based on a two-layer caching model is *** two-layer caching model is constructed by setting up separate cache spaces in the satellite network and the ground *** caching of popular contents in the region at the ground station to reduce the access delay of users.A content classification method based on hierarchical division is proposed in the satellite network,and differential probabilistic caching is employed for different levels of *** cached content is also dynamically adjusted by analyzing the subsequent changes in the popularity of the cached *** the two-layer caching model,ground stations and satellite networks collaboratively cache to achieve global planning of cache contents,rationalize the utilization of cache resources,and reduce the propagation delay of remote sensing *** results show that the CSTL strategy not only has a high cache hit ratio compared with other caching strategies but also effectively reduces user request delay and server load,which satisfies the timeliness requirement of remote sensing data transmission.

关键词： information centric networking caching strategy two-layer caching model hierarchical division

来源：评论

学校读者我要写书评

暂无评论

PROMIPL: A Probabilistic Generative Model for Multi-Instance Partial-Label Learning

PROMIPL: A Probabilistic Generative Model for Multi-Instance...

引用

IEEE International Conference on Data Mining (ICDM)

作者： Yin-Fang Yang Wei Tang Min-Ling Zhang School of Computer Science and Engineering Southeast University Nanjing China Key Laboratory of Computer Network Information Integration (Southeast University) Ministry of Education China

ISBN: (数字)9798331506681

ISBN: (纸本)9798331506698

Multi-instance partial-label learning (MIPL) tackles scenarios where each training sample is represented as a multiinstance bag associated with a candidate label set. This set contains one true label and several false positives. Existing MIPL algorithms have predominantly focused on mapping multiinstance bags to candidate label sets for disambiguation. However, these algorithms may not be adequately generalizable in intricate real-world situations due to their reliance on heuristic methods for identifying true labels. In this paper, we propose PROMIPL, i.e., a PRObabilistic generative model for Multi-instance partiallabel learning, to address these challenges. PROMIPL is the first attempt to explore the probabilistic generative model to infer latent ground-truth labeling information from the data generation process in multi-instance partial-label learning. Besides, the discovered underlying structures also provide improved explanations of the classification predictions. To circumvent the computationally intensive process of training the generative model, we formulate a unified variational lower bound within the stochastic gradient variational Bayesian framework for the model parameters. Experimental results from benchmark and realworld datasets show that our proposed PROMIPL is competitive or superior to the state-of-the-art methods.

关键词： Training Lower bound Computational modeling Heuristic algorithms Stochastic processes Probabilistic logic Data models Bayes methods Labeling Data mining

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：