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

Multi-layer network embedding on scc-based network with motif

Digital Communications and Networks 2024年第3期10卷 546-556页

作者： Lu Sun Xiaona Li Mingyue Zhang Liangtian Wan Yun Lin Xianpeng Wang Gang Xu Department of Communication Engineering Institute of Information Science TechnologyDalian Maritime UniversityDalian116026China Key Laboratory of Big Data Intelligent Computing Chongqing University of Posts and TelecommunicationsChongqing400065China Key Laboratory for Ubiquitous Network and Service Software of Liaoning Province DUT School of Software Technology&DUT-RU International School of Information Science and EngineeringDalian University of TechnologyDalian 116620China College of Information and Communication Engineering Harbin Engineering UniversityHarbin 150001China School of Information and Communication Engineering Hainan UniversityHaikou 570228China State Key Laboratory of Millimeter Waves School of Information Science and EngineeringSoutheast UniversityNanjing 210096China

Interconnection of all things challenges the traditional communication methods,and Semantic Communication and Computing(SCC)will become new *** is a challenging task to accurately detect,extract,and represent semantic information in the research of SCC-based *** previous research,researchers usually use convolution to extract the feature information of a graph and perform the corresponding task of node ***,the content of semantic information is quite *** graph convolutional neural networks provide an effective solution for node classification tasks,due to their limitations in representing multiple relational patterns and not recognizing and analyzing higher-order local structures,the extracted feature information is subject to varying degrees of ***,this paper extends from a single-layer topology network to a multi-layer heterogeneous topology *** Bidirectional Encoder Representations from Transformers(BERT)training word vector is introduced to extract the semantic features in the network,and the existing graph neural network is improved by combining the higher-order local feature module of the network model representation network.A multi-layer network embedding algorithm on SCC-based networks with motifs is proposed to complete the task of end-to-end node *** verify the effectiveness of the algorithm on a real multi-layer heterogeneous network.

关键词： Semantic communication and computing Multi-layer network Graph neural network Motif

来源：评论

学校读者我要写书评

暂无评论

A threshold effect of coupling delays on intra-layer synchronization in duplex networks

引用

Science China(Technological Sciences) 2018年第12期61卷 1907-1914页

作者： TANG LongKun LU JunAn Lü JinHu Fujian Province University Key Laboratory of Computation Science School of Mathematical Sciences Huaqiao University Department of Mathematics & Statistics Georgia State University School of Mathematics and Statistics Wuhan University School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

This paper investigates the impact of inter-layer coupling functions and intra-layer coupling delays on intra-layer synchronization regions and sychronizability. It is found that the inter-layer coupling functions have great influence on intra-layer synchronization regions, as well as on the intra-layer synchronizability. In particular, there exists an inter-layer coupling function such that the inter-layer coupling strength neither improves nor weakens the intra-layer synchronizability. Furthermore, no matter which one of three inter-layer coupling functions is chosen, a small intra-layer delay always keeps the intra-layer synchronized regions almost unchanged, implying that the small delay neither enhances nor suppresses the intra-layer synchronizability. At the same time the delay greatly frustrates the synchronizability in each layer when it is greater than some threshold. Our results may have potential applications for interconnected technological networks where communication delays are inevitably present.

关键词： multiplex network master stability function intra-layer synchronization synchronized region time delay

来源：评论

学校读者我要写书评

暂无评论

A Survey of LLM datasets:From Autoregressive Model to AI Chatbot

引用

Journal of Computer Science & Technology 2024年第3期39卷 542-566页

作者：杜非马新建杨婧如柳熠罗超然王学斌姜海鸥景翔 National Key Laboratory of Data Space Technology and System Beijing 100195China Advanced Institute of Big Data Beijing 100195China Fu Foundation School of Engineering and Applied Science Columbia UniversityNY 10027U.S.A. School of Software and Microelectronics Peking UniversityBeijing 100091China CCF IEEE

Since OpenAI opened access to ChatGPT,large language models(LLMs)become an increasingly popular topic attracting researchers’attention from abundant ***,public researchers meet some problems when developing LLMs given that most of the LLMs are produced by industries and the training details are typically *** datasets are an important setup of LLMs,this paper does a holistic survey on the training datasets used in both the pre-train and fine-tune *** paper first summarizes 16 pre-train datasets and 16 fine-tune datasets used in the state-of-the-art ***,based on the properties of the pre-train and fine-tune processes,it comments on pre-train datasets from quality,quantity,and relation with models,and comments on fine-tune datasets from quality,quantity,and *** study then critically figures out the problems and research trends that exist in current LLM *** study helps public researchers train and investigate LLMs by visual cases and provides useful comments to the research community regarding data *** the best of our knowledge,this paper is the first to summarize and discuss datasets used in both autoregressive and chat *** survey offers insights and suggestions to researchers and LLM developers as they build their models,and contributes to the LLM study by pointing out the existing problems of LLM studies from the perspective of data.

关键词： large language model(LLM) autoregressive model AI chatbot natural language processing(NLP)corpora OpenAI

来源：评论

学校读者我要写书评

暂无评论

A Two-phase Prototypical Network Model for Incremental Few-shot Relation Classification 28

A Two-phase Prototypical Network Model for Incremental Few-s...

引用

28th International Conference on Computational Linguistics, COLING 2020

作者： Ren, Haopeng Cai, Yi Chen, Xiaofeng Wang, Guohua Li, Qing School of Software Engineering South China University of Technology Guangzhou China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China Department of Computing The Hong Kong Polytechnic University Hong Kong

ISBN: (纸本)9781952148279

Relation Classification (RC) plays an important role in natural language processing (NLP). Current conventional supervised and distantly supervised RC models always make a closed-world assumption which ignores the emergence of novel relations in an open environment. To incrementally recognize the novel relations, current two solutions (i.e, re-training and lifelong learning) are designed but suffer from the lack of large-scale labeled data for novel relations. Meanwhile, prototypical network enjoys better performance on both fields of deep supervised learning and few-shot learning. However, it still suffers from the incompatible feature embedding problem when the novel relations come in. Motivated by them, we propose a two-phase prototypical network with prototype attention alignment and triplet loss to dynamically recognize the novel relations with a few support instances meanwhile without catastrophic forgetting. Extensive experiments are conducted to evaluate the effectiveness of our proposed model. © 2020 COLING 2020 - 28th International Conference on Computational Linguistics, Proceedings of the Conference. All rights reserved.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

RGB-D Based Visual Navigation Using Direction Estimation Module 18th

RGB-D Based Visual Navigation Using Direction Estimation Mod...

引用

18th Pacific Rim International Conference on Artificial Intelligence, PRICAI 2021

作者： Luo, Chao Bi, Sheng Dong, Min Nie, Hongxu School of Computer Science and Engineering South China University of Technology Guangdong Guangzhou510006 China Key Laboratory of Big Data and Intelligent Robot Ministry of Education Guangdong Guangzhou510006 China

ISBN: (纸本)9783030893699

Target-driven visual navigation without mapping works to solve navigation problems that given a target object, mobile robots can navigate to the target object. Recently, visual navigation has been researched and improved largely by learning-based methods. However, their methods lack depth information and spatial perception, using only single RGB images. To overcome these problems, two methods are presented in this paper. Firstly, we encode visual features of objects by dynamic graph convolutional network and extract 3D spatial features for objects by 3D geometry, a high level visual feature for agent to easily understand object relationship. Secondly, as human beings, they solve this problem in two steps, first exploring a new environment to find the target object and second planning a path to arrive. Inspired by the way of humans navigation, we propose direction estimation module (DEM) based on RGB-D images. DEM provides direction estimation of the target object to our learning model by a wheel odometry. Given a target object, first stage, our agent explores an unseen scene to detect the target object. Second stage, when detected the target object, we can estimate current location of the target object by 3D geometry, after that, each step of the agent, DEM will estimate new location of target object, and give direction information of the target object from a first-view image. It can guide our agent to navigate to the target object. Our experiment results outperforms the result of state of the art method in the artificial environment AI2-Thor. © 2021, Springer Nature Switzerland AG.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

Research on performance optimization of virtual data space across WAN

引用

Frontiers of Computer Science 2024年第6期18卷 167-187页

作者： Jiantong HUO Zhisheng HUO Limin XIAO Zhenxue HE State Key Laboratory of Software Development Environment Beihang UniversityBeijing 100191China School of Computer Science and Engineering Beihang UniversityBeijing 100191China High Performance Computing Center Beihang UniversityBeijing 100191China Hebei Key Laboratory of Agricultural Big Data Hebei Agricultural UniversityBaoding 071001China

For the high-performance computing in a WAN environment,the geographical locations of national supercomputing centers are scattered and the network topology is complex,so it is difficult to form a unified view of *** aggregate the widely dispersed storage resources of national supercomputing centers in China,we have previously proposed a global virtual data space named GVDS in the project of“High Performance Computing Virtual data Space”,a part of the National key Research and Development Program of *** GVDS enables large-scale applications of the high-performance computing to run efficiently across ***,the applications running on the GVDS are often data-intensive,requiring large amounts of data from multiple supercomputing centers across *** this regard,the GVDS suffers from performance bottlenecks in data migration and access across *** solve the above-mentioned problem,this paper proposes a performance optimization framework of GVDS including the multitask-oriented data migration method and the request access-aware IO proxy resource allocation *** a WAN environment,the framework proposed in this paper can make an efficient migration decision based on the amount of migrated data and the number of multiple data sources,guaranteeing lower average migration latency when multiple data migration tasks are running in *** addition,it can ensure that the thread resource of the IO proxy node is fairly allocated among different types of requests(the IO proxy is a module of GVDS),so as to improve the application’s performance across *** experimental results show that the framework can effectively reduce the average data access delay of GVDS while improving the performance of the application greatly.

关键词： storage aggregation across WANs large-scale applications GVDS data migration allocation of IO proxy resource

来源：评论

学校读者我要写书评

暂无评论

Identifying topologies and system parameters of uncertaintime-varying delayed complex networks

引用

Science China(Technological Sciences) 2019年第1期62卷 94-105页

作者： WANG Xiong GU HaiBo WANG QianYao Lü JinHu LSC Academy of Mathematics and Systems Science Chinese Academy of Sciences School of Mathematical Sciences University of Chinese Academy of Sciences School of Automation Science and Electrical Engineering State Key Laboratory of Software Development Environment and Beijing Advanced Innovation Center for Big Data and Brain Computing Beihang University

Node dynamics and network topologies play vital roles in determining the network features and network dynamical *** it is of great theoretical significance and practical value to recover the topology structures and system parameters of uncertain complex networks with available information. This paper presents an adaptive anticipatory synchronization-based approach to identify the unknown system parameters and network topological structures of uncertain time-varying delayed complex networks in the presence of noise. Moreover, during the identification process, our proposed scheme guarantees anticipatory synchronization between the uncertain drive and constructed auxiliary response network simultaneously. Particularly, our method can be extended to several special cases. Furthermore, numerical simulations are provided to verify the effectiveness and applicability of our method for reconstructing network topologies and node parameters. We hope our method can provide basic insight into future research on addressing reconstruction issues of uncertain realistic and large-scale complex networks.

关键词： system parameters and network topologies identification anticipatory synchronization uncertain time-varying delayed complex networks noise-perturbed complex networks

来源：评论

学校读者我要写书评

暂无评论

Updating Large Language Models' Memories with Time Constraints

Updating Large Language Models' Memories with Time Constrain...

引用

2024 Conference on Empirical Methods in Natural Language Processing, EMNLP 2024

作者： Wu, Xin Bu, Yuqi Cai, Yi Wang, Tao School of Software Engineering South China University of Technology China Key Laboratory of Big Data and Intelligent Robot South China University of Technology Ministry of Education China Department of Biostatistics and Health Informatics King's College London United Kingdom

ISBN: (纸本)9798891761681

By incorporating the latest external knowledge, large language models (LLMs) can modify their internal memory. However, in practical applications, LLMs may encounter outdated information, necessitating the filtering of such data and updating of knowledge beyond internal memory. This paper explores whether LLMs can selectively update their memories based on the time constraints between internal memory and external knowledge. We evaluate existing LLMs using three types of data that exhibit different time constraints. Our experimental results reveal the challenges most LLMs face with time-constrained knowledge and highlight the differences in how various LLMs handle such information. Additionally, to address the difficulties LLMs encounter in understanding time constraints, we propose a two-stage decoupling framework that separates the identification and computation of time constraint into a symbolic system. Experimental results demonstrate that the proposed framework yields an improvement of over 60% in ChatGPT's performance, and achieves a 12-24% enhancement in state-of-the-art LLM GPT-4. © 2024 Association for Computational Linguistics.

关键词： Computational linguistics

来源：评论

学校读者我要写书评

暂无评论

Image denoising based on residual network 3

Image denoising based on residual network

引用

3rd International Conference on Electronic Information engineering, big data, and Computer Technology, EIBDCT 2024

作者： Ma, Lihe Wang, Yan Sha, Ning Ma, Lin School of Information Engineering Harbin University Harbin China Heilongjiang Government Affairs Big Data Center3 Harbin China Heilongjiang Provincial Key Laboratory of the Intelligent Perception and Intelligent Software Harbin China

ISBN: (纸本)9781510680449

Image denoising has always been a hot research topic in the field of computer vision, playing an important role in improving image quality and accuracy. In this paper, a method for image denoising based on residual network is proposed, which uses deep learning technology to improve the effect of image processing. This method can automatically learn useful features in the image and effectively remove noise in the image, achieving automatic removal of image noise. Finally, experiments were conducted on standard image datasets for evaluation. The experimental results show that the image denoising method based on residual network has better performance compared to traditional methods. It can effectively remove various types of noise, improve image quality and clarity, and has broad application prospects in image processing. © COPYRIGHT SPIE. Downloading of the abstract is permitted for personal use only.

关键词： Image denoising

来源：评论

学校读者我要写书评

暂无评论

Accuracy estimation of link-based similarity measures and its application

引用

Frontiers of Computer Science 2016年第1期10卷 113-123页

作者： Yinglong ZHANG Cuiping LI Chengwang XIE Hong CHEN School of Software East China Jiaotong University Nanchang 330045 China Key Laboratory of Data Engineering and Knowledge Engineering of Ministry of Education and Department of Computer Science Renmin University of China Beijing 100872 China Intelligent Optimization and Information Processing Laboratory East China Jiaotong University Nanchang 330013 China

Link-based similarity measures play a significant role in many graph based applications. Consequently, mea- suring node similarity in a graph is a fundamental problem of graph data mining. Personalized PageRank （PPR） and Sim- Rank （SR） have emerged as the most popular and influen- tial link-based similarity measures. Recently, a novel link- based similarity measure, penetrating rank （P-Rank）, which enriches SR, was proposed. In practice, PPR, SR and P-Rank scores are calculated by iterative methods. As the number of iterations increases so does the overhead of the calcula- tion. The ideal solution is that computing similarity within the minimum number of iterations is sufficient to guaran- tee a desired accuracy. However, the existing upper bounds are too coarse to be useful in general. Therefore, we focus on designing an accurate and tight upper bounds for PPR, SR, and P-Rank in the paper. Our upper bounds are designed based on the following intuition： the smaller the difference between the two consecutive iteration steps is, the smaller the difference between the theoretical and iterative similar- ity scores becomes. Furthermore, we demonstrate the effec- tiveness of our upper bounds in the scenario of top-k similar nodes queries, where our upper bounds helps accelerate the speed of the query. We also run a comprehensive set of exper- iments on real world data sets to verify the effectiveness and efficiency of our upper bounds.

关键词： personalized PageRank SimRank P-Rank up-per bound

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：