The purpose of this paper is applying the robustness in Linear programming(LP) to get rid of uncertainty problem in constraint parameters, and find the robust optimal solution, to maximize the profits of the general productive company of vegetable oils for the year 2019, through the modify on a mathematical model of linear programming when some parameters of the model have uncertain values, and being processed it using robust counterpart of linear programming to get robust results from the random changes that happen in uncertain values ​​of the problem, assuming these values belong to the uncertainty set and selecting the values that cause the worst results and to depend buil

Optimization of gas lift plays a substantial role in production and maximizing the net present value of the investment of oil field projects. However, the application of the optimization techniques in gas lift project is so complex because many decision variables, objective functions and constraints are involved in the gas lift optimization problem. In addition, many computational ways; traditional and modern, have been employed to optimize gas lift processes. This research aims to present the developing of the optimization techniques applied in the gas lift. Accordingly, the research classifies the applied optimization techniques, and it presents the limitations and the range of applications of each one to get an acceptable level of accura

Watermarking operation can be defined as a process of embedding special wanted and reversible information in important secure files to protect the ownership or information of the wanted cover file based on the proposed singular value decomposition (SVD) watermark. The proposed method for digital watermark has very huge domain for constructing final number and this mean protecting watermark from conflict. The cover file is the important image need to be protected. A hidden watermark is a unique number extracted from the cover file by performing proposed related and successive operations, starting by dividing the original image into four various parts with unequal size. Each part of these four treated as a separate matrix and applying SVD

Audio classification is the process to classify different audio types according to contents. It is implemented in a large variety of real world problems, all classification applications allowed the target subjects to be viewed as a specific type of audio and hence, there is a variety in the audio types and every type has to be treatedcarefully according to its significant properties.Feature extraction is an important process for audio classification. This workintroduces several sets of features according to the type, two types of audio (datasets) were studied. Two different features sets are proposed: (i) firstorder gradient feature vector, and (ii) Local roughness feature vector, the experimentsshowed that the results are competitive to

This paper represents an experimentalattempt to predict the influence of CO2-MAG welding variables on the shape factors of the weld joint geometry. Theinput variables were welding arc voltage, wire feeding speed and gas flow rate to investigate their effects on the shape factorsof the weld joint geometry in terms of weld joint dimensions (bead width, reinforcement height, and penetration). Design of experiment with response surface methodology technique was employed to buildmathematical models for shape factors in terms of the input welding variables. Thepredicted models were found quadratic type and statistically checked by ANOVA analysis for adequacy purpose. Also, numerical and graphical optimizations were carried out

Credit risk assessment has become an important topic in financial risk administration. Fuzzy clustering analysis has been applied in credit scoring. Gustafson-Kessel (GK) algorithm has been utilised to cluster creditworthy customers as against non-creditworthy ones. A good clustering analysis implemented by good Initial Centres of clusters should be selected. To overcome this problem of Gustafson-Kessel (GK) algorithm, we proposed a modified version of Kohonen Network (KN) algorithm to select the initial centres. Utilising similar degree between points to get similarity density, and then by means of maximum density points selecting; the modified Kohonen Network method generate clustering initial centres to get more reasonable clustering res