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

44th ACM/IEEE International Conference on Software engineering, ICSE 2024

作者： Feng, Siyue Suo, Wenqi Wu, Yueming Zou, Deqing Liu, Yang Jin, Hai Huazhong University of Science and Technology China Nanyang Technological University Singapore Hubei Engineering Research Center on Big Data Security Cluster and Grid Computing Lab National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab Hubei Key Laboratory of Distributed System Security China Jinyinhu Laboratory Wuhan430074 China School of Cyber Science and Engineering Hust Wuhan430074 China School of Computer Science and Technology Hust Wuhan430074 China

ISBN: (纸本)9798400702174

As software engineering advances and the code demand rises, the prevalence of code clones has increased. This phenomenon poses risks like vulnerability propagation, underscoring the growing importance of code clone detection techniques. While numerous code clone detection methods have been proposed, they often fall short in real-world code environments. They either struggle to identify code clones effectively or demand substantial time and computational resources to handle complex clones. This paper introduces a code clone detection method namely Toma using tokens and machine learning. Specifically, we extract token type sequences and employ six similarity calculation methods to generate feature vectors. These vectors are then input into a trained machine learning model for classification. To evaluate the effectiveness and scalability of Toma, we conduct experiments on the widely used bigCloneBench dataset. Results show that our tool outperforms token-based code clone detectors and most tree-based clone detectors, demonstrating high effectiveness and significant time savings. © 2024 ACM.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

On the Security of Smart Home systems:A Survey

引用

Journal of Computer Science & technology 2023年第2期38卷 228-247页

作者：袁斌万俊吴宇晗邹德清金海 School of Cyber Science and Engineering Huazhong University of Science and TechnologyWuhan 430074China Hubei Key Laboratory of Distributed System Security Huazhong University of Science and Technology Wuhan 430074China Hubei Engineering Research Center on Big Data Security Huazhong University of Science and Technology Wuhan 430074China National Engineering Research Center for Big Data Technology and System Huazhong University of Science and TechnologyWuhan 430074China Services Computing Technology and System Lab Huazhong University of Science and TechnologyWuhan 430074China Shenzhen Huazhong University of Science and Technology Research Institute Shenzhen 518057China School of Computer Science and Technology Huazhong University of Science and TechnologyWuhan 430074China Cluster and Grid Computing Lab Huazhong University of Science and TechnologyWuhan 430074China

Among the plethora of IoT(Internet of Things)applications,the smart home is one of the ***,the rapid development of the smart home has also made smart home systems a target for ***,researchers have made many efforts to investigate and enhance the security of smart home *** a more secure smart home ecosystem,we present a detailed literature review on the security of smart home ***,we categorize smart home systems’security issues into the platform,device,and communication *** exploring the research and specific issues in each of these security areas,we summarize the root causes of the security flaws in today's smart home systems,which include the heterogeneity of internal components of the systems,vendors'customization,the lack of clear responsibility boundaries and the absence of standard security ***,to better understand the security of smart home systems and potentially provide better protection for smart home systems,we propose research directions,including automated vulnerability mining,vigorous security checking,and data-driven security analysis.

关键词： IoT(Internet of Things) smart home IoT security smart home security

来源：评论

学校读者我要写书评

暂无评论

Fast Parallel Recovery for Transactional Stream Processing on Multicores 40

Fast Parallel Recovery for Transactional Stream Processing o...

引用

40th IEEE International Conference on data engineering, ICDE 2024

作者： Zhao, Jianjun Liu, Haikun Zhang, Shuhao Duan, Zhuohui Liao, Xiaofei Jin, Hai Zhang, Yu School of Computer Science and Technology 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 Wuhan China School of Computer Science and Engineering Nanyang Technological University Singapore

ISBN: (纸本)9798350317152

Transactional stream processing engines (TSPEs) have gained increasing attention due to their capability of processing real-time stream applications with transactional semantics. However, TSPEs remain susceptible to system failures and power outages. Existing TSPEs mainly focus on performance improvement, but still face a significant challenge to guarantee fault tolerance while offering high-performance services. We revisit commonly-used fault tolerance approaches in stream processing and database systems, and find that these approaches do not work well on TSPEs due to complex data dependencies. In this paper, we propose a novel TSPE called MorphStreamR to achieve fast failure recovery while guaranteeing low performance overhead at runtime. The key idea of MorphStreamR is to record intermediate results of resolved dependencies at runtime, and thus eliminate data dependencies to improve task parallelism during failure recovery. MorphStreamR further mitigates the runtime overhead by selectively tracking data dependencies and incorporating workload-aware log commitment. Experimental results show that MorphStreamR can significantly reduce the recovery time by up to 3.1 x while experiencing much less performance slowdown at runtime, compared with other applicable fault tolerance approaches. © 2024 IEEE.

关键词： Fault tolerance

来源：评论

学校读者我要写书评

暂无评论

Evolutionary Multiobjective Feature Selection Assisted by Unselected Features 13

Evolutionary Multiobjective Feature Selection Assisted by Un...

引用

13th IEEE Congress on Evolutionary Computation, CEC 2024

作者： Duan, Xuan Liu, Songbai Ji, Junkai Li, Lingjie Lin, Qiuzhen Tan, Kay Chen College of Computer Science and Software Engineering Shenzhen University Shenzhen China Shenzhen University National Engineering Laboratory for Big Data System Computing Technology Shenzhen China Shenzhen China The Hong Kong Polytechnic University Department of Computing Hong Kong

ISBN: (纸本)9798350308365

To enhance the generalization of multi-objective feature selection (MOFS) in classification, this paper proposes an evolutionary multitasking algorithm, diverging from previous approaches that exclusively target selected features. The algorithm integrates information from both selected and unselected features, introducing a novel objective to minimize the accuracy of unselected features. This objective, combined with the goal of minimizing classification errors for selected features, forms an auxiliary MOFS task. The paper presents a dual-population evolutionary multitasking framework that synergizes the main MOFS task with the auxiliary task. A knowledge transfer mechanism, based on accuracy preferences, seamlessly shares insights from the auxiliary to the main task, aiming to identify improved Pareto feature subsets. Empirical results demonstrate the superior performance of several state-of-the-art multi-objective algorithms within this framework, highlighting significant improvements across diverse datasets. © 2024 IEEE.

关键词： Feature Selection

来源：评论

学校读者我要写书评

暂无评论

FedRKG: A Privacy-Preserving Federated Recommendation Framework via Knowledge Graph Enhancement 18th

FedRKG: A Privacy-Preserving Federated Recommendation Framew...

引用

18th International Conference on Green, Pervasive, and Cloud computing, GPC 2023

作者： Yao, Dezhong Liu, Tongtong Cao, Qi Jin, Hai 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 School of Computing Science University of Glasgow Glasgow United Kingdom

ISBN: (纸本)9789819998951

Federated Learning (FL) has emerged as a promising approach for preserving data privacy in recommendation systems by training models locally. Recently, Graph Neural Networks (GNN) have gained popularity in recommendation tasks due to their ability to capture high-order interactions between users and items. However, privacy concerns prevent the global sharing of the entire user-item graph. To address this limitation, some methods create pseudo-interacted items or users in the graph to compensate for missing information for each client. Unfortunately, these methods introduce random noise and raise privacy concerns. In this paper, we propose FedRKG, a novel federated recommendation system, where a global knowledge graph (KG) is constructed and maintained on the server using publicly available item information, enabling higher-order user-item interactions. On the client side, a relation-aware GNN model leverages diverse KG relationships. To protect local interaction items and obscure gradients, we employ pseudo-labeling and Local Differential Privacy (LDP). Extensive experiments conducted on three real-world datasets demonstrate the competitive performance of our approach compared to centralized algorithms while ensuring privacy preservation. Moreover, FedRKG achieves an average accuracy improvement of 4% compared to existing federated learning baselines. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd 2024.

关键词： Recommender systems

来源：评论

学校读者我要写书评

暂无评论

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchronous Graph Neural Network 24

CDA-GNN: A Chain-driven Accelerator for Efficient Asynchrono...

引用

61st ACM/IEEE Design Automation Conference, DAC 2024

作者： Yu, Hui Zhang, Yu He, Ligang He, Donghao Li, Qikun Zhao, Jin Liao, Xiaofei Jin, Hai Gu, Lin Liu, Haikun 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 Department of Computer Science University of Warwick United Kingdom

ISBN: (纸本)9798400706011

Asynchronous Graph Neural Network (AGNN) has attracted much research attention because it enables faster convergence speed than the synchronous GNN. However, existing software/hardware solutions suffer from redundant computation overhead and excessive off-chip communications for AGNN due to irregular state propagations along the dependency chains between vertices. This paper proposes a chain-driven asynchronous accelerator, CDA-GNN, for efficient AGNN inference. Specifically, CDA-GNN proposes a chain-driven asynchronous execution approach into novel accelerator design to regularize the vertex state propagations for fewer redundant computations and off-chip communications and also designs a chain-aware data caching method to improve data locality for AGNN. We have implemented and evaluated CDA-GNN on a Xilinx Alveo U280 FPGA card. Compared with the cutting-edge software solutions (i.e., Dorylus and AMP) and hardware solutions (i.e., BlockGNN and FlowGNN), CDA-GNN improves the performance of AGNN inference by an average of 1,173x, 182.4x, 10.2x, and 7.9x and saves energy by 2,241x, 242.2x, 12.4x, and 8.9x, respectively. © 2024 Copyright is held by the owner/author(s). Publication rights licensed to ACM.

关键词： Graph neural networks

来源：评论

学校读者我要写书评

暂无评论

Adaptive Evolutionary Reinforcement Learning Algorithm with Early Termination Strategy 23

Adaptive Evolutionary Reinforcement Learning Algorithm with ...

引用

23rd International Conference on Autonomous Agents and Multiagent systems, AAMAS 2024

作者： Wu, Xiaoqiang Zhu, Qingling Lin, Qiuzhen Chen, Weineng Li, Jianqiang College of Computer Science and Software Engineering Shenzhen University Shenzhen China National Engineering Laboratory for Big Data System Computing Technology Shenzhen University Shenzhen China School of Computer Science and Engineering South China University of Technology Guangzhou China

Evolutionary reinforcement learning algorithms (ERLs), which combine evolutionary algorithms (EAs) with reinforcement learning (RL), have demonstrated significant success in enhancing RL performance. However, most ERLs rely heavily on Gaussian mutation operators to generate new individuals. When the standard deviation is too large or small, this approach will result in the production of poor or highly similar offspring. Such outcomes can be detrimental to the learning process of the RL agent, as too many poor or similar experiences are generated by these individuals. In order to alleviate these issues, this paper proposes an Adaptive Evolutionary Reinforcement Learning (AERL) method that adaptively adjusts both the standard deviation and the evaluation process. By tracking the performance of new individuals, AERL maintains the mutation strength within a suitable range without the need for additional gradient computations. Moreover, the proposed AERL approach early terminates unnecessary evaluations and discards experiences arising from poor individuals, thereby resulting in enhanced learning efficiency. Empirical assessments conducted on a variety of continuous control problems demonstrate the effectiveness of the AERL method. © 2024 International Foundation for Autonomous Agents and Multiagent systems.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

TransRec++:Translation-based sequential recommendation with heterogeneous feedback

引用

Frontiers of Computer Science 2022年第2期16卷 190-192页

作者： Zhuo-Xin ZHAN Ming-Kai HE Wei-Ke PAN Zhong MING National Engineering Laboratory for Big Data System Computing Technology Shenzhen UniversityShenzhen 518060China College of Computer Science and Software Engineering Shenzhen UniversityShenzhen 518060China

1 Introduction Nowadays,recommender systems are widely used because of the information overload problem on the *** are a variety of feedback in recommender systems,such as explicit feedback,implicit feedback,sequential feedback,*** them,modeling of heterogeneous sequential feedback,which contains not only different types of feedback such as examinations and purchases but also the sequential information,is an emerging and important problem receiving more and more *** sequential feedback is relatively easy to be collected in a deployed system and is also able to provide more information than the homogeneous feedback,which is thus expected to be helpful in improving the recommendation accuracy.

关键词： feedback recommendation sequential

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：