This paper proposes a new algorithm (F2SE) and algorithm (Alg(n – 1)) for solving the
two-machine flow shop problem with the objective of minimizing total earliness. This
complexity result leads us to use an enumeration solution approach for the algorithm (F2SE)
and (DM) is more effective than algorithm Alg( n – 1) to obtain approximate solution.
Moment invariants have wide applications in image recognition since they were proposed.
Problem solving methods and mechanisms contribute to facilitating human life by providing tools to solve simple and complex daily problems. These mechanisms have been essential tools for professional designers and design students in solving design problems.
This research dealt with one of those mechanisms, which is the (the substance-field model model), as it has been mentioning that this mechanism is characterized by the difficulty of its application, which formed the main research problem. In home gardens (the sub-problem of research), an analysis of this problem was applied and then a solution was found to address it. The researcher used the 3dsmax program to implement the proposed design.
The most important research res
This paper presents a linear fractional programming problem (LFPP) with rough interval coefficients (RICs) in the objective function. It shows that the LFPP with RICs in the objective function can be converted into a linear programming problem (LPP) with RICs by using the variable transformations. To solve this problem, we will make two LPP with interval coefficients (ICs). Next, those four LPPs can be constructed under these assumptions; the LPPs can be solved by the classical simplex method and used with MS Excel Solver. There is also argumentation about solving this type of linear fractional optimization programming problem. The derived theory can be applied to several numerical examples with its details, but we show only two examples
... Show MoreA novel analytical method is developed for the determination of azithromycin. The method utilizes continuous flow injection analysis to enhance the chemiluminescence system of luminol, H2O2, and Cr(III). The method demonstrated a linear dynamic range of 0.001–100 mmol L-1 with a high correlation coefficient (r) of 0.9978, and 0.001–150 mmol L-1 with a correlation coefficient (r) of 0.9769 for the chemiluminescence emission versus azithromycin concentration. The limit of detection (L.O.D.) of the method was found to be 18.725 ng.50 µL−1 based on the stepwise dilution method for the lowest concentration within the linear dynamic range of the calibration graph. The relative standard deviation (R.S.D. %) for n = 6 was less than 1.2%
... Show MoreThis paper is attempt to study the nonlinear second order delay multi-value problems. We want to say that the properties of such kind of problems are the same as the properties of those with out delay just more technically involved. Our results discuss several known properties, introduce some notations and definitions. We also give an approximate solution to the coined problems using the Galerkin's method.
Diabetes is one of the increasing chronic diseases, affecting millions of people around the earth. Diabetes diagnosis, its prediction, proper cure, and management are compulsory. Machine learning-based prediction techniques for diabetes data analysis can help in the early detection and prediction of the disease and its consequences such as hypo/hyperglycemia. In this paper, we explored the diabetes dataset collected from the medical records of one thousand Iraqi patients. We applied three classifiers, the multilayer perceptron, the KNN and the Random Forest. We involved two experiments: the first experiment used all 12 features of the dataset. The Random Forest outperforms others with 98.8% accuracy. The second experiment used only five att
... Show MoreThe aim of this paper is to design fast neural networks to approximate periodic functions, that is, design a fully connected networks contains links between all nodes in adjacent layers which can speed up the approximation times, reduce approximation failures, and increase possibility of obtaining the globally optimal approximation. We training suggested network by Levenberg-Marquardt training algorithm then speeding suggested networks by choosing most activation function (transfer function) which having a very fast convergence rate for reasonable size networks. In all algorithms, the gradient of the performance function (energy function) is used to determine how to
... Show MoreThere is a great deal of systems dealing with image processing that are being used and developed on a daily basis. Those systems need the deployment of some basic operations such as detecting the Regions of Interest and matching those regions, in addition to the description of their properties. Those operations play a significant role in decision making which is necessary for the next operations depending on the assigned task. In order to accomplish those tasks, various algorithms have been introduced throughout years. One of the most popular algorithms is the Scale Invariant Feature Transform (SIFT). The efficiency of this algorithm is its performance in the process of detection and property description, and that is due to the fact that
... Show More