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

23rd IEEE International Conference on High Performance computing and Communications, 7th IEEE International Conference on data Science and Systems, 19th IEEE International Conference on Smart City and 7th IEEE International Conference on Dependability in Sensor, Cloud and big data Systems and Applications, HPCC-DSS-SmartCity-DependSys 2021

作者： Shi, Jia Jin, Hai Xie, Xia National Engineering Research Center for Big Data Technology and System School of Computer Science and Technology Huazhong University of Science and Technology Services Computing Technology and System Lab Cluster and Grid Computing Lab Wuhan China School of Computer Science and Technology Hainan University Haikou China

ISBN: (纸本)9781665494571

The real academic network belongs to a heterogeneous network, therefore, for the link prediction tasks, some information on the network may be lost if only using homogeneous network methods. In order to make good use of the rich semantic information in a heterogeneous network for better predicting the cooperative relationship between scholars, this paper proposes a cooperative relationship prediction (CoRP) model. The CoRP model includes the following three steps. Firstly, a structural feature extraction module is designed based on meta path by using the similarity metric function to measure the meta path similarity between scholars. Secondly, to overcome the defects that the existing methods usually ignore the attribute information on nodes, three attribute feature presentation functions are constructed to fully utilize the attribute information of scholars in the academic network. In the end, a machine learning classifier which combines the structural similarity and attribute similarity is utilized to learn each attribute feature and complete the task of cooperative relationship prediction. The experimental results reveal that compared with the benchmark method, the proposed method has better performance and interpretability with improvement from 3% to 10% of AUC value for the AMiner academic data set. © 2021 IEEE.

关键词： Measurement Smart cities Semantics Machine learning Benchmark testing Predictive models Feature extraction

来源：评论

学校读者我要写书评

暂无评论

GraSU: A fast graph update library for fpga-based dynamic graph processing 21

GraSU: A fast graph update library for fpga-based dynamic gr...

引用

2021 ACM/SIGDA International Symposium on Field-Programmable Gate Arrays, FPGA 2021

作者： Wang, Qinggang Zheng, Long Huang, Yu Yao, Pengcheng Gui, Chuangyi Liao, Xiaofei Jin, Hai Jiang, Wenbin Mao, Fubing National Engineering Research Center for Big Data Technology and System Service Computing Technology and System Lab Cluster and Grid Computing Lab Huazhong University of Science and Technology China

ISBN: (纸本)9781450382182

Existing FPGA-based graph accelerators, typically designed for static graphs, rarely handle dynamic graphs that often involve substantial graph updates (e.g., edge/node insertion and deletion) over time. In this paper, we aim to fill this gap. The key innovation of this work is to build an FPGA-based dynamic graph accelerator easily from any off-the-shelf static graph accelerator with minimal hardware engineering efforts (rather than from scratch). We observe\em spatial similarity of dynamic graph updates in the sense that most of graph updates get involved with only a small fraction of vertices. We therefore propose an FPGA library, called GraSU, to exploit spatial similarity for fast graph updates. GraSU uses a differential data management, which retains the high-value data (that will be frequently accessed) in the specialized on-chip UltraRAM while the overwhelming majority of low-value ones reside in the off-chip memory. Thus, GraSU can transform most of off-chip communications arising in dynamic graph updates into fast on-chip memory accesses. Our experiences show that GraSU can be easily integrated into existing state-of-the-art static graph accelerators with only 11 lines of code modifications. Our implementation atop AccuGraph using a Xilinx Alveo#8482;\U250 board outperforms two state-of-the-art CPU-based dynamic graph systems, Stinger and Aspen, by an average of 34.24× and 4.42× in terms of update throughput, improving further overall efficiency by 9.80× and 3.07× on average. © 2021 ACM.

关键词： Field programmable gate arrays (FPGA)

来源：评论

学校读者我要写书评

暂无评论

Fast Latent Factor Analysis via a Fuzzy PID-Incorporated Stochastic Gradient Descent Algorithm

arXiv

引用

arXiv 2023年

作者： Li, Jinli Yuan, Ye School of Computer Science and Technology Chongqing University of Posts and Telecommunications Chongqing400065 China Chongqing Key Laboratory of Big Data and Intelligent Computing Chongqing Engineering Research Center of Big Data Application for Smart Cities Chongqing Institute of Green and Intelligent Technology Chinese Academy of Sciences Chongqing400714 China College of Computer and Information Science Southwest University Chongqing400715 China

A high-dimensional and incomplete (HDI) matrix can describe the complex interactions among numerous nodes in various big data-related applications. A stochastic gradient descent (SGD)-based latent factor analysis (LFA) model is remarkably effective in extracting valuable information from an HDI matrix. However, such a model commonly encounters the problem of slow convergence because a standard SGD algorithm learns a latent factor relying on the stochastic gradient of current instance error only without considering past update information. To address this critical issue, this paper innovatively proposes a Fuzzy PID-incorporated SGD (FPS) algorithm with two-fold ideas: 1) rebuilding the instance learning error by considering the past update information in an efficient way following the principle of PID, and 2) implementing hyper-parameters and gain parameters adaptation following the fuzzy rules. With it, an FPS-incorporated LFA model is further achieved for fast processing an HDI matrix. Empirical studies on six HDI datasets demonstrate that the proposed FPS-incorporated LFA model significantly outperforms the state-of-the-art LFA models in terms of computational efficiency for predicting the missing data of an HDI matrix with competitive accuracy. Copyright © 2023, The Authors. All rights reserved.

关键词： Matrix algebra

来源：评论

学校读者我要写书评

暂无评论

Event Argument Extraction with Two-Dimensional Enhanced Fusion Mechanism

引用

Computer Engineering and Applications 2025年第10期61卷 111-119页

作者： Wang, Luxiang Chen, Yanping Huang, Hui Huang, Ruizhang Qin, Yongbin Engineering Research Center of Ministry of Education for Text Computing and Cognitive Intelligence School of Computer Science and Technology Guizhou University Guiyang550025 China State Key Laboratory of Public Big Data Guizhou University Guiyang550025 China

Addressing the lack of interaction between trigger and arguments, and the lack of interaction within channels in existing studies of event argument extraction, this paper proposes a two-dimensional enhanced fusion mechanism for event argument extraction (W2-ARG) that incorporates a 2D enhanced fusion method. It inserts identifiers on both sides of a trigger word in a sentence, which encodes information about the event type. In the learning process, it is effective to enhance the interaction between trigger and argument, and encode the trigger separately to highlight its information in the sentence. The event argument extraction is implemented as a two-dimensional representation of label prediction. It has the advantage to capture semantic interactions of words at different distances through dilated convolution. Subsequently, a channel attention module is applied to enhance the interactions within the channel to strengthen the information transfer within the channel. Finally, the Laplace operator is utilized to highlight the positional features of event arguments in the semantic space to improve the performance. The proposed model is experimented on the ACE05-EN and ERE-EN datasets. Experimental results show clear performance improvement of the proposed model compared with other event argument extraction methods. © 2025 Journal of Computer Engineering and Applications Beijing Co., Ltd.;Science Press. All rights reserved.

关键词： BERT channel attention event argument extraction Laplace operator sentence planarization representation

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Lightweight Transformer Network and Self-supervised Task for Kinship Verification 8

Lightweight Transformer Network and Self-supervised Task for...

引用

8th IEEE International Conference on Computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Li, Yunwei Li, Danyang Dong, Lingyun Chen, Xiaopan School of Computer and Information Engineering Henan University Kaifeng China Henan Key Laboratory of Big Data Analysis and Processing Henan University Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Kinship verification is one of the interesting and critical problems in computer vision research, with significant progress in the past decades. Meanwhile, Vision Transformer (VIT) has recently achieved impressive success in many domains, including object detection, image recognition, and semantic segmentation, among others. Most of the previous work on kinship verification are based on convolutional or recurrent neural networks. Compared with the local processing of images like convolutions, transformers can effectively understand and process images globally. However, due to overuse, there are many Transformer layers of fully connected layers, and VIT speed is still an issue. Therefore, in this paper, inspired by the recent success of Transformer models in vision tasks, we propose a Transformer-based kinship verification for training and optimizing kinship verification models. We first train the basic vision transformer (VIT-B) with 12 transformer layers, then we reduce the transformer layers to 6 layers, namely VIT-S (Small Vit) and 4 layers, namely VIT-T (Tiny Vit), to make a tradeoff between optimization accuracy and efficiency. As the first attempt to apply Transformer to the kinship verification task, it provides a feasible strategy for kinship research topics and verifies the effectiveness of the method in terms of the accuracy of the experimental results. © 2022 IEEE.

关键词： Image recognition

来源：评论

学校读者我要写书评

暂无评论

Multi-Scale Clinical-Guided Binocular Fusion Framework for Predicting New-Onset Hypertension Over a Four-Year Period

Multi-Scale Clinical-Guided Binocular Fusion Framework for P...

引用

IEEE International Symposium on Biomedical Imaging

作者： Haoshen Li Zifan Chen Jie Zhao Heyun Chen Hexin Dong Mingze Yuan Bin Dong Li Zhang Center for Data Science Peking University China National Engineering Laboratory for Big Data Analysis and Applications Peking University China Peking University Changsha Institute for Computing and Digital Economy China Beijing International Center for Mathematical Research Peking University China Center for Machine Learning Research Peking University China

ISBN: (数字)9798350313338

ISBN: (纸本)9798350313345

Hypertension is a major global health concern, linked to various cardiovascular diseases and associated with distinct ocular manifestations. While recent advances in artificial intelligence have enabled accurate diagnosis of current hypertension through fundus images, predicting the future onset of hypertension remains an uncharted domain. In this study, we introduce the multi-scale clinical-guided binocular fusion framework (MCBO), designed to predict the likelihood of developing hypertension within the next four years. MCBO uniquely integrates left and right fundus images and clinical data, utilizing a shared-weight multi-stage Transformer-based encoder. Our multi-scale clinical-guided module (MCM) ensures image feature extraction is clinically contextualized based on clinical information, and our binocular fusion module (BFM) fuses binocular information. Comparative performance against seven baseline models establishes MCBO’s supremacy, with improvements of 6.7% in Area Under Curve (AUC), 6.9% in Accuracy (ACC), 5.1% in Sensitivity (SEN) and 5.5% in Specificity (SPE). This approach offers a promising avenue for proactive hypertension management, underscoring the potential of integrating Deep Learning with clinical data for enhanced healthcare outcomes. Our code is available at https://***/HaoshenLi/MCBO.

关键词： Hypertension Deep learning Accuracy Sensitivity Codes Fuses Feature extraction

来源：评论

学校读者我要写书评

暂无评论

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorithm 19th

NOBGP: A Novel Optimized Balanced Graph Partitioning Algorit...

引用

19th CCF Conference on Computer Supported Cooperative Work and Social computing, ChineseCSCW 2024

作者： Chen, Jiebin Hu, Ziqiang Ye, Renjie Zhang, Qishan Guo, Kun College of Computer and Data Science Fuzhou University Fuzhou350108 China Engineering Research Center of Big Data Intelligence Ministry of Education Fuzhou350108 China Fujian Key Laboratory of Network Computing and Intelligent Information Processing Fuzhou University Fuzhou350108 China Xianda College of Economics and Humanities Shanghai International Studies University Shanghai China

ISBN: (纸本)9789819623723

Large-scale graphs have become prevalent with the advent of the big data era. Distributed graph computing systems are commonly used for processing and analyzing large-scale graphs, with graph partitioning being a key prerequisite for their efficient computation. Graph partitioning aims to balance the load across partitions while minimizing the number of cut-edges. Moreover, it should achieve high efficiency and scalability. However, the existing popular graph partitioning algorithms do not fully take into account the internal topology of real-world graphs, which affects the final partition quality and convergence. Meanwhile, they easily fall into the local optimum due to partition load constraints. This paper introduces a Novel Optimized Balanced Graph Partitioning algorithm (NOBGP). First, we propose an initialization strategy based on label propagation of core vertices to achieve initial partitions with good locality and accelerate convergence. Second, we optimize the label propagation process to ensure balanced partitions and propose a probability-based disruption strategy to avoid the local optimum. We implement NOBGP on the distributed graph computing framework GraphX. Extensive experimental results on real-world graphs show that the proposed algorithm is scalable and performs better than the existing algorithms. We also run PageRank and Louvain applications using the graph partitioning results to demonstrate the efficiency of our algorithm. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2025.

关键词： Graph algorithms

来源：评论

学校读者我要写书评

暂无评论

Point-Level and Set-Level Deep Representation Learning for Cross-Modal Person Re-identification 8

Point-Level and Set-Level Deep Representation Learning for C...

引用

8th IEEE International Conference on Computer and Communications, ICCC 2022

作者： Hu, Jihui Ye, Pengfei Li, Danyang Dong, Lingyun Chen, Xiaopan Zhu, Xiaoke School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing Kaifeng China Henan University Henan Engineering Research Center of Intelligent Technology and Application China

ISBN: (纸本)9781665450515

In practice, significant modality differences usually exist between visible and infrared images, which makes visible-infrared Person Re-Identification (VI-ReID) a challenging research task. Due to the existing influence of pose variation, background changes, and occlusion, there are often outlier samples within the set of images from the same person. These outlier samples can adversely affect the process of learning the cross-modal matching model. The existing VI-ReID methods mainly focus on learning cross-modal feature representation by using image-level discriminant constraints, i.e., the distance between the truly-matching cross-modal images should be smaller than that between wrong-matching cross-modal images. However, most of these methods ignore the adverse influence caused by outliers. To solve the above problems, we proposed a Point-level and Set-level Deep Representation Learning (PSDRL) approach for VI-ReID in this paper. By using the set-level constraint in the process of deep representation learning, the discrepancy between visible and infrared modalities can be decreased, and the adverse effect of outliers can be weakened. By employing the image-level constraint, the discriminability of the obtained deep feature representations can be improved. Extensive experiments are conducted on the publicly available cross-modal Person Re-Identification datasets, including SYSU-MM01 and RegDB. Experimental results demonstrate the effectiveness of the proposed approach. © 2022 IEEE.

关键词： Infrared imaging

来源：评论

学校读者我要写书评

暂无评论

Semi-supervised Segmentation and Quantization Algorithm for Infarct Size Measurement of Rat Heart Sections 8

Semi-supervised Segmentation and Quantization Algorithm for ...

引用

8th IEEE International Conference on Computer and Communications, ICCC 2022

作者： Zhu, Xiaoke Cai, Yulong Chen, Xiaopan Hu, Qi Dong, Lingyun Yuan, Caihong School of Computer and Information Engineering Henan University Kaifeng China Henan University Henan Key Laboratory of Big Data Analysis and Processing Kaifeng China Henan Engineering Research Center of Intelligent Technology and Application Henan University China

ISBN: (纸本)9781665450515

Segmentation of rat heart section images and infarct area quantization are essential components of infarct size measurement in processing data from animal experiments on ischemic heart disease. Previously, the task of measuring the infarct size of rat heart sections was performed manually by experienced researchers, which was very costly and time-consuming. In this paper, we propose a two-stage semi-supervised approach to solve the task of ischemic heart infarct size calculation in images of rat section images. The approach uses a semi-supervised semantic segmentation model and a semi-automated quantization algorithm to separate the differently stained regions of rat heart sections. We demonstrate the results of the approach on a rat heart section dataset, and experiments on this dataset emphasize the effectiveness of our approach compared to other methods. © 2022 IEEE.

关键词： Semantic Segmentation

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：