Search

This paper is concerned with introducing an explicit expression for orthogonal Boubaker polynomial functions with some important properties. Taking advantage of the interesting properties of Boubaker polynomials, the definition of Boubaker wavelets on interval [0,1) is achieved. These basic functions are orthonormal and have compact support. Wavelets have many advantages and applications in the theoretical and applied fields, and they are applied with the orthogonal polynomials to propose a new method for treating several problems in sciences, and engineering that is wavelet method, which is computationally more attractive in the various fields. A novel property of Boubaker wavelet function derivative in terms of Boubaker wavelet themselves is also obtained. This Boubaker wavelet is utilized along with a collocation method to obtain an approximate numerical solution of singular linear type of Lane-Emden equations. Lane-Emden equations describe several important phenomena in mathematical science and astrophysics such as thermal explosions and stellar structure. It is one of the cases of singular initial value problem in the form of second order nonlinear ordinary differential equation. The suggested method converts Lane-Emden equation into a system of linear differential equations, which can be performed easily on computer. Consequently, the numerical solution concurs with the exact solution even with a small number of Boubaker wavelets used in estimation. An estimation of error bound for the present method is also proved in this work. Three examples of Lane-Emden type equations are included to demonstrate the applicability of the proposed method. The exact known solutions against the obtained approximate results are illustrated in figures for comparison

In this paper, double Sumudu and double Elzaki transforms methods are used to compute the numerical solutions for some types of fractional order partial differential equations with constant coefficients and explaining the efficiently of the method by illustrating some numerical examples that are computed by using Mathcad 15.and graphic in Matlab R2015a.

The m-consecutive-k-out-of-n: F linear and circular system consists of n sequentially connected components; the components are ordered on a line or a circle; it fails if there are at least m non-overlapping runs of consecutive-k failed components. This paper proposes the reliability and failure probability functions for both linearly and circularly m-consecutive-k-out-of-n: F systems. More precisely, the failure states of the system components are separated into two collections (the working and the failure collections); where each one is defined as a collection of finite mutual disjoint classes of the system states. Illustrative example is provided.

MDS code is a linear code that achieves equality in the Singleton bound, and projective MDS (PG-MDS) is MDS code with independents property of any two columns of its generator matrix. In this paper, elementary methods for modifying a PG-MDS code of dimensions 2, 3, as extending and lengthening, in order to find new incomplete PG-MDS codes have been used over . Also, two complete PG-MDS codes over of length and 28 have been found.

The aim of this paper is to present a new methodology to find the private key of RSA. A new initial value which is generated from a new equation is selected to speed up the process. In fact, after this value is found, brute force attack is chosen to discover the private key. In addition, for a proposed equation, the multiplier of Euler totient function to find both of the public key and the private key is assigned as 1. Then, it implies that an equation that estimates a new initial value is suitable for the small multiplier. The experimental results show that if all prime factors of the modulus are assigned larger than 3 and the multiplier is 1, the distance between an initial value and the private key is decreased about 66%. On the other hand, the distance is decreased less than 1% when the multiplier is larger than 66. Therefore, to avoid attacking by using the proposed method, the multiplier which is larger than 66 should be chosen. Furthermore, it is shown that if the public key equals 3, the multiplier always equals 2.