Norhafiza Hamzah

Norhafiza Hamzah

Auto-generated profile, based on publicly available information

Norhafiza Hamzah

Mathematics, Graphics and Visualization Research Group (M-GRAVS), Faculty of Science and Natural Resources, Universiti Malaysia Sabah, 88450 Kota Kinabalu, Sabah, Malaysia

Research Focus & Metrics

Academic Career Length

17Years (2010-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
1 November 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
FDF Durin
F Durin
RLR Lee
R Lee
ABA Bade
A Bade
COC K On
C K On
NHN Hamzah
N Hamzah
Gamification is the use of game elements in a non-gaming environments. The aims of implementing game elements in gamifying educational environment is to make the learners engaged and motivated in the learning process. But, some of the research result giving bad impacts in implementing gamification in education. The objective of this research is to study the impact of implementing game elements in education. The aim of this research is to study which game elements is most commonly used in gamifying educational environment. The study is done by reviewing previous research on impacts of implementing game element in education from 2008 until 2018 to see whether the elements giving positive or negative impacts on education. The results shows the most common game elements used in gamification is rewards, feedback, challenge, quest/mission/goal, level/stage, point/score, avatars/players, task, character, time-limit, narrative/dialogue, leaderboards, progress bars, and badges. Majority of the research on gamification in education reports positive impacts by introducing gamification in education. In conclusion, by implementing game elements in the gamifying educational environment is a good method to create a good adjustment in learners’ behavior and assertiveness in the learning process, it can develop engagement and motivation of the learners’.

1 April 2010
Verified
Conference Paper
Closed access
NANorma Alias
Norma Alias
NSNoriza Satam
Noriza Satam
RDRoziha Darwis
Roziha Darwis
NHNorhafiza Hamzah
Norhafiza Hamzah
ZGZarith Safiza Abd. Ghaffar
Zarith Safiza Abd. Ghaffar
This article has been retracted by the publisher.

1 November 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
NHNorhafiza Hamzah
Norhafiza Hamzah
NANorma Alias
Norma Alias
SWSyamshiyatul Abdul Wahab
Syamshiyatul Abdul Wahab
ZOZ Ali Omar
Z Ali Omar
The inaccurate prediction of tumour is because of the 2D images do not present the complete natural tumour representation as in 3D visualization. In order to construct the 3D model, the contour of 2D MRI images must be merged together. In this work, the edge detection of brain tumour on 2D images is done using the Geodesic Active Contour (GAC) model based on Additive Operator Splitting (AOS), then 3D model is visualized using Image Manifold (IM) and Volume Estimation (VE) methods. The comparison of performance for both methods is calculated. In conclusion, the execution time for VE method is higher than IM method since more images are used in VE method to calculate the volume of the tumour accurately. In terms of iteration number, Volume Estimation has a higher number of iterations, but for error and root mean square error, both methods have roughly the same value.

1 November 2019 in Journal of Physics: Conference Series
Verified
Conference Paper
Open access
PDF file
ZOZaturrawiah Ali Omar
Zaturrawiah Ali Omar
SCSu Na Chin
Su Na Chin
NHNorhafiza Hamzah
Norhafiza Hamzah
FYFouziah Yassin
Fouziah Yassin
Analysing data can be quite a challenge sometimes due to the nature of the data and the vast options of methods and techniques that can be used on the data. In this study, for example, a six years Cleft Lip and Palate dataset were gathered on these patients’ conditions in the quest to identify the contributing factors for a successful pre-graft orthodontic treatment. The challenges faced was in the small number of datasets and imbalance sample class. Therefore, this study had taken a step back and tried to approach the dataset with a combination of unsupervised and supervised learning methods to tackle the challenges by incorporating clustering - for testing records creation and; resampling - for balancing sample class. We also observed if the auto-created testing records are replaceable with the manually selected testing records by looking at the performances of the classification models. Based on the feature that was selected, k-Means and PAM were implemented as the clustering algorithm using the Euclidean formula as the distance measure. Resampling was done using SMOTE and Random Forest as the classification model. When the comparison was done on the models, the ones that were fed by resampled training records showed an increase in the AUC values and decrease in the OOB error. Comparable results were also achieved between the training records produced by PAM and by manual selection as both models, based on the AUC values, was classified as excellent classification models.

1 June 2011
Verified
Conference Paper
Closed access
NANorma Alias
Norma Alias
RARasiya Anwar
Rasiya Anwar
CTChe Rahim Che Teh
Che Rahim Che Teh
NSNoriza Satam
Noriza Satam
NHNorhafiza Hamzah
Norhafiza Hamzah
Md. Rajibul IslamMd. Rajibul Islam
Md. Rajibul Islam
Parabolic Partial Differential Equations (PDE) are well suited to multiprocessor implementation. However, the performance of a parallel program can be damaged by the mismatches between the parallelism available in the application and that available in the architecture. Communication cost, memory requirements, execution time, implementation cost, and others from a problem specific function should be considered to estimate a parallel program. In this paper, we present an optimizing technique called granularity analysis to evaluate the parallel algorithms particularly AGE families without degrading the performances. The resultant granularity analysis scheme is appropriate for developing adaptive parallelism of declarative programming languages on multiprocessors. The results recommend that the proposed method can be used for performance estimation of parallel programs. Red Black Gauss Seidel (GSRB) is selected as the benchmark for the differences numerical methods.

1 January 2010
Verified
Conference Paper
Closed access
NANorma Alias
Norma Alias
NHNorhafiza Hamzah
Norhafiza Hamzah
NANorsarahaida S. Amin
Norsarahaida S. Amin
RDRoziha Darwis
Roziha Darwis
NSNoriza Satam
Noriza Satam
ZGZarith Safiza Abdul Ghaffar
Zarith Safiza Abdul Ghaffar
In this paper, we present iterative schemes, specifically the conjugate gradient, and Gauss Seidel red-black (GSRB) and direct schemes namely LU factorization and Gauss elimination for Keller-box scheme. The aim of this paper is to offer reasonable assessments and contrasts on behalf of the numerical experiments of these two schemes ported to run through Parallel Virtual Machine (PVM) on distributed memory platform. The computational complexity also presented for the comparison purpose, and the graphs of parallel evaluation in terms of speedup, efficiency, effectiveness and temporal performance are presented as well.