• 한국멀티미디어학회논문지
• /
• 제21권8호
• /
• pp.813-820
• /
• 2018

This paper proposes new frame rate up-conversion algorithms. Adaptive motion estimation based on block complexity information are used to obtain more accurate motion vectors. Because the information on block complexity is extracted from the motion estimation prediction size from the original frame, additional computational complexity is not imparted. In experimental results, the proposed algorithms provide robust frame interpolation performance for whole test sequences. Also, the computational complexity of the proposed algorithm is reduced to a benchmark algorithm.

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

A procedure for the predictive control for structural vibration control in building subject to wind loads is presented. The building motions are modeled by the first mode of the response. Wind velocities are generated by the simulation using power spectral density function. Predictive control algorithm is the discrete-time formulation and that is developed as a control strategy that computes the control signal which makes the predicted process output equal to a desired process output. Results on the reduction of the dynamic response and control effectiveness of the algorithm are presented and discussed.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.141.4-141
• /
• 2001

In this paper the Local Weighted Regression LWR technique is applied to the estimation of aircrcraft parameters. The method consists In improving the Local Weighted Regression LWR technique by adding a data Retention-and-Deletion RD strategy. The improvement comes with reduced computational effort since the two techniques can share their main computational procedures. The purpose of the study was to establish if the proposed algorithm could provide fast and reliable real-time estimations, with accuracy comparable to other well-known off-line identification schemes. The algorithm was tested using specific parameter estimation maneuvers and flight data of the NASA F/A-18 HARV. The results were compared with both the estimation obtained from ...

• 한국경영과학회:학술대회논문집
• /
• 대한산업공학회/한국경영과학회 1994년도 춘계공동학술대회논문집; 창원대학교; 08월 09일 Apr. 1994
• /
• pp.13-20
• /
• 1994

We consider the satellite cluster scheduling problem which is one of the most interesting problems in satellite communication scheduling area. This problem is known to be NP-complete and a couple of heuristic algorithms had been developed. In this paper, we suggest another algorithm for this problem which has the same computational complexity as the best existing one and provides much better solution quality. Extensive computational simulation results are reported.

• 한국CDE학회논문집
• /
• 제9권1호
• /
• pp.27-34
• /
• 2004

A tetrahedral mesh generation scheme using 3-D operators has been presented. The proposed scheme employs new 3-D operators such as rearranging and modified finishing operators in addition to the previous trimming, wedging, digging, splitting and finishing operators. These new operators have been introduced in order to increase the stability of mesh generation process. Check processings with surrounded element edges and faces have also been optimized by employing a searching algorithm. Sample meshes are constructed to demonstrate the mesh generating capability of the proposed algorithm.

• Journal of applied mathematics & informatics
• /
• 제18권1_2호
• /
• pp.621-637
• /
• 2005

A hybrid method solving regularized structured linear total least norm (RSTLN) problems, which have highly ill-conditioned coefficient matrix with special structures, is suggested and analyzed. This scheme combining RSTLN algorithm and separation by parts guarantees the convergence of parameters and has an advantages in reducing the residual norm and relative error of solutions. Computational tests for problems arisen in signal processing and image formation process confirm that the presenting method is effective for more accurate solutions to (R)STLN problem than the (R)STLN algorithm.

• Journal of applied mathematics & informatics
• /
• 제28권3_4호
• /
• pp.651-661
• /
• 2010

We consider the inverse problem of the identification of a piecewise-constant conductivity in a bar given the extra information of the heat flux through one end of the bar. Our theoretical results show that such an identification is unique. This approach utilizes a "layer peeling" argument. A computational algorithm based on this method is proposed and implemented. The advantage of this algorithm is that it requires only 3D minimizations irrespective of the number of the unknown discontinuities. Its numerical effectiveness is investigated for several conductivities.

• 한국전산구조공학회:학술대회논문집
• /
• 한국전산구조공학회 1993년도 봄 학술발표회논문집
• /
• pp.53-60
• /
• 1993

Nonlinear equation of motion due to material nonlinearity of structure is transformed to linear equation of motion by treating the nonlinear elastic force term as an applied force. The solution in a time step is carried out by iterative linear dynamic analysis. The present simple algorithm is varidated by several examples .The results show that this algorithm is and efficient.

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

The drift and inter-story drift control method for steel structures subjected to seismic forces is formulated into a structural optimization problem in this paper. The formulated optimization problem with constraints on drift, inter-story drifts, and member strengthes are transformed into an unconstrained optimization problem. For the solution of the tranformed optimization problem an searching algorithm based on the gradient projection method utilizing gradient information on eigenvalues and eigenvectors are developed and presented in detail. The performance of the proposed algorithm is demonstrated by application to drift control of a verifying example.

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

Structural optimization using improved higer-order convex approximation is proposed in this paper. The proposed method is a generalization of the convex approximation method. The order of the approximation function for each constraint is automatically adjusted in the optimization process. And also the order of each design variable is differently adjusted. This self-adjusted capability makes the approximate constraint values conservative enough to maintain the optimum design point of the approximate problem in feasible region. The efficiency of proposed algorithm, compared with conventional algorithm is successfully demonstrated in the Three-bar Truss example.