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

4th International Conference on Artificial Intelligence, Big Data and Algorithms, CAIBDA 2024

作者： Zhao, Yue Wang, Jizhi Kong, Lingrui Sui, Tongtong Shandong Computer Science Center National Supercomputer Center in Jinan Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Provincial Key Laboratory of Industrial Network and Information System Security Qilu University of Technology Shandong Academy of Sciences Jinan Shandong China Quancheng Laboratory Jinan Key Laboratory of Digital Security Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center National Supercomputer Center in Jinan 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 Jinan Shandong China

ISBN: (纸本)9798400710247

The advancement of 5G and mobile internet technologies has propelled the development of emerging businesses and applications, demanding higher requirements for network bandwidth and computational resources. To address this challenge, the computing power network (CPN) has emerged. The CPN integrates computing and networking in depth, achieving collaborative allocation of distributed computing resources, enhancing the efficient utilization of computing resources, and improving user experiences in network services. However, in the development of fields such as Extended Reality (XR), Smart Healthcare, Connected Vehicles, and Artificial Intelligence (AI), there is a multidimensional, complex, and rapidly growing demand for computing resources. Therefore, it is crucial to establish a trading mechanism that integrates multiple computing resources in CPN. In this paper, a computing power trading scheme based on blockchain and combinatorial double auction is proposed. Firstly, a computing power trading system based on blockchain was designed, leveraging the decentralized and highly secure characteristics of blockchain technology to enhance the security of computing power transactions. Furthermore, a multi-type computing power trading mechanism (MCPT) based on blockchain and combinatorial double auction was introduced. The use of combinatorial double auctions as an incentive mechanism enables the trading of multiple computing power resources and results in high social welfare. Moreover, a discrete rime optimization algorithm (DRIME) is designed in the proposed mechanism (MCPT) to better solve the computing trading problem. Through simulation experiments, the effectiveness of the approach is validated. © 2024 Copyright held by the owner/author(s).

关键词： Computing power

来源：评论

学校读者我要写书评

暂无评论

Few-shot Link Prediction on Hyper-relational Facts 30

Few-shot Link Prediction on Hyper-relational Facts

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Wei, Jiyao Guan, Saiping Jin, Xiaolong Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Hyper-relational facts, which consist of a primary triple (head entity, relation, tail entity) and auxiliary attribute-value pairs, are widely present in real-world Knowledge Graphs (KGs). Link Prediction on Hyper-relational Facts (LPHFs) is to predict a missing element in a hyper-relational fact, which helps populate and enrich KGs. However, existing LPHFs studies usually require an amount of high-quality data. They overlook few-shot relations, which have limited instances, yet are common in real-world scenarios. Thus, we introduce a new task, Few-Shot Link Prediction on Hyper-relational Facts (FSLPHFs). It aims to predict a missing entity in a hyper-relational fact with limited support instances. To tackle FSLPHFs, we propose MetaRH, a model that learns Meta Relational information in Hyper-relational facts. MetaRH comprises three modules: relation learning, support-specific adjustment, and query inference. By capturing meta relational information from limited support instances, MetaRH can accurately predict the missing entity in a query. As there is no existing dataset available for this new task, we construct three datasets to validate the effectiveness of MetaRH. Experimental results on these datasets demonstrate that MetaRH significantly outperforms existing representative models. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Selective Temporal Knowledge Graph Reasoning 30

Selective Temporal Knowledge Graph Reasoning

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Hou, Zhongni Jin, Xiaolong Li, Zixuan Bai, Long Guo, Jiafeng Cheng, Xueqi School of Computer Science and Technology University of Chinese Academy of Sciences China Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Temporal Knowledge Graph (TKG), which characterizes temporally evolving facts in the form of (subject, relation, object, timestamp), has attracted much attention recently. TKG reasoning aims to predict future facts based on given historical ones. However, existing TKG reasoning models are unable to abstain from predictions they are uncertain, which will inevitably bring risks in real-world applications. Thus, in this paper, we propose an abstention mechanism for TKG reasoning, which helps the existing models make selective, instead of indiscriminate, predictions. Specifically, we develop a confidence estimator, called Confidence Estimator with History (CEHis), to enable the existing TKG reasoning models to first estimate their confidence in making predictions, and then abstain from those with low confidence. To do so, CEHis takes two kinds of information into consideration, namely, the certainty of the current prediction and the accuracy of historical predictions. Experiments with representative TKG reasoning models on two benchmark datasets demonstrate the effectiveness of the proposed CEHis. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Class-Incremental Few-Shot Event Detection 30

Class-Incremental Few-Shot Event Detection

引用

Joint 30th International Conference on Computational Linguistics and 14th International Conference on Language Resources and Evaluation, LREC-COLING 2024

作者： Zhao, Kailin Jin, Xiaolong Bai, Long Guo, Jiafeng Cheng, Xueqi Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China School of Computer Science and Technology University of Chinese Academy of Sciences China

ISBN: (纸本)9782493814104

Event detection is one of the fundamental tasks in information extraction and knowledge graph. However, a realistic event detection system often needs to deal with new event classes constantly. These new classes usually have only a few labeled instances as it is time-consuming and labor-intensive to annotate a large number of unlabeled instances. Therefore, this paper proposes a new task, called class-incremental few-shot event detection. Nevertheless, this task faces two problems, i.e., old knowledge forgetting and new class overfitting. To solve these problems, this paper further presents a novel knowledge distillation and prompt learning based method, called Prompt-KD. Specifically, to handle the forgetting problem about old knowledge, Prompt-KD develops an attention based multi-teacher knowledge distillation framework, where the ancestor teacher model pre-trained on base classes is reused in all learning sessions, and the father teacher model derives the current student model via adaptation. On the other hand, in order to cope with the few-shot learning scenario and alleviate the corresponding new class overfitting problem, Prompt-KD is also equipped with a prompt learning mechanism. Extensive experiments on two benchmark datasets, i.e., FewEvent and MAVEN, demonstrate the superior performance of Prompt-KD. © 2024 ELRA Language Resource Association: CC BY-NC 4.0.

关键词： Distillation

来源：评论

学校读者我要写书评

暂无评论

Asymptotics-Aware Multi-View Subspace Clustering

引用

IEEE Transactions on Multimedia 2025年 27卷 3650-3663页

作者： Xu, Yesong Chen, Shuo Li, Jun Yang, Jian Anhui Polytechnic University School of Computer and Information Wuhu241000 China RIKEN Center for Advanced Intelligence Project Tokyo103-0027 Japan Nanjing University of Science and Technology PCA Laboratory Key Laboratory of Intelligent Perception and Systems for High-Dimensional Information of Ministry of Education Nanjing210094 China Nanjing University of Science and Technology Jiangsu Key Laboratory of Image and Video Understanding for Social Security School of Computer Science and Engineering Nanjing210094 China

Recently, multi-view subspace clustering has attracted extensive attention due to the rapid increase of multi-view data in many real-world applications. The main goal of this task is to learn a common representation of multiple subspaces from the given multi-view data, and most existing methods usually directly merge multiple groups of features by the single-step integration. However, there may exist large disparities among different views of the data, and thus the conventional single-step practice can hardly obtain a generally consistent feature representation for the multi-view data. To overcome this challenge, we present a novel approach dubbed "Asymptotics-Aware Multi-view Subspace Clustering (A2 MSC)"to pursue a consistent feature representation in a multi-step way, which iteratively conducts the data recovery to gradually reduce the differences between pairwise views. Specifically, we construct an asymptotic learning rule to update the feature representation, and the iteration result converges to a consistent feature vector for characterizing each instance of the original multi-view data. After that, we utilize such a new feature representation to learn a clustering-oriented similarity matrix via minimizing a self-expressive objective, and we also design the corresponding optimization algorithm to solve it with convergence guarantees. Theoretically, we prove that the learned asymptotic representation effectively integrates multiple views, thereby ensuring the effective handling of multi-view data. Empirically, extensive experimental results demonstrate the superiority of our proposed A2 MSC over the state-of-the-art multi-view subspace clustering approaches. © 2025 IEEE.

关键词： Data assimilation

来源：评论

学校读者我要写书评

暂无评论

Deep Imputation Bi-stochastic Graph Regularized Matrix Factorization for Clustering Single-cell RNA-sequencing Data

引用

IEEE/ACM Transactions on Computational Biology and Bioinformatics 2024年 PP卷 1-11页

作者： Lan, Wei Chen, Jianwei Liu, Mingyang Chen, Qingfeng Liu, Jin Wang, Jianxin Chen, Yi-Ping Phoebe Wei Lan is School of Computer Electronic and Information and Guangxi Key Laboratory of Multimedia Communications and Network Technology Guangxi University Nanning Guangxi China School of Computer Electronic and Information Guangxi University Nanning Guangxi China School of Computer Electronic and Information and State Key Laboratory for Conservation and Utilization of Subtropical Agro-bioresources Guangxi University Nanning Guangxi China Hunan Provincial Key Lab on Bioinformatics School of Computer Science and Engineering Central South University Changsha Hunan China Department of Computer Science and Information Technology La Trobe University Melbourne Victoria Australia

By generating massive gene transcriptome data and analyzing transcriptomic variations at the cell level, single-cell RNA-sequencing (scRNA-seq) technology has provided new way to explore cellular heterogeneity and functionality. Clustering scRNA-seq data could discover the hidden diversity and complexity of cell populations, which can aid to the identification of the disease mechanisms and biomarkers. In this paper, a novel method (DSINMF) is presented for single cell RNA sequencing data by using deep matrix factorization. Our proposed method comprises four steps: first, the feature selection is utilized to remove irrelevant features. Then, the dropout imputation is used to handle missing value problem. Further, the dimension reduction is employed to preserve data characteristics and reduce noise effects. Finally, the deep matrix factorization with bi-stochastic graph regularization is used to obtain cluster results from scRNA-seq data. We compare DSINMF with other state-of-the-art algorithms on nine datasets and the results show our method outperformances than other methods. IEEE

关键词： RNA

来源：评论

学校读者我要写书评

暂无评论

Research on the detection and analysis of weak signals with low SNR based on the Welch algorithm 24

Research on the detection and analysis of weak signals with ...

引用

2nd International Conference on Communication networks and Machine Learning, CNML 2024

作者： Wu, Bin Zhang, Wanqing Zhang, Jun Yu, Jing Huangfu, Taoyu Hebei Key Laboratory of Marine Perception Network and Data Processing School of Computer and Communication Engineering Northeastern University at Qinhuangdao Hebei Qinhuangdao China Southeast University Jiangsu Nanjing China

ISBN: (纸本)9798400711688

Submarines are vital for military defense and national security in strategic communication systems. Power Spectral Density (PSD) characterizes signal spectrum frequency dependence and is crucial for analyzing broadband random signals. This study proposes a simplified PSD estimation method using the Welch algorithm for detecting weak signals in noisy environments, particularly in submarine communications. MATLAB simulations demonstrate that the Welch algorithm with a Blackman window function and 512-point overlap improves variance performance and resolution, especially in low signal-to-noise ratio conditions. The results underscore the algorithm’s effectiveness in enhancing signal detection in submarines. © 2024 Copyright held by the owner/author(s).

关键词： MATLAB

来源：评论

学校读者我要写书评

暂无评论

A Privacy Leakage Detection Method for Personalized Course Recommendation Based on Pi-Calculus 24

A Privacy Leakage Detection Method for Personalized Course R...

引用

24th IEEE International Conference on Software Quality, Reliability and Security Companion, QRS-C 2024

作者： Wu, Zixin Zhou, Xiaoyun Zhu, Yi Wang, Chenyu Hao, Guosheng School of Computer Science and Technology Jiangsu Normal University Jiangsu Xuzhou China Jiangsu Engineering Technology Research Center of Ict in Education Jiangsu Xuzhou China Nanjing University of Aeronautics and Astronautics Ministry of Industry and Information Technology Key Laboratory of Safety-Critical Software Jiangsu Nanjing China

ISBN: (纸本)9798350365658

Privacy protection is one of the main approaches to improve the security and reliability of personalized course recommendation systems. However, the current privacy protection methods for personalized course recommendation mainly focus on data protection, but ignore the potential privacy leakage that may be caused by the system behavior. In addition, privacy protection is not fully considered in the initial phases of system development and design. To address this issue, this paper presents a methodology for detecting privacy leakage in personalized course recommendation systems using the process algebra Pi-Calculus. Firstly, the basic semantics and evolution rules of Pi-Calculuss as well as the definition of mutual simulation techniques are introduced. Then the personalized course recommendation system is mapped to a process algebra Pi-Calculus, a formal description and analysis of the interaction behavior of the components of the personalized course recommendation system is given, and finally a framework for privacy leakage detection is introduced and applied to a case study to detect whether there is privacy leakage behavior in the recommendation system by the inter-simulation technique. Experiments demonstrate that the method can effectively detect potential privacy leakage problems in the early stages of system development. © 2024 IEEE.

关键词： Differential privacy

来源：评论

学校读者我要写书评

暂无评论

A throughput and priority optimization strategy for high density healthcare IoT

引用

Intelligent and Converged networks 2025年第1期6卷 41-52页

作者： Zhenlang Su Junyu Ren Yeheng Huang Yang Liao Tuanfa Qin School of Computer Electronic and InformationGuangxi UniversityNanning 530004China School of Physics and Electronic Information Guangxi Minzu UniversityNanning 530006China School of Computer Electronic and Information and the Guangxi Key Laboratory of Multimedia Communications and Network TechnologyGuangxi UniversityNanning 530004China

In the field of wireless body area networks(WBANs),for solving the complex interference problem of inter-WBANs,a density-based adaptive optimization strategy(DAOS)is proposed in this ***,the complex interference problem among WBANs is converted into a distance-based graph coloring model,then time division multiple access and a two-level split clustering methods are adopted to allocate initial time slots for ***,the particle swarm optimization algorithm is used to optimize the time slot of each node for maximizing the *** simulate the scenario on MATLAB *** results show that compared with the traditional scheme in high-density healthcare Internet of Things(IoT)scenarios,DAOS has obvious advantages compared with three comparison strategies of faster convergence rate of 48.94%,60.76%,and 96.82%,and higher throughput of 5.60%,8.08%,and 8.05%in traffic priorities 7 to 4.

关键词： wireless body area networks(WBANs) cluster graph coloring particle swarm optimization(PSO)

来源：评论

学校读者我要写书评

暂无评论

Chip-integrated quantum signature network over 200 km

引用

Light(Science & Applications) 2025年第4期14卷 1061-1069页

作者： Yongqiang Du Bing-Hong Li Xin Hua Xiao-Yu Cao Zhengeng Zhao Feng Xie Zhenrong Zhang Hua-Lei Yin Xi Xiao Kejin Wei Guangxi Key Laboratory for Relativistic Astrophysics School of Physical Science and TechnologyGuangxi UniversityNanning 530004China National Laboratory of Solid State Microstructures and School of Physics Collaborative Innovation Center of Advanced MicrostructuresNanjing UniversityNanjing 210093China National Information Optoelectronics Innovation Center(NOEIC) Wuhan 430074China Guangxi Key Laboratory of Multimedia Communications and Network Technology School of ComputerElectronicsand InformationGuangxi UniversityNanning 530004China Department of Physics and Beijing Key Laboratory of Opto-electronic Functional Materials and Micro-nano Devices Key Laboratory of Quantum State Construction and Manipulation(Ministry of Education)Renmin University of ChinaBeijing 100872China Peng Cheng Laboratory Shenzhen 518055China

The development of quantum networks is paramount towards practical and secure *** digital signatures(QDS)offer an information-theoretically secure solution for ensuring data integrity,authenticity,and nonrepudiation,rapidly growing from proof-of-concept to robust ***,previous QDS systems relied on expensive and bulky optical equipment,limiting large-scale deployment and reconfigurable networking ***,we introduce and verify a chip-based QDS network,placing the complicated and expensive measurement devices in the central relay while each user needs only a low-cost *** demonstrate the network with a three-node setup using an integrated encoder chip and decoder *** developing a 1-decoy-state one-time universal hashing-QDS protocol,we achieve a maximum signature rate of 0.0414 times per second for a 1 Mbit messages over fiber distances up to 200 km,surpassing all current state-of-the-art QDS *** study validates the feasibility of chip-based QDS,paving the way for large-scale deployment and integration with existing fiber infrastructure.

关键词： secure communications quantum networks chip based network large scale deployment digital signatures qds offer quantum digital signatures fiber distances decoy state protocol

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：