Institution
Jordan University of Science and Technology
Education•Irbid, Irbid, Jordan•
About: Jordan University of Science and Technology is a education organization based out in Irbid, Irbid, Jordan. It is known for research contribution in the topics: Population & Medicine. The organization has 7582 authors who have published 13166 publications receiving 298158 citations. The organization is also known as: JUST.
Topics: Population, Medicine, Health care, Heat transfer, Cloud computing
Papers published on a yearly basis
Papers
More filters
••
TL;DR: A system for the recognition of the handwritten Indian numerals one to nine (1–9) using a probabilistic neural network (PNN) approach using a feature vector based on the center of gravity and a set of vectors to the boundary points of the digit object.
64 citations
••
TL;DR: The results of the electrokinetic-stabilization procedure using the K + and Ca 2+ ions as stabilizing agents varied according to the type of the stabilizing ions as discussed by the authors.
64 citations
••
20 Oct 2006
TL;DR: Through existing virtual memory and inter-process protection mechanisms, Heap Server prevents the heap meta-data from being illegally overwritten, and heap data from being meaningfully overwritten and verified against several real-world exploits and attack kernels.
Abstract: The goal of this paper is to propose a scheme that provides comprehensive security protection for the heap. Heap vulnerabilities are increasingly being exploited for attacks on computer programs. In most implementations, the heap management library keeps the heap meta-data (heap structure information) and the application's heap data in an interleaved fashion and does not protect them against each other. Such implementations are inherently unsafe: vulnerabilities in the application can cause the heap library to perform unintended actions to achieve control-flow and non-control attacks.Unfortunately, current heap protection techniques are limited in that they use too many assumptions on how the attacks will be performed, require new hardware support, or require too many changes to the software developers' toolchain. We propose Heap Server, a new solution that does not have such drawbacks. Through existing virtual memory and inter-process protection mechanisms, Heap Server prevents the heap meta-data from being illegally overwritten, and heap data from being meaningfully overwritten. We show that through aggressive optimizations and parallelism, Heap Server protects the heap with nearly-negligible performance overheads even on heap-intensive applications. We also verify the protection against several real-world exploits and attack kernels.
64 citations
••
24 Jul 2014TL;DR: This paper presents a comprehensive analysis of a relatively large dataset of Arabic comments collected from one of the most widely used social networks in the Arab world, Yahoo!-Maktoob, and shows that SVM outperforms NB and achieves a 64% accuracy level.
Abstract: Due to the evolution of Web 2.0 technology, internet users are more capable of posting their comments and reviews to express their opinions and feelings about everything. Hence, the necessity of automatically identifying the polarity (be it positive, negative, or neutral) of these comments arose and new interdisciplinary field called sentiment analysis (SA) emerged. Unluckily, many studies were conducted on the English language whereas those on the Arabic language are quite few. In addition, the publicly available datasets and testing tools for SA of Arabic text are rare. In this paper, a relatively large dataset of Arabic comments is manually collected and annotated. The source is one of the most widely used social networks in the Arab world, Yahoo!-Maktoob. A comprehensive analysis of this dataset is presented and two popular classifiers, support vector machine (SVM) and Naive Bayes (NB) are used for empirical experimentations. The results show that SVM outperforms NB and achieves a 64% accuracy level.
64 citations
••
TL;DR: A genetic algorithm is presented that searches for an optimal or near optimal solution to the coverage holes problem in hybrid wireless sensor networks and can optimize the network coverage in terms of the overall coverage ratio and the number of additional mobile nodes.
Abstract: In hybrid wireless sensor networks composed of both
static and mobile sensor nodes, the random deployment of stationary nodes may
cause coverage holes in the sensing field. Hence, mobile sensor nodes are added
after the initial deployment to overcome the coverage holes problem. To achieve
optimal coverage, an efficient algorithm should be employed to find the best
positions of the additional mobile nodes. This paper presents a genetic
algorithm that searches for an optimal or near optimal solution to the coverage
holes problem. The proposed algorithm determines the minimum number and the
best locations of the mobile nodes that need to be added after the initial
deployment of the stationary nodes. The performance of the genetic algorithm
was evaluated using several metrics, and the simulation results demonstrated
that the proposed algorithm can optimize the network coverage in terms of the
overall coverage ratio and the number of additional mobile nodes.
64 citations
Authors
Showing all 7666 results
Name | H-index | Papers | Citations |
---|---|---|---|
Andrew McCallum | 113 | 472 | 78240 |
Yousef Khader | 94 | 586 | 111094 |
Michael P. Jones | 90 | 707 | 29327 |
David S Sanders | 75 | 639 | 23712 |
Nidal Hilal | 72 | 395 | 21524 |
Nagendra P. Shah | 71 | 334 | 19939 |
Jeffrey R. Idle | 70 | 261 | 16237 |
Rahul Sukthankar | 70 | 240 | 28630 |
Matthias Kern | 66 | 332 | 14871 |
David De Cremer | 65 | 297 | 13788 |
Moustafa Youssef | 61 | 299 | 15541 |
Mohammed Farid | 61 | 299 | 15820 |
Rudolf Holze | 58 | 388 | 13761 |
Rich Caruana | 57 | 145 | 26451 |
Eberhardt Herdtweck | 56 | 332 | 10785 |