This paper presents a numerical solution to the inverse problem consisting of recovering time-dependent thermal conductivity and  heat source coefficients  in the one-dimensional  parabolic heat equation.   This  mathematical  formulation  ensures that the inverse problem  has a unique  solution.   However, the problem  is still  ill-posed since small errors  in the input data lead to a drastic  amount  of errors in the output coefficients.  The  finite  difference method  with  the Crank-Nicolson  scheme is adopted  as a direct  solver of the problem in a fixed domain.   The inverse problem is solved sub

Flow of water under concrete dams generates uplift pressure under the dam, which may cause the dam to function improperly, in addition to the exit gradient that may cause piping if exceeded a safe value. Cutoff walls usually used to minimize the effect of flow under dams. It is required to
1)minimize the flow quantity to conserve water in the reservoir, it is also required to
2)minimize the uplift pressure under the dam to maintain stability of the dam, and it is required to

3) minimize the exit gradient to prevent quick condition to occur at the toe of the dam where piping may occur and may cause erosion of the soil. Varying the angle of cutoff walls affects its influence on the factors aforementioned that are required to

Community detection is useful for better understanding the structure of complex networks. It aids in the extraction of the required information from such networks and has a vital role in different fields that range from healthcare to regional geography, economics, human interactions, and mobility. The method for detecting the structure of communities involves the partitioning of complex networks into groups of nodes, with extensive connections within community and sparse connections with other communities. In the literature, two main measures, namely the Modularity (Q) and Normalized Mutual Information (NMI) have been used for evaluating the validation and quality of the detected community structures. Althoug

Monitoring and analysing of the vertical deformations or the settlements of the structures is one of the main research fields in geodetic applications, which is considered a precise periodic measurement, made at different epochs to investigate these deformations on heavy structures.
In this research, the deformation measurements were carried out on one of Baghdad University buildings,” Building of Computers Department” of dimensions (70.0 * 81.3 m.). Due to some cracks observed in their walls, it was necessary to monitor the vertical displacement of this building at some particular monitoring points by constructing a vertical network and measured in different epochs. The first epoch (zero epoch) was carried out in April 2006, the

The Internet image retrieval is an interesting task that needs efforts from image processing and relationship structure analysis. In this paper, has been proposed compressed method when you need to send more than a photo via the internet based on image retrieval. First, face detection is implemented based on local binary patterns. The background is notice based on matching global self-similarities and compared it with the rest of the image backgrounds. The propose algorithm are link the gap between the present image indexing technology, developed in the pixel domain, and the fact that an increasing number of images stored on the computer are previously compressed by JPEG at the source. The similar images are found and send a few images inst

In the image processing’s field and computer vision it’s important to represent the image by its information. Image information comes from the image’s features that extracted from it using feature detection/extraction techniques and features description. Features in computer vision define informative data. For human eye its perfect to extract information from raw image, but computer cannot recognize image information. This is why various feature extraction techniques have been presented and progressed rapidly. This paper presents a general overview of the feature extraction categories for image.

In recent years, the Global Navigation Satellite Services (GNSS) technology has been frequently employed for monitoring the Earth crust deformation and movement. Such applications necessitate high positional accuracy that can be achieved through processing GPS/GNSS data with scientific software such as BERENSE, GAMIT, and GIPSY-OSIS. Nevertheless, these scientific softwares are sophisticated and have not been published as free open source software. Therefore, this study has been conducted to evaluate an alternative solution, GNSS online processing services, which may obtain this privilege freely. In this study, eight years of GNSS raw data for TEHN station, which located in Iran, have been downloaded from UNAVCO website

 The aim of this paper, is to discuss several high performance training algorithms fall into two main categories. The first category uses heuristic techniques, which were developed from an analysis of the performance of the standard gradient descent algorithm. The second category of fast algorithms uses standard numerical optimization techniques such as: quasi-Newton . Other aim is to solve the drawbacks related with these training algorithms and propose an efficient training algorithm for FFNN

      As smartphones incorporate location data, there is a growing concern about location  privacy as smartphone technologies advance. Using a remote server, the mobile applications are able to capture the current location coordinates at any time and store them. The client awards authorization to an outsider. The outsider can gain admittance to area information on the worker by JSON Web Token (JWT). Protection is giving cover to clients, access control, and secure information stockpiling. Encryption guarantees the security of the location area on the remote server using the Rivest Shamir Adleman (RSA) algorithm. This paper introduced two utilizations of cell phones (tokens, and location). The principal application can give area inf

The aim of this paper is to approximate multidimensional functions by using the type of Feedforward neural networks (FFNNs) which is called Greedy radial basis function neural networks (GRBFNNs). Also, we introduce a modification to the greedy algorithm which is used to train the greedy radial basis function neural networks. An error bound are introduced in Sobolev space. Finally, a comparison was made between the three algorithms (modified greedy algorithm, Backpropagation algorithm and the result is published in [16]).