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

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

来源：评论

学校读者我要写书评

暂无评论

Precise control of page cache for containers

引用

Frontiers of Computer Science 2024年第2期18卷 17-30页

作者： Kun WANG Song WU Shengbang LI Zhuo HUANG Hao FAN Chen YU Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing Lab School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Container-based virtualization isbecoming increasingly popular in cloud computing due to its efficiency and *** isolation is a fundamental property of *** works have indicated weak resource isolation could cause significant performance degradation for containerized applications and enhanced resource ***,current studies have almost not discussed the isolation problems of page cache which is a key resource for *** leverage memory cgroup to control page cache ***,existing policy introduces two major problems in a container-based ***,containers can utilize more memory than limited by their cgroup,effectively breaking memory ***,the Os kernel has to evict page cache to make space for newly-arrived memory requests,slowing down containerized *** paper performs an empirical study of these problems and demonstrates the performance impacts on containerized *** we propose pCache(precise control of page cache)to address the problems by dividing page cache into private and shared and controlling both kinds of page cache separately and *** do so,pCache leverages two new technologies:fair account(f-account)and evict on demand(EoD).F-account splits the shared page cache charging based on per-container share to prevent containers from using memory for free,enhancing memory *** EoD reduces unnecessary page cache evictions to avoid the performance *** evaluation results demonstrate that our system can effectively enhance memory isolation for containers and achieve substantial performance improvement over the original page cache management policy.

关键词： page cache memory cgroup container isolation cloud computing

来源：评论

学校读者我要写书评

暂无评论

Answering reachability queries with ordered label constraints over labeled graphs

引用

Frontiers of Computer Science 2024年第1期18卷 105-117页

作者： Daoliang HE Pingpeng YUAN 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&TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Reachability query plays a vital role in many graph analysis *** researches proposed many methods to efficiently answer reachability queries between vertex *** many real graphs are labeled graph,it highly demands Label-Constrained Reachability(LCR)query inwhich constraint includes a set of labels besides vertex *** researches proposed several methods for answering some LCR queries which require appearance of some labels specified in constraints in the *** that constraint may be a label set,query constraint may be ordered labels,namely OLCR(Ordered-Label-Constrained Reachability)queries which retrieve paths matching a sequence of ***,no solutions are available for ***,we propose DHL,a novel bloom filter based indexing technique for answering OLCR *** can be used to check reachability between vertex *** the answers are not no,then constrained DFS is ***,we employ DHL followed by performing constrained DFS to answer OLCR *** show that DHL has a bounded false positive rate,and it's powerful in saving indexing time and *** experiments on 10 real-life graphs and 12 synthetic graphs demonstrate that DHL achieves about 4.8-22.5 times smaller index space and 4.6-114 times less index construction time than two state-of-art techniques for LCR queries,while achieving comparable query response *** results also show that our algorithm can answer OLCR queries effectively.

关键词： graph ordered-label-constrained reachability partial index bloom filter query processing

来源：评论

学校读者我要写书评

暂无评论

A Method for Fast Feature Selection Utilizing Cross-Similarity within the Context of Fuzzy Relations

引用

Computers, Materials & Continua 2025年第4期83卷 1195-1218页

作者： Wenchang Yu Xiaoqin Ma Zheqing Zhang Qinli Zhang School of Big Data and Artificial Intelligence Chizhou UniversityChizhou247000China Anhui Education Big Data Intelligent Perception and Application Engineering Research Center Anhui Provincial Joint Construction Key Laboratory of Intelligent Education Equipment and TechnologyChizhou247000China

Feature selection methods rooted in rough sets confront two notable limitations:their high computa-tional complexity and sensitivity to noise,rendering them impractical for managing large-scale and noisy *** primary issue stems from these methods’undue reliance on all *** overcome these challenges,we introduce the concept of cross-similarity grounded in a robust fuzzy relation and design a rapid and robust feature selection ***,we construct a robust fuzzy relation by introducing a truncation ***,based on this fuzzy relation,we propose the concept of cross-similarity,which emphasizes the sample-to-sample similarity relations that uniquely determine feature importance,rather than considering all such relations *** studying the manifestations and properties of cross-similarity across different fuzzy granularities,we propose a forward greedy feature selection algorithm that leverages cross-similarity as the foundation for information *** algorithm significantly reduces the time complexity from O(m2n2)to O(mn2).Experimental findings reveal that the average runtime of five state-of-the-art comparison algorithms is roughly 3.7 times longer than our algorithm,while our algorithm achieves an average accuracy that surpasses those of the five comparison algorithms by approximately 3.52%.This underscores the effectiveness of our *** paper paves the way for applying feature selection algorithms grounded in fuzzy rough sets to large-scale gene datasets.

关键词： Fuzzy rough sets feature selection cross-similarity fuzzy relations

来源：评论

学校读者我要写书评

暂无评论

UCat: heterogeneous memory management for unikernels

引用

Frontiers of Computer Science 2023年第1期17卷 51-61页

作者： Chong TIAN Haikun LIU Xiaofei LIAO Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab/Cluster and Grid Computing LabSchool of Computing Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Unikernels provide an efficient and lightweight way to deploy cloud computing services in application-specialized and single-address-space virtual machines (VMs). They can efficiently deploy hundreds of unikernel-based VMs in a single physical server. In such a cloud computing platform, main memory is the primary bottleneck resource for high-density application deployment. Recently, non-volatile memory (NVM) technologies has become increasingly popular in cloud data centers because they can offer extremely large memory capacity at a low expense. However, there still remain many challenges to utilize NVMs for unikernel-based VMs, such as the difficulty of heterogeneous memory allocation and high performance overhead of address *** this paper, we present UCat, a heterogeneous memory management mechanism that support multi-grained memory allocation for unikernels. We propose front-end/back-end cooperative address space mapping to expose the host memory heterogeneity to unikernels. UCat exploits large pages to reduce the cost of two-layer address translation in virtualization environments, and leverages slab allocation to reduce memory waste due to internal memory fragmentation. We implement UCat based on a popular unikernel--OSv and conduct extensive experiments to evaluate its efficiency. Experimental results show that UCat can reduce the memory consumption of unikernels by 50% and TLB miss rate by 41%, and improve the throughput of real-world benchmarks such as memslap and YCSB by up to 18.5% and 14.8%, respectively.

关键词： unikernel virtualization non-volatile memory heterogeneous memory large page slab allocation

来源：评论

学校读者我要写书评

暂无评论

ARCHER:a ReRAM-based accelerator for compressed recommendation systems

引用

Frontiers of Computer Science 2024年第5期18卷 147-160页

作者： Xinyang SHEN Xiaofei LIAO Long ZHENG Yu HUANG Dan CHEN Hai JIN National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

Modern recommendation systems are widely used in modern data *** random and sparse embedding lookup operations are the main performance bottleneck for processing recommendation systems on traditional platforms as they induce abundant data movements between computing units and ***-based processing-in-memory(PIM)can resolve this problem by processing embedding vectors where they are ***,the embedding table can easily exceed the capacity limit of a monolithic ReRAM-based PIM chip,which induces off-chip accesses that may offset the PIM ***,we deploy the decomposed model on-chip and leverage the high computing efficiency of ReRAM to compensate for the decompression performance *** this paper,we propose ARCHER,a ReRAM-based PIM architecture that implements fully yon-chip recommendations under resource ***,we make a full analysis of the computation pattern and access pattern on the decomposed *** on the computation pattern,we unify the operations of each layer of the decomposed model in multiply-and-accumulate *** on the access observation,we propose a hierarchical mapping schema and a specialized hardware design to maximize resource *** the unified computation and mapping strategy,we can coordinatethe inter-processing elements *** evaluation shows that ARCHER outperforms the state-of-the-art GPU-based DLRM system,the state-of-the-art near-memory processing recommendation system RecNMP,and the ReRAM-based recommendation accelerator REREC by 15.79×,2.21×,and 1.21× in terms of performance and 56.06×,6.45×,and 1.71× in terms of energy savings,respectively.

关键词： recommendation system ReRAM processing-in-memory embedding layer

来源：评论

学校读者我要写书评

暂无评论

A survey on dynamic graph processing on GPUs: concepts, terminologies and systems

引用

Frontiers of Computer Science 2024年第4期18卷 1-23页

作者： Hongru GAO Xiaofei LIAO Zhiyuan SHAO Kexin LI Jiajie CHEN Hai JIN 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 TechnologyHuazhong University of Science and TechnologyWuhan 430074China Zhejiang Lab Hangzhou 311121China

Graphs that are used to model real-world entities with vertices and relationships among entities with edges,have proven to be a powerful tool for describing real-world problems in *** most real-world scenarios,entities and their relationships are subject to constant *** that record such changes are called dynamic *** recent years,the widespread application scenarios of dynamic graphs have stimulated extensive research on dynamic graph processing systems that continuously ingest graph updates and produce up-to-date graph analytics *** the scale of dynamic graphs becomes larger,higher performance requirements are demanded to dynamic graph processing *** the massive parallel processing power and high memory bandwidth,GPUs become mainstream vehicles to accelerate dynamic graph processing ***-based dynamic graph processing systems mainly address two challenges:maintaining the graph data when updates occur(i.e.,graph updating)and producing analytics results in time(i.e.,graph computing).In this paper,we survey GPU-based dynamic graph processing systems and review their methods on addressing both graph updating and graph *** comprehensively discuss existing dynamic graph processing systems on GPUs,we first introduce the terminologies of dynamic graph processing and then develop a taxonomy to describe the methods employed for graph updating and graph *** addition,we discuss the challenges and future research directions of dynamic graph processing on GPUs.

关键词： dynamic graphs graph processing graph algorithms GPUs

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Resource investment for DDoS attack resistant SDN: a practical assessment

引用

Science China(Information Sciences) 2023年第7期66卷 112-129页

作者： Bin YUAN Fan ZHANG Jun WAN Huan ZHAO Shui YU Deqing ZOU Qiangsheng HUA Hai JIN School of Cyber Science and Engineering Huazhong University of Science and Technology National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Engineering Research Center on Big Data Security Shenzhen Huazhong University of Science and Technology Research Institute School of Computer Science and Technology Huazhong University of Science and Technology Cluster and Grid Computing Lab School of Computer Science University of Technology Sydney

Software-defined networks(SDNs) present a novel network architecture that is widely used in various datacenters. However, SDNs also suffer from many types of security threats, among which a distributed denial of service(DDoS) attack, which aims to drain the resources of SDN switches and controllers,is one of the most common. Once the switch or controller is damaged, the network services can be *** defense schemes against DDoS attacks have been proposed from the perspective of attack detection;however, such defense schemes are known to suffer from a time consuming and unpromising accuracy, which could result in an unavailable network service before specific countermeasures are taken. To address this issue through a systematic investigation, we propose an elaborate resource-management mechanism against DDoS attacks in an SDN. Specifically, by considering the SDN topology, we leverage the M/M/c queuing model to measure the resistance of an SDN to DDoS attacks. Network administrators can therefore invest a reasonable number of resources into SDN switches and SDN controllers to defend against DDoS attacks while guaranteeing the quality of service(QoS). Comprehensive analyses and empirical data-based experiments demonstrate the effectiveness of the proposed approach.

关键词： SDN security DDoS attacks resource management queueing theory QoS

来源：评论

学校读者我要写书评

暂无评论

ReCSA:a dedicated sort accelerator using ReRAM-based content addressable memory

引用

Frontiers of Computer Science 2023年第2期17卷 1-13页

作者： Huize LI Hai JIN Long ZHENG Yu HUANG Xiaofei LIAO National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabClusters and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

With the increasing amount of data,there is an urgent need for efficient sorting algorithms to process large data *** sorting algorithms have attracted much attention because they can take advantage of different hardware's *** the traditional hardware sort accelerators suffer“memory wall”problems since their multiple rounds of data transmission between the memory and the *** this paper,we utilize the in-situ processing ability of the ReRAM crossbar to design a new ReCAM array that can process the matrix-vector multiplication operation and the vector-scalar comparison in the same array *** this designed ReCAM array,we present ReCSA,which is the first dedicated ReCAM-based sort *** hardware designs,we also develop algorithms to maximize memory utilization and minimize memory exchanges to improve sorting *** sorting algorithm in ReCSA can process various data types,such as integer,float,double,and *** also present experiments to evaluate the performance and energy efficiency against the state-of-the-art sort *** experimental results show that ReCSA has 90.92×,46.13×,27.38×,84.57×,and 3.36×speedups against CPU-,GPU-,FPGA-,NDP-,and PIM-based platforms when processing numeric data *** also has 24.82×,32.94×,and 18.22×performance improvement when processing string data sets compared with CPU-,GPU-,and FPGA-based platforms.

关键词： ReCAM parallel sorting architecture design processing-in-memory

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：