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

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Xiaojing Liu Xuesong Jiang Fengge Yi Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

The objective of Multimodal Knowledge Graph Completion (MKGC) is to forecast absent entities within a knowledge graph by leveraging additional textual and visual modalities. Existing studies commonly utilize a singular relationship embedding to depict all modalities within an entity pair, thus connecting several relationships derived from diverse modalities. However, this coupling may introduce interference from conflicting information between modalities, as the relationships between modalities for a given entity pair can be contradictory. Moreover, existing Ensemble Inference methods fail to dynamically adjust modal weights based on their differences and importance, despite the varying contributions of different modalities. In this paper, we propose the Multimodal Decouple and Relation-based Ensemble inference (MDRE) model. For each modality, we construct corresponding relationship embeddings and build separate triple representations to avoid interferences among modalities. During the training phase, we employ confidence-constrained training with temperature scaling to alleviate conflicting information in textual and visual modalities. For inference, we utilize the Relation-based Ensemble Inference method to adjust modal weights at the relationship level, thus achieving improved prediction results. Experimental results on two datasets demonstrate that MDRE outperforms existing single-modal and multimodal knowledge graph completion methods in terms of performance.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GA-Net: Gated Attention Mechanism Based Global Refinement Network for Image Inpainting

GA-Net: Gated Attention Mechanism Based Global Refinement Ne...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ran Qiu Shengrong Zhao Hu Liang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Underwater images are often affected by problems such as light attenuation, color distortion, noise and scattering, resulting in image defects. A novel image inpainting method is proposed to intelligently predict and fill damaged areas for complete and continuous visualization of the image. First, in order to effectively solve the problem of color distortion caused by light refraction in underwater environments, the improved gated attention mechanism is used. This mechanism improves the local details by learning and weighting the important features of the image. Second, gated convolution automatically determines the degree of restoration for each pixel based on local features of the original image. It eliminates distractions such as low contrast and scattering, retaining more original detailed information. By doing so, image inpainting techniques improve the quality and visualization of underwater images.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Sequence-to-Sequence Knowledge Graph Completion Based On Gated Attention Unit

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

引用

International Conference on Parallel and Distributed Systems (ICPADS)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Mixture of Experts for Network Optimization: A Large Language Model-enabled Approach

arXiv

引用

arXiv 2024年

作者： Du, Hongyang Liu, Guangyuan Lin, Yijing Niyato, Dusit Kang, Jiawen Xiong, Zehui Kim, Dong In The School of Computer Science and Engineering Nanyang Technological University Singapore639798 Singapore The State Key Laboratory of Networking and Switching Technology Beijing University of Posts and Telecommunications Beijing100876 China The School of Automation Guangdong University of Technology Key Laboratory of Intelligent Information Processing and System Integration of IoT Ministry of Education Guangzhou510006 China Guangdong-HongKong-Macao Joint Laboratory for Smart Discrete Manufacturing Guangzhou510006 China The Pillar of Information Systems Technology and Design Singapore University of Technology and Design Singapore487372 Singapore The Department of Electrical and Computer Engineering Sungkyunkwan University Suwon16419 Korea Republic of

Optimizing various wireless user tasks poses a significant challenge for networking systems because of the expanding range of user requirements. Despite advancements in Deep Reinforcement Learning (DRL), the need for customized optimization tasks for individual users complicates developing and applying numerous DRL models, leading to substantial computation resource and energy consumption and can lead to inconsistent outcomes. To address this issue, we propose a novel approach utilizing a Mixture of Experts (MoE) framework, augmented with Large Language Models (LLMs), to analyze user objectives and constraints effectively, select specialized DRL experts, and weigh each decision from the participating experts. Specifically, we develop a gate network to oversee the expert models, allowing a collective of experts to tackle a wide array of new tasks. Furthermore, we innovatively substitute the traditional gate network with an LLM, leveraging its advanced reasoning capabilities to manage expert model selection for joint decisions. Our proposed method reduces the need to train new DRL models for each unique optimization problem, decreasing energy consumption and AI model implementation costs. The LLM-enabled MoE approach is validated through a general maze navigation task and a specific network service provider utility maximization task, demonstrating its effectiveness and practical applicability in optimizing complex networking systems. © 2024, CC BY.

关键词： Reinforcement learning

来源：评论

学校读者我要写书评

暂无评论

SCTAR: A Multi-Layer BiLSTM-Based Chinese Short Text Similarity Computation Model with Attention Mechanism

SCTAR: A Multi-Layer BiLSTM-Based Chinese Short Text Similar...

引用

International Conference on computer Supported Cooperative Work in Design

作者： Shuo Zhao Yiyun Xing Jianqiang Zhang Gongpeng Song Qin Lu Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China Shandong Branch of China Mobile Communication Group Design Institute Co. Jinan China

ISBN: (数字)9798350349184

ISBN: (纸本)9798350349191

Text semantic similarity is a crucial research area in Natural Language Processing (NLP). However, traditional methods for calculating the similarity of short Chinese texts often fall short in accuracy and other crucial aspects. The Bidirectional Long Short-Term Memory Network (BiLSTM) has demonstrated remarkable performance in computing the similarity of short Chinese texts by effectively capturing long-range dependencies and semantic information. Additionally, the multi-head attention mechanism considers the interaction between different text locations and semantic information, enhancing the model’s representative capacity. Building upon this foundation, our paper proposes an enhanced model known as SCTbilstmAttRdrop (SCTAR). This model is constructed based on a multilayer BiLSTM architecture and incorporates an SE-gated convolutional module and a convolutional multi-head attention-aware model. We conducted extensive evaluations using two Chinese short text datasets, Chinese-SNLI and CCKS2018_Task3. The experimental results unequivocally demonstrate that our SCTAR model surpasses other common methods in terms of accuracy, precision, recall, and F1 scores when tasked with computing the similarity of Chinese short texts.

关键词： Accuracy Attention mechanisms Computational modeling Semantics Bidirectional control Feature extraction Nonhomogeneous media

来源：评论

学校读者我要写书评

暂无评论

Research on long and short-term social recommendation based on convolutional and gated recurrent units

Research on long and short-term social recommendation based ...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Zihe Jia Peng Xue Zhiqiang Dai Qian Gao Xiaomeng Zhang Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

The development of the Internet has made people more closely related and has put forward higher requirements for recommendation models. Most recommendation models are studied only for the long-term interests of users. In this paper, the interaction time between the user and the item is introduced as auxiliary information in the model construction. Interaction time is used to determine users’ long-term preferences and short-term preferences. In this paper, temporal features are extracted by building a convolutional gated recurrent unit with attention neural network (CNN-GRU-Attention). Firstly, for the problem of accurate feature extraction, CNN are constructed to extract higher-level and more abstract features of themselves and transform high-dimensional data into low-dimensional data; secondly, for the problem of social temporality, GRU are used to not only extract temporal information, but also effectively reduce gradient dispersion, making model convergence and training easier; finally, Graph Attention networks are used to aggregate the social relationship information of users and items respectively, which constitute the final feature representation of users and items respectively. In particular, a modified cosine similarity is used to reduce the error caused by data insensitivity when constructing the social information of the item. In this study, simulation experiments are conducted on two publicly available datasets (Epinions and Ciao), and the experimental results show that the proposed recommended model performs better than other social recommendation models, improving the evaluation metrics of MAE and RMSE by 1.06%-1.33% and 1.19%-1.37%, respectively. The effectiveness of the model innovation is proved.

关键词：

来源：评论

学校读者我要写书评

暂无评论

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Network Based on Generative Adversarial Network

GAF-GAN: Gated Attention Feature Fusion Image Inpainting Net...

引用

International Conference on Parallel and Distributed Systems (ICPADS)

作者： Ran Qiu Hu Liang Yuchen Liu Shengrong Zhao Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Engineering Research Center of Big Data Applied Technology Faculty of Computer Science and Technology Qilu University of Technology (Shandong Academy of Sciences) Jinan China Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Jinan China

Image inpainting, which aims to reconstruct reasonably clear and realistic images from known pixel information, is one of the core problems in computer vision. However, due to the complexity and variability of the underwater environment, the inability to extract valid pixel points and insufficient correlation between feature information in existing image inpainting techniques lead to blurring in the generated images. Therefore, a novel gated attention feature fusion image inpainting network based on generative adversarial networks (GAF-GAN) is proposed. The accuracy of feature similarity matching depends heavily on the validity of the information contained in the features. On the one hand, gating values are dynamically generated by gated convolution to reduce the interference of invalid information. On the other hand, semantic information at distant locations in an image is accurately acquired by the attention mechanism. For these reasons, we designed an improved gated attention mechanism. Gated attention mechanism make the network focus on effective information such as high-frequency texture and color fidelity of restored images. In addition, the dense feature fusion module is added to expand the overall receptive field of the network to fully learn the image features. Experimental results show that the proposed method can effectively repair defective images with complex texture structures and improve the reality and integrity of image details and structures.

关键词：

来源：评论

学校读者我要写书评

暂无评论

EMO: An Ontology for Supporting the Management of Epidemic

EMO: An Ontology for Supporting the Management of Epidemic

引用

Applied Physics and Computing (ICAPC), International Conference on

作者： Yongchao Gao Qiuyue Wang Mark S. Fox Key Laboratory of Computing Power Network and Information Security Ministry of Education Shandong Computer Science Center (National Supercomputer Center in Jinan) Shandong Provincial Key Laboratory of Computer Networks Shandong Fundamental Research Center for Computer Science Qilu University of Technology (Shandong Academy of Sciences) Jinan China Standard Institute of Emerging Technologies and Innovations Jinan China Urban Data Centre University of Toronto Toronto Canada

In order to improve the coverage of concepts in epidemic management, this paper constructs an epidemic management ontology EMO to help manage and analyse epidemic data. First, based on the ISO/lEC 5087 city data model series of standards and TOVE method, EMO is constructed using Protégé. Secondly, the data types and their relationships required in the epidemic management use cases are defined. Finally, the instance data help to verify the ability of EMO to represent the city epidemic management data. Results show that EMO provides a clear, accurate and unified definition of epidemic management data, improves the efficiency of data sharing and integration, and reduces the difficulty of developing epidemic management tools.

关键词：

来源：评论

学校读者我要写书评

暂无评论

A Parameter-Independent Algorithm of Finding the Maximum Clique with Continuous-Time Quantum Walks Driven by Seidel Matrix

SSRN

引用

SSRN 2023年

作者： Li, Xi Chen, Xiao Hu, Shouwei Xu, Juan Liu, Zhihao School of Computer Science and Engineering Southeast University Nanjing211189 China Key Laboratory of Computer Network and Information Integration Southeast University Ministry of Education Nanjing211189 China College of Computer Science and Technology Nanjing University of Aeronautics and Astronautics Nanjing210016 China Collaborative Innovation Center of Novel Software Technology and Industrialization Nanjing210023 China

The problem of searching the maximum clique(MC) in network analysis holds significant practical relevance. Quantum-based algorithms have recently emerged as promising approaches for addressing this problem. However, the performance of quantum-based algorithms heavily depends on the parameters of the quantum system and can vary significantly for different graph types. In order to tackle this issue, we propose an algorithm based on quantum walks. We initially demonstrate that Continuous-Time Quantum Walks (CTQW), driven by the Seidel matrix, offer valuable insights into the clique structure of a given graph, outperforming the conventional CTQW with the adjacency matrix Hamiltonian. Specifically, we conduct an in-depth analysis of CTQW applied to 4 special types of graphs, meticulously calculating the magnitudes of amplitude associated with different vertices. Our findings consistently reveal that the vertices belonging to the MC consistently exhibit the highest intensity at the frequency corresponding to the largest probability amplitude for these types of graphs. Considering the varying amplitudes of graph vertices, we propose an algorithm for determining the MC based on CTQW. We compare our algorithm with the simulated adiabatic bifurcation method, and the results indicate that our algorithm is parameter-independent and exhibits greater stability. © 2023, The Authors. All rights reserved.

关键词： Continuous time systems

来源：评论

学校读者我要写书评

暂无评论

Co‑packaged optics(CPO):status,challenges,and solutions

引用

Frontiers of Optoelectronics 2023年第1期16卷 1-40页

作者： Min Tan Jiang Xu Siyang Liu Junbo Feng Hua Zhang Chaonan Yao Shixi Chen Hangyu Guo Gengshi Han Zhanhao Wen Bao Chen Yu He Xuqiang Zheng Da Ming Yaowen Tu Qiang Fu Nan Qi Dan Li Li Geng Song Wen Fenghe Yang Huimin He Fengman Liu Haiyun Xue Yuhang Wang Ciyuan Qiu Guangcan Mi Yanbo Li Tianhai Chang Mingche Lai Luo Zhang Qinfen Hao Mengyuan Qin School of Optical and Electronic Information Huazhong University of Science and TechnologyWuhan 430074China Wuhan National Laboratory for Optoelectronics Huazhong University of Science and TechnologyWuhan 430074China Department of Electronic and Computer Engineering The Hong Kong University of Science and TechnologyHong KongChina HKUST Fok Ying Tung Research Institute Guangzhou 511462China The Hong Kong University of Science and Technology(Guangzhou) Guangzhou 511462China Chongqing United Micro-Electronics Center(CUMEC) Chongqing 401332China Hisense Broadband Multimedia Technologies Co. Ltd.Qingdao 266000China Institute of Microelectronics Chinese Academy of SciencesBeijing 100029China State Key Laboratory of Superlattices and Microstructures Institute of SemiconductorsChinese Academy of SciencesBeijing 100083China School of Microelectronics Xi’an Jiaotong UniversityXi’an 710049China Zhangjiang Laboratory Shanghai 201210China The State Key Laboratory of Advanced Optical Communication Systems and Networks Department of Electronic EngineeringShanghai Jiao Tong UniversityShanghai 200240China Huawei Technologies Co. Ltd.Shenzhen 440307China College of Computer National University of Defense TechnologyChangsha 410073China Institute of Computing Technology Chinese Academy of SciencesBeijing 100086China

Due to the rise of 5G,IoT,AI,and high-performance computing applications,datacenter trafc has grown at a compound annual growth rate of nearly 30%.Furthermore,nearly three-fourths of the datacenter trafc resides within *** conventional pluggable optics increases at a much slower rate than that of datacenter *** gap between application requirements and the capability of conventional pluggable optics keeps increasing,a trend that is *** optics(CPO)is a disruptive approach to increasing the interconnecting bandwidth density and energy efciency by dramatically shortening the electrical link length through advanced packaging and co-optimization of electronics and *** is widely regarded as a promising solution for future datacenter interconnections,and silicon platform is the most promising platform for large-scale *** international companies(e.g.,Intel,Broadcom and IBM)have heavily investigated in CPO technology,an inter-disciplinary research feld that involves photonic devices,integrated circuits design,packaging,photonic device modeling,electronic-photonic co-simulation,applications,and *** review aims to provide the readers a comprehensive overview of the state-of-the-art progress of CPO in silicon platform,identify the key challenges,and point out the potential solutions,hoping to encourage collaboration between diferent research felds to accelerate the development of CPO technology.

关键词： Co-packaged optics Silicon photonics High-performance computing Advanced packaging External laser Optical power delivery Co-simulation Standardization Transmitter Receiver

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：