DSpace Repository

Browsing Scientific Published Papers by Title

Browsing Scientific Published Papers by Title

Sort by: Order: Results:

  • 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 ...
  • Chetto, Maryline; El Assad, Safwan; Farajallah, Mousa (International Journal of Internet Technology and Secured Transactions, 2014-01-01)
    A growing number of systems are highly connected and distributed over the internet. These systems require innovative software services and infrastructures in order to guarantee security and reliability. This issue has a ...
  • Fawaz, Zeinab; El Assad, Safwan; Farajallah, Mousa; Ayman, Khalil; Lozi, René; Déforges, Olivier (8th International Conference for Internet Technology and Secured Transactions (ICITST-2013), 2013-12-09)
    In the last two decades, several chaos-based cryptosystems have been proposed. Some of them have architecture comprising a layer of permutation and a layer of diffusion and these layers are simultaneously executed in a ...
  • Salah, Hani; Wulfheide, Julian; Strufe, Thorsten (IEEE, 2015-04-26)
    Named-Data Networking (NDN) is a promising architecture for future Internet. However, routers and content providers in NDN can be targets for a new DDoS attack called the Interest Flooding Attack (IFA). As a consequence, ...
  • Paul, Thomas; Lochschmidt, Niklas; Salah, Hani; Datta, Anwitaman; Strufe, Thorsten (IEEE (26th International Conference on Computer Communications and Networks (ICCCN)), 2017-08-01)
    P2P-based social networking services are severely challenged by churn and the lack of reliable service providers, especially considering the high frequency of posts and profile updates of their users. Improved consistency ...
  • Arman, Nabil; Daghameen, Khalid (2011)
    One of the main areas in image processing is line detection and recognition. Some algorithms for line detection were introduced. However, these algorithms involve expensive operations like floating-point arithmetic and ...
  • Romi, Ismail M.; Romi, Ismail M. (Journal of Internet Banking and Commerce, 2015-02-20)
    Banks operates in a dynamic environment, with a continuous pressure from customers, and stakeholders. As well as set of challenges from banks environments and technological advancements. To determine technological ...
  • Arman, Nabil (2013)
    Traditionally, deductive databases are designed as extensions to relational databases by either integrating a logic programming language, such as PROLOG, with a conventional relational database system that provides storage ...
  • El Assad, Safwan; Farajallah, Mousa (Signal Processing: Image Communication-Elsevier, 2016-02-29)
    During the last decade, a variety of chaos-based cryptosystems has been introduced to protect the content of the transmitted images. In this paper, we propose a new fast, simple, and robust chaos-based cryptosystem ...
  • 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. ...
  • Hashlamon, Iyad; Gülhan, Mehmet Mert; Ayit, Orhan; Erbatur, Kemalettin (Robotica, 2015-11-03)
    This paper proposes a new approach for slip prediction of walking biped robots. The slip prediction is a measurement-based and friction behavior-inspired approach. A measurement-based online algorithm is designed to estimate ...
  • Carra, Damiano; Michiardi, Pietro; Salah, Hani; Strufe, Thorsten (IEEE, 2013-09-01)
    Motivated by the popularity of content distribution and file sharing applications that nowadays dominate Internet traffic, we focus on the incentive mechanism of a very popular, yet not very well studied, peer-to-peer ...
  • Roos, Stefanie; Salah, Hani; Strufe, Thorsten (Ad­vances in Com­put­er Com­mu­ni­ca­tions and Net­works, 2017)
    The family of Kademlia-type systems represents the most efficient and most widely deployed class of Internet-scale distributed systems. Its success has caused plenty of large-scale measurements and simulation studies, ...
  • Karama, Muneer Jebreel (2003)
    The aim of this article is to develop the issue of operation sense of fractions through the conditions in real-world for the students in 7th grade, so this advancing students’ mathematical thinking in every day mathematics ...
  • Arman, Nabil (2007)
    In this study, a parallel algorithm to generate all maximal interval groups form a given interval set is presented. The algorithm makes use of intraoperation parallelism to speed up the generation of the maximal groups. ...
  • Arman, Nabil (4th International Multiconference on Computer Science and Information Technology (CSIT2006), 2006)
    Interval databases queries are computationally intensive and lend themselves naturally to parallelization to speed up the solution of such queries. In this paper, a parallel algorithm to generate all maximal interval groups ...
  • Arman, Nabil (4th International Multiconference on Computer Science and Information Technology (CSIT2006), 2006)
    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 ...
  • Arman, Nabil (2006 International Conference on Information and Knowledge Engineering (IKE'06), 2006)
    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). ...
  • Arman, Nabil (2006)
    The intelligence of traditional database systems can be improved by recursion. Using recursion, relational database systems are extended into knowledgebase systems (deductive database systems). Linear recursion is the ...
  • Arman, Nabil; Khamayseh, Faisal (International Journal of Electrical and Computer Engineering (IJECE), 2015-09-01)
    Given a weighted directed graph G=(V;E;w), where w is non-negative weight function, G’ is a graph obtained from G by an application of path compression. Path compression reduces the graph G to a critical set of vertices ...

Search DSpace


Browse

My Account