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

CCF 17th International Conference on Service Science, CCF ICSS 2024

作者： Li, Wen Ren, Hongshuai Nie, Yamei Liu, Zihao 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: (纸本)9789819757596

RapidAPI serves as a marketplace and management platform that integrates a wide range of Web APIs, offering developers access to a rich pool of API resources. More and more researchers are delving into ways to maximize the value created by leveraging these resources. Thus, acquiring the Web API data and knowing the details is of significance for researchers and ordinary users. In this paper, we propose the methodology of crawling Web APIs from RapidAPI (https://***/hub) and provide rich visualizations and statistical analysis for the crawled dataset. The crawling code and the crawled dataset are open for public access (https://***/IntelligentServicelab.RESTful-API-Crawler) so that researchers and users can acquire them with no effort. Moreover, the use cases of RESTful Web APIs are provided as a usage reference for users and developers. © The Author(s), under exclusive license to Springer Nature Singapore Pte Ltd. 2024.

关键词： Web crawler

来源：评论

学校读者我要写书评

暂无评论

Multi-view Hypergraph-based Self-supervised Learning Model for Web API Recommendation 22

Multi-view Hypergraph-based Self-supervised Learning Model f...

引用

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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 Search Method Incorporating Code Annotations 19th

A Code Search Method Incorporating Code Annotations

引用

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

作者： Li, Qi Liu, Jianxun Zhang, Xiangping School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan411201 China Hunan Key Lab for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan411201 China

ISBN: (纸本)9783031545207

Code search is a technique for users to retrieve code snippets from the Code base using natural language, which is dedicated to retrieve the target code accurately and quickly to improve the efficiency of software development. The deep learning based code search technique greatly improves the accuracy of search by learning the relationship between code and query statements. Since it relies on the extracted code features, acquiring more code features is the key to quickly improve the search performance. However, most of the previous works have not taken code annotations into consideration. In this paper, we take code annotations as code features and apply them to code search, which is named ICA-CS (Code Search that Incorporates Code Annotations). In the method, firstly, the code features are embedded to get the corresponding vector representation. It is then processed by bidirectional LSTM (Long Short-Term Memory) network or multi-head attention respectively, followed by features fusion. And finally, the model is trained by joint embedding and using the minimised ranking loss function. As the experimental results show, on the evaluation metric MRR (mean reciprocal rank) compared to the state-of-the-art models DeepCS, SAN-CS, CARLCS-CNN and SelfAtt, the proposed model improves 48.96%, 17.11%, 41.01% and 13.07%, respectively. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Long short-term memory

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Enrich Code Search Query Semantics with Raw Descriptions 19th

Enrich Code Search Query Semantics with Raw Descriptions

引用

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

作者： Liu, Xiangzheng Liu, Jianxun Hu, Haize Liu, Yi School of Computer Science and Engineering Hunan University of Science and Technology Hunan Xiangtan China Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Hunan Xiangtan China

ISBN: (纸本)9783031545207

Code search can recommend relevant source code according to the development intention (query statement) of the demander, thereby improving the efficiency of software development. In the research of deep code search model, code description is used to replace query sentences for training. However, the heterogeneity existing between the query statement and the code description will seriously affect the accuracy of the code search model. In order to make up for the shortcomings of code search, this paper proposes a sentence-integrated query expansion method—SIQE. Unlike previous query expansion methods that focus on word-level expansion, SIQE uses the entire code description fragment as the source of query expansion. And by learning the mapping relationship between the query statement and the code description, the heterogeneity problem between them is compensated. In order to verify the effect of the proposed model in code search tasks, the article conducts code search experiments and analyzes on two languages: python and java. Experimental results show that, compared with the baseline model, SIQE has higher code search results. Therefore, the SIQE model can effectively improve the search effect of query statements, improve the accuracy of code search, and further improve the development of software engineering. © ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering 2024.

关键词： Deep learning

来源：评论

学校读者我要写书评

暂无评论

Massively parallel algorithms for fully dynamic all-pairs shortest paths

引用

Frontiers of Computer Science 2024年第4期18卷 201-203页

作者： Chilei WANG Qiang-Sheng HUA Hai JIN Chaodong ZHENG National Engineering Research Center for Big Data Technology and System Services Computing Technology and System LabCluster and Grid Computing LabSchool of Computer Science and TechnologyHuazhong University of Science and TechnologyWuhan 430074China State Key Laboratory for Novel Software Technology Nanjing UniversityNanjing 210023China

1 Introduction In recent years,the Massively Parallel Computation(MPC)model has gained significant ***,most of distributed and parallel graph algorithms in the MPC model are designed for static graphs[1].In fact,the graphs in the real world are constantly *** size of the real-time changes in these graphs is smaller and more *** graph algorithms[2,3]can deal with graph changes more efficiently[4]than the corresponding static graph ***,most studies on dynamic graph algorithms are limited to the single machine ***,a few parallel dynamic graph algorithms(such as the graph connectivity)in the MPC model[5]have been proposed and shown superiority over their parallel static counterparts.

关键词： dynamic shortest gained

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：