The problem of Bi-level programming is to reduce or maximize the function of the target by having another target function within the constraints. This problem has received a great deal of attention in the programming community due to the proliferation of applications and the use of evolutionary algorithms in addressing this kind of problem. Two non-linear bi-level programming methods are used in this paper. The goal is to achieve the optimal solution through the simulation method using the Monte Carlo method using different small and large sample sizes. The research reached the Branch Bound algorithm was preferred in solving the problem of non-linear two-level programming this is because the results were better.
This research includes the study of dual data models with mixed random parameters, which contain two types of parameters, the first is random and the other is fixed. For the random parameter, it is obtained as a result of differences in the marginal tendencies of the cross sections, and for the fixed parameter, it is obtained as a result of differences in fixed limits, and random errors for each section. Accidental bearing the characteristic of heterogeneity of variance in addition to the presence of serial correlation of the first degree, and the main objective in this research is the use of efficient methods commensurate with the paired data in the case of small samples, and to achieve this goal, the feasible general least squa
... Show MoreThis paper presents a fully computerized method to backup the router configuration file. The method consists of a friendly graphical interface programmed by Java programming language.
The proposed method is compared with the two existing methods, namely: TFTP server method and Copy/Paste method. The comparison reveals that the proposed method has many advantages over the existing ones. The proposed method has been implemented on Cisco routers (series 2500, 2600 and 2800).
Algorithms using the second order of B -splines [B (x)] and the third order of B -splines [B,3(x)] are derived to solve 1' , 2nd and 3rd linear Fredholm integro-differential equations (F1DEs). These new procedures have all the useful properties of B -spline function and can be used comparatively greater computational ease and efficiency.The results of these algorithms are compared with the cubic spline function.Two numerical examples are given for conciliated the results of this method.
The aim of this research is to estimate the parameters of the linear regression model with errors following ARFIMA model by using wavelet method depending on maximum likelihood and approaching general least square as well as ordinary least square. We use the estimators in practical application on real data, which were the monthly data of Inflation and Dollar exchange rate obtained from the (CSO) Central Statistical organization for the period from 1/2005 to 12/2015. The results proved that (WML) was the most reliable and efficient from the other estimators, also the results provide that the changing of fractional difference parameter (d) doesn’t effect on the results.
In this paper, the using of Non-Homogenous Poisson Processes, with one of the scientific and practical means in the Operations Research had been carried out, which is the Queuing Theory, as those operations are affected by time in their conduct by one function which has a cyclic behavior, called the (Sinusoidal Function). (Mt / M / S) The model was chosen, and it is Single Queue Length with multiple service Channels, and using the estimating scales (QLs, HOL, HOLr) was carried out in considering the delay occurring to the customer before his entrance to the service, with the comparison of the best of them in the cases of the overload.
Through the experiments
... Show MoreWe present a reliable algorithm for solving, homogeneous or inhomogeneous, nonlinear ordinary delay differential equations with initial conditions. The form of the solution is calculated as a series with easily computable components. Four examples are considered for the numerical illustrations of this method. The results reveal that the semi analytic iterative method (SAIM) is very effective, simple and very close to the exact solution demonstrate reliability and efficiency of this method for such problems.
In this research, carbon nanotubes (CNTs) is prepared through the Hummers method with a slight change in some of the work steps, thus, a new method has been created for preparing carbon nanotubes which is similar to the original Hummers method that is used to prepare graphene oxide. Then, the suspension carbon nanotubes is transferred to a simple electrode position platform consisting of two electrodes and the cell body for the coating and reduction of the carbon nanotubes on ITO glass which represents the cathode electrode while platinum represents the anode electrode. The deposited layer of carbon nanotubes is examined through the scanning electron microscope technique (SEM), and the images throughout the research show the
... Show MoreThe aim of this paper is to propose an efficient three steps iterative method for finding the zeros of the nonlinear equation f(x)=0 . Starting with a suitably chosen , the method generates a sequence of iterates converging to the root. The convergence analysis is proved to establish its five order of convergence. Several examples are given to illustrate the efficiency of the proposed new method and its comparison with other methods.
In this work, a test room was built in Baghdad city, with (2*1.5*1.5) m3 in dimensions, while the solar chimneys (SC) were designed with aspect ratio (ar) bigger than 12. Test room was supplied by many solar collectors; vertical single side of air pass with ar equals 25, and tilted 45o double side of air passes with ar equals 50 for each pass, both collectors consist of flat thermal energy storage box collector (TESB) that covered by transparent clear acrylic sheet, third type of collector is array of evacuated tubular collectors with thermosyphon in 45o instelled in the bottom of TESB of vertical SC. The TESB was
... Show More