This study tackles a fourth-order inverse problem involving a cantilever beam with nonlocal conditions to simultaneously calculate the beam’s displacement and an unknown time-dependent coefficient. A finite difference approach is suggested to discretize the hyperbolic fourth-order equation. A stability analysis for the proposed scheme is also provided. The indirect problem is the minimization of the misfit function. The goal of the minimization algorithm is to reduce the gap between the measured (noisy) data and the numerical computed solution provided by the model. To achieve stable results, Tikhonov’s regularization technique is employed, and two numerical test examples are shown to illustrate the suggested scheme's reliabilit

In this paper we describe several different training algorithms for feed forward neural networks(FFNN). In all of these algorithms we use the gradient of the performance function, energy function, to determine how to adjust the weights such that the performance function is minimized, where the back propagation algorithm has been used to increase the speed of training. The above algorithms have a variety of different computation and thus different type of form of search direction and storage requirements, however non of the above algorithms has a global properties which suited to all problems.

Aims to find out the (Extent of mathematics teachers' appreciation of the mathematical problem `multiple solutions) Research sample consisted of (100) mathematics teachers distributed on the General Directorates of Education in Baghdad (Rusafa 1/2/3) and (Karkh 1/2/ 3) There was two research approach which are: The first - two different answers of students to the same issue where teachers must assess each answer and explain which one the teacher will accept and why? The second - Different solutions of students' to the same issue, including wrong answers , Teachers should correct the answers and give them final grades (0-10). Descriptive and analytical Approch was used in this research methodology And zero hypotheses, which are as f

The present study discusses the problem based learning in Iraqi classroom. This method aims to involve all learners in collaborative activities and it is learner-centered method. To fulfill the aims and verify the hypothesis which reads as follow” It is hypothesized that there is no statistically significant differences between the achievements of Experimental group and control group”. Thirty learners are selected to be the sample of present study.Mann-Whitney Test for two independent samples is used to analysis the results. The analysis shows that experimental group’s members who are taught according to problem based learning gets higher scores than the control group’s members who are taught according to traditional method. This

The present study discusses the problem based learning in Iraqi classroom. This method aims to involve all learners in collaborative activities and it is learner-centered method. To fulfill the aims and verify the hypothesis which reads as follow” It is hypothesized that there is no statistically significant differences between the achievements of Experimental group and control group”. Thirty learners are selected to be the sample of present study.Mann-Whitney Test for two independent samples is used to analysis the results. The analysis shows that experimental group’s members who are taught according to problem based learning gets higher scores than the control group’s members who are taught according to traditional method. This

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).