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

Krawtchouk polynomials (KPs) and their moments are promising techniques for applications of information theory, coding theory, and signal processing. This is due to the special capabilities of KPs in feature extraction and classification processes. The main challenge in existing KPs recurrence algorithms is that of numerical errors, which occur during the computation of the coefficients in large polynomial sizes, particularly when the KP parameter (p) values deviate away from 0.5 to 0 and 1. To this end, this paper proposes a new recurrence relation in order to compute the coefficients of KPs in high orders. In particular, this paper discusses the development of a new algorithm and presents a new mathematical model for computing the

ABSTRACT : This research involves the synthesis of five to seven heterocyclic compounds starting with Schiff’s bases which derived from oxime as a starting material. 1.3-oxazepine derivatives were prepared from adding different anhydrides to the Schiff bases, tetrazole and thiazolidinone derivatives synthesized from add sodium azide and thioglycolic acid to the same Schiff’s bases as a five members ring. Pyrimidine derivatives were prepared after the reaction of the azomethine group with acetyl chloride and then urea and thiourea to synthesis on derivatives contain the six members ring. Another step included identified and confirmed these compounds by FT- IR, 1HNMR, TLC and 13CNMR finally, step included the assay of biological activity

The paper presents a highly accurate power flow solution, reducing the possibility of ending at local minima, by using Real-Coded Genetic Algorithm (RCGA) with system reduction and restoration. The proposed method (RCGA) is modified to reduce the total computing time by reducing the system in size to that of the generator buses, which, for any realistic system, will be smaller in number, and the load buses are eliminated. Then solving the power flow problem for the generator buses only by real-coded GA to calculate the voltage phase angles, whereas the voltage magnitudes are specified resulted in reduced computation time for the solution. Then the system is restored by calculating the voltages of the load buses in terms

Recently, there has been an increasing advancement in the communications technology, and due to the increment in using the cellphone applications in the diverse aspects of life, it became possible to automate home appliances, which is the desired goal from residences worldwide, since that provides lots of comfort by knowing that their appliances are working in their highest effi ciency whenever it is required without their knowledge, and it also allows them to control the devices when they are away from home, including turning them on or off whenever required. The design and implementation of this system is carried out by using the Global System of Mobile communications (GSM) technique to control the home appliances – In this work, an ele

This work presents a five-period chaotic system called the Duffing system, in which the effect of changing the initial conditions and system parameters d, g and w, on the behavior of the chaotic system, is studied. This work provides a complete analysis of system properties such as time series, attractors, and Fast Fourier Transformation Spectrum (FFT). The system shows periodic behavior when the initial conditions xi and yi equal 0.8 and 0, respectively, then the system becomes quasi-chaotic when the initial conditions xi and yi equal 0 and 0, and when the system parameters d, g and w equal 0.02, 8 and 0.09. Finally, the system exhibits hyperchaotic behavior at the first two conditions, 0 and 0, and the bandwidth of the chaotic

Precision is one of the main elements that control the quality of a geodetic network, which defines as the measure of the network efficiency in propagation of random errors. This research aims to solve ZOD and FOD problems for a geodetic network using Rosenbrock Method to optimize the geodetic networks by using MATLAB programming language, to find the optimal design of geodetic network with high precision. ZOD problem was applied to a case study network consists of 19 points and 58 designed distances with a priori deviation equal to 5mm, to determine the best points in the network to consider as control points. The results showed that P55 and P73 having the minimum ellipse of error and considered as control points. FOD problem was applie

The aim of this paper is to present a method for solving third order ordinary differential equations with two point boundary condition , we propose two-point osculatory interpolation to construct polynomial solution. The original problem is concerned using two-points osculatory interpolation with the fit equal numbers of derivatives at the end points of an interval [0 , 1] . Also, many examples are presented to demonstrate the applicability, accuracy and efficiency of the method by compared with conventional method .

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