Network


Latest external collaboration on country level. Dive into details by clicking on the dots.

Hotspot


Dive into the research topics where Ahmad Shukri Mohd Noor is active.

Publication


Featured researches published by Ahmad Shukri Mohd Noor.


Intelligent Automation and Soft Computing | 2016

A Review on Artificial Intelligence Methodologies for the Forecasting of Crude Oil Price

Haruna Chiroma; Sameem Abdulkareem; Ahmad Shukri Mohd Noor; Adamu Abubakar; Nader Sohrabi Safa; Liyana Shuib; Mukhtar Fatihu Hamza; Abdulsalam Ya’u Gital; Tutut Herawan

AbstractWhen crude oil prices began to escalate in the 1970s, conventional methods were the predominant methods used in forecasting oil pricing. These methods can no longer be used to tackle the nonlinear, chaotic, non-stationary, volatile, and complex nature of crude oil prices, because of the methods’ linearity. To address the methodological limitations, computational intelligence techniques and more recently, hybrid intelligent systems have been deployed. In this paper, we present an extensive review of the existing research that has been conducted on applications of computational intelligence algorithms to crude oil price forecasting. Analysis and synthesis of published research in this domain, limitations and strengths of existing studies are provided. This paper finds that conventional methods are still relevant in the domain of crude oil price forecasting and the integration of wavelet analysis and computational intelligence techniques is attracting unprecedented interest from scholars in the domai...


international conference on information computing and applications | 2010

Failure recovery mechanism in neighbor replica distribution architecture

Ahmad Shukri Mohd Noor; Mustafa Mat Deris

Replication provide an effective way to enhance performance, high availability and fault tolerance in distributed systems. There are numbers of fault tolerant and failure recovery techniques based on replication. These recovery techniques such as Netarkivets data grid and fast disaster recovery mechanism for volume replication systems were implemented in two-replica distribution technique(TRDT) or primary-backup architecture. However, these techniques have its weaknesses as they inherit irrecoverable scenarios from TRDT such as double faults, both copies of a file are damaged or lost, missing of the content index in index server table and index server has generated checksum error in content index. In this paper we propose the failure recovery based on the Neighbor Replication Distribution technique (NRDT) to recover the irrecoverable scenarios and to improve the recovery performance. This technique considered neighbors have the replicated data, and thus, maximize the fault tolerant as well as reliability in failure recovery. Also, the technique outperform the TRDT in failure recovery by reducing the irrecoverable cases in TRDT. It also tolerates failures such as server failures, site failure or even network partitioning due to it has more the one back up or replica.


International Conference on Grid and Distributed Computing | 2009

Extended Heartbeat Mechanism for Fault Detection Service Methodology

Ahmad Shukri Mohd Noor; Mustafa Mat Deris

Fault detection methodology is a crucial part in providing a scalable, dependable and high availability of grid computing environment. The most popular technique that used in detecting fault is heartbeat mechanism where it monitors the grid resources in a very short interval. However, this technique has its weakness as it requires a period of times before the node is realized to be faulty and therefore delaying the recovery actions to be taken. This is due to unindexed status for each transaction and need to wait for a certain time interval before realizing the nodes has failed. In this paper, fault detection mechanism and service using extended heartbeat mechanism is proposed. This technique introduced the use of index server for indexing the transaction and utilizing pinging service for pushing mechanism. The model outperformed the existing techniques by reducing the time taken to detect fault in approximately 30%. Also, the mechanism provides a basis for customizable recovery actions to be deployed.


International Journal of Cloud Applications and Computing archive | 2012

Neighbor-Replica Distribution Technique Model for Availability Prediction in Distributed Interdependent Environment

Ahmad Shukri Mohd Noor; Tutut Herawan; Mustafa Mat Deris

High availability is important for large scale distributed systems. Replication provides effective ways to enhance performance, high availability and fault tolerance in distributed systems. An efficient and effective replication technique is the key to improve the availability performance. Data and processes can be replicated for failures recovery. There are currently projects successfully implemented in two-replica distribution technique TRDT or primary-backup technique. However, these projects have their weaknesses of increasing cost overhead and inherit irrecoverable scenarios from TRDT such as double faults when both copies of replicated components are damaged. The authors propose the Neighbor Replica Distributed Technique NRDT availability prediction model. Focusing on improving high availability in which it predicts future expectation of interdependent servers availability in a distributed online system over an extended period of time. The results and discussion are explored further in the article.


international conference on user science and engineering | 2010

Organizing ready-made virtual objects for virtual environments

W M Rizhan W Idris; Yazid Mohd Saman; Aziz Ahmad; Ahmad Shukri Mohd Noor

In the world of simulation, Virtual reality (VR) software allows users to visualize, manipulate and interact with computers and complex data. VR has been utilized in applications such as architecture, medicine, advertisement, business, entertainment, and education. Developing VR environments is costly and expensive. Highly-technical persons are needed to create the virtual objects from scratch. Once a virtual system is created, managing and modifying it creates further problems. There is a need for non-technical users to be able to create and modify their own virtual environments. This paper discusses a systematic and dynamic framework to manage virtual objects in virtual environment. It is called Virtual Reality System-Hierarchy Embedded Virtual Objects (VRS-HEVO). It comprises of two components; the Stand- Alone VRS-HEVO and the Distributed VRS-HEVO. To implement the framework, Java 3D and Java Swing have been used. A usability study on the performance of the framework has been carried out. Users have perceived it as an easy tool to use, especially for an environment in education.


International Journal of Machine Learning and Computing | 2014

Co-Existance Neighbourhood Model for Optimizing Cloud Infrastructure as a Service (IaaS) Within Interdependent Environment

Ahmad Shukri Mohd Noor; Mustafa Mat Deris; Yazid Md Saman

The tendency of current large distributed systems such Cloud computing is the delivery of computing as a service rather than a product. Availability is the most important properties in Cloud computing. One of central issues in Cloud environment is to provide reliable Infrastructure as a service (IaaS) with optimal availability. Since the resources or nodes become larger, increasingly dynamic and heterogeneous, the potential for failures in the systems is a significant disruptive factor. This paper proposes the twin co-existance neighbourhood (TCeN) model. It focuses on improving high availability in which it predicts future availability expectation of interdependent environment in a distributed system over an extended period of time. With less complexity, this model not only theoretical sound but also feasible for practical implementation in real environment, this technique is very cost effective with less complexity compare to other techniques. The performance results show TCeN availability outperformed the Double-replica technique(DRT) with 50% less in-term of storage overhead. Moreover, results show TCeN availability outperforms the Double-replica technique (DRT) up to 14.2% with less overhead


soft computing | 2016

Cluster Validation Analysis on Attribute Relative of Soft-Set Theory

Rabiei Mamat; Ahmad Shukri Mohd Noor; Tutut Herawan; Mustafa Mat Deris

Data clustering on categorical data pose a difficult challenge since there are no-inherent distance measures between data values. One of the approaches that can be used is by introducing a series of clustering attributes in the categorical data. By this approach, Maximum Total Attribute Relative (MTAR) technique that is based on the attribute relative of soft-set theory has been proposed and proved has better execution time as compared to other equivalent techniques that used the same approach. In this paper, the cluster validity analysis on the technique is explained and discussed. In this analysis, the validity of the clusters produced by MTAR technique is evaluated by the entropy measure using two standards dataset: Soybean (Small) and Zoo from University California at Irvine (UCI) repository. Results show that the clusters produce by MTAR technique have better entropy and improved the clusters validity up to 33%.


IDCS 2015 Proceedings of the 8th International Conference on Internet and Distributed Computing Systems - Volume 9258 | 2015

Review of Replication Techniques for Distributed Systems

Ahmad Shukri Mohd Noor; Nur Farhah Mat Zian; Mustafa Mat Deris; Tutut Herawan

Distributed systems primarily provide the access to data intensive computation through a wide range of interfaces. Due to the advances of the systems, the scales and complexity of the system have increased, causing faults are likely bound to happen leading into diverse faults and failure conditions. Therefore, fault tolerance has become a crucial property for distributed system in order to preserve its function correctly and available in the presence of faults. Replication techniques particularly concentrates on two fault tolerance manners; masking the failures on the fly as well as reconfiguring the systems in response. This paper presents a brief reviews on different replication techniques, such as Grid Configuration GC, Box-Shaped Grid BSG and Neighbor Replication on Grid NRG by comparing and formalizing its communication costs and availabilities analysis based on k-out-of-n model. Each of these techniques presents their own merits and demerits which form the subject matter of this review.


Journal of Computer Science | 2014

CIRCULAR NEIGHBOR REPLICATION

Ahmad Shukri Mohd Noor; Nur Farhah; Mat Zian; Yazid Md Saman

Distributed system rely on replication techniques t o tolerate data failure and site disconnection thus ensur-ing flexibility of the system so as to preser ve its dependability. The idea of replication is ro bust however practical implementation of the replication techniques is often rigid that would bring down system’s de-pendability and performance. This study intended to evaluate existing techniques and then develop a new technique which later will be compare d with the existing with the goal of to achieve better fault tolerance, dependability and performan ce in distributed systems. The new technique is constructed based on circular neighbor relationship and quorum-based protocol. The consistency and integrity of the replicated data that involved writ e and read operations on the replicas is ensured us ing Replica maintenance protocol. This techniques focus ed on synchronous solution as for its quorum execution or commitment protocol showed higher reliability and convenience to avoid conflicts compared to asynchronous solution.


Procedia Computer Science | 2013

Fail-stop Failure Recovery in Neighbor Replica Environment☆

Ahmad Shukri Mohd Noor; Mustafa Mat Deris

Abstract Failure recovery is a nontrivial property for current distributed systems. An autonomous failure recovery in a distributed system is the ability of a system to execute self-corrective action when an instance or a subset of the system becomes faulty. However, autonomous failure recovery in current large distributed system is a very complicated procedure and often complicated to implement. In order to achieve a high level of reliability and availability in current distributed environment,This paper presents an autonomous, self-configured fail-stop failure recovery model. This model utilized the advantages of the distributed neighbor replica technique (NRT). In this paper, the algorithm along with theoretical framework for autonomous failure recovery are illustrated. This paper propose a resource manager for optimal resource selection. In the event of a resource failure, the resource manager autonomously decide on a resource among a faulty resource neighbors and auto-reconfigure the system. This selection is based on certain reliability parameters or criteria. This paper also illustrates a prototype model implementation. The model also demonstrate that this model is theoretically sound with the ability to perform autonomous recovery smoothly by quickly reconfiguring its services upon detection of failure

Collaboration


Dive into the Ahmad Shukri Mohd Noor's collaboration.

Top Co-Authors

Avatar

Mustafa Mat Deris

Universiti Tun Hussein Onn Malaysia

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Yazid Md Saman

Universiti Malaysia Terengganu

View shared research outputs
Top Co-Authors

Avatar

Emma Ahmad Sirajudin

Universiti Malaysia Terengganu

View shared research outputs
Top Co-Authors

Avatar

Rabiei Mamat

Universiti Malaysia Terengganu

View shared research outputs
Top Co-Authors

Avatar

Aziz Ahmad

Universiti Malaysia Terengganu

View shared research outputs
Top Co-Authors

Avatar
Top Co-Authors

Avatar

Yazid Mohd Saman

Universiti Malaysia Terengganu

View shared research outputs
Top Co-Authors

Avatar

Adamu Abubakar

International Islamic University Malaysia

View shared research outputs
Top Co-Authors

Avatar

Farizah Yunus

Universiti Malaysia Terengganu

View shared research outputs
Researchain Logo
Decentralizing Knowledge