Image Fusion Using A Convolutional Neural Network

In this paper we find the exact solution of Burger's equation after reducing it to Bernoulli equation. We compare this solution with that given by Kaya where he used Adomian decomposition method, the solution given by chakrone where he used the Variation iteration method (VIM)and the solution given by Eq(5)in the paper of M. Javidi. We notice that our solution is better than their solutions.

The proliferation of cellular network enabled users through various positioning tools to track locations, location information is being continuously captured from mobile phones, created a prototype that enables detected location based on using the two invariant models for Global Systems for Mobile (GSM) and Universal Mobile Telecommunications System (UMTS). The smartphone application on an Android platform applies the location sensing run as a background process and the localization method is based on cell phones. The proposed application is associated with remote server and used to track a smartphone without permissions and internet. Mobile stored data location information in the database (SQLite), then transfer it into location AP

Background: This study aimed to determine the gender of a sample of Iraqi adults using the mesio-distal width of mandibular canines, inter-canine width and standard mandibular canine index, and to determine the percentage of dimorphism as an aid in forensic dentistry. Materials and methods: The sample included 200 sets of study models belong to 200 subjects (100 males and 100 females) with an age ranged between 17-23 years. The mesio-distal crown dimension was measured manually, from the contact points for the mandibular canines (both sides), in addition to the inter-canine width using digital vernier. Descriptive statistics were obtained for the measurements for both genders; paired sample t-test was used to evaluate the side difference of

In this paper we deal with the problem of ciphering and useful from group isomorphism for construct public key cipher system, Where construction 1-EL- Gamal Algorithm. 2- key- exchange Algorithm

The planning, designing, construction of excavations and foundations in soft to very soft clay soils are always difficult. They are problematic soil that caused trouble for the structures built on them because of the low shear strength, high water content, and high compressibility. This work investigates the geotechnical behavior of soft clay by using tyre ash material burnt in air. The investigation contains the following tests: physical tests, chemical tests, consolidation test, Compaction tests, shear test, California Bearing Ratio test CBR, and model tests. These tests were done on soil samples prepared from soft clay soil; tyre ash was used in four percentages (2, 4, 6, and 8%). The results of the tests were; The soil samples which

Association rules mining (ARM) is a fundamental and widely used data mining technique to achieve useful information about data. The traditional ARM algorithms are degrading computation efficiency by mining too many association rules which are not appropriate for a given user. Recent research in (ARM) is investigating the use of metaheuristic algorithms which are looking for only a subset of high-quality rules. In this paper, a modified discrete cuckoo search algorithm for association rules mining DCS-ARM is proposed for this purpose. The effectiveness of our algorithm is tested against a set of well-known transactional databases. Results indicate that the proposed algorithm outperforms the existing metaheuristic methods.

This paper is concerned with introducing and studying the first new approximation operators using mixed degree system and second new approximation operators using mixed degree system which are the core concept in this paper. In addition, the approximations of graphs using the operators first lower and first upper are accurate then the approximations obtained by using the operators second lower and second upper sincefirst accuracy less then second accuracy. For this reason, we study in detail the properties of second lower and second upper in this paper. Furthermore, we summarize the results for the properties of approximation operators second lower and second upper when the graph G is arbitrary, serial 1, serial 2, reflexive, symmetric, tra