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

Inductive Relation Prediction by Disentangled Subgraph Structure

Tsinghua science and Technology 2024年第5期29卷 1566-1579页

作者： Guiduo Duan Rui Guo Wenlong Luo Guangchun Luo Tianxi Huang Laboratory of Intelligent Collaborative Computing University of Electronic Science and Technology of ChinaChengdu 611731Chinaand also with Trusted Cloud Computing and Big Data Key Laboratory of Sichuan ProvinceChengdu 611731China School of Computer Science and Engineering University of Electronic Science and Technology of ChinaChengdu 611731China Hangzhou NetEase Cloud Music Technology Co. Ltd.Hangzhou 310052China Department of Fundamental Courses Chengdu Textile CollegeChengdu 611700China

Currently,most existing inductive relation prediction approaches are based on subgraph structures,with subgraph features extracted using graph neural networks to predict ***,subgraphs may contain disconnected regions,which usually represent different semantic *** not all semantic information about the regions is helpful in relation prediction,we propose a relation prediction model based on a disentangled subgraph structure and implement a feature updating approach based on relevant semantic *** indirectly achieve the disentangled subgraph structure from a semantic perspective,the mapping of entity features into different semantic spaces and the aggregation of related semantics on each semantic space are *** disentangled model can focus on features having higher semantic relevance in the prediction,thus addressing a problem with existing approaches,which ignore the semantic differences in different subgraph ***,using a gated recurrent neural network,this model enhances the features of entities by sorting them by distance and extracting the path information in the ***,it is shown that when there are numerous disconnected regions in the subgraph,our model outperforms existing mainstream models in terms of both Area Under the Curve-Precision-Recall(AUC-PR)and Hits@*** prove that semantic differences in the knowledge graph can be effectively distinguished and verify the effectiveness of this method.

关键词： disentangled subgraph structure knowledge graph completion Gated Recurrent Unit(GRU) feature updating

来源：评论

学校读者我要写书评

暂无评论

Power Optimization for Low Transmission Delay in Software Defined data Center Networks

引用

IEEE Transactions on Mobile computing 2025年第7期24卷 5716-5730页

作者： Zhao, Yong Cao, Jiannong Wang, Xingwei Li, Fuliang He, Qiang Liu, Xiaojie University of Electronic Science and Technology of China Trusted Cloud Computing and Big Data Key Laboratory of Sichuan Province Laboratory of Intelligent Collaborative Computing Chengdu611731 China Hong Kong Polytechnic University Department of Computing Hung Hom Hong Kong Northeastern University College of Computer Science and Engineering Shenyang110819 China Northeastern University College of Medicine and Biological Information Engineering Shenyang110819 China Pengcheng Laboratory Shenzhen518066 China

Software-Defined data Center Networks (SDDCNs) utilizes Software Defined Networking (SDN) as a network architecture to achieve highly flexible, programmable, and automated management of data Center Networks (DCNs). The high energy consumption of DCNs remains a persistent and significant challenge. Thus, the energy saving is crucial and imperative for DCNs. Current energy-efficient solutions primarily rely on flow consolidation and dynamic device sleeping techniques to reduce energy consumption. However, these approaches often yield long Flow Completion Time (FCT), potentially resulting in violations of service-level agreements, particularly for delay-sensitive applications. In this paper, we formulate the problem of minimizing the power consumption in SDDCNs as key objective while ensuring timely FCT for delay-sensitive applications. To solve this problem, we first introduce the Active Network Generation (ANG) approach, which generates a minimal active subnet with the least number of active devices while meeting the current traffic demand. Subsequently, we propose two algorithms based on the type of applications: the Delay-Tolerant Flow Route (DTFR) algorithm for delay-tolerant applications and the Delay-Sensitive Flow Route (DSFR) algorithm for delay-sensitive applications. Simulation results demonstrate that our propose solution achieves an energy-saving rate of up to 67.77% and significantly reduces FCT compared to benchmark solutions. © 2002-2012 IEEE.

关键词： Energy efficiency

来源：评论

学校读者我要写书评

暂无评论

A numerical magnitude aware multi-channel hierarchical encoding network for math word problem solving

引用

Neural computing and Applications 2025年第3期37卷 1651-1672页

作者： Xu, Junjie Chen, Yuzhong Xiao, Lingsheng Liao, Hongmiao Zhong, Jiayuan Dong, Chen College of Computer and Data Science Fuzhou University Fujian Province Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou China Fujian Provincial Key Laboratory of Network Computing and Intelligent Information Processing Fujian Province Fuzhou350108 China

Math word problem (MWP) represents a critical research area within reading comprehension, where accurate comprehension of math problem text is crucial for generating math expressions. However, current approaches still grapple with unresolved challenges in grasping the sensitivity of math problem text and delineating distinct roles across various clause types, and enhancing numerical representation. To address these challenges, this paper proposes a Numerical Magnitude Aware Multi-Channel Hierarchical Encoding Network (NMA-MHEA) for math expression generation. Firstly, NMA-MHEA implements a multi-channel hierarchical context encoding module to learn context representations at three different channels: intra-clause channel, inter-clause channel, and context-question interaction channel. NMA-MHEA constructs hierarchical constituent-dependency graphs for different levels of sentences and employs a Hierarchical Graph Attention Neural Network (HGAT) to learn syntactic and semantic information within these graphs at the intra-clause and inter-clause channels. NMA-MHEA then refines context clauses using question information at the context-question interaction channel. Secondly, NMA-MHEA designs a number encoding module to enhance the relative magnitude information among numerical values and type information of numerical values. Experimental results on two public benchmark datasets demonstrate that NMA-MHEA outperforms other state-of-the-art models. © The Author(s), under exclusive licence to Springer-Verlag London Ltd., part of Springer Nature 2024.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

OSFS-Vague: Online streaming feature selection algorithm based on vague set

引用

CAAI Transactions on Intelligence Technology 2024年第6期9卷 1451-1466页

作者： Jie Yang Zhijun Wang Guoyin Wang Yanmin Liu Yi He Di Wu School of Physics and Electronic Science Zunyi Normal UniversityZunyiChina Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqingChina Department of Computer Science Old Dominion UniversityNorfolkVirginiaUSA College of Computer and Information Science Southwest UniversityChongqingChina

Online streaming feature selection(OSFS),as an online learning manner to handle streaming features,is critical in addressing high-dimensional *** real big data-related applications,the patterns and distributions of streaming features constantly change over time due to dynamic data generation ***,existing OSFS methods rely on presented and fixed hyperparameters,which undoubtedly lead to poor selection performance when encountering dynamic *** make up for the existing shortcomings,the authors propose a novel OSFS algorithm based on vague set,named *** main idea is to combine uncertainty and three-way decision theories to improve feature selection from the traditional dichotomous method to the trichotomous ***-Vague also improves the calculation method of correlation between features and ***,OSFS-Vague uses the distance correlation coefficient to classify streaming features into relevant features,weakly redundant features,and redundant ***,the relevant features and weakly redundant features are filtered for an optimal feature *** evaluate the proposed OSFS-Vague,extensive empirical experiments have been conducted on 11 *** results demonstrate that OSFS-Vague outperforms six state-of-the-art OSFS algorithms in terms of selection accuracy and computational efficiency.

关键词： feature selection online feature selection three-way decision vague set

来源：评论

学校读者我要写书评

暂无评论

ProgMate: An intelligent Programming Assistant Based on LLM 54

ProgMate: An Intelligent Programming Assistant Based on LLM

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Li, Ying Yang, Runze Zhang, Xiantao Shi, Peng Yang, Da Huang, Xuefei School of Computer Science and Engineering Beihang University Beijing China International Innovation Institute Beihang University Key Laboratory of Data Science and Intelligent Computing Hangzhou China

ISBN: (纸本)9798350351507

This study addresses the challenges faced in personalized tutoring within large-scale programming courses, such as significant ability gaps among students, limited available resources, among others. For these reasons, we proposed an intelligent programming assistant, ProgMate, based on large language models (LLMs). Benefitting from the robust understanding and learning capabilities of LLM, ProgMate not only comprehensively monitors the learning process, but can also surpass human teaching in aspects such as intelligent assignment grading, identification of knowledge gaps, and assessment of learning abilities. ProgMate embodies a new 4-A digital teaching paradigm, characterized by its ability to provide precise guidance with anything, to anyone, anywhere, at any time, with features like 'omnipresence', 'adaptive guidance' and 'customization'. It facilitates the organic integration of collective teaching and individualized guidance, continuous learning, and long-term development, as well as resource efficiency and precision nurturing, offering a viable path and empirical support for the digital transformation of future education. © 2024 IEEE.

关键词： Knowledge graph

来源：评论

学校读者我要写书评

暂无评论

Visualizing Program Behavior: A Study of Enhanced Program Diagrams Using LLM 54

Visualizing Program Behavior: A Study of Enhanced Program Di...

引用

54th IEEE Frontiers in Education Conference, FIE 2024

作者： Li, Ying Yang, Runze Gui, ShiJie Shi, Peng Huang, Xuefei Yang, Da Zhang, Xiaozhou Gai, Yiming School of Computer Science and Engineering Beihang University Beijing China International Innovation Institute Beihang University Key Laboratory of Data Science and Intelligent Computing Hangzhou China

ISBN: (纸本)9798350351507

This paper aims to address the difficulties faced by novice programmers in grasping code structure and execution flow, improving programming thinking, and pinpointing code errors with accuracy. It proposes providing students with program behavior diagrams based on large language models (LLMs) and visualization techniques to achieve personalized guidance. Specifically, these program behavior diagrams include programming thinking visualization diagrams and code vulnerability visualization diagrams. A programming thinking visualization diagram employs static code analysis to gather code structure information, combined with the structured chain-of-thought method to collectively optimize the LLM. This enables the LLM to explain each interpretable part of the code from top to bottom, detailing the programming concepts, and displaying them on a modularized code structure diagram. The code vulnerability visualization diagram primarily utilizes the fine-tuned LLM, optimizing it based on program analysis and clustering analysis methods to accurately identify vulnerabilities in student code and display them on a code flow diagram. Its feature is to visually display to students the error location, error information, and the impact of errors on program flow, rather than providing the programming answers. Lastly, through experiments and statistical analysis of actual teaching data, this paper serves a demonstration that the enhanced models used in the visualization diagram generation process have a noticeable effect on mainstream LLMs, and that visualization diagrams hold significant value for students at different stages of learning. © 2024 IEEE.

关键词： Students

来源：评论

学校读者我要写书评

暂无评论

An Evolutionary Multitasking Algorithm for Efficient Multiobjective Recommendations

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2025年第3期6卷 518-532页

作者： Tian, Ye Ji, Luke Hu, Yiwei Ma, Haiping Wu, Le Zhang, Xingyi Anhui University Key Laboratory of Intelligent Computing and Signal Processing of Ministry of Education School of Computer Science and Technology Hefei230601 China Anhui University Institutes of Physical Science and Information Technology Hefei230601 China Hefei University of Technology Key Laboratory of Knowledge Engineering with Big Data Hefei230029 China

Represented by evolutionary algorithms and swarm intelligence algorithms, nature-inspired metaheuristics have been successfully applied to recommender systems and amply demonstrated effectiveness, in particular, for multiobjective recommendation. Owing to the population-based search paradigm, these algorithms can produce a number of recommendation lists, making diverse tradeoffs between multiple metrics and meeting the requirements of accuracy, novelty, diversity, and other user preferences. However, these algorithms are criticized for the low efficiency of the optimization process, especially when the number of users is large. To address this issue, this article proposes an evolutionary multitasking-based recommendation method, where each task corresponds to a user and all the tasks are optimized simultaneously, thus highly improving the efficiency of recommendation. To enhance the convergence speed, all the users are divided into multiple populations according to the similarity between their preferences, where each population evolves with internal knowledge transfer between users, and all the populations evolve with external knowledge transfer between populations. Experimental results on various datasets verify that the proposed method can better balance between multiple metrics than classical and deep neural network-based recommendation methods and exhibits significantly higher efficiency than evolutionary multiobjective optimization-based recommendation methods. © 2024 IEEE. All rights reserved.

关键词： Multiobjective optimization

来源：评论

学校读者我要写书评

暂无评论

Network link weight optimization based on antisymmetric deep graph networks and reinforcement learning 6

Network link weight optimization based on antisymmetric deep...

引用

6th International Conference on Next Generation data-Driven Networks, NGDN 2024

作者： Chen, Yuhan Guo, Yingya Department of Computer and Data Science Fuzhou University Fuzhou China Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou China

ISBN: (纸本)9798350388374

Route optimization is a key core technology to optimize network traffic distribution, achieve network load balancing, and improve network performance. Traditional distributed networks widely run shortest-path based routing protocols, and the path of traffic is determined by the link weights of the distributed network, so routing optimization methods are usually optimized around the link weights of the network. Heuristics-based link weight optimization methods are widely used. However, heuristic methods rely on manually set rules, which are poorly generalized and cannot adapt well to dynamically changing traffic demands. Compared to heuristics, deep reinforcement learning (DRL) has the advantage of extracting more accurate feature representations in addition to its ability to handle high-dimensional state and action spaces. We propose a network link weight optimization method based on anti-symmetric deep graph networks (A-DGN) and reinforcement learning using a novel GNN framework anti-symmetric deep graph networks, where link weights are adjusted to reduce the network link utilization with the optimization objective of minimizing the maximum link utilization in the network. Experimental results show that the proposed method achieves significant performance improvements in the link weight optimization problem in four real-world network topology scenarios. © 2024 IEEE.

关键词： Deep reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Machine learning empowered UAV-based beamforming design in ISAC systems

引用

science China(Information sciences) 2025年第5期68卷 285-286页

作者： Xiangyang DUAN Xiaoqi ZHANG Shuqiang XIA Zhongbin WANG Yihua MA Weijie YUAN State Key Laboratory of Mobile Network and Mobile Multimedia Technology Wireless and Computing Research InstituteZTE Corporation School of Electrical and Data Engineering University of Technology Sydney School of Automation and Intelligent Manufacturing Southern University of Science and Technology

Integrated sensing and communication (ISAC) has been proposed as an enabling technology for the realization of the next-generation wireless system,which focuses on performing wireless communication and sensing *** the various potential ISAC-based applications,unmanned aerial vehicle (UAV)-based ISAC plays a significant part in unlocking the potential of future next-generation wireless communication,facilitating low-latency data transmission in high-mobility *** by recent advancements,a variety of effective techniques have been investigated to optimize beamforming design in ISAC *** instance,the authors in [1] introduced an extended Kalman filtering (EKF)-based method tailored for millimeter wave (mmWave) ISAC ***,Ref.[2]proposed an extended interacting multiple model (IMM)-EKF framework designed for vehicular networks with intricate roadway *** these advancements,the aforementioned methods typically employ a separate scheme for channel prediction and beam alignment,which introduces additional signaling overhead in real-world ***,there is a demand for an end-to-end beamforming design approach specifically for UAV-based ISAC systems.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A survey for light field super-resolution

引用

High-Confidence computing 2024年第1期4卷 118-129页

作者： Mingyuan Zhao Hao Sheng Da Yang Sizhe Wang Ruixuan Cong Zhenglong Cui Rongshan Chen Tun Wang Shuai Wang Yang Huang Jiahao Shen State Key Laboratory of Virtual Reality Technology and Systems School of Computer Science and EngineeringBeihang UniversityBeijing 100191China Key Laboratory of Data Science and Intelligent Computing International Innovation InstituteBeihang UniversityHangzhou 311115China State Key Laboratory of Software Development Environment School of Computer Science and EngineeringBeihang UniversityBeijing 100191China

Compared to 2D imaging data,the 4D light field(LF)data retains richer scene’s structure information,which can significantly improve the computer’s perception capability,including depth estimation,semantic segmentation,and LF ***,there is a contradiction between spatial and angular resolution during the LF image acquisition *** overcome the above problem,researchers have gradually focused on the light field super-resolution(LFSR).In the traditional solutions,researchers achieved the LFSR based on various optimization frameworks,such as Bayesian and Gaussian *** learning-based methods are more popular than conventional methods because they have better performance and more robust generalization *** this paper,the present approach can mainly divided into conventional methods and deep learning-based *** discuss these two branches in light field spatial super-resolution(LFSSR),light field angular super-resolution(LFASR),and light field spatial and angular super-resolution(LFSASR),***,this paper also introduces the primary public datasets and analyzes the performance of the prevalent approaches on these ***,we discuss the potential innovations of the LFSR to propose the progress of our research field.

关键词： Light field super-resolution Convolutional neural network Transformer Sub-aperture image Epipolar-plane image

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：