Results for Algorithm  
Title: Optimum Design of Disc Brake Using NSGAII Algorithm
Abstract:

This work presents an application of improved Elitist Non-dominated Sorting Genetic Algorithm version II (NSGAII), to multi-objective disc brake optimization problem. The disc brake optimization problem is considered as a two-objective problem. The first objective is the minimization of the mass of the brake and the second objective is the minimization of the stopping time. The disc brake optimization model has four design variables and five inequality constraints. To improve the performance of NSGA-II, two modifications are proposed. One modification is incorporation of Virtual Mapping Procedure (VMP), and the other is introduction of controlled elitism in NSGA-II. The main objective of this project is to apply NSGA-II Algorithm for optimizing the design of Disc Brake for minimization of brake mass and stopping time and to compare the results obtained by NSGA-II Algorithm with that of the results already published for Genetic Algorithm.


Sources: Omics Online
Keywords: Combinatorial optimization,Disc brake, Multi-objective,Non-dominated Sorting Genetic Algorithm (NSGA-II),
Title: FPGA Implementation of Low Power Booth Multiplier Using Radix-4 Algorithm
Abstract:

As the scale of integration keeps growing, more and more sophisticated signal processing systems are being implemented on a VLSI chip. These signal processing applications not only demand great computation capacity but also consume considerable amounts of energy. While performance and area remain to be two major design goals, power consumption has become a critical concern in today’s VLSI system design. Multiplication is a fundamental operation in most arithmetic computing systems. Multipliers have large area, long latency and consume considerable power. Previous work on low-power multipliers focuses on low-level optimizations and has not considered well the arithmetic computation features and application-specific data characteristics. Binary multiplier is an integral part of the arithmetic logic unit (ALU) subsystem found in many processors. Booth's algorithm and others like Wallace-Tree suggest techniques for multiplying signed numbers that works equally well for both negative and positive multipliers. This synopsis proposes the design and implementation of Booth multiplier using VHDL . This compares the power consumption and delay of radix 2 and modified radix 4 Booth multipliers. The modified radix 4 Booth multiplier has reduced power consumption than the conventional radix 2 Booth Multiplier


Sources: Omics Online
Keywords: Radix2,Radix4 Booth Multiplier,Booth Algorithm,
Title: Network Intrusion Detection System Using Genetic Algorithm and Fuzzy Logic
Abstract:

These days Intrusion Detection System (IDS) which is defined as a solution of system security is employed to identify the abnormal activities in a computer system or network. So far different approaches have been utilized in intrusion detections, but unluckily any of the systems is not entirely ideal. Hence, the hunt of improved method goes on. In this progression, here I have designed an Intrusion Detection System (IDS), by applying genetic algorithm (GA) and fuzzy logic to efficiently detect various types of the intrusive activities within a network. The proposed fuzzy logic-based system could be able to detect the intrusive activities of the computer networks as the rule base holds a better set of rules. The experiments and evaluations of the proposed intrusion detection system are performed with the KDD Cup 99 intrusion detection benchmark dataset. The experimental results clearly show that the proposed system achieved higher accuracy rate in identifying whether the records are normal or abnormal ones and obtained reasonable detection rate.


Sources: Omics Online
Keywords: Intrusion Detection System (IDS),Anomaly Based Intrusion Detection,Genetic Algorithm,Fuzzy Logic, KDD Cup 99 Dataset.,
Title: Modeling of Power Electronic Controller Using Incremental Conductance Algorithm for Solar-Cell Based Distributed Generation
Abstract:

Nowadays power demand is high for utilizing more amount of power for various types of loads in the distribution system. This paper deals with implementation of solar power for standalone distributed generation system for commercial loads. The optimal placement of solar array is essential for standalone distributed generation (DG) system. The proposed system focuses on the design of the solar array with boost converter for achieving high power for standalone system. It uses suitable power electronic devices for improving the power quality, voltage regulation and reducing the ripple voltage and current. The electricity can be generated from solar energy and that can be supplied to the commercial loads. The power quality problems will be reduced with the help of Suitable control algorithm (Incremental conductance algorithm). The presented scheme portrays modeling of solar cell and experimental results have been demonstrated achieving high performance and reliability. The proposed system topology and its control strategy are designed and analyzed by using MATLAB/Simulink tool.


Sources: Omics Online
Keywords: Distributed Generation (DG),solar energy,Power quality,Incremental Conductance (IC) algorithm.,
Title: Analysis Of Job Scheduling Algorithm For An E-Business Model In A Cloud Computing Environment Via GI/G/3/N/K Queuing Model
Abstract:

Conventional e-Business models using the Client/Server architecture has always been complex, thorny and expensive. The quantity and assortment of hardware, software and middleware technologies used in order to run them was intimidating. With the emergence of Cloud computing, the technologies needed for an e-Businesses application are managed by experienced third parties who offer servers, storage management, network technologies, and virtualization technologies. This manuscript presents the accomplishment of the job scheduling algorithm developed for an emblematic e-Business model using GI/G/3/n/k queuing theory perception. Finally, the associated simulations and numeral results are provided, to assurance the Quality of Service (QoS) for all throughput of system.


Sources: Omics Online
Keywords: Cloud computing,GI/G/3/n/k Queuing theory,QoS,job scheduling algorithm,
Title: Harmonic Elimination In Nine Level Inverter By Imperialist Competitive Algorithm
Abstract:

This paper presents the solutions of Selective Harmonic Elimination problem based on an imperialist competitive algorithm. This method for eliminating harmonics particularly predetermined harmonics of the 9-level inverter. Minimize the harmonic is the difficult problems because of the nonlinear transcendental equations is ordered to find out the switching angles, controlling inverter output voltage and also minimized Total Harmonic Distortion of output voltage.. The proposed method is able to eliminate the high number of predetermine harmonics. Simulation work is achieved by using the MATLAB software which verifies the proposed method and finally Total Harmonic Distortion comparison is presented for analysis.


Sources: Omics Online
Keywords: SHE-PWM,Imperialist Competitive Algorithm,THD,
Title: Genetic Algorithm Based Optimal Load Frequency Control in Two-Area Interconnected Power Systems
Abstract:

Load frequency control in power systems introduces as one of the most important items in order to supply reliable electric power with good quality. The goals of the Load Frequency Control (LFC) are to maintain zero steady state errors in a two area interconnected power system. To achieve this goal a fast controller with having no steady-state error will be necessary to be included in power systems. In this paper a new genetic algorithm based method is presented to obtain optimal gains of this controller included in two-area interconnected power system. Simulation results in comparison with correspondence methods confirm the efficiency of proposed method through fastdamping steady-state deviations in power and frequency with presence of step load disturbance.


Sources: Omics Online
Keywords: Two-area interconnected power systems,Load frequency control,Optimal controller design,Genetic algorithm ,
Title: Optimization of a Real Urban Water Network (Langarud City?s Water Network) with the HBMO Algorithm
Abstract:

In developing countries, many of urban water networks are too old where most of them are not designed or
expanded by engineering methods. Therefore, it is of high concerns to rebuild or relief them in a way that they can
operate best. This will reduce the water loss and the costs of maintenance of the water network for a long time period.
Use of evolutionary and meta-heuristic algorithms for optimization of water network is most popular nowadays.
Methods such as Genetic Algorithm (GA) and Ant Colony Optimization (ACO) have been used frequently in the
literatures. In this research, the new meta-heuristic evolutionary algorithm called Honey Bee Mating Optimization
(HBMO) has been used so as to optimize the urban water network of a real town in north of Iran named Langarud.
The purpose of this research was replacing adequate pipes for balancing the pressure level at the water network of
Langarud city with the lowest cost. The result of optimization were compared with the present situation of network
and showed a good effectiveness in the improvement of operational parameters.


Sources: Omics Online
Keywords: Urban water network,Honey bee mating optimization algorithm (hbmo),Meta-heuristic method,Epanet,
Title: Secure-International Data Encryption Algorithm
Abstract:

There are many security algorithms that are used for security purpose. IDEA is one of them. The block cipher IDEA operates with 64-bit plaintext and cipher text blocks and is controlled by a 128-bit key. The fundamental innovation in the design of this algorithm is the use of operations from three different algebraic groups. The algorithm structure has been chosen such that, with the exception that different key sub-blocks are used, the encryption process is identical to the decryption process. The drawback of IDEA is that the large numbers of weak keys were found in IDEA (International Data Encryption Algorithm). Also a new attack on round 6 of IDEA has been detected. In this paper we are describe the design and implementation of secure data encryption algorithm(S-IDEA) protocol, the size of the key has been increased from 128 bits to 256 bits. This increased key size will increase the complexity of the algorithm. To increase the amount of diffusion two MA blocks (multiplicative additive block) are used in a single round of IDEA as compared to one MA block used previously in a single round, With these modifications in the proposed algorithm will increase the cryptographic strength.


Sources: Omics Online
Keywords: International data encryption algorithm(IDEA) ,Secure data encryption algorithm(S-IDEA).Multiple additive(MA),
Title: Efficient Privacy Preserving Secure ODARM Algorithm in Horizontally Distributed Database
Abstract:

Data mining is the most fast growing area today which is used to extract important knowledge from large data collections but often these collections are divided among some parties. Privacy liability may prevent the parties from directly sharing the data and some types of information about the data. The security is major problem in larger database while sharing the data to the network against the unauthorized access. Proposed an Optimized Distributed Association Rule Mining (ODARM) algorithm. The ODARM algorithm helps to provide high security and generate a frequent itemset in distributed server. Proposed system also concentrate on privacy issues, when the data is distributed in multiple servers and no original server wishes to provide their own data to their server. This paper proposed a new model which utilizes the cryptographic hash techniques to produce a privacy and security in horizontally and vertically distributed database. Our proposed result shows that horizontally distributed database is secure than vertical distributed database and also computation and communication cost is more efficient.


Sources: Omics Online
Keywords: Privacy Preserving data mining,Association Rule mining,ODARM Algorithm,Frequent Item Set,
Title: The Novel Approach based on Improving Apriori Algorithm and Frequent Pattern Algorithm for Mining Association Rule
Abstract:

The effectiveness of mining association rules is a significant field of Knowledge Discovery in Databases (KDD). The Apriori algorithm is a classical algorithm in mining association rules. This paper presents an improved method for Apriori and Frequent Pattern algorithms to increase the efficiency of generating association rules. This algorithm adopts a new method to decrease the redundant generation of sub-itemsets during pruning the candidate itemsets, which can form directly the set of frequent itemset and remove candidates having a subset that is not frequent in the meantime. This algorithm can raise the probability of obtaining information in scanning database and reduce the potential scale of itemsets


Sources: Omics Online
Keywords: Association rule,Apriori algorithm,Frequent Pattern algorithm,Frequent itemset,
Title: ANALYZING THE SUPERLATIVE SYMMETRIC CRYPTOGRAPHIC ENCRYPTION ALGORITHM ( ASCEA)
Abstract:

Cryptology is a science that deals with codes and passwords. Cryptology is alienated into cryptography and cryptanalysis. The Cryptography produces methods to protect the data, and cryptanalysis hack the protected data. Cryptography provide solutions for four different security areas - confidentiality, authentication, integrity and control of interaction between different parties involved in data exchange finally which leads to the security of information .Encryption algorithms play a key role in information security systems. This paper provides critical analysis of six most common encryption algorithms namely: DES, 3DES, RC2, Blowfish, AES (Rijndael), and RC6. A comparative study has been carried out for the above six encryption algorithms in terms of encryption key size ,block size, Number of Rounds ,Encryption/decryption time ,CPU process time, CPU clock cycles (in the form of throughput), Power consumption. And these comparisons are used to conclude the best Symmetric Cryptography Encryption algorithm.


Sources: Omics Online
Keywords: Cryptography,Encryption Algorithm,Symmetric keys,Performance,Analysis,DES,3DES,AES,Blowfish,RC2 and RC6,
Title: Genetic Algorithm Technique in Hybrid Intelligent Systems for Pattern Recognition
Abstract:

In this research paper we use combination of stochastic algorithms and hybrid intelligent systems for pattern recognition or classification. Stochastic algorithm has been used for model selection of components or classification, especially when the dimension of the patterns is high. Genetic algorithms are one of the commonly used techniques for stochastic classifiers. Hybrid Intelligent Systems (HIS) combine intelligent techniques in synergistic architectures in order to provide solutions for complex problems. These systems utilize at least two of the three techniques: fuzzy logic, genetic algorithms and neural networks. The aim of their combination is to amplify their strengths and complement their weaknesses. A good architecture for a hybrid system should match each of its tasks to the appropriate intelligent technique and provide an efficient means for their integration. However, it is not always obvious or easy to build HIS architectures that achieve the higher intelligence goal. A good architecture for a hybrid system should match each of its tasks to the appropriate intelligent technique and provide an efficient means for their integration.


Sources: Omics Online
Keywords: Genetic Algorithm,Hybrid Intelligent Systems and Pattern Recognition,
Title: Recovery of Disk Failure in RAID-5 Using Disk Replacement Algorithm
Abstract:

In (Redundant Arrays of Independent Disk) RAID, failure of single disk is tolerated up to Level 5. The performance of disk drives may degrade due to I/O requests directed towards failed disk. RAID controller supports data reconstruction in the event of a disk failure, to recover the data from failed disk. In degraded mode, the recovery of data from failed disk would cause additional workflow in all operational disks. Another mode of recovery called Hot-spare, where disks that are in the end of their lifetime are replaced with spare disks without requirement for additional I/O operations and parity calculations. In this work an existing disk replacement algorithm known as M-SSTF (Modified SSTF) is used for early recovery of failed disk. Early recovery of single disk failure might help tolerating another subsequent disk failure. Hence it is important to rebuild a failed disk as early as possible.


Sources: Omics Online
Keywords: RAID,Disk Failure,Parity,Disk Reconstruction,Disk Replacement algorithm,
Title: Predicting the Software Fault Using the Method of enetic Algorithm
Abstract:

Software metrics and fault data belonging to a previous software version are used to build the software fault prediction model for the next release of the software. However there are certain cases when previous fault data are not present. In other words predicting the fault-proneness of program modules when the fault labels for modules are unavailable is a challenging task frequently raised in the software industry. There is need to develop some methods to build the software fault prediction model based on supervised learning which can help to predict the fault–proneness of a program modules when fault labels for modules are not present. One of the methods is use of classification techniques. Supervised techniques like classification may be used for fault prediction in software modules, more so in those cases where fault labels are not available. In this study, we propose a Genetic algorithm based software fault prediction approach for classification.


Sources: Omics Online
Keywords: fault proneness,genetic algorithm,supervised techniques,classification,
Title: XML MINING USING GENETIC ALGORITHM
Abstract:

In recent years XML documents have became very popular for representing semi-structured data and a standard for data exchange over the web. Mining XML data from the web is becoming increasingly important as well. In general frequent itemsets are generated from large data sets by applying association rule mining algorithms like Apriori, Partition, Pincer-Search, Incremental, and Border algorithm etc., which take too much computer time to compute all the frequent itemsets. By using Genetic Algorithm (GA) we can improve the scenario. The major advantage of using GA in the discovery of frequent itemsets is that they perform global search and its time complexity is less compared to other algorithms as the genetic algorithm is based on the greedy approach. The main aim of this paper is to find all the frequent itemsets from XML database using genetic algorithm.


Sources: Omics Online
Keywords: Genetic Algorithm (GA),Extensible Markup Language (XML),Association Rule,Frequent itemset,Support,Confidence,Data Mining,
Title: Quantify the Loss Reduction with Optimization of DGs Placement Using ICA Algorithm a Case Study on the Electrical Distribution Network of north Kerman
Abstract:

Increasing application of DG on distribution networks is the direct impact of development of technology and the energy disasters that the world is encountering. To obtain these goals the resources capacity and the installation place are of a crucial importance. Line loss reduction is one of the major benefits of DG, amongst many others, when incorporated in the power distribution system. The quantum of the line loss reduction should be exactly known to assess the effectiveness of the distributed generation. In this paper, a new method is proposed to find the optimal and simultaneous place and capacity of these DG units to reduce losses, improve voltage profile too the total loss of a practical distribution system is calculated with and without DG placement and an index, quantifying the total line loss reduction is proposed. To demonstrate the validity of the proposed algorithm, computer simulations are carried out on actual power network of Kerman Province, Iran and the simulation results are presented and discussed.


Sources: Omics Online
Keywords: Distribution systems,Loss reduction index,DG placement,Imperialist Competitive Algorithm,
Title: EFFICIENT GENETIC ALGORITHM ON LINEAR PROGRAMMING PROBLEM FOR FITTEST CHROMOSOMES
Abstract:

Genetic Algorithms are search algorithms based on the mechanics of natural selection and natural genetics. They combine survival of the fittest among string structures with a structured yet randomized information exchange to form such an algorithm with some of the innovative flair of human search. In every generation, a new set of artificial creatures (Strings) is created using bits and pieces of the fittest of the old; an occasional new part is tried for good measure. Linear Programming (LP) is the most commonly applied form of constrained optimization. In this paper we proposed an efficient genetic algorithm applied on linear programming problem for find out the Fittest Chromosomes. The experimental performances find out the fittest chromosomes regarding to constraint linear programming problem, so that it gives a better result.


Sources: Omics Online
Keywords: Chromosome,Genetic algorithm,Fitness,LPP,
Title: A Computational Algorithm for Corona Power Loss in Grid
Abstract:

In this paper a new efficient algorithm for computation of corona power loss in grid is described. The algorithm is based on a new finite element method (FEM) which allows computing corona power loss in high-voltage lines transmission. The new algorithm method is intended for considering the effects of various parameters on corona current such as: the height of conductor, the radius of conductor, the surface factor, distribution of electric potentials in space of between conductor and ground plane with applying space charges, and ambient temperature. The algorithm results were compared with the existing methods and the result accuracy was confirmed. Also, the results show that the new algorithm has positional to reduce the number of iteration for calculation of the corona current. The knowledge of the corona phenomena discharge will assist in monitoring and controlling the reliability of high voltage systems. This information can be monitored for measuring, detecting and taking appropriate control actions.


Sources: Omics Online
Keywords: Corona Power Loss,Finite Element method (FEM), Algorithm,
Title: Optimal Path Selection for Mobile Robot Navigation Using Genetic Algorithm
Abstract:
The proposed Navigation Strategy using GA(Genetic Algorithm) f inds a n optimal p ath in the simulated grid environment. GA forces to find a path that is connected to the robot start and target positions via predefined points. Each point in the environmental model is called genome and the path connecting Start and Target is called as Chromosome. According to the problem formulation, the length of the algorithm chromosomes (number of genomes) is dynamic. Moreover every genome is not a simple digit. In this case, every genome represents the nodes in the 2D grid environment. After implementing the cross over and mutation concepts the resultant chromosome (path) is subjected to optimization process which gives the optimal path as a result. The problem faced with is there may be chances for the loss of the fittest chromosome while performing the reproduction operations. The solution is achieved by inducing the concept of elitism thereby maintaining the population richness. The efficiency of the algorithm is analyzed with respect to execution time and path cost to reach the destination. Path planning, collision avoidance and obstacle avoidance

Sources: Mendeley
Keywords: robot,algorithm,mobile,genetic,path,