Application of Euler Neural Networks with Soft Computing Paradigm to Solve Nonlinear Problems Arising in Heat Transfer

In this study, a novel application of neurocomputing technique is presented for solving nonlinear heat transfer and natural convection porous fin problems arising in almost all areas of engineering and technology, especially in mechanical engineering. The mathematical models of the problems are exploited by the intelligent strength of Euler polynomials based Euler neural networks (ENN’s), optimized with a generalized normal distribution optimization (GNDO) algorithm and Interior point algorithm (IPA). In this scheme, ENN’s based differential equation models are constructed in an unsupervised manner, in which the neurons are trained by GNDO as an effective global search technique and IPA, which enhances the local search convergence. Moreover, a temperature distribution of heat transfer and natural convection porous fin are investigated by using an ENN-GNDO-IPA algorithm under the influence of variations in specific heat, thermal conductivity, internal heat generation, and heat transfer rate, respectively. A large number of executions are performed on the proposed technique for different cases to determine the reliability and effectiveness through various performance indicators including Nash–Sutcliffe efficiency (NSE), error in Nash–Sutcliffe efficiency (ENSE), mean absolute error (MAE), and Thiel’s inequality coefficient (TIC). Extensive graphical and statistical analysis shows the dominance of the proposed algorithm with state-of-the-art algorithms and numerical solver RK-4.     

Magnetic-resonance image segmentation based on improved variable weight multi-resolution Markov random field in undecimated complex wavelet domain

To solve the problem that the magnetic resonance (MR) image has weak boundaries, large amount of information, and low signal-to-noise ratio, we propose an image segmentation method based on the multi-resolution Markov random field (MRMRF) model. The algorithm uses undecimated dual-tree complex wavelet transformation to transform the image into multiple scales. The transformed low-frequency scale histogram is used to improve the initial clustering center of the K-means algorithm, and then other cluster centers are selected according to the maximum distance rule to obtain the coarse-scale segmentation. The results are then segmented by the improved MRMRF model. In order to solve the problem of fuzzy edge segmentation caused by the gray level inhomogeneity of MR image segmentation under the MRMRF model, it is proposed to introduce variable weight parameters in the segmentation process of each scale. Furthermore, the final segmentation results are optimized. We name this algorithm the variable-weight multi-resolution Markov random field (VWMRMRF). The simulation and clinical MR image segmentation verification show that the VWMRMRF algorithm has high segmentation accuracy and robustness, and can accurately and stably achieve low signal-to-noise ratio, weak boundary MR image segmentation.     

Effects of initial states on the quantum correlations in the generalized Grover search algorithm

We investigate the correlations between two qubits in the Grover search algorithm with arbitrary initial states by numerical simulation. Using a set of suitable bases, we construct the reduced density matrix and give the numerical expression of correlations relating to the iterations. For different initial states, we obtain the concurrence and quantum discord compared with the success probability in the algorithm. The results show that the initial states affect the correlations and the limit point of the correlations in the searching process. However, the initial states do not influence the whole cyclical trend.     

一种基于谱线幅值归零的加窗插值FFT谐波检测方法

提出了一种基于谱线幅值归零的加窗插值FFT谐波检测方法用于分析复杂电网信号中的各次谐波.该检测方法将每一次在离散频谱中找到的最大谱线及其左右两侧的数根谱线幅值归零,直到各次谐波分析完毕.通过仿真实验分析了在基波频率稳定时对模拟信号的测量精度,研究了基波频率波动对谐波分析的影响.通过对EAST实验数据的分析,验证了该谐波...     

Intelligent Fault Diagnosis of Rolling-Element Bearings Using a Self-Adaptive Hierarchical Multiscale Fuzzy Entropy

The fuzzy-entropy-based complexity metric approach has achieved fruitful results in bearing fault diagnosis. However, traditional hierarchical fuzzy entropy (HFE) and multiscale fuzzy entropy (MFE) only excavate bearing fault information on different levels or scales, but do not consider bearing fault information on both multiple layers and multiple scales at the same time, thus easily resulting in incomplete fault information extraction and low-rise identification accuracy. Besides, the key parameters of most existing entropy-based complexity metric methods are selected based on specialist experience, which indicates that they lack self-adaptation. To address these problems, this paper proposes a new intelligent bearing fault diagnosis method based on self-adaptive hierarchical multiscale fuzzy entropy. On the one hand, by integrating the merits of HFE and MFE, a novel complexity metric method, named hierarchical multiscale fuzzy entropy (HMFE), is presented to extract a multidimensional feature matrix of the original bearing vibration signal, where the important parameters of HMFE are automatically determined by using the bird swarm algorithm (BSA). On the other hand, a nonlinear feature matrix classifier with strong robustness, known as support matrix machine (SMM), is introduced for learning the discriminant fault information directly from the extracted multidimensional feature matrix and automatically identifying different bearing health conditions. Two experimental results on bearing fault diagnosis show that the proposed method can obtain average identification accuracies of 99.92% and 99.83%, respectively, which are higher those of several representative entropies reported by this paper. Moreover, in the two experiments, the standard deviations of identification accuracy of the proposed method were, respectively, 0.1687 and 0.2705, which are also greater than those of the comparison methods mentioned in this paper. The effectiveness and superiority of the proposed method are verified by the experimental results.     

A Hybrid Metaheuristic Based on Neurocomputing for Analysis of Unipolar Electrohydrodynamic Pump Flow

A unipolar electrohydrodynamic (UP-EHD) pump flow is studied with known electric potential at the emitter and zero electric potential at the collector. The model is designed for electric potential, charge density, and electric field. The dimensionless parameters, namely the electrical source number (Es), the electrical Reynolds number (ReE), and electrical slip number (Esl), are considered with wide ranges of variation to analyze the UP-EHD pump flow. To interpret the pump flow of the UP-EHD model, a hybrid metaheuristic solver is designed, consisting of the recently developed technique sine–cosine algorithm (SCA) and sequential quadratic programming (SQP) under the influence of an artificial neural network. The method is abbreviated as ANN-SCA-SQP. The superiority of the technique is shown by comparing the solution with reference solutions. For a large data set, the technique is executed for one hundred independent experiments. The performance is evaluated through performance operators and convergence plots.     

Study of Nonlinear Models of Oscillatory Systems by Applying an Intelligent Computational Technique

In this paper, we have analyzed the mathematical model of various nonlinear oscillators arising in different fields of engineering. Further, approximate solutions for different variations in oscillators are studied by using feedforward neural networks (NNs) based on the backpropagated Levenberg–Marquardt algorithm (BLMA). A data set for different problem scenarios for the supervised learning of BLMA has been generated by the Runge–Kutta method of order 4 (RK-4) with the “NDSolve” package in Mathematica. The worth of the approximate solution by NN-BLMA is attained by employing the processing of testing, training, and validation of the reference data set. For each model, convergence analysis, error histograms, regression analysis, and curve fitting are considered to study the robustness and accuracy of the design scheme.     

Enhanced Slime Mould Algorithm for Multilevel Thresholding Image Segmentation Using Entropy Measures

Image segmentation is a fundamental but essential step in image processing because it dramatically influences posterior image analysis. Multilevel thresholding image segmentation is one of the most popular image segmentation techniques, and many researchers have used meta-heuristic optimization algorithms (MAs) to determine the threshold values. However, MAs have some defects; for example, they are prone to stagnate in local optimal and slow convergence speed. This paper proposes an enhanced slime mould algorithm for global optimization and multilevel thresholding image segmentation, namely ESMA. First, the Levy flight method is used to improve the exploration ability of SMA. Second, quasi opposition-based learning is introduced to enhance the exploitation ability and balance the exploration and exploitation. Then, the superiority of the proposed work ESMA is confirmed concerning the 23 benchmark functions. Afterward, the ESMA is applied in multilevel thresholding image segmentation using minimum cross-entropy as the fitness function. We select eight greyscale images as the benchmark images for testing and compare them with the other classical and state-of-the-art algorithms. Meanwhile, the experimental metrics include the average fitness (mean), standard deviation (Std), peak signal to noise ratio (PSNR), structure similarity index (SSIM), feature similarity index (FSIM), and Wilcoxon rank-sum test, which is utilized to evaluate the quality of segmentation. Experimental results demonstrated that ESMA is superior to other algorithms and can provide higher segmentation accuracy.     

Encoding Individual Source Sequences for the Wiretap Channel

We consider the problem of encoding a deterministic source sequence (i.e., individual sequence) for the degraded wiretap channel by means of an encoder and decoder that can both be implemented as finite-state machines. Our first main result is a necessary condition for both reliable and secure transmission in terms of the given source sequence, the bandwidth expansion factor, the secrecy capacity, the number of states of the encoder and the number of states of the decoder. Equivalently, this necessary condition can be presented as a converse bound (i.e., a lower bound) on the smallest achievable bandwidth expansion factor. The bound is asymptotically achievable by Lempel–Ziv compression followed by good channel coding for the wiretap channel. Given that the lower bound is saturated, we also derive a lower bound on the minimum necessary rate of purely random bits needed for local randomness at the encoder in order to meet the security constraint. This bound too is achieved by the same achievability scheme. Finally, we extend the main results to the case where the legitimate decoder has access to a side information sequence, which is another individual sequence that may be related to the source sequence, and a noisy version of the side information sequence leaks to the wiretapper.     

Automatic segmentation of cerebral white matter hyperintensities using only 3D FLAIR images

Magnetic Resonance (MR) white matter hyperintensities have been shown to predict an increased risk of developing cognitive decline. However, their actual role in the conversion to dementia is still not fully understood. Automatic segmentation methods can help in the screening and monitoring of Mild Cognitive Impairment patients who take part in large population-based studies. Most existing segmentation approaches use multimodal MR images. However, multiple acquisitions represent a limitation in terms of both patient comfort and computational complexity of the algorithms. In this work, we propose an automatic lesion segmentation method that uses only three-dimensional fluid-attenuation inversion recovery (FLAIR) images. We use a modified context-sensitive Gaussian mixture model to determine voxel class probabilities, followed by correction of FLAIR artifacts. We evaluate the method against the manual segmentation performed by an experienced neuroradiologist and compare the results with other unimodal segmentation approaches. Finally, we apply our method to the segmentation of multiple sclerosis lesions by using a publicly available benchmark dataset. Results show a similar performance to other state-of-the-art multimodal methods, as well as to the human rater.