Diagnosis of Leukemia Disease Based on Enhanced Virtual Neural Network

White Blood Cell (WBC) cancer or leukemia is one of the serious cancers that threaten the existence of human beings. In spite of its prevalence and serious consequences, it is mostly diagnosed through manual practices. The risks of inappropriate, sub-standard and wrong or biased diagnosis are high in manual methods. So, there is a need exists for automatic diagnosis and classification method that can replace the manual process. Leukemia is mainly classified into acute and chronic types. The current research work proposed a computer-based application to classify the disease. In the feature extraction stage, we use excellent physical properties to improve the diagnostic system's accuracy, based on Enhanced Color Co-Occurrence Matrix. The study is aimed at identification and classification of chronic lymphocytic leukemia using microscopic images of WBCs based on Enhanced Virtual Neural Network (EVNN) classification. The proposed method achieved optimum accuracy in detection and classification of leukemia from WBC images. Thus, the study results establish the superiority of the proposed method in automated diagnosis of leukemia. The values achieved by the proposed method in terms of sensitivity, specificity, accuracy, and error rate were 97.8%, 89.9%, 76.6%, and 2.2%, respectively. Furthermore, the system could predict the disease in prior through images, and the probabilities of disease detection are also highly optimistic.     

Automated Deep Learning Empowered Breast Cancer Diagnosis Using Biomedical Mammogram Images

Biomedical image processing is a hot research topic which helps to majorly assist the disease diagnostic process. At the same time, breast cancer becomes the deadliest disease among women and can be detected by the use of different imaging techniques. Digital mammograms can be used for the earlier identification and diagnostic of breast cancer to minimize the death rate. But the proper identification of breast cancer has mainly relied on the mammography findings and results to increased false positives. For resolving the issues of false positives of breast cancer diagnosis, this paper presents an automated deep learning based breast cancer diagnosis (ADL-BCD) model using digital mammograms. The goal of the ADL-BCD technique is to properly detect the existence of breast lesions using digital mammograms. The proposed model involves Gaussian filter based pre-processing and Tsallis entropy based image segmentation. In addition, Deep Convolutional Neural Network based Residual Network (ResNet 34) is applied for feature extraction purposes. Specifically, a hyper parameter tuning process using chimp optimization algorithm (COA) is applied to tune the parameters involved in ResNet 34 model. The wavelet neural network (WNN) is used for the classification of digital mammograms for the detection of breast cancer. The ADL-BCD method is evaluated using a benchmark dataset and the results are analyzed under several performance measures. The simulation outcome indicated that the ADL-BCD model outperforms the state of art methods in terms of different measures.     

An attribute control chart for multivariate Poisson distribution using multiple dependent state repetitive sampling

In this paper, an attribute control chart for a multivariate Poisson distribution using multiple dependent state repetitive sampling (MDSRS) is presented. The evaluation of the proposed control chart is given through the average run length (ARL). The proposed control chart performs better than the existing control chart based on repetitive sampling and that using multiple dependent state sampling in terms of ARLs. A real example and a simulation study are added to explain the procedure and to demonstrate the power of the proposed control chart.     

Transient chaotic neural network-based disjoint multipath routing for mobile ad-hoc networks

Due to mobility of wireless hosts, routing in mobile ad-hoc networks (MANETs) is a challenging task. Multipath routing is employed to provide reliable communication, load balancing, and improving quality of service of MANETs. Multiple paths are selected to be node-disjoint or link-disjoint to improve transmission reliability. However, selecting an optimal disjoint multipath set is an NP-complete problem. Neural networks are powerful tools for a wide variety of combinatorial optimization problems. In this study, a transient chaotic neural network (TCNN) is presented as multipath routing algorithm in MANETs. Each node in the network can be equipped with a neural network, and all the network nodes can be trained and used to obtain optimal or sub-optimal high reliable disjoint paths. This algorithm can find both node-disjoint and link-disjoint paths with no extra overhead. The simulation results show that the proposed method can find the high reliable disjoint path set in MANETs. In this paper, the performance of the proposed algorithm is compared to the shortest path algorithm, disjoint path set selection protocol algorithm, and Hopfield neural network (HNN)-based model. Experimental results show that the disjoint path set reliability of the proposed algorithm is up to 4.5 times more than the shortest path reliability. Also, the proposed algorithm has better performance in both reliability and the number of paths and shows up to 56% improvement in path set reliability and up to 20% improvement in the number of paths in the path set. The proposed TCNN-based algorithm also selects more reliable paths as compared to HNN-based algorithm in less number of iterations.     

Neural-based electricity load forecasting using hybrid of GA and ACO for feature selection

Due to deregulation of electricity industry, accurate load forecasting and predicting the future electricity demand play an important role in the regional and national power system strategy management. Electricity load forecasting is a challenging task because electric load has complex and nonlinear relationships with several factors. In this paper, two hybrid models are developed for short-term load forecasting (STLF). These models use “ant colony optimization (ACO)” and “combination of genetic algorithm (GA) and ACO (GA-ACO)” for feature selection and multi-layer perceptron (MLP) for hourly load prediction. Weather and climatic conditions, month, season, day of the week, and time of the day are considered as load-influencing factors in this study. Using load time-series of a regional power system, the performance of ACO?+?MLP and GA-ACO?+?MLP hybrid models is compared with principal component analysis (PCA)?+?MLP hybrid model and also with the case of no-feature selection (NFS) when using MLP and radial basis function (RBF) neural models. Experimental results and the performance comparison with similar recent researches in this field show that the proposed GA-ACO?+?MLP hybrid model performs better in load prediction of 24-h ahead in terms of mean absolute percentage error (MAPE).     

A new sliding function for discrete predictive sliding mode control of time delay systems

The control of time delay systems is still an open area for research. This paper proposes an enhanced model predictive discrete-time sliding mode control with a new sliding function for a linear system with state delay. Firstly, a new sliding function including a present value and a past value of the state, called dynamic surface, is designed by means of linear matrix inequalities （LMIs）. Then, using this dynamic function and the rolling optimization method in the predictive control strategy, a discrete predictive sliding mode controller is synthesized. This new strategy is proposed to eliminate the undesirable effect of the delay term in the closed loop system. Also, the designed control strategy is more robust, and has a chattering reduction property and a faster convergence of the system s state. Finally, a numerical example is given to illustrate the effectiveness of the proposed control.     

Loop-free Gray code algorithm for the e-restricted growth functions

The subject of Gray codes algorithms for the set partitions of {1,2,…,n} had been covered in several works. The first Gray code for that set was introduced by Knuth (1975) [5], later, Ruskey presented a modified version of Knuth?s algorithm with distance two, Ehrlich (1973) [3] introduced a loop-free algorithm for the set of partitions of {1,2,…,n}, Ruskey and Savage (1994) [9] generalized Ehrlich?s results and give two Gray codes for the set of partitions of {1,2,…,n}, and recently, Mansour et al. (2008) [7] gave another Gray code and loop-free generating algorithm for that set by adopting plane tree techniques.In this paper, we introduce the set of e-restricted growth functions (a generalization of restricted growth functions) and extend the aforementioned results by giving a Gray code with distance one for this set; and as a particular case we obtain a new Gray code for set partitions in restricted growth function representation. Our Gray code satisfies some prefix properties and can be implemented by a loop-free generating algorithm using classical techniques; such algorithms can be used as a practical solution of some difficult problems. Finally, we give some enumerative results concerning the restricted growth functions of order d.