• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• pp.2081-2086
• /
• 2005

This paper proposes the receding horizon $H_{\infty}$ predictive control (RHHPC) for systems with a state-delay. We first proposes a new cost function for a finite horizon dynamic game problem. The proposed cost function includes two terminal weighting terns, each of which is parameterized by a positive definite matrix, called a terminal weighting matrix. Secondly, we derive the RHHPC from the solution to the finite dynamic game problem. Thirdly, we propose an LMI condition under which the saddle point value satisfies the well-known nonincreasing monotonicity. Finally, we shows the asymptotic stability and $H_{\infty}$-norm boundedness of the closed-loop system controlled by the proposed RHHPC. Through a numerical example, we show that the proposed RHHC is stabilizing and satisfies the infinite horizon $H_{\infty}$-norm bound.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.33A no.10
• /
• pp.40-47
• /
• 1996

A method for computing effectiv ebandwidth of aggregated varable bit rate (VBR) moving picture experts group (MPEG) video traffic is proposed. To compute statistical characteristics of aggregated MPEG traffic, first we split input MPEG traffic into I, B, and P frame traffics and aggregate respective I, B, and P frame traffics according to the frame type. Second statisticsal characteristics of the aggregated MPEG traffic are obtained using those of aggregated I, B, and P frame traffics. The effective bandwidth of the aggregated I frame traffic is computed by using the gaussian bound. Using the modified equivalent capacity, we obtain the effective bandwidths of aggregated B and P frame traffics and then compute the effective bandwidth of the combined B and P frame traffic. Finally the effective bandwidth of the aggregated MPEG traffic is computed by adding the gaussian bound of the aggregated I frame traffic and modifed equivalent capacity of combined B and P frame traffic. Computer simulation shows that the proposed method estimates effective bandwidth of the aggregated MPEG traffic well.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.2
• /
• pp.81-89
• /
• 1998

Numerical calculation tools for forging of gear-like components based on kinematically admissible velocity fields for upper bound method applicable to various deformation features of workpiece in forging processes were suggested. Each one of them deals with unidirectional flow of metal on dies, such as external involute spur gear. square spline, internal serrations. A complex calculation tool of gear-like component forging process was built up by combining these kinematically velocity fields. In this paper the workpiece with 110th external and internal teeth is divided into two parts. The deformation of each part is analyzed simultaneously using numerical calculation tool from combined kinematically admissible velocity field. The experimental set-up was installed in a 200 ton hydraulic press. As a result, each kinematically admissible velocity field could be combined with others and the calculated solution are useful to predict the capacity of forging equipment.

• Bulletin of the Korean Chemical Society
• /
• v.32 no.8
• /
• pp.2599-2606
• /
• 2011

The fluorescence of ethidium bound to DNA, poly[d(A-T)$_2$], and poly[d(G-C)$_2$] at a [ethidium]/[DNA] ratio of 0.005 was quenched by porphyrins when both ethidium and the porphyrins simultaneously bound to the same polynucleotide. The quenching was tested using the "inner sphere" and the "Forster resonance energy transfer" (FRET) models, with the latter found to contribute, at least in part, to the quenching. Meso-tetrakis(N-methylpyridinium-4-yl)porphyrin (TMPyP) exhibited a higher quenching and FRET efficiency than cis-bis(N-methylpyridinium-4-yl)porphyrin (BMPyP) for all of the tested DNA and polynucleotides, demonstrating that energy transfer efficiency is affected by the number of positive charges of porphyrins.

• Journal of the Korean Geotechnical Society
• /
• v.17 no.3
• /
• pp.69-75
• /
• 2001

본 논문에서는 지하공동 위에 설치된 띠 기초의 지지력에 대하여 upper bound theory를 이용하여 연구하였다. 기초 크기, 공동의 크기 및 위치, 그리고 지반의 물성치의 영향에 관하여 고찰하였으며 10개의 파괴 형상에 대하여 분석을 수행하였다. 각각의 파괴형상은 지반의 물성치 및 기하학적인 형상에 관한 함수로 표현되어 컴퓨터 해석을 통한 최소화를 시행하였다. 최소화를 위한 프로그램은 Boland C++ Builder를 이용하여 작성한 후 PC에서 수행되었다. 10개의 파괴형상 중 최소의 기초 지지력을 작성된 컴퓨터 프로그램을 통하여 구하였고 이를 해당 기초의 극한 지지력으로 추정되었다. 본 연구의 결과를 종합 정리하여 지하공동 위에 위치한 띠 기조의 극한 지지력을 구할 수 있는 간단한 식을 제시하였다.

• Proceedings of the IEEK Conference
• /
• 2008.06a
• /
• pp.451-452
• /
• 2008

In this paper we describe a multi-module, multi-port memory design procedure that satisfies area and/or energy constraints. Our procedure uses ILP models to determine (a) the memory configuration with minimum area, given the energy bound, (b) the memory configuration with minimum energy, given the area bound. If we have a margin in time constraint, we break up conflict edges and expend the search space of ILP. This method effectively reduces area and power of the designed results.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.62.4-62
• /
• 2001

In this paper, we propose a delay-dependent guaranteed cost controller design method for uncertain linear systems with time delay. The uncertainty is norm bounded and time-varying. A quadratic cost function is considered as the performance measure for the given system. Based on the Lyapunov method, sufficient condition, which guarantees that the closed-loop system is asymptotically stable and the upper bound value of the closed-loop cost function is not more than a specied one, is derived in terms of Linear Matrix Inequalities(LMIs) that can be solved sufficiently. A convex optimization problem can be formulated to design a guaranteed cost controller, which minimizes the upper bound value of the cost function. Numerical examples show the activeness of the proposed method.

• 제어로봇시스템학회:학술대회논문집
• /
• 2001.10a
• /
• pp.89.2-89
• /
• 2001

Wheel chair bound persons need assistance since there are many steps or curbs or other obstacles blocking their path in the roadways and walkways. Although a step may be small, it may be very difficult for such a person to climb over it. Therefore, we are proposing a power assist wheel chair robot that enables a wheel chair bound person to climb over steps up to about 10 centimeters in height without assistance from others. By using the proposed wheel chair robot, a user can maintain inverse pendulum control after raising its front wheels Then, a user can move forward to the step maintaining the inverse pendulum control, and can climb over the step using motor force of a rear wheel shaft ...

• Proceedings of the IEEK Conference
• /
• 2002.07b
• /
• pp.1070-1073
• /
• 2002

This study presents a parallel branch-and-bound (PBAB) method for traveling salesman problem (TSP). The PBAB method adopts intermediate form of central control and distributed control in terms of the lightness of the master process's role. Compared with fully distributed control, the control scheme involves less concentration of communication on the master. Moreover, in order to reduce the influence of communication, the worker is composed of a computation thread and a communication thread. The multithreadness realizes the almost blocking free communications on the master. We implement the proposed PBAB method on a network of PCs, which consists of one master and up to 16 workers. We experiment five TSP instances. The results shows that the efficiency increases with the problem size.

• ETRI Journal
• /
• v.21 no.4
• /
• pp.9-22
• /
• 1999

This paper considers a problem of configuring both physical backbone and logical virtual path (VP) networks in a reconfigurable asynchronous transfer mode (ATM) network where links are subject to failures. The objective is to determine jointly the VP assignment, the capacity assignment of physical links and the bandwidth allocation of VPs, and the routing assignment of traffic demand at least cost. The network cost includes backbone link capacity expansion cost and penalty cost for not satisfying the maximum throughput of the traffic due to link failures or insufficient link capacities. The problem is formulated as a zero-one non-linear mixed integer programming problem, for which an effective solution procedure is developed by using a Lagrangean relaxation technique for finding a lower bound and a heuristic method exploited for improving the upper bound of any intermediate solution. The solution procedure is tested for its effectiveness with various numerical examples.