Stumpff functions are an infinite series that depends on the value of z. This value results from multiplying the reciprocal semi-major axis with a universal anomaly. The purpose from those functions is to calculate the variation of the universal parameter (variable) using Kepler's equation for different orbits. In this paper, each range for the reciprocal of the semi-major axis, universal anomaly, and z is calculated in order to study the behavior of Stumpff functions C(z) and S(z). The results showed that when z grew, Stumpff functions for hyperbola, parabola, and elliptical orbits were also growing. They intersected and had a tendency towards zero for both hyperbola and parabola orbits, but for elliptical orbits, Stumpff functions

The researcher [1-10] proposed a method for computing the numerical solution to quasi-linear parabolic p.d.e.s using a Chebyshev method. The purpose of this paper is to extend the method to problems with mixed boundary conditions. An error analysis for the linear problem is given and a global element Chebyshev method is described. A comparison of various chebyshev methods is made by applying them to two-point eigenproblems. It is shown by analysis and numerical examples that the approach used to derive the generalized Chebyshev method is comparable, in terms of the accuracy obtained, with existing Chebyshev methods.

This article deals with the approximate algorithm for two dimensional multi-space fractional bioheat equations (M-SFBHE). The application of the collection method will be expanding for presenting a numerical technique for solving M-SFBHE based on “shifted Jacobi-Gauss-Labatto polynomials” (SJ-GL-Ps) in the matrix form. The Caputo formula has been utilized to approximate the fractional derivative and to demonstrate its usefulness and accuracy, the proposed methodology was applied in two examples. The numerical results revealed that the used approach is very effective and gives high accuracy and good convergence.

Heuristic Program proposal for the treatment of talented emotional and Cognitive problems .

1-The Curtent research aims : to identify the needs of gifted students and their problems and Ways to diagnose .

2-reprepare aproposal heuristic program for the treatment of emotional and Cognitive talented problems .

Research . Methodology : analytical and descriptive .

Define the terms

Virt uoso is the per for mance of the privileged Mstmrave performances appear in any area of his Values .

Chapter ll : Includes recipes gifted child and Methods diagnosis gifted by filtrontion and standavds of personal and mental and behavioral Doramwaliman and parental Features and Leader in the detection of the gif

KE Sharquie, AA Khorsheed, AA Al-Nuaimy, Saudi Medical Journal, 2007 - Cited by 91

The Multiple Signal Classification (MUSIC) algorithm is the most popular algorithm to estimate the Angle of Arrival (AOA) of the received signals. The analysis of this algorithm (MUSIC) with typical array antenna element ( ) shows that there are two false direction indication in the plan
aligned with the axis of the array. In this paper a suggested modification on array system is proposed by using two perpendiculars crossed dipole array antenna in spite of one array antenna. The suggested modification does not affect the AOA estimation algorithm. The simulation and results shows that the proposed solution overcomes the MUSIC problem without any effect on the performance of the system.

The support vector machine, also known as SVM, is a type of supervised learning model that can be used for classification or regression depending on the datasets. SVM is used to classify data points by determining the best hyperplane between two or more groups. Working with enormous datasets, on the other hand, might result in a variety of issues, including inefficient accuracy and time-consuming. SVM was updated in this research by applying some non-linear kernel transformations, which are: linear, polynomial, radial basis, and multi-layer kernels. The non-linear SVM classification model was illustrated and summarized in an algorithm using kernel tricks. The proposed method was examined using three simulation datasets with different sample

Pattern matching algorithms are usually used as detecting process in intrusion detection system. The efficiency of these algorithms is affected by the performance of the intrusion detection system which reflects the requirement of a new investigation in this field. Four matching algorithms and a combined of two algorithms, for intrusion detection system based on new DNA encoding, are applied for evaluation of their achievements. These algorithms are Brute-force algorithm, Boyer-Moore algorithm, Horspool algorithm, Knuth-Morris-Pratt algorithm, and the combined of Boyer-Moore algorithm and Knuth–Morris– Pratt algorithm. The performance of the proposed approach is calculated based on the executed time, where these algorithms are applied o

Intrusion detection systems detect attacks inside computers and networks, where the detection of the attacks must be in fast time and high rate. Various methods proposed achieved high detection rate, this was done either by improving the algorithm or hybridizing with another algorithm. However, they are suffering from the time, especially after the improvement of the algorithm and dealing with large traffic data. On the other hand, past researches have been successfully applied to the DNA sequences detection approaches for intrusion detection system; the achieved detection rate results were very low, on other hand, the processing time was fast. Also, feature selection used to reduce the computation and complexity lead to speed up the system