In this paper, a computer simulation is implemented to generate of an optical aberration by means of Zernike polynomials. Defocus, astigmatism, coma, and spherical Zernike aberrations were simulated in a subroutine using MATLAB function and applied as a phase error in the aperture function of an imaging system. The studying demonstrated that the Point Spread Function (PSF) and Modulation Transfer Function (MTF) have been affected by these optical aberrations. Areas under MTF for different radii of the aperture of imaging system have been computed to assess the quality and efficiency of optical imaging systems. Phase conjugation of these types aberration has been utilized in order to correct a distorted wavefront. The results showed that the largest effect on the PSF and MTF is due to the contribution of the third type coma aberrated wavefront.
Refuse derived fuel (RDF) is considered one of the most important types of low cost thermal energy which can be tapped in the industry, especially the cement industry in particular being the need of high thermal energy during the production processes, and in this paper we have implemented the use of a derivative of the fuel RDF as a substitute for gasoline , to reduce production costs and thereby achieve production efficiency, and the methodology used in this research statistical analysis as well as the use of the cost of kaizen target for the purpose of reducing costs and achieve production efficiency, and this has reduced the cost total cement production by which led to reduce total costs of cement production by 8.4% and an incre
... Show MoreIn this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr
... Show MoreThis paper aims to study the quaternary classical continuous optimal control problem consisting of the quaternary nonlinear parabolic boundary value problem, the cost function, and the equality and inequality constraints on the state and the control. Under appropriate hypotheses, it is demonstrated that the quaternary classical continuous optimal control ruling by the quaternary nonlinear parabolic boundary value problem has a quaternary classical continuous optimal control vector that satisfies the equality constraint and inequality state and control constraint. Moreover, mathematical formulation of the quaternary adjoint equations related to the quaternary state equations is discovered, and then the weak form of the quaternary adjoint
... Show MoreIn this paper we will investigate some Heuristic methods to solve travelling salesman problem. The discussed methods are Minimizing Distance Method (MDM), Branch and Bound Method (BABM), Tree Type Heuristic Method (TTHM) and Greedy Method (GRM).
The weak points of MDM are manipulated in this paper. The Improved MDM (IMDM) gives better results than classical MDM, and other discussed methods, while the GRM gives best time for 5≤ n ≤500, where n is the number of visited cities.
The focus of this research lies in the definition of an important aspect of financial development, which is reflected on the alleviation of poverty in Iraq, namely financial inclusion and then taking the path of achieving a sustainable economy, certainly after reviewing one of the important international experiences in this regard and finally measuring the level of financial inclusion in Iraq and its impact on poverty reduction through the absolute poverty line indicator.
The Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst
... Show MoreGangyong Lee, S.Tariq Rizvi, and Cosmin S.Roman studied Rickart modules.
The main purpose of this paper is to develop the properties of Rickart modules .
We prove that each injective and prime module is a Rickart module. And we give characterizations of some kind of rings in term of Rickart modules.
The pre - equilibrium and equilibrium double differential cross
sections are calculated at different energies using Kalbach Systematic
approach in terms of Exciton model with Feshbach, Kerman and
Koonin (FKK) statistical theory. The angular distribution of nucleons
and light nuclei on 27Al target nuclei, at emission energy in the center
of mass system, are considered, using the Multistep Compound
(MSC) and Multistep Direct (MSD) reactions. The two-component
exciton model with different corrections have been implemented in
calculating the particle-hole state density towards calculating the
transition rates of the possible reactions and follow up the calculation
the differential cross-sections, that include MS
The searching process using a binary codebook of combined Block Truncation Coding (BTC) method and Vector Quantization (VQ), i.e. a full codebook search for each input image vector to find the best matched code word in the codebook, requires a long time. Therefore, in this paper, after designing a small binary codebook, we adopted a new method by rotating each binary code word in this codebook into 900 to 2700 step 900 directions. Then, we systematized each code word depending on its angle to involve four types of binary code books (i.e. Pour when , Flat when , Vertical when, or Zigzag). The proposed scheme was used for decreasing the time of the coding pro
... Show More