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

Simple and Efficient Knowledge Graph Attention Network for Recommendation

学校读者我要写书评

暂无评论

Simple and Efficient Knowledge Graph Attention Network for R...

Cyber-Physical Social Intelligence (ICCSI), International Conference on

作者： Yangding Li Shaobin Fu Hao Feng Yangyang Zeng Jinghao Wang Zhihao Jiang Lvyun Zhang School of Information Science and Engineering Hunan Provincial Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Shenzhen Lazada Software Technology Company Limited Shenzhen China School of Big Data and Computer Science Hechi University Guangxi China

Existing methods for modeling recommendation systems based on knowledge graphs include embedding-based, pathbased, and propagation-based methods. The embedding-based approach is flexible but more suitable for intra-graph applications, the path-based approach can model complex relationships but has a high computational cost, and the propagation-based approach considers global information but may introduce noise. This study proposed a simple and efficient model, called SEKGAT, which comprehensive the ideology of path-based and propagation approach to personalized recommendation by aggregating the user preferences through graph attention mechanism and fusing multiple feature representations on the knowledge graph into item features through pooling aggregators. Experimental results for the CTR prediction and Top-K recommendation tasks on three datasets of real-world scenarios show that our model approach is competitive.

关键词：

Large Generative Model-assisted Talking-face Semantic Communication System

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jiang, Feibo Tu, Siwei Dong, Li Pan, Cunhua Wang, Jiangzhou You, Xiaohu Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratoryof Artificial Intelligence Hunan University of Technology and Business Changsha China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China The National Mobile Communications Research Laboratory Southeast University Nanjing China The Purple Mountain Laboratories Nanjing China

The rapid development of generative Artificial Intelligence (AI) continually unveils the potential of Semantic Communication (SemCom). However, current talking-face SemCom systems still encounter challenges such as low bandwidth utilization, semantic ambiguity, and diminished Quality of Experience (QoE). This study introduces a Large Generative Model-assisted Talking-face Semantic Communication (LGM-TSC) System tailored for the talking-face video communication. Firstly, we introduce a Generative Semantic Extractor (GSE) at the transmitter based on the FunASR model to convert semantically sparse talking-face videos into texts with high information density. Secondly, we establish a private Knowledge Base (KB) based on the Large language Model (LLM) for semantic disambiguation and correction, complemented by a joint knowledge base-semantic-channel coding scheme. Finally, at the receiver, we propose a Generative Semantic Reconstructor (GSR) that utilizes BERTVITS2 and SadTalker models to transform text back into a highQoE talking-face video matching the user’s timbre. Simulation results demonstrate the feasibility and effectiveness of the proposed LGM-TSC system. Copyright © 2024, The Authors. All rights reserved.

关键词： Latent semantic analysis

A Reconstruction Method for Cross-Cut Shredded Documents Based on the Extreme Learning Machine Algorithm

学校读者我要写书评

暂无评论

Research Square

Research Square 2022年

作者： Zhang, Zhenghui Zou, Juan Zheng, Jinhua Yang, Shengxiang Gong, Dunwei Pei, Tingrui Key Laboratory of Hunan Province for Internet of Things and Information Security Xiangtan University Hunan Xiangtan411105 China Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Information Engineering College of Xiangtan University Hunan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom School of Information and Electronic Engineering China University of Mining and Technology Xuzhou221116 China

Reconstruction of cross-cut shredded text documents (RCCSTD) has important applications for information security and judicial evidence collection. The traditional method of manual construction is a very time-consuming task, so the use of computer-assisted efficient reconstruction is a crucial research topic. Fragment consensus information extraction and fragment pair compatibility measurement are two fundamental processes in RCCSTD. Due to the limitations of the existing classical methods of these two steps, only documents with specific structures or characteristics can be spliced, and pairing error is larger when the cutting is more fine-grained. In order to reconstruct the fragments more effectively, this paper improves the extraction method for consensus information and constructs a new global pairwise compatibility measurement model based on the extreme learning machine algorithm. The purpose of the algorithm’s design is to exploit all available information and computationally suggest matches to increase the algorithm’s ability to discriminate between data in various complex situations, then find the best neighbor of each fragment for splicing according to pairwise compatibility. The overall performance of our approach in several practical experiments is illustrated. The results indicate that the matching accuracy of the proposed algorithm is better than that of the previously published classical algorithms and still ensures a higher matching accuracy in the noisy datasets, which can provide a feasible method for RCCSTD intelligent systems in real scenarios. © 2022, CC BY.

关键词： Knowledge acquisition

A Flexible Two-Stage Constrained Multi-Objective Evolutionary Algorithm Based on Autonomic Regulation

学校读者我要写书评

暂无评论

SSRN

SSRN 2022年

作者： Zou, Juan Luo, Jian Liu, Yuan Yang, Shengxiang Zheng, Jinhua Key Laboratory of Intelligent Computing and Information Processing Ministry of Education Computer science College of Xiangtan University Hunan Province Xiangtan China Faculty of Informational Engineering University of Xiangtan Xiangtan411105 China Hunan Provincial Key Laboratory of Intelligent Information Processing and Application Hengyang421002 China School of Computer Science and Informatics De Montfort University LeicesterLE1 9BH United Kingdom

The core element in solving constrained multi-objective problems (CMOPs) with evolutionary algorithms is simultaneously balancing objective optimization and constraint satisfaction. The di ffi culty of maintaining this balance increases significantly for existing algorithms when dealing with complex CMOPs because various complex feasible regions often make CMOPs with very di ff erent characteristics. To address this issue, we propose a more flexible two-stage evolutionary algorithm based on autonomic regulation (ARCMO), which can e ff ectively control evolutionary trends to adapt to complex CMOPs. Specifically, the first stage performs a fast global search and passes the population information to the second stage. The second stage consists of two dynamically complementary sub-processes: named exploration subprocess and convergence subprocess. The ratio of these two sub-processes is dynamically adjusted according to the information from the first stage to adapt to CMOPs with di ff erent complexities. Experiments on several recently proposed benchmark suites and real-world application problems show that ARCMO is more adaptable than the contender algorithms when solving di ff erent complex CMOPs. © 2022, The Authors. All rights reserved.

关键词： Evolutionary algorithms

Distributed resource scheduling for large-scale MEC systems: A multi-agent ensemble deep reinforcement learning with imitation acceleration

学校读者我要写书评

暂无评论

arXiv 2020年

作者： Jiang, Feibo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China Key Laboratory of Hunan Province for New Retail Virtual Reality Technology Hunan University of Commerce Changsha China Department of Computer and Information Sciences Northumbria University United Kingdom School of Computer Sciences and Electrical Engineering University of Essex ColchesterCO4 3SQ United Kingdom School of Electronic Engineering and Computer Science Queen Mary University of London LondonE1 4NS United Kingdom

We consider the optimization of distributed resource scheduling to minimize the sum of task latency and energy consumption for all the Internet of things devices (IoTDs) in a large-scale mobile edge computing (MEC) system. To address this problem, we propose a distributed intelligent resource scheduling (DIRS) framework, which includes centralized training relying on the global information and distributed decision making by each agent deployed in each MEC server. More specifically, we first introduce a novel multi-agent ensemble-assisted distributed deep reinforcement learning (DRL) architecture, which can simplify the overall neural network structure of each agent by partitioning the state space and also improve the performance of a single agent by combining decisions of all the agents. Secondly, we apply action refinement to enhance the exploration ability of the proposed DIRS framework, where the near-optimal state-action pairs are obtained by a novel Lvy flight search. Finally, an imitation acceleration scheme is presented to pre-train all the agents, which can significantly accelerate the learning process of the proposed framework through learning the professional experience from a small amount of demonstration data. Extensive simulations are conducted to demonstrate that the proposed DIRS framework is efficient and outperforms the existing benchmark schemes. Copyright © 2020, The Authors. All rights reserved.

关键词： Deep learning

Systematic Resource Allocation in Cloud RAN with Caching as a Service under Two Timescales

学校读者我要写书评

暂无评论

Systematic Resource Allocation in Cloud RAN with Caching as ...

作者： Tang, Jianhua Quek, Tony Q. S. Chang, Tsung-Hui Shim, Byonghyo Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing College of Information Science and Engineering Hunan Normal University Changsha410081 China Institute of New Media and Communications Department of Electrical and Computer Engineering Seoul National University Seoul08826 Korea Republic of Information Systems Technology and Design Pillar Singapore University of Technology and Design Singapore487372 Singapore Department of Electronic Engineering Kyung Hee University Yongin17104 Korea Republic of School of Science and Engineering Chinese University of Hong Kong Shenzhen518172 China Shenzhen Research Institute of Big Data Shenzhen518172 China Department of Electrical and Computer Engineering Institute of New Media and Communications Seoul National University Seoul08826 Korea Republic of

Recently, cloud radio access network (C-RAN) with caching as a service (CaaS) was proposed to merge the functionalities of communication, computing, and caching (CCC) together. In this paper, we dissect the interactions of CCC in C-RAN with CaaS from two dimensions: physical resource dimension and time dimension. In the physical resource dimension, we identify how to segment the baseband unit (BBU) pool resources (i.e., computation and storage) into different types of virtual machines (VMs). In the time dimension, we address how the long-term resource segmentation in the BBU pool impacts on the short-term transmit beamforming at the remote radio heads. We formulate the problem as a stochastic mixed-integer nonlinear programming (SMINLP) to minimize the system cost, including the server cost, VM cost and wireless transmission cost. After a series of approximation, including sample average approximation, successive convex approximation, and semidefinite relaxation, the SMINLP is approximated as a global consensus problem. The alternating direction method of multipliers (ADMM) is utilized to obtain the solution in a parallel fashion. Simulation results verify the convergence of our proposed algorithm, and also confirm that the proposed scheme is more cost-saving than that without considering the integration of CCC. © 1972-2012 IEEE.

关键词： Integer programming

Visual language Model based Cross-modal Semantic Communication Systems

学校读者我要写书评

暂无评论

arXiv 2024年

作者： Jiang, Feibo Tang, Chuanguo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China The Department of Computer Science Brunel University London United Kingdom The School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China The National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Semantic Communication (SC) has emerged as a novel communication paradigm in recent years, successfully transcending the Shannon physical capacity limits through innovative semantic transmission concepts. Nevertheless, extant Image Semantic Communication (ISC) systems face several challenges in dynamic environments, including low semantic density, catastrophic forgetting, and uncertain Signal-to-Noise Ratio (SNR). To address these challenges, we propose a novel Vision-language Model-based Cross-modal Semantic Communication (VLM-CSC) system. The VLM-CSC comprises three novel components: (1) Cross-modal Knowledge Base (CKB) is used to extract high-density textual semantics from the semantically sparse image at the transmitter and reconstruct the original image based on textual semantics at the receiver. The transmission of high-density semantics contributes to alleviating bandwidth pressure. (2) Memory-assisted Encoder and Decoder (MED) employ a hybrid long/short-term memory mechanism, enabling the semantic encoder and decoder to overcome catastrophic forgetting in dynamic environments when there is a drift in the distribution of semantic features. (3) Noise Attention Module (NAM) employs attention mechanisms to adaptively adjust the semantic coding and the channel coding based on SNR, ensuring the robustness of the CSC system. The experimental simulations validate the effectiveness, adaptability, and robustness of the CSC system. Copyright © 2024, The Authors. All rights reserved.

关键词： Semantics

Large AI Model-Based Semantic Communications

学校读者我要写书评

暂无评论

arXiv 2023年

作者： Jiang, Feibo Peng, Yubo Dong, Li Wang, Kezhi Yang, Kun Pan, Cunhua You, Xiaohu Hunan Provincial Key Laboratory of Intelligent Computing and Language Information Processing Hunan Normal University Changsha China School of Information Science and Engineering Hunan Normal University Changsha China Changsha Social Laboratory of Artificial Intelligence Hunan University of Technology and Business Changsha China Department of Computer Science Brunel University London United Kingdom School of Computer Science and Electronic Engineering University of Essex ColchesterCO4 3SQ United Kingdom Changchun Institute of Technology China National Mobile Communications Research Laboratory Southeast University Nanjing210096 China

Semantic communication (SC) is an emerging intelligent paradigm, offering solutions for various future applications like metaverse, mixed reality, and the Internet of Everything. However, in current SC systems, the construction of the knowledge base (KB) faces several issues, including limited knowledge representation, frequent knowledge updates, and insecure knowledge sharing. Fortunately, the development of the large AI model (LAM) provides new solutions to overcome the above issues. Here, we propose a LAM-based SC framework (LAM-SC) specifically designed for image data, where we first apply the segment anything model (SAM)-based KB (SKB) that can split the original image into different semantic segments by universal semantic knowledge. Then, we present an attention-based semantic integration (ASI) to weigh the semantic segments generated by SKB without human participation and integrate them as the semanticaware image. Additionally, we propose an adaptive semantic compression (ASC) encoding to remove redundant information in semantic features, thereby reducing communication overhead. Finally, through simulations, we demonstrate the effectiveness of the LAM-SC framework and the possibility of applying the LAM-based KB in future SC paradigms. Copyright © 2023, The Authors. All rights reserved.

关键词： Latent semantic analysis

UWB SAR image segmentation algorithm based on polynomial analysis of statistical distribution

学校读者我要写书评

暂无评论

UWB SAR image segmentation algorithm based on polynomial ana...

Asian and Pacific Conference on Synthetic Aperture Radar (APSAR)

作者： Wang Yuming Jin Tian Luo Chaopeng College of Information Science and Engineering Hunan Provincial Key Laboratory of Intelligent Computhing and Language Information Processing Science and Technology on Near-Surface Detection Laboratory Hunan Normal University Changsha R.P.China College of Electronic Science and Technology Science and Technology on Near-Surface Detection Laboratory National University of Defense Technology Changsha R.P.China Science and Technology on Near-Surface Detection Laboratory Wuxi China

ISBN: (数字)9781728129129

ISBN: (纸本)9781728129136

Aimed at the segmentation problem of ultrawideband synthetic aperture radar (UWB SAR) image, a novel algorithm based on polynomial analysis of statistical distribution is proposed in this letter. Firstly, we estimate the probability density function (PDF) for each pixel via sparse decomposition of which the dictionary consists of orthogonal polynomials (OP). Secondly, the weighting coefficients of corresponding OP are used to segment image using their maximum value. The experimental results validate the efficiency of this algorithm.

关键词： Image segmentation Probability density function Synthetic aperture radar Radar polarimetry Signal processing algorithms Scattering Statistical distributions