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]

To solve the problems of high storage resource consumption and low efficiency of the RRT exploration algorithm in the late stage of exploration, this paper proposes an Improved Artificial Fish Swarm based Optimize Rapidly-exploring Random Trees multi-robot Exploration Algorithm. Firstly, the efficiency of a single robot's exploration of nearby unknown regions is improved by dynamically adjusting the step size of the RRT tree.Secondly, the improved artificial fish swarm algorithm is used to delete the redundant nodes in the RRT tree and optimize the node state in the RRT tree, which reduces the occupation of memory resources and improves the exploration efficiency of the RRT tree in the narrow environment.Results from comparative experiments in simulation environments with different degrees of openness show that the optimized exploration algorithm can save significant storage resources and show better exploration performance in narrow environments compared to the original RRT exploration algorithm. [ABSTRACT FROM AUTHOR]

In the paper we define three new complexity classes for Turing Machine undecidable problems inspired by the famous Cook/Levin's NP-complete complexity class for intractable problems. These are U-complete (Universal complete), D-complete (Diagonalization complete) and H-complete (Hypercomputation complete) classes. In the paper, in the spirit of Cook/Levin/Karp, we started the population process of these new classes assigning several undecidable problems to them. We justify that some super-Turing models of computation, i.e., models going beyond Turing machines, are tremendously expressive and they allow to accept arbitrary languages over a given alphabet including those undecidable ones. We prove also that one of such super-Turing models of computation - the $-Calculus, designed as a tool for automatic problem solving and automatic programming, has also such tremendous expressiveness. We investigate also completeness of cost metrics and meta-search algorithms in $-calculus. [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]

Influence maximization (IM) is a problem of selecting k nodes from social networks to make the expected number of the active node maximum. Recently, with the popularity of Internet technology, more and more researchers have paid attention to this problem. However, the existing influence maximization algorithms with high accuracy are usually difficult to be applied to the large-scale social network. To solve this problem the paper proposes a new algorithm, called community-based influence maximization (ComIM). Its core idea is "divide and conquer". In detail, this algorithm first utilizes the Louvain algorithm to divide the large-scale networks into some small-scale networks. Afterwards, the algorithm utilizes the one-hop diffusion value (ODV) and two-hop diffusion value (TDV) functions to calculate the influence of a node and select nodes on these small-scale networks, which can improve the accuracy of our proposed algorithm. By using the above methods, the paper proposes a community influence-estimating method called CDV, which can improve the efficiency of the algorithm. Experimental results on six real-world datasets demonstrate that our proposed algorithm outperforms all comparison algorithms when comprehensively considering the accuracy and efficiency. [ABSTRACT FROM AUTHOR]

The on-demand transport (ODT) systems have developed worldwide as they have significant social, environmental, and economic benefits. Even with those benefits, it's still important to gain popular acceptance. The acceptance key is the reactivity of the system in providing fast and reliable solutions whilst respecting vehicles' and clients' constraints. This paper presents a decentralized multi-agent approach to model and solve the ODT problem in a static road network. The agents interact with each other using the A* algorithm to find an optimal solution for each transport demand. The optimal solution is expressed by the fastest trajectory taken by the cheapest vehicles. We utilize factual data from a Lebanese city to do experiments evaluating the proposed approach. [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]

This paper is devoted to the problem of class imbalance in machine learning, focusing on the intrusion detection of rare classes in computer networks. The problem of class imbalance occurs when one class heavily outnumbers examples from the other classes. In this paper, we are particularly interested in classifiers, as pattern recognition and anomaly detection could be solved as a classification problem. As still a major part of data network traffic of any organization network is benign, and malignant traffic is rare, researchers therefore have to deal with a class imbalance problem. Substantial research has been undertaken in order to identify these methods or data features that allow to accurately identify these attacks. But the usual tactic to deal with the imbalance class problem is to label all malignant traffic as one class and then solve the binary classification problem. In this paper, however, we choose not to group or to drop rare classes but instead investigate what could be done in order to achieve good multi-class classification efficiency. Rare class records were up-sampled using SMOTE method (Chawla et al., 2002) to a preset ratio targets. Experiments with the 3 network traffic datasets, namely CIC-IDS2017, CSE-CIC-IDS2018 (Sharafaldin et al., 2018) and LITNET-2020 (Damasevicius et al., 2020) were performed aiming to achieve reliable recognition of rare malignant classes available in these datasets. Popular machine learning algorithms were chosen for comparison of their readiness to support rare class detection. Related algorithm hyper parameters were tuned within a wide range of values, different data feature selection methods were used and tests were executed with and without over-sampling to test the multiple class problem classification performance of rare classes. Machine learning algorithms ranking based on Precision, Balanced Accuracy Score, G ¯ , and prediction error Bias and Variance decomposition, show that decision tree ensembles (Adaboost, Random Forest Trees and Gradient Boosting Classifier) performed best on the network intrusion datasets used in this research. [ABSTRACT FROM AUTHOR]

In order to solve the problem of noise sensitivity and low precision in image segmentation, a new image segmentation method based on super-pixel with neighborhood constrained and multi-level FCM clustering is proposed. Firstly, an improved SLIC algorithm of FCM is designed based on the local pixel region of the image to get the refined super-pixel. Then, the improved FCM clustering algorithm is combined with the spatial relationship of neighborhood super-pixel to mark the super-pixel categories. In order to verify the effectiveness of the algorithm, the artificial synthetic image with noise and natural image without noise are used for comparison experiments. The experimental result show the algorithm proposed in this paper can not only suppress the noise, but also improve the processing accuracy. [ABSTRACT FROM AUTHOR]

School enterprise cooperation is of great strategic significance to China's manufacturing industry. The Party Central Committee has repeatedly proposed to strengthen the integration of industry and education and deepen the cooperation between schools and enterprises. In recent years, experts and scholars at home and abroad have been from different perspectives, although they have achieved fruitful results, there are also problems such as insufficient attention to theoretical research, relatively backward research, narrow research scope, and so on. In view of this phenomenon, this paper will study a new school-enterprise cooperation mechanism based on the improved decision tree algorithm. The research of this paper is divided into three parts. First, after analyzing the advantages and disadvantages of the algorithm, the algorithm of the decision tree is improved, which makes the improved algorithm more suitable for the field of school-enterprise cooperation. Then, based on cloud computing and intelligence, this paper establishes a new model of school-enterprise cooperation platform, which solves some problems of data management and information exchange in school-enterprise cooperation. Finally, in order to make the cooperation mechanism of this paper better used in practice, this paper builds an online and offline hybrid training base, hoping to make the cooperation between schools and enterprises closer through the training base. In order to test the effect of the cooperation model, this paper takes school as the experimental model. After investigation and research, it is believed that thanks to the school-enterprise cooperation mechanism in this paper, the cooperative enterprise of school has been greatly improved in the past three years, and the willingness of enterprises to cooperate has become more and more strong. No matter students, teachers, or enterprises are reaping huge benefits under this cooperation mechanism, it is a suit for extensive promotion The school-enterprise cooperation mechanism of Guangyun. [ABSTRACT FROM AUTHOR]

As there is a continuous delivery of big data, the researchers are showing interest in the applications of cloud computing concerning privacy, and security. On the other hand, many researchers and experts of cybersecurity have commenced on a quest for improving the data encryption to the models of big data and applications of cloud computing. Since many users of the cloud become public cloud services, confidentiality turns out to be a more compound problem. To solve the confidentiality problem, cloud clients maintain the data on the public cloud. Under this circumstance, Homomorphic Encryption (HE) appears as a probable solution, in which the information of the client is encrypted on the cloud in such a process that it permits few manipulation operations without decryption. The main intent of this paper is to present the systematic review of research papers published in the field of Fully Homomorphic Encryption (FHE) over the past 10 years. The encryption scheme is considered full when it consists of plaintext, a ciphertext, a keyspace, an encryption algorithm, and a decryption algorithm. Hence, the review mostly concentrates on reviewing more powerful and recent FHE. The contributions using different algorithms in FHE like Lattice-based, integer-based, Learning With Errors (LWE), Ring Learning With Errors (RLWE), and Nth degree Truncated polynomial Ring Units (NTRU) are also discussed. Finally, it highlights the challenges and gaps to be addressed in modeling and learning about competent, effectual, and vigorous FHE for the cloud sector and pays attention to directions for better future research. [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]

Classification of imbalanced data is an important challenge in current research. Sampling is an important way to solve the problem of imbalanced data classification, but some traditional sampling algorithms are susceptible to outliers. Therefore, an iF-ADASYN sampling algorithm is proposed in this paper. First, based on the ADASYN algorithm, we introduce the isolation Forest algorithm to overcome its vulnerability to outliers. Then, a calculation method of anomaly index which can delete outliers accurately of minority data is presented. The experimental results of four UCI public imbalanced datasets show that the algorithm can effectively improve the accuracy of the minority class, and increase the stability. In the real thrombus dataset, the AUC value of the iF-ADASYN algorithm is more significant than that of SMOTE and ADASYN algorithms, and the recognition rate of patients with thrombosis increased by 20%. The iF-ADASYN algorithm obtains better resistance to outliers than the original ADASYN algorithm. Meanwhile, it improves the accuracy of minority class decision boundary region division. [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]

Most density-based clustering algorithms have the problems of difficult parameter setting, high time complexity, poor noise recognition, and weak clustering for datasets with uneven density. To solve these problems, this paper proposes FOP-OPTICS algorithm (Finding of the Ordering Peaks Based on OPTICS), which is a substantial improvement of OPTICS (Ordering Points To Identify the Clustering Structure). The proposed algorithm finds the demarcation point (DP) from the Augmented Cluster-Ordering generated by OPTICS and uses the reachability-distance of DP as the radius of neighborhood eps of its corresponding cluster. It overcomes the weakness of most algorithms in clustering datasets with uneven densities. By computing the distance of the k-nearest neighbor of each point, it reduces the time complexity of OPTICS; by calculating density-mutation points within the clusters, it can efficiently recognize noise. The experimental results show that FOP-OPTICS has the lowest time complexity, and outperforms other algorithms in parameter setting and noise recognition. [ABSTRACT FROM AUTHOR]

Nowadays, mobile users are equipped with multi-mode terminals allowing them to connect to different radio access technologies like WLAN, 3G (HSPA and HSPA+), and Long term evolution (LTE) each at a time. In this context, the challenge of the next-generation networks is to achieve the Always Best Connected (ABC) concept. To this end, solving the problem of selecting the most suitable radio access technology (RAT) from the list of available RAT is at the heart of the next-generation systems. The decision process is called access network selection and it depends on several parameters, such as quality of service, mobility, cost of each RAT, energy consumption, battery life, etc. Several methods and approaches have been proposed to solve the network selection problem with the fundamental objective which is to offer the best QoS to the users and to maximize the usability of the networks without affecting the users' experience. In this paper, we propose an adaptive KNN (K nearest neighbour) based algorithm to solve the network selection problem, the proposed solution has a low computation complexity with a high level of veracity is compared with the well-known MADM methods. [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]

Transfer learning methods exploit similarities between different datasets to improve the performance of the target task by transferring knowledge from source tasks to the target task. "What to transfer" is a main research issue in transfer learning. The existing transfer learning method generally needs to acquire the shared parameters by integrating human knowledge. However, in many real applications, an understanding of which parameters can be shared is unknown beforehand. Transfer learning model is essentially a special multi-objective optimization problem. Consequently, this paper proposes a novel auto-sharing parameter technique for transfer learning based on multi-objective optimization and solves the optimization problem by using a multi-swarm particle swarm optimizer. Each task objective is simultaneously optimized by a sub-swarm. The current best particle from the sub-swarm of the target task is used to guide the search of particles of the source tasks and vice versa. The target task and source task are jointly solved by sharing the information of the best particle, which works as an inductive bias. Experiments are carried out to evaluate the proposed algorithm on several synthetic data sets and two real-world data sets of a school data set and a landmine data set, which show that the proposed algorithm is effective. [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]

Multimedia is inconvenient to use, difficult to maintain, and redundant in data storage. In order to solve the above problems and apply cloud storage to the integration of university teaching resources, this paper designs a virtualized cloud storage platform for university multimedia classrooms. The platform has many advantages, such as reducing the initial investment in multimedia classrooms, simplifying management tasks, making maximum use of actual resources and easy access to resources. Experiments and analysis show the feasibility and effectiveness of the platform. Aiming at the problems of the single-node repair algorithm of the existing multimedia cloud storage system, the limited domain is large, the codec complexity is high, the disk I/O (Input/Output) cost is high, the storage overhead and the repair bandwidth are unbalanced, and a network coding-based approach is proposed. Multimedia cloud storage. System single node repair algorithm. The algorithm stores the grouped multimedia file data in groups in the system, and performs XOR (exclusive OR) on the data in the group on the GF(2) finite field. When some nodes fail, the new node only needs to be connected. Two to three non-faulty nodes in the same group can accurately repair the data in the failed node. Theoretical analysis and simulation results show that the algorithm can reduce the complexity and repair of the codec, and reduce the disk I/O overhead. In this case, the storage cost of the algorithm is consistent with the storage cost based on the minimum storage regeneration code algorithm, and the repair bandwidth cost is close to the minimum bandwidth regeneration code algorithm. [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]

Spatial clustering is one of the main techniques for spatial data mining and spatial data analysis. However, existing spatial clustering methods primarily focus on points distributed in planar space with the Euclidean distance measurement. Recently, NS-DBSCAN has been developed to perform clustering of spatial point events in Network Space based on a well-known clustering algorithm, named Density-Based Spatial Clustering of Applications with Noise (DBSCAN). The NS-DBSCAN algorithm has efficiently solved the problem of clustering network constrained spatial points. When compared to the NC_DT (Network-Constraint Delaunay Triangulation) clustering algorithm, the NS-DBSCAN algorithm efficiently solves the problem of clustering network constrained spatial points by visualizing the intrinsic clustering structure of spatial data by constructing density ordering charts. However, the main drawback of this algorithm is when the data are processed, objects that are not specifically categorized into types of clusters cannot be removed, which is undeniably a waste of time, particularly when the dataset is large. In an attempt to have this algorithm work with great efficiency, we thus recommend removing edges that are longer than the threshold and eliminating low-density points from the density ordering table when forming clusters and also take other effective techniques into consideration. In this paper, we develop a theorem to determine the maximum length of an edge in a road segment. Based on this theorem, an algorithm is proposed to greatly improve the performance of the density-based clustering algorithm in network space (NS-DBSCAN). Experiments using our proposed algorithm carried out in collaboration with Ho Chi Minh City, Vietnam yield the same results but shows an advantage of it over NS-DBSCAN in execution time. [ABSTRACT FROM AUTHOR]

The aim of this paper is to introduce and study different kinds of fuzzy soft β-neighborhoods called fuzzy soft β-adhesion neighborhoods and to analyze some of their properties. Further, the concepts of soft β-adhesion neighborhoods are investigated and the related properties are studied. Then, we present new kinds of lower and upper approximations by means of different fuzzy soft β-neighborhoods. The relationships among our models (i.e., Definitions 3.9, 3.12, 3.15 and 3.18) and Zhang models [48] are also discussed. Finally, we construct an algorithm based on Definition 3.12, when k = 1 to solve the decision-making problems and illustrate its applicability through a numerical example. [ABSTRACT FROM AUTHOR]

Compared with the traditional negative selection algorithms produce detectors randomly in whole state space, the boundary-fixed negative selection algorithm (FB-NSA) non-randomly produces a layer of detectors closely surrounding the self space. However, the false alarm rate of FB-NSA is higher than many anomaly detection methods. Its detection rate is very low when normal data close to the boundary of state space. This paper proposed an improved FB-NSA (IFB-NSA) to solve these problems. IFB-NSA enlarges the state space and adds auxiliary detectors in appropriate places to improve the detection rate, and uses variable-sized training samples to reduce the false alarm rate. We present experiments on synthetic datasets and the UCI Iris dataset to demonstrate the effectiveness of this approach. The results show that IFB-NSA outperforms FB-NSA and the other anomaly detection methods in most of the cases. [ABSTRACT FROM AUTHOR]

At present, the correct recognition rate of face recognition algorithm is limited under unconstrained conditions. To solve this problem, a face recognition algorithm based on deep learning under unconstrained conditions is proposed in this paper. The algorithm takes LBP texture feature as the input data of deep network, and trains the network layer by layer greedily to obtain optimized parameters of network, and then uses the trained network to predict the test samples. Experimental results on the face database LFW show that the proposed algorithm has higher correct recognition rate than some traditional algorithms under unconstrained conditions. In order to further verify its effectiveness and universality, this algorithm was also tested in YALE and YALE-B, and achieved a high correct recognition rate as well, which indicated that the deep learning method using LBP texture feature as input data is effective and robust to face recognition. [ABSTRACT FROM AUTHOR]

Approximate multi-pattern matching is an important issue that is widely and frequently utilized, when the pattern contains variable-length wildcards. In this paper, two suffix array-based algorithms have been proposed to solve this problem. Suffix array is an efficient data structure for exact string matching in existing studies, as well as for approximate pattern matching and multi-pattern matching. An algorithm called MMSA-S is for the short exact characters in a pattern by dynamic programming, while another algorithm called MMSA-L deals with the long exact characters by the edit distance method. Experimental results of Pizza & Chili corpus demonstrate that these two newly proposed algorithms, in most cases, are more time-efficient than the state-of-the-art comparison algorithms. [ABSTRACT FROM AUTHOR]

This paper investigates the electric vehicle routing problem with time windows and nonlinear charging constraints (EVRPTW-NL), which is more practical due to battery degradation. A hybrid algorithm combining an improved differential evolution and several heuristic (IDE) is proposed to solve this problem, where the weighted sum of the total trip time and customer satisfaction value is minimized. In the proposed algorithm, a special encoding method is presented that considers charging stations features. Then, a battery charging adjustment (BCA) strategy is integrated to decrease the charging time. Furthermore, a novel negative repair strategy is embedded to make the solution feasible. Finally, several instances are generated to examine the effectiveness of the IDE algorithm. The high performance of the IDE algorithm is shown in comparison with two efficient algorithms. [ABSTRACT FROM AUTHOR]

Today with the outbreak of the COVID-19 many people prefer to stay home and buy their required products from online sellers and receive them in their home or office at their desired times. This change has increased the workload of online retailers. In an online retailing system, lots of orders containing different products arrive dynamically and must be delivered in the due dates requested by customers, so there is a limited time to retrieve products from their storage locations, pack them, load them on trucks, and deliver to their destinations. In this study, we deal with the integrated order batching and delivery planning of an online retailer that stores a variety of products in a warehouse and sells them online. A mixed-integer nonlinear programming model is proposed that decides on order batching, scheduling of batches, assigning orders to trucks, and scheduling and routing of trucks simultaneously in an offline setting. This model clarifies the domain of the problem and its complexity. Two rule-based heuristic algorithms are developed to solve the problem in the online setting. The first algorithm deals with two sub-problems of order batching and delivery planning separately and sequentially, while the second algorithm considers the relationship between two sub-problems. An extensive numerical experiment is carried out to evaluate the performance of algorithms in different problem sizes, demonstrating that the second algorithm by integrating two sub-problems leads to a minimum of 14% reduction in cost per delivered order, as the main finding of this study. Finally, the effect of several parameters on the performance of algorithms is analyzed through a sensitivity analysis, and some managerial insights are provided to help the retail managers with their decision-making that are the other findings of this paper. [ABSTRACT FROM AUTHOR]

Multigranulation rough set (MGRS) theory provides an effective manner for the problem solving by making use of multiple equivalence relations. As the information systems always dynamically change over time due to the addition or deletion of multiple objects, how to efficiently update the approximations in multigranulation spaces by making fully utilize the previous results becomes a crucial challenge. Incremental learning provides an efficient manner because of the incorporation of both the current information and previously obtained knowledge. In spite of the success of incremental learning, well-studied findings performed to update approximations in multigranulation spaces have relatively been scarce. To address this issue, in this paper, we propose matrix-based incremental approaches for updating approximations from the perspective of multigranulation when multiple objects vary over time. Based on the matrix characterization of multigranulation approximations, the incremental mechanisms for relevant matrices are systematically investigated while adding or deleting multiple objects. Subsequently, in accordance with the incremental mechanisms, the corresponding incremental algorithms for maintaining multigranulation approximations are developed to reduce the redundant computations. Finally, extensive experiments on eight datasets available from the University of California at Irvine (UCI) are conducted to verify the effectiveness and efficiency of the proposed incremental algorithms in comparison with the existing non-incremental algorithm. [ABSTRACT FROM AUTHOR]

In the modern power system analysis, the investigation on the impacts of growing wind power generation can be mentioned as an inseparable part of power grids. The development of wind-thermal coordination economic dispatch leads to an optimal dispatch scheme and a mature wind power efficiency. Adding further uncertainties to the study of power systems is one of the effects of intermittent nature of wind energy which is apart from random nature of realistic power grids. Now in order to inspect these uncertainties, an efficient probabilistic method is needed to comfort the issue. In this paper a novel optimization method based on Social Spider Optimization (SSO) is presented to meet large non-convex Economic Dispatch (ED) problems and uncertainties in the network caused by wind turbines, simultaneously. To provide a more realistic model, following constrains have been included in the proposed Probabilistic ED (PED) formulation: ramp rate limits, Prohibited Operating Zones (POZs), system spinning reserve, valve loading consequences, and multiple fuel choice. Unscented Transform (UT) approach is utilized in this paper to model the uncertainty in wind speed and thereupon solve the PED. In order to show the efficiency of the presented algorithm, it is successfully tested on different systems and compared with several of the most recently published ED methods. [ABSTRACT FROM AUTHOR]

In this paper we tackle the problem of verifying whether a scenario is executable in a Petri net. In contrast to sequentially ordered runs, a scenario includes both information about dependencies and independencies of events. Consequently, a scenario allows a precise and intuitive specification of a run of a concurrent or distributed system. In this paper we consider Petri nets with arc weights, namely marked place/transition-nets (p/t-nets) and p/t-nets with inhibitor arcs (pti-nets). A scenario of a p/t-net is a labelled partial order (lpo). A scenario of a pti-net is a labelled stratified order structure (lso). Accordingly, the question is either whether a given lpo is in the language of a given p/t-net or whether an lso is in the language of a given pti-net. Different approaches exist to define the partial language of a Petri net. Each definition yields a different verification algorithm, but existing algorithms perform quite poorly in terms of runtime for most examples. We introduce a new compact characterization of the partial language of a Petri net. This characterization is optimized with respect to the verification problem. The paper is a revised and extended version of the conference paper [10]. [ABSTRACT FROM AUTHOR]

This paper aims to propose an effective intelligent optimization method to solve the multi-objective distribution feeder reconfiguration (DFR) problem considering distributed generations (DGs). In this regard, we introduce a novel population based algorithm based on krill herd (KH) algorithm to solve the multi-objective distribution feeder reconfiguration problem considering DG units. In order to improve the search ability of the algorithm, a new modification process is proposed too. This modification enhances the overall outcome of the KH algorithm in both search and convergence area. During the search process of the proposed modified KH (MKH) algorithm, the achieved non-dominated solutions are stored in an external repository. Owing to distinctive objective functions, a fuzzy clustering technique is applied to control the size of the repository within the restrictions. The objective functions considered in this paper are power losses, voltage deviation of buses and total cost of the active power produced by DG units and distribution companies. In order to evaluate the feasibility and effectiveness of the method, the proposed approach is tested on a distribution test system. [ABSTRACT FROM AUTHOR]

Community detection aims to discover cohesive groups in which people connect with each other closely in social networks. A variety of methods have been proposed to detect communities in social networks. However, there is still few work to make a comparative study on those methods. In this paper, we first introduce and compare several representative methods on community detection. Then we implement those methods with python and make a comparative analysis on different real world social networking data sets. The experimental results have shown that GN algorithm is suitable for small networks, while LPA algorithm has a better scalability. FU algorithm is of the best stability. This work could help researchers to understand the ideas of community detection methods better and select appropriate method on demand more easily. [ABSTRACT FROM AUTHOR]

The paper presents an interactive programming approach to find the compromise optimal solution of the multi-level multi-objective linear programming problem. The solving process can be divided into analysis stage and decision-making stage. In the analysis stage, an evaluation function is constructed to express the difference between the objective and ideal values. In the decision-making stage, decision maker can compare the objective values with ideal values. If there has unsatisfied objective values, decision maker can make a concession of the satisfied values to improve the unsatisfied values. When the satisfactory degree of decision maker in upper levels have been mat, the problem of lower levels will be in solving. A characteristic of the proposed method comes from its continuous interaction with the decision maker. Finally, a numerical example is solved by this algorithm. [ABSTRACT FROM AUTHOR]

Dhanasekar et al. (International Journal of Fuzzy Systems 19 (2017) 1479-1491) proposed a fuzzy Hungarian MODI algorithm to solve fully fuzzy transportation problems. Dhanasekar et al. have used the standard multiplication of trapezoidal fuzzy numbers in their proposed method. In this paper, it is pointed out that the method, proposed by Dhanasekar et al., is not valid for standard multiplication of trapezoidal fuzzy numbers and is valid only if a special type of multiplication of fuzzy numbers is used. [ABSTRACT FROM AUTHOR]

This paper presents a novel complex neutrosophic soft expert set (CNSES) concept. The range of values of CNSES is extended to the unit circle in the complex plane by adding an additional term called the phase term which describes CNSES's elements in terms of the time aspect. CNSES is a hybrid structure of soft sets and single-valued neutrosophic sets (SVNSs) defined in a complex setting where the experts' opinions are included, thus making it highly suitable for use in decision-making problems that involve uncertain and indeterminate data where the time factor plays a key role in determining the final decision. Based on this new concept we define some concepts related to this notion as well as some basic operations namely the complement, union, intersection, AND and OR. The basic properties and relevant laws pertaining to this concept such as the De Morgan's laws are also verified. Lastly, we propose an algorithm to solve complex neutrosophic soft expert decision-making problem by converting it from the complex state to the real state and subsequently provided the detailed decision steps. This study is supported by the comparison with other existing methods. [ABSTRACT FROM AUTHOR]

Multi-objective particle swarm optimization (MOPSO) algorithms are shown to have enormous potential in solving multi-objective optimization problems (MOPs). However, most MOPSO is difficult to balance the exploration and exploitation, which may cause some problems to find true Pareto fronts when tackling some complex MOPs. A multi-objective decomposition particle swarm optimization based on completion-checking (C-DMOPSO) is improved in this paper. The updating mode of velocity is changed dynamically according to the algorithm's evolutionary process, which balances the exploration and exploitation effectively. In addition, simulated binary crossover and opposition-based learning are adopted to improve the diversity, and the archive set strategy is added to store the optimal solutions. Furthermore, polynomial mutation is performed in archive. The effectiveness of the proposed algorithm is tested by nineteen standard functions, including ZDT, DTLZ and UF, and the experimental results show that C-DMOPSO performs better on most of test problems. [ABSTRACT FROM AUTHOR]

In this paper, we propose fuzzy reasoning algorithms based on similarity for fuzzy modus ponens and fuzzy modus tollens and discuss the reducibility of the algorithms. Moreover, we investigate the robustness of fuzzy reasoning algorithms based on similarity. [ABSTRACT FROM AUTHOR]

This paper addresses a selective maintenance optimization problem for a fuzzy multi-state system composed of fuzzy multi-state elements. Due to insufficient data and unpredictable external working conditions, both the performance capacity and states transition intensities of multi-state elements cannot be known precisely, but are represented by fuzzy numbers. Additionally, both the durations of a break and a succeeding mission are also treated as fuzzy values. To maximize the fuzzy probability of a system successfully completing a succeeding mission, a selective maintenance model is proposed to identify an optimal subset of maintenance activities to be performed on some elements in the system. A solution algorithm containing three rules to eliminate inferior solutions and narrowdown elements' states combinations is proposed to resolve the new selective maintenance model in a computationally efficient manner. An illustrative example of an archibald is presented to demonstrate the effectiveness of the proposed model. [ABSTRACT FROM AUTHOR]

Intuitionistic fuzzy soft set (IFSS) provides more efficient and flexible tool than ordinary fuzzy soft set (FSS) to express decision makers' opinions in real-world decision problems. Until now, different researchers have designed different algorithms for ranking objects in order to select the best option in group decision-making problems under intuitionistic fuzzy soft environment. In this paper, an adjustable algorithm is developed to handle the problem of group decision-making based on a preference relationship of IFSSs. The effectiveness of this approach in comparison with some existing methods is also demonstrated. To achieve the higher level of compatibility with the real-world problems, the proposed algorithm here is extended to the weighted case. [ABSTRACT FROM AUTHOR]

Fast and accurate detection of fault location in distribution networks, is one of the important issues in operation of the system. In this paper, an approach based on Binary Imperialistic Competitive algorithm and Nelder-Mead simplex search has been proposed for placement of fault indicators in distribution networks. By using this method, the problem of locating fault indicators can be solved faster and more accurately by minimizing of cost function. In this paper, in addition to describing the BICA-NM hybrid algorithm, the fault indicator placement has been implemented using this method on a test system, and the simulation results have been compared with Genetic algorithm (GA), Binary Shuffled Frog Leap Algorithm (BSFLA) and Improved BSFLA (IBSFLA) and the accuracy and fastness of the proposed method has been demonstrated. [ABSTRACT FROM AUTHOR]

In this paper, an improved MLPG method has been introduced to simplify the algorithm and thus make it more suitable for dealing with engineering problems with complex domains. In the case of a complex domain with an irregular global boundary, it can be very hard to determine the intersections between the local sub-domains and the global boundary. The improvements of the MLPG method make the MLPG method only require the domain integrations. The intersections between local sub-domains and the global boundary as well as boundary integrations have been avoided. A rectangular problem domain and a circular problem domain with exact solutions have been studied in this paper to investigate the accuracy of the improved MLPG method. The results show that compared to the regular MLPG method, the improved MLPG method can have the same accuracy, but the improved method is much easier to deal with irregular boundaries or complex problem domains. [ABSTRACT FROM AUTHOR]

In some cases of using multi-criteria decision making methods for solving real-world problems ratings of alternatives cannot be determined precisely, and that is why they are expressed in the form of intervals. Therefore, the aim of this paper is to extend the MOORA method for solving decision making problems with interval data. By extending the ratio system part of MOORA method, an algorithm to determine the most preferable alternative among all possible alternatives, when performance ratings are given as intervals, is presented. Finally, an example is shown to highlight the proposed procedure, at the end of this paper. [ABSTRACT FROM AUTHOR]

There are several papers in the literature in which generalized fuzzy numbers are used for solving real life problems but to the best of our knowledge, till now no one has used generalized fuzzy numbers for solving the maximal flow problems. In this paper, the existing algorithm is modified to find fuzzy maximal flow between source and sink by representing all the parameters as generalized triangular fuzzy numbers. To illustrate the modified algorithm a numerical example is solved and the obtained results are compared with the existing results. If there is no uncertainty about the flow between source and sink then the proposed algorithm gives the same result as in crisp maximal flow problems. [ABSTRACT FROM AUTHOR]