• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제15권5호
• /
• pp.1649-1665
• /
• 2021

In view of the low accuracy of the traditional FunkSVD algorithm, and in order to improve the computational efficiency of the algorithm, this paper proposes a parallel algorithm of improved FunkSVD based on Spark (SP-FD). Using RMSProp algorithm to improve the traditional FunkSVD algorithm. The improved FunkSVD algorithm can not only solve the problem of decreased accuracy caused by iterative oscillations but also alleviate the impact of data sparseness on the accuracy of the algorithm, thereby achieving the effect of improving the accuracy of the algorithm. And using the Spark big data computing framework to realize the parallelization of the improved algorithm, to use RDD for iterative calculation, and to store calculation data in the iterative process in distributed memory to speed up the iteration. The Cartesian product operation in the improved FunkSVD algorithm is divided into blocks to realize parallel calculation, thereby improving the calculation speed of the algorithm. Experiments on three standard data sets in terms of accuracy, execution time, and speedup show that the SP-FD algorithm not only improves the recommendation accuracy, shortens the calculation interval compared to the traditional FunkSVD and several other algorithms but also shows good parallel performance in a cluster environment with multiple nodes. The analysis of experimental results shows that the SP-FD algorithm improves the accuracy and parallel computing capability of the algorithm, which is better than the traditional FunkSVD algorithm.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제13권12호
• /
• pp.6028-6042
• /
• 2019

Since Sparse Nonnegative Matrix Factorization (SNMF) method can control the sparsity of the decomposed matrix, and then it can be adopted to control the sparsity of facial feature extraction and recognition. In order to improve the accuracy of SNMF method for facial feature recognition, new additive iterative rules based on the improved iterative step sizes are proposed to improve the SNMF method, and then the traditional multiplicative iterative rules of SNMF are transformed to additive iterative rules. Meanwhile, to further increase the sparsity of the basis matrix decomposed by the improved SNMF method, a threshold-sparse constraint is adopted to make the basis matrix to a zero-one matrix, which can further improve the accuracy of facial feature recognition. The improved SNMF method based on the additive iterative rules and threshold-sparse constraint is abbreviated as ASNMF, which is adopted to recognize the ORL and CK+ facial datasets, and achieved recognition rate of 96% and 100%, respectively. Meanwhile, from the results of the contrast experiments, it can be found that the recognition rate achieved by the ASNMF method is obviously higher than the basic NMF, traditional SNMF, convex nonnegative matrix factorization (CNMF) and Deep NMF.

• Structural Engineering and Mechanics
• /
• 제83권3호
• /
• pp.353-361
• /
• 2022

Linear Elastic Fracture Mechanics (LEFM) has been developed by applying stress analysis to determine the stress intensity factor (SIF, K). The finite element method (FEM) is widely used as a standard tool for evaluating the SIF for various crack configurations. The prediction accuracy can be achieved by applying an adaptive Delaunay triangulation combined with a FEM. The solution can be solved using either direct or iterative solvers. This work adopts the element-by-element preconditioned conjugate gradient (EBE-PCG) iterative solver into an adaptive FEM to solve the solution to heal problem size constraints that exist when direct solution techniques are applied. It can avoid the formation of a global stiffness matrix of a finite element model. Several numerical experiments reveal that the present method is simple, fast, and efficient compared to conventional sparse direct solvers. The optimum convergence criterion for two-dimensional LEFM analysis is studied. In this paper, four sample problems of a two-edge cracked plate, a center cracked plate, a single-edge cracked plate, and a compact tension specimen is used to evaluate the accuracy of the prediction of the SIF values. Finally, the efficiency of the present iterative solver is summarized by comparing the computational time for all cases.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1989년도 한국자동제어학술회의논문집; Seoul, Korea; 27-28 Oct. 1989
• /
• pp.1097-1112
• /
• 1989

An iterative learning control scheme is incorporated to the computed torque method as a means to enhance the accuracy and the flexibility. A learning rule is constructed by utilizing a gradient descent algorithm and data compressing techniques are illustrated. Computer simulation results show a good performance of the scheme under a relatively high speed and a heavy payload condition.

• Journal of electromagnetic engineering and science
• /
• 제9권1호
• /
• pp.12-16
• /
• 2009

This paper presents a new iterative locally one-dimensional [mite-difference time-domain(LOD-FDTD) method that has a simpler formula than the original iterative LOD-FDTD formula[l]. There are fewer arithmetic operations than in the original LOD-FDTD scheme. This leads to a reduction of CPU time compared to the original LOD-FDTD method while the new method exhibits the same numerical accuracy as the iterative ADI-FDTD scheme. The number of arithmetic operations shows that the efficiency of this method has been improved approximately 20 % over the original iterative LOD-FDTD method.

• 한국BIM학회 논문집
• /
• 제11권4호
• /
• pp.1-9
• /
• 2021

Comparing to general scanning data, the 3D digital map for large construction sites and complex buildings consists of millions of points. The large construction site needs to be scanned multiple times by drone photogrammetry or terrestrial laser scanner (TLS) survey. The scanned point cloud data are required to be registrated with high resolution and high point density. Unlike the registration of 2D data, the matrix of translation and rotation are used for registration of 3D point cloud data. Archiving high accuracy with 3D point cloud data is not easy due to 3D Cartesian coordinate system. Therefore, in this study, iterative closest point (ICP) registration method for improve accuracy of 3D digital map was employed by different overlap ratio on 3D digital maps. This study conducted the accuracy test using different overlap ratios of two digital maps from 10% to 100%. The results of the accuracy test presented the optimal overlap ratios for an ICP registration method on digital maps.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 2002년도 가을 학술발표회 논문집
• /
• pp.607-614
• /
• 2002

For the accurate analysis of crack problems, considerable nodal refinement near the crack tip to capture singular stress field with sufficient accuracy to provide a useful computation of stress intensity factor is required. So, in this paper, adaptive nodal refinement scheme is proposed where nodes in restricted cell regions centered at crack tip are arranged in array for enhanced spatial resolution and adaptivity. With only cell-wise adaptive refinement scheme around crack tip fields, singularity of crack tip is sufficiently described to expect a successive crack propagate direction. Through numerical tests, accuracy of the proposed adaptive scheme is investigated and compared with the finite element and experimental results. By this implementation, it is shown that high accuracy is achieved by using iterative cell-wise solution method fur analyzing crack propagation problems.

• 한국전산구조공학회논문집
• /
• 제25권5호
• /
• pp.439-446
• /
• 2012

본 논문은 1차원 자유경계문제 해석의 정확도 향상을 위해 이동최소제곱 차분법을 이용하여 이동경계의 위상변화를 implicit하게 추적하는 기법을 제시한다. 기존의 이동최소제곱 차분법은 이동경계의 위치를 explicit하게 진전시켜 반복계산은 필요없지만 해의 정확도 감소를 피할 수 없었다. 그러나 본 연구에서 제시한 implicit 기법은 전체 계방정식이 비선형 시스템이 되어 반복계산 과정이 필요하지만, 실제로 수치예제를 통해 검증해 본 결과 계산량의 큰 증가없이 해석의 정확도를 획기적으로 향상시켰다. 이동하는 미분불연속 특이성을 갖는 융해(melting)문제를 수치계산한 결과, implicit 이동최소제곱 차분법을 통해 2차정확도를 얻을 수 있음을 보였다.

• 한국전산유체공학회지
• /
• 제9권3호
• /
• pp.57-65
• /
• 2004

The incompressible Navier-Stokes equations in two dimensions are stabilized by a modified residual method, and then discretized by hierarchical elements. The stabilization is necessary to escape from the Ladyzhenskaya-Babuska-Brezzi(LBB) constraint and hence to achieve an equal order formulation. To expedite a standard iterative method such as the conjugate gradient squared(CGS) method, a preconditioning technique called the Hierarchical Iterative Procedure(HIP) has been applied. In this paper, we increased the order of interpolation within an element up to cubic. The hierarchical elements have been used to achieve a higher order accuracy in fluid flow analyses, but a proper efficient iterative procedure for higher order finite element formulation has not been available so far The numerical results by the present HIP for the lid driven cavity flow and others showed the present procedure to be stable, very efficient and useful in flow analyses in conjunction with hierarchical elements.

• 한국전자통신학회논문지
• /
• 제10권7호
• /
• pp.793-800
• /
• 2015

이동 로봇 Pan-Tilt 기구부에 장착된 스테레오 카메라의 Head-Eye 보정 및 Wheel 보정을 동시에 수행하는 방법을 제안한다. 카메라가 이동로봇의 고정형 기구부에 장착되어있는 경우를 고려한 기존의 방법들은 최근 일반적인 이러한 시스템에 적용될 수 없다. 이러한 문제점을 해결하기 위하여 본 논문에서는 기존 방법을 바탕으로 한 선형 반복적인 방법을 고안하였다. 이것은 동시보정을 통한 효율성뿐만 아니라 정확도 면에서도 만족할만한 결과를 얻었다. 그리고 비선형 최적화 기법을 통해 보다 높은 정확도의 보정을 구현했다.