There is an evidence that channel estimation in communication systems plays a crucial issue in recovering the transmitted data. In recent years, there has been an increasing interest to solve problems due to channel estimation and equalization especially when the channel impulse response is fast time varying Rician fading distribution that means channel impulse response change rapidly. Therefore, there must be an optimal channel estimation and equalization to recover transmitted data. However. this paper attempt to compare epsilon normalized least mean square (ε-NLMS) and recursive least squares (RLS) algorithms by computing their performance ability to track multiple fast time varying Rician fading channel with different values of Doppler frequency, as well as mean square deviation (MSD) has simulated to measure the difference between original channel and what is estimated. The simulation results of this study showed that (ε-NLMS) tend to perform fast time varying Rician fading channel better than (RLS) adaptive filter.
In this paper, a Monte Carlo Simulation technique is used to compare the performance of MLE and the standard Bayes estimators of the reliability function of the one parameter exponential distribution.Two types of loss functions are adopted, namely, squared error loss function (SELF) and modified square error loss function (MSELF) with informative and non- informative prior. The criterion integrated mean square error (IMSE) is employed to assess the performance of such estimators .
Aim: The Aim of the study is to compare between Er,Cr:YSGG 2780 nm laser and carbide fissure bur in root-end resection regarding the morphological variations, temperature changes and the duration of resection process.
Settings and Design: 5 W, 25 Hz, 50% water, 80% air,25.47 J/cm2 .
Material and method: twenty-one extracted single rooted teeth endodontically were treated, twenty teeth were obturated and divided into two groups according to method of resection. Group 1 root-end resected using cross cut carbide bur while group 2 root-end resected using laser with MGG6 sapphire tip of 600 μm diameter. Temperature on external root surface and duration of resection were recor
... Show MoreThe importance of Public Relations activity has increased during the last half of the last century as a specialized and modern administrative function in most institutions. It has, moreover, become an integral part of activities of those institutions of various types, due to its pivotal role in building its reputation and drawing a good mental image among its audiences, as well as its influential and basic role in maintaining communication and the communication between its members at its various levels and their job tasks to ensure the greatest amount of understanding and to enhance trust between them. This is why public relations activity has become indispensable in all institutions, and without it, it is difficult to achieve any coordi
... Show MoreTo expedite the learning process, a group of algorithms known as parallel machine learning algorithmscan be executed simultaneously on several computers or processors. As data grows in both size andcomplexity, and as businesses seek efficient ways to mine that data for insights, algorithms like thesewill become increasingly crucial. Data parallelism, model parallelism, and hybrid techniques are justsome of the methods described in this article for speeding up machine learning algorithms. We alsocover the benefits and threats associated with parallel machine learning, such as data splitting,communication, and scalability. We compare how well various methods perform on a variety ofmachine learning tasks and datasets, and we talk abo
... Show MoreThe problems of modeling the signal and dispersion properties of a second order recursive section in the integer parameter space are considered. The formulation and solution of the section synthesis problem by selective and dispersive criteria using the methods of integer nonlinear mathematical programming are given. The availability of obtaining both positive and negative frequency dispersion of a signal in a recursive section, as well as the possibility of minimizing dispersion distortions in the system, is shown.
Canonical correlation analysis is one of the common methods for analyzing data and know the relationship between two sets of variables under study, as it depends on the process of analyzing the variance matrix or the correlation matrix. Researchers resort to the use of many methods to estimate canonical correlation (CC); some are biased for outliers, and others are resistant to those values; in addition, there are standards that check the efficiency of estimation methods.
In our research, we dealt with robust estimation methods that depend on the correlation matrix in the analysis process to obtain a robust canonical correlation coefficient, which is the method of Biwe
... Show MoreIn this paper, a Monte Carlo Simulation technique is used to compare the performance of the standard Bayes estimators of the reliability function of the one parameter exponential distribution .Three types of loss functions are adopted, namely, squared error loss function (SELF) ,Precautionary error loss function (PELF) andlinear exponential error loss function(LINEX) with informative and non- informative prior .The criterion integrated mean square error (IMSE) is employed to assess the performance of such estimators
Some experiments need to know the extent of their usefulness to continue providing them or not. This is done through the fuzzy regression discontinuous model, where the Epanechnikov Kernel and Triangular Kernel were used to estimate the model by generating data from the Monte Carlo experiment and comparing the results obtained. It was found that the. Epanechnikov Kernel has a least mean squared error.
The focus of this paper is the presentation of a new type of mapping called projection Jungck zn- Suzuki generalized and also defining new algorithms of various types (one-step and two-step algorithms) (projection Jungck-normal N algorithm, projection Jungck-Picard algorithm, projection Jungck-Krasnoselskii algorithm, and projection Jungck-Thianwan algorithm). The convergence of these algorithms has been studied, and it was discovered that they all converge to a fixed point. Furthermore, using the previous three conditions for the lemma, we demonstrated that the difference between any two sequences is zero. These algorithms' stability was demonstrated using projection Jungck Suzuki generalized mapping. In contrast, the rate of convergenc
... Show More