Boltzmann mach ine neural network bas been used to recognize the Arabic speech.  Fast Fourier transl(>lmation algorithm has been used t() extract speciral 'features from an a caustic signal .

The  spectral  feature size is reduced by series of operations in

order to make it salable as input for a neural network which is used as a recogni zer by Boltzmann Machine Neural  network which has been used as a recognizer for phonemes . A training set consist of a number of Arabic phoneme repesentations, is used to train lhe neuntl network.

The neural network recognized Arabic. After Boltzmann Machine Neura l    network   training  the  system   with 

The Artificial Neural Network methodology is a very important & new subjects that build's the models for Analyzing, Data Evaluation, Forecasting & Controlling without depending on an old model or classic statistic method that describe the behavior of statistic phenomenon, the methodology works by simulating the data to reach a robust optimum model that represent the statistic phenomenon & we can use the model in any time & states, we used the Box-Jenkins (ARMAX) approach for comparing, in this paper depends on the received power to build a robust model for forecasting, analyzing & controlling in the sod power, the received power come from

  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 is concerned with the quaternary nonlinear hyperbolic boundary value problem (QNLHBVP) studding constraints quaternary optimal classical continuous control vector (CQOCCCV), the cost function (CF), and the equality and inequality quaternary state and control constraints vector (EIQSCCV). The existence of a CQOCCCV dominating by the QNLHBVP is stated and demonstrated using the Aubin compactness theorem (ACTH) under appropriate hypotheses (HYPs). Furthermore, mathematical formulation of the quaternary adjoint equations (QAEs) related to the quaternary state equations (QSE) are discovere  so as its weak form (WF) . The directional derivative (DD) of the Hamiltonian (Ham) is calculated. The necessary and sufficient conditions for

     In this paper, one of the Machine Scheduling Problems is studied, which is the problem of scheduling a number of products (n-jobs) on one (single) machine with the multi-criteria objective function. These functions are (completion time, the tardiness, the earliness, and the late work) which formulated as . The branch and bound (BAB) method are used as the main method for solving the problem, where four upper bounds and one lower bound are proposed and a number of dominance rules are considered to reduce the number of branches in the search tree. The genetic algorithm (GA) and the particle swarm optimization (PSO) are used to obtain two of the upper bounds. The computational results are calculated by coding (progr

This paper is concerned with finding the approximation solution (APPS) of a certain type of nonlinear hyperbolic boundary value problem (NOLHYBVP).  The given BVP is written in its discrete (DI) weak form (WEF), and is proved that  it has a unique APPS, which is obtained via the mixed Galerkin finite element method (GFE) with implicit method (MGFEIM) that reduces the problem to solve the Galerkin nonlinear algebraic system  (GNAS).  In this part, the predictor and the corrector technique (PT and CT) are proved convergent and are used to transform the obtained GNAS to  linear (GLAS ), then the GLAS is solved using the Cholesky method (ChMe). The stability and the convergence of the method are studied. The results

     Meerkat Clan Algorithm (MCA) is a nature-based metaheuristic algorithm which imitates the intelligent behavior of the meerkat animal. This paper presents an improvement on the MCA based on a chaotic map and crossover strategy (MCA-CC). These two strategies increase the diversification and intensification of the proposed algorithm and boost the searching ability to find more quality solutions. The 0-1 knapsack problem was solved by the basic MCA and the improved version of this algorithm (MCA-CC). The performance of these algorithms was tested on low and high dimensional problems. The experimental results demonstrate that the proposed algorithm had overcome the basic algorithm in terms of solution quality, speed a

The method of solving volterra integral equation by using numerical solution is a simple operation but to require many memory space to compute and save the operation. The importance of this equation appeares new direction to solve the equation by using new methods to avoid obstacles. One of these methods employ neural network for obtaining the solution.

This paper presents a proposed method by using cascade-forward neural network to simulate volterra integral equations solutions. This method depends on training cascade-forward neural network by inputs which represent the mean of volterra integral equations solutions, the target of cascade-forward neural network is to get the desired output of this network. Cascade-forward neural