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

IEEE International Conference on Big Data and Cloud computing (BdCloud)

作者： Hangyu Cheng Guosheng Kang Jianxun Liu Yiping Wen Buqing Cao Zhen Wang 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

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.

关键词： Industries Process modeling Annotations Internet Personnel Task analysis Optimization

来源：评论

学校读者我要写书评

暂无评论

Grrln: Gated Recurrent Residual Learning Networks for Code Clone Detection

SSRN

引用

SSRN 2022年

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

Code clone detection is a critical problem in software development and maintenance domains. It aims to identify functionally identical or similar code fragments within an application. Existing works formulate the code clone detection task as a binary classification problem which is determine the code pairs are clone or not with a pre-defined threshold. In reality, there are various types of code clone subject to the degree of how a pair of code fragments are similar to each other. To investigate the effect of different code clone detection manner on the clone detection result, we propose Gated Recurrent Residual Learning Networks (GRRLN), a novel neural network model for code clone detection. To train GRRLN, we first represent each code fragment as a statement-level tree sequence derived from the whole AST. Then, a gated recurrent neural network with residual connections is adopted to fully extract semantics of all individual statement trees together with their dependency relationships across the input statement sequence. Finally, the output representations of code fragments by GRRLN are used for similarity calculation and clone detection. We evaluate GRRLN using two real-world datasets for code clone detection and clone type classification. Experiments show that GRRLN achieves generally better performance than state-of-the-art methods and meanwhile needs significant less time and memory costs. © 2022, The Authors. All rights reserved.

关键词： Recurrent neural networks

来源：评论

学校读者我要写书评

暂无评论

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

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

引用

IEEE International Conference on Cyber Security and Cloud computing (CSCloud)

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

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.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Container lifecycle-aware scheduling for serverless computing

Container lifecycle-aware scheduling for serverless computin...

引用

作者： Wu, Song Tao, Zhiheng Fan, Hao Huang, Zhuo Zhang, Xinmin Jin, Hai Yu, Chen Cao, Chun 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 State Key Laboratory for Novel Software Technology Department of Computer Science and Technology Nanjing University Nanjing China

Elastic scaling in response to changes on demand is a main benefit of serverless computing. When bursty workloads arrive, a serverless platform launches many new containers and initializes function environments (known as cold starts), which incurs significant startup latency. To reduce cold starts, platforms usually pause a container after it serves a request, and reuse this container for subsequent requests. However, this reuse strategy cannot efficiently reduce cold starts because the schedulers are agnostic of container lifecycle. For example, it may ignore soon availab.e containers or evict soon needed containers. We propose a container lifecycle-aware scheduling strategy for serverless computing, CAS. The key idea is to control distribution of requests and determine creation or eviction of containers according to different lifecycle phases of containers. We implement a prototype of CAS on OpenWhisk. Our evaluation shows that CAS reduces 81% cold starts and therefore brings a 63% reduction at 95th percentile latency compared with native scheduling strategy in OpenWhisk when there is worker contention between workloads, and does not add significant performance overhead. © 2021 John Wiley & Sons Ltd.

关键词： Containers

来源：评论

学校读者我要写书评

暂无评论

A missing physical fitness test data classification method based on MLP

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

引用

IEEE International Conference on Cyber Security and Cloud computing (CSCloud)

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

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 %.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SC-GAT: Web services Classification Based on Graph Attention Network 16th

SC-GAT: Web Services Classification Based on Graph Attention...

引用

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

作者： Peng, Mi Cao, Buqing Chen, Junjie Liu, Jianxun Li, Bing School of Computer Science and Engineering & Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Computer Wuhan University Wuhan China

ISBN: (纸本)9783030675363

The classification of Web services with high similarity is conducive to the promotion for service management and service discovery. With the increasing number of Web services, how to accurately and efficiently classify the Web services becomes an urgent and challenging task. Although the existing methods achieve significant results in the task for service classification via integrating the structure information of service network with the content features of service node, it fails to discriminate the importance of neighbor services in the service network on the service node needed to be classified. To solve this problem, we propose a Web services classification method based on graph attention network. Firstly, according to the composition and shared annotation relationship of Web services, it applies the description documents, tags of Web services and the call relationship between mashups and services to build a service relationship network. Then, the attention coefficient of service nodes in the network is calculated by the self-attention mechanism, and different service nodes in the neighborhood are assigned different weights to classify Web services. Through the graph attention network, the content features of Web service can be well integrated with its structure information. Also, the learned attention weight is more interpretable. The experimental results on the real dataset of ProgrammableWeb platform show that the precision, recall and macro-F1 of the proposed method are greatly improved compared to those of GCN, Node2vec, DeepWalk and Line. © 2021, ICST Institute for Computer Sciences, Social Informatics and Telecommunications Engineering.

关键词： Web services

来源：评论

学校读者我要写书评

暂无评论

A Multiple-Path Learning Neural Network Model for Code Completion

A Multiple-Path Learning Neural Network Model for Code Compl...

引用

IEEE International Conference on Web services (ICWS)

作者： Yi Liu Jianxun Liu Xiangping Zhang Haize Hu Hunan Provincial Key Laboratory for Services Computing and Novel Software Technology Hunan University of Science and Technology Xiangtan China School of Informationn Hunan University of Humanities Science and Technology Loudi China School of Computer Science and Engineering Hunan University of Science and Technology Xiangtan China

Code completion, which can accelerate the software development process and improve the quality of software products, is an essential part of today’s integrated development environments. It has become an important research topic in the field of software engineering. Recent studies have shown that the method of code completion based on the Abstract Syntax Tree (AST) learns syntactic information about the code, which helps to improve the accuracy of code completion. However, when modeling neural networks for ASTs, the sequencing operation of nodes leads to the loss of their hierarchical structure information. Meanwhile, traditional neural networks cannot predict many Out-of-Vocabulary (OoV) words in the terminal node values of AST. To alleviate the above problem, in this paper, we propose a Multiple-Path Learning neural network model for code completion (MPL) based on an AST by learning from a large-scale corpus. In this model, multiple paths such as context path, root path, and terminal node path are established to understand different code features required for node prediction and improve code representation ability. Based on the principle of program local repeatability, it also adopts a replication mechanism to copy the appropriate OoV words from the local terminal node path as the prediction result, further improving the prediction accuracy. The experimental results show that the MPL model has better performance than existing methods on the code completion task.

关键词：

来源：评论

学校读者我要写书评

暂无评论

SMOG: Accelerating Subgraph Matching on GPUs

SMOG: Accelerating Subgraph Matching on GPUs

引用

IEEE Conference on High Performance Extreme computing (HPEC)

作者： Zhibin Wang Ziheng Meng Xue Li Xi Lin Long Zheng Chen Tian Sheng Zhong State Key Laboratory for Novel Software Technology Nanjing University Alibaba Group“ National Engineering Research Center for Big Data Technology and System/ Services Computing Technology and System Lab/Cluster and Grid Computing Laboratory Huazhong University of Science and Technology Zhejiang Lab

Subgraph matching is a crucial problem in graph theory with diverse applications in fields, such as bioinformatics, social networks and recommendation systems. Accelerating subgraph matching can be greatly facilitated by GPUs, which offer exceptional parallelism and high memory bandwidth. By leveraging the power of multiple GPU cards, subgraph matching can be scaled to achieve unprecedented levels of performance. In this paper, we propose SMOG, an abbreviation for. Subgraph Matching On Multi-Card GPUs. It is a general, high-performance and scalab.e sub graph matching system that utilizes multi-card GPUs. To address the issue of duplication resulting from subgraph automorphism, SMOG introduces a two-step approach. Firstly, it analyzes the symmetry within the subgraph. Then, it adaptively adjusts the graph preprocessing and generates subgraph-aware GPU codes tailored to the given subgraph. Furthermore, SMOG leverages multi-level parallelism by designing the specific strategy for each level, enabling it to scale from 1 to 1,024 GPU cards, resulting in an extraordinary $553\times$ speedup. We evaluate SMOG on various subgraph queries and datasets. The experimental results demonstrate that SMOG outperforms the triangle-specific system TRUST with an average speedup of $2.94\times$ . And it performs significantly better than the subgraph matching system RPS by $203.55\times$ and the graph processing system Gunrock by 35, $455.52\times$ on average.

关键词：

来源：评论

学校读者我要写书评

暂无评论

Hyperbolic Contrastive Learning with Second Order Sampling for Collab.rative Filtering

Hyperbolic Contrastive Learning with Second Order Sampling f...

引用

IEEE International Conference on Web services (ICWS)

作者： Longchuan Tu Shunmei Meng Lianyong Qi Xiaolong Xu Xuyun Zhang School of Computer Science and Engineering Nanjing University of Science and Technology China State Key Lab. for Novel Software Technology Nanjing University China College of Computer Science and Technology China University of Petroleum(East China) China School of Computer and Software Nanjing University of Information Science and Technology China School of Computing Macquarie University Australia

ISBN: (数字)9798350368550

ISBN: (纸本)9798350368567

Recently, hyperbolic spaces have proven beneficial for service recommendation due to their exponentially growing spatial properties conforming to power-law distributed user-item networks. Among them, the combination of hyperbolic space with graph convolution has achieved great success. However, hyperbolic convolutional models still perform multi-layer convolution in tangent space (Euclidean space), leading to the still inevitable problem of over-smoothing arising from multi-layer convolution. In addition, most of these models randomly draw negative samples from items that users have not interacted with, so that some of the samples obtained may not be well suited for model optimization. To tackle the above challenges, we propose a new Hyperbolic GCN model based on Contrastive Learning and Second-order Reachable sampling for collab.rative filtering (HG-CLSR), which improve high quality of representations by exploring the distribution of users and items in hyperbolic space. Specifically, We first introduce a root alignment approach to encourage embeddings to align with the tangent space, thereby reducing distortions during the embedding mapping process in space. Then, we perform contrastive learning in hyperbolic space to motivate the spatial distribution of nodes to better fit the hyperbolic space. Moreover, we sample in the user’s second-order reachable item set, which ensures that the negative sample is more similar to the positive sample, so that the negative node can provide better information for guiding model optimization. Extensive experiments on three real-world datasets demonstrate that the HG-CLSR is significantly superior compared to existing hyperbolic models.

关键词： Degradation Graphical models Convolution Web services Collab.rative filtering Design methodology Contrastive learning Distortion Optimization Distribution functions

来源：评论

学校读者我要写书评

暂无评论

Validating SMT Solvers via Skeleton Enumeration Empowered by Historical Bug-Triggering Inputs

Validating SMT Solvers via Skeleton Enumeration Empowered by...

引用

International Conference on software Engineering (ICSE)

作者： Maolin Sun Yibiao Yang Ming Wen Yongcong Wang Yuming Zhou Hai Jin School of Cyber Science and Engineering Huazhong University of Science and Technology China Hubei Key Laboratory of Distributed System Security Services Computing Technology and System Lab Cluster and Grid Computing Lab Hubei Engineering Research Center on Big Data Security National Engineering Research Center for Big Data Technology and System State Key Laboratory for Novel Software Technology Nanjing University China School of Computer Science and Technology Huazhong University of Science and Technology China

SMT solvers check the satisfiability of logic formulas over first-order theories, which have been utilized in a rich number of critical applications, such as software verification, test case generation, and program synthesis. Bugs hidden in SMT solvers would severely mislead those applications and further cause severe consequences. Therefore, ensuring the reliability and robustness of SMT solvers is of critical importance. Although many approaches have been proposed to test SMT solvers, it is still a challenge to discover bugs effectively. To tackle such a challenge, we conduct an empirical study on the historical bug-triggering formulas in SMT solvers' bug tracking systems. We observe that the historical bug-triggering formulas contain valuable skeletons (i.e., core structures of formulas) as well as associated atomic formulas which can cast significant impacts on formulas' ability in triggering bugs. Therefore, we propose a novel approach that utilizes the skeletons extracted from the historical bug-triggering formulas and enumerates atomic formulas under the guidance of association rules derived from historical formulas. In this study, we realized our approach as a practical fuzzing tool HistFuzz and conducted extensive testing on the well-known SMT solvers Z3 and cvc5. To date, HistFuzz has found 111 confirmed new bugs for Z3 and cvc5, of which 108 have been fixed by the developers. More notably, out of the confirmed bugs, 23 are soundness bugs and invalid model bugs found in the solvers' default mode, which are essential for SMT solvers. In addition, our experiments also demonstrate that HistFuzz outperforms the state-of-the-art SMT solver fuzzers in terms of achieved code coverage and effectiveness.

关键词：

来源：评论

学校读者我要写书评

暂无评论

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

请选择保存的检索档案：

请选择收藏分类：

通借通还

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

时间限定

文献类型

馆藏选择

核心期刊

语言

文献类型

帮助

文字说明：

检索规则说明：

检索范例：

分类表

所选分类

限定检索结果

文献类型

馆藏范围

日期分布

学科分类号

主题

机构

作者

语言

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

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

通借通还

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

请选择保存的检索档案：

请选择收藏分类：