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

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

来源：评论

学校读者我要写书评

暂无评论

Experimental demonstration of 220-GHz terahertz signals wireless transmission over 4.6 km

引用

science China(information sciences) 2025年第1期68卷 386-388页

作者： Yi WEI Jianjun YU Mingxu WANG Xiongwei YANG Qiutong ZHANG Jingwen TAN Bing ZHANG Ying WU Yang HAN Peng TIAN Wen ZHOU Kaihui WANG Feng ZHAO State Key Laboratory of ASIC and System Key Laboratory for Information Science of Electromagnetic Waves (MoE)School of Information Science and Technology Fudan University School of Electronic Engineering Xi'an University of Posts and Telecommunications

The advancement of terahertz (THz) communication technology drives the evolution of wireless communication systems,offering novel pathways and technical means for the development of future 6G communication *** wireless communication systems are often constrained by bandwidth limitations of electronic devices in high frequency ***,THz communication technology leverages the characteristics of electromagnetic waves to transcend these limitations,enabling communication athigher frequencies and wider bandwidths.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Fractal autoencoder with redundancy regularization for unsupervised feature selection

引用

science China(information sciences) 2025年第2期68卷 89-102页

作者： Meiting SUN Fangyu LI Honggui HAN School of Information Science and Technology Beijing University of Technology Beijing Key Laboratory of Computational Intelligence and Intelligent System Engineering Research Center of Digital Community Ministry of Education Beijing Institute of Artificial Intelligence

Feature selection is a crucial step in data preprocessing because feature selection reduces the dimensionality of data by eliminating irrelevant and redundant features. Since manual labeling is expensive, unsupervised feature selection has received increasing attention in recent years. However, existing unsupervised feature selection methods tend to prioritize selecting highly correlated features over exploring feature diversity. Thus, a regularized fractal autoencoder(RFAE) method is proposed to select informative features in an unsupervised way. Specifically, the fractal autoencoder network extends autoencoders to construct a correspondence neural network and a selection neural network. The correspondence neural network exploits interfeature correlations and the selection neural network selects the informative features. A redundancy regularization strategy consists of a redundancy elimination regularization term based on the dependency between features and a sparse regularization term based on the group lasso. The redundancy regularization strategy eliminates feature subset redundancy and enhances network generalization ability. Extensive experimental results on six publicly available datasets show that the proposed RFAE outperforms the compared methods regarding clustering accuracy and classification accuracy. Moreover, the proposed RFAE achieves acceptable computation efficiency.

关键词： unsupervised feature selection fractal autoencoder correspondence neural network selection neural network redundancy regularization strategy

来源：评论

学校读者我要写书评

暂无评论

Enhanced Tube-Based Event-Triggered Stochastic Model Predictive Control With Additive Uncertainties

引用

IEEE/CAA Journal of Automatica Sinica 2025年第3期12卷 596-605页

作者： Chenxi Gu Xinli Wang Kang Li Xiaohong Yin Shaoyuan Li Lei Wang the School of Control Science and Engineering Shandong University IEEE the School of Electronic and Electrical Engineering University of Leeds the Qingdao University of Science and Technology the Department of Automation Shanghai Jiao Tong University the Key Laboratory of System Control and Information Processing Ministry of Education of China

This paper proposes an event-triggered stochastic model predictive control for discrete-time linear time-invariant(LTI) systems under additive stochastic disturbances. It first constructs a probabilistic invariant set and a probabilistic reachable set based on the priori knowledge of system *** with enhanced robust tubes, the chance constraints are then formulated into a deterministic form. To alleviate the online computational burden, a novel event-triggered stochastic model predictive control is developed, where the triggering condition is designed based on the past and future optimal trajectory tracking errors in order to achieve a good trade-off between system resource utilization and control performance. Two triggering parameters σ and γ are used to adjust the frequency of solving the optimization problem. The probabilistic feasibility and stability of the system under the event-triggered mechanism are also examined. Finally, numerical studies on the control of a heating, ventilation, and air conditioning(HVAC) system confirm the efficacy of the proposed control.

关键词： Event-triggered mechanism heating, ventilation, and air conditioning (HVAC) control probabilistic reachable set stochastic model predictive control

来源：评论

学校读者我要写书评

暂无评论

Single-Valued Neutrosophic Graph with Heptapartitioend Structure

引用

Neutrosophic Sets and systems 2025年 80卷 728-748页

作者： Fathi, Hanaa Myvizhi, M. Abdelhafeez, Ahmed Abdellah, Mohamed Refaat Eassa, Mohamed Sawah, Mohamed S. Elbehiery, Hussam College of Information Technology Amman Arab University Amman Jordan KPR Institute of Engineering and Technology Tamilnadu Coimbatore India Computer Science Department Faculty of Information System and Computer Science October 6 University Giza12585 Egypt Applied Science Research Center Applied Science Private University Amman Jordan The Department of Computer Science College of Information Technology Misr University for Science and Technology Cairo Egypt Department of Computer Science Faculty of Information Technology Ajloun National University P.O.43 Ajloun26810 Jordan

This study applies single-valued neutrosophic sets, which extend the frameworks of fuzzy and intuitionistic fuzzy sets, to graph theory. We introduce a new category of graphs called Single-Valued Heptapartitioned Neutrosophic Graphs (SVHNG) and investigate their characteristics through comprehensive proofs and illustrative examples. © 2025, University of New Mexico. All rights reserved.

关键词： Heptapartitioend Neutrosophic Set Neutrosophic Graph Neutrosophic Sets SVHN-Graph

来源：评论

学校读者我要写书评

暂无评论

Dynamic Charging and Path Planning for UAV-Powered Rechargeable WSNs Using Multi-Agent Deep Reinforcement Learning

引用

IEEE Transactions on Automation science and engineering 2025年 22卷 15610-15626页

作者： Betalo, Mesfin Leranso Leng, Supeng Seid, Abegaz Mohammed Abishu, Hayla Nahom Erbad, Aiman Bai, Xiaoshan Shenzhen University College of Mechatronics and Control Engineering Shenzhen518060 China University of Electronic Science and Technology of China School of Information and Communication Engineering Chengdu611731 China Hamad Bin Khalifa University Division of Information and Computing Technology College of Science and Engineering Doha Qatar Shenzhen University College of Mechatronics and Control Engineering National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Unmanned Aerial Vehicle (UAV)-powered 5G/6G networks integrated with rechargeable wireless sensor networks (RWSNs) offer promising solutions for extending system lifetime, collecting data, and providing computing services and power to sensor nodes (SNs). UAVs offer significant advantages, including exceptional mobility, cost-effective deployment, and the ability to be easily reprogrammed for a wide range of missions. However, the limited onboard power capacity of UAVs, coupled with the lack of dynamic and intelligent charging station (CS) management and inefficient path planning, can lead to SN failure in dynamic mobile environments. To address these challenges, we propose an energy-efficient laser-charged UAV (LCU)-enabled RWSN environment, wherein UAVs, powered by laser beams from ground-based stations, provide services, collect data, and transfer energy to SNs. We formulate a joint optimization problem involving power allocation, dynamic charging strategy (DCS), and path planning to minimize task completion time and sensor node death time. Given the NP-hard nature of the problem, we employ a stochastic game model based on a Markov decision process (MDP) for its solution. To solve this problem, we propose a deep reinforcement learning (DRL) based algorithm that enables real-time charging scheduling decisions while optimizing network performance. We introduce a multi-agent double deep Q-network (MA-DDQN) model to determine the optimal trajectories for all UAVs in large and complex environments. Simulation results demonstrate that the MA-DDQN approach outperforms state-of-the-art techniques, showing significant improvements in terms of average delay, energy consumption, and task completion time. © 2004-2012 IEEE.

关键词： Stochastic models

来源：评论

学校读者我要写书评

暂无评论

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage Cost KV-Separated LSM Store with SmartSSD-based GC Offloading 23

AegonKV: A High Bandwidth, Low Tail Latency, and Low Storage...

引用

23rd USENIX Conference on File and Storage Technologies, FAST 2025

作者： Duan, Zhuohui Feng, Hao Liu, Haikun Liao, Xiaofei Jin, Hai Li, Bangyu National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab/Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology China

ISBN: (纸本)9781939133458

The key-value separation is renowned for its significant mitigation of the write amplification inherent in traditional LSM trees. However, KV separation potentially increases performance overhead in the management of Value region, especially for garbage collection (GC) operation that is used to reduce the redundant space occupation. In response, many efforts have been made to optimize the GC mechanism for KV separation. However, our analysis indicates that such solution based on trade-offs between CPU and I/O overheads cannot simultaneously satisfy the three requirements of KV separated systems in terms of throughput, tail latency, and space usage. This limitation hinders their real-world application. In this paper, we introduce AegonKV, a "three-birds-one-stone" solution that comprehensively enhances the throughput, tail latency, and space usage of KV separated systems. AegonKV first proposes a SmartSSD-based GC offloading mechanism to enable asynchronous GC operations without competing with LSM read/write for bandwidth or CPU. AegonKV leverages offload-friendly data structures and hardware/software execution logic to address the challenges of GC offloading. Experiments demonstrate that AegonKV achieves the largest throughput improvement of 1.28-3.3 times, a significant reduction of 37%-66% in tail latency, and 15%-85% in space overhead compared to existing KV separated systems. © 2025 FAST. All Rights Reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

Joint AP Clustering and Beamforming Design for RIS-Aided Cell-Free Networks

引用

IEEE Transactions on Vehicular technology 2025年第5期74卷 8315-8320页

作者： Xu, Chunmei Jia, Yuanqi Chen, Youjia Huang, Wei Southeast University National Mobile Communications Research Laboratory School of Information Science and Engineering Nanjing210096 China Southeast University School of Information Science and Engineering Nanjing210096 China Fuzhou University Fujian Key Lab for Intelligent Processing and Wireless Transmission of Media Information College of Physics and Information Engineering Fuzhou350108 China Hefei University of Technology School of Computer Science and Information Engineering Hefei230601 China

Cell-free networks and reconfigurable intelligent surfaces (RIS) are two promising techniques for future wireless communications. The integration of RIS into cell-free networks, termed RIS-aided cell-free networks, offers the potential to significantly enhance network performance. However, the realization of this potential is constrained by the limited capacities of the fronthaul links. To address this challenge, we investigate the joint design of access point (AP) clustering, transmit and passive beamforming in RIS-aided cell-free networks. The objective is to maximize the weighted sum-rate performance while minimizing the number of clustered APs to alleviate the fronthaul overhead. The problem is formulated in a group sparse manner, employing a mixed zero-norm/two-norm term to represent the number of the clustered APs. To solve this problem, we first approximate the mixed zero-norm/two-norm term by the mixed one-norm/two-norm term and provide its equivalent formulation by introducing receive beamforming vectors and weight parameters. Then, an iterative method is proposed based on the block coordinate descent (BCD) technique, which is guaranteed to converge to a stationary point. Simulation results demonstrate the effectiveness of the proposed method. © 1967-2012 IEEE.

关键词： Iterative methods

来源：评论

学校读者我要写书评

暂无评论

Seer: Accelerating Block chain Transaction Execution by Fine-Grained Branch Prediction 51st

Seer: Accelerating Block chain Transaction Execution by Fine...

引用

51st International Conference on Very Large Data Bases, VLDB 2025

作者： Zhang, Shijie Cheng, Ru Liu, Xinpeng Xiao, Jiang Jin, Hai Li, Bo National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Cluster and Grid Computing Lab School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Department of Computer Science and Engineering Hong Kong University of Science and Technology Hong Kong

Increasingly popular decentralized applications (dApps) with complex application logic incur significant overhead for executing smart contract transactions, which greatly limits public block chain performance. Pre-executing transactions off the critical path can mitigate substantial I/O and computation costs during execution. However, pre-execution does not yield any state transitions, rendering the system state inconsistent with actual execution. This inconsistency can lead to deviations in pre-execution paths when processing smart contracts with multiple state-related branches, thus diminishing pre-execution effectiveness. In this paper, we develop Seer, a novel public block chain execution engine that incorporates fine-grained branch prediction to fully exploit pre-execution effectiveness. Seerpredicts state-related branches using a two-level prediction approach, reducing inconsistent execution paths more efficiently than executing all possible branches. To enable effective reuse of pre execution results, Seer employs checkpoint-based fast-path execution, enhancing transaction execution for both successful and unsuccessful predictions. Evaluations with realistic block chain workloads demonstrate that Seer delivers an average of 27.7× transaction-level speedup and an overall 20.6× speedup in the execution phase over vanilla Ethereum, outperforming existing block chain execution acceleration solutions. © 2025, VLDB Endowment, All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：