Given a binary matrix, finding the maximum set of columns such that the resulting submatrix has the Consecutive Ones Property (C1P) is called the Consecutive Ones Submatrix (C1S) problem. There are solution approaches for it, but there is also a room for improvement. Moreover, most of the studies of the problem use exact solution methods. We propose an evolutionary approach to solve the problem. We also suggest a related problem to C1S, which is the Consecutive Blocks Minimization (CBM). The algorithm is then performed on real-world and randomly generated matrices of the set covering type.
Generally, radiologists analyse the Magnetic Resonance Imaging (MRI) by visual inspection to detect and identify the presence of tumour or abnormal tissue in brain MR images. The huge number of such MR images makes this visual interpretation process, not only laborious and expensive but often erroneous. Furthermore, the human eye and brain sensitivity to elucidate such images gets reduced with the increase of number of cases, especially when only some slices contain information of the affected area. Therefore, an automated system for the analysis and classification of MR images is mandatory. In this paper, we propose a new method for abnormality detection from T1-Weighted MRI of human head scans using three planes, including axial plane, co
... Show MoreThis paper introduces a non-conventional approach with multi-dimensional random sampling to solve a cocaine abuse model with statistical probability. The mean Latin hypercube finite difference (MLHFD) method is proposed for the first time via hybrid integration of the classical numerical finite difference (FD) formula with Latin hypercube sampling (LHS) technique to create a random distribution for the model parameters which are dependent on time [Formula: see text]. The LHS technique gives advantage to MLHFD method to produce fast variation of the parameters’ values via number of multidimensional simulations (100, 1000 and 5000). The generated Latin hypercube sample which is random or non-deterministic in nature is further integ
... Show MoreIn this article, the nonlinear problem of Jeffery-Hamel flow has been solved analytically and numerically by using reliable iterative and numerical methods. The approximate solutions obtained by using the Daftardar-Jafari method namely (DJM), Temimi-Ansari method namely (TAM) and Banach contraction method namely (BCM). The obtained solutions are discussed numerically, in comparison with other numerical solutions obtained from the fourth order Runge-Kutta (RK4), Euler and previous analytic methods available in literature. In addition, the convergence of the proposed methods is given based on the Banach fixed point theorem. The results reveal that the presented methods are reliable, effective and applicable to solve other nonlinear problems.
... Show MoreIn this paper, a computational method for solving optimal problem is presented, using indirect method (spectral methodtechnique) which is based on Boubaker polynomial. By this method the state and the adjoint variables are approximated by Boubaker polynomial with unknown coefficients, thus an optimal control problem is transformed to algebraic equations which can be solved easily, and then the numerical value of the performance index is obtained. Also the operational matrices of differentiation and integration have been deduced for the same polynomial to help solving the problems easier. A numerical example was given to show the applicability and efficiency of the method. Some characteristics of this polynomial which can be used for solvin
... 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.
This paper devoted to the analysis of regular singular boundary value problems for ordinary differential equations with a singularity of the different kind , we propose semi - analytic technique using two point osculatory interpolation to construct polynomial solution, and discussion behavior of the solution in the neighborhood of the regular singular points and its numerical approximation. Many examples are presented to demonstrate the applicability and efficiency of the methods. Finally , we discuss behavior of the solution in the neighborhood of the singularity point which appears to perform satisfactorily for singular problems.
In this research, the problem of ambiguity of the data for the project of establishing the typical reform complex in Basrah Governorate was eliminated. The blurry of the data represented by the time and cost of the activities was eliminated by using the Ranking function and converting them into normal numbers. Scheduling and managing the Project in the Critical Pathway (CPM) method to find the project completion time in normal conditions in the presence of non-traditional relationships between the activities and the existence of the lead and lag periods. The MS Project was used to find the critical path. The results showed that the project completion time (1309.5) dinars and the total cost has reached (33113017769) dinars and the
... Show More