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

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

来源：评论

学校读者我要写书评

暂无评论

A One-Dimensional Residual Network and Physical Fitness-Based Exercise Prescription Recommendation Method 10

A One-Dimensional Residual Network and Physical Fitness-Base...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalab.e Cloud, CSCloud-EdgeCom 2023

作者： Fan, Runqing Peng, Zhenlian Cao, Buqing Liu, Jianxun Che, Peng Chen, Tieping Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In the context of the national big data strategy, physical fitness test data has become one of the main influencing factors in guiding and promoting the participation of the population in sports and fitness. Recommending exercise prescriptions based on national physical fitness test data has become an important research topic. However, currently, there is little research on how to accurately use computer data processing technology to recommend exercise prescriptions based on physical fitness test data. In this study, we propose a ResNet-based Exercise Prescription (ResNet-EP) method that utilizes one-dimensional residual neural network technology to recommend exercise prescriptions based on physical fitness testing data. This method comprehensively analyzes physical fitness testing data and exercise prescription data and realizes the automatic recommendation of exercise prescriptions. Experimental results on a real dataset demonstrate that the ResNet-EP model outperforms other comparison models in terms of precision (79.98%), recall (83.73%), and F1 score (81.81%). This study provides novel insights into the combination of physical fitness testing and exercise. © 2023 IEEE.

关键词： Machine learning

来源：评论

学校读者我要写书评

暂无评论

A missing physical fitness test data classification method based on MLP 10

A missing physical fitness test data classification method b...

引用

10th IEEE International Conference on Cyber Security and Cloud computing and 9th IEEE International Conference on Edge computing and Scalab.e Cloud, CSCloud-EdgeCom 2023

作者： Che, Peng Peng, Zhenlian Cao, Buqing Liu, Jianxun Chen, Tieping Fan, Runqing Hunan University of Science and Technology School of Computer Science and Engineering Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Xiangtan China Hunan University of Science and Technology School of Physical Education Xiangtan China

ISBN: (纸本)9798350312461

In recent years, the physical health status of college students have been attached by the country and all universities. Much effort is spent every year to conduct physical health tests, generating a large amount of physical fitness data. Due to some irresistible reasons, such as entering incorrect data or students being unable to participate in some physical fitness programs, missing data exists in the physical fitness test, and the calculation of total points according to the existing rules of weighted summation may lead to inaccurate classification of some students grades. To this end, a classification method based on physical fitness test data with missing items is proposed in this paper. Firstly, the method collects the raw data set and constructs a structured data set. Then, the MLP method is used to construct a classifier model to classify the test data set with missing items. Finally, compared experiments are conducted with the training model constructed by GaussianNB, SVM and XGBoost and the results show that the classification effect of MLP is excellent, and the accuracy of classification can reach 93.29 %. © 2023 IEEE.

关键词： Classification (of information)

来源：评论

学校读者我要写书评

暂无评论

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

来源：评论

学校读者我要写书评

暂无评论

Evolution of Web API Cooperation Network via Exploring Community Structure and Popularity

IEEE Transactions on Artificial Intelligence

引用

IEEE Transactions on Artificial Intelligence 2024年第12期5卷 6659-6671页

作者： Kang, Guosheng Wang, Yang Liu, Jianxun Cao, Buqing Xiao, Yong Xu, Yu Hunan University of Science and Technology Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology School of Computer Science and Engineering Xiangtan411201 China University of Cambridge Cambridge Baker Systems Genomics Initiative British Heart Foundation Cardiovascular Epidemiology Unit Department of Public Health and Primary Care CambridgeCB1 8RN United Kingdom

With the growing popularity of the Internet, Web applications have become increasingly essential in our daily lives. Web application programming interfaces (Web APIs) play a crucial role in facilitating interaction between applications. However, most Web service platforms are suffering from the imbalance of Web services now, many services of good quality but low popularity are difficult to be invoked even once and do not create direct connections with the users. Some graph-based Web service recommendation methods also often present a long-tailed distribution of recommended Web services due to limited Mashup-API invocation relationships. To relieve this problem and promote service recommendation, in this article, we propose a community structure and popularity-based approach by constructing an evolving cooperation network for Web APIs. We leverage the Louvain algorithm in community detection to assign community structure to each Web API and consider both the popularity and community structure in constructing the network. By optimizing the Barabαsi-Albert (BA) evolving network model, we demonstrate that our approach outperforms the BA, Bianconi-Barabαsi (BB), and popularity-similarity optimization (PSO) models in Web service clustering. Based on our proposed evolutionary network model for the evolutionary extension of API cooperation network and used for downstream Web service recommendation tasks, the experimental results also show that our recommended approach outperforms some other baseline models for Web service recommendation. © 2020 IEEE.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

Interactive Web API Recommendation via Exploring Mashup-API Interactions and Functional Description

Interactive Web API Recommendation via Exploring Mashup-API ...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Wanjun Chen Qiqi Chen Jiexun Shen Guosheng Kang Jianxun Liu Buqing Cao Lihong Zhang 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: (数字)9798350349184

ISBN: (纸本)9798350349191

With the advance of service computing technology, the number of Web APIs has risen dramatically over the Internet. Users tend to use Web APIs to achieve their business needs. However, it is difficult for users to find and select the desirable ones due to the plethora of Web APIs. To address this problem, some collab.rative filtering-based Web API recommendation methods have been proposed even though their performance is still far from satisfaction, since they only rely on Mashup-API interactions and feature interactions are not considered in the recommendation model. To further improve the recommendation performance, this paper proposes an interactive Web API recommendation method via exploring both Mashup-API interactions and functional description documents of Mashups and Web APIs. Specifically, LightGCN is employed to derive the node representations for the Mashup-API interaction graph, and BERT model is used for the text representations of functional description documents. Furthermore, the two presentations of both the Mashup and Web API are concatenated as the input of ANFM (Attentional Neural Factorization Machine) model, in which low and high-order feature interactions are fully modeled and the weights of feature interactions are trained by attention mechanism. Solid experiments are conducted over a real-world dataset and the experimental results indicate that the proposed method outperforms the baseline methods.

关键词： Attention mechanisms Federated learning Mashups Computational modeling Semantics Neural networks Service computing

来源：评论

学校读者我要写书评

暂无评论

JMF-SS: Joint Matrix Factorization for Web API Recommendation with Mashup-Mashup Similarities and API-API Similarities

JMF-SS: Joint Matrix Factorization for Web API Recommendatio...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Lihong Zhang Jing He Yamei Nie Xiaokang Zhou Qiqi Chen Guosheng Kang 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: (数字)9798350349184

ISBN: (纸本)9798350349191

With the development of service computing technology, the number of publicly availab.e Web APIs online has increased dramatically. Developers tend to use Web APIs to implement their software development requirements. However, due to the large number of Web APIs, how to select the appropriate Web API from the huge resource library for Mashup development has become a challenge. To solve this problem, some researchers have proposed Web API recommendation methods based on collab.rative filtering or matrix factorization. However, the Web API recommendation performance is still limited due to the reliance on Mashup- API interaction and the ignorance of Mashup and Web API description documents. Moreover, the Mashup-API interaction matrix is extremely sparse, resulting in low accuracy in matrix factorization and collab.rative filtering. To further improve the recommendation performance, we propose a novel joint matrix factorization method for the Mashup-API interaction matrix by incorporating the Mashup-Mashup similarity matrix and the API-API similarity matrix. A set of experiments are conducted on a real-world dataset, and the experimental results show that the proposed method outperforms the baselines.

关键词： Measurement Accuracy Federated learning Mashups Collab.rative filtering Service computing Libraries

来源：评论

学校读者我要写书评

暂无评论

A General Complementary API Recommendation Framework based on Learning Model

A General Complementary API Recommendation Framework based o...

引用

IEEE International Conference on Web services (ICWS)

作者： Qiqi Chen Guosheng Kang Yamei Nie Jianxun Liu Buqing Cao HNUST Hunan Provincial Key Lab. for Services Computing and Novel Software Technology Xiangtan China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

With the advancement of service computing technology, the Internet has witnessed an exponential proliferation of Web APIs. However, the selection of suitable APIs from this vast pool for Mashup creation poses a great challenge for users. Various Web API recommendation methods have been proposed to address this issue, aiming to simplify the complex selection process. Despite these efforts, limited studies have been conducted on complementary function recommendation. In this context, a general complementary Web API recommendation framework based on a learning model, named CoWAR, is designed to recommend complementary Web APIs tailored for Mashup creation, based on the user’s selected Web APIs. Specifically, we propose a data lab.ling algorithm to generate the lab.led dataset based on Mashup-API interactions derived from historical Mashups and Web APIs. Additionally, we employ BERT model to generate representation vectors of Web APIs based on the functionality description documents. Subsequently, we utilize SANFM (Self-Attentional Neural Factorization Machines) to train the complementary Web API recommendation model with the lab.led sample dataset based on representation vectors of Web APIs. To the best of our knowledge, this is the first work addressing the complementary function recommendation problem with a learning model. By conducting a set of experiments over a real-world dataset, the effectiveness of the proposed approach is validated. The experimental results demonstrate that the learning model outperforms the traditional machine learning-based models and several deep learning-based models.

关键词： Training Measurement Mashups Service computing Vectors Data models lab.ling Context modeling

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

International Symposium on Parallel and Distributed Processing with Applications, ISPA

作者： Jiexun Shen Dongfan Li Wanjun Chen Yong Xiao Guosheng Kang Jianxun Liu Zhenlian Peng 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

ISBN: (纸本)9798331509729

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.

关键词： Knowledge engineering Mashups Noise Neural networks Collab.ration Service computing Self-supervised learning Feature extraction Data models Noise measurement

来源：评论

学校读者我要写书评

暂无评论

Online Course Recommendation by Exploring User Interaction and Course Description

Online Course Recommendation by Exploring User Interaction a...

引用

International Conference on Computer Supported Cooperative Work in Design

作者： Weike Zhou Xiaokang Zhou Jing He Yamei Nie Qiqi Chen Guosheng Kang 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: (数字)9798350349184

ISBN: (纸本)9798350349191

With the wide use of Massive Open Online Courses (MOOCs) and online education, the large number and variety of educational resources on the online course open platform make it difficult for users to choose, and the requirements for course recommendation algorithms and model performance are getting higher and higher. The existing course recommendation algorithms often ignore the interactive information between n learners and courses and the course descriptions, resulting in poor recommendation performance. To solve the problems above, our work proposes an online course recommendation approach via exploring user interactions and course description documents. Specifically, LightGCN model is used to represent the user-course interaction graph to derive the structural embeddings of users and courses. Moreover, BERT model is used to represent the course description documents to derive the description embeddings of courses. Based on the three embeddings, ANFM (Attention Neural Factorization Machine) model is applied to perform online course recommendation by modeling low-order and high-order feature interactions, and learning the weights of the feature interactions through the attention mechanism. Finally, solid experiments are conducted over a real-world public dataset. Experimental results show that the proposed approach outperforms the baseline methods under NDCG, Recall and Precision.

关键词： Electronic learning Attention mechanisms Federated learning Education Solids

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：