Search Results - (( development dna using algorithm ) OR ( java simulation optimization algorithm ))
Search alternatives:
- development dna »
- using algorithm »
- java simulation »
- dna using »
-
1
Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection
Published 2022“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text
Article -
2
Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing
Published 2011“…Global pheromone update is performed after the completion of processing the jobs in order to reduce the pheromone value of resources. A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against existing grid resource management algorithms such as Antz algorithm, Particle Swarm Optimization algorithm, Space Shared algorithm and Time Shared algorithm, in terms of processing time and resource utilization. …”
Get full text
Get full text
Get full text
Thesis -
3
Ant colony optimization algorithm for load balancing in grid computing
Published 2012“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text
Monograph -
4
Development of DNA fragment assembly using idury-waterman algorithm / Nurul Azyanny Mustaffa
Published 2013“…The purpose of this project is to develop the DNA frequence assembly by using Idury Waterman algorithm. …”
Get full text
Get full text
Student Project -
5
OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT
Published 2023“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”
Review -
6
Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization
Published 2019“…This study proposes a car parking management system which applies Dijkstra’s algorithm, Ant Colony Optimization (ACO) and Binary Search Tree (BST) in structuring a guidance system for indoor parking. …”
Get full text
Get full text
Thesis -
7
Features selection for intrusion detection system using hybridize PSO-SVM
Published 2016“…Hybridize Particle Swarm Optimization (PSO) as a searching algorithm and support vector machine (SVM) as a classifier had been implemented to cope with this problem. …”
Get full text
Get full text
Thesis -
8
Linear-pso with binary search algorithm for DNA motif discovery / Hazaruddin Harun
Published 2015“…Several DNA sequences from different species were collected from the GenBank and TRansCompel databases and used as input for the algorithm. …”
Get full text
Get full text
Thesis -
9
A filtering algorithm for efficient retrieving of DNA sequence
Published 2009“…An automaton-based algorithm is used to develop the filtering process proposed. …”
Get full text
Get full text
Get full text
Article -
10
Resource management in grid computing using ant colony optimization
Published 2011“…Resources with high pheromone value are selected to process the submitted jobs.Global pheromone update is performed after completion processing the jobs in order to reduce the pheromone value of resources.A simulation environment was developed using Java programming to test the performance of the proposed EACO algorithm against other ant based algorithm, in terms of resource utilization.Experimental results show that EACO produced better grid resource management solution.…”
Get full text
Get full text
Get full text
Get full text
Monograph -
11
Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter
Published 2019“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text
Thesis -
12
ECG encryption enhancement with multi-layers of AES and DNA computing
Published 2023“…In order to more effectively incorporate both present technology and developing technology, models of DNA cryptography need to be developed. …”
Get full text
Get full text
Get full text
Thesis -
13
Linear-PSO with binary search algorithm for DNA Motif Discovery / Hazaruddin Harun
Published 2015“…Numerous algorithms had been developed for MD, but most of these were not designed to discover species specific motifs used in identifying a specifically selected species where the exact location of these motifs also needs to be identified. …”
Get full text
Get full text
Book Section -
14
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator: article
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Article -
15
Design and development of optimal path trace back using graph theory technique for accelerate DNA sequence alignment accelerator
Published 2010“…This paper presents the improvement of Smith-Waterman algorithm in comparing between two DNA sequence alignments. …”
Get full text
Get full text
Student Project -
16
Design of DNA sequence alignment accelerated system using 2-dimensional array and custom instruction on FPGA / Nur Dalilah Ahmad Sabri
Published 2018“…The proposed 2D Array on SW algorithm has been developed and designed by using ideas over previous work of CI on SW algorithm. …”
Get full text
Get full text
Thesis -
17
An Ant Colony System for Solving DNA Sequence Design Problem in DNA Computing
Published 2013Get full text
Article -
18
Analyzing DNA Sequences Using Clustering Algorithm
Published 2009Get full text
Get full text
Get full text
Thesis -
19
Design and analysis of high performance matrix filling for DNA sequence alignment accelerator using asic design flow: article / Nurzaima Mahmod
“…The design was developed in Verilog HDL coding and synthesis by using LINUX tools. …”
Get full text
Get full text
Article -
20
Intelligent DNA signature detection for internet worms
Published 2011“…Active worms spread in an automated fashion flooding the Internet in a very short time.Slammer worm infected more than 90% of vulnerable machines within 10 minutes on January 25th, 2003.Hence it is necessary to monitor and detect the worms as soon as they are introduced to minimize the damage caused by them.This project concentrates on developing an anti-scanning worm detection system that can automatically detect and control the spread of internet scanning worms without any manual intervention.The Intelligent Failure Connection Algorithm (IFCA) developed in this project can detect both stealth and normal worms within a short time.Experiments conducted as part of the evaluation shows that IFCA detects a worm within two scanning cycles of the worm.This is faster than any of the currently available algorithms or mechanisms reported in the literature.The IFCA uses Artificial Immune System (AIS) for the purpose of monitoring and detecting the worms.The Traffic Signature Algorithm (TSA) developed in the project captures the traffic signature of the worm from the infector when it sends the traffic to the victim.The Intelligent DNA Signature Detection Algorithm (IDNASDA) algorithm works by breaking an infection session into different infection phases, each phase containing a number of different traffic such as Internet Control Message Protocol (ICMP), Transmission Control Protocol (TCP), or User Datagram Protocol (UDP).Finally it converts the traffic signature to DNA signature.The tests carried out show that the IDNASD could detect DNA signature for MSBlaster worm.…”
Get full text
Get full text
Get full text
Get full text
Monograph
