The quality of Global Navigation Satellite Systems (GNSS) networks are considerably influenced by the configuration of the observed baselines. Where, this study aims to find an optimal configuration for GNSS baselines in terms of the number and distribution of baselines to improve the quality criteria of the GNSS networks. First order design problem (FOD) was applied in this research to optimize GNSS network baselines configuration, and based on sequential adjustment method to solve its objective functions.
FOD for optimum precision (FOD-p) was the proposed model which based on the design criteria of A-optimality and E-optimality. These design criteria were selected as objective functions of precision, whic
... Show MoreSpeech is the essential way to interact between humans or between human and machine. However, it is always contaminated with different types of environment noise. Therefore, speech enhancement algorithms (SEA) have appeared as a significant approach in speech processing filed to suppress background noise and return back the original speech signal. In this paper, a new efficient two-stage SEA with low distortion is proposed based on minimum mean square error sense. The estimation of clean signal is performed by taking the advantages of Laplacian speech and noise modeling based on orthogonal transform (Discrete Krawtchouk-Tchebichef transform) coefficients distribution. The Discrete Kra
A novel median filter based on crow optimization algorithms (OMF) is suggested to reduce the random salt and pepper noise and improve the quality of the RGB-colored and gray images. The fundamental idea of the approach is that first, the crow optimization algorithm detects noise pixels, and that replacing them with an optimum median value depending on a criterion of maximization fitness function. Finally, the standard measure peak signal-to-noise ratio (PSNR), Structural Similarity, absolute square error and mean square error have been used to test the performance of suggested filters (original and improved median filter) used to removed noise from images. It achieves the simulation based on MATLAB R2019b and the resul
... Show MoreNanoparticles of Pb1-xCdxS within the composition of 0≤x≤1 were prepared from the reaction of aqueous solution of cadmium acetate, lead acetate, thiourea, and NaOH by chemical co-precipitation. The prepared samples were characterized by UV-Vis spectroscopy(in the range 300-1100nm) to study the optical properties, AFM and SEM to check the surface morphology(Roughness average and shape) and the particle size. XRD technique was used to determine the crystalline structure, XRD technique was used to determine the purity of the phase and the crystalline structure, The crystalline size average of the nanoparticles have been found to be 20.7, 15.48, 11.9, 11.8, and 13.65 nm for PbS, Pb0.75Cd0.25S,
... Show MoreThe role of Iraqi newspapers in instilling political culture among the public after 2003, a field study on the audience of the city of Baghdad, University of Baghdad, College of Information, Department of Journalism, 2019,
The problem of research is to investigate the role of Iraqi newspapers in instilling the political culture of individuals after 2003, and monitor this role Through the contents and messages provided by the Iraqi newspapers to the public. the research is classified within descriptive research, it adopts the survey methodology and used the questionnaire tool. In fact, the questionnaire was distributed to a sample of 400 individuals that was selected according to the method of multi-stage cluster sample of those who re
Orthogonal polynomials and their moments serve as pivotal elements across various fields. Discrete Krawtchouk polynomials (DKraPs) are considered a versatile family of orthogonal polynomials and are widely used in different fields such as probability theory, signal processing, digital communications, and image processing. Various recurrence algorithms have been proposed so far to address the challenge of numerical instability for large values of orders and signal sizes. The computation of DKraP coefficients was typically computed using sequential algorithms, which are computationally extensive for large order values and polynomial sizes. To this end, this paper introduces a computationally efficient solution that utilizes the parall
... Show More