• Structural Engineering and Mechanics
• /
• 제30권2호
• /
• pp.165-176
• /
• 2008

In this paper, a new iterative method for solving vehicle-bridge interaction problems is proposed. Iterative methods have advantages over the non-iterative methods in that it is not necessary to update the system matrix for a given wheel location, and the method can be applied for a new type of car or bridge with few or no modifications. In the proposed method, the necessity of system matrices update is eliminated using the equivalent interaction force acting on the bridge, which is obtained iteratively. Ballast stiffness is included in the interaction forces and the geometric compatibility at the contact points are used as convergence criteria. The bridge is considered as an elastic Bernoulli-Euler beam with surface irregularity and ballast stiffness. The moving vehicle is modeled as a multi-axle mass-spring-damper system having many degrees of freedom depending on the number of axles. The pitching effect, which is the interaction effect between the rear and front wheels when a vehicle begins to enter or leave the bridge, is also considered in the formulation including extended ground boundaries having surface irregularity and ballast stiffness. The applicability of the proposed method is illustrated in the numerical studies.

• 제어로봇시스템학회논문지
• /
• 제7권12호
• /
• pp.1001-1008
• /
• 2001

This paper presents a new camera calibration algorithm for ill-conditioned cases in which the camera plane is nearly parallel to a set of non-coplanar calibration boards. for the ill-conditioned case, most of existing calibration approaches such as Tsais radial-alignment-constraint method cannot be applied. Recently, for the ill-conditioned coplanar calibration Lee&Lee[16] proposed an iterative algorithm based on the least square method. The non-coplanar calibration algorithm presented in this paper is an iterative two-stage procedure with extends the previous coplanar calibration algorithm. Through the first stage, camera, position and orientation parameters as well as one radial distortion factor are determined optimally for a given data of the scale factor and the focal length. In the second stage, the scale factor and the focal length are locally optimized. This process is repeated until any improvement cannot be expected any more Computational results are provided to show the performance of the algorithm developed.

• 대한수학회지
• /
• 제57권5호
• /
• pp.1079-1101
• /
• 2020

This work is concerned with a geometric inverse problem in fluid mechanics. The aim is to reconstruct an unknown obstacle immersed in a Newtonian and incompressible fluid flow from internal data. We assume that the fluid motion is governed by the Stokes-Brinkmann equations in the two dimensional case. We propose a simple and efficient reconstruction method based on the topological sensitivity concept. The geometric inverse problem is reformulated as a topology optimization one minimizing a least-square functional. The existence and stability of the optimization problem solution are discussed. A topological sensitivity analysis is derived with the help of a straightforward approach based on a penalization technique without using the classical truncation method. The theoretical results are exploited for building a non-iterative reconstruction algorithm. The unknown obstacle is reconstructed using a levelset curve of the topological gradient. The accuracy and the robustness of the proposed method are justified by some numerical examples.

• 제어로봇시스템학회논문지
• /
• 제11권4호
• /
• pp.279-283
• /
• 2005

This paper deals with the design of a low-order H/sub ∞/ controller by using an iterative linear matrix inequality (LMI) method. The low-order H/sub ∞/ controller is represented in terms of LMIs with a rank condition. To solve the non-convex rank-constrained LMI problem, the recently developed penalty function method is applied. With an increasing sequence of the penalty parameter, the solution of the penalized optimization problem moves towards the feasible region of the original non-convex problem. Numerical experiments showed the effectiveness of the proposed algorithm.

• Nonlinear Functional Analysis and Applications
• /
• 제27권2호
• /
• pp.381-403
• /
• 2022

The main goal of this research is to solve variational inequalities involving quasimonotone operators in infinite-dimensional real Hilbert spaces numerically. The main advantage of these iterative schemes is the ease with which step size rules can be designed based on an operator explanation rather than the Lipschitz constant or another line search method. The proposed iterative schemes use a monotone and non-monotone step size strategy based on mapping (operator) knowledge as a replacement for the Lipschitz constant or another line search method. The strong convergences have been demonstrated to correspond well to the proposed methods and to settle certain control specification conditions. Finally, we propose some numerical experiments to assess the effectiveness and influence of iterative methods.

• 한국기계가공학회지
• /
• 제21권8호
• /
• pp.32-42
• /
• 2022

Asymptotic tracking of a non-minimum phase nonlinear system has been a popular topic in control theory and application. In this paper, we propose a new control scheme to achieve asymptotic output tracking in anon-minimum phase nonlinear system for periodic trajectories through an iterative learning control with the stable inversion. The proposed design method is robust to parameter uncertainties and periodic external disturbances since it is based on iterative learning. The performance of the proposed algorithm was demonstrated through the simulation results using a typical non-minimum nonlinear system of an inverted pendulum on a cart.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2000년도 추계학술대회 논문집 학회본부 D
• /
• pp.797-799
• /
• 2000

Most neural network learning schemes are derived from learning systems which are generally iterative in nature. But, when the given input-output training vector pairs satisfy a PLI condition, the training and the application of a hard-limited neural network can be achieved non-iteratively with very short training time and very robust recognition when it is applied to recognize any untrained patterns. In this paper, a method of expanding the dimension of training pattern data is suggested. The proposed method demonstrates better performance and robustness.

• Journal of Information Processing Systems
• /
• 제10권2호
• /
• pp.163-175
• /
• 2014

This paper will focus on improving the performance of orthogonal frequency division multiplexing (OFDM) in Rayleigh fading environments. The proposed technique will use a previously published method that has been shown to improve OFDM performance in independent fading, based on ordered sub-carrier selection. Then, a simple non-iterative method for finding the optimal bit-loading allocation was proposed. It was also based on ordered sub-carrier selection. We compared both of these algorithms to an optimal bit-loading solution to determine their effectiveness in a correlated fading environment. The correlated fading was simulated using the JTC channel models. Our intent was not to create an optimal solution, but to create a low complexity solution that can be used in a wireless environment in which the channel conditions change rapidly and that require a simple algorithm for fast bit loading.

• 정보처리학회논문지B
• /
• 제10B권6호
• /
• pp.673-680
• /
• 2003

이 논문은 문맥 독립 화자인식에 사용될 벡터 양자기의 설계법 개선에 관한 연구이다. 구체적으로 벡터 양자기 코드북 생성 과정에서 특징 벡터 공간을 분할하여, 양자기 설계 시 학습에 필요한 계산 복잡도를 획기적으로 줄이는 방법을 제안한다. 제안된 공간 분할 벡터 양자기 설계법은 저자가 제안한 문맥 종속 화자인식을 위한 준비반복 벡터 양자기 설계법의 벡터 공간에 대한 일반화이다. 공간 분할 벡터 양자기 설계법은 종래의 설계법이 코드북 생성에 반복적 학습 설계를 사용한다는 것과 대조를 이룬다. 또한 공간 분할 벡터 양자기 설계법의 특징은 다음과 같다. 첫째, 이 설계법은 특징 벡터 공간을 분할한 공간 분할 군집을 이용함으로써 반복 학습을 하지 않는다. 둘째, 설계된 각 양자 영역은 공간 분할 군집의 양자 영역을 원용하며, 양자점은 각각의 통계 분포에 대해 최적점으로 설정된다. 셋째, 공간 분할 군집은 특징 벡터 집합에 대해 표본 벡터 생성법(CSVQ1, 2), 특징 벡터 공간에 대해 균일 초격자 구조 생성법(CSYQ3)으로 형성하였다. 수치 실험은 화자 10명이 발성한 50개의 문장에 대해 문맥 독립 화자인식 실험으로 수행되었다. 특징계수는 12차 멜켑스트럼 벡터를 사용하였고 각각의 공간 분할 코드북 생성법에 대해 코드북 크기를 32부터 128까지 변화시키면서 기존의 벡터 양자기 인식법과 비교하였다. 제안된 방법은 표본 벡터 생성법을 사용한 경우 인식률 100%로 기존의 방법과 같은 결과를 보였다. 따라서 제안된 공간 분할 벡터 양자기 설계법은 설계에 필요한 계산량이 획기적으로 줄면서 인식률은 보존되어 문맥 독립 화자 인식에 새로운 대안이 되며 또한 특징 벡터 공간을 설정할 수 있는 다양한 응용에 적용이 가능할 것으로 사료된다.

• 전기학회논문지
• /
• 제61권12호
• /
• pp.1926-1931
• /
• 2012

We investigated a novel fast non-uniform illumination correction method for bi-level images. The proposed method divides a bi-level image into sub-images and roughly estimates block-wise illumination by low pass filtered maximum values of sub-images. After that, we apply bilinear interpolation using the block-wise illumination to estimate non-uniform illumination, and compensate for the effect of non-uniform illumination using the estimated illumination. Since the proposed method is not based on computation intensive iterative optimization, the proposed method can be used effectively for applications that require fast correction of non-uniform illumination. In simulations, the proposed method showed more than 20 times faster speed than existing entropy minimization method. Moreover, in simulations and experiments, the restored images by the proposed method were more close to true images than images restored by conventional method.