The equation of Kepler is used to solve different problems associated with celestial mechanics and the dynamics of the orbit. It is an exact explanation for the movement of any two bodies in space under the effect of gravity. This equation represents the body in space in terms of polar coordinates; thus, it can also specify the time required for the body to complete its period along the orbit around another body. This paper is a review for previously published papers related to solve Kepler’s equation and eccentric anomaly. It aims to collect and assess changed iterative initial values for eccentric anomaly for forty previous years. Those initial values are tested to select the finest one based on the number of iterations, as well as the

Electromyogram (EMG)-based Pattern Recognition (PR) systems for upper-limb prosthesis control provide promising ways to enable an intuitive control of the prostheses with multiple degrees of freedom and fast reaction times. However, the lack of robustness of the PR systems may limit their usability. In this paper, a novel adaptive time windowing framework is proposed to enhance the performance of the PR systems by focusing on their windowing and classification steps. The proposed framework estimates the output probabilities of each class and outputs a movement only if a decision with a probability above a certain threshold is achieved. Otherwise (i.e., all probability values are below the threshold), the window size of the EMG signa

To finalize any construction investment project, it would be necessary to identify the most significant problems and obstacles that lead to project reluctance and stalling. Unexpected events and conflicts may have disrupted these strategies and impacted project development. Due to the high initial investment costs of construction projects, crises can have an immediate impact, resulting in significant financial losses. The 2014 financial crisis was one of the most prominent crises that Iraq faced, which prompted the researcher to identify and evaluate those obstacles through this research and questionnaires using Pareto scientific theory to exclude factors that do not contribute to project lag. It was discovered that 28 o

Malaria is a curative disease, with therapeutics available for patients, such as drugs that can prevent future malaria infections in countries vulnerable to malaria. Though, there is no effective malaria vaccine until now, although it is an interesting research area in medicine. Local descriptors of blood smear image are exploited in this paper to solve parasitized malaria infection detection problem. Swarm intelligence is used to separate the red blood cells from the background of the blood slide image in adaptive manner. After that, the effective corner points are detected and localized using Harris corner detection method. Two types of local descriptors are generated from the local regions of the effective corners which are Gabor based f

 

    The combination of wavelet theory and neural networks has lead to the development of wavelet networks. Wavelet networks are feed-forward neural networks using wavelets as activation function. Wavelets networks have been used in classification and identification problems with some success.

  In this work we proposed a fuzzy wavenet network (FWN), which learns by common back-propagation algorithm to classify medical images. The library of medical image has been analyzed, first. Second, Two experimental tables’ rules provide an excellent opportunity to test the ability of fuzzy wavenet network due to the high level of information variability often experienced with this type of images.

&n

In this paper, the problem of resource allocation at Al-Raji Company for soft drinks and juices was studied. The company produces several types of tasks to produce juices and soft drinks, which need machines to accomplish these tasks, as it has 6 machines that want to allocate to 4 different tasks to accomplish these tasks. The machines assigned to each task are subject to failure, as these machines are repaired to participate again in the production process. From past records of the company, the probability of failure machines at each task was calculated depending on company data information. Also, the time required for each machine to complete each task was recorded. The aim of this paper is to determine the minimum expected ti

There are many tools and S/W systems to generate finite state automata, FSA, due to its importance in modeling and simulation and its wide variety of applications. However, no appropriate tool that can generate finite state automata, FSA, for DNA motif template due to the huge size of the motif template. In addition to the optional paths in the motif structure which are represented by the gap. These reasons lead to the unavailability of the specifications of the automata to be generated. This absence of specifications makes the generating process very difficult. This paper presents a novel algorithm to construct FSAs for DNA motif templates. This research is the first research presents the problem of generating FSAs for DNA motif temp

ABSTRUCT

In This Paper, some semi- parametric spatial models were estimated, these models are, the semi – parametric spatial error model (SPSEM), which suffer from the problem of spatial errors dependence, and the semi – parametric spatial auto regressive model (SPSAR). Where the method of maximum likelihood was used in estimating the parameter of spatial error          ( λ ) in the model (SPSEM), estimated  the parameter of spatial dependence ( ρ ) in the model ( SPSAR ), and using the non-parametric method in estimating the smoothing function m(x) for these two models, these non-parametric methods are; the local linear estimator (LLE) which require finding the smoo

      It is frequently asserted that an advantage of a binary search tree implementation of a set over linked list implementation is that for reasonably well balanced binary search trees the average search time (to discover whether or not a particular element is present in the set) is O(log N) to the base 2 where N is the number of element in the set (the size of the tree).  This paper presents an experiment for measuring and comparing the obtained binary search tree time with the expected time (theoretical), this experiment proved the correctness of the hypothesis, the experiment is carried out using a program in turbo Pascal with recursion technique implementation and a statistical method  to prove th

In a connected graph , the distance function between each pair of two vertices from a set vertex  is the shortest distance between them and the vertex degree  denoted by  is the number of edges which are incident to the vertex  The Schultz and modified Schultz polynomials of  are have defined as:

 respectively, where the summations are taken over all unordered pairs of distinct vertices in  and  is the distance between  and  in  The general forms of Schultz and modified Schultz polynomials shall be found and indices of the edge – identification chain and ring – square graphs in the present work.