• List of Articles


      • Open Access Article

        1 - Performance Analysis of Hybrid SOM and AdaBoost Classifiers for Diagnosis of Hypertensive Retinopathy
        Wiharto Wiharto Esti Suryani Murdoko Susilo
        The diagnosis of hypertensive retinopathy (CAD-RH) can be made by observing the tortuosity of the retinal vessels. Tortuosity is a feature that is able to show the characteristics of normal or abnormal blood vessels. This study aims to analyze the performance of the CAD Full Text
        The diagnosis of hypertensive retinopathy (CAD-RH) can be made by observing the tortuosity of the retinal vessels. Tortuosity is a feature that is able to show the characteristics of normal or abnormal blood vessels. This study aims to analyze the performance of the CAD-RH system based on feature extraction tortuosity of retinal blood vessels. This study uses a segmentation method based on clustering self-organizing maps (SOM) combined with feature extraction, feature selection, and the ensemble Adaptive Boosting (AdaBoost) classification algorithm. Feature extraction was performed using fractal analysis with the box-counting method, lacunarity with the gliding box method, and invariant moment. Feature selection is done by using the information gain method, to rank all the features that are produced, furthermore, it is selected by referring to the gain value. The best system performance is generated in the number of clusters 2 with fractal dimension, lacunarity with box size 22-29, and invariant moment M1 and M3. Performance in these conditions is able to provide 84% sensitivity, 88% specificity, 7.0 likelihood ratio positive (LR+), and 86% area under the curve (AUC). This model is also better than a number of ensemble algorithms, such as bagging and random forest. Referring to these results, it can be concluded that the use of this model can be an alternative to CAD-RH, where the resulting performance is in a good category. Manuscript Document
      • Open Access Article

        2 - Utilizing Gated Recurrent Units to Retain Long Term Dependencies with Recurrent Neural Network in Text Classification
        Nidhi Chandra Laxmi  Ahuja Sunil Kumar Khatri Himanshu Monga
        The classification of text is one of the key areas of research for natural language processing. Most of the organizations get customer reviews and feedbacks for their products for which they want quick reviews to action on them. Manual reviews would take a lot of time a Full Text
        The classification of text is one of the key areas of research for natural language processing. Most of the organizations get customer reviews and feedbacks for their products for which they want quick reviews to action on them. Manual reviews would take a lot of time and effort and may impact their product sales, so to make it quick these organizations have asked their IT to leverage machine learning algorithms to process such text on a real-time basis. Gated recurrent units (GRUs) algorithms which is an extension of the Recurrent Neural Network and referred to as gating mechanism in the network helps provides such mechanism. Recurrent Neural Networks (RNN) has demonstrated to be the main alternative to deal with sequence classification and have demonstrated satisfactory to keep up the information from past outcomes and influence those outcomes for performance adjustment. The GRU model helps in rectifying gradient problems which can help benefit multiple use cases by making this model learn long-term dependencies in text data structures. A few of the use cases that follow are – sentiment analysis for NLP. GRU with RNN is being used as it would need to retain long-term dependencies. This paper presents a text classification technique using a sequential word embedding processed using gated recurrent unit sigmoid function in a Recurrent neural network. This paper focuses on classifying text using the Gated Recurrent Units method that makes use of the framework for embedding fixed size, matrix text. It helps specifically inform the network of long-term dependencies. We leveraged the GRU model on the movie review dataset with a classification accuracy of 87%. Manuscript Document
      • Open Access Article

        3 - A New Game Theory-Based Algorithm for Target Coverage in Directional Sensor Networks
        Elham Golrasan marzieh varposhti
        One of the challenging problems in directional sensor networks is maximizing target coverage while minimizing the amount of energy consumption. Considering the high redundancy in dense directional sensor networks, it is possible to preserve energy and enhance coverage q Full Text
        One of the challenging problems in directional sensor networks is maximizing target coverage while minimizing the amount of energy consumption. Considering the high redundancy in dense directional sensor networks, it is possible to preserve energy and enhance coverage quality by turning off redundant sensors and adjusting the direction of the active sensor nodes. In this paper, we address the problem of maximizing network lifetime with adjustable ranges (MNLAR) and propose a new game theory-based algorithm in which sensor nodes try to adjust their working direction and sensing range in a distributed manner to achieve the desired coverage. For this purpose, we formulate this problem as a multiplayer repeated game in which each sensor as a player tries to maximize its utility function which is designed to capture the tradeoff between target coverage and energy consumption. To achieve an efficient action profile, we present a distributed payoff-based learning algorithm. The performance of the proposed algorithm is evaluated via simulations and compared to some existing methods. The simulation results demonstrate the performance of the proposed algorithm and its superiority over previous approaches in terms of network lifetime. Manuscript Document
      • Open Access Article

        4 - Optimal Clustering-based Routing Protocol Using Self-Adaptive Multi-Objective TLBO For Wireless Sensor Network
        Ali Sedighimanesh Hessam  Zandhessami Mahmood  Alborzi Mohammadsadegh  Khayyatian
        Wireless sensor networks consist of many fixed or mobile, non-rechargeable, low-cost, and low-consumption nodes. Energy consumption is one of the most important challenges due to the non-rechargeability or high cost of sensor nodes. Hence, it is of great importance to a Full Text
        Wireless sensor networks consist of many fixed or mobile, non-rechargeable, low-cost, and low-consumption nodes. Energy consumption is one of the most important challenges due to the non-rechargeability or high cost of sensor nodes. Hence, it is of great importance to apply some methods to reduce the energy consumption of sensors. The use of clustering-based routing is a method that reduces the energy consumption of sensors. In the present article, the Self-Adaptive Multi-objective TLBO (SAMTLBO) algorithm is applied to select the optimal cluster headers. After this process, the sensors become the closest components to cluster headers and send the data to their cluster headers. Cluster headers receive, aggregate, and send data to the sink in multiple steps using the TLBO-TS hybrid algorithm that reduces the energy consumption of the cluster heads when sending data to the sink and, ultimately, an increase in the wireless sensor network’s lifetime. The simulation results indicate that our proposed protocol (OCRP) show better performance by 35%, 17%, and 12% compared to ALSPR, CRPD, and COARP algorithms, respectively. Conclusion: Due to the limited energy of sensors, the use of meta-heuristic methods in clustering and routing improves network performance and increases the wireless sensor network's lifetime. Manuscript Document
      • Open Access Article

        5 - Improvement of Firefly Algorithm using Particle Swarm Optimization and Gravitational Search Algorithm
        Mahdi Tourani
        Evolutionary algorithms are among the most powerful algorithms for optimization, Firefly algorithm (FA) is one of them that inspired by nature. It is an easily implementable, robust, simple and flexible technique. On the other hand, Integration of this algorithm with ot Full Text
        Evolutionary algorithms are among the most powerful algorithms for optimization, Firefly algorithm (FA) is one of them that inspired by nature. It is an easily implementable, robust, simple and flexible technique. On the other hand, Integration of this algorithm with other algorithms, can be improved the performance of FA. Particle Swarm Optimization (PSO) and Gravitational Search Algorithm (GSA) are suitable and effective for integration with FA. Some method and operation in GSA and PSO can help to FA for fast and smart searching. In one version of the Gravitational Search Algorithm (GSA), selecting the K-best particles with bigger mass, and examining its effect on other masses has a great help for achieving the faster and more accurate in optimal answer. As well as, in Particle Swarm Optimization (PSO), the candidate answers for solving optimization problem, are guided by local best position and global best position to achieving optimal answer. These operators and their combination with the firefly algorithm (FA) can improve the performance of the search algorithm. This paper intends to provide models for improvement firefly algorithm using GSA and PSO operation. For this purpose, 5 scenarios are defined and then, their models are simulated using MATLAB software. Finally, by reviewing the results, It is shown that the performance of introduced models are better than the standard firefly algorithm. Manuscript Document
      • Open Access Article

        6 - The Development of a Hybrid Error Feedback Model for Sales Forecasting
        Mehdi Farrokhbakht Foumani Sajad Moazami Goudarzi
        Sales forecasting is one of the significant issues in the industrial and service sector which can lead to facilitated management decisions and reduce the lost values in case of being dealt with properly. Also sales forecasting is one of the complicated problems in analy Full Text
        Sales forecasting is one of the significant issues in the industrial and service sector which can lead to facilitated management decisions and reduce the lost values in case of being dealt with properly. Also sales forecasting is one of the complicated problems in analyzing time series and data mining due to the number of intervening parameters. Various models were presented on this issue and each one found acceptable results. However, developing the methods in this study is still considered by researchers. In this regard, the present study provided a hybrid model with error feedback for sales forecasting. In this study, forecasting was conducted using a supervised learning method. Then, the remaining values (model error) were specified and the error values were forecasted using another learning method. Finally, two trained models were combined together and consecutively used for sales forecasting. In other words, first the forecasting was conducted and then the error rate was determined by the second model. The total forecasting and model error indicated the final forecasting. The computational results obtained from numerical experiments indicated the superiority of the proposed hybrid method performance over the common models in the available literature and reduced the indicators related to forecasting error. Manuscript Document
      • Open Access Article

        7 - A New Power Control Algorithm in MMSE Receiver for D2D Underlying Massive MIMO System
        Faezeh  Heydari Saeed Ghazi-Maghrebi Ali Shahzadi Mohammad Jalal  Rastegar Fatemi
        Device to device (D2D) underlying massive MIMO cellular network is a robust deployment which enables network to enhance its throughput. It also improves services and applications for the proximity-based wireless communication. However, an important challenge in such dep Full Text
        Device to device (D2D) underlying massive MIMO cellular network is a robust deployment which enables network to enhance its throughput. It also improves services and applications for the proximity-based wireless communication. However, an important challenge in such deployment is mutual interference. Interference, in the uplink spectrum, reusing the same resource with cellular user, is caused by D2D users. In this paper, we study a distributed power control (DPC) algorithm, using minimum mean square error (MMSE) filter in receiver, to mitigate the produced interference in this deployment scenario. For the DPC algorithm, employing the coverage probability of D2D links, an optimal power control approach is proposed, which maximizes the spectral efficiency of D2D links. Using this modeling approach, it is possible to derive closed-form analytical expressions for the coverage probabilities and ergodic spectral efficiency, which give insight into how the various network parameters interact and affect the link.‎ Also, the DPC algorithm is modeled by stochastic geometry and receiver filter is designed by estimation theory that a new structure in this robust network is an approach to improve spectral efficiency. Simulation results illustrate enhancing coverage probability performance of D2D links in term of the target (signal to interference ratio) SIR with respect to different receiver filter and other parameters which are existing in D2D links. Manuscript Document