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

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

来源：评论

学校读者我要写书评

暂无评论

Towards Adaptive Masked Structural Learning for Graph-Level Clustering

引用

IEEE Transactions on Network science and engineering 2025年第3期12卷 2021-2032页

作者： Yang, Jinbin Cai, Jinyu Zhang, Yunhe Huang, Sujia Wang, Shiping Fuzhou University College of Computer and Data Science Fuzhou350116 China Bank of Quanzhou Company Ltd. Quanzhou362046 China National University of Singapore Institute of Data Science 117602 Singapore Shenzhen Research Institute of Big Data Shenzhen518172 China Chinese University of Hong Kong Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen518172 China

Graph data presents a vast landscape for real-world applications. Current graph-level clustering approaches predominantly utilize graph neural networks to capture the intricate structural information for graph data. However, a significant challenge arises in effectively integrate structural and feature information under the prevalent noise in the real-world scenario. The advent of masking strategies has marked significant strides in boosting model robustness, accommodating incomplete data, and enhancing generalization capabilities. Yet, research attention on leveraging mask strategy for facilitating graph-level clustering is still limited. In this paper, we introduce a novel graph-level clustering method, towards adaptive masked structural learning for graph-level clustering. The method performs adaptive masking through reconstruction loss, and jointly adaptive mask representation learning and clustering in an end-to-end unsupervised framework. The mutual information between maximized the entire graph and substructure representations is also utilized to learn to generate cluster-oriented graph-level representations. Extensive experiments on eight real graph-level benchmark datasets demonstrate the effectiveness and superiority of the proposed method. © 2013 IEEE.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

UnifiedGEC: Integrating Grammatical Error Correction Approaches for Multi-languages with a Unified Framework 31

UnifiedGEC: Integrating Grammatical Error Correction Approac...

引用

31st International Conference on Computational Linguistics, COLING 2025

作者： Zhao, Yike Wang, Xiaoman Lan, Yunshi Qian, Weining School of Data Science and Engineering East China Normal University Shanghai Engineering Research Center of Big Data Management China

ISBN: (纸本)9798891761988

Grammatical Error Correction is an important research direction in NLP field. Although many models of different architectures and datasets across different languages have been developed to support the research, there is a lack of a comprehensive evaluation on these models, and different architectures make it hard for developers to implement these models on their own. To address this limitation, we present UnifiedGEC, the first open-source GEC-oriented toolkit, which consists of several core components and reusable modules. In UnifiedGEC, we integrate 5 widely-used GEC models and compare their performance on 7 datasets in different languages. Additionally, GEC-related modules such as data augmentation, prompt engineering are also deployed in it. Developers are allowed to implement new models, run and evaluate on existing benchmarks through our framework in a simple way. Code, documents and detailed results of UnifiedGEC are available at https://***/AnKate/UnifiedGEC. ©2025 Association for Computational Linguistics.

关键词： Error correction

来源：评论

学校读者我要写书评

暂无评论

An electron-transfer-tuning strategy at the graphene/metal interface for improving acidic water electrolysis in proton exchange membrane electrolyzers

引用

Journal of Energy Chemistry 2025年第4期103卷 344-352页

作者： Yue Xu Shuaidong Li Yingjian He Fumiya Shiokawa Samuel Jeong Aimi Asilah Haji Tajuddin Zeyu Xi Yoshikazu Ito Jingzi Zhang Zeyun Cai Xi Lin Kailong Hu School of Materials Science and Engineering and Institute of Materials Genome & Big Data Harbin Institute of Technology Institute of Applied Physics Graduate School of Pure and Applied Sciences University of Tsukuba Institute of Special Environments Physical Sciences Harbin Institute of Technology School of Computer Science and Technology Harbin Institute of Technology

Graphene encapsulation has been shown to be an effective technique for improving the corrosion resistance of non-noble metal catalysts for the acidic water *** key challenge lies in enhancing the electrocatalytic activity of graphene-encapsulated metals while maintaining their durability in acidic ***,an electron-transfer-tuning strategy is investigated at the graphene/NiMo interface,aiming to improve the hydrogen evolution reaction（HER） performance of graphene-encapsulated NiMo *** doping of Ti,a low electronegativity element,into NiMo substrate was confirmed to increase electron transfer from the metal core toward the *** electron-rich state on graphene facilitates the adsorption of positively charged protons on graphene,thereby enabling a Pt/C-comparable performance in 0.5 M H2SO4,with only a 3.8% degradation in performance over a 120-h continuous *** proton exchange membrane（PEM） water electrolyzer assembled by the N-doped grapheneencapsulated Ti-doped NiMo exhibits a smaller cell voltage to achieve a current density of 2.0 A cm-2,in comparison to the Pt/C based *** study proposes a novel electron-transfer-tuning strategy to improve the HER activity of graphene-encapsulated non-noble metal catalysts without sacrificing durability in acidic electrolytes.

关键词： Acidic media Graphene encapsulation Hydrogen evolution Interface Proton exchange membrane

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Partial Label Learning with Noisy Labels

引用

Annals of data science 2025年第1期12卷 199-212页

作者： Zhao, Pan Tang, Long Pan, Zhigeng School of Artificial Intelligence Nanjing University of Information Science & Technology Nanjing210044 China Research Institute of Talent Big Data Nanjing University of Information Science & Technology Nanjing210044 China

Partial label learning (PLL) is a particular problem setting within weakly supervised learning. In PLL, each sample corresponds to a candidate label set in which only one label is true. However, in some practical application scenarios, the emergence of label noise can make some candidate sets lose their true labels, leading to a decline in model performance. In this work, a robust training strategy for PLL, derived from the joint training with co-regularization (JoCoR), is proposed to address this issue in PLL. Specifically, the proposed approach constructs two separate PLL models and a joint loss. The joint loss consists of not only two PLL losses but also a co-regularization term measuring the disagreement of the two models. By automatically selecting samples with small joint loss and using them to update the two models, our proposed approach is able to filter more and more suspected samples with noise candidate label sets. Gradually, the robustness of the PLL models to label noise strengthens due to the reduced disagreement of the two models. Experiments are conducted on two state-of-the-art PLL models using benchmark datasets under various noise levels. The results show that the proposed method can effectively stabilize the training process and reduce the model's overfitting to noisy candidate label sets. © The Author(s), under exclusive licence to Springer-Verlag GmbH Germany, part of Springer Nature 2024.

关键词： Phase locked loops

来源：评论

学校读者我要写书评

暂无评论

A Helmet Detection Algorithm Based on Transformers with Deformable Attention Module

引用

Chinese Journal of Electronics 2025年第1期34卷 229-241页

作者： Songle Chen Hongbo Sun Yuxin Wu Lei Shang Xiukai Ruan Engineering Research Center of Post Big Data Technology and Application of Jiangsu Province Nanjing University of Posts and Telecommunications State Key Lab for Novel Software Technology Nanjing University Institute of Intelligent Locks Wenzhou University

Wearing a helmet is one of the effective measures to protect workers' safety. To address the challenges of severe occlusion, multi-scale, and small target issues in helmet detection, this paper proposes a helmet detection algorithm based on deformable attention transformers. The main contributions of this paper are as follows. A compact end-to-end network architecture for safety helmet detection based on transformers is proposed. It cancels the computationally intensive transformer encoder module in the existing detection transformer(DETR) and uses the transformer decoder module directly on the output of feature extraction for query decoding, which effectively improves the efficiency of helmet detection. A novel feature extraction network named Swin transformer with deformable attention module(DSwin transformer) is proposed. By sparse cross-window attention, it enhances the contextual awareness of multi-scale features extracted by Swin transformer, and keeps high computational efficiency simultaneously. The proposed method generates the query reference points and query embeddings based on the joint prediction probabilities, and selects an appropriate number of decoding feature maps and sparse sampling points for query decoding, which further enhance the inference capability and processing speed. On the benchmark safety-helmet-wearing-dataset(SHWD), the proposed method achieves the average detection accuracy mAP@0.5 of 95.4% with 133.35G floating-point operations per second(FLOPs) and 20 frames per second(FPS), the state-of-the-art method for safety helmet detection.

关键词： Head Accuracy Network architecture Benchmark testing Transformers Feature extraction Safety Decoding Computational efficiency Detection algorithms

来源：评论

学校读者我要写书评

暂无评论

Successive Interference Cancellation-Enabled Timely Status Update in Linear Multi-hop Wireless Networks

引用

IEEE Transactions on Mobile Computing 2025年第06期24卷 5298-5311页

作者： Han, Xinhui Pan, Haoyuan Wang, Zhaorui Li, Jianqiang Shenzhen University College of Computer Science and Software Engineering Shenzhen China Future Network of Intelligence Institute The School of Science and Engineering Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology The College of Computer Science and Software Engineering Shenzhen China

We investigate the timely status update in linear multi-hop wireless networks, where a source tries to deliver status update packets to a destination through a sequence of half-duplex relays. Timeliness is measured by the age of information (AoI) metric. Maintaining a low AoI at the destination typically necessitates frequent transmission of update packets from the source. However, high packet transmission frequency in multi-hop scenarios can result in mutual wireless interference at intermediate relays. Specifically, when an intermediate relay receives wireless signals of a new packet from its previous node, simultaneous transmission of an old packet by its subsequent node to the next hop may cause wireless signals to interfere at the intermediate relay, conventionally leading to packet collision. A key motivation to solve this issue is that the intermediate relay has previously received the old packet (which can thus be forwarded to the subsequent node for further relaying). Hence, successive interference cancellation (SIC) can be employed to mitigate interference of the old packet and recover the new packet. This paper designs an SIC-enabled packet relaying scheme tailored to low AoI. Initially focusing on a three-hop network, we subsequently extend our approach to general multi-hop networks. We model the multi-hop relaying scheme using a Markov chain to derive the theoretical average AoI. Theoretical and simulation results indicate that the SIC-enabled packet relaying scheme significantly reduces the average AoI compared to the non-SIC approaches, owing to an increased packet transmission frequency at the source and the effectiveness of SIC techniques at the relays. © 2002-2012 IEEE.

关键词： Markov chains

来源：评论

学校读者我要写书评

暂无评论

kProtoClust:Towards Adaptive k-Prototype Clustering without Known k

引用

Computers, Materials & Continua 2025年第3期82卷 4949-4976页

作者： Yuan Ping Huina Li Chun Guo Bin Hao School of Information Engineering Xuchang UniversityXuchang461000China Henan Province Engineering Technology Research Center of Big Data Security andApplications Xuchang461000China College of Computer Science and Technology Guizhou UniversityGuiyang550025China Here Data Technology Shenzhen518000China

Towards optimal k-prototype discovery,k-means-like algorithms give us inspirations of central samples collection,yet the unstable seed samples selection,the hypothesis of a circle-like pattern,and the unknown K are still challenges,particularly for non-predetermined data *** propose an adaptive k-prototype clustering method(kProtoClust)which launches cluster exploration with a sketchy division of K clusters and finds evidence for splitting and *** behalf of a group of data samples,support vectors and outliers from the perspective of support vector data description are not the appropriate candidates for prototypes,while inner samples become the first candidates for instability reduction of *** from the representation of samples in traditional,we extend sample selection by encouraging fictitious samples to emphasize the representativeness of *** get out of the circle-like pattern limitation,we introduce a convex decomposition-based strategy of one-cluster-multiple-prototypes in which convex hulls of varying sizes are prototypes,and accurate connection analysis makes the support of arbitrary cluster shapes *** by geometry,the three presented strategies make kProtoClust bypassing the K dependence well with the global and local position relationship analysis for data *** results on twelve datasets of irregular cluster shape or high dimension suggest that kProtoClust handles arbitrary cluster shapes with prominent accuracy even without the prior knowledge K.

关键词： Prototype finding convex hull support vector data description geometrical information

来源：评论

学校读者我要写书评

暂无评论

An Entorhinal-Hippocampal Loop Model Based on Non-negative Sparse Coding

引用

Journal of The Institution of Engineers (India): Series B 2025年第1期106卷 113-127页

作者： Zhao, Kaixin Ren, Menghui College of Computer Science and Technology Henan Institute of Technology Xinxiang453003 China School of Electrical and Information Engineering Zhengzhou University Zhengzhou450001 China Manufacturing IoT Big Data Engineering Technology Research Center of Henan Province Xinxiang453003 China

In our study, we investigate how the brain maps environmental spaces into understandable maps through hippocampal place cells and entorhinal cortex grid cells. We uncover that the hippocampus and entorhinal cortex are not just directly connected but also engage in a sophisticated feedback loop crucial for spatial encoding during navigation. We developed an innovative network model based on this feedback mechanism, linking entorhinal inputs to hippocampal spatial encoding cells through a non-negative sparse coding, using grid cells and weak spatial cells as inputs. Our findings demonstrate that the model learns and adjusts the characteristics of spatial encoding cells, successfully learning the specific spatial selectivities of place cells even with inputs from cells carrying weaker spatial information. This highlights the critical role of feedback encoding in refining spatial representations, an indispensable component of the brain’s navigation system. Moreover, experiments comparing our model with others validate our model’s exceptional ability in generating precise spatial encodings, underscoring its superiority. This research not only deepens our understanding of the brain’s navigational mechanisms but also offers a robust computational framework for future neuroscience studies, emphasizing the intricate interplay between feedback loops and spatial encoding in the brain’s navigation system. © The Institution of Engineers (India) 2024.

关键词： Brain

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：