Search

To solve the problem of inaccurate user phase identification, the paper proposes a new algorithm based on improved cloud model and adaptive segmented voltage algorithm. Firstly, the new algorithm uses improved cloud model to calculate the digital features of station area and users' voltage sequences quickly. Secondly, the paper uses the adaptive segmentation voltage algorithm to divide the full voltage sequences into three parts automatically to add local features into phase identification. Finally, the paper calculates cosine similarity between each segmented voltage cloud model to identify users' voltage phase. The analysis based on station data and field verification shows that the new algorithm has not only improved the calculation efficiency by 41% compared with traditional user phase identification algorithm, but also increased the difference in identification results between different phases by 1000 times. In the final result, the accuracy of the new algorithm is 95%. The new algorithm has more obvious differentiation and higher accuracy. The analysis results based on the actual engineering data also prove the feasibility and effectiveness of the new user phase identification algorithm. [ABSTRACT FROM AUTHOR]

In recent years, imbalanced data learning has attracted a lot of attention from academia and industry as a new challenge. In order to solve the problems such as imbalances between and within classes, this paper proposes an adaptive boundary weighted synthetic minority oversampling algorithm (ABWSMO) for unbalanced datasets. ABWSMO calculates the sample space clustering density based on the distribution of the underlying data and the K-Means clustering algorithm, incorporates local weighting strategies and global weighting strategies to improve the SMOTE algorithm to generate data mechanisms that enhance the learning of important samples at the boundary of unbalanced data sets and avoid the traditional oversampling algorithm generate unnecessary noise. The effectiveness of this sampling algorithm in improving data imbalance is verified by experimentally comparing five traditional oversampling algorithms on 16 unbalanced ratio datasets and 3 classifiers in the UCI database. [ABSTRACT FROM AUTHOR]

Recently, energy-saving scheduling issues have attracted more and more attention in the manufacturing field. Meanwhile, in practical production, maintenance planning is viewed as a vital task in the workshop. However, the existing literature about energy-saving scheduling problems rarely consider the effect of preventive maintenance. Therefore, this paper investigates an energy-saving flexible job shop scheduling problem with preventive maintenance. A mathematical model is proposed considering the minimization of total energy consumption. To solve the problem, a novel discrete elephant herding optimization algorithm (NDEHO) is proposed according to the problem's characteristics. To test the NDEHO's performance, the Taguchi design of experiment approach is adopted to get the best combination of parameters in the algorithm. Numerical experiments are conducted based on twenty-four instances, including four benchmark instances and twenty randomly generated instances. Computational data indicate that NDEHO outperforms other compared algorithms for solving the considered problem. [ABSTRACT FROM AUTHOR]

The researcher proposed the concept of Top-K high-utility itemsets mining over data streams. Users directly specify the number K of high-utility itemsets they wish to obtain for mining with no need to set a minimum utility threshold. There exist some problems in current Top-K high-utility itemsets mining algorithms over data streams including the complex construction process of the storage structure, the inefficiency of threshold raising strategies and utility pruning strategies, and large scale of the search space, etc., which still can not meet the requirement of real-time processing over data streams with limited time and memory constraints. To solve this problem, this paper proposes an efficient algorithm based on dataset projection for mining Top-K high-utility itemsets from a data stream. A data structure CIUDataListSW is also proposed, which stores the position of the item in the transaction to effectively obtain the initial projected dataset of the item. In order to improve the projection efficiency, this paper innovates a new reorganization technology for projected transactions in common batches to maintain the sort order of transactions in the process of dataset projection. Dual pruning strategy and transaction merging mechanism are also used to further reduce search space and dataset scanning costs. In addition, based on the proposed CUDHSW structure, an efficient threshold raising strategy CUD is used, and a new threshold raising strategy CUDCB is designed to further shorten the mining time. Experimental results show that the algorithm has great advantages in running time and memory consumption, and it is especially suitable for the mining of high-utility itemsets of dense datasets. [ABSTRACT FROM AUTHOR]

With the advancement of computer performance, deep learning is playing a vital role on hardware platforms. Indoor scene segmentation is a challenging deep learning task because indoor objects tend to obscure each other, and the dense layout increases the difficulty of segmentation. Still, current networks pursue accuracy improvement, sacrifice speed, and augment memory resource usage. To solve this problem, achieve a compromise between accuracy, speed, and model size. This paper proposes Multichannel Fusion Network (MFNet) for indoor scene segmentation, which mainly consists of Dense Residual Module(DRM) and Multi-scale Feature Extraction Module(MFEM). MFEM uses depthwise separable convolution to cut the number of parameters, matches different sizes of convolution kernels and dilation rates to achieve optimal receptive field; DRM fuses feature maps at several levels of resolution to optimize segmentation details. Experimental results on the NYU V2 dataset show that the proposed method achieves very competitive results compared with other advanced algorithms, with a segmentation speed of 38.47 fps, nearly twice that of Deeplab v3+, but only 1/5 of the number of parameters of Deeplab v3 +. Its segmentation results were close to those of advanced segmentation networks, making it beneficial for the real-time processing of images. [ABSTRACT FROM AUTHOR]

In real conditions, the parameters of multi-objective nonlinear programming (MONLP) problem models can't be determined exactly. Hence in this paper, we concerned with studying the uncertainty of MONLP problems. We propose algorithms to solve rough and fully-rough-interval multi-objective nonlinear programming (RIMONLP and FRIMONLP) problems, to determine optimal rough solutions value and rough decision variables, where all coefficients and decision variables in the objective functions and constraints are rough intervals (RIs). For the RIMONLP and FRIMONLP problems solving methodology are presented using the weighting method and slice-sum method with Kuhn-Tucker conditions, We will structure two nonlinear programming (NLP) problems. In the first one of this NLP problem, all of its variables and coefficients are the lower approximation (LAI) it's RIs. The second NLP problems are upper approximation intervals (UAI) of RIs. Subsequently, both NLP problems are sliced into two crisp nonlinear problems. NLP is utilized because numerous real systems are inherently nonlinear. Also, rough intervals are so important for dealing with uncertainty and inaccurate data in decision-making (DM) problems. The suggested algorithms enable us to the optimal solutions in the largest range of possible solution. Finally, Illustrative examples of the results are given. [ABSTRACT FROM AUTHOR]

To solve the problem that the K-means algorithm is sensitive to the initial clustering centers and easily falls into local optima, we propose a new hybrid clustering algorithm called the IGWOKHM algorithm. In this paper, we first propose an improved strategy based on a nonlinear convergence factor, an inertial step size, and a dynamic weight to improve the search ability of the traditional grey wolf optimization (GWO) algorithm. Then, the improved GWO (IGWO) algorithm and the K-harmonic means (KHM) algorithm are fused to solve the clustering problem. This fusion clustering algorithm is called IGWOKHM, and it combines the global search ability of IGWO with the local fast optimization ability of KHM to both solve the problem of the K-means algorithm's sensitivity to the initial clustering centers and address the shortcomings of KHM. The experimental results on 8 test functions and 4 University of California Irvine (UCI) datasets show that the IGWO algorithm greatly improves the efficiency of the model while ensuring the stability of the algorithm. The fusion clustering algorithm can effectively overcome the inadequacies of the K-means algorithm and has a good global optimization ability. [ABSTRACT FROM AUTHOR]

At present, resource configuration of mobile cloud computing has received extensive attention from the outside world. Most of the similar resource scheduling configuration fails to comprehensively consider the dynamics of mobile terminals and the difference in user requested resources. Therefore, considering uncertainty in paging scheduling under mobile cloud resource environment from the perspective of consumers has become the key to solving the problem of resource allocation in the mobile cloud computing environment. This paper proposes an adaptive matching resource allocation algorithm based on uncertain factors under mobile cloud computing environment. Uncertain factors of the mobile terminal are derived via QoS attribute, and then user information and load characteristics of the user requested resources are analyzed through CLIQUE similarity matching. Afterwards, based on the mapping between similarity and resources, resource paging allocation can be carried out based on adaptive matching resource allocation algorithm. From the perspective of consumers, dynamics of mobile terminals and uncertainty of paging scheduling in the mobile cloud resource environment under different user requested resources can be considered to allow minimized delay and optimized paging strategies. [ABSTRACT FROM AUTHOR]

Traditional Hough circle detection algorithm usually determines the center and radius of a circle by mapping points in cartesian coordinate system to polar coordinate system. Since it accumulates in the three-dimensional space, it requires more calculation consumption. In this paper, we solve the problem of high time complexity of Hough algorithm in judging circle radius and circle center from two aspects of circle angle and circle radius according to the geometric features of quasi-circles. A large number of experiments show that, compared with the traditional algorithm, this algorithm can not only identify quasi-circles, but also improve the detection success rate of circles by about 10%, with efficient running speed, and obtain good experimental results in the detection of craters. [ABSTRACT FROM AUTHOR]

At present, resource configuration of mobile cloud computing has received extensive attention from the outside world. Most of the similar resource scheduling configuration fails to comprehensively consider the dynamics of mobile terminals and the difference in user requested resources. Therefore, considering uncertainty in paging scheduling under mobile cloud resource environment from the perspective of consumers has become the key to solving the problem of resource allocation in the mobile cloud computing environment. This paper proposes an adaptive matching resource allocation algorithm based on uncertain factors under mobile cloud computing environment. Uncertain factors of the mobile terminal are derived via QoS attribute, and then user information and load characteristics of the user requested resources are analyzed through CLIQUE similarity matching. Afterwards, based on the mapping between similarity and resources, resource paging allocation can be carried out based on adaptive matching resource allocation algorithm. From the perspective of consumers, dynamics of mobile terminals and uncertainty of paging scheduling in the mobile cloud resource environment under different user requested resources can be considered to allow minimized delay and optimized paging strategies. [ABSTRACT FROM AUTHOR]

Traditional Hough circle detection algorithm usually determines the center and radius of a circle by mapping points in cartesian coordinate system to polar coordinate system. Since it accumulates in the three-dimensional space, it requires more calculation consumption. In this paper, we solve the problem of high time complexity of Hough algorithm in judging circle radius and circle center from two aspects of circle angle and circle radius according to the geometric features of quasi-circles. A large number of experiments show that, compared with the traditional algorithm, this algorithm can not only identify quasi-circles, but also improve the detection success rate of circles by about 10%, with efficient running speed, and obtain good experimental results in the detection of craters. [ABSTRACT FROM AUTHOR]

Path planning is the basis and prerequisite for unmanned aerial vehicle (UAV) to perform tasks, and it is important to achieve precise location in path planning. This paper focuses on solving the UAV path planning problem under the constraint of system positioning error. Some nodes can re-initiate the accumulated flight error to zero and this type of scenario can be modeled as the resource-constrained shortest path problem with re-initialization (RCSPP-R). The additional re-initiation conditions expand the set of viable paths for the original constrained shortest path problem and increasing the search cost. To solve the problem, an effective preprocessing method is proposed to reduce the network nodes. At the same time, a relaxed pruning strategy is introduced into the traditional Pulse algorithm to reduce the search space and avoid more redundant calculations on unfavorable scalable nodes by the proposed heuristic search strategy. To evaluate the accuracy and effectiveness of the proposed algorithm, some numerical experiments were carried out. The results indicate that the three strategies can reduce the search space by 99%, 97% and 80%, respectively, and in the case of a large network, the heuristic algorithm combining the three strategies can improve the efficiency by an average of 80% compared to some classical solution. [ABSTRACT FROM AUTHOR]

The safety and stability of the rapier loom during operation directly impact the quality of the fabric. Therefore, it is of great significance to carry out fault diagnosis research on rapier looms. In order to solve the problems of low diagnosis efficiency, untimely diagnosis, and high maintenance cost of existing rapier looms in manual troubleshooting of loom failures. This paper proposes a new intelligent fault diagnosis method for rapier looms based on the fusion of expert system and fault tree. A new expert system knowledge base is formed by combining the dynamic fault tree model with the expert system knowledge base. It solves the problem that the traditional expert system cannot achieve precise positioning in the face of complex fault types. Construct the rapier loom's fault diagnosis model, build the intelligent diagnosis platform, and finally realize the intelligent fault diagnosis of the rapier loom. Experimental results show that the algorithm can quickly diagnose and locate rapier loom faults. Compared with the current intelligent diagnosis algorithm, the algorithm structure is simplified, which provides a theoretical basis for the broad application of intelligent fault diagnosis on rapier looms. [ABSTRACT FROM AUTHOR]

Yager introduced the Pythagorean Fuzzy Set (PFS) to deal with uncertainty in real-world decision-making problems. Binary relations play an important role in mathematics as well as in information sciences. Soft binary relations give us a parameterized collection of binary relations. In this paper, lower and upper approximations of PFSs based on Soft binary relations are given with respect to the aftersets and with respect to the foresets. Further, two kinds of Pythagorean Fuzzy Topologies induced by Soft reflexive relations are investigated and an accuracy measure of a PFS is provided. Besides, based on the score function and these approximations of PFSs, an algorithm is constructed for ranking and selection of the decision-making alternatives. Although many MCDM (multiple criteria decision making) methods for PFSs have been proposed in previous studies, some of those cannot solve when a person is encountered with a two-sided matching MCDM problem. The proposed method is new in the literature. This newly proposed model solved the problem more accurately. The proposed method focuses on selecting and ranking from a set of feasible alternatives depending on the two-sided matching of attributes and determines a ranking based solution for a problem with conflicting criteria to help the decision-maker in reaching a final course of action. [ABSTRACT FROM AUTHOR]