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

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

来源：评论

学校读者我要写书评

暂无评论

Orbit-Orbit Interaction in Spatiotemporal Optical Vortex

引用

engineering 2025年第2期45卷 44-51页

作者： Jian Chen Jie Zhao Xi Shen Dewei Mo Cheng-Wei Qiu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China Department of Electrical and Computer Engineering National University of SingaporeSingapore 117583Singapore

While spin-orbit interaction has been extensively studied,few investigations have reported on the interaction between orbital angular momenta(OAMs).In this work,we study a new type of orbit-orbit coupling between the longitudinal OAM and the transverse OAM carried by a three-dimensional(3D)spatiotemporal optical vortex(STOV)in the process of tight *** 3D STOV possesses orthogonal OAMs in the x-y,t-x,and y-t planes,and is preconditioned to overcome the spatiotemporal astigmatism effect.x,y,and t are the axes in the spatiotemporal *** corresponding focused wavepacket is calculated by employing the Debye diffraction theory,showing that a phase singularity ring is generated by the interactions among the transverse and longitudinal vortices in the highly confined *** Fourier-transform decomposition of the Debye integral is employed to analyze the mechanism of the orbit-orbit *** is the first revelation of coupling between the longitudinal OAM and the transverse OAM,paving the way for potential applications in optical trapping,laser machining,nonlinear light-matter interactions,and more.

关键词： Spatiotemporal optical vortex Orbital angular momentum Momentum interaction Highly confined wavepacket Diffraction

来源：评论

学校读者我要写书评

暂无评论

FlexIM: Efficient and Verifiable Index Management in Blockchain

引用

IEEE Transactions on Knowledge and Data engineering 2025年第6期37卷 3399-3412页

作者： Li, Binhong Lin, Licheng Zhang, Shijie Xu, Jianliang Xiao, Jiang Li, Bo Jin, Hai Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Laboratory The Cluster and Grid Computing Laboratory School of Computer Science and Technology Wuhan430074 China Hong Kong Baptist University School of Computer Science Hong Kong Hong Kong University of Science and Technology Department of Computer Science and Engineering Hong Kong999077 Hong Kong

Blockchain-based query with its traceability and data provenance has become increasingly popular and widely adopted in numerous applications. Yet existing index-based query approaches are only efficient under static blockchain query workloads where the query attribute or type must be fixed. It turns out to be particularly challenging to construct an efficient index for dynamic workloads due to prohibitively long construction time and excessive storage consumption. In this paper, we present FlexIM, the first efficient and verifiable index management system for blockchain dynamic queries. The key innovation in FlexIM is to uncover the inherent characteristics of blockchain, i.e., data distribution and block access frequency, and then to optimally choose the index by utilizing reinforcement learning technique under varying workloads. In addition, we enhance and facilitate verifiability with low storage overhead by leveraging Root Merkle Tree (RMT) and Bloom Filter Merkle Tree (BMT). Our comprehensive evaluations demonstrate that FlexIM outperforms the state-of-the-art blockchain query mechanism, vChain+, by achieving a 26.5% speedup while consuming 94.2% less storage, on average, over real-world Bitcoin datasets. © 1989-2012 IEEE.

关键词： Structured Query Language

来源：评论

学校读者我要写书评

暂无评论

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

引用

IEEE Transactions on Mobile Computing 2025年第6期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

来源：评论

学校读者我要写书评

暂无评论

Latent Diffusion Model-Enabled Low-Latency Semantic Communication in the Presence of Semantic Ambiguities and Wireless Channel Noises

引用

IEEE Transactions on Wireless Communications 2025年第5期24卷 4055-4072页

作者： Pei, Jianhua Feng, Cheng Wang, Ping Tabassum, Hina Shi, Dongyuan Huazhong University of Science and Technology School of Electrical and Electronic Engineering Hubei Wuhan China Cornell University Energy Systems Engineering System Engineering IthacaNY United States York University Lassonde School of Engineering Department of Electrical Engineering and Computer Science TorontoON Canada

Deep learning (DL)-based Semantic Communications (SemCom) is becoming critical to maximize overall efficiency of communication networks. Nevertheless, SemCom is sensitive to wireless channel uncertainties, source outliers, and suffer from poor generalization bottlenecks. To address the mentioned challenges, this paper develops a latent diffusion model-enabled SemCom system with three key contributions, i.e., i) to handle potential outliers in the source data, semantic errors obtained by projected gradient descent based on the vulnerabilities of DL models, are utilized to update the parameters and obtain an outlier-robust encoder, ii) a lightweight single-layer latent space transformation adapter completes one-shot learning at the transmitter and is placed before the decoder at the receiver, enabling adaptation for out-of-distribution data and enhancing human-perceptual quality, and iii) an end-to-end consistency distillation (EECD) strategy is used to distill the diffusion models trained in latent space, enabling deterministic single or few-step low-latency denoising in various noisy channels while maintaining high semantic quality. Extensive numerical experiments across different datasets demonstrate the superiority of the proposed SemCom system, consistently proving its robustness to outliers, the capability to transmit data with unknown distributions, and the ability to perform real-time channel denoising tasks while preserving high human perceptual quality, outperforming the existing denoising approaches in semantic metrics such as multiscale structural similarity index measure (MS-SSIM) and learned perceptual image path similarity (LPIPS). © 2002-2012 IEEE.

关键词： Image enhancement

来源：评论

学校读者我要写书评

暂无评论

Unsupervised Outlier Detection with Reinforced Noise Discriminator

引用

ACM Transactions on Intelligent systems and Technology 2025年第2期16卷 1-26页

作者： Zhang, Zhongping Liu, Daoheng Zhu, Jinwei Wu, Youxi Hebei Key Laboratory of Computer Virtual Technology and System Integration School of Information Science and Engineering Yanshan University Qinhuangdao China School of Information Science and Engineering Yanshan University Qinhuangdao China School of Artificial Intelligence Hebei University of Technology Tianjin China

Outlier detection is one of the hot topics in the field of machine learning and data mining. At present, there are many kinds of outlier detection algorithms. The accuracies of traditional outlier detection algorithms are often affected by unique parameters, and an increase in the amount of data and the dimensions of the data can seriously affect their efficiency and effectiveness. Methods based on generative adversarial networks (GANs) can solve the above problems, but they are unacceptable since the model often collapses during the training period. In this article, to solve the problems of curse of dimensionality and model collapse, we propose a novel reinforced noise discriminator (RND) method for unsupervised outlier detection in tabular data. We consider outlier detection as a binary classification problem. Thus, we apply a learnable reinforced discriminator and generate a large number of potential outliers with a uniform distribution and potential outliers that are close to the original data that are used as a negative sample to train the discriminator, which learns the distribution of the original data to detect outliers. We empirically compare the proposed approach with ten state-of-the-art outlier detection methods on both synthetic and real-world tabular datasets. The experimental results show that RND outperforms its competitors in the majority of cases. The codes used to perform the experiments described in this article are available at https://***/urlhearts/r-n-d. © 2025 Copyright held by the owner/author(s). Publication rights licensed to ACM.

关键词： Generative adversarial networks

来源：评论

学校读者我要写书评

暂无评论

Enhancement Methods for Chiral Optical Signals by Tailoring Optical Fields and Nanostructures

引用

engineering 2025年第2期45卷 25-43页

作者： Hanqing Cai Liangliang Gu Haifeng Hu Qiwen Zhan School of Optical-Electrical and Computer Engineering University of Shanghai for Science and TechnologyShanghai 200093China Zhangjiang Laboratory Shanghai 201204China Shanghai Key Laboratory of Modern Optical System University of Shanghai for Science and TechnologyShanghai 200093China

The unique property of chirality is widely used in various *** the past few decades,a great deal of research has been conducted on the interactions between light and matter,resulting in significant technical advancements in the precise manipulation of light field *** this review,which focuses on current chiral optics research,we introduce the fundamental theory of chirality and highlight the latest achievements in enhancing chiral signals through artificial nano-manufacturing technology,with a particular focus on mechanisms such as light scattering and Mie resonance used to amplify chiral *** providing an overview of enhanced chiral signals,this review aims to provide researchers with an indepth understanding of chiral phenomena and its versatile applications in various domains.

关键词： Mie scattering Optical chirality Circular dichroism Orbital angular momentum Bound states in the continuum Nonlinear optics

来源：评论

学校读者我要写书评

暂无评论

MPTrack: Visual Tracking with Reliable Motion Prompts 24

MPTrack: Visual Tracking with Reliable Motion Prompts

引用

2024 International Conference on Artificial Intelligence of Things and Computing, AITC 2024

作者： Sun, Songtao Li, Lunbo Aerospace System Engineering of Shanghai Shanghai China School of Computer Science and Engineering Nanjing University of Science and Technology Jiangsu Nanjing China

ISBN: (纸本)9798400709869

Recently, the attention mechanism has been introduced into object tracking, making significant improvements in tracking performance. However, the tracking target often undergoes deformation during tracking, which can easily lead to the loss of the target. In this paper, we design the motion perception unit (MPU) to enhance tracking stability. The MPU generates motion prompts rich in dynamic target appearance information and integrates them into object modeling. This integration allows our tracker to better adapt to changes in target motion and appearance, improving the adaptability to the target motion. Extensive experiments demonstrate that our tracker MPTrack outperforms all state-of-the-art trackers on five widely recognized benchmarks, including GOT-10k, TrackingNet, LaSOText, UAV123, and TNL2K, while running at real-time speed. Copyright © 2024 held by the owner/author(s). Publication rights licensed to ACM.

关键词： Target motion

来源：评论

学校读者我要写书评

暂无评论

Cost-Effective Edge Data Caching with Failure Tolerance and Popularity Awareness

引用

IEEE Transactions on Mobile Computing 2025年第6期24卷 5357-5369页

作者： Luo, Ruikun Zhang, Zujia He, Qiang Xu, Mengxi Chen, Feifei Dai, Xiaohai Wu, Song Jin, Hai Huazhong University of Science and Technology 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 China Deakin University School of Information Technology GeelongVIC3125 Australia

In the mobile edge computing environment, caching data in edge storage systems can significantly reduce data retrieval latency for users while saving the costs incurred by cloud-edge data transmissions for app vendors. Existing edge data caching (EDC) methods prioritize popular data and aim to minimize users' data retrieval latency and system storage costs jointly. However, these EDC methods often rely on the assumption that data popularity always follows certain distributions. As a result, they cannot properly adapt to the fluctuations in data popularity due to user mobility or unexpected increases in user demands. Meanwhile, unlike cloud data centers, complex and fragile edge servers are more likely to experience physical failures or network outages, presenting new challenges for EDC strategies. Specifically, when an edge server fails or experiences an outage, cached data may become temporarily unavailable, leading to increased latency as requests are redirected to alternative servers or the cloud. In this paper, to enable uncertainty-aware edge data caching (uEDC), we first model the problem as a robust optimization problem and propose an optimal algorithm named uEDC-B to find the optimal uEDC solution. To address the high computational complexity of uEDC-B, we introduce an approximate algorithm named uEDC-L based on linear decision rules. Theoretical analysis and extensive experiments on a real-world dataset demonstrate that the proposed methods outperform two state-of-the-art approaches in handling the uncertainties in data popularity and edge server failure with a significant performance improvement of 59.27% in data retrieval latency and 55.07% in data caching cost. © 2002-2012 IEEE.

关键词： Mobile edge computing

来源：评论

学校读者我要写书评

暂无评论

UDI-3DVT: A Novel Network for 3-D Reconstruction via Uncertainty-Driven Sampling and Incremental Visual-Tactile Fusion

引用

IEEE Sensors Journal 2025年第6期25卷 10358-10369页

作者： Zhang, Chenyang Zhang, Shaohua Li, Yao Chen, Wenbai Gao, Guowei Wu, Peiliang Yanshan University Key Laboratory for Computer Virtual Technology and System Integration of Hebei Province School of Information Science and Engineering Qinhuangdao066004 China Beijing Information Science and Technology University School of Automation Beijing100192 China

The fusion of visual and tactile senses allows robots to reconstruct and understand objects, aiding in downstream tasks such as object recognition and object grasping. However, most existing visual-tactile reconstruction methods typically overlook the role of visual point cloud processing in reconstruction, sampling points using generative-based methods rather than uncertainty-driven approaches. In addition, these methods only concatenate visual and tactile features, failing to fully leverage the complementary advantages of these two modalities, resulting in unsatisfactory reconstruction results. To address this issue, leveraging the open-source GelSight tactile sensor, this article proposes a novel method called UDI-3DVT, which reconstructs 3-D shapes by combining visual point clouds and multiple tactile images. Specifically, we explore the uncertainty of point clouds, performing additional sampling on high-uncertainty edge points, and propose an attention-based point cloud sampling method. Then, the framework leverages the efficiency of convolutional neural network (CNN) in image processing and the transformer's superiority in context modeling by using CNN for tactile features and transformer for visual features. A feature fusion module based on 1 × 1 convolution is designed to aggregate features from two branches. By gradually adding tactile features, we achieve incremental visual-tactile integration. Furthermore, since the contact-based perception of tactile sensors may cause slight deformations in objects, UDI-3DVT supports the reconstruction of both rigid and deformable objects. Extensive experiments demonstrate that our proposed framework outperforms current state-of-the-art (SOTA) methods, especially the Chamfer distance (CD) metric increased by 14.8%. © 2001-2012 IEEE.

关键词： Image reconstruction

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：