.

       In this paper, we focus on designing feed forward neural network (FFNN) for solving Mixed Volterra – Fredholm Integral Equations (MVFIEs) of second kind in 2–dimensions. in our method, we present a multi – layers model consisting of a hidden layer which has five hidden units (neurons) and one linear output unit. Transfer function (Log – sigmoid) and training algorithm (Levenberg – Marquardt) are used as a sigmoid activation of each unit. A comparison between the results of numerical experiment and the analytic solution of some examples has been carried out in order to justify the efficiency and the accuracy of our method.

In the present investigation, bed porosity and solid holdup in viscous three-phase inverse fluidized bed (TPIFB) are determined for aqueous solutions of carboxy methyl cellulose (CMC) system using polyethylene and polypropylene as  a particles with low-density and diameter (5 mm) in a (9.2 cm) inner diameter with height (200 cm) of vertical perspex column. The effectiveness of gas velocity U_g , liquid velocity U_L, liquid viscosity μ_L, and particle density ρ_s on bed porosity B_P and solid holdups ε_g were determined. The bed porosity increases with "increasing gas velocity", "liquid velocity", and "liquid viscosity". Solid holdup decreases with increasing gas, liquid

Advanced strategies for production forecasting, operational optimization, and decision-making enhancement have been employed through reservoir management and machine learning (ML) techniques. A hybrid model is established to predict future gas output in a gas reservoir through historical production data, including reservoir pressure, cumulative gas production, and cumulative water production for 67 months. The procedure starts with data preprocessing and applies seasonal exponential smoothing (SES) to capture seasonality and trends in production data, while an Artificial Neural Network (ANN) captures complicated spatiotemporal connections. The history replication in the models is quantified for accuracy through metric keys such as m

Le mot anglais code switching ou l’équivalent français alternance codique est un terme très utilisé dans des recherches qui traitent des problèmes en sociolinguistique. Le bilingue dispose, dans son répertoire linguistique, de moyens de communication qui lui permettent d’adapter son langage à des situations de communication plus variées que ceux du monolingue. Le code-switching ou l’alternance codique qui est un lieu de structuration de stratégies de communication en est un moyen indispensable.
L’alternance codique dans la conversation est l’utilisation d’un mot ou plus appartenant à une langue B à l’intérieur d’une phrase qui appartient à une langue A. Dans la plupart des cas, le locuteur se sert de l’a

The university course timetable problem (UCTP) is typically a combinatorial optimization problem. Manually achieving a useful timetable requires many days of effort, and the results are still unsatisfactory. unsatisfactory. Various states of art methods (heuristic, meta-heuristic) are used to satisfactorily solve UCTP. However, these approaches typically represent the instance-specific solutions. The hyper-heuristic framework adequately addresses this complex problem. This research proposed Particle Swarm Optimizer-based Hyper Heuristic (HH PSO) to solve UCTP efficiently. PSO is used as a higher-level method that selects low-level heuristics (LLH) sequence which further generates an optimal solution. The proposed a

An efficient modification and a novel technique combining the homotopy concept with  Adomian decomposition method (ADM) to obtain an accurate analytical solution for Riccati matrix delay differential equation (RMDDE) is introduced  in this paper  . Both methods are very efficient and effective. The whole integral part of ADM is used instead of the integral part of homotopy technique. The major feature in current technique gives us a large convergence region of iterative approximate solutions .The results acquired by this technique give better approximations for a larger region as well as previously. Finally, the results conducted via suggesting an efficient and easy technique, and may be addressed to other non-linear problems.

Traditionally, path selection within routing is formulated as a shortest path optimization problem. The objective function for optimization could be any one variety of parameters such as number of hops, delay, cost...etc. The problem of least cost delay constraint routing is studied in this paper since delay constraint is very common requirement of many multimedia applications and cost minimization captures the need to
distribute the network. So an iterative algorithm is proposed in this paper to solve this problem. It is appeared from the results of applying this algorithm that it gave the optimal path (optimal solution) from among multiple feasible paths (feasible solutions).