Scientific Published Papers: Recent submissions

  • Normalizer: A Case Tool to Normalize Relational Database Schemas 
    Arman, Nabil (2006)
    Relational Database Schemas represent the database schema as a collection of relation schemas. Sometimes, these relation schemas are poorly designed and need to be decomposed in an attempt to choose "good" relation schemas. ...
  • Evaluating and mitigating a Collusive version of the Interest Flooding Attack in NDN 
    Salah, Hani (IEEE, 2016-06-27)
    Named-Data Networking (NDN) is a promising architecture for the future Internet. However, it is hampered by interest flooding, an NDN-tailored DDoS attack which has been shown to cause dropping majority of legitimate ...
  • Comparing the Approaches of Graph Reduction and Landmark Shortest-Paths 
    Khamayseh, Faisal; Arman, Nabil (Journal of Theoretical and Applied Information Technology JATIT & LLS, Vol. 83. No. 1, 2016-01-01)
    We study the different recent improvements on shortest path algorithms. We suggest improvements to the classical path computing algorithms and we implement them using random generated graphs with various sizes. Many attempts ...
  • Selective video encryption using chaotic system in the SHVC extension 
    Hamidouche, Wassim; Farajallah, Mousa; Raulet, Mickael; Deforges, Olivier; El Assad, Safwan (2015 IEEE International Conference on Acoustics, Speech and Signal Processing (ICASSP), 2015-04-19)
    In this paper we investigate a selective video encryption in the scalable HEVC extension (SHVC). The SHVC extension encodes the video in several layers corresponding to different spatial and quality representations of the ...
  • SMARANDACHE FRIENDLY CUBE NUMBERS 
    Karama, Muneer Jebreel (2005)
    The main purpose of this paper is to introduce new concepts of Smarandache numbers, namely Smarandache Friendly Cube Numbers, and give definitions, curious note, theorem, conjectures, proposed future studies, and ask ...
  • An Efficient Algorithm for Generating Maximal Interval Groups in Interval Databases 
    Arman, Nabil (2004)
    The development of efficient algorithms to enumerate all intervals that have certain properties has attracted a large amount of research efforts due to the important role of interval-based reasoning in different areas like ...
  • A Lightweight Approach for Improving the Lookup Performance in Kademlia-type Systems 
    Roos, Stefanie; Salah, Hani; Strufe, Thorsten (arXiv, 2014-04-27)
    Discovery of nodes and content in large-scale distributed systems is generally based on Kademlia, today. Understanding Kademlia-type systems to improve their performance is essential for maintaining a high service quality ...
  • Smarandache Sequence of Unhappy Numbers 
    Unknown author (2006)
    The main purpose of this paper is to introduce new concepts of Smarandache numbers, namely Smarandache Sequence of Unhappy Numbers, and give defin- ition, theorem, and ask open problems.
  • Graph Representation: Comparative Study and Performance Evaluation 
    Arman, Nabil (2006)
    In this study, a comparison is conducted among three major representations of directed graphs to illustrate major advantages and disadvantages of each representation scheme....
  • Structural and Syntactic Fault Correction Algorithms in Rule-Based System,” International Journal of Computing and Information Sciences 
    Arman, Nabil; Richards, Dana; Rine, David (2004, 2004)
    The development of efficient algorithms to corrects fault is rule-based systems is very crucial in extending the verification and validation of rule sets and in the development of rule-based systems. While it is important ...
  • Design of a robust cryptosystem algorithm for non-invertible matrices based on hill cipher 
    Hamamreh, Rushdi; Farajallah, Mousa (International Journal of Computer Science and Network Security, 2009-05-29)
    Information security is an important issue. Hill Cipher is one of the most famous symmetric cryptosystem that can be used to protect information from unauthorized access.Hill cipher is a polygraph substitution cipher based ...
  • Inferring Student's Chat Topic in Colloquial Arabic Text using Semantic Representation 
    Khamayseh, Faisal (2016-08-01)
    Since the colloquial Arabic is now widespread it is required to describe the collection and classification of a multi-dialectal corpus of Arabic. Nowadays, colloquial multi-dialectal comes in almost country based forms ...
  • SOME SMARANDACHE IDENTITIES 
    Karama, Muneer Jebreel (2005)
    The purpose of this article is to presents 23 Smarandache Identities (SI) (or Facts) with second, three, four, and five degrees. These SI have been obtained by the help of Maple 8(Programming language, see [1]).
  • An Efficient Algorithm for the Generalized Partially Instantiated Same Generation Query in Deductive Databases 
    Arman, Nabil (2004)
    The expressive power and intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledge-base systems (deductive database systems). Linear ...
  • CoMon: A system architecture for improving caching in CCN 
    Salah, Hani; Schiller, Benjamin; Strufe, Thorsten (IEEE, 2014-04-27)
    Content-Centric Networking (CCN) promises to yield large efficiency gains for Internet content distribution. Its autonomous cache management, however, raises doubts about achieving the intended goals optimally. A coordinated ...
  • ROI ENCRYPTION FOR THE HEVC CODED VIDEO CONTENTS 
    Farajallah, Mousa; Hamidouche, Wassim; Deforges, Olivier; El Assad, Safwan (2015 IEEE International Conference on Image Processing (ICIP), 2015-09-27)
    In this paper we investigate privacy protection for the HEVC standard based on the tile concept. Tiles in HEVC enable the video to be split into independent rectangular regions. Two solutions are proposed to encrypt the ...
  • Perfect powers in Smarandache n-Expressions 
    Karama, Muneer Jebreel; Karama, Muneer Jebreel (2006)
    In [1] I studied the concept of Smarandache n-expressions, for example I proposed formulas, found solutions, proposed open questions, and conjectured, but all for the fixed 3, and 2 numbers, but what will happen if these ...
  • A Spanning-Tree Based Approach for Generating Fault-Free Rule Bases 
    Arman, Nabil (Jerash University Journal for Research and Studies, 2003)
    This article presents a new approach for generating fault-free rule bases, which have no redundancy, circularity, inconsistency, contradiction/conflict and unreachability. The approach makes use of spanning trees. A new ...
  • E-learning Materials Development: Applying and Implementing Software Reuse Principles and Granularity Levels in the Small 
    Arman, Nabil (2010)
    E-learning materials development is typically acknowledged as an expensive, complicated, and lengthy process, often producing materials that are of low quality and difficult to adapt and maintain. It has always been a ...
  • Determining the Hop Count in Kademlia-type Systems 
    Roos, Stefanie; Salah, Hani; Strufe, Thorsten (IEEE, 2015-12-01)
    —The family of Kademlia-type systems represents the most efficient and most widely deployed class of Internetscale distributed systems. However, prior research on these systems has mainly been restricted to analyzing ...

Search DSpace


Browse

My Account