Improved aquila optimization-based parameter evaluation framework and meta-heuristic algorithm in radio-over-fiber SpatialMux multi-input multi-output long-term evolution system

In heterogeneous access network, Multiple-Input Multiple-Output (MIMO) radio-over-fiber (RoF) system is an efficient approach for multiple signal transmission with low cost and complexity. The performance of RoF fronthaul system in MIMO system will be varied with different nonlinear effects. By adjusting various transmission parameters, such as the input signal power or the laser bias current, the nonlinear impacts produced by the RoF system can be reduced. In this paper, a novel algorithm Improved Aquila Optimization (IAO) is proposed to optimize transmission circumstances of MIMO RoF system. It determines the appropriate bias current for both lasers and Radio Frequency (RF) signal power in a short period. The input signals are wavelength multiplexed with Intensity Modulation and Direct Detection (IM/DD) applied. The carrier as well as transmission frequency is governed by the MIMO-Long-Term Evolution (LTE) standard. The proposed system is implemented in MATLAB, and the performance is evaluated. The experimental results show that fast convergence and trade-off between noise and nonlinearity are obtained with varying bandwidth. In the experimental scenario, the maximum Error Vector Magnitude (EVM) of 1.88, 3.14, and signal-to-noise ratio (SNR) of 3.204, and 2.698 was attained for both quadrature phase shift keying (QPSK) and quadrature amplitude modulation (QAM) modulation. [Correction added on 24 April 2023, after first online publication: the SNR values were corrected in the preceding sentence.] For 100 iterations, the processing time was reduced to 0.137 s. When compared with the conventional state-of-the-art approaches, the accuracy and computational complexity of the proposed approach are improved.     

Throughput analysis in censoring-based cooperative cognitive radio network with energy harvesting

An energy harvesting (EH) and cooperative cognitive radio (CR) network (CRN) is studied in this paper where CR users transmit data through a primary user (PU) channel if the channel remains idle, else an optimal number CRs helps in transmission of PU. To achieve the optimum number of CRs (ONCR) involved in cooperation, a novel scheme based on a combination of channel censoring and total error is proposed. The performance of the proposed scheme is investigated under RF harvesting scenario. The EH is dependent on sensing decision and a CR source harvests energy from PU's RF signal. The harvested energy (HE) is split into two parts: One part is used by the CR network (CRN) for its own transmission, and the other part is used for supporting PU. The effect of the energy allocation factor on total throughput is also investigated. New expressions for optimal number of CRs and throughput are developed. The effect of network parameters such as sensing time, censoring threshold, and energy allocation parameter (EAP) on throughput is investigated. Impact of distance between nodes is also studied.     

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

A quantum mutation-based backtracking search algorithm

The exposition of any nature-inspired optimization technique relies firmly upon its executed organized framework. Since the regularly utilized backtracking search algorithm (BSA) is a fixed framework, it is not always appropriate for all difficulty levels of problems and, in this manner, probably does not search the entire search space proficiently. To address this limitation, we propose a modified BSA framework, called gQR-BSA, based on the quasi reflection-based initialization, quantum Gaussian mutations, adaptive parameter execution, and quasi-reflection-based jumping to change the coordinate structure of the BSA. In gQR-BSA, a quantum Gaussian mechanism was developed based on the best population information mechanism to boost the population distribution information. As population distribution data can represent characteristics of a function landscape, gQR-BSA has the ability to distinguish the methodology of the landscape in the quasi-reflection-based jumping. The updated automatically managed parameter control framework is also connected to the proposed algorithm. In every iteration, the quasi-reflection-based jumps aim to jump from local optima and are adaptively modified based on knowledge obtained from offspring to global optimum. Herein, the proposed gQR-BSA was utilized to solve three sets of well-known standards of functions, including unimodal, multimodal, and multimodal fixed dimensions, and to solve three well-known engineering optimization problems. The numerical and experimental results reveal that the algorithm can obtain highly efficient solutions to both benchmark and real-life optimization problems.

     

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

A symmetry based multiobjective clustering technique for automatic evolution of clusters

In this paper the problem of automatic clustering a data set is posed as solving a multiobjective optimization (MOO) problem, optimizing a set of cluster validity indices simultaneously. The proposed multiobjective clustering technique utilizes a recently developed simulated annealing based multiobjective optimization method as the underlying optimization strategy. Here variable number of cluster centers is encoded in the string. The number of clusters present in different strings varies over a range. The points are assigned to different clusters based on the newly developed point symmetry based distance rather than the existing Euclidean distance. 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 in order to determine the appropriate number of clusters present in a data set. Thus the proposed clustering technique is able to detect both the proper number of clusters and the appropriate partitioning from data sets either having hyperspherical clusters or having point symmetric clusters. A new semi-supervised method is also proposed in the present paper to select a single solution from the final Pareto optimal front of the proposed multiobjective clustering technique. The efficacy of the proposed algorithm is shown for seven artificial data sets and six real-life data sets of varying complexities. Results are also compared with those obtained by another multiobjective clustering technique, MOCK, two single objective genetic algorithm based automatic clustering techniques, VGAPS clustering and GCUK clustering.     

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.