Search Results - (( basic evaluation proposed algorithm ) OR ( java simulation optimization algorithm ))

Attribute reduction based scheduling algorithm with enhanced hybrid genetic algorithm and particle swarm optimization for optimal device selection by Nwogbaga, Nweso Emmanuel, Latip, Rohaya, Affendey, Lilly Suriani, Abdul Rahiman, Amir Rizaan

“…The simulation is implemented with iFogSim and java programming language. …”
Get full text
Get full text

Enhancement of Ant Colony Optimization for Grid Job Scheduling and Load Balancing by Husna, Jamal Abdul Nasir

“…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

Ant colony optimization algorithm for load balancing in grid computing by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…The proposed algorithm is known as the enhance ant colony optimization (EACO). …”
Get full text
Get full text
Get full text

Adaptive routing algorithms and implementation for TESH network by Miura, Yasuyuki, Kaneko, Masahiro, Rahman, M.M. Hafizur, Watanabe, Shigeyoshi

“…In this paper, we implement these routers using VHDL and evaluate the hardware cost and delay for the proposed routing algorithms and compare it with the dimension order routing. …”
Get full text
Get full text
Get full text

OPTIMIZED MIN-MIN TASK SCHEDULING ALGORITHM FOR SCIENTIFIC WORKFLOWS IN A CLOUD ENVIRONMENT by Murad S.S., Badeel R., Alsandi N.S.A., Alshaaya R.F., Ahmed R.A., Muhammed A., Derahman M.

“…To achieve this, we propose a new noble mechanism called Optimized Min-Min (OMin-Min) algorithm, inspired by the Min-Min algorithm. …”

Routing performance enhancement in hierarchical torus network by link-selection algorithm by Rahman, M.M. Hafizur, Horiguchi, Susumu

“…In this paper, we propose a link-selection algorithm for efficient use of physical links of the HTN, while keeping the link-selection algorithm as simple as the dimension-order routing algorithm. …”
Get full text
Get full text
Get full text

Dynamic communication performance enhancement in hierarchical torus network by selection algorithm by Rahman, M.M. Hafizur, Sato, Yukinori, Inoguchi, Yasushi

“…The dynamic communication performances of an HTN is evaluated by using dimension-order routing and proposed adaptive routing algorithms under various traffic patterns. …”
Get full text
Get full text
Get full text

Embedded system for indoor guidance parking with Dijkstra’s algorithm and ant colony optimization by Mohammad Ata, Karimeh Ibrahim

“…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

Features selection for intrusion detection system using hybridize PSO-SVM by Tabaan, Alaa Abdulrahman

“…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

Resource management in grid computing using ant colony optimization by Ku-Mahamud, Ku Ruhana, Mohamed Din, Aniza

“…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

Implementation of locust inspired scheduling algorithm with huge number of servers for energy efficiency in a cloud datacenter by Azhar, Nur Huwaina

“…Cloudsim is used as Discrete Event Simulation tool and Java as coding language to evaluate LACE algorithm. …”
Get full text
Get full text

Agent-based extraction algorithm for computational problem solving by Rajabi, Maryam

“…The tool is used to evaluate the accuracy of the proposed extraction algorithm to extract the appropriate information which are needed. …”
Get full text
Get full text

A cost and delay estimation of a suite of low-cost adaptive routers for hierarchical torus network by Rahman, M.M. Hafizur, Akhand, M. A. H

“…However, the cost and delay of those routers is not evaluated yet. In this paper, We present a conservative estimation of hardware cost and router delay for the proposed routing algorithms and compare it with the dimension order routing. …”
Get full text
Get full text
Get full text

The non-uniform communication performance of adaptive routing for hierarchical interconnection network for 3D VLSI by Miura, Yasuyuki, Watanabe, Shigeyoshi, Rahman, M.M. Hafizur

“…Many adaptive routing algorithms for k-ary n-cube networks have already been proposed. …”
Get full text
Get full text
Get full text

Ant system with heuristics for capacitated vehicle routing problem by Tan, Wen Fang

“…The ASH algorithm is basically applied with its probabilistic decision rule and pheromone feedback to construct the sequences of customers to be visited in the CVRP solution. …”
Get full text
Get full text

High performance hierarchical torus network by Rahman, M.M. Hafizur, Shah, Asadullah, Inoguchi, Yasushi

“…The static network performances are derived from the graph model and the DCP is evaluated by using dimension-order routing and newly proposed adaptive routing algorithms under various traffic patterns. …”
Get full text
Get full text

System identification using Extended Kalman Filter by Alias, Ahmad Hafizi

“…In order to evaluate the performance of the EKF learning algorithm, the proposed algorithm validation were analyzed using model validation methods as a checker such as One Step Ahead (OSA) and correlation coefficient (R2). …”
Get full text
Get full text

Enhanced Image View Synthesis Using Multistage Hybrid Median Filter For Stereo Images by Ali Hussein Aboali, Maged Yahya

“…Disparity depth map estimation of stereo matching algorithm is one of the most active research topics in computer vision.In the field of image processing,many existing stereo matching algorithms to obtain disparity depth map are developed and designed with low accuracy.To improve the accuracy of disparity depth map is quite challenging and difficult especially with uncontrolled dynamic environment.The accuracy is affected by many unwanted aspects including random noises,horizontal streaks,low texture,depth map non-edge preserving, occlusion,and depth discontinuities.Thus,this research proposed a new robust method of hybrid stereo matching algorithm with significant accuracy of computation.The thesis will present in detail the development,design, and analysis of performance on Multistage Hybrid Median Filter (MHMF).There are two main parts involved in our developed method which combined in two main stages.Stage 1 consists of the Sum of Absolute Differences (SAD) from Basic Block Matching (BBM) algorithm and the part of Scanline Optimization (SO) from Dynamic Programming (DP) algorithm.While,Stage 2 is the main core of our MHMF as a post-processing step which included segmentation,merging, and hybrid median filtering.The significant feature of the post-processing step is on its ability to handle efficiently the unwanted aspects obtained from the raw disparity depth map on the step of optimization.In order to remove and overcome the challenges unwanted aspects, the proposed MHMF has three stages of filtering process along with the developed approaches in Stage 2 of MHMF algorithm.There are two categories of evaluation performed on the obtained disparity depth map: subjective evaluation and objective evaluation.The objective evaluation involves the evaluation on Middlebury Stereo Vision system and evaluation using traditional methods such as Mean Square Errors (MSE),Peak to Signal Noise Ratio (PSNR) and Structural Similarity Index Metric (SSIM).Based on the results of the standard benchmarking datasets from Middlebury,the proposed algorithm is able to reduce errors of non-occluded and all errors respectively.While,the subjective evaluation is done for datasets captured from MV BLUE FOX camera using human's eyes perception.Based on the results,the proposed MHMF is able to obtain accurate results, specifically 69% and 71% of non-occluded and all errors for disparity depth map, and it outperformed some of the existing methods in the literature such as BBM and DP algorithms.…”
Get full text
Get full text
Get full text
Get full text

Steg Analysis Algorithm for Edge Adaptive Least Significant Bit Matching Revisited Detection by Edris, Khalid Edris, Fakhreldin, Mohammed Adam Ibrahim, Jasni, Mohamad Zain, Tuty Asmawaty, Abdul Kadir

Get full text
Get full text
Get full text
Get full text

High performance hierarchical torus network under matrix transpose traffic patterns by Rahman, M.M. Hafizur, Susumu, Horiguchi

“…In this paper, we present a deadlock-free routing algorithm for the HTN using virtual channels and evaluate the network’s dynamic communication performance under matrix transpose traffic, using the proposed routing algorithm. …”
Get full text
Get full text
Get full text