Business process recommendation can be used to simplify the working procedures of enterprises, avoid unnecessary expenses, and promote the development of enterprises. In the process of process recommendation, there are a lot of activities that are similar in structure and difficult to choose. Here, a process recommendation method based on cost constraints is proposed to solve the problem of difficult to distinguish similar processes. First, the business process is transformed into a labelled Petri net, and the execution probability of each transition is calculated according to the business process log. Then, the matrix used to represent Petri nets is constructed according to the adjacent relationship between transitions, and the matrix is made into the same dimension, and the similarity between matrices is calculated by biggest–smallest approach degree, and the set of Petri nets with similar structure is established. Finally, a cost constraint-based process recommendation method is proposed to find lower service cost items in similar process sets. In the experimental part, the feasibility of the method is compared and verified.
1 March 2018 in Applied Mathematics and Computation
The time-varying solution of a class generalized linear matrix equation with the transpose of an unknown matrix is discussed. The computation model is constructed and asymptotic convergence proof is given by using the zeroing neural network method. Using an activation function, the predefined-time convergence property and noise suppression strategy are discussed. Numerical examples are offered to illustrate the efficacy of the suggested zeroing neural network models.
1 January 2014 in Mathematical Problems in Engineering
By analyzing the eigenvalues of the related matrices, the convergence analysis of the least squares based iteration is given for solving the coupled Sylvester equations AX + YB = C and DX + YE = F in this paper. The analysis shows that the optimal convergence factor of this iterative algorithm is 1. In addition, the proposed iterative algorithm can solve the generalized Sylvester equation AXB + CXD = F. The analysis demonstrates that if the matrix equation has a unique solution then the least squares based iterative solution converges to the exact solution for any initial values. A numerical example illustrates the effectiveness of the proposed algorithm.
This paper is concerned with iterative solution to a class of the real coupled matrix equations. By using the hierarchical identification principle, a gradient-based iterative algorithm is constructed to solve the real coupled matrix equationsand. The range of the convergence factor is derived to guarantee that the iterative algorithm is convergent for any initial value. The analysis indicates that if the coupled matrix equations have a unique solution, then the iterative solution converges fast to the exact one for any initial value under proper conditions. A numerical example is provided to illustrate the effectiveness of the proposed algorithm.