Search Results - (( _ implementation developing algorithm ) OR ( problem implementation re algorithm ))

An experimental study of neighbourhood based metaheuristic algorithms for test case generation satisfying the modified condition / decision coverage criterion by Haque, Ariful

“…We have chosen four neighborhood based algorithms which are commonly used in optimization problems and divided them in newly implemented and re-implemented category. …”
Get full text
Get full text

Traffic management algorithms for LEO satellite networks by Huyop @ Ayop, Fahrul Hakim

“…Overall, from all the three experiments that have been conducted, the proposed routing algorithms which have been developed to manage the network traffic have proved better than the previously developed algorithms in several perspectives especially for the implementation of real-time applications in LEO satellite networks.…”
Get full text
Get full text
Get full text

Comparative Analysis of Neighborhood based Meta-heuristic Algorithms for MC/DC Test Data Generation by Ariful, Haque, Kamal Z., Zamli

“…In order to help test engineers to make informed decision on the best neighborhood based implementations, this paper investigates the size and time performance of two MC/DC test strategies re-implementation based on Simulated Annealing against two newly developed strategies based on Great Deluge and Late Acceptance Hill Climbing algorithms respectively. …”
Get full text
Get full text

An ensemble of neural network and modified grey wolf optimizer for stock prediction by Das, Debashish

“…The research implements stock prediction analysis as a case study for training the neural network by adopting MGWO algorithm. …”
Get full text
Get full text

Optimization Of Fuzzy Logic Controllers With Genetic Algorithm For Two-Part-Type And Re-Entrant Production Systems by Homayouni, Seyed Mahdi

“…A genetic algorithm is developed to tune the membership functions (MFs) of input variables of GDF and GSF controllers. …”
Get full text
Get full text

Outdoor marker-less tracking and pose calculating system for mobile augmented reality by Rehman, Ullah Khan

“…Implementation of marker-based Augmented Reality systems on mobile phones is mostly a solved problem. …”
Get full text
Get full text

Logistic Regression Methods with Truncated Newton Method by Jasni, Mohamad Zain, Abdullah, Embong, Rahayu, Santi Puteri, Juwari, S, Purnami, Santi Wulan

“…Instead of using IRLS procedure as used by TR-KLR and TR-IRLS, the proposed algorithms implement Newton-Raphson method as the outer algorithm of Truncated Newton for KLR and RLR respectively. …”
Get full text
Get full text

Hybrid metaheuristic method for clustering in wireless sensor networks / Bryan Raj Peter Jabaraj by Bryan Raj , Peter Jabaraj

“…The adaptive HSSOGA (aHSSOGA) is implemented in the WSN environment to mitigate the isolated node and energy hole problems. …”
Get full text
Get full text
Get full text

Adaptive artificial neural network for power system security assessment and control action by Al-Masri, Ahmed Naufal A.

“…In addition, the developed AANN has been successfully implemented to dynamic security assessment for predicting the security status of the IEEE 9-bus test system.…”
Get full text
Get full text

New reflector shaping methods for dual-reflector antenna by Quzwain, Kamelia, Yamada, Yoshihide, Kamardin, Kamilia, Abd Rahman, Nurul Huda, Ismail, Alyani

“…First, the equivalent parabola and circle equation is implemented in the reflector shaping algorithms. Second, a Matrix Laboratory (MATLAB) program is developed in order to obtain the main and sub reflector shapes. …”
Get full text
Get full text

An automated approach to elicit and validate security requirements of mobile application by Yusop, Noorrezam

“…Mobile phone usage has continued to rise,and it is becoming more convenient for users to use mobile applications for booking hotels,conducting online transaction and online payment.In this case,secured applications are required to increase the confidence among mobile users.In order to achieve correct secure application,a correct security requirements needs to be elicited and defined.Additionally,it is also crucial for security requirements of mobile apps to fulfill basic quality attributes such as correct,consistent and complete (3Cs).However,few problems are found in eliciting security requirements for mobile apps.Firstly, most requirements engineers (RE) are identified to have less knowledge and understanding of security requirements attributes,leading to the failure of implementing the 3Cs of security requirements.Secondly,most of the elicitation and the validation of security requirements are conducted at the later stage of the development and leads to poor quality security requirements implementation which might resulted to project failure.Motivated from these problems,the objectives of this thesis are three-folds; 1) To analyze the security requirements for mobile apps, 2) To propose an approach to elicit and end-to-end validation of security requirement,and 3)To evaluate the efficacy in term of correctness and performance as well as usability of the approach.This thesis proposes a new automated approach to assist the elicitation and validation of security requirements.Here an automated tool support called MobiMEReq is also developed.For this, we have adopted Test Driven Development (TDD) methodology with semi-formalized models:i) Essential Use Cases (EUCs) and ii) Essential User Interface (EUI).We then divided our approach into two parts:1)Elicitation and 2)End-to-end validation security requirements.Further,we have developed pattern libraries to assist on the correct elicitation and validation.They are mobile Security attributes pattern library and mobile security pattern library.Then,we have constructed a new algorithm using fuzzy logic to assist on the prioritization of the test for better performance of validation.Finally,a comprehensive evaluation of the approach,comprising experiments of correctness test and usability test were conducted.Here,we have also evaluated the feedback from the industry experts especially on the usability of the automated approach and tool support.In summary,the findings of the evaluations show that our approach is able to contribute to the body of knowledge of mobile security requirements engineering especially in enhancing the performance and correctness level of security attribute elicitation and its usability for end-to-end elicitation and validation.It is found that the approach able to enhance the correctness level of the elicited security attribute compared to the manual approach,and produce correct generation of test.Then,the results of the usability test by the novice and experts show that the approach is useful in eliciting and validating security requirements at the early stage of application development and is able to ease the elicitation and validation process of security requirements of mobile apps.…”
Get full text
Get full text
Get full text

A Review Of The Student Academic Planner System by Fathi, A.M.Z., Nurdiana, A.

Evolutionary cost-cognizant regression test case prioritization for object-oriented programs by Bello, AbdulKarim

“…There is also a need to consider implementing this strategy for dynamic object-oriented languages such as Python, Lisp, and Smalltalk.…”
Get full text
Get full text

A backward recovery mechanism in preemptive utility accrual real time scheduling algorithm by Ahmad, Idawaty, Othman, Muhammad Fauzan

“…Problem statement: This study proposed a robust algorithm named as Backward Recovery Preemptive Utility Accrual Scheduling (BRPUAS) algorithm that implements the Backward Recovery(BR) mechanism as a fault recovery solution under the existing utility accrual scheduling environment. …”
Get full text
Get full text

Design and analysis of sequence generator module using eulerian path algorithm for DNA fragment assembly / Mustaqim Mohd Subri by Mohd Subri, Mustaqim

“…This project is to design and analysis the sequence generator module using Eulerian Path algorithm for DNA fragment assembly. Traditionally, “overlap-layoutconsensus” technique is used for DNA fragment assembly, but this technique has a problem in assembling a long sequence of DNA which a new technique needs to be used to overcome this problem. …”
Get full text
Get full text

Vector Evaluated Gravitational Search Algorithm Assisted by Non-dominated Solutions in Solving Multiobjective Optimization Problems by Badaruddin, Muhammad, Khairul Hamimah, Abas, Mohd Riduwan, Ghazali

“…Previously, non-dominated solutions have been employed to improve the performance of particle swarm optimization (PSO). In this paper, we re-implement the same concept to gravitational search algorithm (GSA). …”
Get full text
Get full text
Get full text

Improving utility and recovery algorithms for adaptive real time system in multiprocessor environment by Ahmad, Idawaty

“…These algorithms solved the abortion problem in the existing General Utility Scheduling (GUS). …”
Get full text
Get full text

Query proof structure caching for incremental evaluation of tabled prolog programs / Taher Muhammad Ali by Taher Muhammad, Ali

“…The thesis presents the design, necessary data structures, algorithms and implementation details of JLOG. The results of comparing the performance of JLOG to regular PROLOG and Tabled PROLOG systems are also presented.…”
Get full text
Get full text
Get full text

Hybrid-discrete multi-objective particle swarm optimization for multi-objective job-shop scheduling by Anuar, Nurul Izah

“…Besides, since PSO operates in the continuous domain, it cannot be applied directly to solve a discrete problem like the JSP efficiently. This research first proposes an improved continuous MOPSO to address the rapid clustering problem that exists in the basic PSO algorithm using three improvement strategies: re-initialization of particles, systematic switch of best solutions and mutation on global best selection. …”
Get full text
Get full text
Get full text

An Enhanced Simulated Annealing Routing Algorithm for Semi-Diagonal Torus Network by Noraziah, Adzhar, Shaharuddin, Salleh

“…In order to achieve this objective, each node must be connected in its shortest way as possible. We start our algorithm by designing shortest path algorithm based on Dijkstra's method. …”
Get full text
Get full text
Get full text