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

39th IEEE International Conference on data engineering, ICDE 2023

作者： Liu, Zirui Kong, Chaozhe Yang, Kaicheng Yang, Tong Miao, Ruijie Chen, Qizhi Zhao, Yikai Tu, Yaofeng Cui, Bin Peking University School of Computer Science National Engineering Laboratory for Big Data Analysis Technology and Application Beijing China Peng Cheng Laboratory Shenzhen China Zte Corporation China

ISBN: (纸本)9798350322279

Batch is an important pattern in data streams, which refers to a group of identical items that arrive closely. We find that some special batches that arrive periodically are of great value. In this paper, we formally define a new pattern, namely periodic batches. A group of periodic batches refers to several batches of the same item, where these batches arrive periodically. Studying periodic batches is important in many applications, such as caches, financial markets, online advertisements, networks, etc. We propose a one-pass sketching algorithm, namely the HyperCalm sketch, which takes two phases to detect periodic batches in real time. In phase 1, we propose a time-aware Bloom filter, namely HyperBloomFilter (HyperBF), to detect the start of batches. In phase 2, we propose an enhanced top-k algorithm, called Calm Space-Saving (CalmSS), to report top-k periodic batches. We theoretically derive the error bounds for HyperBF and CalmSS. Extensive experiments show HyperCalm outperforms the strawman solutions 4× in term of average relative error and 13.2× in term of speed. We also apply HyperCalm to a cache system and integrate HyperCalm into Apache Flink. All related codes are open-sourced. © 2023 IEEE.

关键词： Error analysis

来源：评论

学校读者我要写书评

暂无评论

A Graph Sequence Generator and Multi-head Self-attention Mechanism based Knowledge Graph Reasoning Architecture 26

A Graph Sequence Generator and Multi-head Self-attention Mec...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Wu, Yuejia Zhou, Jian-Tao College of Computer Science Inner Mongolia University Hohhot China National & Local Joint Engineering Research Center Intelligent Info. Proc. Technology for Mongolian Engineering Research Center of Ecological Big Data Ministry of Education Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (纸本)9798350331684

Knowledge Graph (KG) is an essential research direction that involves storing and managing knowledge data, but its incompleteness and sparsity hinder its development in various applications. Knowledge Graph Reasoning (KGR) is an effective method to solve this limitation via reasoning missing knowledge based on existing knowledge. The graph Convolution Network (GCN) based method is one of the state-of-the-art approaches to this work. However, there are still some problems, such as the insufficient ability to perceive graph structure and the poor effect of learning data features which may limit the reasoning accuracy. This paper proposes a KGR architecture based on a graph sequence generator and multi-head self-attention mechanism, named GaM-KGR, to improve the above problems and enhance prediction accuracy. Specifically, the GaM-KGR first introduces the graph generation model into the field of KGR for graph representation learning to obtain the hidden features in the data so that enhancing the reasoning effect and then embeds the generated graph sequence into the multi-head self-attention mechanism for subsequent processing to improve the graph structure perception ability of the proposed architecture, so that it can process the graph structure data more appropriately. Extensive experimental results show that the GaM-KGR architecture can achieve the state-of-the-art prediction results of current GCN-based models. © 2023 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

A Digital Twin-based Framework of Motion Control and State Monitoring for Pneumatic Muscle

引用

Recent Patents on Mechanical engineering 2023年第3期16卷 203-213页

作者： Xie, Shenglong Liu, Wenyuan Duan, Huiru Chen, Dijian Wan, Yanjian Key Laboratory of Intelligent Manufacturing Quality Big Data Tracking and Analysis of Zhejiang Province China Ji-liang University Zhejiang Hangzhou310018 China Anhui Engineering Research Center for Intelligent Applications and Security of Industrial Internet Anhui University of Technology Anhui Ma'anshan243032 China

Introduction: The current digital twin systems usually have the drawback of high cost and complex technology, and it is necessary to develop a simple solution to reduce the cost and cycle for the development of digital twin systems, especially for small projects or systems with simple structures. Objective: A low-cost patent technology of digital twin system was proposed by taking the motion control and state monitoring system (MCSMS) of pneumatic muscle as an example. Methods: The MCSMS is developed based on the browser/server architecture. The software of 3ds Max and SolidWorks are used to make the virtual model, *** and JavaScript are applied to build the browser side. data of the physical world is collected and processed on the server side firstly, and then is sent to the browser side through HTTP communication protocol to realize data interchange between the browser and server. Results: In the roaming experiment and the experiment of motion control and state monitoring of pneumatic muscle, the MCSMS can work smoothly without obvious delay and has good real-time performance, which can realize the 3D visual monitoring of the pneumatic muscle very well. Conclusion: The experimental results indicate that the proposed method possesses the ability of good feasibility and effectiveness. © 2023 Bentham science Publishers.

关键词： Muscle

来源：评论

学校读者我要写书评

暂无评论

Improved Demonstration-Knowledge Utilization in Reinforcement Learning

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第5期5卷 2139-2150页

作者： Liu, Yanyu Zeng, Yifeng Ma, Biyang Pan, Yinghui Gao, Huifan Zhang, Yuting Xiamen University Xiamen Key Laboratory of Big Data Intelligent Analysis and Decision Department of Automation Xiamen361102 China Northumbria University Department of Computer and Information Sciences NewcastleNE1 8ST United Kingdom Minnan Normal University Department of Computer Science Zhangzhou363000 China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen518060 China

Reinforcement learning (RL) has made great success in recent years. Generally, the learning process requires a huge amount of interaction with the environment before an agent can achieve acceptable performance. This motivates many techniques, such as incorporating prior knowledge which is usually presented as experts' demonstration, and using a probability distribution to represent state-and-action values, to accelerate the learning process. The methods perform well when the prior knowledge is genuinely correct and no much change occurs to the learning environment. However, the requirement is not perfectly realistic in many complex applications. The demonstration knowledge may not reflect the true environment and even be full of noise. In this article, we introduce a dynamic distribution merging method to improve knowledge utilization in a general RL algorithm, namely Q-learning. The new method adapts a normal distribution to represent state-action values and merges the prior and learned knowledge in a discriminative way. We theoretically analyze the new learning method and demonstrate its empirical performance over multiple problem domains. © 2020 IEEE.

关键词： Merging

来源：评论

学校读者我要写书评

暂无评论

Investigate the relationship between learners' social characteristics and academic achievements 5

Investigate the relationship between learners' social charac...

引用

5th International Workshop on Statistical Physics and Mathematics for Complex Systems, SPMCS 2017

作者： Liu, Zhi Kang, Lingyun Su, Zhu Liu, Sannyuya Sun, Jianwen National Engineering Research Center for E-Learning Central China Normal University Wuhan China National Engineering Laboratory for Technology of Big Data Applications in Education Central China Normal University Wuhan China

The social interaction behaviors of group learning have obtained a lot of attention from researches, and social network analysis (SNA) plays a critical role in exploring collective interactive patterns. In this paper, we investigated the experimental data from the discussion forum of "Discourse analysis" course in a university learning platform. By calculating learners social characteristics, we explored the relationship between social characteristics and academic achievements, as well as the differences between various achieving learners. The results show that there exist strong positive correlations between most social characteristics and academic achievements, and the majority of high-achieving learners are located at the core position of the network. In addition, the high-achieving learners exhibited more active participations in discussions and received more posts compared with middle- and low-achieving learners. © Published under licence by IOP Publishing Ltd.

关键词：

来源：评论

学校读者我要写书评

暂无评论

The role of 4D flow MRI in deep vein thrombosis research

Meta-Radiology

引用

Meta-Radiology 2025年第1期3卷

作者： Li, Meizhi Wu, Shangjie Liang, Xiao Gao, Chuanqi Hu, Muhua Chen, Zhu He, Pei Jia, Tingting Xiong, Li Department of Pulmonary and Critical Care Medicine The Second Xiangya Hospital of Central South University Changsha China Department of Medical Administration The Second Xiangya Hospital of Central South University Changsha China Clinical Medical Research Center for Pulmonary and Critical Care Medicine in Hunan Province Changsha China Hunan Research Centre for Evidence-based Medicine The Second Xiangya Hospital of Central South University Changsha China Department of Biomedical Engineering School of Basic Medical Science Central South University Changsha China Department of Radiology Second Xiangya Hospital Central South University Changsha China Hunan Key Laboratory for Super Microstructure and Ultrafast Process School of Physics and Electronics Central South University Changsha China National Engineering Research Center for Medical Big Data Application Technology and Big Data Institute Central South University Changsha China General Surgery Department of Second Xiangya Hospital Central South University Changsha China General Surgery Intelligent Healthcare Division of Clinical Medical Research Center of Hunan Province Changsha China

Four-dimensional (4D) flow Magnetic Resonance Imaging (MRI) technology has emerged as a valuable tool in angiography, offering unique insights into the hemodynamics and flow patterns. This research aims to explore the role of 4D flow MRI in advancing our understanding of Deep Vein Thrombosis (DVT), covering its applications in diagnosing, characterizing and mechanism of DVT, as well as its potential for guiding treatment strategies. The qualitative and quantitative information provided by 4D flow MRI enables a comprehensive assessment of blood flow in different vascular regions, shedding light on the relationship between hemodynamic changes and the onset and progression of vascular diseases. Nevertheless, most quantitative research findings for 4D hemodynamic indicators are lacking, and their use is mainly limited to examining arterial conditions. More exploration will be necessary to determine their applicability in studying venous vessels. © 2025 The Authors

关键词： 4D flow MRI Deep vein thrombosis Image analysis algorithms Noninvasive imaging

来源：评论

学校读者我要写书评

暂无评论

JGC-IAGCL: Fusing joint graph convolution and intent-aware graph contrastive learning for explainable recommendation

引用

Information Fusion 2025年 123卷

作者： Zhi Yang Chuan Lin Yongbin Qin Ruizhang Huang Yanping Chen Jiwei Qin State Key Laboratory of Public Big Data Guizhou University Guiyang 550025 Guizhou China Text Computing & Cognitive Intelligence Engineering Research Center of National Education Ministry College of Computer Science and Technology Guizhou University Guiyang 550025 Guizhou China College of Information Science and Engineering Xinjiang University Urumqi 830046 Xinjiang Uygur Autonomous Region China

Graph contrastive learning (GCL) enhances recommendation accuracy by leveraging self-supervised features to refine node representations from large-scale unlabeled data. Traditional GCL-based recommendation models typically construct contrastive views via graph augmentation (e.g., stochastic node/edge dropout) or embedding-space perturbation, aiming to maximize representation consistency. However, these methods struggle to effectively model and interpret user preferences and consumption intents, limiting explainability and recommendation performance. To address these challenges, we propose JGC-IAGCL ( Joint Graph Convolution and Intent-Aware Graph Contrastive Learning ), an explainable recommendation framework. JGC-IAGCL integrates joint graph convolution to capture implicit user preferences and employs intent-aware graph contrastive learning to extract explicit user intents from user–item interactions. By fusing these features, our method generates evenly distributed, intent-propensity-aware user/item representations. Theoretical analysis shows that JGC-IAGCL mitigates popularity bias while enhancing the exposure of long-tail items. Extensive experiments on four highly sparse public datasets validate its effectiveness, demonstrating superior recommendation accuracy and improved interpretability.

关键词： Collaborative filtering data augmentation Graph contrastive learning Recommender system Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

Discovering Cohesive Temporal Subgraphs with Temporal Density Aware Exploration

引用

Journal of Computer science & Technology 2022年第5期37卷 1068-1085页

作者： Chun-Xue Zhu Long-Long Lin Ping-Peng Yuan Hai Jin National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Service Computing Technology and System Laboratory Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory Huazhong University of Science and TechnologyWuhan 430074China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China

Real-world networks,such as social networks,cryptocurrency networks,and e-commerce networks,always have occurrence time of interactions between *** networks are typically modeled as temporal *** cohesive subgraphs from temporal graphs is practical and essential in numerous data mining applications,since mining cohesive subgraphs gets insights into the time-varying nature of temporal ***,existing studies on mining cohesive subgraphs,such as Densest-Exact and k-truss,are mainly tailored for static graphs(whose edges have no temporal information).Therefore,those cohesive subgraph models cannot indicate both the temporal and the structural characteristics of *** this end,we explore the model of cohesive temporal subgraphs by incorporating both the evolving and the structural characteristics of temporal ***,the volume of time intervals in a temporal network is *** a result,the time complexity of mining temporal cohesive subgraphs is *** efficiently address the problem,we first mine the temporal density distribution of temporal *** by the distribution,we can safely prune many unqualified time intervals with the linear time ***,the remaining time intervals where cohesive temporal subgraphs fall in are examined using the greedy *** results of the experiments on nine real-world temporal graphs indicate that our model outperforms state-of-the-art solutions in efficiency and ***,our model only takes less than two minutes on a million-vertex DBLP and has the highest overall average ranking in EDB and TC metrics.

关键词： temporal network temporal feature distribution cohesive subgraph convex property

来源：评论

学校读者我要写书评

暂无评论

Minimal Context-Switching data Race Detection with dataflow Tracking

引用

Journal of Computer science & Technology 2024年第1期39卷 211-226页

作者：郑龙李洋辛杰刘海峰郑然廖小飞金海 National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Laboratory School of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China

data race is one of the most important concurrent anomalies in multi-threaded *** con-straint-based techniques are leveraged into race detection,which is able to find all the races that can be found by any oth-er sound race ***,this constraint-based approach has serious limitations on helping programmers analyze and understand data ***,it may report a large number of false positives due to the unrecognized dataflow propa-gation of the ***,it recommends a wide range of thread context switches to schedule the reported race(in-cluding the false one)whenever this race is exposed during the constraint-solving *** ad hoc recommendation imposes too many context switches,which complicates the data race *** address these two limitations in the state-of-the-art constraint-based race detection,this paper proposes DFTracker,an improved constraint-based race detec-tor to recommend each data race with minimal thread context ***,we reduce the false positives by ana-lyzing and tracking the dataflow in the *** this means,DFTracker thus reduces the unnecessary analysis of false race *** further propose a novel algorithm to recommend an effective race schedule with minimal thread con-text switches for each data *** experimental results on the real applications demonstrate that 1)without removing any true data race,DFTracker effectively prunes false positives by 68%in comparison with the state-of-the-art constraint-based race detector;2)DFTracker recommends as low as 2.6-8.3(4.7 on average)thread context switches per data race in the real world,which is 81.6%fewer context switches per data race than the state-of-the-art constraint based race ***,DFTracker can be used as an effective tool to understand the data race for programmers.

关键词： data race satisfiability modulo theory multi-threaded program dynamic detection

来源：评论

学校读者我要写书评

暂无评论

Global Exponential Rendezvous Control of Nonholonomic Unicycle Vehicles with Directed Communication Topology

Global Exponential Rendezvous Control of Nonholonomic Unicyc...

引用

Chinese Intelligent Systems Conference, CISC 2020

作者： Zhao, Yixin Xing, Bin Huang, Wei Luo, Shiyu Li, Peng Xie, Wenjing The School of Computer and Information Science Southwest University Chongqing400715 China Chongqing Innovation Center of Industrial Big-Data Co. Ltd. National Engineering Laboratory for Industrial Big-Data Application Technology Chongqing400065 China

ISBN: (纸本)9789811584572

This paper studies the full-state rendezvous control problem of multiple nonholonomic unicycle systems. A distributed state feedback time-varying control law is derived by exploiting model transformation, input-output feedback linearization technology, linear cooperation control theory and graph theory. Based on the carefully constructed output-like variable, the input-output feedback linearization approach overcomes the underactuated control challenge, makes the choice of controller parameters independent of initial states of vehicles, and allows the linear control theory applicable, rather than using the Lyapunov method and hence requiring the information flow undirected. Stability analysis proves that all the unicycle vehicles globally exponentially converge to a common fixed location and orientation, provided that the communication topology is directed and having a spanning tree. A numerical simulation is implemented for five nonholonomic unicycle vehicles, demonstrating the effectiveness of the proposed control scheme. © 2021, The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd.

关键词： Vehicles

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：