In this research the Empirical Bayes method is used to Estimate the affiliation parameter in the clinical trials and then we compare this with the Moment Estimates for this parameter using Monte Carlo stimulation , we assumed that the distribution of the observation is binomial distribution while the distribution with the unknown random parameters is beta distribution ,finally we conclude that the Empirical bayes method for the random affiliation parameter is efficient using Mean Squares Error (MSE) and for different Sample size .

The rotor dynamics generally deals with vibration of rotating structures. For designing rotors of a high speeds, basically its important to take into account the rotor dynamics characteristics. The modeling features for rotor and bearings support flexibility are described in this paper, by taking these characteristics of rotor dynamics features into standard Finite Element Approach (FEA) model. Transient and harmonic analysis procedures have been found by ANSYS, the idea has been presented to deal with critical speed calculation. This papers shows how elements BEAM188 and COMBI214 are used to represent the shaft and bearings, the dynamic stiffness and damping coefficients of journal bearings as a matrices have been found

Piled raft is commonly used as foundation for high rise buildings. The design concept of piled raft foundation is to minimize the number of piles, and to utilize the entire bearing capacity. High axial stresses are therefore, concentrated at the region of connection between the piles and raft. Recently, an alternative technique is proposed to disconnect the piles from the raft in a so called unconnected piled raft (UCPR) foundation, in which a compacted soil layer (cushion) beneath the raft, is usually introduced.  The piles of the new system are considered as reinforcement members for the subsoil rather than as structural members. In the current study, the behavior of unconnected piled rafts systems has been studie

The aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.

Image compression is a suitable technique to reduce the storage space of an image, increase the area of storage in the device, and speed up the transmission process. In this paper, a new idea for image compression is proposed to improve the performance of the Absolute Moment Block Truncation Coding (AMBTC) method depending on Weber's law condition to distinguish uniform blocks (i.e., low and constant details blocks) from non-uniform blocks in original images. Then, all elements in the bitmap of each uniform block are represented by zero. After that, the lossless method, which is Run Length method, is used for compressing the bits more, which represent the bitmap of these uniform blocks. Via this simple idea, the result is improving

Image quality plays a vital role in improving and assessing image compression performance. Image compression represents big image data to a new image with a smaller size suitable for storage and transmission. This paper aims to evaluate the implementation of the hybrid techniques-based tensor product mixed transform. Compression and quality metrics such as compression-ratio (CR), rate-distortion (RD), peak signal-to-noise ratio (PSNR), and Structural Content (SC) are utilized for evaluating the hybrid techniques. Then, a comparison between techniques is achieved according to these metrics to estimate the best technique. The main contribution is to improve the hybrid techniques. The proposed hybrid techniques are consisting of discrete wavel

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 .