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

Intent-Aware Graph-Level Embedding Learning Based Recommendation

Journal of computer science & technology 2024年第5期39卷 1138-1152页

作者： Peng-Yi Hao Si-Hao Liu Cong Bai College of Computer Science and Technology Zhejiang University of TechnologyHangzhou 310012China

Recommendation has been widely used in business scenarios to provide users with personalized and accurate item lists by efficiently analyzing complex user-item ***,existing recommendation methods have significant shortcomings in capturing the dynamic preference changes of users and discovering their true potential *** address these problems,a novel framework named Intent-Aware Graph-Level Embedding Learning(IaGEL)is proposed for *** this framework,the potential user interest is explored by capturing the co-occurrence of items in different periods,and then user interest is further improved based on an adaptive aggregation algorithm,forming generic intents and specific *** addition,for better representing the intents,graph-level embedding learning is designed based on the mutual information comparison among positive intents and negative ***,an intent-based recommendation strategy is designed to further mine the dynamic changes in user *** on three public and industrial datasets demonstrate the effectiveness of the proposed IaGEL in the task of recommendation.

关键词： recommendation system graph embedding learning graph neural network intent-aware

来源：评论

学校读者我要写书评

暂无评论

HTs-GCN: Identifying Hardware Trojan Nodes in Integrated Circuits Using a Graph Convolutional Network

引用

IEEE Transactions on computer-Aided Design of Integrated Circuits and Systems 2024年第6期44卷 2353-2366页

作者： Xiao, Jie Chai, Shuiliang Gao, Yanjiao Huang, Yuhao Zhang, Fan Chen, Tieming Zhejiang University of Technology College of Computer Science and Technology Hangzhou310000 China Zhejiang University College of Computer Science and Technology Hangzhou310058 China

Hardware Trojans (HTs) present significant security threats to integrated circuits. Detecting and locating HTs is crucial for mitigating these threats. Thus, this paper proposes a method called HTs-GCN, which utilizes a graph convolutional network (GCN) to identify HTs. First, it extracts two novel features of gate nodes using a depth-first search strategy and topological logical analysis to enrich the feature information of circuit nodes. Second, through a message-passing mechanism, it designs a local feature aggregation method based on the GCN and a global feature fusion method based on an attention mechanism to improve the representation capability of circuit node features. Then, leveraging the concept of stochastic gradient descent and incorporating mini-batch oversampling and under-sampling techniques, it employs a dataset imbalance handling method to address the scarcity of HT nodes in circuits. These approaches significantly enhance the distinguishability between gate nodes with HTs and other gate nodes while reducing computational complexity. Experimental results indicate that HTs-GCN outperforms the recently proposed NHTD-GL method in terms of recall: it achieves approximately 7.8 percentage points higher recall while maintaining similar accuracy. HTs-GCN demonstrates exceptional generalizability, with an average recall and accuracy of 93.0% and 100%, respectively, on infrequently used circuits in the Trust-Hub benchmark. In addition, on the TRIT-TC benchmark, HTs-GCN achieves excellent average true positive rate (TPR) and true negative rate (TNR) of 95.1% and 94.4%, respectively. Furthermore, HTs-GCN exhibits robust performance under gate modification attacks, with average TPR and TNR reaching 82.1% and 92.5%, respectively. © 1982-2012 IEEE.

关键词： Hardware security

来源：评论

学校读者我要写书评

暂无评论

Maximizing Overall Service Profit:Multi-Edge Service Pricing as a Stochastic Game Model

引用

Tsinghua science and technology 2024年第6期29卷 1872-1889页

作者： Shengye Pang Xinkui Zhao Jiayin Luo Jintao Chen Fan Wang Jianwei Yin College of Computer Science and Technology Zhejiang UniversityHangzhou 310058China School of Software Technology Zhejiang UniversityNingbo 315048China

The diversified development of the service ecosystem,particularly the rapid growth of services like cloud and edge computing,has propelled the flourishing expansion of the service trading ***,in the absence of appropriate pricing guidance,service providers often devise pricing strategies solely based on their own interests,potentially hindering the maximization of overall market *** challenge is even more severe in edge computing scenarios,as different edge service providers are dispersed across various regions and influenced by multiple factors,making it challenging to establish a unified pricing *** paper introduces a multi-participant stochastic game model to formalize the pricing problem of multiple edge ***,an incentive mechanism based on Pareto improvement is proposed to drive the game towards Pareto optimal direction,achieving optimal ***,an enhanced PSO algorithm was proposed by adaptively optimizing inertia factor across three *** optimization significantly improved the efficiency of solving the game model and analyzed equilibrium states under various evolutionary *** results demonstrate that the proposed pricing incentive mechanism promotes more effective and rational pricing allocations,while also demonstrating the effectiveness of our algorithm in resolving game problems.

关键词： service pricing game theory incentive mechanism Pareto improvement equilibrium solution

来源：评论

学校读者我要写书评

暂无评论

Labeling-based centrality approaches for identifying critical edges on temporal graphs

引用

Frontiers of computer science 2025年第2期19卷 89-104页

作者： Tianming ZHANG Jie ZHAO Cibo YU Lu CHEN Yunjun GAO Bin CAO Jing FAN Ge YU School of Computer Science and Technology Zhejiang University of TechnologyHangzhou 310023China School of Computer Science and Technology Zhejiang UniversityHangzhou 310013China Department of Computer Science Northeastern UniversityShenyang 110819China

Edge closeness and betweenness centralities are widely used path-based metrics for characterizing the importance of edges in *** general graphs,edge closeness centrality indicates the importance of edges by the shortest distances from the edge to all the other *** betweenness centrality ranks which edges are significant based on the fraction of all-pairs shortest paths that pass through the ***,extensive research efforts go into centrality computation over general graphs that omit time ***,numerous real-world networks are modeled as temporal graphs,where the nodes are related to each other at different time *** temporal property is important and should not be neglected because it guides the flow of information in the *** state of affairs motivates the paper’s study of edge centrality computation methods on temporal *** introduce the concepts of the label,and label dominance relation,and then propose multi-thread parallel labeling-based methods on OpenMP to efficiently compute edge closeness and betweenness centralities *** types of optimal temporal *** edge closeness centrality computation,a time segmentation strategy and two observations are presented to aggregate some related temporal edges for uniform *** edge betweenness centrality computation,to improve efficiency,temporal edge dependency formulas,a labeling-based forward-backward scanning strategy,and a compression-based optimization method are further proposed to iteratively accumulate centrality *** experiments using 13 real temporal graphs are conducted to provide detailed insights into the efficiency and effectiveness of the proposed *** with state-ofthe-art methods,labeling-based methods are capable of up to two orders of magnitude speedup.

关键词： temporal graph closeness centrality between-ness centrality temporal path

来源：评论

学校读者我要写书评

暂无评论

Chasing in virtual environment:Dynamic alignment for multi-user collaborative redirected walking

引用

虚拟现实与智能硬件(中英文) 2025年第1期7卷 26-46页

作者： Tianyang DONG Shuqian LV Hubin KONG Huanbo ZHANG College of Computer Science and Technology Zhejiang University of TechnologyHangzhou 310004China

Background The redirected walking(RDW)method for multi-user collaboration requires maintaining the relative position between users in a virtual environment(VE)and physical environment(PE).A chasing game in a VE is a typical virtual reality game that entails multi-user *** a user approaches and interacts with a target user in the VE,the user is expected to approach and interact with the target user in the corresponding PE as *** methods of multi-user RDW mainly focus on obstacle avoidance,which does not account for the relative positional relationship between the users in both VE and *** To enhance the user experience and facilitate potential interaction,this paper presents a novel dynamic alignment algorithm for multi-user collaborative redirected walking(DA-RDW)in a shared PE where the target user and other users are *** algorithm adopts improved artificial potential fields,where the repulsive force is a function of the relative position and velocity of the user with respect to dynamic *** the best alignment,this algorithm sets the alignment-guidance force in several cases and then converts it into a constrained optimization problem to obtain the optimal ***,this algorithm introduces a potential interaction object selection strategy for a dynamically uncertain environment to speed up the subsequent *** balance obstacle avoidance and alignment,this algorithm uses the dynamic weightings of the virtual and physical distances between users and the target to determine the resultant force *** The efficacy of the proposed method was evaluated using a series of simulations and live-user *** experimental results demonstrate that our novel dynamic alignment method for multi-user collaborative redirected walking can reduce the distance error in both VE and PE to improve alignment with fewer collisions.

关键词： Virtual reality Multi-user redirected walking User collisions Dynamic alignment

来源：评论

学校读者我要写书评

暂无评论

NeOR: neural exploration with feature-based visual odometry and tracking-failure-reduction policy

引用

Optoelectronics Letters 2025年第5期21卷 290-297页

作者： ZHU Ziheng LIU Jialing CHEN Kaiqi TONG Qiyi LIU Ruyu College of Computer Science and Technology College of Software Zhejiang University of Technology School of Information Science and Technology Hangzhou Normal University

Embodied visual exploration is critical for building intelligent visual agents. This paper presents the neural exploration with feature-based visual odometry and tracking-failure-reduction policy(Ne OR), a framework for embodied visual exploration that possesses the efficient exploration capabilities of deep reinforcement learning(DRL)-based exploration policies and leverages feature-based visual odometry(VO) for more accurate mapping and positioning results. An improved local policy is also proposed to reduce tracking failures of feature-based VO in weakly textured scenes through a refined multi-discrete action space, keyframe fusion, and an auxiliary task. The experimental results demonstrate that Ne OR has better mapping and positioning accuracy compared to other entirely learning-based exploration frameworks and improves the robustness of feature-based VO by significantly reducing tracking failures in weakly textured scenes.

关键词： A

来源：评论

学校读者我要写书评

暂无评论

SpikingMiniLM: energy-efficient spiking transformer for natural language understanding

引用

science China(Information sciences) 2024年第10期67卷 115-128页

作者： Jiayu ZHANG Jiangrong SHEN Zeke WANG Qinghai GUO Rui YAN Gang PAN Huajin TANG College of Computer Science and Technology Zhejiang University The State Key Lab of Brain-Machine Intelligence Zhejiang University Collaborative Innovation Center of Artificial Intelligence Zhejiang University Advanced Computing and Storage Laboratory Huawei Technologies Co. Ltd. College of Computer Science and Technology Zhejiang University of Technology MOE Frontier Science Center for Brain Science and Brain-Machine Integration Zhejiang University

In the era of large-scale pretrained models, artificial neural networks（ANNs） have excelled in natural language understanding（NLU） tasks. However, their success often necessitates substantial computational resources and energy consumption. To address this, we explore the potential of spiking neural networks（SNNs） in NLU——a promising avenue with demonstrated advantages, including reduced power consumption and improved efficiency due to their event-driven characteristics. We propose the SpikingMiniLM,a novel spiking Transformer model tailored for natural language understanding. We first introduce a multi-step encoding method to convert text embeddings into spike trains. Subsequently, we redesign the attention mechanism and residual connections to make our model operate on the pure spike-based paradigm without any normalization technique. To facilitate stable and fast convergence, we propose a general parameter initialization method grounded in the stable firing rate principle. Furthermore, we apply an ANN-to-SNN knowledge distillation to overcome the challenges of pretraining SNNs. Our approach achieves a macro-average score of 75.5 on the dev sets of the GLUE benchmark, retaining 98% of the performance exhibited by the teacher model MiniLMv2. Our smaller model also achieves similar performance to BERTMINIwith fewer parameters and much lower energy consumption, underscoring its competitiveness and resource efficiency in NLU tasks.

关键词： spiking neural networks natural language understanding spiking Transformer spike-based attention multi-step encoding ANN-to-SNN distillation

来源：评论

学校读者我要写书评

暂无评论

Spatio-Temporal Learning for Route-Based Travel Time Estimation

引用

Journal of computer science & technology 2024年第5期39卷 1107-1122页

作者： Zi-Quan Fang Qi-Chen Sun Lu Chen Dan-Lei Hu Yun-Jun Gao School of Software Technology Zhejiang UniversityNingbo 315048China College of Computer Science Zhejiang UniversityHangzhou 310027China

Travel time estimation(TTE)is a fundamental task to build intelligent transportation ***,most existing TTE solutions design models upon simple homogeneous graphs and ignore the heterogeneity of traffic networks,where,e.g.,main roads typically contribute differently from side *** terms of spatial dimension,few studies consider the dynamic spatial correlations across road segments,e.g.,the traffic speed/volume on road segment A may correlate with the traffic speed/volume on road segment B,where A and B could be adjacent or non-adjacent,and such correlations may vary across *** terms of temporal dimension,even fewer studies consider the dynamic temporal dependences,where,e.g.,the historical states of road A may directly correlate with the recent state of A,and may also indirectly correlate with the recent state of road *** track all aforementioned issues of existing TTE approaches,we provide HDTTE,a solution that employs heterogeneous and dynamic spatio-temporal predictive ***,we first design a general multi-relational graph constructor that extracts hidden heterogeneous information of road segments,where we model road segments as nodes and model correlations as edges in the multi-relational ***,we propose a dynamic graph attention convolution module that aggregates dynamic spatial dependence of neighbor roads to focal *** also present a novel correlation-augmented temporal convolution module to capture the influence of states at past time steps on current traffic ***,in view of the periodic dependence of traffic,we develop a multi-scale adaptive fusion layer to enable HDTTE to exploit periodic patterns from recent,daily,and weekly traffic *** experimental study using real-life highway and urban datasets demonstrates the validity of the approach and its advantage over others.

关键词： heterogeneous traffic modeling spatio-temporal learning travel time estimation traffic speed prediction

来源：评论

学校读者我要写书评

暂无评论

Spatial-Temporal Masked Autoencoder for Multi-Device Wearable Human Activity Recognition

引用

Proceedings of the ACM on Interactive, Mobile, Wearable and Ubiquitous Technologies 2024年第4期7卷 1-25页

作者： Miao, Shenghuan Chen, Ling Hu, Rong College of Computer Science and Technology Zhejiang University Hangzhou China

The widespread adoption of wearable devices has led to a surge in the development of multi-device wearable human activity recognition (WHAR) systems. Nevertheless, the performance of traditional supervised learning-based methods to WHAR is limited by the challenge of collecting ample annotated wearable data. To overcome this limitation, self-supervised learning (SSL) has emerged as a promising solution by first training a competent feature extractor on a substantial quantity of unlabeled data, followed by refining a minimal classifier with a small amount of labeled data. Despite the promise of SSL in WHAR, the majority of studies have not considered missing device scenarios in multi-device WHAR. To bridge this gap, we propose a multi-device SSL WHAR method termed Spatial-Temporal Masked Autoencoder (STMAE). STMAE captures discriminative activity representations by utilizing the asymmetrical encoder-decoder structure and two-stage spatial-temporal masking strategy, which can exploit the spatial-temporal correlations in multi-device data to improve the performance of SSL WHAR, especially on missing device scenarios. Experiments on four real-world datasets demonstrate the efficacy of STMAE in various practical scenarios. © 2024 ACM.

关键词： Wearable sensors

来源：评论

学校读者我要写书评

暂无评论

PerFedKG: two-stage information-loop federated knowledge graph for personalized privacy-preserving recommendation systems

引用

science China(Information sciences) 2025年第4期68卷 98-99页

作者： Fan WANG Xuyun ZHANG Weiming LIU Li LI Yuwen LIU Zhongyuan ZHANG Guanfeng LIU Shengye PANG Xiaolong XU Lianyong QI College of Computer Science and Technology Zhejiang University Department of Computing Macquarie University College of Computer Science and Technology China University of Petroleum (East China) School of Software Nanjing University of Information Science and Technology

Knowledge graphs(KGs) effectively mitigate data sparsity in recommendation systems(RSs) by providing valuable auxiliary information [1]. However, traditional centralized KG-based RSs increase the risk of user privacy *** learning(FL) enhances RS's privacy by enabling model training on decentralized data [2]. Although integrating KG and FL can address both data sparsity and privacy issues in RSs [3], several challenges persist. CH1,Each client's local model relies on a consistent global model from the server, limiting personalized deployment to endusers.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：