The detection of diseases affecting plant is very important as it relates to the issue of food security, which is a very serious threat to human life. The system of diagnosis of diseases involves a series of steps starting with the acquisition of images through the pre-processing, segmentation and then features extraction that is our subject finally the process of classification. Features extraction is a very important process in any diagnostic system where we can compare this stage to the spine in this type of system. It is known that the reason behind this great importance of this stage is that the process of extracting features greatly affects the work and accuracy of classification. Proper selection of the right features leads to high accuracy in the system diagnostics and vice versa. The proposed system collect images of different crop (Rice, cotton and tomato) disease, we will enter the images of cropping them , then Re-size the images to fixed size, then improve the image through Fuzzy histogram equalization (FHE) , then perform image segmentation using color based K-means and finally compare the methods of features extraction (Percentage of Leaf Area Infected (PI),Texture-Based Features, Color Moments, Features obtained by Color Co-occurrence Method and Shape based Features) we found that the use of 4 methods together (Percentage of Leaf Area Infected (PI),Texture-Based Features, Color Moments and Shape based Features) produce excellent result..
In this paper, we generalized the principle of Banach contractive to the relative formula and then used this formula to prove that the set valued mapping has a fixed point in a complete partial metric space. We also showed that the set-valued mapping can have a fixed point in a complete partial metric space without satisfying the contraction condition. Additionally, we justified an example for our proof.
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 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 MoreComputer theoretical study has been carried out on the design of five electrode immersion electrostatic lens used in electron gun application. The finite element method (FEM) is used in the solution of the Poisson's equation fro determine axial potential distribution, the electron trajectory under Zero magnification condition . The optical properties : focal length ,spherical and chromatic aberrations are calculated,From studying the properties of the designed electron gun. we have good futures for these electron gun where are abeam current 4*10-4A can be supplied by using cathode tip of radius 100 nm.
Gangyong 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.
In 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.
Let R be a commutative ring with identity and let M be a unitary left R-module. The purpose of this paper is to investigate some new results (up to our knowledge) on the concept of semi-essential submodules which introduced by Ali S. Mijbass and Nada K. Abdullah, and we make simple changes to the definition relate with the zero submodule, so we say that a submodule N of an R-module M is called semi-essential, if whenever N ∩ P = (0), then P = (0) for each prime submodule P of M. Various properties of semi-essential submodules are considered.
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 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 MoreOne-third of the total waste generated in the world is construction and demolition waste. Reducing the life cycle of building materials includes increasing their recycling and reuse by using recycled aggregates. By preventing, the need to open new aggregate quarries and reducing the amount of construction waste dumped into landfills, the use of recycled concrete aggregate in drum compacted concrete protects the environment. Four samples of PRCC were prepared for testing (compressive strength, tensile strength, flexural strength, density, water absorption, porosity) as the reference mix and (10, 15, and 20%) of fine recycled concrete aggregate as a partial replacement for fine natural aggregate by volume. The mix is designed according to
... Show More