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

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Chen, Zhongwu Bai, Long Li, Zixuan Huang, Zhen Jin, Xiaolong Dou, Yong National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology China CAS Key Laboratory of Network Data Science and Technology Institute of Computing Technology Chinese Academy of Sciences China

ISBN: (纸本)9798891761643

Conventional Knowledge Graph Reasoning (KGR) models learn the embeddings of KG components over the structure of KGs, but their performances are limited when the KGs are severely incomplete. Recent LLM-enhanced KGR models input KG structural information into LLMs. However, they require fine-tuning on open-source LLMs and are not applicable to closed-source LLMs. Therefore, in this paper, to leverage the knowledge in LLMs without fine-tuning to assist and enhance conventional KGR models, we propose a new three-stage pipeline, including knowledge alignment, KG reasoning and entity reranking. Specifically, in the alignment stage, we propose three strategies to align the knowledge in LLMs to the KG schema by explicitly associating unconnected nodes with semantic relations. Based on the enriched KGs, we train structure-aware KGR models to integrate aligned knowledge to original knowledge existing in KGs. In the reranking stage, after obtaining the results of KGR models, we rerank the top-scored entities with LLMs to recall correct answers further. Experiments show our pipeline can enhance the KGR performance in both incomplete and general situations. © 2024 Association for Computational Linguistics.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

FedIERF: Federated Incremental Extremely Random Forest for Wearable Health Monitoring

引用

Journal of Computer Science & Technology 2023年第5期38卷 970-984页

作者：胡春雨忽丽莎袁林陆佃杰吕蕾陈益强 Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center(National Supercomputer Center in Jinan)Qilu University of Technology(Shandong Academy of Sciences)Jinan 250353China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer ScienceJinan 250000China Shandong Provincial Key Laboratory for Novel Distributed Computer Software Technology Jinan 25000China Institute of Information Technology Hebei University of Economics and BusinessShijiazhuang 050061China School of Information Science and Engineering Shandong Normal UniversityJinan 250358China Institute of Computing Technology Chinese Academy of SciencesBeijing 100190China

Wearable health monitoring is a crucial technical tool that offers early warning for chronic diseases due to its superior portability and low power ***,most wearable health data is distributed across dfferent organizations,such as hospitals,research institutes,and companies,and can only be accessed by the owners of the data in compliance with data privacy *** first challenge addressed in this paper is communicating in a privacy-preserving manner among different *** second technical challenge is handling the dynamic expansion of the federation without model *** address the first challenge,we propose a horizontal federated learning method called Federated Extremely Random Forest(FedERF).Its contribution-based splitting score computing mechanism significantly mitigates the impact of privacy protection constraints on model *** on FedERF,we present a federated incremental learning method called Federated Incremental Extremely Random Forest(FedIERF)to address the second technical *** introduces a hardness-driven weighting mechanism and an importance-based updating scheme to update the existing federated model *** experiments show that FedERF achieves comparable performance with non-federated methods,and FedIERF effectively addresses the dynamic expansion of the *** opens up opportunities for cooperation between different organizations in wearable health monitoring.

关键词： federated learning incremental learning random forest wearable health monitoring

来源：评论

学校读者我要写书评

暂无评论

Multi-party privacy-preserving decision tree training with a privileged party

引用

Science China(Information Sciences) 2024年第8期67卷 253-268页

作者： Yiwen TONG Qi FENG Min LUO Debiao HE Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education School of Cyber Science and Engineering Wuhan University Shanghai Technology Innovation Centre of Distributed Privacy-Preserving Artificial Intelligence Matrix Elements Technologies Key Laboratory of Computing Power Network and Information Security Ministry of EducationShandong Computer Science Center Qilu University of Technology(Shandong Academy of Sciences)

Currently, a decision tree is the most commonly used data mining algorithm for classification tasks. While a significant number of studies have investigated privacy-preserving decision trees, the methods proposed in these studies often have shortcomings in terms of data privacy breach or efficiency. Additionally,these methods typically only apply to symmetric frameworks, which consist of two or more parties with equal privilege, and are not suitable for asymmetric scenarios where parties have unequal privilege. In this paper,we propose SecureCART, a three-party privacy-preserving decision tree training scheme with a privileged party. We adopt the existing pMPL framework and design novel secure interactive protocols for division,comparison, and asymmetric multiplication. Compared to similar schemes, our division protocol is 93.5–560.4× faster, with the communication overhead reduced by over 90%; further, our multiplication protocol is approximately 1.5× faster, with the communication overhead reduced by around 20%. Our comparison protocol based on function secret sharing maintains good performance when adapted to pMPL. Based on the proposed secure protocols, we implement SecureCART in C++ and analyze its performance using three real-world datasets in both LAN and WAN environments. he experimental results indicate that SecureCART is significantly faster than similar schemes proposed in past studies, and that the loss of accuracy while using SecureCART remains within an acceptable range.

关键词： privacy protection decision trees secure multi-party computation secret sharing privileged party

来源：评论

学校读者我要写书评

暂无评论

WBRP: Consensus Algorithm Based on Weak Proof of Work

WBRP: Consensus Algorithm Based on Weak Proof of Work

引用

IEEE International Conference on Blockchain (Blockchain)

作者： Jiarui Li Dongbin Wang Hui Zhi Wencheng Zhu Jianing Li Zedong Wang School of Cyberspace Engineering Beijing University of Post and Telecommunications Beijing China National Engineering Laboratory for Mobile Network Beijing China TravelSky Technology Limited Beijing China Key Laboratory of Ministry of Education and Trustworthy Distributed Computing and Service Beijing China

ISBN: (数字)9798350351590

ISBN: (纸本)9798350351606

Nakamoto Consensus (NC) is a classic Proof of Work (PoW) consensus algorithm where the probability of miners earning the right to a block is proportional to their computational power. To prevent blockchain forks, the interval between block outputs is restricted, which results in lower throughput for PoW. To address blockchain performance issues, a transaction ledger scheme based on weak PoW consensus has been proposed. This approach combines strong and weak blocks, allowing miners to submit weak blocks with lower mining difficulty. Nodes can then use these weak blocks to organize transaction information on the main chain and ensure strict linear ordering of blocks and transactions through sorting rules. Experimental results demon-strate that the consensus algorithm based on weak PoW can significantly enhance system performance, allowing transaction throughput to increase linearly with bandwidth. Specifically, with a node bandwidth of 1 Gb/s, the performance can exceed NC by more than 300 times.

关键词： System performance Consensus algorithm Bandwidth Throughput Proof of Work Extensibility Blockchains

来源：评论

学校读者我要写书评

暂无评论

Enhancement for Versatile Video Coding in Vehicular Ad Hoc network Scenarios

Enhancement for Versatile Video Coding in Vehicular Ad Hoc N...

引用

International Symposium on Communications and Information Technologies (ISCIT)

作者： Jiacheng Wu Jiaqi Zou Songlin Sun School of Information and Communication Engineering Beijing University of Posts and Telecommunications (BUPT) Beijing China Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) Ministry of Education China National Engineering Laboratory for Mobile Network Security Beijing University of Posts and Telecommunications Beijing China

ISBN: (数字)9798350353952

ISBN: (纸本)9798350353969

Vehicular Ad hoc network (VANET) allows infor-mation exchange between vehicles. In VANET, video is the most recommended medium for transmitting information. However, the characteristics of VANET and the requirements of video content in terms of quality have resulted in various challenges. Besides, the movements of vehicles introduce complex motions in videos, making them more difficult to compress. As a result, it is a challenging task to transmit as less bits of video streams as possible while maintaining their visual quality. Therefore, we analyze Affine Motion Estimation (AME), a new coding tool in the latest generation video coding standard H.266NV C. Subsequently, a fast algorithm is proposed to make it able to describe complex motions such as rotation, zoom, shear, etc but also with low complexity. Experimental results show that the algorithm reduces the encoding complexity of AME by 20.19% and the overall encoding complexity by 3.25% compared to anchor VTM21.0, with eligible coding performance loss under Random Access (RA) configurations.

关键词： Video coding Visualization Motion estimation Vehicular ad hoc networks Streaming media Feature extraction Encoding Complexity theory Streams Standards

来源：评论

学校读者我要写书评

暂无评论

DW-MLSR: Unsupervised Deformable Medical Image Registration Based on Dual-Window Attention and Multi-Latent Space

SSRN

引用

SSRN 2024年

作者： Huang, YuXuan Yin, MengXiao Zhong, Cheng Li, ZhiPan Yang, Feng School of Computer and Electronic Information Guangxi University Nanning530004 China Guangxi Key Laboratory of Multimedia Communications Network Technology Guangxi University Guangxi Nanning530004 China Key Laboratory of Parallel Distributed and Intelligent Computing of Guangxi Universities and Colleges Nanning530004 China

Thanks to the emergence of transformers and Vision Transformer (VIT), attention mechanisms have also been applied to medical image registration. However, the current attention mechanisms in medical image registration suffer from incomplete information interaction. Common unsupervised registration methods may be constrained by the imperfect medical image data with uncertainty and noise, leading to unstable registration results susceptible to *** address these evident drawbacks, this paper proposes a novel medical image registration method, namely, Registration Based on Dual-Window Attention and Multi-Latent Space(DW-MLSR). The Dual-Window attention mechanism introduced in this paper enables the model to comprehensively focus on crucial local regions in the image, thereby improving registration accuracy and robustness. Meanwhile, MLS, employed as a data augmentation method, enhances the model's generalization ability and robustness by learning latent image representations, providing richer image *** results demonstrate the superiority of the proposed medical image registration method over mainstream registration models. Comparative experiments indicate that our approach holds significant application potential in the field of medical image registration. © 2024, The Authors. All rights reserved.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

On the Effectiveness of Function-Level Vulnerability Detectors for Inter-Procedural Vulnerabilities 24

On the Effectiveness of Function-Level Vulnerability Detecto...

引用

44th ACM/IEEE International Conference on Software Engineering, ICSE 2024

作者： Li, Zhen Wang, Ning Zou, Deqing Li, Yating Zhang, Ruqian Xu, Shouhuai Zhang, Chao Jin, Hai Hubei Key Laboratory of Distributed System Security Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hong Kong Jin YinHu Laboratory Wuhan China School of Cyber Science and Engineering Huazhong University of Science and Technology Wuhan China University of Colorado Colorado Springs Department of Computer Science Colorado Springs Colorado United States Institute for Network Sciences and Cyberspace Tsinghua University Beijing China School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

ISBN: (纸本)9798400702174

Software vulnerabilities are a major cyber threat and it is important to detect them. One important approach to detecting vulnerabilities is to use deep learning while treating a program function as a whole, known as function-level vulnerability detectors. However, the limitation of this approach is not understood. In this paper, we investigate its limitation in detecting one class of vulnerabilities known as inter-procedural vulnerabilities, where the to-be-patched statements and the vulnerability-triggering statements belong to different functions. For this purpose, we create the first Inter -Procedural Vulnerability Dataset (InterPVD) based on C/C++ open-source software, and we propose a tool dubbed VulTrigger for identifying vulnerability-triggering statements across functions. Experimental results show that VulTrigger can effectively identify vulnerability-triggering statements and inter-procedural vulnerabilities. Our findings include: (i) inter-procedural vulnerabilities are prevalent with an average of 2.8 inter-procedural layers;and (ii) function-level vulner-ability detectors are much less effective in detecting to-be-patched functions of inter-procedural vulnerabilities than detecting their counterparts of intra-procedural vulnerabilities. © 2024 ACM.

关键词： Open source software

来源：评论

学校读者我要写书评

暂无评论

A Hybrid Routing Mutation Mechanism based on Mutation Cost and Resource Trustworthiness in network Moving Target Defense 7

A Hybrid Routing Mutation Mechanism based on Mutation Cost a...

引用

7th IEEE International Conference on Data Science in Cyberspace, DSC 2022

作者： Guo, Kun Gao, Yibo Wang, Dongbin Zhi, Hui Zhang, Tao Lu, Yueming Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China Beijing University of Posts and Telecommunications Cyberspace Security Research Center Peng Cheng Laboratory Beijing China Beijing University of Posts and Telecommunications National Engineering Laboratory for Mobile Network Beijing China TravelSky Technology Limited Beijing China China Academy of Launch Vehicle Technology Beijing China

ISBN: (数字)9781665474801

ISBN: (纸本)9781665474801

network moving target defense technology can effectively defend against attacker monitoring of the service. The technology makes it more difficult for attackers to attack and can ensure secure communication for services. However, there may be multiple network attacks in the network. As a result, there may be security problems with the trustworthiness of the network resource mutation space required for network moving target defense technology. The focus of current researches is mostly on the mutation timing and cost optimization of the resource mutation space. It may lead to the possibility that the resources in the resource mutation space have been already under network attacks. In this paper, we propose a hybrid routing mutation mechanism based on mutation cost and resource trustworthiness in SDN networks. The mechanism is able to evaluate the routing mutation space selected by the routing-based network moving target defense technology. In terms of both mutation cost and resource trustworthiness, the optimal weighting ratio of the two factors will be to discovered. Simulation results show that the proposed mechanism can effectively enhance the ability of the routing mutation space to avoid attacked nodes and links and improve the transmission success rate of services. © 2022 IEEE.

关键词： network routing

来源：评论

学校读者我要写书评

暂无评论

Joint Optimization Algorithm for Adaptive Bit Allocation Based on Temporal-Spatial Information

Joint Optimization Algorithm for Adaptive Bit Allocation Bas...

引用

Asia-Pacific Signal and Information Processing Association Annual Summit and Conference (APSIPA)

作者： Shaokang Wang Songlin Sun School of Information and Communication Engineering Beijing University of Posts and Telecommunications Beijing China Ministry of Education Key Laboratory of Trustworthy Distributed Computing and Service (BUPT) China Ministry of Education Engineering Research Center of Blockchain and Network Convergence Technology China

Versatile Video Coding (VVC) standard further improves the video compression ratio. Despite inter prediction and intra prediction effectively eliminating temporal and spatial residual information, there is still room for further improvement in rate control (RC) accuracy and rate distortion (R-D) performance. In view of the above issues, the joint optimization RC algorithm for adaptive bit allocation for VVC is proposed. In this paper, the proposed algorithm utilizes a specific pre-analysis mechanism so that the Temporal-Spatial Information (TSI) is obtained. And then the TSI is integrated into the RC model so as to optimize adaptive bit allocations for frame-level and coding tree unit level (CTU-level). Experimental results have shown that compared to the default RC under common test conditions (CTC), the proposed RC algorithm achieves obvious 2.26% Bjøntegaard Delta rate (BD-rate) saving, and the RC accuracy can be improved in the Random Access (RA) configuration.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Progressive Evolution Scheme with Socialization Swarm for Privacy Blockchain

Progressive Evolution Scheme with Socialization Swarm for Pr...

引用

Pacific Rim International Symposium on Dependable computing

作者： Daoqi Han Tao Yu Yueming Lu Key Laboratory of Trustworthy Distributed Computing and Service Ministry of Education Beijing University of Posts and Telecommunications Beijing China Institute of Network Science and Cyberspace Tsinghua University Beijing China

To enhance the dependability of lightweight blockchain, this paper presents a privacy protection mechanism in open networks with a secure ledger for each cell of society. We propose a swarm intelligence scheme called hierarchical RAFT (HRAFT), which accumulates valuable workloads about the credibility of all the nodes to sort for selecting candidates. Thus, the scheme achieves high-performance decentralization by progressive evolution consensus.

关键词： Privacy Schedules Blockchains Particle swarm optimization

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：