Abstract

 This research deals will the declared production planning operation in the general company of planting oils, which have  great role in production operations management who had built mathematical model for correct non-linear programming according to discounting operation during raw materials or half-made materials purchasing operation which concentration of six main products by company but discount included just three products of raw materials, and there were six months taken from the 1^st half of 2014 as a planning period has been chosen . Simulated annealing algorithm  application on non-linear model which been more difficulty than possible solution when imposed restric

Prediction of daily rainfall is important for flood forecasting, reservoir operation, and many other hydrological applications. The artificial intelligence (AI) algorithm is generally used for stochastic forecasting rainfall which is not capable to simulate unseen extreme rainfall events which become common due to climate change. A new model is developed in this study for prediction of daily rainfall for different lead times based on sea level pressure (SLP) which is physically related to rainfall on land and thus able to predict unseen rainfall events. Daily rainfall of east coast of Peninsular Malaysia (PM) was predicted using SLP data over the climate domain. Five advanced AI algorithms such as extreme learning machine (ELM), Bay

Different ANN architectures of MLP have been trained by BP and used to analyze Landsat TM images. Two different approaches have been applied for training: an ordinary approach (for one hidden layer M-H1-L & two hidden layers M-H1-H2-L) and one-against-all strategy (for one hidden layer (M-H1-1)xL, & two hidden layers (M-H1-H2-1)xL). Classification accuracy up to 90% has been achieved using one-against-all strategy with two hidden layers architecture. The performance of one-against-all approach is slightly better than the ordinary approach

The purpose of this paper is to introduce a new type of compact spaces, namely semi-p-compact spaces which are stronger than compact spaces; we give properties and characterizations of semi-p-compact spaces.

In this work, we introduce the algebraic structure of semigroup with G-algebra is called GS-Algebra as extension of algebras QS-algebra and BP-algebra and then some basic properties are investigated. Several examples are presented. Also, some ideals in this concept are studied such as GS-ideal and closed-ideal. Some properties and characterizations of GS-ideal are presented. The relationships between GS-ideal and closed-ideal are studied. Furthermore, some results of GS-ideal in GS-Algebra under homomorphism are discussed. Finally, the graph (by its annihilator-ideal) as the simple graph with elements of a GS-Algebra is studied and some related properties are given. Several examples are presented and some theorems are proved.

Based on a finite element analysis using Matlab coding, eigenvalue problem has been formulated and solved for the buckling analysis of non-prismatic columns. Different numbers of elements per column length have been used to assess the rate of convergence for the model. Then the proposed model has been used to determine the critical buckling load factor () for the idealized supported columns based on the comparison of their buckling loads with the corresponding hinge supported columns . Finally in this study the critical buckling factor () under end force (P) increases by about 3.71% with the tapered ratio increment of 10% for different end supported columns and the relationship between normalized critical load and slenderness ratio was g

Software-Defined Networking (SDN) has evolved network management by detaching the control plane from the data forwarding plane, resulting in unparalleled flexibility and efficiency in network administration. However, the heterogeneity of traffic in SDN presents issues in achieving Quality of Service (QoS) demands and efficiently managing network resources. SDN traffic flows are often divided into elephant flows (EFs) and mice flows (MFs). EFs, which are distinguished by their huge packet sizes and long durations, account for a small amount of total traffic but require disproportionate network resources, thus causing congestion and delays for smaller MFs. MFs, on the other hand, have a short lifetime and are latency-sensitive, but they accou