The researcher [1-10] proposed a method for computing the numerical solution to quasi-linear parabolic p.d.e.s using a Chebyshev method. The purpose of this paper is to extend the method to problems with mixed boundary conditions. An error analysis for the linear problem is given and a global element Chebyshev method is described. A comparison of various chebyshev methods is made by applying them to two-point eigenproblems. It is shown by analysis and numerical examples that the approach used to derive the generalized Chebyshev method is comparable, in terms of the accuracy obtained, with existing Chebyshev methods.
In this research , we study the inverse Gompertz distribution (IG) and estimate the survival function of the distribution , and the survival function was evaluated using three methods (the Maximum likelihood, least squares, and percentiles estimators) and choosing the best method estimation ,as it was found that the best method for estimating the survival function is the squares-least method because it has the lowest IMSE and for all sample sizes
In the present article, we implement the new iterative method proposed by Daftardar-Gejji and Jafari (NIM) [V. Daftardar-Gejji, H. Jafari, An iterative method for solving nonlinear functional equations, J. Math. Anal. Appl. 316 (2006) 753-763] to solve two problems; the first one is the problem of spread of a non-fatal disease in a population which is assumed to have constant size over the period of the epidemic, and the other one is the problem of the prey and predator. The results demonstrate that the method has many merits such as being derivative-free, overcome the difficulty arising in calculating Adomian polynomials to handle the nonlinear terms in Adomian Decomposition Method (ADM), does not require to calculate Lagrange multiplier a
... Show MoreThe extracting of personal sprite from the whole image faced many problems in separating the sprite edge from the unneeded parts, some image software try to automate this process, but usually they couldn't find the edge or have false result. In this paper, the authors have made an enhancement on the use of Canny edge detection to locate the sprite from the whole image by adding some enhancement steps by using MATLAB. Moreover, remove all the non-relevant information from the image by selecting only the sprite and place it in a transparent background. The results of comparing the Canny edge detection with the proposed method shows improvement in the edge detection.
In this paper, a subspace identification method for bilinear systems is used . Wherein a " three-block " and " four-block " subspace algorithms are used. In this algorithms the input signal to the system does not have to be white . Simulation of these algorithms shows that the " four-block " gives fast convergence and the dimensions of the matrices involved are significantly smaller so that the computational complexity is lower as a comparison with " three-block " algorithm .
A coin has two sides. Steganography although conceals the existence of a message but is not completely secure. It is not meant to supersede cryptography but to supplement it. The main goal of this method is to minimize the number of LSBs that are changed when substituting them with the bits of characters in the secret message. This will lead to decrease the distortion (noise) that is occurred in the pixels of the stego-image and as a result increase the immunity of the stego-image against the visual attack. The experiment shows that the proposed method gives good enhancement to the steganoraphy technique and there is no difference between the cover-image and the stego-image that can be seen by the human vision system (HVS), so this method c
... Show MoreInterval methods for verified integration of initial value problems (IVPs) for ODEs have been used for more than 40 years. For many classes of IVPs, these methods have the ability to compute guaranteed error bounds for the flow of an ODE, where traditional methods provide only approximations to a solution. Overestimation, however, is a potential drawback of verified methods. For some problems, the computed error bounds become overly pessimistic, or integration even breaks down. The dependency problem and the wrapping effect are particular sources of overestimations in interval computations. Berz (see [1]) and his co-workers have developed Taylor model methods, which extend interval arithmetic with symbolic computations. The latter is an ef
... Show MoreIn this study, the Halder-Wagner method was used for an analysisX-ray lines of Tio2 nanoparticles. Where the software was used to calculate the FWHM and integral breath (β) to calculate the area under the curve for each of the lines of diffraction. After that, the general equation of the halder- Wagner method is applied to calculate the volume (D), strain (ε), stress (σ), and energy per unit(u). Volume (β). Where the value of the crystal volume was equal to (0.16149870 nm) and the strain was equal to (1.044126), stress (181.678 N / m2), and energy per unit volume (94.8474 J m-3).The results obtained from these methods were then compared with those obtained from each of the new paradigm of the HalderWagner method, the Shearer developm
... Show MoreThe main intention of this study was to investigate the development of a new optimization technique based on the differential evolution (DE) algorithm, for the purpose of linear frequency modulation radar signal de-noising. As the standard DE algorithm is a fixed length optimizer, it is not suitable for solving signal de-noising problems that call for variability. A modified crossover scheme called rand-length crossover was designed to fit the proposed variable-length DE, and the new DE algorithm is referred to as the random variable-length crossover differential evolution (rvlx-DE) algorithm. The measurement results demonstrate a highly efficient capability for target detection in terms of frequency response and peak forming that was isola
... Show More