Welcome to Journal of Theoretical and Applied Information Technology

Author:

Source:

Abstract

This paper presents an algorithm for solving optimal power flow problem through the application of Differential Evolution (DE). The objective is to minimize the total fuel cost of thermal generating units having quadratic cost characteristics subjected to limits on generator real and reactive power outputs, bus voltages, transformer taps and power flow of transmission lines. The proposed method has been tested under simulated conditions on IEEE 30-bus system .The optimal power flow results obtained using DE are compared with other evolutionary methods. It is shown that DE total generation fuel cost is less expensive than those of evolutionary programming, tabu search, hybrid tabu search, and simulated annealing.

Author:

Source:

Abstract

Selection operator is one of the important aspects in the GA process. There are several ways for selection. Some of them are Tournament selection, Ranking selection, and Proportional selection. There are many ways for proportional selection. The most popular are Roulette Wheel Selection (RWS), Stochastic Reminder Roulette Wheel Selection (SRRWS), and Stochastic Universal Sampling (SUS). In this paper a modified RWS method is proposed to increase the gain of resources, reliability and diversity; and decrease the uncertainty in selection process.

Author:

Source:

Abstract

 Mesothelioma was tend to be aggressive tumors that arise from the serosal surface cells lining the pleura, peritoneum and pericardium. The majority (80%) of these tumors are associated with exposure to asbestos fibers, either in the environment or work place. Mesothelin gene, was a differentiation antigen, glycosylphosphatidylinositol-linked cell-surface glycoprotein, that was present on the surface of normal mesothelium and was overexpressed in many patients with epithelial ovarian cancer and malignant mesothelioma. Our research was focusing on MSLN gene hence it was a promising candidate for tumor specific therapy and it was used as a biomarker also. The goal of present study was to clarify in which condition it gets overexpressed. Mesothelin family of proteins found that patients with malignant mesothelioma had higher levels of serum mesothelin related peptide (SMR) than the healthy controls. It provided an increased understanding of mesothelin gene, and further study of this gene may ultimately provide new opportunities for the development of therapeutics. The over expression of the gene was due to the proteolysis and this leads to the release of the soluble peptide in to the serum. An extensive analysis of the Mesothelin gene including modeling of its structure may prove useful in designing a drug for Mesothelioma treatment. Further extensive research work on this protein will leads to a new milestone in mesothelioma research.

Author:

Source:

Abstract

The main motivation of the research paper is to analyze different performance parameters of three well known Ad-hoc network routing protocols (AODV, DSDV, DSR) with varying node density and velocity. As in real world the movements of nodes are almost always random, therefore we selected the random way point mobility model. Ad hoc network is an active research area now-a-days. Plenty of literature is available in this field. The researcher has developed many Routing Algorithms for effective routing in MANETs. Similarly researchers also have analyzed these protocols in different scenarios. The Research area which needs more work & is still demanding the researcher attention is to work out efficiency of such networks in reliable ( suitable for delay tolerant and error sensitive data) & unreliable (for delay sensitive and error tolerant information such voice and video streaming) transport layer protocols. In this study we evaluate the behavior of different Ad –hoc network routing protocols (AODV, DSDV, DSR) under reliable TCP and unreliable UDP transport layer protocols with variable node density and velocity. From simulation results we observed that each protocol perform in a different way with different node density and velocity.

Author:

Source:

Abstract

In this paper we describe an idea of selecting best paths from multi path [1] routing from source to destination node in Mobile Ad-hoc Networks ( MANETs ) using fuzzy cost. This is based on multi criterion objective fuzzy measure. We have made changes to Improved Rank-based Multipath Routing (ImRMR) in Mobile Ad-hoc Networks [10]. In ImRMR, Generally paths are categorized using rank fitness. But in our proposed method paths will be categorized using a new idea of fuzzy cost fitness, which tends to minimize the disadvantages of both unipath and multipath routing methods. In our method, we transform the attributes values (resources available) of the path (i.e. fuzzy measures or resources available) converted in to fuzzy costs. The path with the cost more than the defined threshold value will be considered to be the effective one and will be used for sending data from source to destination.

Author:

Source:

Abstract

This paper is concerned with the variety of ABR switch mechanisms available for implementation with the current end system definition. The various switch mechanisms can be broadly classified in two categories depending on the type of feedback information provided to the end system. The feedback mechanism is either binary involving setting the EFCI bit in the data cell header or explicit rate in which case the switch has to calculate a target rate and send it back to the source through an RM cell. Also within each category, different subgroups are formed based on the type of queuing involved (for example per port queuing, per VC accounting, per VC queuing) and the congestion declaration criteria adopted (for example queue thresholding, queue derivative, load monitoring). Our goal is to provide an overview of the various switch mechanisms available and discuss their performance characteristics accordingly. The performance metrics used include queue length, source flow-controlled cell rate dynamics, fairness of bandwidth allocation in the steady state and ramp-up time in the network transient state. Simulations of the different switch algorithms’ dynamics for network configurations and scenarios of interest are presented. Each link is assigned a weight that reflects its current utilization. Using these weights, the VPs on highly utilized links are rerouted to less congested physical paths. The algorithm makes use of the equivalent bandwidth concept, which provides an efficient method to estimate capacity requirements of connection requests such that QoS requirements are met. The quality of the solutions achieved by the proposed method is compared to several competitors under varying network topologies and traffic conditions. The observations on the algorithm performance show that the developed method is able to facilitate an efficient use of network resources through the introduction of VPs

Author:

Source:

Abstract

This survey covers backward error recovery techniques for distributed systems specially the distributed mobile systems. Backward error recovery protocols have been classified into user triggered checkpointing and transparent checkpointing. Transparent checkpointing can be uncoordinated checkpointing, Coordinated checkpointing, Quasi Synchronous or communication-induced checkpointing and Message Logging based Checkpointing. Through out this survey we, highlight the research issues that are at the core of backward error recovery and present the solutions that currently address them.

Author:

Source:

Abstract

Now-a-days Internet has become the common media of communication. Many group communication application such as pay-per-view, stock quote distribution, voice- and video-conferencing, white-boards, distributed simulations, and replicated servers of all types, etc can easily be conducted on the Internet. For conducting such applications, group key is often needed, which can be established by group key establishment protocol. Although many group key establishment protocols have been proposed in the literature, yet nothing has been done to establish their suitability for aforementioned applications. In this paper, we present the succinct description of different decentralized group key establishment protocols and analyze them against parameters such as key independence, one-affects-all, local rekey, data transformation.

Author:

Source:

Abstract

Electrocardiography deals with the electrical activity of the heart. The condition of cardiac health is given by ECG and heart rate. A study of the nonlinear dynamics of electrocardiogram (ECG) signals for arrhythmia characterization is considered. The statistical analysis of the calculated features indicate that they differ significantly between normal heart rhythm and the different arrhythmia types and hence, can be rather useful in ECG arrhythmia detection. The discrimination of ECG signals using non-linear dynamic parameters is of crucial importance in the cardiac disease therapy and chaos control for arrhythmia defibrillation in the cardiac system. The four non-linear parameters considered for cardiac arrhythmia classification of the ECG signals are Spectral entropy, Poincaré plot geometry, Largest Lyapunov exponent and Detrended fluctuation analysis which are extracted from heart rate signals. Linguistic variables (fuzzy sets) are used to describe ECG features, and fuzzy conditional statements to represent the reasoning knowledge and rules. Good results have been achieved with this method and an overall accuracy of 93.13%.

Author:

Source:

Abstract

Memetic algorithm(MA) is a population based heuristic search approach for optimization problems similar to genetic algorithm. GAs, however, rely on the concept of biological evolution, but MAs, in contrast, and mimic cultural evolution. The cryptanalysis of simplified data encryption standard can be formulated as NP-Hard combinatorial problem. In this paper, a comparison between memetic algorithm and tabu search were made in order to investigate the performance for the cryptanalysis on simplified data encryption standard problems (SDES). The methods were tested and various experimental results indicates that the proposed memetic algorithm is able to produce high quality solutions quickly and it also demonstrate that memetic algorithm performs better than the genetic algorithm for such type of NP-Hard combinatorial problem