The research aims to find approximate solutions for two dimensions Fredholm linear integral equation. Using the two-variables of the Bernstein polynomials we find a solution to the approximate linear integral equation of the type two dimensions. Two examples have been discussed in detail.

      In this paper, several types of space-time fractional partial differential equations has been solved by using most of special double linear integral transform ”double  Sumudu ”. Also, we are going to argue the truth of these solutions by another analytically method “invariant subspace method”. All results are illustrative numerically and graphically.

This work, deals with Kumaraswamy distribution. Kumaraswamy (1976, 1978) showed well known probability distribution functions such as the normal, beta and log-normal but in (1980) Kumaraswamy developed a more general probability density function for double bounded random processes, which is known as Kumaraswamy’s distribution. Classical maximum likelihood and Bayes methods estimator are used to estimate the unknown shape parameter (b). Reliability function are obtained using symmetric loss functions by using three types of informative priors two single priors and one double prior. In addition, a comparison is made for the performance of these estimators with respect to the numerical solution which are found using expansion method. The

In this paper, the proposed phase fitted and amplification fitted of the Runge-Kutta-Fehlberg method were derived on the basis of existing method of 4(5) order to solve ordinary differential equations with oscillatory solutions. The recent method has null phase-lag and zero dissipation properties. The phase-lag or dispersion error is the angle between the real solution and the approximate solution. While the dissipation is the distance of the numerical solution from the basic periodic solution. Many of problems are tested over a long interval, and the numerical results have shown that the present method is more precise than the 4(5) Runge-Kutta-Fehlberg method.

In this paper the use of a circular array antenna with adaptive system in conjunction with modified Linearly Constrained Minimum Variance Beam forming (LCMVB) algorithm is proposed to meet the requirement of Angle of Arrival (AOA) estimation in 2-D as well as the Signal to Noise Ratio (SNR) of estimated sources (Three Dimensional 3-D estimation), rather than interference cancelation as it is used for. The proposed system was simulated, tested and compared with the modified Multiple Signal Classification (MUSIC) technique for 2-D estimation. The results show the system has exhibited astonishing results for simultaneously estimating 3-D parameters with accuracy approximately equivalent to the MUSIC technique (for estimating elevation and a

Free Space Optical (FSO) technology offers highly directional, high bandwidth communication channels. This technology can provide fiber-like data rate over short distances. In order to improve security associated with data transmission in FSO networks, a secure communication method based on chaotic technique is presented. In this paper, we have turned our focus on a specific class of piece wise linear one-dimensional chaotic maps. Simulation results indicate that this approach has the advantage of possessing excellent correlation property. In this paper we examine the security vulnerabilities of single FSO links and propose a solution to this problem by implementing the chaotic signal generator “reconfigurable tent map”. As synchronizat

The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.