Institution
National University of Computer and Emerging Sciences
Education•Islamabad, Pakistan•
About: National University of Computer and Emerging Sciences is a education organization based out in Islamabad, Pakistan. It is known for research contribution in the topics: Computer science & The Internet. The organization has 1506 authors who have published 2438 publications receiving 26786 citations.
Papers published on a yearly basis
Papers
More filters
••
14 Jun 2010TL;DR: This paper investigates the computational aspect of the two recently introduced approaches to document clustering based on suffix tree data model, and the quality of results they produced.
Abstract: Document clustering as an unsupervised approach extensively used to navigate, filter, summarize and manage large collection of document repositories like the World Wide Web (WWW). Recently, focuses in this domain shifted from traditional vector based document similarity for clustering to suffix tree based document similarity, as it offers more semantic representation of the text present in the document. In this paper, we compare and contrast two recently introduced approaches to document clustering based on suffix tree data model. The first is an Efficient Phrase based document clustering, which extracts phrases from documents to form compact document representation and uses a similarity measure based on common suffix tree to cluster the documents. The second approach is a frequent word/word meaning sequence based document clustering, it similarly extracts the common word sequence from the document and uses the common sequence/ common word meaning sequence to perform the compact representation, and finally, it uses document clustering approach to cluster the compact documents. These algorithms are using agglomerative hierarchical document clustering to perform the actual clustering step, the difference in these approaches are mainly based on extraction of phrases, model representation as a compact document, and the similarity measures used for clustering. This paper investigates the computational aspect of the two algorithms, and the quality of results they produced.
10 citations
••
TL;DR: In this article, a complete classification of Friedmann-Robertson-Walker (FRW) spacetime by using approximate Noether approach is presented, and a list of Noether operators is also computed which is not only independent from the choice of the cosmic scale factor but also from the type of universe.
Abstract: In this paper, a complete classification of Friedmann-Robertson-Walker (FRW) spacetime by using approximate Noether approach is presented. Considered spacetime is discussed for three different types of universe i.e. flat, open and closed. Different forms of cosmic scale factor a with respect to the nature of the universe, which posses the nontrivial Noether gauge symmetries (NGS) are reported. The perturbed Lagrangian corresponding to FRW metric in the Noether equation is used to get Noether operators. For different types of universe minimal and maximal set of Noether operators are reported. A list of Noether operators is also computed which is not only independent from the choice of the cosmic scale factor but also from the type of universe. Further, corresponding energy type first integral of motions are also calculated.
10 citations
••
TL;DR: This paper proposes a CF-based Web services recommendation approach, which incorporates the effect of locations of users, communication-network configured users, and Web services run-time environments on the recommendations.
Abstract: Collaborative filtering (CF) is one of the renowned recommendation techniques that can be used for predicting unavailable Quality-of-Service (QoS) values of Web services. Although several CF-based approaches have been proposed in recent years, the accuracy of the QoS values, that these approaches provide, raises some concerns and hence, could undermine the real “quality” of Web services. To address these concerns, context information such as communication-network configuration and user location could be integrated into the process of developing recommendations. Building upon such context information, this paper proposes a CF-based Web services recommendation approach, which incorporates the effect of locations of users, communication-network configurations of users, and Web services run-time environments on the recommendations. To evaluate the accuracy of the recommended Web services based on the defined QoS values, a set of comprehensive experiments are conducted using a real dataset of Web services. The experiments are in line with the importance of integrating context into recommendations.
10 citations
••
TL;DR: This work improves previous work on AspectOCL, which is an extension of OCL that allows modeling of cross-cutting constraints, and adds support for new constructs such as composite aspects and invariant specification on a package.
Abstract: Constraints play an important role in Model-Driven Software Engineering. Industrial systems commonly exhibit cross-cutting behaviors in design artifacts. Aspect-orientation is a well-established approach to deal with cross-cutting behaviors and has been successfully used for programming and design languages. In model-driven software engineering, the presence of cross-cutting constraints makes it difficult to maintain constraints defined on the models of large-scale industrial systems. In this work, we improve our previous work on AspectOCL, which is an extension of OCL that allows modeling of cross-cutting constraints. We provide the abstract and concrete syntax of the language. We add support for new constructs such as composite aspects and invariant specification on a package. We also provide tool support for writing cross-cutting constraints using AspectOCL. To evaluate AspectOCL, we apply it on benchmark case studies from the OCL repository. The results show that by separating the cross-cutting constraints, the number of constructs in the constraint specifications can be reduced to a large amount. AspectOCL reduces the maintenance effort by up to 55% in one case study. To explore the impact on maintenance time and accuracy, we also perform a controlled experiment with 90 student subjects. The results show that AspectOCL has a small magnitude of improvement in terms of maintenance time when compared to OCL, whereas modifications to OCL specification are more accurate. The post-experiment survey indicates that the majority of subjects favored AspectOCL, but faced challenges in applying aspect-orientation to constraint specification due to a lack of prior exposure.
10 citations
••
01 Dec 2019
TL;DR: Improved BSO technique is applied to obtain the best cluster centers (heads) that can amplify energy efficiency, coverage percentage and packet data rate, and simulation results demonstrate that the proposed protocol overcomes the others successfully.
Abstract: In Wireless Sensor Networks (WSNs), clustering has continued to be one of the most informed concerns when it comes to the lifetime of the network. However, we cannot study routing without considering effective clustering measures to optimize such problem in WSNs. The form of energy model used is identified to be the main supplier of consumed energy in WSN. The Brain Storm Optimization (BSO) is a swarm intellectual formulation that can achieve results to a problem more suitably. In this paper, the proposed approach is called Energy Efficient Clustering-Brain Storm Optimization (EEC-BSO). Furthermore, improved BSO technique is applied to obtain the best cluster centers (heads) that can amplify energy efficiency, coverage percentage and packet data rate. In addition, we explored an energy consumption model based on cluster transmission with an exact WSN. Simulation results demonstrate that the proposed protocol overcomes the others successfully.
10 citations
Authors
Showing all 1515 results
Name | H-index | Papers | Citations |
---|---|---|---|
Muhammad Shoaib | 97 | 1333 | 47617 |
Muhammad Usman | 61 | 1203 | 24848 |
Muhammad Saleem | 60 | 1017 | 18396 |
Abdul Hameed | 52 | 507 | 14985 |
Muhammad Javaid | 48 | 344 | 8765 |
Muhammad Umar | 45 | 228 | 5851 |
Muhammad Adnan | 38 | 381 | 5326 |
JingTao Yao | 37 | 129 | 4374 |
Amine Bermak | 37 | 441 | 5162 |
Nadeem A. Khan | 34 | 166 | 4745 |
Majid Khan | 33 | 230 | 3818 |
Tariq Shah | 32 | 195 | 3131 |
Muhammad Shahzad | 31 | 228 | 4323 |
Maurizio Repetto | 30 | 252 | 3163 |
Tariq Mahmood | 30 | 93 | 3772 |