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

22nd IEEE International Symposium on Parallel and Distributed Processing with Applications, ISPA 2024

作者： Shen, Jiexun Li, Dongfan Chen, Wanjun Xiao, Yong Kang, Guosheng Liu, Jianxun Peng, Zhenlian School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology HNUST Xiangtan China

ISBN: (纸本)9798331509712

With the rapid development of service computing technology, how to recommend the desirable Web APIs to developers from the large number of APIs is a challenge. The traditional methods based on collab.rative filtering are limited by data sparsity. With the support of multi-dimensional relational feature modeling, graph neural network-based methods are proposed to mitigate data sparsity, but their convolution nature may amplify the noise effect. Therefore, how to simultaneously reduce the impact of sparsity and noisy data has been an open question in the field of API recommendation. To address the problem, this paper proposes a self-supervised learning method based on multi-view hypergraph for Web API recommendation. First, the Mashup-API interaction graph is transformed into a hypergraph, and the hyperedges are used as intermediate hubs to transfer messages between nodes, maintaining the global collab.ration effect between Mashup and API nodes. Then, a multi-view strategy is adopted to generate embeddings of Mashups and APIs through information fusion, by which recommendation probability is derived by dot product between the embeddings of Mashups and Web APIs. To train the model parameters effectively, a self-supervised learning method is used to reduce the effect of noisy data to improve the embeddings. Extensive experiments are conducted on a real-world dataset, and the experimental results show that the proposed model outperforms the baselines. © 2024 IEEE.

关键词： Self-supervised learning

来源：评论

学校读者我要写书评

暂无评论

TH-SLP: Web Service Link Prediction Based on Topic-aware Heterogeneous Graph Neural Network

TH-SLP: Web Service Link Prediction Based on Topic-aware Het...

引用

2023 IEEE International Conference on Web services, ICWS 2023

作者： Peng, Qian Cao, Buqing Xie, Xiang Liu, Shanpeng Kang, Guosheng Liu, Jianxun Hunan University of Science and Technology Xiangtan School of Computer Science and Engineering Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hunan China

ISBN: (纸本)9798350304855

With the emergence of more and more Web services, finding suitable services becomes a difficult problem. Service link prediction is employed to disclose relationships among services, which facilitates the further development of service composition, selection, and recommendation. But the existing link prediction approaches simply utilize the structural features of the service network. In reality, the rich text content in service node description documents also carries latent but fine-grained semantics generated by multifaceted topic-aware factors, yet few efforts are committed to mining them. In this paper, we propose a Web service link prediction method based on a topic-aware heterogeneous graph neural network. Specifically, the method consists of two main layers, including the meta-path intra-decomposition and the meta-path inter-mergence. Meta-path intra-decomposition aims to mine the topic distribution of the meta-paths-based context while capturing fine-grained topic-aware semantics. Meta-path inter-mergence uniquely aggregates topic-aware factors according to the mined distribution and adopts a multifaceted attention mechanism to aggregate different meta-paths, enabling service nodes to generate multifaceted topic-aware embeddings that preserve not only the structure and but also the topic-aware semantics. In addition, a topic prior guidance regularization item is set up for quality assurance of multifaceted topic-aware embedding that depends on global knowledge of the unstructured text content in description documents. Experimental results on real datasets show that our proposed model outperforms other existing baselines methods in the link prediction task, successfully validating the effectiveness of our proposed method. © 2023 IEEE.

关键词： Semantics

来源：评论

学校读者我要写书评

暂无评论

A Code Completion Approach Combining Pointer Network and Transformer-XL Network 19th

A Code Completion Approach Combining Pointer Network and Tr...

引用

19th EAI International Conference on Collab.rative computing: Networking, Applications and Worksharing, Collab.rateCom 2023

作者： Zhang, Xiangping Liu, Jianxun Long, Teng Hu, Haize School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan411100 China Hunan Key Lab. for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan411100 China

ISBN: (纸本)9783031545207

Code completion is an integral component of modern integrated development environments, as it not only facilitates the software development process but also enhances the quality of software products. By leveraging large-scale codes to learn the probability distribution among code token units, deep learning methods have demonstrated significant improvements in the accuracy of token unit recommendations. However, the effectiveness of code completion with deep learning techniques is hindered by information loss. To alleviate the above problem, we proposed a code language model which combines the pointer network and Transformer-XL network to overcome the limitations of existing approaches in code completion. The proposed model takes as input the original code fragment and its corresponding abstract syntax tree and leverages the Transformer-XL model as the basis model for capturing long-term dependencies. Furthermore, we integrate a pointer network as a local component to predict the out-of-vocabulary words. The proposed method is evaluated on real PY150 and JS150 datasets. The comparative experimental results demonstrate the effectiveness of our model in improving the accuracy of the code completion task at the token unit level. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Probability distributions

来源：评论

学校读者我要写书评

暂无评论

Interactive Web API Recommendation for Mashup Development based on Light Neural Graph Collab.rative Filtering 26

Interactive Web API Recommendation for Mashup Development ba...

引用

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

作者： Xiang, Jiayan Chen, Wanjun Wang, Yang Liang, Bowen Liu, Zihao Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hnust Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China

ISBN: (纸本)9798350331684

With the development of Mashup technique, the number of Web APIs released on the Web continues to grow year by year. However, it is a challenging issue to find and select the desirable Web APIs among the large amount of Web APIs. Consequently, interactive Web API recommendation is used to alleviate the difficulty of service selection, when users or developers try to invoke Web APIs for solving their business requirements or software development requirements. Currently, there are several collab.rative filtering based approaches proposed for Web API recommendation, while their recommendation performance is limited on both optimality and scalab.lity. This paper proposes a light neural graph collab.rative filtering based Web API recommendation approach, named LNGCF. Specifically, LNGCF learns user and item embeddings by linearly propagating them on the user-item interaction graph, and uses the weighted summation of the embeddings learned at all layers as the final embedding. Such simple, linear, and neat model is much easier to implement and train. A set of experiments are conducted on a real-world dataset. Experimental results demonstrate the substantial improvements on both optimality and scalab.lity over the baselines. © 2023 IEEE.

关键词： Collab.rative filtering

来源：评论

学校读者我要写书评

暂无评论

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for API-Mashup Ecosystem 26

Towards Dynamic Evolutionary Analysis of ProgrammableWeb for...

引用

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

作者： Wang, Yang Xiang, Jiayan Cheng, Hangyu Chen, Wanjun Xiao, Yong Kang, Guosheng Hunan University of Science and Technology School of Computer Science and Engineering Xiangtan China Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Hnust Xiangtan China

ISBN: (纸本)9798350331684

With the wide adoption of Web APIs released on Internet, users tend to reuse them for business requirements or software development. Mashup is a useful technology for composing Web APIs into a new and value-added application. With the increasing number of Web APIs and Mashups, the API-Mashup ecosystem has emerged based on the invocation relationship between Mashups and Web APIs. In this paper, we take ProgrammableWeb, a typical API-Mashup ecosystem, as an example to investigate its dynamic evolutionary analysis. Although there have been some works on the API-Mashup ecosystem, they mainly focus on static analysis, i.e., the static characteristics of the API- Mashup ecosystem on a fixed time point. This paper conducts a comprehensive study on the dynamic evolutionary analysis of the API-Mashup ecosystem with a long time range from 2005 to 2021. First, we conduct a dynamic statistical analysis based on the API-Mashup ecosystem dataset. Next, we construct two cooperation networks, one between Web APIs, and the other between their categories. And the general characteristics of the two cooperation networks are presented. Finally, we investigate the derived cooperation networks from four perspectives: dynamic characteristics, degree distribution, betweenness centrality, and assortative mixing. Meanwhile, the corresponding insights are uncovered. Our work provides a foundation for visualization and understanding of the API-Mashup ecosystem from the timeline. © 2023 IEEE.

关键词： Ecosystems

来源：评论

学校读者我要写书评

暂无评论

Graph-based Multi-view Clustering for Web services 21

Graph-based Multi-view Clustering for Web services

引用

21st IEEE International Symposium on Parallel and Distributed Processing with Applications, 13th IEEE International Conference on Big Data and Cloud computing, 16th IEEE International Conference on Social computing and Networking and 13th International Conference on Sustainable computing and Communications, ISPA/BDCloud/SocialCom/SustainCom 2023

作者： Yang, Wang Zhenzhen, Yuan Guosheng, Kang Buqing, Cao Jianxun, Liu Yong, Xiao Hnust Xiangtan China Hunan University of Science and Technology Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering China

ISBN: (纸本)9798350329223

The number of Web services on the Internet has been steadily increasing in recent years due to their growing popularity. Under the big data environment, how to effectively manage Web services is of significance for service discovery, service recommendation, etc. It is widely studied that Web services clustering is an effective way for service management. However, most of the current Web service clustering only extracts the information of Web services for clustering from one view, such as Web service content descriptions, networks in which Web services participate, and so on. Extracting information from Web services only unilaterally will not be able to provide a three-dimensional and comprehensive description of Web services, which may diminish the effect of Web service clustering. In addition, some Web service resources will be wasted if other information of Web services is not used at the same time. We find that multi-view clustering can simultaneously consider multiple information of a data at the same time, and multiple information can complement and enhance each other according to the characteristics of multiview clustering. Therefore, in this paper, we apply Web services to graph-based multi-view clustering in multi-view clustering to improve the performance of Web service clustering by simultaneously considering multiple feature information about Web services and distributing different weights to different information in the clustering process. © 2023 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

BPMN++: Comprehensive Business Process Modeling for Industrial Internet Application 20

BPMN++: Comprehensive Business Process Modeling for Industri...

引用

20th IEEE International Symposium on Parallel and Distributed Processing with Applications, 12th IEEE International Conference on Big Data and Cloud computing, 12th IEEE International Conference on Sustainable computing and Communications and 15th IEEE International Conference on Social computing and Networking, ISPA/BDCloud/SocialCom/SustainCom 2022

作者： Cheng, Hangyu Kang, Guosheng Liu, Jianxun Wen, Yiping Cao, Buqing Wang, Zhen School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China Hnust Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China

ISBN: (纸本)9781665464970

Business process management is the end-to-end business process modeling, analysis, and optimization to achieve business goals. Business Process Modeling Notation (BPMN) is usually used to represent business process models. However, BPMN cannot support the intuitive modeling for some typical tasks in complex business scenarios of the Industrial Internet context, increasing the communication cost between modelers and business personnel. The current solutions try to extend the attributes of BPMN elements with annotations, but a large number of annotations makes business process models complex and cumbersome. This paper proposes to extend new business process modeling elements for Industrial Internet application scenarios based on BPMN extension mechanism, generating an extended business process modeling language, namely BPMN++. And an extended process modeling tool is implemented, which is availab.e online. A case study over a real-world Industrial Internet process validates the usefulness of this extension mechanism and the well understandability of business process models. © 2022 IEEE.

关键词： Modeling languages

来源：评论

学校读者我要写书评

暂无评论

Graph for Science: From API based Programming to Graph Engine based Programming for HPC

arXiv

引用

arXiv 2023年

作者： Zhang, Yu Wang, Zixiao Zhao, Jin Guo, Yuluo Yu, Hui Huang, Zhiying Shi, Xuanhua Liao, Xiaofei National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan China

Modern scientific applications predominantly run on large-scale computing platforms, necessitating collab.ration between scientific domain experts and high-performance computing (HPC) experts. While domain experts are often skilled in customizing domain-specific scientific computing routines, which often involves various matrix computations, HPC experts are essential for achieving efficient execution of these computations on large-scale platforms. This process often involves utilizing complex parallel computing libraries tailored to specific matrix computation scenarios. However, the intricate programming procedure and the need for deep understanding in both application domains and HPC poses significant challenges to the widespread adoption of scientific computing. In this research, we observe that matrix computations can be transformed into equivalent graph representations, and that by utilizing graph processing engines, HPC experts can be freed from the burden of implementing efficient scientific computations. Based on this observation, we introduce a graph engine-based scientific computing (Graph for Science) paradigm, which provides a unified graph programming interface, enabling domain experts to promptly implement various types of matrix computations. The proposed paradigm leverages the underlying graph processing engine to achieve efficient execution, eliminating the needs for HPC expertise in programming large-scale scientific applications. We evaluate the performance of the developed graph compute engine for three typical scientific computing routines. Our results demonstrate that the graph engine-based scientific computing paradigm achieves performance comparable to the best-performing implementations based on existing parallel computing libraries and bespoke implementations. Importantly, the paradigm greatly simplifies the development of scientific computations on large-scale platforms, reducing the programming difficulty for scientists and facilitating b

关键词： Application programming interfaces (API)

来源：评论

学校读者我要写书评

暂无评论

Joint QoS Prediction for Web services based on Deep Fusion of Features

引用

IEEE Transactions on Network and Service Management 2023年 1-1页

作者： Ding, Linghang Liu, Jianxun Kang, Guosheng Xiao, Yong Cao, Buqing Hunan Provincial Key Lab. for Services Computing and Novel Software Technology and School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

In order to solve the problem of insufficient accuracy of Web service QoS prediction, a joint QoS prediction method for Web services based on the deep fusion of features was proposed by considering the hidden environmental preference information in QoS and the common characteristics of multi-class QoS. QoS data was modeled as user-service bipartite graph at first, then, multi-component graph convolution neural network was used for feature extraction and mapping, and weighted fusion method was used for the same dimensional mapping of multi-class of QoS features. Subsequently, the attention factor decomposition machine was used to extract the first-order features, second-order interactive features and high-order interactive features of the mapped feature vector. Finally, the results of each part were combined to achieve the joint QoS prediction. The experimental results show that the proposed method is superior to the existing QoS prediction methods in terms of root mean square error (RMSE) and average absolute error (MAE). IEEE

关键词： Feature extraction

来源：评论

学校读者我要写书评

暂无评论

Variational Bayes for Federated Continual Learning

arXiv

引用

arXiv 2024年

作者： Yao, Dezhong Li, Sanmu Dai, Yutong Xu, Zhiqiang Hu, Shengshan Zhao, Peilin Sun, Lichao The National Engineering Research Center for Big Data Technology and System Services Computing Technology and System Lab. Cluster and Grid Computing Lab. School of Computer Science and Technology Huazhong University of Science and Technology Wuhan430074 China Lehigh University PA18015 United States Mohamed bin Zayed University of Artificial Intelligence United Arab Emirates Tencent AI Lab. Shenzhen China

Federated continual learning (FCL) has received increasing attention due to its potential in handling real-world streaming data, characterized by evolving data distributions and varying client classes over time. The constraints of storage limitations and privacy concerns confine local models to exclusively access the present data within each learning cycle. Consequently, this restriction induces performance degradation in model training on previous data, termed "catastrophic forgetting". However, existing FCL approaches need to identify or know changes in data distribution, which is difficult in the real world. To release these limitations, this paper directs attention to a broader continuous framework. Within this framework, we introduce Federated Bayesian Neural Network (FedBNN), a versatile and efficacious framework employing a variational Bayesian neural network across all clients. Our method continually integrates knowledge from local and historical data distributions into a single model, adeptly learning from new data distributions while retaining performance on historical distributions. We rigorously evaluate FedBNN’s performance against prevalent methods in federated learning and continual learning using various metrics. Experimental analyses across diverse datasets demonstrate that FedBNN achieves state-of-the-art results in mitigating forgetting. Copyright © 2024, The Authors. All rights reserved.

关键词： Digital storage

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：