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

RE-SEGNN:recurrent semantic evidence-aware graph neural network for temporal knowledge graph forecasting

Science China(Information Sciences) 2025年第2期68卷 103-119页

作者： Wenyu CAI Mengfan LI Xuanhua SHI Yuanxin FAN Quntao ZHU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and Technology

Temporal knowledge graph(TKG) reasoning, has seen widespread use for modeling real-world events, particularly in extrapolation settings. Nevertheless, most previous studies are embedded models, which require both entity and relation embedding to make predictions, ignoring the semantic correlations among different entities and relations within the same timestamp. This can lead to random and nonsensical predictions when unseen entities or relations occur. Furthermore, many existing models exhibit limitations in handling highly correlated historical facts with extensive temporal depth. They often either overlook such facts or overly accentuate the relationships between recurring past occurrences and their current counterparts. Due to the dynamic nature of TKG, effectively capturing the evolving semantics between different timestamps can be *** address these shortcomings, we propose the recurrent semantic evidenceaware graph neural network(RE-SEGNN), a novel graph neural network that can learn the semantics of entities and relations simultaneously. For the former challenge, our model can predict a possible answer to missing quadruples based on semantics when facing unseen entities or relations. For the latter problem, based on an obvious established force, both the recency and frequency of semantic history tend to confer a higher reference value for the current. We use the Hawkes process to compute the semantic trend, which allows the semantics of recent facts to gain more attention than those of distant facts. Experimental results show that RE-SEGNN outperforms all SOTA models in entity prediction on 6 widely used datasets, and 5 datasets in relation prediction. Furthermore, the case study shows how our model can deal with unseen entities and relations.

关键词： knowledge graph reasoning temporal knowledge graph Hawkes process semantic evidence

来源：评论

学校读者我要写书评

暂无评论

A QoS-based technique for load balancing in green cloud computing using an artificial bee colony algorithm

引用

Journal of Experimental and Theoretical Artificial Intelligence 2025年第2期37卷 307-342页

作者： Tabagchi Milan, Sara Jafari Navimipour, Nima Lohi Bavil, Hamed Yalcin, Senay Department of Computer Engineering Tabriz Branch Islamic Azad University Tabriz Iran Department of Computer Engineering Faculty of Engineering and Natural Sciences Kadir Has University Istanbul Turkey Future Technology Research Center National Yunlin University of Science and Technology Douliou Taiwan Department of Computer Engineering University of Applied Sciences & Technology Tabriz Iran Department of Computer Engineering Nisantasi University Istanbul Turkey

Nowadays, high energy amount is being wasted by computing servers and personal electronic devices, which produce a high amount of carbon dioxide. Thus, it is required to decrease energy usage and pollution. Many applications are utilised by green computing to save energy. Scheduling of tasks acts as an important process to reach the mentioned goals. It is worth stating that the vital characteristic of task scheduling in green clouds is the load balancing of tasks on virtual machines. Efficient load balancing moves tasks from overloaded to underloaded virtual machines to maintain the Quality of Service (QoS). This issue is an NP-complete problem, so this research suggests a new technique based on the behavioural structure of artificial bee behaviour. This method aims to improve QoS while lowering energy usage in green computing. In addition, the honey bees are considered the removed tasks from overloaded virtual machines and a candidate for migrating selected tasks with the lowest priority. The CloudSim testing findings demonstrate that the technique is successful in QoS, makespan, and energy usage compared to other ways. © 2023 Informa UK Limited, trading as Taylor & Francis Group.

关键词： Cloud computing

来源：评论

学校读者我要写书评

暂无评论

Soft-GNN:towards robust graph neural networks via self-adaptive data utilization

引用

Frontiers of computer Science 2025年第4期19卷 1-12页

作者： Yao WU Hong HUANG Yu SONG Hai JIN National Engineering Research Center for Big Data Technology and System Service Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China College of Information and Communication National University of Defense TechnologyWuhan 430019China Department of Computer Science and Operations Research Universitéde MontréalMontreal H3C 3J7Canada

Graph neural networks(GNNs)have gained traction and have been applied to various graph-based data analysis tasks due to their high ***,a major concern is their robustness,particularly when faced with graph data that has been deliberately or accidentally polluted with *** presents a challenge in learning robust GNNs under noisy *** address this issue,we propose a novel framework called Soft-GNN,which mitigates the influence of label noise by adapting the data utilized in *** approach employs a dynamic data utilization strategy that estimates adaptive weights based on prediction deviation,local deviation,and global *** better utilizing significant training samples and reducing the impact of label noise through dynamic data selection,GNNs are trained to be more *** evaluate the performance,robustness,generality,and complexity of our model on five real-world datasets,and our experimental results demonstrate the superiority of our approach over existing methods.

关键词： graph neural networks node classification label noise robustness

来源：评论

学校读者我要写书评

暂无评论

Behaviour-diverse automatic penetration testing:a coverage-based deep reinforcement learning approach

引用

Frontiers of computer Science 2025年第3期19卷 15-24页

作者： Yizhou YANG Longde CHEN Sha LIU Lanning WANG Haohuan FU Xin LIU Zuoning CHEN Zhongguancun Laboratory Beijing 100081China Zhejiang Lab Hangzhou 311121China National Research Centre of Parallel Computer Engineering and Technology Wuxi 214000China Faculty of Geographical Science Beijing Normal UniversityBeijing 100875China Department of Earth System Science Tsinghua UniversityBeijing 100084China

Reinforcement Learning(RL)is gaining importance in automating penetration testing as it reduces human effort and increases ***,given the rapidly expanding scale of modern network infrastructure,the limited testing scale and monotonous strategies of existing RLbased automated penetration testing methods make them less effective in practical *** this paper,we present CLAP(Coverage-Based Reinforcement Learning to Automate Penetration Testing),an RL penetration testing agent that provides comprehensive network security assessments with diverse adversary testing behaviours on a massive *** employs a novel neural network,namely the coverage mechanism,to address the enormous and growing action spaces in large *** also utilizes a Chebyshev decomposition critic to identify various adversary strategies and strike a balance between *** results across various scenarios demonstrate that CLAP outperforms state-of-the-art methods,by further reducing attack operations by nearly 35%.CLAP also provides enhanced training efficiency and stability and can effectively perform pen-testing over large-scale networks with up to 500 ***,the proposed agent is also able to discover pareto-dominant strategies that are both diverse and effective in achieving multiple objectives.

关键词： network security penetration testing reinforcement learning artificial intelligence

来源：评论

学校读者我要写书评

暂无评论

DISTANCE BETWEEN SPECIES BY CONFUSION OPERATORS OF MULTI-CLASS CLASSIFIERS

引用

UPB Scientific Bulletin, Series A: Applied Mathematics and Physics 2025年第1期2025卷 171-182页

作者： Tarbă, Nicolae Irimescu, Ionela N. Pleavă, Ana M. Scarlat, Eugen N. Mihăilescu, Mona Doctoral School Computer Science and Engineering Department Faculty of Automatic Control and Computers National University of Science and Technology POLITEHNICA Bucharest Romania Applied Sciences Doctoral School National University of Science and Technology POLITEHNICA Bucharest Romania CAMPUS Research Center National University of Science and Technology POLITEHNICA Bucharest Romania Physics Dept National University of Science and Technology POLITEHNICA Bucharest Romania Physics Dept Research Center for Applied Sciences in Engineering National University of Science and Technology POLITEHNICA Bucharest Romania

We introduce a method to evaluate the similarities between classes of objects based on the confusion matrices coming from the multi-class machine learning (ML) predictors that operate in the vector space generated by the classes. Operation in the confusion domain allows us to use the distance as evaluation metric of the closeness of the relevant properties carried by the classes. We applied the method to semiquantitatively evaluate the effects of X-ray and carbon ion radiation on cultured SW1353 chondrosarcoma cells with respect to the non-irradiated reference. We prove that it is possible to draw useful information on the strength of cells nuclei changes. © 2025, Politechnica University of Bucharest. All rights reserved.

关键词： Radiation effects

来源：评论

学校读者我要写书评

暂无评论

ViF-SD2E: a robust weakly-supervised framework for neural decoding

引用

Neural Computing and Applications 2025年第9期37卷 6645-6661页

作者： Feng, Jingyi Luo, Yong Song, Shuang Hu, Han National Engineering Research Center for Multimedia Software School of Computer Science Wuhan University Wuhan430072 China School of Information and Electronics Beijing Institute of Technology Beijing100081 China

Neural decoding plays a vital role in the interaction between the brain and the outside world. Our task in this paper is to decode the movement track of a finger directly based on the neural data. Existing neural decoding solutions primarily perform some preprocessing operations on neural data before feeding them into existing models (such as LSTM) for decoding. However, these solutions either are prone to overfitting or cannot well exploit the spatial and temporal information. In our previous observations, there is a symmetrical phenomenon between the unsupervised decoded trajectory and the ground truth trajectory within the activity space. This precisely motivates us to propose (or derive) a robust weakly-supervised framework (or model structure), called ViF-SD2E, for neural decoding. In particular, it consists of a space-division (SD) module and an exploration–exploitation (2E) strategy, to effectively exploit both the spatial information of the outside world and the temporal information of neural activity, where the SD2E output is analogized with the weak 0/1 vision feedback (ViF) label for training. Extensive experiments demonstrate the effectiveness of our method, which can sometimes be comparable to supervised counterparts. Therefore, we redirect our attention to the information (hidden in data) ViF-SD2E conveys to us. In other words, we believe that the advantage of ViF-SD2E lies in the fact that its processing steps are objectively determined by the inherent attributes (i.e., symmetry) of the neural data, or rather, the model structure is fixed. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2025.

关键词： Space division multiple access

来源：评论

学校读者我要写书评

暂无评论

A sharding blockchain-based UAV system for search and rescue missions

引用

Frontiers of computer Science 2025年第3期19卷 103-118页

作者： Xihan ZHANG Jiashuo ZHANG Jianbo GAO Libin XIA Zhi GUAN Hao HU Zhong CHEN School of Computer Science Peking UniversityBeijing 100871China Peking University Chongqing Research Institute of Big Data Chongqing 401329China National Engineering Research Center for Software Engineering Peking UniversityBeijing 100871China State Key Lab for Novel Software Technology Nanjing UniversityNanjing 210023China

Sharding is a promising technique to tackle the critical weakness of scalability in blockchain-based unmanned aerial vehicle(UAV)search and rescue(SAR)*** breaking up the blockchain network into smaller partitions called shards that run independently and in parallel,shardingbased UAV systems can support a large number of search and rescue UAVs with improved scalability,thereby enhancing the rescue ***,the lack of adaptability and interoperability still hinder the application of sharded blockchain in UAV SAR *** refers to making adjustments to the blockchain towards real-time surrounding situations,while interoperability refers to making cross-shard interactions at the mission *** address the above challenges,we propose a blockchain UAV system for SAR missions based on dynamic sharding *** from the benefits in scalability brought by sharding,our system improves adaptability by dynamically creating configurable and mission-exclusive shards,and improves interoperability by supporting calls between smart contracts that are deployed on different *** implement a prototype of our system based on Quorum,give an analysis of the improved adaptability and interoperability,and conduct experiments to evaluate the *** results show our system can achieve the above goals and overcome the weakness of blockchain-based UAV systems in SAR scenarios.

关键词： blockchain sharding unmanned aerial vehicle search and rescue blockchain interoperability

来源：评论

学校读者我要写书评

暂无评论

PEbfs: Implement High-Performance Breadth-First Search on PEZY-SC3s 24th

PEbfs: Implement High-Performance Breadth-First Search on P...

引用

24th International Conference on Algorithms and Architectures for parallel Processing, ICA3PP 2024

作者： Guo, Weihao Wang, Qinglin Liu, Xiaodong Peng, Muchun Yang, Shun Liang, Yaling Shi, Yongzhen Cao, Ligang Liu, Jie Laboratory of Digitizing Software for Frontier Equipment National University of Defense Technology Changsha410073 China National Key Laboratory of Parallel and Distributed Computing National University of Defense Technology Changsha410073 China Engineering Research Center for National Fundamental Software National University of Defense Technology Changsha410073 China

ISBN: (纸本)9789819615506

The breadth-first search (BFS) algorithm is a fundamental algorithm in graph theory, and it’s parallelization can significantly improve performance. Therefore, there have been numerous efforts to leverage the powerful parallel computing capabilities of hardware like GPGPU to implement high-performance BFS algorithms. However, the energy efficiency is relatively low due to the high power consumption of the platforms on which the algorithm is adapted to. To deal with these challenges, this paper introduces PEbfs that is a high-performance BFS algorithm based on the PEZY-SC3s efficient processor. We integrated three search algorithms, two algorithm optimization strategies, and a directional optimization scheme into PEbfs. Through multiple evaluations of the performance of PEbfs on the public SNAP dataset, the results demonstrate that the average energy efficiency ratio of PEbfs is higher than that of Enterprise and Tigr, the two most advanced implementations on Nvidia’s GPGPU: It achieves 3.08× the average energy efficiency ratio of Enterprise and 4.53× that of Tigr. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Optimization algorithms

来源：评论

学校读者我要写书评

暂无评论

Recognition of carrier-based aircraft flight deck operations based on dynamic graph

引用

Chinese Journal of Aeronautics 2025年第3期38卷 474-490页

作者： Xingyu GUO Jiaxin LI Hua WANG Junnan LIU Yafei LI Mingliang XU School of Computer Science and Artificial Intelligence Zhengzhou UniversityZhengzhou 450001China Engineering Research Center of Intelligent Swarm Systems Ministry of EducationZhengzhou 450001China National Supercomputing Center in Zhengzhou Zhengzhou 450001China School of Geo-Science&Technology Zhengzhou UniversityZhengzhou 450001China

Accurate recognition of flight deck operations for carrier-based aircraft, based on operation trajectories, is critical for optimizing carrier-based aircraft performance. This recognition involves understanding short-term and long-term spatial collaborative relationships among support agents and positions from long spatial–temporal trajectories. While the existing methods excel at recognizing collaborative behaviors from short trajectories, they often struggle with long spatial–temporal trajectories. To address this challenge, this paper introduces a dynamic graph method to enhance flight deck operation recognition. First, spatial–temporal collaborative relationships are modeled as a dynamic graph. Second, a discretized and compressed method is proposed to assign values to the states of this dynamic graph. To extract features that represent diverse collaborative relationships among agents and account for the duration of these relationships, a biased random walk is then conducted. Subsequently, the Swin Transformer is employed to comprehend spatial–temporal collaborative relationships, and a fully connected layer is applied to deck operation recognition. Finally, to address the scarcity of real datasets, a simulation pipeline is introduced to generate deck operations in virtual flight deck scenarios. Experimental results on the simulation dataset demonstrate the superior performance of the proposed method.

关键词： Carrier-based aircraft Flight deck operation Operation recognition Long spatial-temporal trajectories Dynamic graph Biased random walk Graph embeddings

来源：评论

学校读者我要写书评

暂无评论

Energy Harvesting Jammer-Aided Covert Communications in Wireless Multi-Relay IoT Systems

引用

IEEE Internet of Things Journal 2025年第11期12卷 17443-17455页

作者： Lv, Hao Yang, Bin Sun, Xiuwen Gao, Chan Gui, Bao Taleb, Tarik School of Computer Science and Technology of Anhui University Hefei230000 China Chuzhou University School of Computer and Information Engineering Chuzhou239000 China Xi'an University of Posts and Telecommunications National Engineering Research Center for Secured Wireless School of Cybersecurity Xi'an710121 China Ruhr University Bochum Faculty of Electrical Engineering and Information Technology Bochum44801 Germany

This paper investigates covert communications in a multi-relay Internet of Things (IoT) system with multiple energy harvesting jammers, where a transmitter (Alice) attempts to covertly transmit confidential messages to its destination (Bob) through relay forwarding, while a warden (Willie) detects the existence of Alice's transmission. Specifically, we employ a harvesting-then-jamming protocol with which the jammers first harvest energy from Alice and then send jamming signals to interfere with Willie's detection. We propose a relay and jammer selection strategy, namely quality of service (QoS)-aware selection, and use the random selection strategy as a comparison strategy. Under these two selection strategies, we derive the optimal detection threshold and minimum detection error probability at Willie, respectively. We then model the covert throughput performance and obtain the maximum covert throughput by jointly optimizing covert transmit power and jamming transmit power. Extensive numerical results are provided to illustrate the impacts of system parameters on covert throughput performance. © 2014 IEEE.

关键词： Jamming

来源：评论

学校读者我要写书评

暂无评论

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：