Search

Software maintenance and evolution play an important role in the software engineering field, especially when current software becomes more and more complex and powerful. As an entity to implement business processes and gain revenue, valuable software is composed of business logic and corresponding organization role interaction interfaces. With the enterprise development, the organization architecture also evolves, like expanding, cross department cooperation, and so on. However, existing software process adaptive approaches mainly focus on handling the change of the business (program) logic instead of organization structure. Therefore, we propose an adaptive software business process approach that supports organization architecture evolution and automatically migrates the run‐time process instances to the latest version. First, a business process adaptation model is designed, which includes the organization layer, business process layer and event layer that connects the two. Based on the model, the organization changing impact and business process model modification are formalized. Besides, the business process adaptation approach is designed. According to the dependence between the organization architecture and the business process activities, the affected domain detection algorithms for three basic business process structures and the business process instance migration algorithm are developed. Finally, the feasibility and stability of the proposed system are comprehensively evaluated with the synthetic data sets. [ABSTRACT FROM AUTHOR]

Software testing is an indispensable part of the software engineering industry, which guarantees product reliability and safety. Traditional testing approaches face the testing Oracle problem, they are difficult to construct the expected outputs with the increasing of program complexity. As a result, metamorphic testing, which tests the program by examining the relationship between the execution results, is proposed. However, existing manual metamorphic relation construction requires huge effects of domain experts, and automatic methods are unstable and inefficient due to the insufficient software feature mining. Hence, we proposed a multi‐dimensional program structure‐based metamorphic relation prediction approach, which is composed of feature extraction and prediction model building. In the feature extraction stage, the testing program is converted to multiple intermediate structures (such as control flow graphs and abstract syntax trees) to explore its features. In the prediction model building stage, the extracted feature set is used as the training set, and a novel semi‐supervised support vector machine‐bagging‐K‐nearest neighbors algorithm is designed to train the prediction model. Besides, a two‐phase hybrid granularity search algorithm is proposed to improve the prediction performance by selecting the optimal number of weak classifiers. Compared with existing approaches, our proposed model can improve the accuracy by around 14%. [ABSTRACT FROM AUTHOR]

Along with the popularity of intelligent services and mobile services, service recommendation has become a key task, especially the task based on quality-of-service (QoS) in edge computing environment. Most existing service recommendation methods have some serious defects, and cannot be directly adopted in edge computing environment. For example, most of existing methods cannot learn deep features of users or services, but in edge computing environment, there are a variety of devices with different configurations and different functions, and it is necessary to learn deep features behind those complex devices. In order to fully utilize hidden features, this paper proposes a new matrix factorization (MF) model with deep features learning, which integrates a convolutional neural network (CNN). The proposed mode is named Joint CNN-MF (JCM). JCM is capable of using the learned deep latent features of neighbors to infer the features of a user or a service. Meanwhile, to improve the accuracy of neighbors selection, the proposed model contains a novel similarity computation method. CNN learns the neighbors features, forms a feature matrix and infers the features of the target user or target service. We conducted experiments on a real-world service dataset under a batch of cases of data densities, to reflect the complex invocation cases in edge computing environment. The experimental results verify that compared to counterpart methods, our method can consistently achieve higher QoS prediction results. [ABSTRACT FROM AUTHOR]

Topic models are a prevailing tool for exploring latent topics in documents, and for helping to complete many NLP tasks. To obtain good topics for a corpus, a preprocessing step is often needed to remove common stop words and identify topic general words (TGW) from the corpus. Such words can seriously harm the topic formation because they create spurious co-occurrence of unrelated words. Also, they are likely to occupy top positions of multiple topics, lead to many unrelated words being grouped under a topic, and consequently result in inscrutable and similar topics. In an application, one typically manually identifies and removes a list of TGWs in the corpus. This is a time consuming process and very hard to do by a layman user. In this paper, we aim to solve this problem automatically. The proposed approaches can be based on the current corpus alone or multiple corpora. In the latter case, a novel continuous learning method is proposed that learns from past results of multiple domain corpora to help identify TGWs in the current domain. We conduct experiments in two real-world datasets, and the experimental results show that the proposed approaches achieve superior results. [ABSTRACT FROM AUTHOR]

Substitutability of Web service is the key aspect for ensuring reliability of Web service-oriented software. Along with more large and coarse granularity services appear across the Internet continuously, it has become a new challenge that how to determine the substitutability between different granularity services. In this paper, we propose the notion of interface inverted dependence to reveal all functions and business logic of large granularity services. A formal model is bulit by extending the Martin-Löf's type theory. The model can clearly describe both large and small granularity services from three aspects: syntax, semantics, and behaviour. Based on the formalization, we introduce the notions of substitutability between different granularity services with different stringency through considering the context of services. In order to judge the substitutability, a mechanism based on subtyping theory is proposed. At last, the case study is given to show the effectiveness of the proposed substitutability. [ABSTRACT FROM AUTHOR]

Trajectory inference is a crucial task in single-cell RNA-sequencing downstream analysis, which can reveal the dynamic processes of biological development, including cell differentiation. Dimensionality reduction is an important step in the trajectory inference process. However, most existing trajectory methods rely on cell features derived from traditional dimensionality reduction methods, such as principal component analysis and uniform manifold approximation and projection. These methods are not specifically designed for trajectory inference and fail to fully leverage prior information from upstream analysis, limiting their performance. Here, we introduce scCRT, a novel dimensionality reduction model for trajectory inference. In order to utilize prior information to learn accurate cells representation, scCRT integrates two feature learning components: a cell-level pairwise module and a cluster-level contrastive module. The cell-level module focuses on learning accurate cell representations in a reduced-dimensionality space while maintaining the cell–cell positional relationships in the original space. The cluster-level contrastive module uses prior cell state information to aggregate similar cells, preventing excessive dispersion in the low-dimensional space. Experimental findings from 54 real and 81 synthetic datasets, totaling 135 datasets, highlighted the superior performance of scCRT compared with commonly used trajectory inference methods. Additionally, an ablation study revealed that both cell-level and cluster-level modules enhance the model's ability to learn accurate cell features, facilitating cell lineage inference. The source code of scCRT is available at https://github.com/yuchen21-web/scCRT-for-scRNA-seq. [ABSTRACT FROM AUTHOR]

Recently, more and more mobile apps are employed in the marketing field with technical advances. Mobile marketing apps have become a prevalent way for enterprise marketing. Therefore, it has been an important and urgent problem to provide personalized and accurate recommendation in mobile marketing, with a large number of items and limited capability of mobile devices. Recommendation have been investigated widely, however, most existing approaches fail to consider the stability or change of users' behaviors over time. In this paper, we first propose to mine the periodic trends of users' consuming behavior from historical records by KNN(K-nearest neighbor) and SVR (support vector regression) based time series prediction, and predict the next time when a user re-purchases the item, so that we can recommend the items which users have purchased before at proper time. Second, we aim to find the regularity of users' purchasing behavior during different life stages and recommend the new items that are needed and proper for their current life stage. In order to solve this, we mine the mapping model from items to user's life stage first. Based on the model, users' current life stage can be estimated from their recent behaviors. Finally, users will be recommended with new items which are proper to their estimated life stage. Experimental results show that it has improved the effectiveness of recommendation obviously by mining users' consuming behaviors with temporal evolution. [ABSTRACT FROM AUTHOR]

In the development of applications for mobile multimedia computing, it has been a core problem to improve the efficiency of applications development. The use of Web APIs has played an important role in applications development and mashups creation, but it takes a lot of time to find a suitable Web API. In this paper, we propose to employ APIs recommendation to solve this problem. We use the matrix factorization (MF) model to predict the relationship between user and Web APIs. The relationship between user and Web APIs is represented by latent features. But different from MF model, we find that the relationship between Web APIs have an impact on prediction performance. This paper uses the embedding technique and mines the latent relationships between APIs and we develop a novel prediction model that leverages the latent relationships between APIs, which is named as LRM (LRM is short for latent relationships mining). The latent relations are input into the LRM model to produce the relation prediction between APIs and developers. The experimental results show that our method achieves high performance and behaves the best compared to existing baselines. [ABSTRACT FROM AUTHOR]

Second, to obtain semantics-enhanced code representation, the authors propose a cross-attention-based line label fusion method to perform complementary feature enhancement. In the second paper entitled "Just-In-Time Defect Prediction Enhanced by the Joint Method of Line Label Fusion and File Filtering" by Zhang et al., the authors propose a Just-in-Time defect prediction model enhanced by the joint method of line label Fusion and file Filtering (JIT-FF). In the first paper entitled "Robust Malware Identification via Deep Temporal Convolutional Network with Symmetric Cross Entropy Learning" by Sun et al., the authors propose a robust Malware identification method using the temporal convolutional network (TCN). [Extracted from the article]

In recent years, with the development of software development, a large number of developers develop software by invoking API. With the increasing number of APIs, how to accurately recommend the APIs to developers has become a urgently necessary task. In this paper, we discover that there is a relationship between the user and the API, and use such relationships and collaborative learning techniques to finish APIs recommendation. We propose a holistic framework that contains three models. In the models, we design a joint matrix factorization technique and try to discover the preference among APIs invocation process. In natural language processing, word embedding is widely used. In our models, we use doc2vec to turn the representation of users and APIs into vector representation and calculate the similarity separately to generate the relationships. Besides the two modes in users side and APIs side, we also propose an ensemble model fully leveraging the preference mined from both users side and APIs side. We conduct the experiments on a real-world dataset and the experimental results show that our models perform better than all compared methods. [ABSTRACT FROM AUTHOR]

Predicting urban traffic volume is of great significance to traffic management and urban construction. An accurate prediction model can help drivers optimize driving routes, allocate resources reasonably and reduce urban traffic congestion. Most of the existing studies do not consider the complex nonlinear spatio-temporal relationship. In the spatial dimension, they do not consider the impact of regional semantics and regional interactions. In the temporal dimension, they ignore the impact of long-term historical information and key time points. Aiming at the complexity of traffic data, in this paper, we design a ResNet-TCN model to predict the urban traffic volume. Firstly, we construct and extract features from the vehicle GPS tracking and external information, such as velocity, time, location and weather. Then, we obtain regional semantic information by the ResNet model and combine the weights of the regional division with the average vehicle velocity into a two-channel matrix. We extract the key features of the matrix sequence and predict the velocity by the TCN model. Finally, we estimate the traffic volume through a traffic volume inference model in the traffic field. We conduct a large number of experiments on the actual dataset of Chengdu and compare our model with the existing models. The experimental results show that our method has better performance on prediction accuracy. [ABSTRACT FROM AUTHOR]

In traditional federated learning such as FedAvg, the associations among clients are often ignored when executing on non-independent or heterogeneously distributed datasets, resulting in unsatisfactory accuracy. Although some previous works on clustered federated learning have been proposed to address such problems, most of them have a polarized problem. When the number of clustering is small, the model performs poorly and fails to accurately capture the distinction between clients. While a large number of clustering times tends to lead to higher communication costs. Therefore, a critical need is to design an efficient clustered federated solution that can both better capture the diversity between local clients and minimize the communication and computation costs. To this end, we propose an efficient one-off clustered federated learning framework called FedEOC. FedEOC exploits the "learning-to-learn" characteristic of meta-learning to enhance the generalization of the model across different clients so that only a small number of iterations are needed for each client to quickly obtain locally adapted weights. Based on the well-initially trained weights on all clients, we can cluster the clients only once to achieve the effect of one-off clustering and multiple-round applying. Additionally, to alleviate the issue of cluster imbalance, FedEOC is equipped with a Decomposition and Consolidation (Dec-Con) mechanism to decompose the clients from the extreme clusters and consolidate them into the most similar ones. The comprehensive experiments conducted on two real-world datasets demonstrate the superior capability of FedEOC from both aspects of accuracy and efficiency. [ABSTRACT FROM AUTHOR]

Traditional topic modeling has been widely studied and popularly employed in expert systems and information systems. However, traditional topic models cannot discover structural relations among topics, thus losing the chance to explore the data more deeply. Hierarchical topic modeling has the capability of learning topics, as well as discovering the hierarchical topic structure from text data. But purely unsupervised models tend to generate weak topic hierarchies. To solve this problem, we propose a novel knowledge-based hierarchical topic model (KHTM), which can incorporate prior knowledge into topic hierarchy building. A key novelty of this model is that it can mine prior knowledge automatically from the topic hierarchies of multiple domains corpora. In this paper, the knowledge is represented as the word pairs which satisfy the requirement of frequent co-occurrence, and knowledge is organized in form of hierarchical structure. We also propose an iterative learning algorithm. For evaluation, we crawled two new multi-domain datasets and conducted comprehensive experiments. The experimental results show that our algorithm and model can generate more coherent topics, and more reasonable hierarchical structure. [ABSTRACT FROM AUTHOR]

YouTube offers a great opportunity for people to entertain, advertise, gain popularity, and generate revenue. How to increase views for a video has become the key question for anyone who wish to be famous or gain more revenue. Recognizing that a recommendation system is a major view source for videos, our goal in this paper is to increase video views in YouTube by leveraging on the recommendation system. We first perform measurements to understand how views are propagated among videos through recommendation links and identify factors that influence the recommendation produced by the system. Our measurement results show that similarity in video meta-data is a crucial ingredient in connecting videos. We then propose a keyword suggestion method for a video with the aim to raise video views through the recommendation system. The keyword suggestion method utilizes video clusters on a referrer video graph to obtain relevant keywords and ranks keywords based on both their relevance and their potential to attract video views. The effectiveness of the keyword suggestion method is demonstrated through a case study, showing that using the keywords suggested by our method leads to a larger number of video views and higher average watching time per video playback compared to initial user-given keywords. [ABSTRACT FROM AUTHOR]

With the explosive growth of products and multimedia contents on the Internet, the desire of users to find these online resources matching their interests makes it imperative to develop high quality recommendation systems. In this paper, we propose one novel neural network, namely Dynamic Heterogeneous Graph Convolutional Network (DHGCN), for item recommendation. Specifically, our proposed DHGCN consists of two components, namely the graph learner and heterogeneous graph convolution. The graph learner considers not only the user–item interactions but also user–user and item–item interactions, which are dynamically established during the graph evolution process. The heterogeneous graph convolution relies on a novel cross gating strategy to aggregate the representations yielded by the convolution over the learned heterogeneous graph and the item content information. Through comprehensive experiments on two real-world datasets, the proposed model is demonstrated to be effective on item recommendation task, outperforming the existing state-of-the-art models. [ABSTRACT FROM AUTHOR]