Prediction of Poor Inhabitant Number Using Least Square and Moving Average Method
نویسندگان
چکیده
منابع مشابه
Moving Least Square Reproducing Kernel Method ( III ) : Wavelet Packet & Its
This work is a natural extension of the work done in Part II of this series. A new partition of unity | the synchronized reproducing kernel (SRK) interpolant|is proposed within the framework of moving least square reproducing kernel representation. It is a further development and generalization of the reproducing kernel particle method (RKPM), which demonstrates some superior computational capa...
متن کاملMoving least-square reproducing kernel method Part II: Fourier analysis
In Part I of this work, the moving least-square reproducing kernel (MLSRK) method is formulated and implemented. Based on its generic construction, an m-consistency structure is discovered and the convergence theorems are established. In this par\ of the work, a systematic Fourier analysis is employed to evaluate and further establish the method. The preliminary Fourier analysis reveals that th...
متن کاملAverage Power in Digital CMOS Circuits using Least Square Estimation
Power estimation is an important issue in digital VLSI circuit design. The estimation of average power dissipation of a circuit through exhaustive simulation is impractical due to the large number of primary inputs and their combinations. In this paper, two algorithms based on least square estimation are proposed for determining the average power dissipation in CMOS circuits. Least square estim...
متن کامل3D Surface Reconstruction from Scattered Data Using Moving Least Square Method
This paper presents an efficient implementation of moving least square(MLS) approximation for 3D surface reconstruction. The smoothness of the MLS is mainly determined by the weight function where its support greatly affects the accuracy as well as the computational time in the mixed dense and scattered data. In a point-set, possibly acquired from a 3D scanning device, it is important to determ...
متن کاملPrediction in moving average processes
For the stationary invertible moving average process of order one with unknown innovation distribution F , we construct root-n consistent plug-in estimators of conditional expectations E(h(Xn+1)|X1, . . . , Xn). More specifically, we give weak conditions under which such estimators admit Bahadur type representations, assuming some smoothness of h or of F . For fixed h it suffices that h is loca...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: International Journal of Advanced Computer Science and Applications
سال: 2015
ISSN: 2156-5570,2158-107X
DOI: 10.14569/ijacsa.2015.061033