Search

This paper examined 1122 statistical tests found in 55 master theses accredited during 1995-2000 at Mu'tah University. It tried to answer two main questions: First, do researchers still relying on the level of significance (a) as the only criterion to judge the importance of relations and differences? Second, to what extent practical significance can be found along with statistical significance? Results showed that researchers do consider statistical significance as the only criterion to judge the importance of their findings. 74.33% of the statistically significant tests were having a small practical significance, and only 10.27% were of large practical significance.

This paper examined 1122 statistical tests found in 55 master theses accredited during 1995-2000 at Mu'tah University. It tried to answer two main questions: First, do researchers still relying on the level of significance (a) as the only criterion to judge the importance of relations and differences? Second, to what extent practical significance can be found along with statistical significance? Results showed that researchers do consider statistical significance as the only criterion to judge the importance of their findings. 74.33% of the statistically significant tests were having a small practical significance, and only 10.27% were of large practical significance.

A ring R is called a right dual ring if rl(T) = T for all right ideals T of R. The main purpose of this paper is to develop some basic properties of dual rings and to give the connection between dual rings, regular rings and strongly regular rings.

The main purpose of this paper is to study ERT and MERT rings, in order to study the connection between such rings and II-regular rings.

This paper deals with the well known Henon map. Its main properties are studied as well as a non deterministic form. Least squares estimates of parameters of the non deterministic model are driven and a case study from animal ecology is studied, where the population size of the Canadian lynx animal is considered as a time series. The embedding dimension of this time series is estimated and then a mathematical model of the form of suggested non deterministic (stochastic) model is fitted . The chaotic property of this series is studied throughout the fitted model.

In this paper a class of self-scaling VM-algorithms for unconstrained optimization is investigated. Some theoretical results are given on the scaling strategies that guarantee the global convergence of the new proposed algorithm.

In this paper we estimate that the equation of smoothing to the first Smoothing is the same equation of double exponentioal smoothing, and finding the equation of prediction of two state first: the variance of the original time cerise xt ,( σ2xt )is the same as the variance of the Ft, , (σ2Ft), ( σ2xt=, σ2Ft), and the second state the variance of xt , , (σ2xt)is not the same as the variance of Ft , σ2ft , ( σ2xt=, σ2Ft),. Ft This results will be applied to the real data which represent the mean of relative wet of Mosul city, and also to the data obtained form simulation, with use the (χ2 , MSD) to select the best of smoothing.

The objective of this paper is to initiate the study of rings in which each simple right R-module is flat, such rings will be called right SF-rings. Some important properties of right SF-rings are obtained. Among other results we prove that: If R is a semi prime ERT right SF-ring with zero socle, then R is a strongly regular ring.

In this paper we will discuss and find the order of accuracy for subsystems of ODE that obtained from partitioning the successive Over relaxation(SOR) method and we will show that the form of equation to be solved after applying the waveform relaxation scheme is : Where ω ,the relaxation parameter ,should be chosen so that the rate of convergence is maximized .

A ring R is called a right SF-ring if all its simple right R-modules are flat. It is well known that Von Neumann regular rings are right and left SF-rings. In this paper we study conditions under which SF-rings are strongly regular. Finally, some new characterstic properties of right SF-rings are given.

The aim of this paper is to extend several known results on GPF –rings. π-regular rings, PF-rings and GP-ideals are also considered. Among other results we prove that: If R is a uniform ring, then R is a GPF-ring if and only if every element of R is either non-zero divisor or nilpotent.

The main objective of this paper is the development of a new parallel integration algorithm for Solving Boundary Value Problem (BVPs) in Ordinary Differential Equation, (ODEs). This algorithm is suitable for running on MIMD computing systems. We will analysis the stability and error control of the developed algorithm .We shall also consider the treatment of stiff boundary value problems by developed technique.

In this paper we have investigated a new initial parameter, the new parameter is to make balance between interior suitable for inequality constrained exterior method (suitable for equality and inequality constrained) for non-linear constrained optimization. The new algorithm is programmed to solve some standard problems in non-linear optimization method. The results are too effective when compared with Barriar –Penalty algorithm.

The main objective of this paper is to develop and construct numerical algorithms for solving stiff system of ordinary differential equations (ODEs) which are suitable for running on parallel computers (MIMD computers).Semi-parallel implicit Runge-Kutta methods have been derived and parallel predictor - corrector methods are developed.

This paper suggests a new system of time-series called Expectation Correlate System (ECS) that are good at detecting the behavior of dynamical systems (both deterministic and stochastic systems) and the dependence on initial values. A new measure on sensitivity to initial values can be monitored by the newly defined Lyaponov Correlate, so ECS can be a signal to chaotic property. In a stochastic systems, small shifts in some initial value can lead to error in prediction, this property and a new measure to nonlinear systems are study by using the conditional variance of ECS. All results are computed by using Matlab.

In this paper we present a mathematical model for two- dimensional incompressible flow in a symmetric thin liquid films with the viscosity forces, which can be very small, compared with surface tension and inertia forces. We obtain the governing differential equation for such flow, we also determine the solution of equations and also we consider an inviscid waves in thin films.

After having reviewed the RETARD code, which was originally written by Hairer & Wanner in 1995 with the aim of solving delay differential equations (DDEs), a new arithmetic called OSFESOR code is presented in this paper. The OSFESOR (Optimal stepsize for each step of RETARD) code is a tool for automatic implementation of DDEs in Fortran 77. Consequently, by use of the OSFESOR code, it is possible during the run of a program to evaluate the solution of DDEs with optimal stepsize, H, for each step , to evaluate the accuracy of any result provided by the computer . In short, the use of OSFESOR code serves to validate the result provided by a computer, and to assure the user of the reliability of scientific computations.

Today there are a number of algorithms developed in the framework of international committees that allow still image compression. In this paper, the area of Vector Quantization (VQ) neural network with the Self-Organizing Feature Map (SOFM) has been compared with the ordinary vector Quantization technique Linde-Buzo-Gray (LBG) in image compression. The results were compared with the Back Propagation Neural Network BPNN which was employed to design a code book of an image to be compressed using VQ method. Results show that the neural technique gives a performance that is very close to optimal. The BPNN scheme not only has the advantage of the SOFM - VQ scheme but also improves the coded image quality. Experimental results are given and comparisons are made using the BPNN coding scheme and some other coding techniques. In the experiments, the BPNN coding scheme achieves the better visual quality about edge region and the best peak signal-to-noise ratio PSNR performance at nearly the same bit rate.

The main objective of this paper is the development of a new technique for solving stiff Linear Initial Value Problems (IVPs) in Ordinary Differential Equations (ODEs), The new Technique consists of combining the linear superposition principle with the principle of Multiple shooting. We have applied the new technique successfully for solving hard stiff IVPs. Also we have studied the ability of the new technique for controlling the stability of the numerical solution of IVPs and how the new technique prevents the accumulation of round off errors.

In this paper, we consider the stability analysis for a disturbed unsteady flow, which is two-dimensional incompressible flow in a symmetric film where the effect of viscosity can be neglected in comparison with inertia forces. The partial differential equations governing such flow are obtained from the Navier - Stokes equations and we obtain an analytic solution for those equations. The whole system is disturbed and we found the regions where the flow is stable or unstable.

In this paper, a new hybrid conjugate gradient algorithm is proposed for unconstrained optimization. This algorithm combines the desirable computation aspects of Polak-Ribière steps and useful theoretical features of Fletcher-Reeves CG-steps. Computational results for this algorithm are given and compared with those of the Fletcher and Polak standard CG methods showing a considerable improvement over the latter two methods.

In this paper, a new self-scaling VM-algorithm for unconstrained non-linear optimization is investigated. Some theoretical and experimental results are given on the scaling technique, which guarantee the Super-linear of the new proposed algorithm.

The vector quantization method for image compression inherently requires the generation of a codebook which has to be made available for both the encoding and decoding processes. That necessitates the attachment of this codebook when a compressed image is stored or sent. For the purpose of improving the overall efficiency of the vector quantization method, the need arose for improving a means for the reduction of the codebook size. In this paper, a new method for vector quantization is presented by which the suggested algorithm reduces the size of the codebook generated in vector quantization. This reduction is performed by sorting the codewords of the codebook then the differences between adjacent codewords are computed. Huffman coding (lossless compression) is performed on the differences in order to reduce the size of the codebbook.

In this paper we have modified a new extended generalized conjugate gradient steps with self-scaling variable metric updates for unconstrained optimization. The new proposed algorithm is based on the inexact line searches and it is examined by using different non-linear test functions with various dimensions.

This paper involves designing graphics model for displaying and working under Windows98 operating system called Screen Saver, which is considered as one of the most significant desktop settings. Various and multiple algorithms were used and implemented for designing Screen Saver, with the capabilities of (storing its settings within the Windows98 Registry and preventing using the computer from an unauthorized user). To perform this work, Visual C++ v6.0 and Windows98 API functions were considered as programming tools. Software was tested successfully under Windows98 operating system.

In this paper several new properties of singular ideals and non- singular rings are obtained, a connection between a singular ideal and the Jacobson radical is considered , and a sufficient condition for a non- singular ring to be reduced is given.

This paper introduces the notion of maximal GP-ideal .We studied the class of rings whose maximal left ideal are right GP-ideal. We call such ring MRGP-rings. We consider a necessary and sufficient condition for MRGP-rings to be MRCP-rings. We also study the connection between MRGP-ring, kasch ring, division ring and the strongly regular ring.

The aim of this paper is to use some concepts of nonstandard analysis given by Robinson, A. and axiomataized by Nelson, E. to prove some theorems concerning the approximation of integrals and the convergence of sequences and series.

In this paper, we consider steady incompressible viscous flow in a symmetric thin liquid film on an inclined surface with angle b in two dimensions with no inertia force. The surface of the film is taken to be real that is there is no shear stress on the liquid surface. We found the differential equations that govern the flow. We solve these equations numerically by using Rang Kutta method.

The objective of this paper is to construct numerical schemes using finite difference methods for the one-dimensional general hyperbolic- parabolic- reaction problem. The finite difference method with the exponential transformation form is used to solve the problem, and employs difference approximation technique to obtain the numerical solutions. Computational examples are presented and compared with the exact solutions. We obtained that the Crank-Nicholson scheme is more accurate than Forward scheme. Therefore the form of exponential transformation for the problem yields a stable solution compared with exact solution.

The aim of the project is to develop parallel approaches for both the simplex that are used in linear programming to solve linear module systems. Most of these models are time consuming when executed and processed in the sequential microprocessor computers. During the project, we try to decrease this time and increase the efficiency of the algorithm for the two methods simplex, through developing parallel methods appropriate to be executed on MIMD type computers. In this paper, three algorithms were suggested for paralleling (a developed algorithm and a comparison was made between the three algorithms and the original. This comparison is included in second section. In general, the practical results and the suggested programs for these new algorithms proved to be better in performance than their analogues that are executed in computers of sequential processor in view of the two elements of execution time and algorithm time.

In this paper, we have investigated self-scaling sequential unconstrained minimization techniques (SUMT). Our new modified version on CG-method and QN- method shows that it is too effective when compared with other established algorithms to solve standard constrained optimization problems.

This paper presents the development and implementation of a new numberical based on a non-quadratic Triangular rational function model. For solving non-linear optimization problem .The algorithm is implemented in one version, employing exact line search. This version is compared numberically against versions of the CG-method. The results indicate that in general the new algorithm is superior to the previon algorithm.

In this paper, we have investigated a new initial parameter in the nonlinear constrained optimization method. The aim of this new method is to make a balance between interior and exterior method for constrained optimization. The new technique has been programmed to solve some of standard problems in the non-linear optimization. The results are too effective when compared with other standard optimization methods like interior and exterior methods.

In this paper, the present algorithm [4] to solve fractional programming problem for multi objective functions, investigate the algorithm to solve linear programming problem for multiobjective functions [2], the computer application of algorithm was tested on a number of numerical examples and modify the approach by using mean and median for values of objective functions, to combine objective function from objective functions for linear programming problem for multi objective functions then it has been improved the above algorithm to solve the problem and computer application of improvement algorithm has been demonstrated by a flow chart and solving numerical examples on the computer then the good results have been often, as compared to the previous method [2].

The Biharmonic equation is one of partial differential equations which arise from discussion of some applied sciences such as fluid dynamics. In this paper, we have adopted a numerical method to solve that equation, this method is developed basically from ADI (Alternating- Direction- Implicit) finite difference method which was used in the solution of Laplace equation.

In this paper, the problm of sequencing n jobs on one machine is considered with a multi objective function.Two problems have been studied, sum of completion times added with the maximum tardiness () and sum of completion times with the maximum tardiness (), the first one has optimal solution solved by Branch and bound technique, the second has efficient solutions founded by Van Wassenhove algorithm.A theorem is presented to show a relation between the number of efficient solutions, lower bound (LB) and optimal solution.This theorem restricts the range of the lower bound, which is the main factor to find the optimal solution.Also the theorem opens algebraic operations and concepts to find new lower bounds.

In this paper we consider step-size control in one class of Adams linear multi-step methods for Ordinary differential equation. Theoretical results are presented for Adam-Bashforth-Moulton formula using both Error-per-step (EPS) & Error-per-Unit -Step (EPUS) controls. These obtained by considering a 2D system of the form: where and

In this paper we used two numerical methods to investigate propagating heat solutions of PDEs. The explicit and Crank-Nicolson methods and the results show that Crank-Nicolson method is more accurate than the explicit method. As an illustration, we used the above method to an autocatalytic reaction diffusion equations involving two diffusing chemicals in one dimension.

Text encryption is a very important field in application of data transformation through the digital networks, and the Internet, so it is very necessary to do encryption operation on the text data to get more security in data transformation. In this paper, we present a method -Template Matching- to encrypt data which is represented in form of image with BMP extension by using Mono Digital Images method with partial compression for the data by using RLE method which increases the security of the method and reduces the file size. The application results is efficient for the printed or handwritten text in Arabic or English or any other language, and for the maps or sketches images. The method gives a good ability for data encryption. It is suitable for data transformation through the Internet networks.

The concept of q-semi-open sets in topological spaces was introduced in 1984 and 1986 by T. Noiri [9, 10]. In this paper we introduce and study a generalization of a contra pre semi-open maps due to (Caldas and Baker) [3], it is called contra pre qs-open maps, the maps whose images of a q-semi-open sets is q-semi-closed. Also, we introduce and study a new type of closed maps called contra pre qs-closed maps, which is stronger than contra pre semi-closed due to Caldas [2], the maps whose image of a q-semi-closed sets is q-semi-open.1991 Math. Subject Classification: 54 C10, 54 D 10.

The purpose of this paper is to introduce parallel algorithms based on the Newton method for solving non-linear unconstrained optimization problem in (MIMD) parallel computers by solving linear system in parallel using Gaussian Elimination method rather than finding inverse Hessian matrix to avoid the errors caused by evaluating the inverse matrix and also to increase computing power and reduce run time.

In this paper we have presated a heat transfer by convection in rectangular cavity filled with static fluid. Differentially heated end vertical walls. Two-dimensional motions are assumed. The governing vorticity and energy transport equations are solved by an alternating direction implicit finite- difference method. We transference heat equation into two finite- difference equations. The time interval has been deviled into two equal halves, alternating to compute an intermediate point in the first step and final value at T time. We get by result analysis, that we can reach the steady – state from Un steady –state after some iteration.

By using methods of nonstandard analysis given by Robinson, A., and axiomatized by Nelson, E., we try in this paper to establish the generalized curvature of a plane curve at regular points and at points infinitely close to a singular point. It is known that the radius of curvature of a plane curve is the limit of the radius of a circle circumscribed to a triangle ABC, where B and C are points ofinfinitely close to A. Our goal is to give a nonstandard proof of this fact. More precisely, if A is a standard point of a standard curve and B, C are points of defined by and where and are infinitesimals, we intend to calculate the quantity in the cases where A is biregular, regular, singular or singular oforder p.

The compression technique is an optimal solution for decreasing the amount of information sents out from satellites to earth station with rate transmission. In this paper, a study for the application of embedded zero tree wavelet (EZW) in image compression is incorporated. The study is implemented using the image processing toolbox of Matlab ver 6.5 .The performance of the proposed algorithm is executed and tested using the standard image of Barbara with size 512×512 pixels in bmp format. Different threshold values are used in the proposed algorithm to specify the compression ratio CR. The quality of reconstructed image is measured in terms of PSNR .The recorded results show that there are a trade off between the PSNR and CR and depends on the type of used image .In this work the extraction of the results are focused on two types of local area satellites images .The first image is the Mosul dam area with simple and limited topography .The second image is the Singar area with different and difficult topography .The results show that at threshold of 16 , the CR is a round 1:60 with PSNR more than 34 dB ,for the tested image .

This paper present a Resilient Backpropagation (RBP) algorithm based on hierarchical neural network for image compression. The proposed technique includes steps to break down large images into smaller blocks for image compression/ decompression process. Furthermore, a Linear Backpropagation (LBP) algorithm is also used to train hierarchical neural network, and both training algorithms are compared. A number of experiments have been achieved, the results obtained, are the compression rate and Peak Signal to Noise Ratio of the compressed/ decompressed images which are presented in this paper.

The minimum distance of a vertex v to an set of vertices of a graph G is defined as : . The n-Wiener polynomial for this distance of a graph G is defined as , where is the number of order pairs (v,S), , such that , and is the diameter for this minimum n-distance. In this paper, the n-Wiener polynomials for some types of graphs such as complete graphs, bipartite graphs, star graphs, wheel graphs, path and cycle graphs are obtained .The n-Wiener index for each of these special graphs is given. Moreover, some properties of the coefficients of are established.

In this paper, we have developed a new self-scaling VM-method for solving unconstrained nonlinear optimization problems. The numerical and theoretical results demonstrate the general effectiveness of the new self-scaling VM-method when compared with PHUA & ZENG algorithm ; we have tested these algorithms on several high-dimension test functions with promising numerical results.

Chae et. al. (1995) have studied the concept of a-strongly q-continuous functions and (a, q)-closed graph. The aim of this paper is to investigate several new characterizations and properties of a-strongly q-continuous functions and (a, q)-closed graph. Also, we define a new type of functions called aq-open functions, which is stronger than quasi a-open and hence strongly a-open, and we obtain some characterizations and properties for it. It is shown that the graph of f, G ( f ) is (a, q)-closed graph if and only if for each filter base Y in X q-converging to some p in X such that f (Y) a-converges to some q in Y holds, f ( p) = q.

This paper introduces the notion of a right MEP-ring (a ring in which every maximal essential right ideal is left pure) with some of their basic properties; we also give necessary and sufficient conditions for MEP – rings to be strongly regular rings and weakly regular rings.