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
••
TL;DR: In this article, a theoretical study of the dynamics of an electroosmotic flow (EOF) in cylindrical domain is presented. And the results obtained reveal that the magnitude of velocity increases with increase of the Debye-Huckel and electrokinetic parameters.
Abstract: The present paper reports a theoretical study of the dynamics of an electroosmotic flow (EOF) in cylindrical domain. The Cauchy momentum equation is first simplified by incorporating the electrostatic body force in the electric double layer and the generalized Burgers fluid constitutive model. The electric potential distribution is given by the linearized Poisson–Boltzmann equation. After solving the linearized Poisson–Boltzmann equation, the Cauchy momentum equation with electrostatic body force is solved analytically by using the temporal Fourier and finite Hankel transforms. The effects of important involved parameters are examined and presented graphically. The results obtained reveal that the magnitude of velocity increases with increase of the Debye–Huckel and electrokinetic parameters. Further, it is shown that the results presented for generalized Burgers fluid are quite general so that results for the Burgers, Oldroyd-B, Maxwell and Newtonian fluids can be obtained as limiting cases.
15 citations
••
TL;DR: In this article, the combined effect of Reynolds number (30 ≤ Re ≤ 150) and gap spacing (1 ≤ g ≤ 7) is studied for two dimensional cross flow across multiple staggered rows of square cylinders.
Abstract: In this numerical exploration, the combined effect of Reynolds number (30 ≤ Re ≤ 150) and gap spacing (1 ≤ g ≤ 7) is studied for two dimensional cross flow across multiple staggered rows of square cylinders. Flow is simulated by using lattice Boltzmann method. Outcomes show that for the outset of vortex shedding phenomenon, the critical Re increases as the normalized g increases. At large Re and at g = 7, 6 and 5, the primary vortex shedding frequency controls the flow whereas the secondary frequency almost vanishes. The jets in the gap region have strong influence upon the wake interaction. The nature of the wakes is changed by changing the g and Re which is visualized by the change of wake size behind the cylinders. These g depending on the Re are used to split the flow regimes into chaotic, quasiperiodic-I and quasiperiodic-II flow regimes. Some physical parameters of practical importance are also analysed.
15 citations
••
TL;DR: In this article, a three-way clustering based algorithm called reduction and elevation based threeway (RE3OWC) for open world classification is proposed. But, it does not consider a specific interpretation where novel instances are instances from unknown classes which are not seen during the training phase.
15 citations
••
TL;DR: A new CVI is proposed to perform the color image segmentation that combines compactness, separation and overlap to assess the clustering quality effectively and performs better compared to other state-of-the-art methods.
Abstract: Clustering validity index (CVI) plays an important role in data partitioning and image segmentation. In this paper, a new CVI is proposed to perform the color image segmentation. The proposed CVI combines compactness, separation and overlap to assess the clustering quality effectively. The aggregation operators (t-norms and t-conorms) are used to build a new reliable and robust overlap measure. Moreover, a genetic algorithm is employed to dynamically optimize the clusters centroids and get the best possible data partition. The clustering of super-pixels is performed to reduce the computational cost and convergence time. The genetic algorithm with new clustering validity index is able to find the best data partitioning. The performance of the proposed algorithm is evaluated on the Berkeley image segmentation database. The extensive experimentation shows that the proposed algorithm performs better compared to other state-of-the-art methods.
15 citations
••
TL;DR: This paper presents QuPiD (query profile distance) attack: a machine learning-based attack that evaluates the effectiveness of UUP in privacy protection, and determines the distance between the user’s profile (web search history) and upcoming query using a proposed novel feature vector.
Abstract: With the advancement in ICT, web search engines have become a preferred source to find health-related information published over the Internet. Google alone receives more than one billion health-related queries on a daily basis. However, in order to provide the results most relevant to the user, WSEs maintain the users’ profiles. These profiles may contain private and sensitive information such as the user’s health condition, disease status, and others. Health-related queries contain privacy-sensitive information that may infringe user’s privacy, as the identity of a user is exposed and may be misused by the WSE and third parties. This raises serious concerns since the identity of a user is exposed and may be misused by third parties. One well-known solution to preserve privacy involves issuing the queries via peer-to-peer private information retrieval protocol, such as useless user profile (UUP), thereby hiding the user’s identity from the WSE. This paper investigates the level of protection offered by UUP. For this purpose, we present QuPiD (query profile distance) attack: a machine learning-based attack that evaluates the effectiveness of UUP in privacy protection. QuPiD attack determines the distance between the user’s profile (web search history) and upcoming query using our proposed novel feature vector. The experiments were conducted using ten classification algorithms belonging to the tree-based, rule-based, lazy learner, metaheuristic, and Bayesian families for the sake of comparison. Furthermore, two subsets of an America Online dataset (noisy and clean datasets) were used for experimentation. The results show that the proposed QuPiD attack associates more than 70% queries to the correct user with a precision of over 72% for the clean dataset, while for the noisy dataset, the proposed QuPiD attack associates more than 40% queries to the correct user with 70% precision.
15 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 |