Samer Nofal

Dr. Samer Nofal

Computer Science, German Jordanian University, Amman, Al ‘Āşimah, Jordan
+1
orcid

Research Focus & Metrics

Academic Career Length

9Years (2018-Present)

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

Representative Publications

View All Publications
28 December 2018 in IEEE Access
Verified
Journal Article
Open access
IHIsmail Ismail Hababeh
Ismail Ismail Hababeh
AGAmmar Gharaibeh
Ammar Gharaibeh
Samer NofalSamer Nofal
Samer Nofal
IKIssa Khalil
Issa Khalil

2 July 2021 in Water Supply
Verified
Journal Article
Open access
PDF file
Samer NofalSamer Nofal
Samer Nofal
AAAbdullah Alfarrarjeh
Abdullah Alfarrarjeh
AJAmani Abu Jabal
Amani Abu Jabal
We present a use case of anomaly detection for identifying the unusual water consumption of consumers. Unusual water consumption may be due to a faulty water meter, fraudulent tampering with a water meter, or a leak in the water pipes within the consumer's property. We apply several anomaly detection methods to a real dataset of 22,877 mechanical water meters located in Amman, the capital city of Jordan. The dataset is unlabeled such that no discrimination is given for any meter whether it records a normal water consumption or not. The objective of this study is to test the hypothesis that abnormal water consumption (registered by a given water meter) can be identified based on previous records of water consumption measured by the same meter. We tested our hypothesis using well-known anomaly detection methods, namely: z-score (zs), local outlier factor (lof), density-based spatial clustering of applications with noise (dbscan), minimum covariance determinant (mcd), one-class support vector machine (ocsvm), and isolation forest (forest). In the settings of our experiments, we observed that zs, lof, ocsvm and forest support our hypothesis, contrasting with dbscan and mcd.

6 September 2023 in Heliyon
Verified
Journal Article
Open access
Samer NofalSamer Nofal
Samer Nofal
In exceptional times of wars, natural crises (e.g., snow storms), or hosting massive events (e.g., international sports events), prior knowledge of hour-by-hour electricity demand might become critical for the concerned areas. Anticipating the next-hour demand within a bounded location might help cope with challenging situations. In this paper, we are concerned with the problem of electricity demand forecasting for the next hour within a small area in the context of the country of Jordan relying exclusively on historical electricity consumption. Existing electricity demand forecasting models predict electricity demand for the next day for the whole country of Jordan or for large cities using numerous indicators such as weather conditions and season-related features, together with historical electricity consumption. Our proposed solution consists of preprocessing the hourly-electricity-consumption data to rearrange it into time series of 25-hour length. Then, we applied supervised machine learning algorithms to build predictive models for electricity demand. Our methods proved effective to a certain degree in forecasting electricity demand using time series of historical electricity consumptions only. We employ several predictive machine learning models: neural network, decision tree, random forest, AdaBoost, support vector regression, nearest neighbors, linear regression, bayesian ridge, partial least squares, gradient boosting, and principal component regression. We found that the most critical indicators in our predictive models are the electricity consumption of the two hours preceding the target hour and the electricity consumption the day before in the hour (the same as the target hour) and the next hour. Our predictive models can efficiently forecast electricity demand in a small rural area in Jordan with an accuracy of nearly 97% at best and 92% at least. Our predictive models are constructed using historical data that includes the electricity consumption of a small Jordanian district for the years 2019–2021.

7 May 2024 in Scientific Reports
Verified
Journal Article
Open access
PDF file
Samer NofalSamer Nofal
Samer Nofal
We investigate if the vehicle travel time after 6 h on a given street can be predicted, provided the hourly vehicle travel time on the street in the last 19 h. Likewise, we examine if the traffic status (i.e., low, mild, or high) after 6 h on a given street can be predicted, provided the hourly traffic status of the street in the last 19 h. To pursue our objectives, we exploited historical hourly traffic data from Google Maps for a main street in the capital city of Jordan, Amman. We employ several machine learning algorithms to construct our predictive models: neural networks, gradient boosting, support vector machines, AdaBoost, and nearest neighbors. Our experimental results confirm our investigations positively, such that our models have an accuracy of around 98–99% in predicting vehicle travel time and traffic status on our study’s street for the target hour (i.e., after 6 h from a specific point in time). Moreover, given our time series traffic data and our constructed predictive models, we inspect the most critical indicators of street traffic status and vehicle travel time after 6 h on our study’s street. However, as we elaborate in the article, our predictive models do not agree on the degree of importance of our data features.

1 March 2023 in Cybernetics and Information Technologies
Verified
Journal Article
Open access
PDF file
IHIsmail Ismail Hababeh
Ismail Ismail Hababeh
IKIssa Khalil
Issa Khalil
RARizik Al-Sayyed
Rizik Al-Sayyed
MMMahmoud Moshref
Mahmoud Moshref
Samer NofalSamer Nofal
Samer Nofal
ARAli Rodan
Ali Rodan
Clock synchronization in the Mac layer plays a vital role in wireless sensor network communication that maintains time-based channel sharing and offers a uniform timeframe among different network nodes. Most wireless sensor networks are distributed where no common clock exists among them. Therefore, joint actions are realized by exchanging messages, with time stamps using local sensor clocks. These clocks can easily drift seconds and cause functional problems to the applications that depend on time synchronization. Time synchronization is a major and challenging factor in wireless sensor networks that needs to be studied and explored. In this paper, we propose integrated time synchronization protocols that serve wireless sensor network applications under normal, secured, and unreliable environments. The proposed protocols are discussed and evaluated based on their accuracy, cost, hierarchy, reliability, and security. Simulation results show that the proposed time synchronization protocols outperform the state-of-the-art techniques in achieving a minimum synchronization time.

1 January 2024 in AIMS Mathematics
Verified
Journal Article
Open access
PDF file
Samer NofalSamer Nofal
Samer Nofal
A satisfactory partition is a partition of undirected-graph vertices such that the partition has only two nonempty parts, and every vertex has at least as many adjacent vertices in its part as it has in the other part. Generally, the problem of determining whether a given undirected graph has a satisfactory partition is known to be NP-complete. In this paper, we show that for a given undirected graph with $ n $ vertices, a satisfactory partition (if any exists) can be computed recursively with a recursion tree of depth of $ \mathcal{O}(\ln n) $ in expectation. Subsequently, we show that a satisfactory partition for those undirected graphs with recursion tree depth meeting the expectation can be computed in time $ \mathcal{O}(n^{3} 2^{\mathcal{O}(\ln n)}) $.