Sink Mobility-Based Energy Efficient Routing Algorithm Variants in WSN

International Journal of Wireless Information Networks - In this work, energy efficient routing protocol variants considering different sink mobility in hierarchical cluster based wireless sensor...     

HSWOA: An ensemble of hunger games search and whale optimization algorithm for global optimization

The search for food stimulated by hunger is a common phenomenon in the animal world. Mimicking the concept, recently, an optimization algorithm Hunger Games Search (HGS) has been proposed for global optimization. On the other side, the Whale Optimization Algorithm (WOA) is a commonly utilized nature-inspired algorithm portrayed by a straightforward construction with easy parameters imitating the hunting behavior of humpback whales. However, due to minimum exploration of the search space, WOA has a high chance of trapping into local solutions, and more exploitation leads it towards premature convergence. The concept of hunger from HGS is merged with the food searching techniques of the whale to lessen the inherent drawbacks of WOA. Two weights of HGS are adaptively designed for every whale using the respective hunger level for balancing search strategies. Performance verification of the proposed hunger search-based whale optimization algorithm (HSWOA) is done by comparing it with 10 state-of-the-art algorithms, including three very recently developed algorithms on 30 classical benchmark functions. Comparison with some basic algorithms, recently modified algorithms, and WOA variants is performed using IEEE CEC 2019 function set. Statistical performance of the proposed algorithm is verified with Friedman's test, boxplot analysis, and Nemenyi multiple comparison test. The operating speed of the algorithm is determined and tested with complexity analysis and convergence analysis. Finally, seven real-world engineering problems are solved and compared with a list of metaheuristic algorithms. Numerical and statistical performance comparison with state-of-the-art algorithms confirms the efficacy of the newly designed algorithm.     

GENs: generative encoding networks

Machine Learning - Mapping data from and/or onto a known family of distributions has become an important topic in machine learning and data analysis. Deep generative models (e.g., generative...     

Spectral entropy and spectral shape based pre-quantization for real time speaker identification system

Pre-processing is one of the vital steps for developing robust and efficient recognition system. Better pre-processing not only aid in better data selection but also in significant reduction of computational complexity. Further an efficient frame selection technique can improve the overall performance of the system. Pre-quantization (PQ) is the technique of selecting less number of frames in the pre-processing stage to reduce the computational burden in the post processing stages of speaker identification (SI). In this paper, we develop PQ techniques based on spectral entropy and spectral shape to pick suitable frames containing speaker specific information that varies from frame to frame depending on spoken text and environmental conditions. The attempt is to exploit the statistical properties of distributions of speech frames at the pre-processing stage of speaker recognition. Our aim is not only to reduce the frame rate but also to maintain identification accuracy reasonably high. Further we have also analyzed the robustness of our proposed techniques on noisy utterances. To establish the efficacy of our proposed methods, we used two different databases, POLYCOST (telephone speech) and YOHO (microphone speech).     

Automatic MR brain image segmentation using a multiseed based multiobjective clustering approach

In this paper, the automatic segmentation of a multispectral magnetic resonance image of the brain is posed as a clustering problem in the intensity space. The automatic clustering problem is thereafter modelled as solving a multiobjective optimization (MOO) problem, optimizing a set of cluster validity indices simultaneously. A multiobjective clustering technique, named MCMOClust, is used to solve this problem. MCMOClust utilizes a recently developed simulated annealing based multiobjective optimization method as the underlying optimization strategy. Each cluster is divided into several small hyperspherical subclusters and the centers of all these small sub-clusters are encoded in a string to represent the whole clustering. For assigning points to different clusters, these local sub-clusters are considered individually. For the purpose of objective function evaluation, these sub-clusters are merged appropriately to form a variable number of global clusters. Two cluster validity indices, one based on the Euclidean distance, XB-index, and another recently developed point symmetry distance based cluster validity index, Sym-index, are optimized simultaneously to automatically evolve the appropriate number of clusters present in MR brain images. A semi-supervised method is used to select a single solution from the final Pareto optimal front of MCMOClust. The present method is applied on several simulated T1-weighted, T2-weighted and proton density normal and MS lesion magnetic resonance brain images. Superiority of the present method over Fuzzy C-means, Expectation Maximization clustering algorithms and a newly developed symmetry based fuzzy genetic clustering technique (Fuzzy-VGAPS), are demonstrated quantitatively. The automatic segmentation obtained by multiseed based multiobjective clustering technique (MCMOClust) is also compared with the available ground truth information.     

Differential regulation of redox proteins and chaperones in HbEβ-thalassemia erythrocyte proteome

Purpose: In (hemoglobin, Hb) HbEβ‐thalassemia, HbE (β‐26 Glu→Lys) interacts with β‐thalassemia to produce clinical manifestation of varying severity. This is the first proteomic effort to study changes in protein levels of erythrocytes isolated from HbEβ‐thalassemic patients compared to normal. Experimental design: We have used 2‐DE and MALDI‐MS/MS‐based techniques to investigate the differential proteome profiling of membrane and Hb‐depleted fraction of cytosolic proteins of erythrocytes isolated from the peripheral blood samples of HbEβ‐thalassemia patients and normal volunteers. Results: Our study showed that redox regulators such as peroxiredoxin 2, Cu‐Zn superoxide dismutase and thioredoxin and chaperones such as α‐hemoglobin stabilizing protein and HSP‐70 were upregulated in HbEβ‐thalassemia. We have also observed larger amounts of membrane associated globin chains and indications of disruption of spectrin‐based junctional complex in the membrane skeleton of HbEβ‐thalassemic erythrocytes upon detection of low molecular weight fragments of β‐spectrin and decrease in β‐actin and dematin content. Conclusion and clinical relevance: We have observed interesting changes in the proteomic levels of redox regulators and chaperons in the thalassemic hemolysates and have observed strong correlation or association of the extent of such proteomic changes with HbE levels. This could be important in understanding the role of HbE in disease progression and pathophysiology.     

A dynamic model for short-term prediction of stream attributes

Multiple data streams coming out of a complex system form the observable state of the system. The streams may correspond to various sensors attached with the system or outcome of internal processes. Such stream data may consist of multiple attributes and may differ in terms of their frequency of generation and observation. The streams may have dependency among themselves. One will have to rely on such data streams for monitoring the health of the system or to take any corrective measure. Predicting the value of certain stream data is an important task that can help one to take decision and act accordingly. In this work, a simple but generic visualization of a complex system is presented and thereafter a linear regression-based dynamic model for short-term prediction is proposed. The model is based on the past history of the attributes of multiple streams as suggested by the domain experts. But, it automatically determines the meaningful attributes and reformulates the model. The model is also re-computed if the prediction error exceeds the allowable tolerance. All these make the model dynamic. Experiment is carried out with stock market data streams to predict the close value well in advance. It is observed that in terms of quality of prediction and performance metric, the proposed model is quite effective.     

CRT and LCD monitor and process materials evaluated for environmental improvement

Decision rules have been developed and applied to the bills of materials of a color cathode‐ray tube (CRT) and a liquid‐crystal‐display (LCD) desktop monitor to determine which product and process materials will be evaluated in an environmental life‐cycle assessment. Materials of significant mass, of technological importance, and of potential environmental impact are targeted. The list of materials identified are those for which life‐cycle inventory data will be obtained for the materials extraction and materials processing life‐cycle stages of a CRT and an LCD. Additionally, materials identified will also be used to represent life‐cycle impact in terms of resource consumption, as well as surrogates for occupational health impacts.     

Optimum image thresholding via class uncertainty and regionhomogeneity

Thresholding is a popular image segmentation method that converts a gray-level image into a binary image. The selection of optimum thresholds has remained a challenge over decades. Besides being a segmentation tool on its own, often it is also a step in many advanced image segmentation techniques in spaces other than the image space. We introduce a thresholding method that accounts for both intensity-based class uncertainty-a histogram-based property-and region homogeneity-an image morphology-based property. A scale-based formulation is used for region homogeneity computation. At any threshold, intensity-based class uncertainty is computed by fitting a Gaussian to the intensity distribution of each of the two regions segmented at that threshold. The theory of the optimum thresholding method is based on the postulate that objects manifest themselves with fuzzy boundaries in any digital image acquired by an imaging device. The main idea here is to select that threshold at which pixels with high class uncertainty accumulate mostly around object boundaries. To achieve this, a threshold energy criterion is formulated using class-uncertainty and region homogeneity such that, at any image location, a high energy is created when both class uncertainty and region homogeneity are high or both are low. Finally, the method selects that threshold which corresponds to the minimum overall energy. The method has been compared to a maximum segmented image information method. Superiority of the proposed method was observed both qualitatively on clinical medical images as well as quantitatively on 250 realistic phantom images generated by adding different degrees of blurring, noise, and background variation to real objects segmented from clinical images