Noreen Jamil
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Noreen Jamil has a total of 26 co-authors. Here are the top co-authors by number of shared publications:
- Muhammad Asif Naeem
National University of Computer and Emerging Sciences
4 shared publications M. Asif Naeem
Department of Computer Science, National University of Computer & Emerging Sciences, Islamabad, Pakistan
3 shared publicationsFarhaan Mirza
Auckland University of Technology, Auckland, New Zealand
2 shared publications- Habib Ullah Khan
Department of Accounting and Information Systems, College of Business and Economics, Qatar University, Doha, Qatar
2 shared publications Amira Khattak
Prince Sultan University, Riyadh, Saudi Arabia
1 shared publicationAsif Mansoor
National University of science and Technology
1 shared publication
Latest Publications
- Open Access
- 17 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-8
Complexity of Deep Convolutional Neural Networks in Mobile Computing
Neural networks employ massive interconnection of simple computing units called neurons to compute the problems that are highly nonlinear and could not be hard coded into a program. These neural networks are computation-intensive, and training them requires a lot of training data. Each training example requires heavy computations. We look at different ways in which we can reduce the heavy computation requirement and possibly make them work on mobile devices. In this paper, we survey various techniques that can be matched and combined in order to improve the training time of neural networks. Additionally, we also review some extra recommendations to make the process work for mobile devices as well. We finally survey deep compression technique that tries to solve the problem by network pruning, quantization, and encoding the network weights. Deep compression reduces the time required for training the network by first pruning the irrelevant connections, i.e., the pruning stage, which is then followed by quantizing the network weights via choosing centroids for each layer. Finally, at the third stage, it employs Huffman encoding algorithm to deal with the storage issue of the remaining weights.
- 17 September 2020
- Published by Wiley in Complexity
- Vol. 2020, 1-8
Open AccessComplexity of Deep Convolutional Neural Networks in Mobile Computing
Neural networks employ massive interconnection of simple computing units called neurons to compute the problems that are highly nonlinear and could not be hard coded into a program. These neural networks are computation-intensive, and training them requires a lot of training data. Each training example requires heavy computations. We look at different ways in which we can reduce the heavy computation requirement and possibly make them work on mobile devices. In this paper, we survey various techniques that can be matched and combined in order to improve the training time of neural networks. Additionally, we also review some extra recommendations to make the process work for mobile devices as well. We finally survey deep compression technique that tries to solve the problem by network pruning, quantization, and encoding the network weights. Deep compression reduces the time required for training the network by first pruning the irrelevant connections, i.e., the pruning stage, which is then followed by quantizing the network weights via choosing centroids for each layer. Finally, at the third stage, it employs Huffman encoding algorithm to deal with the storage issue of the remaining weights.
- Open Access
- 25 August 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-12
Deep Learning Algorithm for Brain-Computer Interface
Electroencephalography-(EEG-) based control is a noninvasive technique which employs brain signals to control electrical devices/circuits. Currently, the brain-computer interface (BCI) systems provide two types of signals, raw signals and logic state signals. The latter signals are used to turn on/off the devices. In this paper, the capabilities of BCI systems are explored, and a survey is conducted how to extend and enhance the reliability and accuracy of the BCI systems. A structured overview was provided which consists of the data acquisition, feature extraction, and classification algorithm methods used by different researchers in the past few years. Some classification algorithms for EEG-based BCI systems are adaptive classifiers, tensor classifiers, transfer learning approach, and deep learning, as well as some miscellaneous techniques. Based on our assessment, we generally concluded that, through adaptive classifiers, accurate results are acquired as compared to the static classification techniques. Deep learning techniques were developed to achieve the desired objectives and their real-time implementation as compared to other algorithms.
- 25 August 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-12
Open AccessDeep Learning Algorithm for Brain-Computer Interface
Electroencephalography-(EEG-) based control is a noninvasive technique which employs brain signals to control electrical devices/circuits. Currently, the brain-computer interface (BCI) systems provide two types of signals, raw signals and logic state signals. The latter signals are used to turn on/off the devices. In this paper, the capabilities of BCI systems are explored, and a survey is conducted how to extend and enhance the reliability and accuracy of the BCI systems. A structured overview was provided which consists of the data acquisition, feature extraction, and classification algorithm methods used by different researchers in the past few years. Some classification algorithms for EEG-based BCI systems are adaptive classifiers, tensor classifiers, transfer learning approach, and deep learning, as well as some miscellaneous techniques. Based on our assessment, we generally concluded that, through adaptive classifiers, accurate results are acquired as compared to the static classification techniques. Deep learning techniques were developed to achieve the desired objectives and their real-time implementation as compared to other algorithms.
- Open Access
- 12 August 2020
- Published by MDPI AG in Electronics
- Vol. 9 (8) , 1299
Parallelisation of a Cache-Based Stream-Relation Join for a Near-Real-Time Data Warehouse
Near real-time data warehousing is an important area of research, as business organisations want to analyse their businesses sales with minimal latency. Therefore, sales data generated by data sources need to reflect immediately in the data warehouse. This requires near-real-time transformation of the stream of sales data with a disk-based relation called master data in the staging area. For this purpose, a stream-relation join is required. The main problem in stream-relation joins is the different nature of inputs; stream data is fast and bursty, whereas the disk-based relation is slow due to high disk I/O cost. To resolve this problem, a famous algorithm CACHEJOIN (cache join) was published in the literature. The algorithm has two phases, the disk-probing phase and the stream-probing phase. These two phases execute sequentially; that means stream tuples wait unnecessarily due to the sequential execution of both phases. This limits the algorithm to exploiting CPU resources optimally. In this paper, we address this issue by presenting a robust algorithm called PCSRJ (parallelised cache-based stream relation join). The new algorithm enables the execution of both disk-probing and stream-probing phases of CACHEJOIN in parallel. The algorithm distributes the disk-based relation on two separate nodes and enables parallel execution of CACHEJOIN on each node. The algorithm also implements a strategy of splitting the stream data on each node depending on the relevant part of the relation. We developed a cost model for PCSRJ and validated it empirically. We compared the service rates of both algorithms using a synthetic dataset. Our experiments showed that PCSRJ significantly outperforms CACHEJOIN.
- 12 August 2020
- Published by MDPI AG in Electronics
- Vol. 9 (8) , 1299
Open AccessParallelisation of a Cache-Based Stream-Relation Join for a Near-Real-Time Data Warehouse
Near real-time data warehousing is an important area of research, as business organisations want to analyse their businesses sales with minimal latency. Therefore, sales data generated by data sources need to reflect immediately in the data warehouse. This requires near-real-time transformation of the stream of sales data with a disk-based relation called master data in the staging area. For this purpose, a stream-relation join is required. The main problem in stream-relation joins is the different nature of inputs; stream data is fast and bursty, whereas the disk-based relation is slow due to high disk I/O cost. To resolve this problem, a famous algorithm CACHEJOIN (cache join) was published in the literature. The algorithm has two phases, the disk-probing phase and the stream-probing phase. These two phases execute sequentially; that means stream tuples wait unnecessarily due to the sequential execution of both phases. This limits the algorithm to exploiting CPU resources optimally. In this paper, we address this issue by presenting a robust algorithm called PCSRJ (parallelised cache-based stream relation join). The new algorithm enables the execution of both disk-probing and stream-probing phases of CACHEJOIN in parallel. The algorithm distributes the disk-based relation on two separate nodes and enables parallel execution of CACHEJOIN on each node. The algorithm also implements a strategy of splitting the stream data on each node depending on the relevant part of the relation. We developed a cost model for PCSRJ and validated it empirically. We compared the service rates of both algorithms using a synthetic dataset. Our experiments showed that PCSRJ significantly outperforms CACHEJOIN.
- Open Access
- 4 July 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-9
Data Analytics in Mental Healthcare
Worldwide, about 700 million people are estimated to suffer from mental illnesses. In recent years, due to the extensive growth rate in mental disorders, it is essential to better understand the inadequate outcomes from mental health problems. Mental health research is challenging given the perceived limitations of ethical principles such as the protection of autonomy, consent, threat, and damage. In this survey, we aimed to investigate studies where big data approaches were used in mental illness and treatment. Firstly, different types of mental illness, for instance, bipolar disorder, depression, and personality disorders, are discussed. The effects of mental health on user’s behavior such as suicide and drug addiction are highlighted. A description of the methodologies and tools is presented to predict the mental condition of the patient under the supervision of artificial intelligence and machine learning.
- 4 July 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-9
Open AccessData Analytics in Mental Healthcare
Worldwide, about 700 million people are estimated to suffer from mental illnesses. In recent years, due to the extensive growth rate in mental disorders, it is essential to better understand the inadequate outcomes from mental health problems. Mental health research is challenging given the perceived limitations of ethical principles such as the protection of autonomy, consent, threat, and damage. In this survey, we aimed to investigate studies where big data approaches were used in mental illness and treatment. Firstly, different types of mental illness, for instance, bipolar disorder, depression, and personality disorders, are discussed. The effects of mental health on user’s behavior such as suicide and drug addiction are highlighted. A description of the methodologies and tools is presented to predict the mental condition of the patient under the supervision of artificial intelligence and machine learning.
- Open Access
- 31 May 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-9
Evaluating Encryption Algorithms for Sensitive Data Using Different Storage Devices
Sensitive data need to be protected from being stolen and read by unauthorized persons regardless of whether the data are stored in hard drives, flash memory, laptops, desktops, and other storage devices. In an enterprise environment where sensitive data is stored on storage devices, such as financial or military data, encryption is used in the storage device to ensure data confidentiality. Nowadays, the SSD-based NAND storage devices are favored over HDD and SSHD to store data because they offer increased performance and reduced access latency to the client. In this paper, the performance of different symmetric encryption algorithms is evaluated on HDD, SSHD, and SSD-based NAND MLC flash memory using two different storage encryption software. Based on the experiments we carried out, Advanced Encryption Standard (AES) algorithm on HDD outperforms Serpent and Twofish algorithms in terms of random read speed and write speed (both sequentially and randomly), whereas Twofish algorithm is slightly faster than AES in sequential reading on SSHD and SSD-based NAND MLC flash memory. By conducting full range of evaluative tests across HDD, SSHD, and SSD, our experimental results can give better idea for the storage consumers to determine which kind of storage device and encryption algorithm is suitable for their purposes. This will give them an opportunity to continuously achieve the best performance of the storage device and secure their sensitive data.
- 31 May 2020
- Published by Wiley in Scientific Programming
- Vol. 2020, 1-9
Open AccessEvaluating Encryption Algorithms for Sensitive Data Using Different Storage Devices
Sensitive data need to be protected from being stolen and read by unauthorized persons regardless of whether the data are stored in hard drives, flash memory, laptops, desktops, and other storage devices. In an enterprise environment where sensitive data is stored on storage devices, such as financial or military data, encryption is used in the storage device to ensure data confidentiality. Nowadays, the SSD-based NAND storage devices are favored over HDD and SSHD to store data because they offer increased performance and reduced access latency to the client. In this paper, the performance of different symmetric encryption algorithms is evaluated on HDD, SSHD, and SSD-based NAND MLC flash memory using two different storage encryption software. Based on the experiments we carried out, Advanced Encryption Standard (AES) algorithm on HDD outperforms Serpent and Twofish algorithms in terms of random read speed and write speed (both sequentially and randomly), whereas Twofish algorithm is slightly faster than AES in sequential reading on SSHD and SSD-based NAND MLC flash memory. By conducting full range of evaluative tests across HDD, SSHD, and SSD, our experimental results can give better idea for the storage consumers to determine which kind of storage device and encryption algorithm is suitable for their purposes. This will give them an opportunity to continuously achieve the best performance of the storage device and secure their sensitive data.
- Open Access
Optimizing Semi-Stream CACHEJOIN for Near-Real-Time Data Warehousing
Streaming data join is a critical process in the field of near-real-time data warehousing. For this purpose, an adaptive semi-stream join algorithm called CACHEJOIN (Cache Join) focusing non-uniform stream data is provided in the literature. However, this algorithm cannot exploit the memory and CPU resources optimally and consequently it leaves its service rate suboptimal due to sequential execution of both of its phases, called stream-probing (SP) phase and disk-probing (DP) phase. By integrating the advantages of CACHEJOIN, in this paper we present two modifications in it. First is called P-CACHEJOIN (Parallel Cache Join) that enables the parallel processing of two phases in CACHEJOIN. This increases number of joined stream records and therefore improves throughput considerably. Second is called OP-CACHEJOIN (Optimized Parallel Cache Join) that implements a parallel loading of stored data into memory while the DP phase is executing. We present the performance analysis of both of our approaches with existing CACHEJOIN empirically using synthetic skewed dataset.
Open AccessOptimizing Semi-Stream CACHEJOIN for Near-Real-Time Data Warehousing
Streaming data join is a critical process in the field of near-real-time data warehousing. For this purpose, an adaptive semi-stream join algorithm called CACHEJOIN (Cache Join) focusing non-uniform stream data is provided in the literature. However, this algorithm cannot exploit the memory and CPU resources optimally and consequently it leaves its service rate suboptimal due to sequential execution of both of its phases, called stream-probing (SP) phase and disk-probing (DP) phase. By integrating the advantages of CACHEJOIN, in this paper we present two modifications in it. First is called P-CACHEJOIN (Parallel Cache Join) that enables the parallel processing of two phases in CACHEJOIN. This increases number of joined stream records and therefore improves throughput considerably. Second is called OP-CACHEJOIN (Optimized Parallel Cache Join) that implements a parallel loading of stored data into memory while the DP phase is executing. We present the performance analysis of both of our approaches with existing CACHEJOIN empirically using synthetic skewed dataset.
- Open Access
An Intelligent Fire Warning Application Using IoT and an Adaptive Neuro-Fuzzy Inference System
In the recent past, a few fire warning and alarm systems have been presented based on a combination of a smoke sensor and an alarm device to design a life-safety system. However, such fire alarm systems are sometimes error-prone and can react to non-actual indicators of fire presence classified as false warnings. There is a need for high-quality and intelligent fire alarm systems that use multiple sensor values (such as a signal from a flame detector, humidity, heat, and smoke sensors, etc.) to detect true incidents of fire. An Adaptive neuro-fuzzy Inference System (ANFIS) is used in this paper to calculate the maximum likelihood of the true presence of fire and generate fire alert. The novel idea proposed in this paper is to use ANFIS for the identification of a true fire incident by using change rate of smoke, the change rate of temperature, and humidity in the presence of fire. The model consists of sensors to collect vital data from sensor nodes where Fuzzy logic converts the raw data in a linguistic variable which is trained in ANFIS to get the probability of fire occurrence. The proposed idea also generates alerts with a message sent directly to the user’s smartphone. Our system uses small size, cost-effective sensors and ensures that this solution is reproducible. MATLAB-based simulation is used for the experiments and the results show a satisfactory output.
Open AccessAn Intelligent Fire Warning Application Using IoT and an Adaptive Neuro-Fuzzy Inference System
In the recent past, a few fire warning and alarm systems have been presented based on a combination of a smoke sensor and an alarm device to design a life-safety system. However, such fire alarm systems are sometimes error-prone and can react to non-actual indicators of fire presence classified as false warnings. There is a need for high-quality and intelligent fire alarm systems that use multiple sensor values (such as a signal from a flame detector, humidity, heat, and smoke sensors, etc.) to detect true incidents of fire. An Adaptive neuro-fuzzy Inference System (ANFIS) is used in this paper to calculate the maximum likelihood of the true presence of fire and generate fire alert. The novel idea proposed in this paper is to use ANFIS for the identification of a true fire incident by using change rate of smoke, the change rate of temperature, and humidity in the presence of fire. The model consists of sensors to collect vital data from sensor nodes where Fuzzy logic converts the raw data in a linguistic variable which is trained in ANFIS to get the probability of fire occurrence. The proposed idea also generates alerts with a message sent directly to the user’s smartphone. Our system uses small size, cost-effective sensors and ensures that this solution is reproducible. MATLAB-based simulation is used for the experiments and the results show a satisfactory output.
- 1 October 2018
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 341, 31-41
A refinement of an iterative orthogonal projection method
- 1 October 2018
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 341, 31-41
A refinement of an iterative orthogonal projection method
- 1 December 2016
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 308, 346-360
Extending linear relaxation for non-square matrices and soft constraints
- 1 December 2016
- Published by Elsevier in Journal of Computational and Applied Mathematics
- Vol. 308, 346-360
Extending linear relaxation for non-square matrices and soft constraints