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.

This research aims to choose the appropriate  probability ‎ distribution  ‎‏‎ to the reliability‎        analysis‎ for  an   item through ‎ collected data for operating and stoppage  time of  the case  study.

    Appropriate choice for .probability distribution   is when  the data look to be on or  close the form fitting line for probability plot and test the data  for  goodness of fit .

     Minitab’s 17 software  was used ‎  for this  purpose after  arranging collected data and setting it in the the program‎.

 &nb

Due to the large size of dealing in the transactions installment sales in durable products, especially real estate given the privacy to enjoy their property, among other products because of the large amount and the length of the repayment period leading to a risk of non-payment by the buyer because of the possibility to change the credit level to him, especially that most of this type of transaction customers are from limited income owners,  So it has been proposed the use of other transactions in handling real estate instead of installment sales transactions, a rental sale transactions because of the protection provided by this transaction for a vendor that will be mentioned later.

So proposes to st

     In this work, the methods (Moments, Modified Moments, L-Moments, Percentile, Rank Set sampling and Maximum Likelihood) were used to estimate the reliability function and the two parameters of the Transmuted Pareto (TP) distribution. We use simulation to generate the required data from three cases this indicates  sample size , and it replicates  for the real value for parameters, for reliability times values  we take .

Results were compared by using mean square error (MSE), the result appears as follows :

The best methods are Modified Moments, Maximum likelihood and L-Moments in first case, second case and third case respectively.

   In this research, an adaptive Canny algorithm using fast Otsu multithresholding method is presented, in which fast Otsu multithresholding method is used to calculate the optimum maximum and minimum hysteresis values and used as automatic thresholding for the fourth stage of the Canny algorithm.      The new adaptive Canny algorithm and the standard Canny algorithm (manual hysteresis value) was tested on standard image (Lena) and satellite image. The results approved the validity and accuracy of the new algorithm to find the images edges for personal and satellite images as pre-step for image segmentation.  
 

Abstract 

     The aim of this work is to create a power control system for wind turbines based on fuzzy logic. Three power control loop was considered including: changing the pitch angle of  the blade, changing the length of the blade and turning the nacelle. The stochastic law was given for changes and instant inaccurate assessment of wind conditions changes. Two different algorithms were used for fuzzy inference in the control loop, the Mamdani and Larsen algorithms. These two different algorithms are materialized and developed in this study in Matlab-Fuzzy logic toolbox which has been practically implemented using necessary intelligent control system in electrical engineerin

Video copyright protection is the most generally acknowledged method of preventing data piracy. This paper proposes a blind video copyright protection technique based on the Fast Walsh Hadamard Transform (FWHT), Discrete Wavelet Transform (DWT), and Arnold Map. The proposed method chooses only frames with maximum and minimum energy features to host the watermark. It also exploits the advantages of both the fast Walsh Hadamard transform (FWHT) and discrete wavelet transforms (DWT) for watermark embedding. The Arnold map encrypts watermarks before the embedding process and decrypts watermarks after extraction. The results show that the proposed method can achieve a fast embedding time, good transparency, and robustness against various