Search results

To make more smart health-care system, the health-care data should be shared in the secure manner, and it improves health-care service quality. This paper aims to implement a modern decentralized blockchain, safe and easy-to-use health-care technology application in the cloud.

On observing the graph, the convergence analysis of proposed Levy Flight-integrated moth flame optimization method at 80th iteration was 4.59%, 2.80%, 3.316%, 8.92% and 2.55% higher than the traditional models MFO, artificial bee colony (ABC), particle swarm optimization (PSO), moth search algorithm (MSA) and glow worm swarm optimization (GWSO), respectively, for Hungarian data set. Particularly, in best case scenario, the adopted method attains low cost value (5.672671) when compared to all other traditional models such as MFO (5.727314), ABC (5.711577), PSO (5.706499), MSA (5.764517) and GWSO (5.723353).

The proposed method achieved effective performance in terms of key sensitivity, sanitization effectiveness, restoration effectiveness, etc.

Text mining has been used for various knowledge discovery based applications, and thus, a lot of research has been contributed towards it. Latest trending research in the text mining is adopting the incremental learning data, as it is economical while dealing with large volume of information.

The primary intention of this research is to design and develop a technique for incremental text categorization using optimized Support Vector Neural Network (SVNN). The proposed technique involves four major steps, such as pre-processing, feature selection, classification and feature extraction. Initially, the data is pre-processed based on stop word removal and stemming. Then, the feature extraction is done by extracting semantic word-based features and Term Frequency and Inverse Document Frequency (TF-IDF). From the extracted features, the important features are selected using Bhattacharya distance measure and the features are subjected as the input to the proposed classifier. The proposed classifier performs incremental learning using SVNN, wherein the weights are bounded in a limit using rough set theory. Moreover, for the optimal selection of weights in SVNN, Moth Search (MS) algorithm is used. Thus, the proposed classifier, named Rough set MS-SVNN, performs the text categorization for the incremental data, given as the input.

For the experimentation, the 20 News group dataset, and the Reuters dataset are used. Simulation results indicate that the proposed Rough set based MS-SVNN has achieved 0.7743, 0.7774 and 0.7745 for the precision, recall and F-measure, respectively.

In this paper, an online incremental learner is developed for the text categorization. The text categorization is done by developing the Rough set MS-SVNN classifier, which classifies the incoming texts based on the boundary condition evaluated by the Rough set theory, and the optimal weights from the MS. The proposed online text categorization scheme has the basic steps, like pre-processing, feature extraction, feature selection and classification. The pre-processing is carried out to identify the unique words from the dataset, and the features like semantic word-based features and TF-IDF are obtained from the keyword set. Feature selection is done by setting a minimum Bhattacharya distance measure, and the selected features are provided to the proposed Rough set MS-SVNN for the classification.

The set-union knapsack problem is one of the most significant generalizations of the Non-deterministic Polynomial (NP)-hard 0-1 knapsack problem in combinatorial optimization, which has rich application scenarios. Although some researchers performed effective algorithms on normal-sized instances, the authors found these methods deteriorated rapidly as the scale became larger. Therefore, the authors design an efficient yet effective algorithm to solve this large-scale optimization problem, making it applicable to real-world cases under the era of big data.

The authors develop three targeted strategies and adjust them into the adaptive tabu search framework. Specifically, the dynamic item scoring tries to select proper items into the knapsack dynamically to enhance the intensification, while the age-guided perturbation places more emphasis on the diversification of the algorithm. The lightweight neighborhood updating simplifies the neighborhood operators to reduce the algorithm complexity distinctly as well as maintains potential solutions. The authors conduct comparative experiments against currently best solvers to show the performance of the proposed algorithm.

Statistical experiments show that the proposed algorithm can find 18 out of 24 better solutions than other algorithms. For the remaining six instances on which the competitor also achieves the same solutions, ours performs more stably due to its narrow gap between best and mean value. Besides, the convergence time is also verified efficiency against other algorithms.

The authors present the first implementation of heuristic algorithm for solving large-scale set-union knapsack problem and achieve the best results. Also, the authors provide the benchmarks on the website for the first time.

This paper aims to propose a novel nature-inspired optimization algorithm, called whirlpool algorithm (WA), which imitates the physical phenomenon of whirlpool.

The idea of this algorithm stems from the fact that the whirlpool has a descent direction and a vertex.

WA is tested with two types of models: 29 typical mathematical optimization models and three engineering problems (tension/compression spring design, welded-beam design, pressure vessel design).

The results shown that the WA is vying compared to the state-of-art algorithms likewise conservative approaches.

Sea Lion Optimization (SLnO) algorithm involves the ability of exploration and exploitation phases, and it is able to solve combinatorial optimization problems. For these reasons, it is considered a global optimizer. The scheduling operation is completed by imitating the hunting behavior of sea lions.

Cloud computing (CC) is a type of distributed computing, contributory in a massive number of available resources and demands, and its goal is sharing the resources as services over the internet. Because of the optimal using of these services is everlasting challenge, the issue of task scheduling in CC is significant. In this paper, a task scheduling technique for CC based on SLnO and multiple-objective model are proposed. It enables decreasing in overall completion time, cost and power consumption; and maximizes the resources utilization. The simulation results on the tested data illustrated that the SLnO scheduler performed better performance than other state-of-the-art schedulers in terms of makespan, cost, energy consumption, resources utilization and degree of imbalance.

The performance of the SLnO, Vocalization of Whale Optimization Algorithm (VWOA), Whale Optimization Algorithm (WOA), Grey Wolf Optimization (GWO) and Round Robin (RR) algorithms for 100, 200, 300, 400 and 500 independent cloud tasks on 8, 16 and 32 VMs was evaluated. The results show that SLnO algorithm has better performance than VWOA, WOA, GWO and RR in terms of makespan and imbalance degree. In addition, SLnO exhausts less power than VWOA, WOA, GWO and RR. More precisely, SLnO conserves 5.6, 21.96, 22.7 and 73.98% energy compared to VWOA, WOA, GWO and RR mechanisms, respectively. On the other hand, SLnO algorithm shows better performance than the VWOA and other algorithms. The SLnO algorithm's overall execution cost of scheduling the cloud tasks is minimized by 20.62, 39.9, 42.44 and 46.9% compared with VWOA, WOA, GWO and RR algorithms, respectively. Finally, the SLnO algorithm's average resource utilization is increased by 6, 10, 11.8 and 31.8% compared with those of VWOA, WOA, GWO and RR mechanisms, respectively.

To the best of the authors’ knowledge, this work is original and has not been published elsewhere, nor is it currently under consideration for publication elsewhere.

This study aims to evolve an enhanced butterfly optimization algorithm (BOA) with respect to convergence and accuracy performance for numerous benchmark functions, rigorous constrained engineering design problems and an inverse synthetic aperture radar (ISAR) image motion compensation.

Adaptive BOA (ABOA) is thus developed by incorporating spatial dispersal strategy to the global search and inserting the fittest solution to the local search, and hence its exploration and exploitation abilities are improved.

The accuracy and convergence performance of ABOA are well verified via exhaustive comparisons with BOA and its existing variants such as improved BOA (IBOA), modified BOA (MBOA) and BOA with Levy flight (BOAL) in terms of various precise metrics through 15 classical and 12 conference on evolutionary computation (CEC)-2017 benchmark functions. ABOA has outstanding accuracy and stability performance better than BOA, IBOA, MBOA and BOAL for most of the benchmarks. The design optimization performance of ABOA is also evaluated for three constrained engineering problems such as welded beam design, spring design and gear train design and the results are compared with those of BOA, MBOA and BOA with chaos. ABOA, therefore, optimizes engineering designs with the most optimal variables. Furthermore, a validation is performed through translational motion compensation (TMC) of the ISAR image for an aircraft, which includes blurriness. In TMC, the motion parameters such as velocity and acceleration of target are optimally predicted by the optimization algorithms. The TMC results are elaborately compared with BOA, IBOA, MBOA and BOAL between each other in view of images, motion parameter and numerical image measuring metrics.

The outperforming results reflect the optimization and design successes of ABOA which is enhanced by establishing better global and local search abilities over BOA and its existing variants.

The technique for hiding confidential data in specific digital media by enhancing the graphical contents is known as watermarking. The dissemination of information over a secure channel is essential for multimedia applications. The purpose of this study is to develop a secure communication approach for OFDM system.

This paper exploits a secure communication in the orthogonal frequency division multiplexing (OFDM) system using wavelet-based video watermarking technique. In this work, the Chronological-MS algorithm is used for securing the data communication in the OFDM system. Here, the secret message is embedded in video frames using wavelet transform for hiding sensitive information and the hidden information is transmitted over the OFDM system. The Chronological-MS algorithm is used for selecting the optimal regions in the video for embedding secret message. In embedding phase, wavelet coefficients are obtained by applying wavelet transform on the frame for embedding the secret message. Meanwhile, in extraction phase, the inverse wavelet transform is applied to extract the secret message.

Considering number of frames, the maximum Peak signal-to-noise ratio (PSNR) value is attained by proposed Wavelet + Chronological MS method for Video 2 with value 73.643 dB, respectively. Meanwhile, the minimum mean squared error (MSE) attained by the proposed Wavelet + Chronological MS method is when considering number of frames with MSE values as 0.001 for both Videos 1 and 2. The minimum bit error rate (BER) value is attained by the proposed method with value 0.00009 considering random noise with Video 1. Thus, the proposed Wavelet + Chronological MS have shown better results than the existing techniques.

This work proposes a wavelet-based watermarking method using Chronological-MS, for initiating secured communication over an OFDM. One of the main advantages of wavelets is that they offer a simultaneous localization in time and frequency domain. Hence, the proposed method offers the highly secured data transmission over the OFDM.

The purpose of this study is to provide a novel portfolio asset prediction by means of the modified deep learning and hybrid meta-heuristic concept. In the past few years, portfolio optimization has appeared as a demanding and fascinating multi-objective problem, in the area of computational finance. Yet, it is accepting the growing attention of fund management companies, researchers and individual investors. The primary issues in portfolio selection are the choice of a subset of assets and its related optimal weights of every chosen asset. The composition of every asset is chosen in a manner such that the total profit or return of the portfolio is improved thereby reducing the risk at the same time.

This paper provides a novel portfolio asset prediction using the modified deep learning concept. For implementing this framework, a set of data involving the portfolio details of different companies for certain duration is selected. The proposed model involves two main phases. One is to predict the future state or profit of every company, and the other is to select the company which is giving maximum profit in the future. In the first phase, a deep learning model called recurrent neural network (RNN) is used for predicting the future condition of the entire companies taken in the data set and thus creates the data library. Once the forecasting of the data is done, the selection of companies for the portfolio is done using a hybrid optimization algorithm by integrating Jaya algorithm (JA) and spotted hyena optimization (SHO) termed as Jaya-based spotted hyena optimization (J-SHO). This optimization model tries to get the optimal solution including which company has to be selected, and optimized RNN helps to predict the future return while using those companies. The main objective model of the J-SHO-based RNN is to maximize the prediction accuracy and J-SHO-based portfolio asset selection is to maximize the profit. Extensive experiments on the benchmark datasets from real-world stock markets with diverse assets in various time periods shows that the developed model outperforms other state-of-the-art strategies proving its efficiency in portfolio optimization.

From the analysis, the profit analysis of proposed J-SHO for predicting after 7 days in next month was 46.15% better than particle swarm optimization (PSO), 18.75% better than grey wolf optimization (GWO), 35.71% better than whale optimization algorithm (WOA), 5.56% superior to JA and 35.71% superior to SHO. Therefore, it can be certified that the proposed J-SHO was effective in providing intelligent portfolio asset selection and prediction when compared with the conventional methods.

This paper presents a technique for providing a novel portfolio asset prediction using J-SHO algorithm. This is the first work uses J-SHO-based optimization for providing a novel portfolio asset prediction using the modified deep learning concept.

The demand of sewage treatment plants is increasing day by day, especially in the countries like India. Biological and chemical unit of such sewage treatment plants are critical and needs to be designed and developed to achieve desired level of reliability, maintainability and availability.

This paper investigates and optimizes the availability of biological and chemical unit of a sewage treatment plant. A novel mathematical model for this unit is developed using the Markovian birth-death process. A set of Chapman–Kolmogorov differential equations are derived for the model and a generalized solution is discovered using soft computing techniques namely genetic algorithm (GA) and particle swarm optimization (PSO).

Nature-inspired optimization techniques results of availability function depicted that PSO outperforms GA. The optimum value of the availability of biological and chemical processing unit is 0.9324 corresponding to population size 100, the number of evolutions 300, mutation 0.6 and crossover 0.85 achieved using GA while PSO results reflect that optimum achieved availability is 0.936240 after 45 iterations. Finally, it is revealed that PSO outperforms than GA.

This paper investigates and optimizes the availability of biological and chemical units of a sewage treatment plant. A novel mathematical model for this unit is developed using the Markovian birth-death process.

Availability model of biological and chemical units of a sewage treatment is developed using field failure data and judgments collected from the experts. Furthermore, availability of the system has been optimized to achieve desired level of reliability and maintainability.

The purpose of this paper is to propose an enhanced elephant herding optimization (EEHO) algorithm by improving the exploration phase to overcome the fast-unjustified convergence toward the origin of the native EHO. The exploration and exploitation of the proposed EEHO are achieved by updating both clan and separation operators.

The original EHO shows fast unjustified convergence toward the origin specifically, a constant function is used as a benchmark for inspecting the biased convergence of evolutionary algorithms. Furthermore, the star discrepancy measure is adopted to quantify the quality of the exploration phase of evolutionary algorithms in general.

In experiments, EEHO has shown a better performance of convergence rate compared with the original EHO. Reasons behind this performance are: EEHO proposes a more exploitative search method than the one used in EHO and the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Operator γ is added to EEHO assists to escape from local optima, which commonly exist in the search space. The proposed EEHO controls the convergence rate and the random walk independently. Eventually, the quantitative and qualitative results revealed that the proposed EEHO outperforms the original EHO.

Therefore, the pros and cons are reported as follows: pros of EEHO compared to EHO – 1) unbiased exploration of the whole search space thanks to the proposed update operator that fixed the unjustified convergence of the EHO toward the origin and the proposed separating operator that fixed the tendency of EHO to introduce new elephants at the boundary of the search space; and 2) the ability to control exploration–exploitation trade-off by independently controverting the convergence rate and the random walk using different parameters – cons EEHO compared to EHO: 1) suitable values for three parameters (rather than two only) have to be found to use EEHO.

As the original EHO shows fast unjustified convergence toward the origin specifically, the search method adopted in EEHO is more exploitative than the one used in EHO because of the balanced control of exploration and exploitation based on fixing clan updating operator and separating operator. Further, the star discrepancy measure is adopted to quantify the quality of exploration phase of evolutionary algorithms in general. Operator γ that added EEHO allows the successive local and global searching (exploration and exploitation) and helps escaping from local minima that commonly exist in the search space.