In this article, we design an optimal neural network based on new LM training algorithm. The traditional algorithm of LM required high memory, storage and computational overhead because of it required the updated of Hessian approximations in each iteration. The suggested design implemented to converts the original problem into a minimization problem using feed forward type to solve non-linear 3D - PDEs. Also, optimal design is obtained by computing the parameters of learning with highly precise. Examples are provided to portray the efficiency and applicability of this technique. Comparisons with other designs are also conducted to demonstrate the accuracy of the proposed design.
In this article, the boundary value problem of convection propagation through the permeable fin in a natural convection environment is solved by the Haar wavelet collocation method (HWCM). We also compare the solutions with the application of a semi-analytical method , namely the Temimi and Ansari (TAM), that is characterized by accuracy and efficiency.The proposed method is also characterized by simplicity and efficiency. The possibility of applying the proposed method to many types of linear or nonlinear ordinary and partial differential equations.
The Islamic Arts which include calligraphy and specifically the third line of the greatest
manifestation of Islamic civilization affair, and it was the mosques and mosques and holy
shrines scattered in the city of Baghdad, which had a deep impact in enhancing
communication
This means research study (third line aesthetics diversity of tactics in the architecture of
mosques) It is located in four seasons, which included the first chapter the research problem
represented by asking the following - :
-What are the methods of implementation of the third line in the architecture of mosques ?
And reflected the importance of research in it represents a serious attempt to investigate the
diversity in the organization des
Science, technology and many other fields are use clustering algorithm widely for many applications, this paper presents a new hybrid algorithm called KDBSCAN that work on improving k-mean algorithm and solve two of its
problems, the first problem is number of cluster, when it`s must be entered by user, this problem solved by using DBSCAN algorithm for estimating number of cluster, and the second problem is randomly initial centroid problem that has been dealt with by choosing the centroid in steady method and removing randomly choosing for a better results, this work used DUC 2002 dataset to obtain the results of KDBSCAN algorithm, it`s work in many application fields such as electronics libraries,
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
... Show MoreThe effectiveness of detecting and matching of image features using multiple views of a specified scene using dynamic scene analysis is considered to be a critical first step for many applications in computer vision image processing. The Scale invariant feature transform (SIFT) can be applied very successfully of typical images captured by a digital camera.
In this paper, firstly the SIFT and its variants are systematically analyzed. Then, the performances are evaluated in many situations: change in rotation, change in blurs, change in scale and change in illumination. The outcome results show that each algorithm has its advantages when compared with other algorithms
The Internet is providing vital communications between millions of individuals. It is also more and more utilized as one of the commerce tools; thus, security is of high importance for securing communications and protecting vital information. Cryptography algorithms are essential in the field of security. Brute force attacks are the major Data Encryption Standard attacks. This is the main reason that warranted the need to use the improved structure of the Data Encryption Standard algorithm. This paper proposes a new, improved structure for Data Encryption Standard to make it secure and immune to attacks. The improved structure of Data Encryption Standard was accomplished using standard Data Encryption Standard with a new way of two key gene
... Show MoreMost heuristic search method's performances are dependent on parameter choices. These parameter settings govern how new candidate solutions are generated and then applied by the algorithm. They essentially play a key role in determining the quality of the solution obtained and the efficiency of the search. Their fine-tuning techniques are still an on-going research area. Differential Evolution (DE) algorithm is a very powerful optimization method and has become popular in many fields. Based on the prolonged research work on DE, it is now arguably one of the most outstanding stochastic optimization algorithms for real-parameter optimization. One reason for its popularity is its widely appreciated property of having only a small number of par
... Show MoreFace recognition is one of the most applications interesting in computer vision and pattern recognition fields. This is for many reasons; the most important of them are the availability and easy access by sensors. Face recognition system can be a sub-system of many applications. In this paper, an efficient face recognition algorithm is proposed based on the accuracy of Gabor filter for feature extraction and computing the Eigen faces. In this work, efficient compressed feature vector approach is proposed. This compression for feature vector gives a good recognition rate reaches to 100% and reduced the complexity of computing Eigen faces. Faces94 data base was used to test method.