Volume 30, Issue 1

Harmony Search Algorithm (HSA) is an evolutionary algorithm which mimics the process of music improvisation to obtain a nice harmony. The algorithm has been successfully applied to solve optimization problems in different domains. A significant shortcoming of the algorithm is inadequate exploitation when trying to solve complex problems. The algorithm relies on three operators for performing improvisation: memory consideration, pitch adjustment, and random consideration. In order to improve algorithm efficiency, we use roulette wheel and tournament selection in memory consideration, replace the pitch adjustment and random consideration with a modified polynomial mutation, and enhance the obtained new harmony with a modified β -hill climbing algorithm. Such modification can help to maintain the diversity and enhance the convergence speed of the modified HS algorithm. β -hill climbing is a recently introduced local search algorithm that is able to effectively solve different optimization problems. β -hill climbing is utilized in the modified HS algorithm as a local search technique to improve the generated solution by HS. Two algorithms are proposed: the first one is called PHS β –HC and the second one is called Imp. PHS β –HC. The two algorithms are evaluated using 13 global optimization classical benchmark function with various ranges and complexities. The proposed algorithms are compared against five other HSA using the same test functions. Using Friedman test, the two proposed algorithms ranked 2nd (Imp. PHS β –HC) and 3rd (PHS β –HC). Furthermore, the two proposed algorithms are compared against four versions of particle swarm optimization (PSO). The results show that the proposed PHS β –HC algorithm generates the best results for three test functions. In addition, the proposed Imp. PHS β –HC algorithm is able to overcome the other algorithms for two test functions. Finally, the two proposed algorithms are compared with four variations of differential evolution (DE). The proposed PHS β –HC algorithm produces the best results for three test functions, and the proposed Imp. PHS β –HC algorithm outperforms the other algorithms for two test functions. In a nutshell, the two modified HSA are considered as an efficient extension to HSA which can be used to solve several optimization applications in the future.

Face recognition is one of the core and challenging issues in computer vision field. Compared to computer vision, human visual system can identify a target from complex backgrounds quickly and accurately. This paper proposes a new network model deriving from Where-What Networks (WWNs), which can approximately simulate the information processing pathways (i.e., dorsal pathway and ventral pathway) of human visual cortex and recognize different types of faces with different locations and sizes in complex background. To enhance the recognition performance, synapse maintenance mechanism and neuron regenesis mechanism are both introduced. Synapse maintenance is used to reduce the background interference while neuron regenesis mechanism is introduced to regulate the neuron resource dynamically to improve the network usage efficiency. Experiments have been conducted on human face images of 5 types, 11 sizes, and 225 locations in complex backgrounds. Experiment results demonstrate that the proposed WWN model can basically learn three concepts (type, location and size) simultaneously. The experiment results also show the advantages of the enhanced WWN-7 model for face recognition in comparison with several existing methods.

Cloud computing deals with voluminous heterogeneous data, and there is a need to effectively distribute the load across clusters of nodes to achieve optimal performance in terms of resource usage, throughput, response time, reliability, fault tolerance, and so on. The swarm intelligence methodologies use artificial intelligence to solve computationally challenging problems like load balancing, scheduling, and resource allocation at finite time intervals. In literature, sufficient works are being carried out to address load balancing problem in the cloud using traditional swarm intelligence techniques like ant colony optimization, particle swarm optimization, cuckoo search, bat optimization, and so on. But the traditional swarm intelligence techniques have issues with respect to convergence rate, arriving at the global optimum solution, complexity in implementation and scalability, which limits the applicability of such techniques in cloud domain. In this paper, we look into performance modeling aspects of some of the recent competitive swarm artificial intelligence based techniques like the whale, spider, dragonfly, and raven which are used for load balancing in the cloud. The results and analysis are presented over performance metrics such as total execution time, response time, resource utilization rate, and throughput achieved, and it is found that the performance of the raven roosting algorithm is high compared to other techniques.

Software testing is a very important technique to design the faultless software and takes approximately 60% of resources for the software development. It is the process of executing a program or application to detect the software bugs. In software development life cycle, the testing phase takes around 60% of cost and time. Test case generation is a method to identify the test data and satisfy the software testing criteria. Test case generation is a vital concept used in software testing, that can be derived from the user requirements specification. An automatic test case technique determines automatically where the test cases or test data generates utilizing search based optimization method. In this paper, Cuckoo Search and Bee Colony Algorithm (CSBCA) method is used for optimization of test cases and generation of path convergence within minimal execution time. The performance of the proposed CSBCA was compared with the performance of existing methods such as Particle Swarm Optimization (PSO), Cuckoo Search (CS), Bee Colony Algorithm (BCA), and Firefly Algorithm (FA).

Recognition of sarcastic statements has been a challenge in the process of sentiment analysis. A sarcastic sentence contains only positive words conveying a negative sentiment. Therefore, it is tough for any automated machine to identify the exact sentiment of the text in the presence of sarcasm. The existing systems for sarcastic sentiment detection are limited to the text scripted in English. Nowadays, researchers have shown greater interest in low resourced languages such as Hindi, Telugu, Tamil, Arabic, Chinese, Dutch, Indonesian, etc. To analyse these low resource languages, the biggest challenge is the lack of available resources, especially in the context of Indian languages. Indian languages are very rich in morphology which pose a greater challenge for the automated machines. Telugu is one of the most popular languages after Hindi among Indian languages. In this article, we have collected and annotated a corpus of Telugu conversation sentences in the form of a question followed by a reply for sarcasm detection. Further, a set of algorithms are proposed for the analysis of sarcasm in the corpus of Telugu conversation sentences. The proposed algorithms are based on hyperbolic features namely, Interjection, Intensifier, Question mark and Exclamation symbol. The achieved accuracy is 94%.

The pigeon-inspired optimization algorithm is a category of a newly proposed swarm intelligence-based algorithm that belongs to the population-based solution technique. The MKP is a class of complex optimization problems that have many practical applications in the fields of engineering and sciences. Due to the practical applications of MKP, numerous algorithmic-based methods like local search and population-based search algorithms have been proposed to solve the MKP in the past few decades. This paper proposes a modified binary pigeon-inspired optimization algorithm named (Modified-BPIO) for the 0 - 1 multidimensional knapsack problem (MKP). The utilization of the binary pigeon-inspired optimization (BPIO) for solving the multidimensional knapsack problem came with huge success. However, it can be observed that the BPIO converges prematurely due to lost diversity during the search activities. Given the above, the crossover operator is integrated with the landmark component of the BPIO to improve the diversity of the solution space. The MKP benchmarks from the Operations Research (OR) library are utilized to test the performance of the proposed binary method. Experimentally, it is concluded that the proposed Modified-BPIO has a better performance when compared with the BPIO and existing state-of-the-arts that worked on the same MKP benchmarks.

The recent increase in the road transportation necessitates scheduling to reduce the adverse impacts of the road transportation and evaluate the effectiveness of previous actions taken in this context. However, it is impossible to undertake the scheduling and evaluation tasks unless previous information are available to predict the future. The grey model requires a limited volume of data for estimating the behavior of an unknown system. It provides high-accuracy predictions based on few data points. Various grey prediction models have been proposed so far, in which three different approaches are followed to increase the accuracy: (1) data preprocessing, (2) improved equation models, and (3) error improvement or error balancing. In this paper, firstly, a theorem is proposed and proved to recognize the parameters affecting two grey models, namely GM (1, 1) and FGM (1, 1). Then, the effective parameters are adjusted through particle swarm optimization (PSO) to formulate two adjusted models, namely IGM (1, 1) and IFGM (1, 1). According to the simulation results of the proposed models, accuracy of the modeling improved by a minimum of 14.24% and a maximum of 82.39%. Finally, the number of users of a public road transportation system was predicted using the proposed models. The results showed enhanced accuracy (by 7.7%) of the proposed models for predicting the number of users of the public road transportation system.

In recent years, there has been tremendous growth in the amount of natural language text through various sources. Computational analysis of this text has got considerable attention among the NLP researchers. Automatic analysis and representation of natural language text is a step by step procedure. Deep level tagging is one of such steps applied over the text. In this paper, we demonstrate a methodology for deep level tagging of Malayalam text. Deep level tagging is the process of assigning deeper level information to every noun and verb in the text along with normal POS tags. In this study, we move towards a direction that is not much explored in the case of Malayalam language. Malayalam is a morphologically rich and agglutinative language. The morphological features of the language are effectively utilized for the computational analysis of Malayalam text. The language level details required for the study are provided by Thunjath Ezhuthachan Malayalam University, Tirur.

Cancer is fast becoming an alarming cause of human death. However, it has been reported that if the disease is detected at an early stage, diagnosed, treated appropriately, the patient has better chances of survival long life. Machine learning technique with feature-selection contributes greatly to the detecting of cancer, because an efficient feature-selection method can remove redundant features. In this paper, a Fuzzy Preference-Based Rough Set (FPRS) blended with Support Vector Machine (SVM) has been applied in order to predict cancer biomarkers for biological and gene expression datasets. Biomarkers are determined by deploying three models of FPRS, namely, Fuzzy Upward Consistency (FUC), Fuzzy Downward Consistency (FLC), and Fuzzy Global Consistency (FGC). The efficiency of the three models with SVM on five datasets is exhibited, and the biomarkers that have been identified from FUC models have been reported.

This paper introduce a new variant of the Genetic Algorithm whichis developed to handle multivariable, multi-objective and very high search space optimization problems like the solving system of non-linear equations. It is an integer coded Genetic Algorithm with conventional cross over and mutation but with Inverse algorithm is varying its search space by varying its digit length on every cycle and it does a fine search followed by a coarse search. And its solution to the optimization problem will converge to precise value over the cycles. Every equation of the system is considered as a single minimization objective function. Multiple objectives are converted to a single fitness function by summing their absolute values. Some difficult test functions for optimization and applications are used to evaluate this algorithm. The results prove that this algorithm is capable to produce promising and precise results.

This paper implements the continuous Hindi Automatic Speech Recognition (ASR) system using the proposed integrated features vector with Recurrent Neural Network (RNN) based Language Modeling (LM). The proposed system also implements the speaker adaptation using Maximum-Likelihood Linear Regression (MLLR) and Constrained Maximum likelihood Linear Regression (C-MLLR). This system is discriminatively trained by Maximum Mutual Information (MMI) and Minimum Phone Error (MPE) techniques with 256 Gaussian mixture per Hidden Markov Model(HMM) state. The training of the baseline system has been done using a phonetically rich Hindi dataset. The results show that discriminative training enhances the baseline system performance by up to 3%. Further improvement of ~7% has been recorded by applying RNN LM. The proposed Hindi ASR system shows significant performance improvement over other current state-of-the-art techniques.

The purpose of crowd counting is to estimate the number of pedestrians in crowd images. Crowd counting or density estimation is an extremely challenging task in computer vision, due to large scale variations and dense scene. Current methods solve these issues by compounding multi-scale Convolutional Neural Network with different receptive fields. In this paper, a novel end-to-end architecture based on Multi-Scale Adversarial Convolutional Neural Network (MSA-CNN) is proposed to generate crowd density and estimate the amount of crowd. Firstly, a multi-scale network is used to extract the globally relevant features in the crowd image, and then fractionally-strided convolutional layers are designed for up-sampling the output to recover the loss of crucial details caused by the earlier max pooling layers. An adversarial loss is directly employed to shrink the estimated value into the realistic subspace to reduce the blurring effect of density estimation. Joint training is performed in an end-to-end fashion using a combination of Adversarial loss and Euclidean loss. The two losses are integrated via a joint training scheme to improve density estimation performance.We conduct some extensive experiments on available datasets to show the significant improvements and supremacy of the proposed approach over the available state-of-the-art approaches.

To maintain the competitive edge and evaluating the needs of the quality app is in the mobile application market. The user’s feedback on these applications plays an essential role in the mobile application development industry. The rapid growth of web technology gave people an opportunity to interact and express their review, rate and share their feedback about applications. In this paper we have scrapped 506259 of user reviews and applications rate from Google Play Store from 14 different categories. The statistical information was measured in the results using different of common machine learning algorithms such as the Logistic Regression, Random Forest Classifier, and Multinomial Naïve Bayes. Different parameters including the accuracy, precision, recall, and F1 score were used to evaluate Bigram, Trigram, and N-gram, and the statistical result of these algorithms was compared. The analysis of each algorithm, one by one, is performed, and the result has been evaluated. It is concluded that logistic regression is the best algorithm for review analysis of the Google Play Store applications. The results have been checked scientifically, and it is found that the accuracy of the logistic regression algorithm for analyzing different reviews based on three classes, i.e., positive, negative, and neutral.

In recent years, more and more people are applying Convolutional Neural Networks to the study of sound signals. The main reason is the translational invariance of convolution in time and space. Thereby the diversity of the sound signal can be overcome. However, in terms of sound direction recognition, there are also problems such as a microphone matrix being too large, and feature selection. This paper proposes a sound direction recognition using a simulated human head with microphones at both ears. Theoretically, the two microphones cannot distinguish the front and rear directions. However, we use the original data of the two channels as the input of the convolutional neural network, and the resolution effect can reach more than 0.9. For comparison, we also chose the delay feature (GCC) for sound direction recognition. Finally, we also conducted experiments that used probability distributions to identify more directions.

In this paper, we focus on the human upper limb rehabilitation scheme that utilizes the concept ofteleoperation. Teleoperation can help the therapist demonstrate different rehab exercises to a different group of people at the same time remotely. Different groups of people from a different place connected to the same network can get therapy from the same therapist at the same time using the telerehabilitation scheme. Here, we presented a humanoid robot NAO that can be operated remotely by a therapist to demonstrate the exercise to a patient. To mimic the movement demonstrated by the therapist, Kinect V2 sensor which is a markerless vision-based motion-tracking device, was used. Modified Denavit-Hartenberg (DH) convention was used for the kinematic modeling of the human upper arm. From the Kinect data, a geometric solution was developed to find a unique inverse kinematic solution of human upper-extremity. Experimental results revealed that NAO could be teleoperated successfully to instruct and demonstrate patients to perform different arm movement exercises in real-time.

In the data collection phase, the digital images are captured using sensors that often contaminated by noise (undesired random signal). In digital image processing task, enhancing the image quality and reducing the noise is a central process. Image denoising effectively preserves the image edges to a higher extend in the flat regions. Several adaptive filters (median filter, Gaussian filter, fuzzy filter, etc.) have been utilized to improve the smoothness of digital image, but these filters failed to preserve the image edges while removing noise. In this paper, a modified fuzzy set filter has been proposed to eliminate noise for restoring the digital image. Usually in fuzzy set filter, sixteen fuzzy rules are generated to find the noisy pixels in the digital image. In modified fuzzy set filter, a set of twenty-four fuzzy rules are generated with additional four pixel locations for determining the noisy pixels in the digital image. The additional eight fuzzy rules ease the process of finding the image pixels,whether it required averaging or not. In this scenario, the input digital images were collected from the underwater photography fish dataset. The efficiency of the modified fuzzy set filter was evaluated by varying degrees of Gaussian noise (0.01, 0.03, and 0.1 levels of Gaussian noise). For performance evaluation, Structural Similarity (SSIM), Mean Structural Similarity (MSSIM), Mean Square Error (MSE), Normalized Mean Square Error (NMSE), Universal Image Quality Index (UIQI), Peak Signal to Noise Ratio (PSNR), and Visual Information Fidelity (VIF) were used. The experimental results showed that the modified fuzzy set filter improved PSNR value up to 2-3 dB, MSSIM up to 0.12-0.03, and NMSE value up to 0.38-0.1 compared to the traditional filtering techniques.

Gearbox is one of the vital components in aircraft engines. If any small damage to gearbox, it can cause the breakdown of aircraft engine. Thus it is significant to study fault diagnosis in gearbox system. In this paper, two deep learning models (Long short term memory (LSTM) and Bi-directional long short term memory (BLSTM)) are proposed to classify the condition of gearbox into good or bad. These models are applied on aircraft gearbox vibration data in both time and frequency domain. A publicly available aircraft gearbox vibration dataset is used to evaluate the performance of proposed models. The results proved that accuracy achieved by LSTM and BLSTM are highly reliable and applicable in health monitoring of aircraft gearbox system in time domain as compared to frequency domain. Also, to show the superiority of proposed models for aircraft gearbox fault diagnosis, performance is compared with classical machine learning models.

Image segmentation in land cover regions which are overlapping in satellite imagery, is one crucial challenge. To detect true belonging of one pixel becomes a challenging problem while classifying mixed pixels in overlapping regions. In current work, we propose one new approach for image segmentation using a hybrid algorithm of K-Means and Cellular Automata algorithms. This newly implemented unsupervised model can detect cluster groups using hybrid 2-Dimensional Cellular-Automata model based on K-Means segmentation approach. This approach detects different land use land cover areas in satellite imagery by existing K-Means algorithm. Since it is a discrete dynamical system, cellular automaton realizes uniform interconnecting cells containing states. In the second stage of current model, we experiment with a 2-dimensional cellular automata to rank allocations of pixels among different land-cover regions. The method is experimented on the watershed area of Ajoy river (India) and Salinas (California) data set with true class labels using two internal and four external validity indices. The segmented areas are then compared with existing FCM, DBSCAN and K-Means methods and verified with the ground truth. The statistical analysis results also show the superiority of the new method.

This paper presents a comprehensive Tag set as a fundamental component for developing an automated Word Class/Part-of-Speech ( PoS ) tagging system for the Arabic language. The aim is to develop a standard and comprehensive PoS tag set that based upon PoS classes and Arabic inflectional morphology useful for Linguistics and Natural Language Processing (NLP) developers to extract more linguistic information from it. The tag names in the developed tag set uses terminology from Arabic tradition grammar rather than English grammar. The usability of the presented Tag set has been tested in manual tagging and built up a set of tagged text to serve as a goal corpus used to compare it with the results obtained from the tagger. The tagger has achieved an average accuracy of 90% using the developed detailed tag set.

In this paper a new technique of dual image watermarking is proposed for protection of ownership rights which utilizes salient properties of homomorphic transform (HT), discrete wavelet transform (DWT), singular value decomposition (SVD) and Arnold transform (AT). In embedding algorithm host image is splitted into reflectance and illumination components using HT, DWT is further applied to the reflectance component resulting in frequency subbands (HL and LH) which are transformed by SVD. Two image watermarks are selected for embedding process whereas security of proposed algorithm is strengthen by performing scrambling of second watermark through AT. Both watermarks are transformed with DWT and SVD. Singular values (SVs) of both transformed watermark are embedded into SVs of host image. Simulation results clearly signifies for high robustness and imperceptibility of proposed algorithm as it is examined under various attacks. Superiority of proposed technique is illustrated by comparing it with other reported methods.

In this modern world, a massive amount of data is processed and broadcasted daily. This includes the use of high energy, massive use of memory space, and increased power use. In a few applications, for example, image processing, signal processing, and possession of data signals, etc., the signals included can be viewed as light in a few spaces. The compressive sensing theory could be an appropriate contender to manage these limitations. “Compressive Sensing theory” preserves extremely helpful while signals are sparse or compressible. It very well may be utilized to recoup light or compressive signals with less estimation than customary strategies. Two issues must be addressed by CS: plan of the estimation framework and advancement of a proficient sparse recovery calculation. The essential intention of this work expects to audit a few ideas and utilizations of compressive sensing and to give an overview of the most significant sparse recovery calculations from every class. The exhibition of acquisition and reconstruction strategies is examined regarding the Compression Ratio, Reconstruction Accuracy, Mean Square Error, and so on.

The interest in data anonymization is exponentially growing, motivated by the will of the governments to open their data. The main challenge of data anonymization is to find a balance between data utility and the amount of disclosure risk. One of the most known frameworks of data anonymization is k -anonymity, this method assumes that a dataset is anonymous if and only if for each element of the dataset, there exist at least k − 1 elements identical to it. In this paper, we propose two techniques to achieve k -anonymity through microaggregation: k -CMVM and Constrained-CMVM. Both, use topological collaborative clustering to obtain k -anonymous data. The first one determines the k levels automatically and the second defines it by exploration. We also improved the results of these two approaches by using pLVQ2 as a weighted vector quantization method. The four methods proposed were proven to be efficient using two data utility measures, the separability utility and the structural utility. The experimental results have shown a very promising performance.

The luminous value is high for many natural scenes, which causes loss of information and occurs in dark images. The High Dynamic Range (HDR) technique captures the same objects or scene for multiple times in different exposure and produces the images with proper illumination. This technique is used in the various applications such as medical imaging and observing the skylight, etc. HDR imaging techniques usually have the issue of lower efficiency due to capturing of multiple photos. In this paper, an efficient method is proposed for HDR imaging technique to achieve better performance and lower noise. The Luminance-Chrominance-Gradient High Dynamic Range (LCGHDR) method is proposed to obtain the proper luminous value of images. The same scenario is captured at different exposure are processed by the proposed method. Based on these feature values extracted from the different images and exposure fusion technique was developed that helps for the proper imaging. This experiment was evaluated and analyzed by comparing with the other methods, which showed the efficiency of the proposed method. This method needs only 124.594 seconds for the computation, while existing method need 139.869 seconds for the same number of images.

In order to analyze the characteristics of airport flight delayed time series, based on the construction of flight delay time series, firstly, the K-means algorithm is used to cluster the time series of delayed departures. Secondly, combining with R/S analysis method of Fractal theory, Hurst index of the series is calculated, and Fractal characteristics of the series are analyzed. Then, the VAR (Vector Auto Regression) model is constructed, and Impulse Response Function (IRF) and Variance Decomposition are conducted to explore the impact of the fluctuation of flight delay time series on the future delay. The results show that K-means algorithm divides the time series into five categories, and each category has significant characteristics. Hurst index values of different time series are in the interval of (0.5, 1), indicating that the time series have good fractal characteristics. Through the IRF and Variance Decomposition of VAR model, results show that the time series are significantly affected by random pulses, and the prediction changes of the series come from multiple time series fluctuations. The prediction results show that the flight delay time series is predictable.

In this paper we present the problem of a noisy lexical taxonomy and suggest two tasks as potential remedies. The first task is to identify and eliminate incorrect hypernymy links, and the second is to repopulate the taxonomy with new relations. The first task consists of revising the entire taxonomy and returning a Boolean for each assertion of hypernymy between two nouns (e.g. brie is a kind of cheese ). The second task consists of recursively producing a chain of hypernyms for a given noun, until the most general node in the taxonomy is reached (e.g. brie → cheese → food → etc.). In order to achieve these goals, we implemented a hybrid hypernym-detection algorithm that incorporates various intuitions, such as syntagmatic, paradigmatic and morphological association measures as well as lexical patterns. We evaluate these algorithms individually and collectively and report findings in Spanish, English and French.

Sentiment analysis aims to predict sentiment polarities (positive, negative or neutral) of a given piece of text. It lies at the intersection of many fields such as Natural Language Processing (NLP), Computational Linguistics, and Data Mining. Sentiments can be expressed explicitly or implicitly. Arabic Sentiment Analysis presents a challenge undertaking due to its complexity, ambiguity, various dialects, the scarcity of resources, the morphological richness of the language, the absence of contextual information, and the absence of explicit sentiment words in an implicit piece of text. Recently, deep learning has obviously shown a great success in the field of sentiment analysis and is considered as the state-of-the-art model in Arabic Sentiment Analysis. However, the state-of-the-art accuracy for Arabic sentiment analysis still needs improvements regarding contextual information and implicit sentiment expressed in different real cases. In this paper, an efficient Bidirectional LSTM Network (BiLSTM) is investigated to enhance Arabic Sentiment Analysis, by applying Forward-Backward encapsulate contextual information from Arabic feature sequences. The experimental results on six benchmark sentiment analysis datasets demonstrate that our model achieves significant improvements over the state-of-art deep learning models and the baseline traditional machine learning methods.

This paper proposes a Multi-Agent based Particle Swarm Optimization (PSO) Framework for the Traveling salesman problem (MAPSOFT). The framework is a deployment of the recently proposed intelligent multi-agent based PSO model by the authors. MAPSOFT is made up of groups of agents that interact with one another in a coordinated search effort within their environment and the solution space. A discrete version of the original multi-agent model is presented and applied to the Travelling Salesman Problem. Based on the simulation results obtained, it was observed that agents retrospectively decide on their next moves based on consistent better fitness values obtained from present and prospective neighborhoods, and by reflecting back to previous behaviors and sticking to historically better results. These overall attributes help enhance the conventional PSO by providing more intelligence and autonomy within the swarm and thus contributed to the emergence of good results for the studied problem.

The accurate positioning of target is an important link in robot technology. Based on machine learning algorithm, this study firstly analyzed the location positioning principle of binocular vision of robot, then extracted features of the target using speeded-up robust features (SURF) method, positioned the location using Back Propagation Neural Networks (BPNN) method, and tested the method through experiments. The experimental results showed that the feature extraction of SURF method was fast, about 0.2 s, and was less affected by noise. It was found from the positioning results that the output position of the BPNN method was basically consistent with the actual position, and errors in X, Y and Z directions were very small, which could meet the positioning needs of the robot. The experimental results verify the effectiveness of machine learning method and provide some theoretical support for its further promotion and application in practice.

In the agriculture development and growth, the efficient machinery and equipment plays an important role. Various research studies are involved in the implementation of the research and patents to aid the smart agriculture and authors and reviewers that machine leaning technologies are providing the best support for this growth. To explore machine learning technology and machine learning algorithms, the most of the applications are studied based on the swarm intelligence optimization. An optimized V3CFOA-RF model is built through V3CFOA. The algorithm is tested in the data set collected concerning rice pests, later analyzed and compared in detail with other existing algorithms. The research result shows that the model and algorithm proposed are not only more accurate in recognition and prediction, but also solve the time lagging problem to a degree. The model and algorithm helped realize a higher accuracy in crop pest prediction, which ensures a more stable and higher output of rice. Thus they can be employed as an important decision-making instrument in the agricultural production sector.

The efficient processing of large-scale data has very important practical value. In this study, a data mining platform based on Hadoop distributed file system was designed, and then K-means algorithm was improved with the idea of max-min distance. On Hadoop distributed file system platform, the parallelization was realized by MapReduce. Finally, the data processing effect of the algorithm was analyzed with Iris data set. The results showed that the parallel algorithm divided more correct samples than the traditional algorithm; in the single-machine environment, the parallel algorithm ran longer; in the face of large data sets, the traditional algorithm had insufficient memory, but the parallel algorithm completed the calculation task; the acceleration ratio of the parallel algorithm was raised with the expansion of cluster size and data set size, showing a good parallel effect. The experimental results verifies the reliability of parallel algorithm in big data processing, which makes some contributions to further improve the efficiency of data mining.

One of the important measures of quality of education is the performance of students in academic settings. Nowadays, abundant data is stored in educational institutions about students which can help to discover insight on how students are learning and to improve their performance ahead of time using data mining techniques. In this paper, we developed a student performance prediction model that predicts the performance of high school students for the next semester for five courses. We modeled our prediction system as a multi-label classification task and used support vector machine (SVM), Random Forest (RF), K-nearest Neighbors (KNN), and Multi-layer perceptron (MLP) as base-classifiers to train our model. We further improved the performance of the prediction model using a state-of-the-art partitioning scheme to divide the label space into smaller spaces and used Label Powerset (LP) transformation method to transform each labelset into a multi-class classification task. The proposed model achieved better performance in terms of different evaluation metrics when compared to other multi-label learning tasks such as binary relevance and classifier chains.

Hate speech has spread more rapidly through the daily use of technology and, most notably, by sharing your opinions or feelings on social media in a negative aspect. Although numerous works have been carried out in detecting hate speeches in English, German, and other languages, very few works have been carried out in the context of the Bengali language. In contrast, millions of people communicate on social media in Bengali. The few existing works that have been carried out need improvements in both accuracy and interpretability. This article proposed encoder–decoder-based machine learning model, a popular tool in NLP, to classify user’s Bengali comments from Facebook pages. A dataset of 7,425 Bengali comments, consisting of seven distinct categories of hate speeches, was used to train and evaluate our model. For extracting and encoding local features from the comments, 1D convolutional layers were used. Finally, the attention mechanism, LSTM, and GRU-based decoders have been used for predicting hate speech categories. Among the three encoder–decoder algorithms, attention-based decoder obtained the best accuracy (77%).

This article attempts to study cost minimizing multi-objective fractional solid transportation problem with fuzzy cost coefficients c ˜ i j k r {\tilde{c}}_{ijk}^{r} , fuzzy supply quantities a ˜ i {\tilde{a}}_{i} , fuzzy demands b ˜ j {\tilde{b}}_{j} , and/or fuzzy conveyances e ˜ k {\tilde{e}}_{k} . The fuzzy efficient concept is introduced in which the crisp efficient solution is extended. A necessary and sufficient condition for the solution is established. Fuzzy geometric programming approach is applied to solve the crisp problem by defining membership function so as to obtain the optimal compromise solution of a multi-objective two-stage problem. A linear membership function for the objective function is defined. The stability set of the first kind is defined and determined. A numerical example is given for illustration and to check the validity of the proposed approach.

Gait recognition in video surveillance is still challenging because the employed gait features are usually affected by many variations. To overcome this difficulty, this paper presents a novel Deep Large Margin Nearest Neighbor (DLMNN) method for gait recognition. The proposed DLMNN trains a convolutional neural network to project gait feature onto a metric subspace, under which intra-class gait samples are pulled together as small as possible while inter-class samples are pushed apart by a large margin. We provide an extensive evaluation in terms of various scenarios, namely, normal, carrying, clothing, and cross-view condition on two widely used gait datasets. Experimental results demonstrate that the proposed DLMNN achieves competitive gait recognition performances and promising computational efficiency.

The bin-packing problem (BPP) is an age-old NP-hard combinatorial optimization problem, which is defined as the placement of a set of different-sized items into identical bins such that the number of containers used is optimally minimized. Besides, different variations of the problem do exist in practice depending on the bins dimension, placement constraints, and priority. More so, there are several important real-world applications of the BPP, especially in cutting industries, transportation, warehousing, and supply chain management. Due to the practical relevance of this problem, researchers are consistently investigating new and improved techniques to solve the problem optimally. Nature-inspired metaheuristics are powerful algorithms that have proven their incredible capability of solving challenging and complex optimization problems, including several variants of BPPs. However, no comprehensive literature review exists on the applications of the metaheuristic approaches to solve the BPPs. Therefore, to fill this gap, this article presents a survey of the recent advances achieved for the one-dimensional BPP, with specific emphasis on population-based metaheuristic algorithms. We believe that this article can serve as a reference guide for researchers to explore and develop more robust state-of-the-art metaheuristics algorithms for solving the emerging variants of the bin-parking problems.

To improve the intelligence of urban and rural buses, it is necessary to realize the accurate prediction of bus arrival time. This paper first introduced urban and rural buses. Then, the arrival time prediction was divided into two parts: road travel time and stop time, and they were predicted by the support vector regression method and k -nearest neighbor (KNN) method. A section of a bus route in Pingdingshan city of Henan province was taken as an example for analysis. The results showed that the method designed in this study had better accuracy, and the result was closer to the actual value, with a maximum error of 84 s, a minimum error of 10 s, an average error of 42.5 s, and an average relative error of 5.74%, which could meet the needs of passengers. The results verify the reliability of the designed method in predicting the arrival time of urban and rural buses, which can be popularized and applied in practice.

Collaborative learning has recently achieved very significant results. It still suffers, however, from several issues, including the type of information that needs to be exchanged, the criteria for stopping and how to choose the right collaborators. We aim in this paper to improve the quality of the collaboration and to resolve these issues via a novel approach inspired by Optimal Transport theory. More specifically, the objective function for the exchange of information is based on the Wasserstein distance, with a bidirectional transport of information between collaborators. This formulation allows to learns a stopping criterion and provide a criterion to choose the best collaborators. Extensive experiments are conducted on multiple data-sets to evaluate the proposed approach.

In the tourism industry, the sales of local specialties is an important part, and the package design and integrity of the specialties are very important. This paper first introduced the support vector machine (SVM) algorithm that was used for detecting defects on the surface of paper packages. Then, the design of red wind packages was briefly described, and the simulation experiment was carried out on SVM algorithm using red wine packages with different degrees of surface defects. Proper parameters were tested using the k -fold cross-validation method. The results demonstrated that the properties of paper improved the value of packages and the SVM algorithm had better accuracy than artificial recognition in recognizing different degrees of defects on the surface of packages. In conclusion, this paper describes the application of paper in packages and provides an effective method for the defection of defects on the surface of packages. This study provides an effective references to the improvement of package values and the enhancement of package integrity.

Over the past decade, unmanned aerial vehicles (UAVs) have received increasing attention and are being used in the areas of harvesting, videotaping, and the military industry. In this article, the consideration is focused on areas where video recording is required for ground inspections. This paper describes modern communication technologies and systems that enable interaction and data exchange between UAVs and a ground control station (GCS). This article focuses on different architectures of communication systems, establishing the characteristics of each to identify the preferred architecture that does not require a significant consumption of resources and whose data transmission is reliable. A coherent architecture that includes multiple UAVs, wireless sensor networks, cellular networks, GCSs, and satellite network to duplicate communications for enhanced system security has been offered. Some reliability problems have been discussed, the solution of which was suggested to be a backup connection via satellite, i.e., a second connection. This study focused not only on the communication channels but also on the data exchanged between system components, indicating the purpose of their application. Some of the communication problems and shortcomings of various systems, as well as further focus areas and improvement recommendations were discussed.

In this research work, a user-friendly decision support framework is developed to analyze the behavior of Pakistani students in academics. The purpose of this article is to analyze the performance of the Pakistani students using an intelligent decision support system (DSS) based on the three-level machine learning (ML) technique. The neural network used a three-level classifier approach for the prediction of Pakistani student achievement. A self-recorded dataset of 1,011 respondents of graduate students of English and Physics courses are used. The ten interviews along with ten questions were conducted to determine the perception of the individual student. The chi-squared ( χ ) \left(\chi ) test was applied to test statistical significancy of the questionnaire. The statistical calculations and computation of data were performed by using the statistical package of IBMM SPSS version 21.0. The seven different algorithms were tested to improve the data classification. The Java-based environment was used for the development of numerous prediction classifiers. C4.5 algorithm shows the finest accuracy, whereas Naïve Bayes (NB) algorithm shows the least. The results depict that the classifier’s efficiency was improved by using a three-level proposed scheme from 83.2% to 88.8%. This prediction has shown remarkable results when compared with the individual level classifier technique of ML. This improvement in the accuracy of DSSs is used to identify more efficiently the gray areas in the education stratum of Pakistan. This will pave a path for making policies in the higher education system of Pakistan. The presented framework can be deployed on different platforms under numerous operating systems.

This study mainly analyzed the keyword extraction of English text. First, two commonly used algorithms, the term frequency–inverse document frequency (TF–IDF) algorithm and the keyphrase extraction algorithm (KEA), were introduced. Then, an improved TF–IDF algorithm was designed, which improved the calculation of word frequency, and it was combined with the position weight to improve the performance of keyword extraction. Finally, 100 English literature was selected from the British Academic Written English Corpus for the analysis experiment. The results showed that the improved TF–IDF algorithm had the shortest running time and took only 4.93 s in processing 100 texts; the precision of the algorithms decreased with the increase of the number of extracted keywords. The comparison between the two algorithms demonstrated that the improved TF–IDF algorithm had the best performance, with a precision rate of 71.2%, a recall rate of 52.98%, and an F 1 score of 60.75%, when five keywords were extracted from each article. The experimental results show that the improved TF–IDF algorithm is effective in extracting English text keywords, which can be further promoted and applied in practice.

Basic syntactic analysis refers to sentence-level syntactic analysis. In the process of developing the Mat Link English–Chinese machine translation system, the Generalized Maximum Likelihood Ratio algorithm was improved, and a basic English syntax analyzer for English–Chinese translation was designed and implemented. The analyzer approves the structure of the analysis table with a variety of export products, introduces the character mapping function to realize the automatic recognition of the sentence boundary, uses the children of the same level to describe the grammatical structure of the sentence, and realizes the proverb from the original sentence to the target sentence stage conversion. Finally, through the analysis of example sentences, the design concept and working process of the basic grammar are explained.

A portrait recognition system can play an important role in emergency evacuation in mass emergencies. This paper designed a portrait recognition system, analyzed the overall structure of the system and the method of image preprocessing, and used the Single Shot MultiBox Detector (SSD) algorithm for portrait detection. It also designed an improved algorithm combining principal component analysis (PCA) with linear discriminant analysis (LDA) for portrait recognition and tested the system by applying it in a shopping mall to collect and monitor the portrait and establish a data set. The results showed that the missing detection rate and false detection rate of the SSD algorithm were 0.78 and 2.89%, respectively, which were lower than those of the AdaBoost algorithm. Comparisons with PCA, LDA, and PCA + LDA algorithms demonstrated that the recognition rate of the improved PCA + LDA algorithm was the highest, which was 95.8%, the area under the receiver operating characteristic curve was the largest, and the recognition time was the shortest, which was 465 ms. The experimental results show that the improved PCA + LDA algorithm is reliable in portrait recognition and can be used for emergency evacuation in mass emergencies.

The need for services in the world of telecommunications and the prosperity and rapid development of this sector around the world has led mobile phone companies to compete to provide the best services to customers. One of these devices used for communications is the mobile phone. The mobile phone is simply an electronic device that is mainly serving unwired telecommunications through a cellular network of particular base stations known as cell sites. There are many obstacles or problems in the telecommunication field, and the relevant institutions and companies should find solutions to these obstacles and problems. One of these obstacles in telecommunications is the coverage holes. Coverage holes occur when the location of the mobile phone is set in midway between the two base transceiver stations (BTSs). This causes an abnormal interruption in communication until the user crosses the coverage holes area. This paper presents an intelligent algorithm as a set of technical steps that can be used to improve the communication services of the mobile phone network and to solve the communication problems via the reduction of the coverage holes between two BTSs. It suggests a method that could alleviate this problem using a strategy that reduces the coverage holes by developing an intelligent algorithm system to receive signal strength indicators and use AT command “+CREG” to disconnect and reconnect to available BTS within an acceptable energy level. As a result, the connection turned from marginal into good connection.

Based on the concept of “passengers self-help hubbing,” we build a flight schedule optimization model where maximizing the number of feasible flight connections, indicating transfer opportunities, as one objective and minimizing total slot displacements as the other objective. At the same time, the “Demand Smoothing Model” is introduced into the flight schedule optimization model to reduce the queuing delays for arrival and departure flights. We take into account all aircraft itineraries, the difficulty level of schedule coordination, and the maximum displacement of any single flight acceptable to airlines when optimizing flight schedule. Given an original schedule, the model produces a feasible modified schedule that obeys the slot limits specified for an airport without canceling any flights, increases transfer opportunities, and improves on-time performance for hub airports while reducing interference with airline scheduling preferences. The model was verified with the operating data of the Urumqi international airport, and the results show that minor adjustments to flight schedules can increase the transfer opportunities of the airport and significantly reduce flight queuing delays.

Based on neural machine translation, this article introduced the ConvS2S system and transformer system, designed a semantic sharing combined transformer system to improve translation quality, and compared the three systems on the NIST dataset. The results showed that the operation speed of the semantic sharing combined transformer system was the highest, reaching 3934.27 words per second; the BLEU value of the ConvS2S system was the smallest, followed by the transformer system and the semantic sharing combined transformer system. Taking NIST08 as an example, the BLEU values of the designed system were 4.74 and 1.49 higher than the other two systems. The analysis of examples showed that the semantic sharing combined transformer had higher translation quality. The experimental results show that the proposed system is reliable in English content translation and can be further promoted and applied in practice.

Through the analysis of emotional tendency in online public opinion, governments and enterprises can stabilize people’s emotion more effectively and maintain social stability. The problem studied in this paper is how to analyze the emotional tendency of online public opinion efficiently, and finally, this paper chooses deep learning algorithm to perform fast analysis of emotional tendency of online public opinion. This paper briefly introduced the structure of the basic model used for emotional tendency analysis of online public opinion and the convolutional neural network (CNN) model used for text emotion classification. Then, the CNN model was improved by long short-term memory (LSTM). A simulation experiment was carried out on MATLAB for the improved text emotion classification model to verify the influence of activation function type on the improved model and the performance difference between the improved model and support vector machine (SVM) and traditional CNN models. The results showed that the improved classification model that adopted the sigmoid activation function had higher accuracy and was less affected by language than the relu and tanh activation functions; the improved classification model had the highest accuracy, recall rate, and F -value in classifying emotional tendency of web texts, followed by the traditional CNN model and the SVM model.

The rapid pace of development over the last few decades in the domain of machine learning mirrors the advances made in the field of quantum computing. It is natural to ask whether the conventional machine learning algorithms could be optimized using the present-day noisy intermediate-scale quantum technology. There are certain computational limitations while training a machine learning model on a classical computer. Using quantum computation, it is possible to surpass these limitations and carry out such calculations in an optimized manner. This study illustrates the working of the quantum support vector machine classification model which guarantees an exponential speed-up over its typical alternatives. This research uses the quantum SVM model to solve the classification task of a malignant breast cancer diagnosis. This study also demonstrates a comparative analysis of distinct forms of SVM algorithms concerning their time complexity and performances on standard evaluation metrics, namely accuracy, precision, recall, and F 1-score, to exemplify the supremacy of quantum SVM over its conventional variants.

In synthetic aperture radar (SAR) image segmentation field, regional algorithms have shown great potential for image segmentation. The SAR images have a multiplicity of complex texture, which are difficult to be divided as a whole. Existing algorithm may cause mixed super-pixels with different labels due to speckle noise. This study presents the technique based on organization evolution (OEA) algorithm to improve ISODATA in pixels. This approach effectively filters out the useless local information and successfully introduces the effective information. To verify the accuracy of OEA-ISO data algorithm, the segmentation effect of this algorithm is tested on SAR image and compared with other techniques. The results demonstrate that the OEA-ISO data algorithm is 10.16% more accurate than the WIPFCM algorithm, 23% more accurate than the K -means algorithm, and 27.14% more accurate than the fuzzy C -means algorithm in the light-colored farmland category. It can be seen that the OEA-ISO data algorithm introduces the pixel block strategy, which successfully reduces the noise interference in the image, and the effect is more obvious when the image background is complex.

High-dimensional data analysis has become the most challenging task nowadays. Dimensionality reduction plays an important role here. It focuses on data features, which have proved their impact on accuracy, execution time, and space requirement. In this study, a dimensionality reduction method is proposed based on the convolution of input features. The experiments are carried out on minimal preprocessed nine benchmark datasets. Results show that the proposed method gives an average 38% feature reduction in the original dimensions. The algorithm accuracy is tested using the decision tree (DT), support vector machine (SVM), and K -nearest neighbor (KNN) classifiers and evaluated with the existing principal component analysis algorithm. The average increase in accuracy (Δ) is 8.06 for DT, 5.80 for SVM, and 18.80 for the KNN algorithm. The most significant characteristic feature of the proposed model is that it reduces attributes, leading to less computation time without loss in classifier accuracy.

The machines exhibit an intelligence which is artificial intelligence (AI), and it is the design of intelligent agents. A system is represented by an intelligent agent who perceives its environment and the success rate is maximized by taking the action. The AI research is highly specialized and there are two subfields and each communication fails often. The popular AI approaches include the traditional symbolic AI and computational intelligence. In order to optimize the seismic design of the reinforced concrete pier structure, the particle swarm optimization (PSO) algorithm and the reaction spectrum analysis method are combined; they establish a regular bridge of the design variable with cross-sectional characteristics and reinforcement ratios, with the target function. The seismic optimization design framework of the pier is transformed into a multi-objective optimization problem. Calculations show that the method can quickly obtain the optimal design parameters that meet multi-objective requirements. The improved PSO main program and the calling push-over program run time are 4.32 and 1347.56 s, respectively; the push-over program running time is 99.68% of the run time of the total program. Optimization of the seismic performance of the rear bridge pier is significantly improved and is more in line with the design method; the design method proposed in this article is more practical.

Frequency selective surface (FSS)-based intelligent spatial filters are capturing the eyes of the researchers by offering a dynamic behavior when exposed to the electromagnetic radiations. In this manuscript, a concept of creating complementary structures which stems from Babinet’s principle is illustrated. A hybrid complementary pair of FSS (CPFSS) comprising double square loop FSS (DSLFSS) and double square slot FSS (DSSFSS) on either side of the dielectric substrate is proposed. DSLFSS offers band-pass behavior and can be placed as a superstrate, whereas DSSFSS behaves as a band-stop intelligent spatial filter that blocks the radiations falling on it, thus making them applicable for use as a substrate. The technique utilized for analyzing DSLFSS and DSSFSS structures is based on the equivalent circuit modeling and transmission line methodology. The CPFSS structure offers the design simplicity, hence, suitable for placing them with the printed patch antenna radiators in wireless networking devices operating in sub-6 GHz 5G spectrum. DSLFSS offers band-pass behavior ranging from 2.99 to 5.56 GHz, whereas DSSFSS offers band-stop behavior ranging from 2.85 to 5.42 GHz covering all n77 (3.3–4.2 GHz), n78 (3.3–3.8 GHz), and n79 (4.4–5 GHz) bands of FR1 spectrum of sub-6 GHz 5G range. The passband and the stopband offered by the two structures of CPFSS geometry are stable to oblique angles of incidence and the proposed design also offers polarization-independent behavior. The thickness of the dielectric region existing within the pair of designed structures is critical for the location of the passbands and the stopbands. The impact of the overall thickness of the dielectric substrate on the passbands and stopbands is also reported in this article.

Background As noise brings great error in the analysis of metallographic images, an adaptive weighted mean filtering method proposed to overcome the shortcomings of the standard mean filtering method. Methods The method used to detect the pulse noise points in the image, and then the modified mean method used to filter out the detected noise points. Patents on metallographic image processing have discussed for the development of the proposed methodology. Results It is shown that filter window can be filtered in comparison with the conventional 3×3, 5×5 and 7×7 filt window to reduce noise detection and reduce the complexity of the weight calculation. Conclusion It can be concluded that this method can better protect the details of the image, has better filtering effect than the standard mean filtering, and its processing speed is faster than the median filtering of the large window, which has profound significance for the edge detection and processing of the metallographic image.

Optimization by definition is the action of making most effective or the best use of a resource or situation and that is required almost in every field of engineering. In this work, the optimization of Least Mean square (LMS) algorithm is carried out with the help of Particle Swarm Optimization (PSO) and Ant Colony Optimization (ACO). Efforts have been made to find out the advantages and disadvantages of combining gradient based (LMS) algorithm with Swarm Intelligence SI (ACO, PSO). This optimization of LMS algorithm will help us in further extending the uses of adaptive filtering to the system having multi-model error surface that is still a gray area of adaptive filtering. Because the available version of LMS algorithm that plays an important role in adaptive filtering is a gradient based algorithm, that get stuck at the local minima of system with multi-model error surface considering it global minima, resulting in an non-optimized convergence. By virtue of the proposed method we have got a profound solution for the problem associated with system with multimodal error surface. The results depict significant improvements in the performance and displayed fast convergence rate, rather stucking at local minima. Both the SI techniques displayed their own advantage and can be separately combined with LMS algorithm for adaptive filtering. This optimization of LMS algorithm will further help to resolve serious interference and noise issues and holds a very important application in the field of biomedical science.

Data analysis has become most widespread field of research and it has extended in almost every field of study. Considering the recent trends and developments in the field of communication and information technology, there is a scope of combining the monitoring of substation equipment with big data analysis technology. That will result in an improved data analysis ability, information sharing and utilization rate of monitoring data. In the proposed work, the authors have introduced the big data analysis and its corresponding application in the monitoring of substations. Basic concepts and the procedures of the typical data analysis for general problems are also discussed. As a main part of the paper, different types of distributed data analysis techniques have been proposed, in which two relational online analysis, namely Hive and Impala and one H Base multidimensional online analysis are important. These data analysis techniques are proposed considering the analysis efficiency, storage performance from the business development requirements point of view of the substation. The result obtained depicts that the proposed model has an advantage in storage overhead and roll-up performance, when compared with the traditional method, although the data loading speed is approximately 1.7–1.9 times of the traditional model. Some experiments are carried out in order to verify the validity of the model.

With the technological evolutionary advent, a vision-based approach presents the remote measuring approach for the analysis of vibration. The structure vibration test and model parameter identification in the detection of the structure of the bridge evaluation occupies the important position. The bridge structure to operate safely and reliably is ensured, according to the geological data of qixiashan lead-zinc mine and engineering actual situation, with the aid of international mining software Surpac. To build the 3D visualization model of the application of visualization in mine production are discussed. The results show that the final solid model of -425 stope can accurately display the spatial form of each layer of stope through rotation, amplification and movement. The proposed system is effectually able to perform cutting, volume calculation and roaming in any direction, which has certain guiding significance for mine production management. An accuracy value of 98.75%, the sensitivity of 99%, specificity of 99.64% and PPV of 99.89% are achieved using the proposed 3D modelling and visualization algorithm for vibration signal processing and management.

This paper presents a method for the study of the influence of stability of a power transformer on the power system based on the vibration principle. Traditionally, the EMD and EEMD algorithms are employed to test the box vibration signal data of the power transformer under three working conditions. The proposed method utilizes a partial EMD screening along with MPEEMD method for the online monitoring of power transformer. A complete online monitoring system is designed by using the STM32 processor and LabVIEW system. The proposed system is compared with EMD and EEMD algorithms in terms of the number of IMFs obtained by decomposition, maximum correlation coefficient, and mean square error. The inherent mode correlation, when compared with the mean square error of the reconstructed signal, shows that the reconstruction error of MPEEMD algorithm is 4.762×10 −15 which is better than the traditional EMD algorithm. It is observed from the results that the proposed method outperforms both EMD and EEMD algorithms.

With the advancement of internet and the emergence of network globalization, security has always been a major concern. During the trial operation, the management control platform discussed in this article included more than 600 network security vulnerabilities in the industry, with dozens of incidents, which were promptly dealt with and rectified, effectively improving the level of network security management and protection in the industry. As networks are very much vulnerable to denial of service attacks, much more emphasis has been given to security. By improving their network security, network administrators have often tried their best. To attempt penetration testing, it is the best way of ensuring the system security. With the development of information technology, the security requirement of information system is increasing day by day. The use of penetration testing technology is conducive to the realization of accurate positioning, accurate detection, and active alarm of security vulnerabilities, and the optimization of monitoring and rectification of the combination of network security management control system. Taking penetration testing technology as one of the core elements of management and control, the risk index model is optimized to make network security management controllable and efficient, and effectively achieve management and control objectives.

In order to correct the deficiencies of intrusion detection technology, the entire computer and network security system are needed to be more perfect. This work proposes an improved k-means algorithm and an improved Apriori algorithm applied in data mining technology to detect network intrusion and security maintenance. The classical KDDCUP99 dataset has been utilized in this work for performing the experimentation with the improved algorithms. The algorithm’s detection rate and false alarm rate are compared with the experimental data before the improvement. The outcomes of proposed algorithms are analyzed in terms of various simulation parameters like average time, false alarm rate, absolute error as well as accuracy value. The results show that the improved algorithm advances the detection efficiency and accuracy using the designed detection model. The improved and tested detection model is then applied to a new intrusion detection system. After intrusion detection experiments, the experimental results show that the proposed system improves detection accuracy and reduces the false alarm rate. A significant improvement of 90.57% can be seen in detecting new attack type intrusion detection using the proposed algorithm.

A recent advent has been seen in the usage of Internet of things (IoT) for autonomous devices for exchange of data. A large number of transformers are required to distribute the power over a wide area. To ensure the normal operation of transformer, live detection and fault diagnosis methods of power transformers are studied. This article presents an IoT-based approach for condition monitoring and controlling a large number of distribution transformers utilized in a power distribution network. In this article, the vibration analysis method is used to carry out the research. The results show that the accuracy of the improved diagnosis algorithm is 99.01, 100, and 100% for normal, aging, and fault transformers. The system designed in this article can effectively monitor the healthy operation of power transformers in remote and real-time. The safety, stability, and reliability of transformer operation are improved.

The data with the advancement of information technology are increasing on daily basis. The data mining technique has been applied to various fields. The complexity and execution time are the major factors viewed in existing data mining techniques. With the rapid development of database technology, many data storage increases, and data mining technology has become more and more important and expanded to various fields in recent years. Association rule mining is the most active research technique of data mining. Data mining technology is used for potentially useful information extraction and knowledge from big data sets. The results demonstrate that the precision ratio of the presented technique is high comparable to other existing techniques with the same recall rate, i.e., the R-tree algorithm. The proposed technique by the mining effectively controls the noise data, and the precision rate is also kept very high, which indicates the highest accuracy of the technique. This article makes a systematic and detailed analysis of data mining technology by using the Apriori algorithm.

In order to study the intelligent collection system of moving object trajectory data under cloud computing, information useful to passengers and taxi drivers is collected from massive trajectory data. This paper uses cloud computing technology, through clustering algorithm and density-based DBSCAN algorithm combined with Map Reduce programming model and design trajectory clustering algorithm. The results show that based on the 8-day data of 15,000 taxis in Shenzhen, the characteristic time period is determined. The passenger hot spot area is obtained by clustering the passenger load points in each time period, which verifies the feasibility of the passenger load point recommendation application based on trajectory clustering. Therefore, in the absence of holidays, the number of passenger hotspots tends to be stable. It is reliable to perform cluster analysis. The recommended application has been demonstrated through experiments, and the implementation results show the rationality of the recommended application design and the feasibility of practice.

Large amount of data are exchanged and the internet is turning into twenty-first century Silk Road for data. Machine learning (ML) is the new area for the applications. The artificial intelligence (AI) is the field providing machines with intelligence. In the last decades, more developments have been made in the field of ML and deep learning. The technology and other advanced algorithms are implemented into more computational constrained devices. The online English test system based on ML breaks the shackles of the traditional paper English test and improves the efficiency of the English test. At the same time, it also maintains the fairness of English test and improves the marking speed. In order to realize an online English test system based on ML and facilitate the assessment of students’ college English courses, this paper mainly adopts relevant research and design on the main functional modules, key technologies, and functional realization of the online English test. The brand-new powerful teaching software and the online examination system can help schools to conduct more systematic and scientific management. The conclusion shows that as brand-new and powerful teaching software, the online examination system can help schools to conduct more systematic and scientific management.

The QR code recognition often faces the challenges of uneven background fluctuations, inadequate illuminations, and distortions due to the improper image acquisition method. This makes the identification of QR codes difficult, and therefore, to deal with this problem, artificial intelligence-based systems came into existence. To improve the recognition rate of QR image codes, this article adopts an improved adaptive median filter algorithm and a QR code distortion correction method based on backpropagation (BP) neural networks. This combination of artificial intelligence algorithms is capable of fitting the distorted QR image into the geometric deformation pattern, and QR code recognition is accomplished. The two-dimensional code distortion is addressed in this study, which was a serious research issue in the existing software systems. The research outcomes obtained after emphasizing on the preprocessing stage of the image revealed that a significant improvement of 14% is observed for the reading rate of QR image code, after processing by the system algorithm in this article. The artificial intelligence algorithm adopted has a certain effect in improving the recognition rate of the two-dimensional code image.

The dependency of a speech recognition system on the accent of a user leads to the variation in its performance, as the people from different backgrounds have different accents. Accent labeling and conversion have been reported as a prospective solution for the challenges faced in language learning and various other voice-based advents. In the English TTS system, the accent labeling of unregistered words is another very important link besides the phonetic conversion. Since the importance of the primary stress is much greater than that of the secondary stress, and the primary stress is easier to call than the secondary stress, the labeling of the primary stress is separated from the secondary stress. In this work, the labeling of primary accents uses a labeling algorithm that combines morphological rules and machine learning; the labeling of secondary accents is done entirely through machine learning algorithms. After 10 rounds of cross-validation, the average tagging accuracy rate of primary stress was 94%, the average tagging accuracy rate of secondary stress was 94%, and the total tagging accuracy rate was 83.6%. This perceptual study separates the labeling of primary and secondary accents providing the promising outcomes.

Decision trees learning is one of the most practical classification methods in machine learning, which is used for approximating discrete-valued target functions. However, they may overfit the training data, which limits their ability to generalize to unseen instances. In this study, we investigated the use of instance reduction techniques to smooth the decision boundaries before training the decision trees. Noise filters such as ENN, RENN, and ALLKNN remove noisy instances while DROP3 and DROP5 may remove genuine instances. Extensive empirical experiments were conducted on 13 benchmark datasets from UCI machine learning repository with and without intentionally introduced noise. Empirical results show that eliminating border instances improves the classification accuracy of decision trees and reduces the tree size, which reduces the training and classification times. In datasets without intentionally added noise, applying noise filters without the use of the built-in Reduced Error Pruning gave the best classification accuracy. ENN, RENN, and ALLKNN outperformed decision trees learning without pruning in 9, 9, and 8 out of 13 datasets, respectively. The datasets reduced using ENN and RENN without built-in pruning were more effective when noise was intentionally introduced in different ratios.

The Covid-19 pandemic is forcing organizations to innovate and change their strategies for a new reality. This study collects online learning related tweets in Arabic language to perform a comprehensive emotion mining and sentiment analysis (SA) during the pandemic. The present study exploits Natural Language Processing (NLP) and Machine Learning (ML) algorithms to extract subjective information, determine polarity and detect the feeling. We begin with pulling out the tweets using Twitter APIs and then preparing for intensive preprocessing. Second, the National Research Council Canada (NRC) Word-Emotion Lexicon was examined to calculate the presence of the eight emotions at their emotional weight. Third, Information Gain (IG) is used as a filtering technique. Fourth, the latent reasons behind the negative sentiments were recognized and analyzed. Finally, different classification algorithms including Naïve Bayes (NB), Multinomial Naïve Bayes (MNB), K Nearest Neighbor (KNN), Logistic Regression (LR), and Support Vector Machine (SVM) were examined. The experiments reveal that the proposed model performs well in analyzing the perception of people about coronavirus with a maximum accuracy of about 89.6% using SVM classifier. From a practical perspective, the method could be generalized to other topical domains, such as public health monitoring and crisis management. It would help public health officials identify the progression and peaks of concerns for a disease in space and time, which enables the implementation of appropriate preventive actions to mitigate these diseases.

Reliable data transfer and energy efficiency are the essential considerations for network performance in resource-constrained underwater environments. One of the efficient approaches for data routing in underwater wireless sensor networks (UWSNs) is clustering, in which the data packets are transferred from sensor nodes to the cluster head (CH). Data packets are then forwarded to a sink node in a single or multiple hops manners, which can possibly increase energy depletion of the CH as compared to other nodes. While several mechanisms have been proposed for cluster formation and CH selection to ensure efficient delivery of data packets, less attention has been given to massive data communication processes with sink node. As such, failure in communicating nodes would lead to a significant network void-holes problem. Considering the limited energy resources of nodes in UWSNs along with the heavy load of CHs in the routing process, this paper proposes a void-holes aware and reliable data forwarding strategy (VHARD-FS) in a proactive mode to control data packets delivery from CH nodes to the sink in UWSNs. In the proposed strategy, each CH node is aware of its neighbor’s performance ranking index to conduct a reliable packet transmission to the sink via the most energy-efficient route. Extensive simulation results indicate that the VHARD-FS outperforms existing routing approaches while comparing energy efficiency and network throughput. This study helps to effectively alleviate the resource limitations associated with UWSNs by extending network life and increasing service availability even in a harsh underwater environment.

Spam electronic mails (emails) refer to harmful and unwanted commercial emails sent to corporate bodies or individuals to cause harm. Even though such mails are often used for advertising services and products, they sometimes contain links to malware or phishing hosting websites through which private information can be stolen. This study shows how the adaptive intelligent learning approach, based on the visual anti-spam model for multi-natural language, can be used to detect abnormal situations effectively. The application of this approach is for spam filtering. With adaptive intelligent learning, high performance is achieved alongside a low false detection rate. There are three main phases through which the approach functions intelligently to ascertain if an email is legitimate based on the knowledge that has been gathered previously during the course of training. The proposed approach includes two models to identify the phishing emails. The first model has proposed to identify the type of the language. New trainable model based on Naive Bayes classifier has also been proposed. The proposed model is trained on three types of languages (Arabic, English and Chinese) and the trained model has used to identify the language type and use the label for the next model. The second model has been built by using two classes (phishing and normal email for each language) as a training data. The second trained model (Naive Bayes classifier) has been applied to identify the phishing emails as a final decision for the proposed approach. The proposed strategy is implemented using the Java environments and JADE agent platform. The testing of the performance of the AIA learning model involved the use of a dataset that is made up of 2,000 emails, and the results proved the efficiency of the model in accurately detecting and filtering a wide range of spam emails. The results of our study suggest that the Naive Bayes classifier performed ideally when tested on a database that has the biggest estimate (having a general accuracy of 98.4%, false positive rate of 0.08%, and false negative rate of 2.90%). This indicates that our Naive Bayes classifier algorithm will work viably on the off chance, connected to a real-world database, which is more common but not the largest.

Visual cryptography is a cryptographic technique that allows visual information to be encrypted so that the human optical system can perform the decryption without any cryptographic computation. The halftone visual cryptography scheme (HVCS) is a type of visual cryptography (VC) that encodes the secret image into halftone images to produce secure and meaningful shares. However, the HVC scheme has many unsolved problems, such as pixel expansion, low contrast, cross-interference problem, and difficulty in managing share images. This article aims to enhance the visual quality and avoid the problems of cross-interference and pixel expansion of the share images. It introduces a novel optimization of color halftone visual cryptography (OCHVC) scheme by using two proposed techniques: hash codebook and construction techniques. The new techniques distribute the information pixels of a secret image into a halftone cover image randomly based on a bat optimization algorithm. The results show that these techniques have enhanced security levels and make the proposed OCHVC scheme more robust against different attacks. The OCHVC scheme achieves mean squared error (MSE) of 95.0%, peak signal-to-noise ratio (PSNR) of 28.3%, normalized cross correlation (NCC) of 99.4%, and universal quality index (UQI) of 99.3% on average for the six shares. Subsequently, the experiment results based on image quality metrics show improvement in size, visual quality, and security for retrieved secret images and meaningful share images of the OCHVC scheme. Comparing the proposed OCHVC with some related works shows that the OCHVC scheme is more effective and secure.

Soon after the first COVID-19 positive case was detected in Wuhan, China, the virus spread around the globe, and in no time, it was declared as a global pandemic by the WHO. Testing, which is the first step in identifying and diagnosing COVID-19, became the first need of the masses. Therefore, testing kits for COVID-19 were manufactured for efficiently detecting COVID-19. However, due to limited resources in the densely populated countries, testing capacity even after a year is still a limiting factor for COVID-19 diagnosis on a larger scale and contributes to a lag in disease tracking and containment. Due to this reason, we started this study to provide a better cost-effective solution for enhancing the testing capacity so that the maximum number of people could get tested for COVID-19. For this purpose, we utilized the approach of artificial neural networks (ANN) to acquire the relevant data on COVID-19 and its testing. The data were analyzed by using Machine Learning, and probabilistic algorithms were applied to obtain a statistically proven solution for COVID-19 testing. The results obtained through ANN indicated that sample pooling is not only an effective way but also regarded as a “Gold standard” for testing samples when the prevalence of the disease is low in the population and the chances of getting a positive result are less. We further demonstrated through algorithms that pooling samples from 16 individuals is better than pooling samples of 8 individuals when there is a high likelihood of getting negative test results. These findings provide ground to the fact that if sample pooling will be employed on a larger scale, testing capacity will be considerably increased within limited available resources without compromising the test specificity. It will provide healthcare units and enterprises with solutions through scientifically proven algorithms, thus, saving a considerable amount of time and finances. This will eventually help in containing the spread of the pandemic in densely populated areas including vulnerably confined groups, such as nursing homes, hospitals, cruise ships, and military ships.

In a digital communication environment, information security is mandatory. Three essential parameters used in the design process of a steganography algorithm are Payload, security, and fidelity. However, several methods are implemented in information hiding, such as Least Significant Bit (LBS), Discrete Wavelet Transform, Masking, and Discrete Cosine Transform. The paper aims to investigate novel steganography techniques based on agent technology. It proposes a Framework of Steganography based on agent for secret communication using LSB. The most common image steganography databases are explored for training and testing. The methodology in this work is based on the statistical properties of the developed agent software using Matlab. The experiment design is based on six statistical feature measures, including Histogram, Mean, Standard deviation, Entropy, Variance and Energy. For steganography, an Ensemble classifier is used to test two scenarios: embedding a single language message and inserting bilingual messages. ROC Curve represents the evaluation metrics. The result shows that the designed agent-based system with 50% training/testing sample set and 0.2 Payload can pick out the best cover image for the provided hidden message size to avoid visual artifact.

Designing a data-responsive system requires accurate input to ensure efficient results. The growth of technology in sensing methods and the needs of various kinds of data greatly impact data fusion (DF)-related study. A coordinative DF framework entails the participation of many subsystems or modules to produce coordinative features. These features are utilized to facilitate and improve solving certain domain problems. Consequently, this paper proposes a general Multiple Coordinative Data Fusion Modules (MCDFM) framework for real-time and heterogeneous data sources. We develop the MCDFM framework to adapt various DF application domains requiring macro and micro perspectives of the observed problems. This framework consists of preprocessing, filtering, and decision as key DF processing phases. These three phases integrate specific purpose algorithms or methods such as data cleaning and windowing methods for preprocessing, extended Kalman filter (EKF) for filtering, fuzzy logic for local decision, and software agents for coordinative decision. These methods perform tasks that assist in achieving local and coordinative decisions for each node in the network of the framework application domain. We illustrate and discuss the proposed framework in detail by taking a stretch of road intersections controlled by a traffic light controller (TLC) as a case study. The case study provides a clearer view of the way the proposed framework solves traffic congestion as a domain problem. We identify the traffic features that include the average vehicle count, average vehicle speed (km/h), average density (%), interval (s), and timestamp. The framework uses these features to identify three congestion periods, which are the nonpeak period with a congestion degree of 0.178 and a variance of 0.061, a medium peak period with a congestion degree of 0.588 and a variance of 0.0593, and a peak period with a congestion degree of 0.796 and a variance of 0.0296. The results of the TLC case study show that the framework provides various capabilities and flexibility features of both micro and macro views of the scenarios being observed and clearly presents viable solutions.

As COVID-19 pandemic continued to propagate, millions of lives are currently at risk especially elderly, people with chronic conditions and pregnant women. Iraq is one of the countries affected by the COVID-19 pandemic. Currently, in Iraq, there is a need for a self-assessment tool to be available in hand for people with COVID-19 concerns. Such a tool would guide people, after an automated assessment, to the right decision such as seeking medical advice, self-isolate, or testing for COVID-19. This study proposes an online COVID-19 self-assessment tool supported by the internet of medical things (IoMT) technology as a means to fight this pandemic and mitigate the burden on our nation’s healthcare system. Advances in IoMT technology allow us to connect all medical tools, medical databases, and devices via the internet in one collaborative network, which conveys real-time data integration and analysis. Our IoMT framework-driven COVID-19 self-assessment tool will capture signs and symptoms through multiple probing questions, storing the data to our COVID-19 patient database, then analyze the data to determine whether a person needs to be tested for COVID-19 or other actions may require to be taken. Further to this, collected data can be integrated and analyzed collaboratively for developing a national health policy and help to manage healthcare resources more efficiently. The IoMT framework-driven online COVID-19 self-assessment tool has a big potential to prevent our healthcare system from being overwhelmed using real-time data collection, COVID-19 databases, analysis, and management of people with COVID-19 concerns, plus providing proper guidance and course of action.