In this study, the first kind Bessel function was used to solve Kepler equation for an elliptical orbiting satellite. It is a classical method that gives a direct solution for calculation of the eccentric anomaly. It was solved for one period from (M=0-360)° with an eccentricity of (e=0-1) and the number of terms from (N=1-10). Also, the error in the representation of the first kind Bessel function was calculated. The results indicated that for eccentricity of (0.1-0.4) and (N = 1-10), the values of eccentric anomaly gave a good result as compared with the exact solution. Besides, the obtained eccentric anomaly values were unaffected by increasing the number of terms (N = 6-10) for eccentricities (0.8 and 0.9). The Bessel

Abstract

     Oil is considered a commodity and is still an important and prominent role in drawing and shaping the Iraqi economic scene. The revenues generated from the export of oil are considered the main source of the general budget in cash flows.  

     Since the revenues consist of quantity and price and the latter is an external factor which is difficult to predict, The effect of any commodity on its price, which is proven in the theory of micro-economic, but it is observed through the research that the response is slow, which means not to take advantage of the rise in prices, by increasing the quantity exported, the result of several facto

<p><span>A Botnet is one of many attacks that can execute malicious tasks and develop continuously. Therefore, current research introduces a comparison framework, called BotDetectorFW, with classification and complexity improvements for the detection of Botnet attack using CICIDS2017 dataset. It is a free online dataset consist of several attacks with high-dimensions features. The process of feature selection is a significant step to obtain the least features by eliminating irrelated features and consequently reduces the detection time. This process implemented inside BotDetectorFW using two steps; data clustering and five distance measure formulas (cosine, dice, driver &amp; kroeber, overlap, and pearson correlation

Abstract:

     This study aims to identify the level of patients’ satisfaction among a sample of hospitalized patients in the targeted hospital (Al-Kindy Teaching Hospital, and Al-Yarmook Teaching Hospital). Moreover, this study highlights the reality of services for patients, especially in the targeted governmental teaching hospitals. The Patient Satisfaction with Nursing Care (PSNCS) has been measured in these hospitals through the revised scale by Tang et al, (2013).This scale includes four major domains; Health Information (5 items), Influencing Support (4 items), Decision Control (4 items), Specialized Technical Competence (7 items). The method of surveying patients’ opinions about the degree

The γ- mixing ratios of γ- transitions from levels of 56Fe populated in reaction are calculated using least square fitting program for the first time in the case of pure and mixed transitions the results obtained have been compound with γ Values determined by other methods .The comparison shows that the agreement is good this confirmed the valilety of this method in calculating of values for such γ- transitions key word: γ- transition ,Multipole mixing ratios ,Least square fitting method.

This paper presents a comparative study of two learning algorithms for the nonlinear PID neural trajectory tracking controller for mobile robot in order to follow a pre-defined path. As simple and fast tuning technique, genetic and particle swarm optimization algorithms are used to tune the nonlinear PID neural controller's parameters to find the best velocities control actions of the right wheel and left wheel for the real mobile robot. Polywog wavelet activation function is used in the structure of the nonlinear PID neural controller. Simulation results (Matlab) and experimental work (LabVIEW) show that the proposed nonlinear PID controller with PSO
learning algorithm is more effective and robust than genetic learning algorithm; thi

Steganography is the art of secret communication. Its purpose is to hide the presence of information, using, for example, images as covers. The frequency domain is well suited for embedding in image, since hiding in this frequency domain coefficients is robust to many attacks. This paper proposed hiding a secret image of size equal to quarter of the cover one. Set Partitioning in Hierarchal Trees (SPIHT) codec is used to code the secret image to achieve security. The proposed method applies Discrete Multiwavelet Transform (DMWT) for cover image. The coded bit stream of the secret image is embedded in the high frequency subbands of the transformed cover one. A scaling factors ? and ? in frequency domain control the quality of the stego

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

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