A new two-way nesting technique is presented for a multiple nested-grid ocean modelling system. The new technique uses explicit center finite difference and leapfrog schemes to exchange information between the different subcomponents of the nested-grid system. The performance of the different nesting techniques is compared, using two independent nested-grid modelling systems. In this paper, a new nesting algorithm is described and some preliminary results are demonstrated. The validity of the nesting method is shown in some problems for the depth averaged of 2D linear shallow water equation.

The aim of this paper is to determine the flexural moment capacity of Reactive Powder Concrete (RPC) two-way slabs based on three models proposed by previous studies (Model 1, Model 2, and Model 3). The results obtained from these models were compared with those obtained from experimental work to check the accuracy and the applicability of the adopted theoretical models. The experimental program included the testing of three simply supported RPC two-way slabs (1000x1000x70) mm each. The tested specimens had identical properties except their steel fibres volume ratios (0.5 %, 1 %, and 1.5 %). The comparison with the experimental data showed that (Model 3) is the most suitable one among the three models. Model 1 was found to underestimate the

The aim of this paper is to present method for solving ordinary differential equations of eighth order with two point boundary conditions. We propose two-point osculatory interpolation to construct polynomial solution.

The Adaptive Optics technique has been developed to obtain the correction of atmospheric seeing. The purpose of this study is to use the MATLAB program to investigate the performance of an AO system with the most recent AO simulation tools, Objected-Oriented Matlab Adaptive Optics (OOMAO). This was achieved by studying the variables that impact image quality correction, such as observation wavelength bands, atmospheric parameters, telescope parameters, deformable mirror parameters, wavefront sensor parameters, and noise parameters. The results presented a detailed analysis of the factors that influence the image correction process as well as the impact of the AO components on that process

Fractal image compression depends on representing an image using affine transformations. The main concern for researches in the discipline of fractal image compression (FIC) algorithm is to decrease encoding time needed to compress image data. The basic technique is that each portion of the image is similar to other portions of the same image. In this process, there are many models that were developed. The presence of fractals was initially noticed and handled using Iterated Function System (IFS); that is used for encoding images. In this paper, a review of fractal image compression is discussed with its variants along with other techniques. A summarized review of contributions is achieved to determine the fulfillment of fractal ima

Fractal image compression gives some desirable properties like fast decoding image, and very good rate-distortion curves, but suffers from a high encoding time. In fractal image compression a partitioning of the image into ranges is required. In this work, we introduced good partitioning process by means of merge approach, since some ranges are connected to the others. This paper presents a method to reduce the encoding time of this technique by reducing the number of range blocks based on the computing the statistical measures between them . Experimental results on standard images show that the proposed method yields minimize (decrease) the encoding time and remain the quality results passable visually.

Three-dimensional (3D) image and medical image processing, which are considered big data analysis, have attracted significant attention during the last few years. To this end, efficient 3D object recognition techniques could be beneficial to such image and medical image processing. However, to date, most of the proposed methods for 3D object recognition experience major challenges in terms of high computational complexity. This is attributed to the fact that the computational complexity and execution time are increased when the dimensions of the object are increased, which is the case in 3D object recognition. Therefore, finding an efficient method for obtaining high recognition accuracy with low computational complexity is essentia