A graph is a structure amounting to a set of objects in which some pairs of the objects are in some sense related. The objects correspond to mathematical abstractions called vertices (also called nodes or points) and each of the related pairs of vertices is called an edge (also called link or line). A directed graph is a graph in which edges have orientation. A simple graph is a graph that does not have more than one edge between any two vertices and no edge starts and ends at the same vertex.  For a simple undirected graph G with order n, and let  denotes its complement. Let δ(G), ∆(G) denotes the minimum degree and maximum degree of G respectively. The complement degree polynomial of G is the polynomial CD[G,x]= , where C

Permanent deformation, fatigue and thermal cracking are the three typical distresses of flexible pavement. Using hydrated lime (HL) into the conventional limestone mineral additive has been widely practiced, including in Europe, to improve the mechanical properties of hot mix asphalt (HMA) concrete and as the result the durability of the constructed pavement. Large number of experimental studies have been reported to find the optimum addition of HL for the improvement on HMA concrete mechanical properties, moisture susceptibility and fatigue resistance. Pavement in service is under complex thermomechanical stress-strain conditions due to coupled atmospheric and surrounding environment temperature variation and the traffic loading. To predic

     In this paper, some conditions to guarantee the existence of bounded solution to the second order multi delayed arguments differential equation are given. The Krasnoselskii theorem used to the Lebesgue’s dominated convergence and fixed point to obtain some new sufficient conditions for existence of solutions. Some important lemmas are established that are useful to prove the main results for oscillatory property. We also submitted some sufficient conditions to ensure the oscillation criteria of bounded solutions to the same equation.

This paper presents a point multiplication processor over the binary field GF (2²³³) with internal registers integrated within the point-addition architecture to enhance the Performance Index (PI) of scalar multiplication. The proposed design uses one of two types of finite field multipliers, either the Montgomery multiplier or the interleaved multiplier supported by the additional layer of internal registers. Lopez Dahab coordinates are used for the computation of point multiplication on Koblitz Curve (K-233bit). In contrast, the metric used for comparison of the implementations of the design on different types of FPGA platforms is the Performance Index.

The first approach attains a performance index

The aim of this paper is to employ the fractional shifted Legendre polynomials (FSLPs) in the matrix form to approximate the fractional derivatives and find the numerical solutions of the one-dimensional space-fractional bioheat equation (SFBHE). The Caputo formula was utilized to approximate the fractional derivative. The proposed methodology applied for two examples showed its usefulness and efficiency. The numerical results showed that the utilized technique is very efficacious with high accuracy and good convergence.

Convergence prop erties of Jackson polynomials have been considered by Zugmund
[1,ch.X] in (1959) and J.Szbados [2], (p =ï‚¥) while in (1983) V.A.Popov and J.Szabados [3]
(1 ï‚£p ï‚£ ï‚¥) have proved a direct inequality for Jackson polynomials in L
p-sp ace of 2-periodic bounded Riemann integrable functions (f R) in terms of some modulus of
continuity .
In 1991 S.K.Jassim proved direct and inverse inequality for Jackson polynomials in
locally global norms (L
,p) of 2-p eriodic bounded measurable functions (f L) in terms of
suitable Peetre K-functional [4].
Now the aim of our paper is to proved direct and inverse inequalities for Jackson
polynomials

A novel method for Network Intrusion Detection System (NIDS) has been proposed, based on the concept of how DNA sequence detects disease as both domains have similar conceptual method of detection. Three important steps have been proposed to apply DNA sequence for NIDS: convert the network traffic data into a form of DNA sequence using Cryptography encoding method; discover patterns of Short Tandem Repeats (STR) sequence for each network traffic attack using Teiresias algorithm; and conduct classification process depends upon STR sequence based on Horspool algorithm. 10% KDD Cup 1999 data set is used for training phase. Correct KDD Cup 1999 data set is used for testing phase to evaluate the proposed method. The current experiment results sh

     In the contemporary world, the security of data and privacy policies are major concerns in cloud computing. Data stored on the cloud has been claimed to be unsafe and liable to be hacked. Users have found it difficult to trust their data in the cloud. Users want to know that their data is accessible from anywhere and that an unauthorized user will not be able to access it. Another area of concern is the authentication of users over the cloud. There are a number of security concerns with Cloud Computing which include Distributed Denial of Service, Data leakage, and many more, just to mention a few. In this paper, an Elliptic Curve Cryptography (ECC) algorithm is used for the encryption and decryption of the information stored on