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]

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]

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 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]

As far as mobile edge computing is concerned, it is necessary to ensure the data integrity of latency-sensitive applications during the process of computing. While certain research programs have demonstrated efficacy, challenges persist, including the inefficient utilization of computing resources, network backhaul issues, and the occurrence of false-negative detections. To solve these problems, an integrity protection scheme is proposed in this paper on the basis of data right confirmation (DRC). Under this scheme, a two-layer consensus algorithm is developed. The outer algorithm is applied to establish a data authorization mechanism by marking the original data source to avoid the false negative results caused by network attacks from the data source. In addition, blockchain-based mobile edge computing (BMEC) technology is applied to enable data sharing in the context of mobile edge computing while minimizing the network backhaul of edge computing. Based on the Merkle Tree algorithm, the inner layer algorithm is capable not only of accurately locating and promptly repairing damaged data but also of verifying all servers in the mobile edge computing network either regularly or on demand. Finally, our proposal is evaluated against two existing research schemes. The experimental results show that our proposed scheme is not only effective in ensuring data integrity in mobile edge computing, but it is also capable of achieving better performance. [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]

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]

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]

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]

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]

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]

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]

In order to solve the problems of high computational complexity, poor dimensionality reduction, and reduced clustering effect when the clustering task faces a large amount of big data, the application of a large data adaptive semi-supervised clustering method based on deep learning is proposed. Through the self-encoder of the deep clustering network, the analysis of the confrontation network is generated, and the semi-supervised deep clustering algorithm and algorithm of the adaptive strategy are optimized. Through the encoder layer structure of the deep coding network, different parameters are set for all data sets for algorithm experimental analysis. The results show that the data obtained by this method is faster, more accurate and more optimized than the traditional clustering method, which proves the effectiveness of the method. [ABSTRACT FROM AUTHOR]

In this work, modified constant modulus algorithm based on bat algorithm is proposed for wireless sensor communications systems. The bat algorithm is a swarm intelligence optimization algorithm, which mainly used to solve optimization problems. The proposed algorithm focused on modified constant modulus algorithm, which is also applicable to the constant modulus algorithm. The error function of blind equalization algorithm is used as the evaluation function of the bat algorithm, and then the initial value of the weight vector is calculated adaptively by the bat algorithm. Theoretical analysis is provided to illustrate that the proposed algorithm has a faster convergence speed than the original one and is suitable for almost all blind channel equalization algorithms. The simulation results support the newly proposed improved algorithm. The proposed algorithm could be applied to some more complex wireless channel environments to improve the reception performance of sensor communication systems. [ABSTRACT FROM AUTHOR]

BACKGROUND: The gangue content in coal seriously affects the calorific value produced by its combustion. In practical applications, gangue in coal needs to be completely separated. The pseudo-dual-energy X-ray method does not have high sorting accuracy. OBJECTIVE: This study aims to propose a novel multi-dimensional coal and gangue X-ray sorting algorithm based on CdZnTe photon counting detectors to solve the problem of coal and gangue sorting by X-ray. METHODS: This complete algorithm includes five steps: (1) Preferred energy bins, (2) transmittance sorting, (3) one-dimensional R-value sorting, (4) two-dimensional R-value sorting, and (5) three-dimensional R-value sorting. The output range of each step is determined by prior information from 65 groups of coal and gangue. An additional 110 groups of coal and gangue are employed experimentally to validate the algorithm's accuracy. RESULTS: Compared with the 60% sorting accuracy of the Pseudo-dual-energy method, the new algorithm reached a sorting accuracy of 99%. CONCLUSIONS: Study results demonstrate the superiority of this novel algorithm and its feasibility in practical applications. This novel algorithm can guide other two-substance X-ray sorting applications based on photon counting detectors. [ABSTRACT FROM AUTHOR]

In order to solve the problem that the traditional DWA algorithm cannot have both safety and speed because of the fixed parameters in the complex environment with many obstacles, a parameter adaptive DWA algorithm (PA-DWA) is proposed to improve the robot running speed on the premise of ensuring safety. Firstly, the velocity sampling space is optimized by the current pose of the mobile robot, and a criterion of environment complexity is proposed. Secondly, a parameter-adaptive method is presented to optimize the trajectory evaluation function. When the environment complexity is greater than a certain threshold, the minimum distance between the mobile robot and the obstacle is taken as the input, and the weight of the velocity parameter is adjusted according to the real-time obstacle information dynamically. The current velocity of the mobile robot is used as input to dynamically adjust the weight of the direction angle parameter. In the Matlab simulation, the total time consumption of PA-DWA is reduced by 47.08% in the static obstacle environment and 39.09% in the dynamic obstacle environment. In Gazebo physical simulation experiment, the total time of PA-DWA was reduced by 26.63% in the case of dynamic obstacles. The experimental results show that PA-DWA can significantly reduce the total time of the robot under the premise of ensuring safety. [ABSTRACT FROM AUTHOR]

To solve the problem of missing or distorted detail texture when manually adjusting image parameters, a weak illumination image enhancement algorithm based on cyclic generation game network is proposed. The image features are normalized by Gaussian distribution. Combined with homomorphic filtering theory and defogging operation, the image is generated and denoised according to the network brightness to enhance the weak illumination image. The experimental results show that after using this method to process the image, the image entropy increases by 6.8%, the contrast increases by 27.5%, and the noise content decreases by 24.1%. It has better contrast. It can not only meet the enhancement effect of weak light, but also ensure the details of the image, so that the image has richer details and good visual appearance. [ABSTRACT FROM AUTHOR]

The modified bee colony algorithm is one of the excellent methods that has been proposed in recent years for data clustering. This MBCO algorithm randomly values the primary centers of the cluster by selecting a number of data from the data set, which makes the algorithm sensitive to the presence of noise and outgoing data in the data set and reduces its performance. Therefore, to solve this problem, the proposed method used three approaches to quantify the initial centers of the clusters. In the proposed method, first the initial centers of the clusters are generated by chaos methods, KMeans++algorithm and KHM algorithm to determine the optimal position for the centers. Then the MBCO algorithm starts working with these centers. The performance of the proposed method compared to a number of other clustering methods was evaluated on 7 UCI datasets based on 6 clustering evaluation criteria. For example, in the iris data set, the proposed method with chaos approaches, KHM and KMeans++with accuracy of 0.8725, 0.8737 and 0.8725, respectively, and the MBCO method with accuracy of 0.8678, and in terms of CH criteria, the proposed method with chaotic approaches, KHM and KMeans++reached values of 0.3901, 0.54848, 0.5147 and MBCO method of 0.3620, respectively. Better achieved. In general, the results of the experiments according to the 6 evaluation criteria showed better performance of the proposed method compared to other methods in most data sets according to the 6 evaluation criteria. [ABSTRACT FROM AUTHOR]

In order to solve the problems of high node loss rate, high time overhead and high risk of privacy disclosure in network node privacy information protection, an ultra dense network node privacy information protection algorithm based on edge computing is proposed. The weight update algorithm is used to detect the security vulnerabilities of ultra dense network nodes. According to the detection results, the characteristics of node vulnerabilities are obtained, the sensitive label information of node vulnerabilities is protected through the weighted graph, and the k-anonymity technology is used to anonymize the privacy information of ultra dense network nodes; Finally, edge computing is used to protect the privacy information of nodes. The experimental results show that the node loss rate of the proposed method is always less than 2%, the time overhead is small, and the risk coefficient of privacy disclosure is small. [ABSTRACT FROM AUTHOR]

Boosting methods are known to increase performance outcomes by using multiple learners connected sequentially. In particular, Adaptive boosting (AdaBoost) has been widely used owing to its comparatively improved predictive results for hard-to-learn samples based on misclassification costs. Each weak learner minimizes the expected risk by assigning high misclassification costs to suspect samples. The performance of AdaBoost depends on the distribution of noise samples because the algorithm tends to overfit noisy samples. Various studies have been conducted to address the noise sensitivity issue. Noise-filtering methods used in AdaBoost remove samples defined as noise based on the degree of misclassification to prevent overfitting to noisy samples. However, if the difference in the classification difficulty between classes is considerable, it is easy for samples from classes that are difficult to classify to be defined as noise. This situation is common with imbalanced datasets and can adversely affect performance outcomes. To solve this problem, this study proposes a new noise detection algorithm for AdaBoost that considers differences in the classification difficulty of classes and the characteristics of iteratively recalculated sample weight distributions. Experimental results on ten imbalanced datasets with various degrees of imbalanced ratios demonstrate that the proposed method defines noisy samples properly and improves the overall performance of AdaBoost. [ABSTRACT FROM AUTHOR]

High utility quantitative itemsets (HUQI) mining is a new research topic in the field of data mining. It not only provides high utility itemset (HUI), but also provides quantitative information of individual item in the itemset. HUQI can provide decision makers with information about items and their purchase quantities. However, the currently proposed HUQI mining algorithms assume that the datasets are static. In order to solve this problem, an incremental quantitative utility list (IQUL) data structure is proposed to store item information, including item name, item number, transaction weight utility of item, each entry in the list stores the transaction identifier, the utility of the original data, the remaining utility, the utility of the incremental data, the remaining utility, and the sum of the utility and the remaining utility. When data is inserted, the item information will be updated. Based on IQUL, an incrementally updating HUQI (IHUQI) mining algorithm is proposed to mine HUQI on incremental update data. A large number of experiments on real datasets show that the IHUQI algorithm can effectively mine HUQI Experimental results show better performance on sparse datasets. [ABSTRACT FROM AUTHOR]

To solve the problems of the Bouc-Wen model with multi-identification parameters, low accuracy, complex methods, and difficulty in implement, this study proposes a new way for parameter identification of the Bouc-Wen model of the magnetorheological (MR) damper by parameter sensitivity analysis and modified PSO algorithm. The one-at-a-time method (OAT) of local sensitivity analysis is utilized to analyze the unknown parameters in the Bouc-Wen model to complete the model simplification. Then, the modified PSO algorithm is used to identify the parameters of the simplified Bouc-Wen model. Finally, with the relationship between the currents and identified parameters, a Bouc-Wen model for current control is constructed by the curve fitting method. The results confirm that the parameter identification efficiency achieved via the parameter sensitivity analysis is improved by 50% by reducing the parameters of the Bouc-Wen model from 8 to 4. Then, compared with the standard PSO (SPSO) algorithm, the modified one is accurate and stable, and the convergence speed is increased by 17.65% on average. At last, compared with the test data under three different sinusoidal excitations, the model's accuracy is 89.11%, 92.56%, and 87.45%, respectively. The method proposed in this research can rapidly and accurately identify the Bouc-Wen model and lays a theoretical foundation for applying the MR damper model in vibration control. [ABSTRACT FROM AUTHOR]

The objective of this study is to apply an improved Faster-RCNN model in order to solve the problems of low detection accuracy and slow detection speed in spark plug defect detection. In detail, an attention module based symmetrical convolutional network (ASCN) is designed as the backbone to extract multi-scale features. Then, a multi-scale region generation network (MRPN), in which InceptionV2 is used to achieve sliding windows of different scales instead of a single sliding window, is proposed and tested. Additionally, a dataset of X-ray spark plug images is established, which contains 1,402 images. These images are divided into two subsets with a ratio of 4:1 for training and testing the improved Faster-RCNN model, respectively. The proposed model is transferred and learned on the pre-training model of MS COCO dataset. In the test experiments, the proposed method achieves an average accuracy of 89% and a recall of 97%. Compared with other Faster-RCNN models, YOLOv3, SSD and RetinaNet, our proposed new method improves the average accuracy by more than 6% and the recall by more than 2%. Furthermore, the new method can detect at 20fps when the input image size is 1024×1024×3 and can also be used for real-time automatic detection of spark plug defects. [ABSTRACT FROM AUTHOR]

In order to solve the clustering problem with incomplete and categorical matrix data sets, and considering the uncertain relationship between samples and clusters, a set pair k-modes clustering algorithm is proposed (MD-SPKM). Firstly, the correlation theory of set pair information granule is introduced into k-modes clustering. By improving the distance formula of traditional k-modes algorithm, a set pair distance measurement method between incomplete matrix samples is defined. Secondly, considering the uncertain relationship between the sample and the cluster, the definition of the intra-cluster average distance and the threshold calculation formula to determine whether the sample belongs to multiple clusters is given, and then the result of set pair clustering is formed, which includes positive region, boundary region and negative region. Finally, through the selected three data sets and four contrast algorithms for experimental evaluation, the experimental results show that the set pair k-modes clustering algorithm can effectively handle incomplete categorical matrix data sets, and has good clustering performance in Accuracy, Recall, ARI and NMI. [ABSTRACT FROM AUTHOR]

Diabetes is a disease that seriously endangers human health. Early detection and early treatment can reduce the likelihood of complications and mortality. The predictive model can effectively solve the above problems and provide helpful information for the clinic. Based on this, it is proposed to apply the idea of integrated algorithm in DBN algorithm, collect the hospital data by investigating its related factors, clean and process the collected data, and sample and model the processed data multiple times. It is shown that a single DBN classifier is better than support vector machine and logistic regression algorithm. The model established by the integrated deep confidence network has a significant improvement in classification accuracy compared to a single DBN classifier, and solves the unstable classification effect of a single DBN classifier. [ABSTRACT FROM AUTHOR]

PURPOSE: Total Variation (TV) minimization algorithm is a classical compressed sensing (CS) based iterative image reconstruction algorithm that can accurately reconstruct images from sparse-view projections in computed tomography (CT). However, the system matrix used in the algorithm is often too large to be stored in computer memory. The purpose of this study is to investigate a new TV algorithm based on image rotation and without system matrix to avoid the memory requirement of system matrix. METHODS: Without loss of generality, a rotation-based adaptive steepest descent-projection onto convex sets (R-ASD-POCS) algorithm is proposed and tested to solve the TV model in parallel beam CT. Specifically, simulation experiments are performed via the Shepp-Logan, FORBILD and real CT image phantoms are used to verify the inverse-crime capability of the algorithm and evaluate the sparse reconstruction capability and the noise suppression performance of the algorithm. RESULTS: Experimental results show that the algorithm can achieve inverse-crime, accurate sparse reconstruction and thus accurately reconstruct images from noisy projections. Compared with the classical ASD-POCS algorithm, the new algorithm may yield the similar image reconstruction accuracy without use of the huge system matrix, which saves the computational memory space significantly. Additionally, the results also show that R-ASD-POCS algorithm is faster than ASD-POCS. CONCLUSIONS: The proposed new algorithm can effectively solve the problem of using huge memory in large scale and iterative image reconstruction. Integrating with ASD-POCS frame, this no-system-matrix based scheme may be readily extended and applied to any iterative image reconstructions. [ABSTRACT FROM AUTHOR]