Himansu Sekhar Behera

A New Proposed Dynamic Quantum with Re-Adjusted Round Robin Scheduling Algorithm and Its Performance Analysis

Scheduling is the central concept used frequently in Operating System. It helps in choosing the processes for execution. Round Robin (RR) is one of the most widely used CPU scheduling algorithm. But, its performance degrades with respect to context switching, which is an overhead and it occurs during each scheduling. Overall performance of the system depends on choice of an optimal time quantum, so that context switching can be reduced. In this paper, we have proposed a new variant of RR scheduling algorithm, known as Dynamic Quantum with Readjusted Round Robin (DQRRR) algorithm. We have experimentally shown that performance of DQRRR is better than RR by reducing number of context switching, average waiting time and average turn around time.

Power quality time series data mining using S-transform and fuzzy expert system

This paper presents a new approach for power quality time series data mining using S-transform based fuzzy expert system (FES). Initially the power signal time series disturbance data are pre-processed through an advanced signal processing tool such as S-transform and various statistical features are extracted, which are used as inputs to the fuzzy expert system for power quality event detection. The proposed expert system uses a data mining approach for assigning a certainty factor for each classification rule, thereby providing robustness to the rule in the presence of noise. Further to provide a very high degree of accuracy in pattern classification, both the Gaussian and trapezoidal membership functions of the concerned fuzzy sets are optimized using a fuzzy logic based adaptive particle swarm optimization (PSO) technique. The proposed hybrid PSO-fuzzy expert system (PSOFES) provides accurate classification rates even under noisy conditions compared to the existing techniques, which show the efficacy and robustness of the proposed algorithm for power quality time series data mining.

Fuzzy C-Means (FCM) Clustering Algorithm: A Decade Review from 2000 to 2014

The Fuzzy c-means is one of the most popular ongoing area of research among all types of researchers including Computer science, Mathematics and other areas of engineering, as well as all areas of optimization practices. Several problems from various areas have been effectively solved by using FCM and its different variants. But, for efficient use of the algorithm in various diversified applications, some modifications or hybridization with other algorithms are needed. A comprehensive survey on FCM and its applications in more than one decade has been carried out in this paper to show the efficiency and applicability in a mixture of domains. Also, another intention of this survey is to encourage new researchers to make use of this simple algorithm (which is popularly called soft classification model) in problem solving.

A hybridization of an improved particle swarm optimization and gravitational search algorithm for multi-robot path planning

Abstract This paper proposed a new methodology to determine the optimal trajectory of the path for multi-robot in a clutter environment using hybridization of improved particle swarm optimization (IPSO) with an improved gravitational search algorithm (IGSA). The proposed approach embedded the social essence of IPSO with motion mechanism of IGSA. The proposed hybridization IPSO–IGSA maintain the efficient balance between exploration and exploitation because of adopting co-evolutionary techniques to update the IGSA acceleration and particle positions with IPSO velocity simultaneously. The objective of the algorithm is to minimize the maximum path length that corresponds to minimize the arrival time of all robots to their respective destination in the environment. The robot on the team make independent decisions, coordinate, and cooperate with each other to determine the next positions from their current position in the world map using proposed hybrid IPSO–IGSA. Finally the analytical and experimental results of the multi-robot path planning were compared to those obtained by IPSO–IGSA, IPSO, IGSA in a similar environment. The Simulation and the Khepera environment result show outperforms of IPSO–IGSA as compared with IPSO and IGSA with respect to optimize the path length from predefine initial position to designation position ,energy optimization in the terms of number of turn and arrival time.

Priority Based Dynamic Round Robin (PBDRR) Algorithm with Intelligent Time Slice for Soft Real Time Systems

In this paper, a new variant of Round Robin (RR) algorithm is proposed which is suitable for soft real time systems. RR algorithm performs optimally in timeshared systems, but it is not suitable for soft real time systems. Because it gives more number of context switches, larger waiting time and larger response time. We have proposed a novel algorithm, known as Priority Based Dynamic Round Robin Algorithm(PBDRR),which calculates intelligent time slice for individual processes and changes after every round of execution. The proposed scheduling algorithm is developed by taking dynamic time quantum concept into account. Our experimental results show that our proposed algorithm performs better than algorithm in [8] in terms of reducing the number of context switches, average waiting time and average turnaround time.

Classification of power quality data using decision tree and chemotactic differential evolution based fuzzy clustering

Abstract This paper presents a new approach for processing various non-stationary power quality waveforms through a Fast S-Transform with modified Gaussian window to generate time–frequency contours for extracting relevant feature vectors for automatic disturbance pattern classification. The extracted features are then clustered using Bacterial Foraging Optimization Algorithm (BFOA) based Fuzzy decision tree to give improved classification accuracy in comparison to the Fuzzy decision tree alone. To circumvent the problem of premature convergence of BFOA and to improve classification accuracy further, a hybridization of BFOA (Bacterial Foraging Optimization Algorithm) with another very popular optimization technique of current interest called Differential Evolution (DE) is presented in this paper. For robustness the mutation loop of the DE algorithm has been made variable in a stochastic fashion. This hybrid algorithm (Chemotactic Differential Evolution Algorithm (CDEA)) is shown to overcome the problems of slow and premature convergence of BFOA and provide significant improvement in power signal pattern classification.

A hybrid improved PSO-DV algorithm for multi-robot path planning in a clutter environment

This paper proposed a novel approach to determine the optimal trajectory of the path for multi-robots in a clutter environment using hybridization of improved particle swarm optimization (IPSO) with differentially perturbed velocity (DV) algorithm. The objective of the algorithm is to minimize the maximum path length that corresponds to minimize the arrival time of all the robots to their respective destination in the environment. The robots on the team make independent decisions, coordinate, and cooperate with each other to determine the next positions from their current position in the world map using proposed hybrid IPSO-DV. The proposed scheme adjusts the velocity of the robots by incorporating a vector differential operator inherited from Differential Evolution (DE) in IPSO. Finally the analytical and experimental results of the multi-robot path planning have been compared to those obtained by IPSO-DV, IPSO, DE in a similar environment. Simulation and khepera environment results are compared with those obtained by IPSO-DV to ensure the integrity of the algorithm. The results obtained from Simulation as well as Khepera environment reveal that, the proposed IPSO-DV performs better than IPSO and DE with respect to optimal trajectory path length and arrival time.

A New Dynamic Round Robin and SRTN Algorithm with Variable Original Time Slice and Intelligent Time Slice for Soft Real Time Systems

The main objective of the paper is to improve the Round Robin (RR) algorithm using dynamic ITS by coalescing it with Shortest Remaining Time Next (SRTN) algorithm thus reducing the average waiting time, average turnaround time and the number of context switches. The original time slice has been calculated for each process based on its burst time.This is mostly suited for soft real time systems where meeting of deadlines is desirable to increase its performance. The advantage is that processes that are closer to their remaining completion time will get more chances to execute and leave the ready queue. This will reduce the number of processes in the ready queue by knocking out short jobs relatively faster in a hope to reduce the average waiting time, turn around time and number of context switches. This paper improves the algorithm [8] and the experimental analysis shows that the proposed algorithm performs better than algorithm [6] and [8] when the processes are having an increasing order, decreasing order and random order of burst time.

Index prediction with neuro-genetic hybrid network: A comparative analysis of performance

Forecasting stock exchange rates is an important financial problem that is receiving increasing attention. During the last few years, a number of neural network models and hybrid models have been proposed for obtaining accurate prediction results, in an attempt to outperform the traditional linear and nonlinear approaches. This paper evaluates the effectiveness of neural network models which are known to be dynamic and effective in stock-market predictions. The models analyzed are artificial neural network (ANN) trained with gradient descent (GD) technique, ANN trained with genetic algorithm (GA) and functional link neural network (FLANN) trained with GA. The stock price index of Bombay stock exchange data has been considered to train these models and to compare their relative performance. Experimental results and analysis has been presented to show the performance of different models.

Time sequence data mining using time-frequency analysis and soft computing techniques

This paper presents a new approach for time series data mining and knowledge discovery. The relevant features of non-stationary time series data from power network disturbances are extracted using a multiresolution S-transform which can be treated either as a phase corrected wavelet transform or a variable window short-time Fourier transform. After extracting the relevant features from the time series data, an integrated LVQ neural network and various feed-forward neural network architectures are used for pattern recognition of disturbance waveform data. The fuzzy MLP outperforms all the other different connectionist models and is used in the final stage for encoding knowledge in the connection weights that are used to generate rules for fuzzy inferencing of the disturbance patterns. Overall pattern classification accuracy of 99% is achieved for power signal time series data. The knowledge discovery from the data has then been presented for selected patterns using the new quantification procedures. The approach presented in this paper is a general one and can be applied to any time series data sequence for mining for similarities in the data.