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

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Huo, Jinchen Liu, Weidong Li, Yang Cao, Yan Institute of Scientific and Technical Information of China China College of Computer Science Inner Mongolia University China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

ISBN: (纸本)9798350331684

As the largest source of technical information around the world, patents are regarded as an essential crystallization and carrier of knowledge and technological innovation. Patent transformation is conducive not only to enhancing economic efficiency, but also to improving productivity and the rational utilization of resources. There is an imbalance between high patent ownership and low transformation rates. We try to predict the occurrence of transformation events from the patent assignment. However, there are some challenges in predicting patent transformation: (1) how to capture transformation features of patents, especially combined with the transfer time factor. (2) how to predict patent transfer time effectively. To address these challenges, a Patent Transfer Time Forecasting Model (PTTFM) is proposed. The model includes: (1) extraction of time-varying features of patents. (2) the patent transfer time is forecast using a Neural Temporal Point Process. By testing the model on patents under different classifications, the experimental results are obtained to show that the proposed model is applicable to predict the timing of patent assignment within a certain time frame, especially one month. Our work may facilitate patent transformation while interpretability is ensured for transformation events. © 2023 IEEE.

关键词： Forecasting

来源：评论

学校读者我要写书评

暂无评论

Sequence-to-Sequence Knowledge Graph Completion Based on Gated Attention Unit 29

Sequence-to-Sequence Knowledge Graph Completion Based on Gat...

引用

29th IEEE International Conference on Parallel and Distributed Systems, ICPADS 2023

作者： Yi, Fengge Wei, Xiumei Liu, Xiaojing Jiang, Xuesong Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Jinan China Shandong Fundamental Research Center for Computer Science Shandong Provincial Key Laboratory of Computer Networks Jinan China State Key Laboratory of High-end Server & Storage Technology Jinan China

ISBN: (纸本)9798350330717

We present GauKGT5, a sequence-to-sequence model proposed for knowledge graph completion (KGC). Our research extends the KGT5 model, a recent sequence-to-sequence link prediction (LP) model. GauKGT5 takes advantage of textual characteristics inherent in the knowledge graph, exhibiting a small model size. However, KGT5's proficiency in link prediction necessitates the ensemble with a knowledge graph embedding model, which itself poses challenges due to its substantial size and expense. By integrating the Gated Attention Unit into the KGT5 model and directly applying it to the encoder-decoder structure, we achieve improved contextual dependency capturing within the sequence, resulting in enhanced prediction accuracy, accelerated training speed, and enhanced computational efficiency. At the same time, we introduce parallel computing as a means to enhance the efficiency of model training and inference within the XPU distributed computing environment. © 2023 IEEE.

关键词： gated attention unit knowledge graph completion sequence-to-sequence model

来源：评论

学校读者我要写书评

暂无评论

Research on patent recommendation method based on graph neural network 26

Research on patent recommendation method based on graph neur...

引用

26th International Conference on Computer Supported Cooperative Work in Design, CSCWD 2023

作者： Zhang, Enchao Liu, Weidong Liu, Shi Cao, Yan Institute of Scientific and Technical Information of China China College of Computer Science Inner Mongolia University China Natl. Loc. Jt. Eng. Research Center of Intelligent Information Processing Technology for Mongolian China Inner Mongolia Key Laboratory of Social Computing and Data Processing China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology China

ISBN: (纸本)9798350331684

Intellectual property transactions have shown a strong growth momentum in recent years, but the patent transaction market has been plagued by the matching degree of consumers and sellers, resulting in frequent problems such as low patent transformation efficiency and poor transaction quality. This paper proposes a method of recommending patents to consumers by experts to improve the environment of patent transactions. Through the analysis of the past transaction information of the patent, the effective path information of the target is extracted. The graph neural network is used to describe the characteristics and semantics among experts, patents and consumers, and then capture the potential weight among them through the common attention mechanism, and then dynamically integrate them to predict the occurrence of recommendation behavior. The paper makes reasonable use of social information and expert information in the transaction, which significantly improves the rationality and accuracy of expert recommendation. © 2023 IEEE.

关键词： Patents and inventions

来源：评论

学校读者我要写书评

暂无评论

Effective degree of freedom for near-field plane-based XL-MIMO with tri-polarization

引用

Frontiers of Information Technology & Electronic engineering 2024年第12期25卷 1723-1731页

作者： Zhe WANG Jiayi ZHANG Wenhui YI Huahua XIAO Dusit NIYATO Bo AI School of Electronic and Information Engineering Beijing Jiaotong UniversityBeijing 100044China College of Computing and Data Science Nanyang Technological UniversitySingapore 639798Singapore State Key Laboratory of Mobile Network and Mobile Multimedia Technology ZTE CorporationShenzhen 518057China

In this paper we study the effective degree of freedom(EDoF)for extremely large-scale multipleinput multiple-output(XL-MIMO)*** consider two XL-MIMO hardware designs,uniform planar array(UPA)based and continuous aperture(CAP)based XL-MIMO,as well as two representative near-field channel models:scalar Green function based and dyadic Green function with triple polarization based models.

关键词： field planar function

来源：评论

学校读者我要写书评

暂无评论

TFGDA: Exploring Topology and Feature Alignment in Semi-supervised Graph Domain Adaptation through Robust Clustering 38

TFGDA: Exploring Topology and Feature Alignment in Semi-supe...

引用

38th Conference on Neural Information Processing Systems, NeurIPS 2024

作者： Dan, Jun Liu, Weiming Xie, Chunfeng Yu, Hua Dong, Shunjie Tan, Yanchao Zhejiang University China Queen Mary University of London United Kingdom Dalian University of Technology China Shanghai Jiao Tong University China Fuzhou University China Engineering Research Center of Big Data Intelligence Ministry of Education China Fujian Key Laboratory of Network Computing and Intelligent Information Processing China

Semi-supervised graph domain adaptation, as a branch of graph transfer learning, aims to annotate unlabeled target graph nodes by utilizing transferable knowledge learned from a label-scarce source graph. However, most existing studies primarily concentrate on aligning feature distributions directly to extract domain-invariant features, while ignoring the utilization of the intrinsic structure information in graphs. Inspired by the significance of data structure information in enhancing models' generalization performance, this paper aims to investigate how to leverage the structure information to assist graph transfer learning. To this end, we propose an innovative framework called TFGDA. Specially, TFGDA employs a structure alignment strategy named STSA to encode graphs' topological structure information into the latent space, greatly facilitating the learning of transferable features. To achieve a stable alignment of feature distributions, we also introduce a SDA strategy to mitigate domain discrepancy on the sphere. Moreover, to address the overfitting issue caused by label scarcity, a simple but effective RNC strategy is devised to guide the discriminative clustering of unlabeled nodes. Experiments on various benchmarks demonstrate the superiority of TFGDA over SOTA methods. © 2024 Neural information processing systems foundation. All rights reserved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Intelligent Fast Cell Association Scheme Based on Deep Q-Learning in Ultra-Dense Cellular Networks

引用

China Communications 2021年第2期18卷 259-270页

作者： Jinhua Pan Lusheng Wang Hai Lin Zhiheng Zha Caihong Kai Key Laboratory of Knowledge Engineering with Big Data Ministry of Education.School of Computer Science and Information EngineeringHefei University of TechnologyHefei 230601China Anhui Province Key Laboratory of Industry Safety and Emergency Technology Hefei 230601China Key Laboratory of Aerospace Information Security and Trusted Computing Ministry of Education.School of Cyber Science and EngineeringWuhan UniversityWuhan 430072China

To support dramatically increased traffic loads,communication networks become *** cell association(CA)schemes are timeconsuming,forcing researchers to seek fast *** paper proposes a deep Q-learning based scheme,whose main idea is to train a deep neural network(DNN)to calculate the Q values of all the state-action pairs and the cell holding the maximum Q value is *** the training stage,the intelligent agent continuously generates samples through the trial-anderror method to train the DNN until *** the application stage,state vectors of all the users are inputted to the trained DNN to quickly obtain a satisfied CA result of a scenario with the same BS locations and user *** demonstrate that the proposed scheme provides satisfied CA results in a computational time several orders of magnitudes shorter than traditional ***,performance metrics,such as capacity and fairness,can be guaranteed.

关键词： ultra-dense cellular networks(UDCN) cell association(CA) deep Q-learning proportional fairness Q-learning

来源：评论

学校读者我要写书评

暂无评论

DASCDC: Dual Attention-based Sparse Common Deep Clustering Method 9

DASCDC: Dual Attention-based Sparse Common Deep Clustering M...

引用

9th IEEE International Conference on Behavioural and Social computing, BESC 2022

作者： Dong, Yao Shi, Jin Deng, Yahan Dong, Yongfeng Wang, Ziqiu School of Artificial Intelligence Hebei University of Technology Tianjin300401 China Hebei Province Key Laboratory of Big Data Computing Tianjin300401 China Data Driven Industrial Intelligent Hebei Engineering Research Center Tianjin300401 China

ISBN: (数字)9798350398144

ISBN: (纸本)9798350398144

Graph convolutional network (GCN) has been successfully applied in deep clustering on the high dimensional dataset, which is usually processed by extracting the feature and structure information. However, it lacks an effective fusion mechanism of common information between the feature and structure information and does not perform well on the sparse dataset. Therefore, we propose a dual attention-based sparse common deep clustering method(DASCDC). Firstly, we advance a sparse feature representation method with an adversarial loss function to solve the data sparsity problem and improve the discriminator's performance. Then, an information interaction operator is designed to deeply mine the common information and enhance the information fusion capability. Finally, considering the different contribution degrees of various neighbour nodes and information, we promote a dual self-attention mechanism from the node and model levels. Experiment results indicate that the proposed DASCDC algorithm overperforms other state-of-art deep clustering algorithms on non-graph and graph datasets with high dimension and sparsity. © 2022 IEEE.

关键词： Cluster analysis

来源：评论

学校读者我要写书评

暂无评论

Joint Sparsification and Quantization for Wireless Federated Learning under Communication Constraints 24

Joint Sparsification and Quantization for Wireless Federated...

引用

24th IEEE International Workshop on Signal Processing Advances in Wireless Communications, SPAWC 2023

作者： Su, Junshen Wang, Xijun Chen, Xiang Cheng, Ray-Guang Sun Yat-Sen University School of Electronics and Information Technology Guangzhou China The Chinese University of HongKong Guangdong Provincial Key Laboratory of Big Data Computing Shenzhen China National Taiwan University of Science and Technology Department of Electronic and Computer Engineering Taipei Taiwan

ISBN: (纸本)9781665496261

Communication efficiency is one of the key bottlenecks in Federated Learning (FL). Compression techniques, such as sparsification and quantization, are used to reduce communication overhead. However, joint designs of these techniques under communication constraints are not well-explored. This paper investigates the joint uplink compression problem in communication-constrained FL systems. We propose a Block-TopK sparsification scheme to reduce the proportion of bits used for locating entries of a sparsified vector. Considering the communication constraints, an optimization formulation is proposed to minimize the compression error. By solving the optimization problem, our joint compression method provides a better trade-off between sparsity budget and bit width. Numerical results demonstrate that our approach achieves 99.96% of baseline accuracy with only 1.56% of the baseline communication overhead when training ResNet-18 on CIFAR-10. © 2023 IEEE.

关键词： Budget control

来源：评论

学校读者我要写书评

暂无评论

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale Image Super-Resolution 27

Task-Aware Dynamic Transformer for Efficient Arbitrary-Scale...

引用

27th European Conference on Artificial Intelligence, ECAI 2024

作者： Xu, Tianyi Zhou, Yijie Hu, Xiaotao Zhang, Kai Zhang, Anran Qiu, Xingye Xu, Jun School of Statistics and Data Science Nankai University Tianjin China College of Computer Science Nankai University Tianjin China School of Intelligence Science and Technology Nanjing University Suzhou China Tencent Data Platform Beijing China Zhejiang University Hangzhou China Systems Engineering Research Institute China State Shipbuilding Corporation Limited Beijing China Guangdong Provincial Key Laboratory of Big Data Computing The Chinese University of Hong Kong Shenzhen China

ISBN: (纸本)9781643685489

Arbitrary-scale super-resolution (ASSR) aims to learn a single model for image super-resolution at arbitrary magnifying scales. Existing ASSR networks typically comprise an off-the-shelf scale-agnostic feature extractor and an arbitrary scale upsampler. These feature extractors often use fixed network architectures to address different ASSR inference tasks, each of which is characterized by an input image and an upsampling scale. However, this overlooks the difficulty variance of super-resolution on different inference scenarios, where simple images or small SR scales could be resolved with less computational effort than difficult images or large SR scales. To tackle this difficulty variability, in this paper, we propose a Task-Aware Dynamic Transformer (TADT) as an input-adaptive feature extractor for efficient image ASSR. Our TADT consists of a multi-scale feature extraction backbone built upon groups of Multi-Scale Transformer Blocks (MSTBs) and a Task-Aware Routing Controller (TARC). The TARC predicts the inference paths within feature extraction backbone, specifically selecting MSTBs based on the input images and SR scales. The prediction of inference path is guided by a new loss function to trade-off the SR accuracy and efficiency. Experiments demonstrate that, when working with three popular arbitrary-scale upsamplers, our TADT achieves state-of-the-art ASSR performance when compared with mainstream feature extractors, but with relatively fewer computational costs. The code is available at https://***/Tillyhere/TADT. © 2024 The Authors.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Weighted Flat Lattice Transformer-based Knowledge Extraction Architecture for Chinese Named Entity Recognition

A Weighted Flat Lattice Transformer-based Knowledge Extracti...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Hengwei Zhang Yuejia Wu Jian-Tao Zhou Inner Mongolia University College of Computer Science Hohhot China Ministry of Education National & Local Joint Engineering Research Center of Intelligent Information Processing Technology for Mongolian Engineering Research Center of Ecological Big Data Hohhot China Inner Mongolia Engineering Laboratory for Cloud Computing and Service Software Hohhot China Inner Mongolia Key Laboratory of Social Computing and Data Processing Hohhot China Inner Mongolia Key Laboratory of Discipline Inspection and Supervision Big Data Hohhot China Inner Mongolia Engineering Laboratory for Big Data Analysis Technology Hohhot China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Named Entity Recognition (NER) is one of the contents of Knowledge Extraction (KE) that transforms data into knowledge representation. However, Chinese NER faces the problem of lacking clear word boundaries that limit the effectiveness of the KE. Although the flat lattice Transformer (FLAT) framework, which converts lattice structure into a flat structure including a set of spans, can effectively improve this problem and obtain advanced results, there still exist the problems of insensitivity to entity importance weights and insufficient feature learning. This paper proposes a weighted flat lattice Transformer architecture for Chinese NER, namely WFLAT. The WFLAT first adds a weight matrix into self-attention calculation, which can obtain finer-grained partitioning of entities to improve experimental performance, and then adopts a multi-layer Transformer encoder with each layer using a multi-head self-attention mechanism. Extensive experimental results on benchmarks demonstrate that our proposed KE model can obtain state-of-the-art performance for the Chinese NER task.

关键词： Representation learning Computational modeling Memory management Lattices Named entity recognition Transforms Knowledge representation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：