In this paper, a general expression formula for the Boubaker scaling (BS) operational matrix of the derivative is constructed. Then it is used to study a new parameterization direct technique for treating calculus of the variation problems approximately. The calculus of variation problems describe several important phenomena in mathematical science. The first step in our suggested method is to express the unknown variables in terms of Boubaker scaling basis functions with unknown coefficients. Secondly, the operational matrix of the derivative together with some important properties of the BS are utilized to achieve a non-linear programming problem in terms of the unknown coefficients. Finally, the unknown parameters are obtaine

Diverting river flow during construction of a main dam involves the construction of cofferdams, and tunnels, channels or other temporary passages. Diversion channels are commonly used in wide valleys where the high flow makes tunnels or culverts uneconomic. The diversion works must form part of the overall project design since it will have a major impact on its cost, as well as on the design, construction program and overall cost of the permanent works. Construction costs contain of excavation, lining of the channel, and construction of upstream and downstream cofferdams. The optimization model was applied to obtain optimalchannel cross section, height of upstream cofferdam, and height of downstream cofferdamwith minimum construction cost

Steganography is one of the most popular techniques for data hiding in the different media such as images, audio or video files. This paper introduced the improved technique to hide the secret message using the LSB algorithm inside the RGB true color image by encrypting it using the secret key transformation function. The key is selecting randomly in the GF (2n) with condition it has an inverse value to retrieve the encrypted message. Only two bits are used for the low byte in each pixel (the blue byte) to hide the secret message, since the blue color has a weak effect on human eyes. The message hidden by the suggested algorithm is less vulnerable to be stolen than other similar applications.

<span>Dust is a common cause of health risks and also a cause of climate change, one of the most threatening problems to humans. In the recent decade, climate change in Iraq, typified by increased droughts and deserts, has generated numerous environmental issues. This study forecasts dust in five central Iraqi districts using machine learning and five regression algorithm supervised learning system framework. It was assessed using an Iraqi meteorological organization and seismology (IMOS) dataset. Simulation results show that the gradient boosting regressor (GBR) has a mean square error of 8.345 and a total accuracy ratio of 91.65%. Moreover, the results show that the decision tree (DT), where the mean square error is 8.965, c

An application of neural network technique was introduced in modeling the point efficiency of sieve tray, based on a
data bank of around 33l data points collected from the open literature.Two models proposed,using back-propagation
algorithm, the first model network consists: volumetric liquid flow rate (QL), F foctor for gas (FS), liquid density (pL),
gas density (pg), liquid viscosity (pL), gas viscosity (pg), hole diameter (dH), weir height (hw), pressure (P) and surface
tension between liquid phase and gas phase (o). In the second network, there are six parameters as dimensionless
group: Flowfactor (F), Reynolds number for liquid (ReL), Reynolds number for gas through hole (Reg), ratio of weir
height to hole diqmeter

The huge evolving in the information technologies, especially in the few last decades, has produced an increase in the volume of data on the World Wide Web, which is still growing significantly. Retrieving the relevant information on the Internet or any data source with a query created by a few words has become a big challenge. To override this, query expansion (QE) has an important function in improving the information retrieval (IR), where the original query of user is recreated to a new query by appending new related terms with the same importance. One of the problems of query expansion is the choosing of suitable terms. This problem leads to another challenge of how to retrieve the important documents with high precision, high recall

     In this research, we propose to use two local search methods (LSM's); Particle Swarm Optimization (PSO) and the Bees Algorithm (BA) to solve Multi-Criteria Travelling Salesman Problem (MCTSP) to obtain the best efficient solutions. The generating process of the population of the proposed LSM's may be randomly obtained or by adding some initial solutions obtained from some efficient heuristic methods. The obtained solutions of the PSO and BA are compared with the solutions of the exact methods (complete enumeration and branch and bound methods) and some heuristic methods. The results proved the efficiency of PSO and BA methods for a large number of nodes ( ). The proposed LSM's give the best efficient solutions for the MCTSP for

 

    The combination of wavelet theory and neural networks has lead to the development of wavelet networks. Wavelet networks are feed-forward neural networks using wavelets as activation function. Wavelets networks have been used in classification and identification problems with some success.

  In this work we proposed a fuzzy wavenet network (FWN), which learns by common back-propagation algorithm to classify medical images. The library of medical image has been analyzed, first. Second, Two experimental tables’ rules provide an excellent opportunity to test the ability of fuzzy wavenet network due to the high level of information variability often experienced with this type of images.

&n

This paper presents a proposed neural network algorithm to solve the shortest path problem (SPP) for communication routing. The solution extends the traditional recurrent Hopfield architecture introducing the optimal routing for any request by choosing single and multi link path node-to-node traffic to minimize the loss. This suggested neural network algorithm implemented by using 20-nodes network example. The result shows that a clear convergence can be achieved by 95% valid convergence (about 361 optimal routes from 380-pairs). Additionally computation performance is also mentioned at the expense of slightly worse results.