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 (...) for the 0 - 1 multidimensional knapsack problem. The utilization of the binary pigeon-inspired optimization 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 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. (shrink)

This paper implements the continuous Hindi Automatic Speech Recognition system using the proposed integrated features vector with Recurrent Neural Network based Language Modeling. The proposed system also implements the speaker adaptation using Maximum-Likelihood Linear Regression and Constrained Maximum likelihood Linear Regression. This system is discriminatively trained by Maximum Mutual Information and Minimum Phone Error techniques with 256 Gaussian mixture per Hidden Markov Model 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. (shrink)

This paper presents a comprehensive Tag set as a fundamental component for developing an automated Word Class/part-of-speech 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 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. (shrink)

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%. (shrink)

This paper proposes a Multi-Agent based Particle Swarm Optimization Framework for the Traveling salesman problem. 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. (shrink)

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: data preprocessing, improved equation models, and 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 and FGM. Then, the effective parameters are adjusted through particle swarm optimization to formulate two adjusted models, namely IGM and IFGM. 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 of the proposed models for predicting the number of users of the public road transportation system. (shrink)

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. (shrink)

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 for sound direction recognition. Finally, we also conducted experiments that used probability distributions to identify more directions. (shrink)

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. (shrink)

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 and Bi-directional long short term memory ) 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. (shrink)

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 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. (shrink)

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 method, positioned the location using Back Propagation Neural Networks 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. (shrink)

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, which can approximately simulate the information processing pathways 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 simultaneously. The experiment results also show the advantages of the enhanced WWN-7 model for face recognition in comparison with several existing methods. (shrink)

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. (shrink)

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 blended with Support Vector Machine 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, Fuzzy Downward Consistency, and Fuzzy Global Consistency. 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. (shrink)

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 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. (shrink)

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. (shrink)

Sentiment analysis aims to predict sentiment polarities of a given piece of text. It lies at the intersection of many fields such as Natural Language Processing, 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 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. (shrink)

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. (shrink)

The luminous value is high for many natural scenes, which causes loss of information and occurs in dark images. The High Dynamic Range 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 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. (shrink)

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. 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. 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. (shrink)

Harmony Search Algorithm 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 and 3rd. Furthermore, the two proposed algorithms are compared against four versions of particle swarm optimization. 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. 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. (shrink)

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 and Salinas 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. (shrink)

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 model is constructed, and Impulse Response Function 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, 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. (shrink)

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. (shrink)

In the data collection phase, the digital images are captured using sensors that often contaminated by noise. 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 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. For performance evaluation, Structural Similarity, Mean Structural Similarity, Mean Square Error, Normalized Mean Square Error, Universal Image Quality Index, Peak Signal to Noise Ratio, and Visual Information Fidelity 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. (shrink)

In this paper a new technique of dual image watermarking is proposed for protection of ownership rights which utilizes salient properties of homomorphic transform, discrete wavelet transform, singular value decomposition and Arnold transform. 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 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 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. (shrink)

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 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, Cuckoo Search, Bee Colony Algorithm, and Firefly Algorithm. (shrink)