Mohammad Saleh
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Mohammad Saleh has a total of 20 co-authors. Here are the top co-authors by number of shared publications:
- Ali Jaoua
Computer Science and Engineering Department, College of Engineering, Qatar University, Doha, Qatar
4 shared publications - Khalid Abualsaud
Department of Computer Science and Engineering, Qatar University, Doha, Qatar
3 shared publications - Amr Mohamed
Qatar University
2 shared publications B. Boulifa
Qatar University, Qatar
2 shared publicationsBilel Boulifa
Qatar University, Qatar
2 shared publicationsI. M. Abu-Reesh
Qatar University, Qatar
2 shared publications
Latest Publications
- Open Access
- 26 September 2020
- Published by Academy and Industry Research Collaboration Center (AIRCC)
- p. 01-16
Evaluating the Impact of Different Types of Crossover and Selection Methods on the Convergence of 0/1 Knapsack using Genetic Algorithm
- 26 September 2020
- Published by Academy and Industry Research Collaboration Center (AIRCC)
- p. 01-16
Open AccessEvaluating the Impact of Different Types of Crossover and Selection Methods on the Convergence of 0/1 Knapsack using Genetic Algorithm
- Open Access
- 1 January 2015
- Published by Wiley in The Scientific World Journal
- Vol. 2015 (1) , 945689
Ensemble Classifier for Epileptic Seizure Detection for Imperfect EEG Data
Brain status information is captured by physiological electroencephalogram (EEG) signals, which are extensively used to study different brain activities. This study investigates the use of a new ensemble classifier to detect an epileptic seizure from compressed and noisy EEG signals. This noise‐aware signal combination (NSC) ensemble classifier combines four classification models based on their individual performance. The main objective of the proposed classifier is to enhance the classification accuracy in the presence of noisy and incomplete information while preserving a reasonable amount of complexity. The experimental results show the effectiveness of the NSC technique, which yields higher accuracies of 90% for noiseless data compared with 85%, 85.9%, and 89.5% in other experiments. The accuracy for the proposed method is 80% when SNR = 1 dB, 84% when SNR = 5 dB, and 88% when SNR = 10 dB, while the compression ratio (CR) is 85.35% for all of the datasets mentioned.
- 1 January 2015
- Published by Wiley in The Scientific World Journal
- Vol. 2015 (1) , 945689
Open AccessEnsemble Classifier for Epileptic Seizure Detection for Imperfect EEG Data
Brain status information is captured by physiological electroencephalogram (EEG) signals, which are extensively used to study different brain activities. This study investigates the use of a new ensemble classifier to detect an epileptic seizure from compressed and noisy EEG signals. This noise‐aware signal combination (NSC) ensemble classifier combines four classification models based on their individual performance. The main objective of the proposed classifier is to enhance the classification accuracy in the presence of noisy and incomplete information while preserving a reasonable amount of complexity. The experimental results show the effectiveness of the NSC technique, which yields higher accuracies of 90% for noiseless data compared with 85%, 85.9%, and 89.5% in other experiments. The accuracy for the proposed method is 80% when SNR = 1 dB, 84% when SNR = 5 dB, and 88% when SNR = 10 dB, while the compression ratio (CR) is 85.35% for all of the datasets mentioned.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7 (21615322) , 633-639
Performance Comparison of classification algorithms for EEG-based remote epileptic seizure detection in Wireless Sensor Networks
Identification of epileptic seizure remotely by analyzing the electroencephalography (EEG) signal is very important for scalable sensor-based health systems. Classification is the most important technique for wide-ranging applications to categorize the items according to its features with respect to predefined set of classes. In this paper, we conduct a performance evaluation based on the noiseless and noisy EEG-based epileptic seizure data using various classification algorithms including BayesNet, DecisionTable, IBK, J48/C4.5, and VFI. The reconstructed and noisy EEG data are decomposed with discrete cosine transform into several sub-bands. In addition, some of statistical features are extracted from the wavelet coefficients to represent the whole EEG data inputs into the classifiers. Benchmark on widely used dataset is utilized for automatic epileptic seizure detection including both normal and epileptic EEG datasets. The classification accuracy results confirm that the selected classifiers have greater potentiality to identify the noisy epileptic disorders.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 7 (21615322) , 633-639
Performance Comparison of classification algorithms for EEG-based remote epileptic seizure detection in Wireless Sensor Networks
Identification of epileptic seizure remotely by analyzing the electroencephalography (EEG) signal is very important for scalable sensor-based health systems. Classification is the most important technique for wide-ranging applications to categorize the items according to its features with respect to predefined set of classes. In this paper, we conduct a performance evaluation based on the noiseless and noisy EEG-based epileptic seizure data using various classification algorithms including BayesNet, DecisionTable, IBK, J48/C4.5, and VFI. The reconstructed and noisy EEG data are decomposed with discrete cosine transform into several sub-bands. In addition, some of statistical features are extracted from the wavelet coefficients to represent the whole EEG data inputs into the classifiers. Benchmark on widely used dataset is utilized for automatic epileptic seizure detection including both normal and epileptic EEG datasets. The classification accuracy results confirm that the selected classifiers have greater potentiality to identify the noisy epileptic disorders.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 647-651
ConProve: A conceptual prover system
ConProve is an automated prover for propositional logic. It takes, as an input, a set of propositional formulas and proves whether a goal holds or not. ConProve converts each formula to its corresponding Truth Table Binary Relation (TTBR) considered also as a formal context (FC). The objects in FC correspond to all possible formulas interpretations (in terms of their truth value assignments), and the properties in FC correspond to the terms. When the function the 'BuildContext' function, ConProve starts the new goal proving. Firstly, it adds the goal negation to the set of formulas and constructs the formal contexts (FCs) relating formulas to terms. Secondly, it makes the FCs grouping and deduces, based on the conceptual reasoning, if the goal holds. The tool offers a user-friendly interface allowing the editing of the set of formulas as well as the visualization of the reasoning steps. Besides the tool, the paper illustrates the importance of the conceptual reasoning in deriving new conclusions as well as in discovering new, possibly implications by applying the extended Galois Connection.
- 1 November 2014
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 647-651
ConProve: A conceptual prover system
ConProve is an automated prover for propositional logic. It takes, as an input, a set of propositional formulas and proves whether a goal holds or not. ConProve converts each formula to its corresponding Truth Table Binary Relation (TTBR) considered also as a formal context (FC). The objects in FC correspond to all possible formulas interpretations (in terms of their truth value assignments), and the properties in FC correspond to the terms. When the function the 'BuildContext' function, ConProve starts the new goal proving. Firstly, it adds the goal negation to the set of formulas and constructs the formal contexts (FCs) relating formulas to terms. Secondly, it makes the FCs grouping and deduces, based on the conceptual reasoning, if the goal holds. The tool offers a user-friendly interface allowing the editing of the set of formulas as well as the visualization of the reasoning steps. Besides the tool, the paper illustrates the importance of the conceptual reasoning in deriving new conclusions as well as in discovering new, possibly implications by applying the extended Galois Connection.
- 1 March 2014
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 83 (2) , 180-193
Inference engine based on closure and join operators over Truth Table Binary Relations
- 1 March 2014
- Published by Elsevier in Journal of Logical and Algebraic Methods in Programming
- Vol. 83 (2) , 180-193
Inference engine based on closure and join operators over Truth Table Binary Relations
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 222-227
Fault tolerant approach for verified software: Case of natural gas purification simulator
Well logically verified and tested software may fail because of undesired physical phenomena provoking transient faults during its execution. While being the most frequent kind of faults, transient faults are difficult to localize because they have a very short life, but they may cause the failure of software. A fault tolerant method against transient faults under the hypothesis of statically verified software is presented. In order to ensure the right experimental environment, first the specification of the application is validated by Alloy analyzer, second a JML annotated Java code is statically verified. The proposed approach is based on some rules transforming basic Java statements like assignments, conditional and iterative statements into equivalent fault tolerant ones. The current research has exhibited some natural redundancy in any code, and the corrective power of repetitive statements. It also proved that the proposed method makes more efficient fault tolerant versions compared with natural error recovery, i.e. without inserting any additional code for detecting or repairing the damaged state. Illustrated by Gas purification simulator, one can see the natural error recovery in case of fault injection in the code, and how fault tolerant rules recover more errors in less time compared to the natural recovery. The proposed approach is preventive because it avoids the propagation of errors at early stages by repeating low level statements until some “stability” of their behavior.
- 1 October 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 222-227
Fault tolerant approach for verified software: Case of natural gas purification simulator
Well logically verified and tested software may fail because of undesired physical phenomena provoking transient faults during its execution. While being the most frequent kind of faults, transient faults are difficult to localize because they have a very short life, but they may cause the failure of software. A fault tolerant method against transient faults under the hypothesis of statically verified software is presented. In order to ensure the right experimental environment, first the specification of the application is validated by Alloy analyzer, second a JML annotated Java code is statically verified. The proposed approach is based on some rules transforming basic Java statements like assignments, conditional and iterative statements into equivalent fault tolerant ones. The current research has exhibited some natural redundancy in any code, and the corrective power of repetitive statements. It also proved that the proposed method makes more efficient fault tolerant versions compared with natural error recovery, i.e. without inserting any additional code for detecting or repairing the damaged state. Illustrated by Gas purification simulator, one can see the natural error recovery in case of fault injection in the code, and how fault tolerant rules recover more errors in less time compared to the natural recovery. The proposed approach is preventive because it avoids the propagation of errors at early stages by repeating low level statements until some “stability” of their behavior.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (23270586) , 279-282
Natural fault tolerance in the context of a goal oriented software design
A particular goal oriented software design is proposed in this paper: by checking the preservation of critical information, an original proposed program structure has the important property to naturally recover transient faults minimizing time complexity overhead. As a matter of fact, experimental evidence in the case of natural gas purification shows that as structured the software recovers naturally from transient faults.
- 1 May 2013
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- Vol. 3 (23270586) , 279-282
Natural fault tolerance in the context of a goal oriented software design
A particular goal oriented software design is proposed in this paper: by checking the preservation of critical information, an original proposed program structure has the important property to naturally recover transient faults minimizing time complexity overhead. As a matter of fact, experimental evidence in the case of natural gas purification shows that as structured the software recovers naturally from transient faults.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 748-753
Distributed iSCSI protocol over Hypervisor Storage on Local Area Network
Internet Small Computer System Interface (iSCSI) is a protocol that can run on a TCP/IP transport layer in order to transfer SCSI commands to allow block-level access on storage devices which is standardized by IETF. Hypervisor Storage is the storage abstraction layer on Virtual Machines. This paper examines the performance of iSCSI protocol implementation accessing Hypervisor Storage in Virtual Machine's (guest OS) over Gigabit Ethernet Local Area Network (GE-LAN). The results of this experiment are benchmark with results that we obtained from a Network Attached Storage (NAS) Server using CIFS/SMB protocol running on the Hypervisor Storage and results obtained from local access on virtual machines. We found that iSCSI has low throughput, heavy utilization of CPU, and high I/O latency compared to CIFS/SMB Protocol on NAS and local virtual disk access results which are significantly similar.
- 1 December 2009
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 748-753
Distributed iSCSI protocol over Hypervisor Storage on Local Area Network
Internet Small Computer System Interface (iSCSI) is a protocol that can run on a TCP/IP transport layer in order to transfer SCSI commands to allow block-level access on storage devices which is standardized by IETF. Hypervisor Storage is the storage abstraction layer on Virtual Machines. This paper examines the performance of iSCSI protocol implementation accessing Hypervisor Storage in Virtual Machine's (guest OS) over Gigabit Ethernet Local Area Network (GE-LAN). The results of this experiment are benchmark with results that we obtained from a Network Attached Storage (NAS) Server using CIFS/SMB protocol running on the Hypervisor Storage and results obtained from local access on virtual machines. We found that iSCSI has low throughput, heavy utilization of CPU, and high I/O latency compared to CIFS/SMB Protocol on NAS and local virtual disk access results which are significantly similar.
- Open Access
- 1 September 2008
- Published by Science Publications in Journal of Computer Science
- Vol. 4 (9) , 721-728
Impact of MD5 Authentication on Routing Traffic for the Case of: EIGRP, RIPv2 and OSPF
Impact of MD5 Authentication on Routing Traffic for the Case of: EIGRP, RIPv2 and OSPF
- 1 September 2008
- Published by Science Publications in Journal of Computer Science
- Vol. 4 (9) , 721-728
Open AccessImpact of MD5 Authentication on Routing Traffic for the Case of: EIGRP, RIPv2 and OSPF
Impact of MD5 Authentication on Routing Traffic for the Case of: EIGRP, RIPv2 and OSPF
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 815-819
Efficient Hierarchical Diff-EDF schedulability for QoS packet networks
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in packet networks by the use of proper packet scheduling algorithms. In this paper, we propose a new priority assignment scheduling algorithm, hierarchal diff-EDF (differentiate earliest deadline first), which can meet the real-time needs of such applications while continuing to provide best effort service to non-real time traffic. The hierarchal diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. The simulation results show that the hierarchical diff-EDF achieved the minimum packet miss ratio when compared with both EDF and diff-EDF schedulers.
- 1 March 2008
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 815-819
Efficient Hierarchical Diff-EDF schedulability for QoS packet networks
Packet networks are currently enabling the integration of traffic with a wide range of characteristics that extend from video traffic with stringent QoS requirements to the best-effort traffic requiring no guarantees. QoS guarantees can be provided in packet networks by the use of proper packet scheduling algorithms. In this paper, we propose a new priority assignment scheduling algorithm, hierarchal diff-EDF (differentiate earliest deadline first), which can meet the real-time needs of such applications while continuing to provide best effort service to non-real time traffic. The hierarchal diff-EDF features a feedback control mechanism that detects overload conditions and modifies packet priority assignments accordingly. The simulation results show that the hierarchical diff-EDF achieved the minimum packet miss ratio when compared with both EDF and diff-EDF schedulers.