Manzoor Ilahi’s research while affiliated with COMSATS University Islamabad and other places

Stemming is an essential step in various Natural Language Processing (NLP) applications and is used to reduce different variants of the query words to a standard form to avoid the vocabulary mismatch issue in Information Retrieval (IR) systems. Due to specific grammatical rules and complex morphological structures, finding an effective stemming algorithm in Urdu is challenging task. Although, several stemming algorithms have been proposed for the Urdu text stemming; however, none of them extract the stem from multilevel inflected forms. In this context, according to the best of our knowledge, this is a first effort towards the proposition and evaluation of a novel Urdu Text Stemmer (UTS) that can deal with multi-level inflection forms in Urdu text. The experimental evaluation of the proposed scheme has been conducted on the text-based and word-based custom-developed corpus. The proposed stemming technique is rigorously evaluated and compared with state-of-the-art stemming algorithms. Experimental results demonstrate that UTS outperforms existing Urdu stemmers and achieves an accuracy of 94.92% and 91.8% on word corpus and text corpus, respectively. We also evaluated our proposed system in an Information Retrieval application for Urdu, using the Collection for Urdu Retrieval Evaluation (CURE) dataset. Our approach for information retrieval outperformed and improved both recall and precision metrics.

Stemming is an essential step in varied Natural Language Processing (NLP) applications. It is used to reduce different variants of the query words to a standard form to avoid the vocabulary mismatch issue in Information Retrieval (IR) systems. There are a lot of stemming algorithms in English language, but Urdu NLP still in its infancy. A stemmer develops and evaluates in a language cannot be efficiently used for other languages. Urdu has the highly inflected and complex morphological structure, and most of the current Urdu stemmers remove a few numbers of affixes and leads to inefficient results. In this context, according to the best of our knowledge, this is a first comprehensive effort towards the proposition and evaluation of a novel Urdu Text Stemmer (UTS) that cope with multi-level inflection and derivation forms in Urdu text. The experimental evaluation of the proposed scheme has been conducted on the text-based and words-based custom developed corpus. The proposed stemming technique is rigorously evaluated and compared with state-of-the-art stemming algorithms. Experimental results demonstrate that UTS outperforms existing Urdu stemmers and achieves an accuracy of 94.92% and 91.8% on word and text corpus, respectively.

Stemming is an essential step in varied Natural Language Processing (NLP) applications. It is used to reduce different variants of the query words to a standard form to avoid the vocabulary mismatch issue in Information Retrieval (IR) systems. There are a lot of stemming algorithms in English language, but Urdu NLP still in its infancy. A stemmer develops and evaluates in a language cannot be efficiently used for other languages . Urdu has the highly inflected and complex morphological structure, and most of the current Urdu stemmers remove a few numbers of affixes and leads to inefficient results. In this context, according to the best of our knowledge, this is a first comprehensive effort towards the proposition and evaluation of a novel Urdu Text Stemmer (UTS) that cope with multi-level inflection and derivation forms in Urdu text. The experimental evaluation of the proposed scheme has been conducted on the text-based and words-based custom developed corpus. The proposed stemming technique is rigorously evaluated and compared with state-of-the-art stemming algorithms. Experimental results demonstrate that UTS outperforms existing Urdu stemmers and achieves an accuracy of 94.92% and 91.8% on word and text corpus, respectively.

Several software design patterns have cataloged either with canonical or as variants to solve a recurring design problem. However, novice designers mostly adopt patterns without considering their ground reality and relevance to design problems, which causes to increase the development and maintenance efforts. The existing automated systems to select the design patterns need either high computing effort and time for the formal specification or precise learning through the training of several classifiers with large sample size to select the right design patterns realized on the base of their ground reality. In order to discuss this issue, we propose a method on the base of a supervised learning technique named ‘Learning to Rank’, to rank the design patterns via the text relevancy with the description of the given design problems. Subsequently, we also propose an evaluation model to assess the effectiveness of the proposed method. We evaluate the efficacy of the proposed method in the context of several design pattern collections and relevant design problems. The promising experimental results indicate the applicability of the proposed method as a recommendation system to select the right design pattern(s).

The imbalance energy consumption and high data traffic at intermediate nodes degrade the network performance. In this paper, we propose: energy grade and balance load distribution (EGBLOAD) corona, EG without corona and DA without corona based schemes to distribute data traffic across the network nodes for efficient energy consumption. The dynamic adjustment of transmission range in first scheme helps in reducing data load. Additionally, the transmission range is purely based on distance, energy and data load of the receiver node for achieving maximum network lifetime. Second scheme divides a data packet into three fractions; small, medium and large for transmitting from various paths to evenly distribute the data load on the network nodes. In third scheme, depth adjustment of void node is performed to resume network operations, whereas, the load distribution and transmission range mechanisms are the same. The extensive simulations are carried out to show the effectiveness of proposed schemes in terms of PDR, energy consumption, and load distribution against the baseline scheme.

As an emerging and promising approach, crowdsourcing-based software development has become popular in many domains due to the participation of talented pool of developers in the contests, and to promote the ability of requesters (or customers) to choose the ‘wining’ solution with respect to their desired quality levels. However, due to lack of a central mechanism for team formation, continuity in the developer’s work on consecutive tasks and risk of noise in submissions of a contest, there is a gap between the requesters of a domain and their quality concerns related to the adaptation of a crowdsourcing-based software development platform. In order to address concerns and aid requesters, we describe three measures; Quality of Registrant Developers (QRD), Quality of Contest (QC) and Quality of Support (QS) to compute and predict the quality of a crowdsourcing-based platform through historical information on its completed tasks. We evaluate the capacity of the QRD, QC and QS as assessors to predict the quality. Subsequently, we implement a crawler to mine the information of completed development tasks from the TopCoder platform to inspect the proposed measures. The promising results of our QRD, QC, and QS measures suggest to use the proposed measures to the requesters and researchers of other domains such as pharmaceutical research and development, in order to investigate and predict the quality of crowdsourcing-based software development platforms.

Demand side management (DSM) in smart grid authorizes consumers to make informed decisions regarding their energy consumption pattern and helps the utility in reducing the peak load demand during an energy stress time. This results in reduced carbon emission, consumer electricity cost, and increased grid sustainability. Most of the existing DSM techniques ignore priority defined by consumers. In this paper, we present priority-induced DSM strategy based on the load shifting tech-nique considering various energy cycles of an appliance. The day-ahead load shifting technique proposed is mathematically formulated and mapped to multiple knapsack problem to mitigate the rebound peaks. The autonomous energy management controller proposed embeds three meta-heuristic optimization techniques; genetic algorithm, enhanced differential evolu-tion, and binary particle swarm optimization along with optimal stopping rule, which is used for solving the load shifting problem. Simulations are carried out using three different appliances and the results validate that the proposed DSM strategy successfully shifts the appliance operations to off-peak time slots, which consequently leads to substantial electricity cost savings in reasonable waiting time, and also helps in reducing the peak load demand from the smart grid. In addition, we calculate the feasible regions to show the relationship between cost, energy consumption, and delay. A priority-induced demand side management system to mitigate rebound peaks using multiple knapsack. Available from: https://www.researchgate.net/publication/323945280_A_priority-induced_demand_side_management_system_to_mitigate_rebound_peaks_using_multiple_knapsack [accessed Mar 26 2018].

Cloud computing offers various services. Numerous cloud data centers are used to provide these services to the users in the whole world. A cloud data center is a house of physical machines (PMs). Millions of virtual machines (VMs) are used to minimize the utilization rate of PMs. There is a chance of unbalanced network due to the rapid growth of Internet services. An intelligent mechanism is required to efficiently balance the network. Multiple techniques are used to solve the aforementioned issues optimally. VM placement is a great challenge for cloud service providers to fulfill the user requirements. In this paper, an enhanced levy based multi-objective gray wolf optimization (LMOGWO) algorithm is proposed to solve the VM placement problem efficiently. An archive is used to store and retrieve true Pareto front. A grid mechanism is used to improve the non-dominated VMs in the archive. A mechanism is also used for the maintenance of an archive. The proposed algorithm mimics the leadership and hunting behavior of gray wolves (GWs) in multi-objective search space. The proposed algorithm was tested on nine well-known bi-objective and tri-objective benchmark functions to verify the compatibility of the work done. LMOGWO was then compared with simple multi-objective gray wolf optimization (MOGWO) and multi-objective particle swarm optimization (MOPSO). Two scenarios were considered for simulations to check the adaptivity of the proposed algorithm. The proposed LMOGWO outperformed MOGWO and MOPSO for University of Florida 1 (UF1), UF5, UF7 and UF8 for Scenario 1. However, MOGWO and MOPSO performed better than LMOGWO for UF2. For Scenario 2, LMOGWO outperformed the other two algorithms for UF5, UF8 and UF9. However, MOGWO performed well for UF2 and UF4. The results of MOPSO were also better than the proposed algorithm for UF4. Moreover, the PM utilization rate (%) was minimized by 30% with LMOGWO, 11% with MOGWO and 10% with MOPSO.

This paper focuses on analytics of an extremely large dataset of smart grid electricity price and load, which is difficult to process with conventional computational models. These data are known as energy big data. The analysis of big data divulges the deeper insights that help experts in the improvement of smart grid’s (SG) operations. Processing and extracting of meaningful information from data is a challenging task. Electricity load and price are the most influential factors in the electricity market. For improving reliability, control and management of electricity market operations, an exact estimate of the day ahead load is a substantial requirement. Energy market trade is based on price. Accurate price forecast enables energy market participants to make effective and most profitable bidding strategies. This paper proposes a deep learning-based model for the forecast of price and demand for big data using Deep Long Short-Term Memory (DLSTM). Due to the adaptive and automatic feature learning mechanism of Deep Neural Network (DNN), the processing of big data is easier with LSTM as compared to the purely data-driven methods. The proposed model was evaluated using well-known real electricity markets’ data. In this study, day and week ahead forecasting experiments were conducted for all months. Forecast performance was assessed using Mean Absolute Error (MAE) and Normalized Root Mean Square Error (NRMSE). The proposed Deep LSTM (DLSTM) method was compared to traditional Artificial Neural Network (ANN) time series forecasting methods, i.e., Nonlinear Autoregressive network with Exogenous variables (NARX) and Extreme Learning Machine (ELM). DLSTM outperformed the compared forecasting methods in terms of accuracy. Experimental results prove the efficiency of the proposed method for electricity price and load forecasting.