• Nonlinear Functional Analysis and Applications
• /
• 제27권4호
• /
• pp.881-894
• /
• 2022

In this paper, we consider a class of random generalized nonlinear mixed variational inclusions with random fuzzy mappings and random relaxed cocoercive mappings in real Hilbert spaces. We suggest and analyze an iterative algorithm for finding the approximate solution of this class of inclusions. Further, we discuss the convergence analysis of the iterative algorithm under some appropriate conditions. Our results can be viewed as a refinement and improvement of some known results in the literature.

• 한국CDE학회논문집
• /
• 제14권2호
• /
• pp.129-136
• /
• 2009

Generally, curved surfaces of ship hull are deformed by flame bending (line heating), multi-press forming, and die-less forming method. The forming methods generate the required in-plane/bending strain or displacement on the flat plate to make the curved surface. Multi-press forming imposes the forced displacements on the flat plate by controlling the position of each pressing points based upon the shape difference between the unfolded flat plate and the curved object shape. The flat plate has been obtained from the unfolding system that is independent of the ship CAD. Apparently, the curved surface and the unfolded-flat surface are expressed by different coordinate systems. Therefore, one of the issues is to find a registration of the unfolded surface and the curved shape for the purpose of minimum amount of forming works by comparing the two surfaces. This paper presents an efficient algorithm to get an optimized registration of two different surfaces in the multi-press forming of ship hull plate forming. The algorithm is based upon the ICP (Iterative Closest Point) algorithm. The algorithm consists of two iterative procedures including a transformation matrix and the closest points to minimize the distance between the unfolded surface and curved surfaces. Thereby the algorithm allows the minimized forming works in ship-hull forming.

• 제어로봇시스템학회논문지
• /
• 제4권5호
• /
• pp.608-615
• /
• 1998

In this paper a second-order iterative learning control algorithm with feedback is proposed for the trajectory-tracking control of nonlinear dynamic systems with unidentified parameters. In contrast to other known methods, the proposed teaming control scheme utilize more than one past error history contained in the trajectories generated at prior iterations, and a feedback term is added in the learning control scheme for the enhancement of convergence speed and robustness to disturbances or system parameter variations. The convergence proof of the proposed algorithm is given in detail, and the sufficient condition for the convergence of the algorithm is provided. We also discuss the convergence performance of the algorithm when the initial condition at the beginning of each iteration differs from the previous value of the initial condition. The effectiveness of the proposed algorithm is shown by computer simulation result. It is shown that, by adding a feedback term in teaming control algorithm, convergence speed, robustness to disturbances and robustness to unmatched initial conditions can be improved.

• 대한전기학회논문지:전력기술부문A
• /
• 제51권3호
• /
• pp.127-133
• /
• 2002

This paper presents an efficient improvement of the iterative eigenvalue calculation method of the AESOPS algorithm. The intuitively and heuristically approximated iterative eigenvalue calculation method of the AESOPS algorithm is transformed to the Second Order Newton Raphson Method which is generally used in numerical analysis. The equations of second order partial differentiation of external torque, terminal and internal voltages are derived from the original AESOPS algorithm. Therefore only a few calculation steps are added to transform the intuitively and heuristically approximated AESOPS algorithm to the Second Order Newton Raphson Method, while the merits of original algorithm are still preserved.

• 한국통신학회논문지
• /
• 제27권3B호
• /
• pp.179-187
• /
• 2002

본 논문은 단위 셀 비동기 W-CBMA 시스템 역방향 링크의 다중경로 페이딩 채널에서 동기복조 방식의 다중 사용자 검출을 위한 반복 그룹단위 등지연 간섭제거 (IGEIC : iterative group-wise equal-delay interference cancellation) 알고리즘을 제안하고 성능을 해석하였다. IGEIC 알고리즘은 사용자를 그룹단위로 나누고, 그룹내에서 사용자 수만큼 반복해서 간섭을 제거한 다음, 다시 재확산시켜 다른 사용자 신호성분을 제거한다. IGEIC 알고리즘은 반복 그룹단위 등지연 직렬 간섭제거(IGESIC)와 반복 그룹단위 등지연 병렬 간섭제거(IGEPIC) 알고리즘으로 나누어 제안하였다. 확산부호의 완벽한 상관조건에서 그룹내 사용자 수만큼 간섭제거 후의 IGESIC와 IGEPIC 알고리즘 성능은 동일하며, 그룹내 사용자 수만큼의 간섭제거 직전의 성능은 IGEPIC 알고리즘이 IGESIC 알고리즘보다 우수하다. 또한 두 가지 제안 알고리즘 성능은 직렬 간섭제거 알고리즘 성능보다 3dB 이상 우수한 결과를 얻었다.

• Journal of Communications and Networks
• /
• 제17권4호
• /
• pp.339-345
• /
• 2015

In this paper, we present an iterative reliability-based modified majority-logic decoding algorithm for two classes of structured low-density parity-check codes. Different from the conventional modified one-step majority-logic decoding algorithms, we design a turbo-like iterative strategy to recover the performance degradation caused by the simply flipping operation. The main computational loads of the presented algorithm include only binary logic and integer operations, resulting in low decoding complexity. Furthermore, by introducing the iterative set, a very small proportion (less than 6%) of variable nodes are involved in the reliability updating process, which can further reduce the computational complexity. Simulation results show that, combined with the factor correction technique and a well-designed non-uniform quantization scheme, the presented algorithm can achieve a significant performance improvement and a fast decoding speed, even with very small quantization levels (3-4 bits resolution). The presented algorithm provides a candidate for trade-offs between performance and complexity.

• Genomics & Informatics
• /
• 제2권2호
• /
• pp.92-98
• /
• 2004

A cDNA microarray experiment is one of the most useful high-throughput experiments in medical informatics for monitoring gene expression levels. Statistical analysis with a cDNA microarray medical data requires a normalization procedure to reduce the systematic errors that are impossible to control by the experimental conditions. Despite the variety of normalization methods, this. paper suggests a more general and synthetic normalization algorithm with a control gene set based on previous studies of normalization. Iterative normalization method was used to select and include a new control gene set among the whole genes iteratively at every step of the normalization calculation initiated with the housekeeping genes. The objective of this iterative normalization was to maintain the pattern of the original data and to keep the gene expression levels stable. Spatial plots, M&A (ratio and average values of the intensity) plots and box plots showed a convergence to zero of the mean across all genes graphically after applying our iterative normalization. The practicability of the algorithm was demonstrated by applying our method to the data for the human photo aging study.

• 대한전자공학회논문지SP
• /
• 제47권5호
• /
• pp.145-152
• /
• 2010

본 논문에서는 초점 열화를 제거하기 위해서 반복적 Unsharp mask (UM) 필터를 이용한 디지털 자동초점 기법을 제안한다. 제안한 디지털 자동초점 기술은 영상열화를 추정하기 위해서 점확산함수를 추정하지 않고 단순한 필터를 사용하기 때문에 계산량이 적은 장점을 갖는다. 본 기법은 반복적 필터 구조로 영상을 복원하기 때문에 사용자의 주관적 기준 및 영상의 객관적 지표를 사용하여 필터링의 반복 회수를 제한할 수 있다. 또한 반복적 UM 기반의 영상개선 방법이 기존의 반복적 영상복원 기술과 등가임을 보인다. 마지막으로 본 논문에서 제안한 알고리듬의 성능평가를 위해서 기존의 영상복원 기반의 디지털 자동초점 기술과의 비교 실험을 수행하였고, 이를 통하여 제안한 디지털 자동초점 기법이 주관적으로나 객관적으로 우수함을 보였다.

• 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.

• 대한전기학회논문지:전력기술부문A
• /
• 제48권5호
• /
• pp.629-635
• /
• 1999

A second-order iterative learning control algorithm with feedback is proposed in this paper, in which a feedback term is added in the learning control scheme for the enhancement of convergence speed and robustness to disturbances or system parameter variations. The convergence proof of the proposed algorithm is givenl, and the sufficient condition for the convergence of the algorithm is provided. And it also includes the discussions about the convergence performance of the algorithm when the initial condition at the beginning of each iteration differs from the previous value of the initial. Simulation results show the validity and efficiency of the proposed algorithm.