Classification of imbalanced data is an important issue. Many algorithms have been developed for classification, such as Back Propagation (BP) neural networks, decision tree, Bayesian networks etc., and have been used repeatedly in many fields. These algorithms speak of the problem of imbalanced data, where there are situations that belong to more classes than others. Imbalanced data result in poor performance and bias to a class without other classes. In this paper, we proposed three techniques based on the Over-Sampling (O.S.) technique for processing imbalanced dataset and redistributing it and converting it into balanced dataset. These techniques are (Improved Synthetic Minority Over-Sampling Technique (Improved SMOTE), Borderline-SMOTE + Imbalanced Ratio(IR), Adaptive Synthetic Sampling (ADASYN) +IR) Algorithm, where the work these techniques are generate the synthetic samples for the minority class to achieve balance between minority and majority classes and then calculate the IR between classes of minority and majority. Experimental results show ImprovedSMOTE algorithm outperform the Borderline-SMOTE + IR and ADASYN + IR algorithms because it achieves a high balance between minority and majority classes.
Roller compacted concrete (RCC) is a concrete compacted by roller compaction. The concrete mixture in its unhardened state must support a roller while being compacted. The aim of this research work was to investigate the behavior and properties of roller compacted concrete when constructed in the laboratory using roller compactor manufactured in local market to simulate the field conditions. The roller compaction was conducts in three stages; each stage has different loading and number of passes of the roller. For the first stage, a load of (24) kg and (5) passes in each direction had been employed. For the second stage, a load of (104) kg and (10) passes in each direction were conducted. Finally, at the third stage, a load of (183) kg a
... Show MoreFractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.
With the freedom offered by the Deep Web, people have the opportunity to express themselves freely and discretely, and sadly, this is one of the reasons why people carry out illicit activities there. In this work, a novel dataset for Dark Web active domains known as crawler-DB is presented. To build the crawler-DB, the Onion Routing Network (Tor) was sampled, and then a web crawler capable of crawling into links was built. The link addresses that are gathered by the crawler are then classified automatically into five classes. The algorithm built in this study demonstrated good performance as it achieved an accuracy of 85%. A popular text representation method was used with the proposed crawler-DB crossed by two different supervise
... Show MoreSoil movement resulting due unsupported excavation nearby axially loaded piles imposes significant structural troubles on geotechnical engineers especially for piles that are not designed to account for loss of lateral confinement. In this study the field excavation works of 7.0 m deep open tunnel was continuously followed up by the authors. The work is related to the project of developing the Army canal in the east of Baghdad city in Iraq. A number of selected points around the field excavation are installed on the ground surface at different horizontal distance. The elevation and coordinates of points are recorded during 23 days with excavation progress period. The field excavation process was numerically simulated by using the finite
... Show MoreThe aim of this paper is to introduce the concepts of asymptotically p-contractive and asymptotically severe accretive mappings. Also, we give an iterative methods (two step-three step) for finite family of asymptotically p-contractive and asymptotically severe accretive mappings to solve types of equations.
The conjugate coefficient optimal is the very establishment of a variety of conjugate gradient methods. This paper proposes a new class coefficient of conjugate gradient (CG) methods for impulse noise removal, which is based on the quadratic model. Our proposed method ensures descent independent of the accuracy of the line search and it is globally convergent under some conditions, Numerical experiments are also presented for the impulse noise removal in images.
The aim of this paper, is to study different iteration algorithms types two steps called, modified SP, Ishikawa, Picard-S iteration and M-iteration, which is faster than of others by using like contraction mappings. On the other hand, the M-iteration is better than of modified SP, Ishikawa and Picard-S iterations. Also, we support our analytic proof with a numerical example.
Nonlinear regression models are important tools for solving optimization problems. As traditional techniques would fail to reach satisfactory solutions for the parameter estimation problem. Hence, in this paper, the BAT algorithm to estimate the parameters of Nonlinear Regression models is used . The simulation study is considered to investigate the performance of the proposed algorithm with the maximum likelihood (MLE) and Least square (LS) methods. The results show that the Bat algorithm provides accurate estimation and it is satisfactory for the parameter estimation of the nonlinear regression models than MLE and LS methods depend on Mean Square error.
In the present paper, three reliable iterative methods are given and implemented to solve the 1D, 2D and 3D Fisher’s equation. Daftardar-Jafari method (DJM), Temimi-Ansari method (TAM) and Banach contraction method (BCM) are applied to get the exact and numerical solutions for Fisher's equations. The reliable iterative methods are characterized by many advantages, such as being free of derivatives, overcoming the difficulty arising when calculating the Adomian polynomial boundaries to deal with nonlinear terms in the Adomian decomposition method (ADM), does not request to calculate Lagrange multiplier as in the Variational iteration method (VIM) and there is no need to create a homotopy like in the Homotopy perturbation method (H
... Show MoreSol-gel method was use to prepare Ag-SiO2 nanoparticles. Crystal structure of the nanocomposite was investigated by means of X-ray diffraction patterns while the color intensity was evaluated by spectrophotometry. The morphology analysis using atomic force microscopy showed that the average grain sizes were in range (68.96-75.81 nm) for all samples. The characterization of Ag-SiO2 nanoparticles were investigated by using Scanning Electron Microscopy (SEM). Ag-SiO2 NPs are highly stable and have significant effect on both Gram positive and negative bacteria. Antibacterial properties of the nanocomposite were tested with the use of Staphylococcus aureus (S. aureus) and Escherichia coli (E. coli) bacteria. The results have shown antibacteri
... Show More