In this paper, Bayes estimators for the shape and scale parameters of Weibull distribution have been obtained using the generalized weighted loss function, based on Exponential priors. Lindley’s approximation has been used effectively in Bayesian estimation. Based on theMonte Carlo simulation method, those estimators are compared depending on the mean squared errors (MSE’s).

A new efficient Two Derivative Runge-Kutta method (TDRK) of order five is developed for the numerical solution of the special first order ordinary differential equations (ODEs). The new method is derived using the property of First Same As Last (FSAL). We analyzed the stability of our method. The numerical results are presented to illustrate the efficiency of the new method in comparison with some well-known RK methods.

A substantial matter to confidential messages' interchange through the internet is transmission of information safely. For example, digital products' consumers and producers are keen for knowing those products are genuine and must be distinguished from worthless products. Encryption's science can be defined as the technique to embed the data in an images file, audio or videos in a style which should be met the safety requirements. Steganography is a portion of data concealment science that aiming to be reached a coveted security scale in the interchange of private not clear commercial and military data. This research offers a novel technique for steganography based on hiding data inside the clusters that resulted from fuzzy clustering. T

This paper deals with, Bayesian estimation of the parameters of Gamma distribution under Generalized Weighted loss function, based on Gamma and Exponential priors for the shape and scale parameters, respectively. Moment, Maximum likelihood estimators and Lindley’s approximation have been used effectively in Bayesian estimation. Based on Monte Carlo simulation method, those estimators are compared in terms of the mean squared errors (MSE’s).

   In this paper we show that the function , () p fLI α ∈ ,0<p<1 where I=[-1,1] can be approximated by an algebraic polynomial with an error not exceeding , 1 ( , , ) kp ft n Ï• αω      where
,
1 ( , , ) kp ft n ϕ αω is the Ditizian–Totik modules of smoothness of unbounded function in , () p LI

    In this paper , we study some approximation  properties of the strong difference and study the relation between the strong difference and the weighted modulus of continuity

True random number generators are essential components for communications to be conconfidentially secured. In this paper a new method is proposed to generate random sequences of numbers based on the difference of the arrival times of photons detected in a coincidence window between two single-photon counting modules