The purpose of this article is to improve and minimize noise from the signal by studying wavelet transforms and showing how to use the most effective ones for processing and analysis. As both the Discrete Wavelet Transformation method was used, we will outline some transformation techniques along with the methodology for applying them to remove noise from the signal. Proceeds based on the threshold value and the threshold functions Lifting Transformation, Wavelet Transformation, and Packet Discrete Wavelet Transformation. Using AMSE, A comparison was made between them , and the best was selected. When the aforementioned techniques were applied to actual data that was represented by each of the prices, it became evident that the lift

This paper proposes a new algorithm (F2SE) and algorithm (Alg(n – 1)) for solving the
two-machine flow shop problem with the objective of minimizing total earliness. This
complexity result leads us to use an enumeration solution approach for the algorithm (F2SE)
and (DM) is more effective than algorithm Alg( n – 1) to obtain approximate solution.

Background: Tumor-like overgrowth lesions of the oral mucosa are pathological growths that project above the normal contour of the oral surface. A practical classification can be made according to the site of origin, the etiology and the histological appearance. The aim of this article is to evaluate and analyze patients with gingival and alveolar ridge tumor-like overgrowth lesions in terms of surgical treatment, diagnosis and outcome. Materials and Methods: Patients complaining of these lesions were treated by surgical excision under local or general anesthesia; the excised lesions were submitted for histopathological examination, during the follow up period the patients were examined for complications and recurrence. Results: Pyogenic gr

Background: Tumor-like overgrowth lesions of the oral mucosa are pathological growths that project above the normal contour of the oral surface. A practical classification can be made according to the site of origin, the etiology and the histological appearance. The aim of this article is to evaluate and analyze patients with gingival and alveolar ridge tumor-like overgrowth lesions in terms of surgical treatment, diagnosis and outcome. Materials and Methods: Patients complaining of these lesions were treated by surgical excision under local or general anesthesia; the excised lesions were submitted for histopathological examination, during the follow up period the patients were examined for complications and recurrence. Results: Pyogenic gr

Abstract:

 This research aims to compare Bayesian Method and Full Maximum Likelihood to estimate hierarchical Poisson regression model.

The comparison was done by  simulation  using different sample sizes (n = 30, 60, 120) and different Frequencies (r = 1000, 5000) for the experiments as was the adoption of the  Mean Square Error to compare the preference estimation methods and then choose the best way to appreciate model and concluded that hierarchical Poisson regression model that has been appreciated Full Maximum Likelihood Full Maximum Likelihood  with sample size  (n = 30) is the best to represent the maternal mortality data after it has been reliance value param

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).

   The research tackled to solve Sudoku grid problem 9 ×9 , one of artificial intelligence problems. This problem has many of solutions in search space to generate Sudoku grid by using magic square of odd order as 3. This research concludes solution by proposed heuristic algorithm from magic square of odd order as 3 and no given numbers (from 1 to 9) in each cell of nine Sudoku grid cells in starting of problem solution, this is not similar the solution in old classic methods to generate all sub grids in Sudoku grid. The experimental results in this paper show the easily implementation to solve the problem to manage without manual method, additional to position of numbers (1, 2,..9) in center of each sub grid in Sudoku grid