Abdul Razak Yaakub

New L-stable modified trapezoidal methods for the initial value problems

New L-stable trapezoidal formulas obtained by modifying the nonlinear trapezoidal formulas are presented. Numerical results are presented to confirm the theoretical stability analysis.

Assessing User Acceptance towards Virtual Museum: The Case in Kedah State Museum, Malaysia

This paper describes the testing analysis that has been done towards a prototype of virtual museum named ViSeum. The prototype was based on the real Kedah State Museum (KSM) at Northern Malaysia. This ViSeum was developed using non immersive virtual reality technique, whereas it focused to reduce cost development and maintenance, easy access and more interactive. The objective of this study is to present the result of the analysis based using Technology Acceptance Model on the survey. Perceived usefulness, perceive ease of use, and perceived enjoyment are the independent variables in testing intention to use by visitor.

Virtual environment navigation using an image-based approach

This paper investigates and illustrates the potential of using panorama virtual reality to enhance Web-based library instruction. The project considers that panorama virtual reality (VR) could be a powerful tool when comparing a conventional tour and virtual tour. A VR tour as a whole can became a more useful medium that allows navigating, viewing, reading, hearing and remote access. This paper describes the implementation processes and lessons learned throughout the development process regarding the application stage of prototype development using different software: VR Worx Panorama, VR Worx Scene, PhotoVista Panorama, Reality Studio and Ulead COOL 360. The discussion includes an overview of comparisons between panorama VR and other VR tools. A survey was also carried out with the objective of comparing virtual reality panorama with a conventional technique in delivered guided tour information.

An Artificial Intelligence Technique for Prevent Black Hole Attacks in MANET

Mobile ad hoc networks (MANETs) can be operated in the difficult environments or emergency situations. In this type of networks, the nodes work of forwarding packets together. Routing protocols are worked based on multi-hop to discover a path from source to destination node when the direct path between them does not exist. One of the standard MANET protocols is Ad hoc on-demand distance vector protocol (AODV). AODV is attacked by many types of attacks such as black hole attack due its routing mechanism. Black hole provides highest destination sequence number and lowest hop count number to attract sourcenode and drop the packets. Most previous works were used trusted neighbor nodes for preventing black hole attack and making AODV more secure. However, these solutions suffer from high routing overhead and missing specific mechanism for providing a shortest secure path. In this paper, we propose an intelligent preventing technique for AODV to prevent black hole attacks, which is called Shortest Secure Path for AODV (SSP-AODV). This intelligent technique is integrated A* and Floyd-Warshall’s algorithms. The simulation is conducted in Network Simulator 2. The results indicate that the proposed intelligent technique outperform standard AODV in two terms; packet loss delivery and average End-to-End delay. The performance of proposed technique can significantly reduce the effect of black hole attacks.

A Fifth Order Runge-Kutta RK(5, 5) Method With Error Control

In this paper a new Runge-Kutta RK(5, 5) method is introduced. The theory and analysis of its properties are investigated and compared with the more well known RKF(4, 5) and RK(4, 5) - Merson methods.

VDLLA: A virtual daddy-long legs optimization

Swarm intelligence is a strong optimization algorithm based on a biological behavior of insects or animals. The success of any optimization algorithm is depending on the balance between exploration and exploitation. In this paper, we present a new swarm intelligence algorithm, which is based on daddy long legs spider (VDLLA) as a new optimization algorithm with virtual behavior. In VDLLA, each agent (spider) has nine positions which represent the legs of spider and each position represent one solution. The proposed VDLLA is tested on four standard functions using average fitness, Medium fitness and standard deviation. The results of proposed VDLLA have been compared against Particle Swarm Optimization (PSO), Differential Evolution (DE) and Bat Inspired Algorithm (BA). Additionally, the T-Test has been conducted to show the significant deference between our proposed and other algorithms. VDLLA showed very promising results on benchmark test functions for unconstrained optimization problems and also signifi...