A skip list data structure is really just a simulation of a binary search tree. Skip lists algorithm are simpler, faster and use less space. this data structure conceptually uses parallel sorted linked lists. Searching in a skip list is more difficult than searching in a regular sorted linked list. Because a skip list is a two dimensional data structure, it is implemented using a two dimensional network of nodes with four pointers. the implementation of the search, insert and delete operation taking a time of upto . The skip list could be modified to implement the order statistic operations of RANKand SEARCH BY RANK while maintaining the same expected time. Keywords:skip list , parallel linked list , randomized algorithm , rank.

In this paper, the blow-up solutions for a parabolic problem, defined in a bounded domain, are studied. Namely, we consider the upper blow-up rate estimate for heat equation with a nonlinear Neumann boundary condition defined on a ball in Rn.

Pulsar stars are rotating Neutron stars can be divided into two types Millisecond and Normal Pulsars. In this work the magnetic field are concentrated depends on the period (P), and Period derivative (P) for a sample Normal, Millisecond and Radio stars which adopted. In addition, the values of spin down luminosity and Heating rate are determined by depending on (Ostriker and Gunn) model. The results showed that older Millisecond define as having greater ages specified how long pulsars lives at that ages very long period pulsars to be observable have particularly large surface magnetic field. The results indicate that spin down of luminosity for Millisecond and Normal star must due to the main energy loss rotation axis to align with magne

      Cardiovascular disease (CVD) is a class of diseases that involve the blood vessels or heart. Chlamydia pneumoniae has been considered as the most reasonable; also, it is able to increase and persevere inside vascular cells and to make the chronic inflammation in atherosclerosis. In this study, blood samples were subjected for molecular detection of Chlamydia pneumoniae by using conventional polymerase chain reaction (PCR) depending on 16S rRNA. Seventy patients who suffer from cardiovascular diseases (angina, myocardial infarction and atherosclerosis) aged between 33-86

This paper presents a hybrid approach for solving null values problem; it hybridizes rough set theory with intelligent swarm algorithm. The proposed approach is a supervised learning model. A large set of complete data called learning data is used to find the decision rule sets that then have been used in solving the incomplete data problem. The intelligent swarm algorithm is used for feature selection which represents bees algorithm as heuristic search algorithm combined with rough set theory as evaluation function. Also another feature selection algorithm called ID3 is presented, it works as statistical algorithm instead of intelligent algorithm. A comparison between those two approaches is made in their performance for null values estima

Referral techniques are normally employed in internet business applications. Existing frameworks prescribe things to a particular client according to client inclinations and former high evaluations. Quite a number of methods, such as cooperative filtering and content-based methodologies, dominate the architectural design of referral frameworks. Many referral schemes are domain-specific and cannot be deployed in a general-purpose setting. This study proposes a two-dimensional (User × Item)-space multimode referral scheme, having an enormous client base but few articles on offer. Additionally, the design of the referral scheme is anchored on the  and  articles, as expressed by a particular client, and is a combination of affi

With the revolutionized expansion of the Internet, worldwide information increases the application of communication technology, and the rapid growth of significant data volume boosts the requirement to accomplish secure, robust, and confident techniques using various effective algorithms. Lots of algorithms and techniques are available for data security.  This paper presents a cryptosystem that combines several Substitution Cipher Algorithms along with the Circular queue data structure. The two different substitution techniques are; Homophonic Substitution Cipher and Polyalphabetic Substitution Cipher in which they merged in a single circular queue with four different keys for each of them, which produces eight different outputs for