Studies on function projective synchronization in chaotic and hyperchaotic systems

FPS is a more general form of synchronization. Hyperchaotic systems possessing more than one positive Lypaunov exponent exhibit highly complex behaviour and are more suitable for some applications like secure communications. In this thesis we report studies of FPS and MFPS of a few chaotic and hyperchaotic systems. When all the parameters of the system are known we show that active nonlinear control method can be efectively used to obtain FPS. Adaptive nonlinear control and OPCL control method are employed for obtaining FPS and MFPS when some or all parameters of the system are uncertain. A secure communication scheme based on MFPS is also proposed in theory. All our theoretical calculations are verified by numerical simulations.

Synchronization and control of chaos in coupled chaotic multimode Nd:YAG lasers

In this Letter we numerically investigate the dynamics of a system of two coupled chaotic multimode Nd:YAG lasers with two mode and three mode outputs. Unidirectional and bidirectional coupling schemes are adopted; intensity time series plots, phase space plots and synchronization plots are used for studying the dynamics. Quality of synchronization is measured using correlation index plots. It is found that for laser with two mode output bidirectional direct coupling scheme is found to be effective in achieving complete synchronization, control of chaos and amplification in output intensity. For laser with three mode output, bidirectional difference coupling scheme gives much better chaotic synchronization as compared to unidirectional difference coupling but at the cost of higher coupling strength. We also conclude that the coupling scheme and system properties play an important role in determining the type of synchronization exhibited by the system.

Studies on Chaos and Synchronization in ac-driven Josephson junctions

The main goal of this thesis is to study the dynamics of Josephson junction system in the presence of an external rf-biasing.A system of two chaotically synchronized Josephson junction is studied.The change in the dynamics of the system in the presence of at phase difference between the applied fields is considered. Control of chaos is very important from an application point of view. The role Of phase difference in controlling chaos is discussed.An array of three Josephson junctions iS studied for the effect of phase difference on chaos and synchronization and the argument is extended for a system of N Josephson junctions. In the presence of a phase difference between the external fields, the system exhibits periodic behavior with a definite phase relationship between all the three junctions.Itdeals with an array of three Josephson junctions with a time delay in the coupling term. It is observed that only the outer systems synchronize while the middle system remain uncorrelated with t-he other two. The effect of phase difference between the applied fields and time-delay on system dynamics and synchronization is also studied. We study the influence of an applied ac biasing on a serniannular Josephson junction. It is found the magnetic field along with the biasing induces creation and annihilation of fluxons in the junction. The I-V characteristics of the junction is studied by considering the surface loss term also in the model equation. The system is found to exhibit chaotic behavior in the presence of ac biasing.

Phase effects on synchronization by dynamical relaying in delay-coupled systems

Synchronization in an array of mutually coupled systems with a finite time delay in coupling is studied using the Josephson junction as a model system. The sum of the transverse Lyapunov exponents is evaluated as a function of the parameters by linearizing the equation about the synchronization manifold. The dependence of synchronization on damping parameter, coupling constant, and time delay is studied numerically. The change in the dynamics of the system due to time delay and phase difference between the applied fields is studied. The case where a small frequency detuning between the applied fields is also discussed.

Phase synchronization in an array of driven Josephson junctions

We consider an array of N Josephson junctions connected in parallel and explore the condition for chaotic synchronization. It is found that the outer junctions can be synchronized while they remain uncorrelated to the inner ones when an external biasing is applied. The stability of the solution is found out for the outer junctions in the synchronization manifold. Symmetry considerations lead to a situation wherein the inner junctions can synchronize for certain values of the parameter. In the presence of a phase difference between the applied fields, all the junctions exhibit phase synchronization. It is also found that chaotic motion changes to periodic in the presence of phase differences.

Studies on the effect of randoniness on the synchronization of coupled systems and on the dynamics of intermittently driven systems

It has been shown recently that systems driven with random pulses show the signature of chaos ,even without non linear dynamics.This shows that the relation between randomness and chaos is much closer than it was understood earlier .The effect of random perturbations on synchronization can be also different. In some cases identical random perturbations acting on two different chaotic systems induce synchronizations. However most commonly ,the effect of random fluctuations on the synchronizations of chaotic system is to destroy synchronization. This thesis deals with the effect of random fluctuations with its associated characteristic timescales on chaos and synchronization. The author tries to unearth yet another manifestation of randomness on chaos and sychroniztion. This thesis is organized into six chapters.

Multi-objective assembly job shop scheduling using genetic algorithm and tabu search

Assembly job shop scheduling problem (AJSP) is one of the most complicated combinatorial optimization problem that involves simultaneously scheduling the processing and assembly operations of complex structured products. The problem becomes even more complicated if a combination of two or more optimization criteria is considered. This thesis addresses an assembly job shop scheduling problem with multiple objectives. The objectives considered are to simultaneously minimizing makespan and total tardiness. In this thesis, two approaches viz., weighted approach and Pareto approach are used for solving the problem. However, it is quite difficult to achieve an optimal solution to this problem with traditional optimization approaches owing to the high computational complexity. Two metaheuristic techniques namely, genetic algorithm and tabu search are investigated in this thesis for solving the multiobjective assembly job shop scheduling problems. Three algorithms based on the two metaheuristic techniques for weighted approach and Pareto approach are proposed for the multi-objective assembly job shop scheduling problem (MOAJSP). A new pairing mechanism is developed for crossover operation in genetic algorithm which leads to improved solutions and faster convergence. The performances of the proposed algorithms are evaluated through a set of test problems and the results are reported. The results reveal that the proposed algorithms based on weighted approach are feasible and effective for solving MOAJSP instances according to the weight assigned to each objective criterion and the proposed algorithms based on Pareto approach are capable of producing a number of good Pareto optimal scheduling plans for MOAJSP instances.

Fixed Point Decimal Multiplication Using RPS Algorithm

Decimal multiplication is an integral part of financial, commercial, and internet-based computations. A novel design for single digit decimal multiplication that reduces the critical path delay and area for an iterative multiplier is proposed in this research. The partial products are generated using single digit multipliers, and are accumulated based on a novel RPS algorithm. This design uses n single digit multipliers for an n × n multiplication. The latency for the multiplication of two n-digit Binary Coded Decimal (BCD) operands is (n + 1) cycles and a new multiplication can begin every n cycle. The accumulation of final partial products and the first iteration of partial product generation for next set of inputs are done simultaneously. This iterative decimal multiplier offers low latency and high throughput, and can be extended for decimal floating-point multiplication.

A Novel Decision Tree Algorithm for Numeric Datasets - C 4.5*Stat

Decision trees are very powerful tools for classification in data mining tasks that involves different types of attributes. When coming to handling numeric data sets, usually they are converted first to categorical types and then classified using information gain concepts. Information gain is a very popular and useful concept which tells you, whether any benefit occurs after splitting with a given attribute as far as information content is concerned. But this process is computationally intensive for large data sets. Also popular decision tree algorithms like ID3 cannot handle numeric data sets. This paper proposes statistical variance as an alternative to information gain as well as statistical mean to split attributes in completely numerical data sets. The new algorithm has been proved to be competent with respect to its information gain counterpart C4.5 and competent with many existing decision tree algorithms against the standard UCI benchmarking datasets using the ANOVA test in statistics. The specific advantages of this proposed new algorithm are that it avoids the computational overhead of information gain computation for large data sets with many attributes, as well as it avoids the conversion to categorical data from huge numeric data sets which also is a time consuming task. So as a summary, huge numeric datasets can be directly submitted to this algorithm without any attribute mappings or information gain computations. It also blends the two closely related fields statistics and data mining

Parallel Genetic Algorithm for Document Image Compression Optimization

This work proposes a parallel genetic algorithm for compressing scanned document images. A fitness function is designed with Hausdorff distance which determines the terminating condition. The algorithm helps to locate the text lines. A greater compression ratio has achieved with lesser distortion

A Reinforcement Learning Algorithm to Economic Dispatch Considering Transmission Losses

Reinforcement Learning (RL) refers to a class of learning algorithms in which learning system learns which action to take in different situations by using a scalar evaluation received from the environment on performing an action. RL has been successfully applied to many multi stage decision making problem (MDP) where in each stage the learning systems decides which action has to be taken. Economic Dispatch (ED) problem is an important scheduling problem in power systems, which decides the amount of generation to be allocated to each generating unit so that the total cost of generation is minimized without violating system constraints. In this paper we formulate economic dispatch problem as a multi stage decision making problem. In this paper, we also develop RL based algorithm to solve the ED problem. The performance of our algorithm is compared with other recent methods. The main advantage of our method is it can learn the schedule for all possible demands simultaneously.

Short-Term Load Forecast Of A Low Loadfactor Power System For Optimization Of Merit Order Dispatch Using Adaptive Learning Algorithm

Short term load forecasting is one of the key inputs to optimize the management of power system. Almost 60-65% of revenue expenditure of a distribution company is against power purchase. Cost of power depends on source of power. Hence any optimization strategy involves optimization in scheduling power from various sources. As the scheduling involves many technical and commercial considerations and constraints, the efficiency in scheduling depends on the accuracy of load forecast. Load forecasting is a topic much visited in research world and a number of papers using different techniques are already presented. The accuracy of forecast for the purpose of merit order dispatch decisions depends on the extent of the permissible variation in generation limits. For a system with low load factor, the peak and the off peak trough are prominent and the forecast should be able to identify these points to more accuracy rather than minimizing the error in the energy content. In this paper an attempt is made to apply Artificial Neural Network (ANN) with supervised learning based approach to make short term load forecasting for a power system with comparatively low load factor. Such power systems are usual in tropical areas with concentrated rainy season for a considerable period of the year

ECG Noise Removal using GA tuned Sign-Data Least Mean Square Algorithm

Adaptive filter is a primary method to filter Electrocardiogram (ECG), because it does not need the signal statistical characteristics. In this paper, an adaptive filtering technique for denoising the ECG based on Genetic Algorithm (GA) tuned Sign-Data Least Mean Square (SD-LMS) algorithm is proposed. This technique minimizes the mean-squared error between the primary input, which is a noisy ECG, and a reference input which can be either noise that is correlated in some way with the noise in the primary input or a signal that is correlated only with ECG in the primary input. Noise is used as the reference signal in this work. The algorithm was applied to the records from the MIT -BIH Arrhythmia database for removing the baseline wander and 60Hz power line interference. The proposed algorithm gave an average signal to noise ratio improvement of 10.75 dB for baseline wander and 24.26 dB for power line interference which is better than the previous reported works

A Multi-Objective Antenna Placement Genetic Algorithm for Matched Array Synthesis on Complex Platforms

A Multi-Objective Antenna Placement Genetic Algorithm (MO-APGA) has been proposed for the synthesis of matched antenna arrays on complex platforms. The total number of antennas required, their position on the platform, location of loads, loading circuit parameters, decoupling and matching network topology, matching network parameters and feed network parameters are optimized simultaneously. The optimization goal was to provide a given minimum gain, specific gain discrimination between the main and back lobes and broadband performance. This algorithm is developed based on the non-dominated sorting genetic algorithm (NSGA-II) and Minimum Spanning Tree (MST) technique for producing diverse solutions when the number of objectives is increased beyond two. The proposed method is validated through the design of a wideband airborne SAR

Genetic algorithm based indicator sequence method for exon prediction

Considerable research effort has been devoted in predicting the exon regions of genes. The binary indicator (BI), Electron ion interaction pseudo potential (EIIP), Filter method are some of the methods. All these methods make use of the period three behavior of the exon region. Even though the method suggested in this paper is similar to above mentioned methods , it introduces a set of sequences for mapping the nucleotides selected by applying genetic algorithm and found to be more promising