• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1991년도 한국자동제어학술회의논문집(국제학술편); KOEX, Seoul; 22-24 Oct. 1991
• /
• pp.1811-1816
• /
• 1991

In this paper we present how the deviation bound, which is a synchronic variable, can be used for checking liveness in Petri nets. Also, the deviation bound will be applied to detect or avoid deadlock situations and to characterize concurrency against sequential behaviors in automated manufacturing systems. In the current stage, we restrict the applicable domain of these methods to the Petri net structure that can be synthesized by combining common transitions or common places or common paths of Live-and-Bounded circuits.

• 한국콘크리트학회:학술대회논문집
• /
• 한국콘크리트학회 1998년도 가을 학술발표논문집(II)
• /
• pp.405-411
• /
• 1998

An iterative numerical computational algorithm is presented to design a plate of shell element subjected to membrane and flexural forces. Based on equilibrium consideration, equations for capacities of top and bottom reinforcements in two orthogonal directions have been derived. The amount of reinforcement is determined locally, i. e., for each sampling point, from the equilibrium between applied and internal forces. One case of design is performed for a hyperbolic paraboloid saddle shell (originally used by Lin and Scordelis) to check the design strength against a consistent design load, therefore, to verify the adequacy of design practice for reinforced concrete shells. Based on nonlinear analyses performed, the analytically calculated ultimate load exceeded the design ultimate load from 14-43% for an analysis with relatively low to high tension stiffening, ${\gamma}$ =5~20 cases. For these cases, the design method gives a lower bound on the ultimate load with respect to Lower bound theorem. This shows the adequacy of the current practice at least for this saddle shell case studied. To generalize the conclusion many more designs-analyses are performed with different shell configurations.

• 전자공학회논문지B
• /
• 제33B권4호
• /
• pp.11-16
• /
• 1996

This paper proposes a deadzone estimator for robust system identification. In order to cope with the drift phenomena occurred in where system inputs are not sufficiently excited in adaptive control, we introduce a novel and flexible bound condition against a fixed constant. It is derived from a forgetting factor and a rational value of the traces of the covariance matrices between step k and k-1. The key feature of this is that it does not require a priori for the bound. Also, the calculation of it is more simple than the one of literatures. The simulation results are examined for showing the practical performance of this algorithm.

• 전자공학회논문지S
• /
• 제34S권2호
• /
• pp.1-10
• /
• 1997

In this paper, an improved lower bound on the burst-error correcting capability of th ecyclic product code is presented and through the analysis of this new bound clustered cyclic product (CCP abbr.)code is proposed. The CCP code, to improve the burst-error correcting capability, combines the idea of clustering and the transmission method of cyclic product code. That is, a cluster which is defined in this paper as a group of consecutive code symbols is employed as a new transmission unit to the code array transmission of cyclic product code. the burst-error correcting capability of the CCP code is improved without a loss in the random-error correcting capability and performance comparison in the digital video camera records (DVCR) system shows the superiority of the proposed CCP code over conventional product codes.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1998년도 The Third Asian Fuzzy Systems Symposium
• /
• pp.501-505
• /
• 1998

In this paper, an LP problem with convex polyhedral objective coefficients is treated. In the problem, the interactivities of the uncertain objective coefficients are represented by a bounded convex polyhedron (a convex polytope). We develop a computation algorithm of a maxmin achievement rate solution. To solve the problem, first, we introduce the relaxation procedure. In the algorithm, a sub-problem, a bilevel programing problem, should be solved. To solve the sub-problem, we develop a solution method based on a branch and bound method. As a result, it is shown that the problem can be solved by the repetitional use of the simplex method.

• Journal of the Korean Society for Industrial and Applied Mathematics
• /
• 제14권2호
• /
• pp.93-111
• /
• 2010

The purpose of this paper is to obtain new complexity results for a second-order cone optimization (SOCO) problem. We define a proximity function for the SOCO by a kernel function. Furthermore we formulate an algorithm for a large-update primal-dual interior-point method (IPM) for the SOCO by using the proximity function and give its complexity analysis, and then we show that the new worst-case iteration bound for the IPM is $O(q\sqrt{N}(logN)^{\frac{q+1}{q}}log{\frac{N}{\epsilon})$, where $q{\geqq}1$.

• 대한기계학회논문집
• /
• 제11권1호
• /
• pp.110-117
• /
• 1987

본 논문에서는 터어빈과 콤프레셔 블레이드의 정밀예비현상 및 캠 부품의 제 조에 사용되는 원형소재로부터의 타원형재의 압출에 대한 일반적인 해석방법을 제안할 것이다. 해석결과는 실제 가공경화재인 알루미늄합금(Al2024)의 압출실험을 수행하 여 타당성을 검토하도록 할 것이며 기존의 해석 및 실험결과와도 비교 논의하도록 하 겠다.

• 대한기계학회논문집
• /
• 제16권7호
• /
• pp.1314-1321
• /
• 1992

본 연구에서는 중실형의 해석을 확장하고 유선함수와 상계해법을 이용하여 일 반적 경계역을 갖는 관형압출의 체계적 해석법을 연구해서 보다 정확한 압출하중의 예 측 뿐아니라 소성변형역 및 소성유동도 예측 가능한 방법을 제안하고자 한다.

• Mass Spectrometry Letters
• /
• 제7권1호
• /
• pp.12-15
• /
• 2016

Results of free and bound myo-inositol in infant formula (IF) are presented. Inositol was analyzed by HILIC ultra-performance liquid chromatography coupled with mass spectrometer. The levels of free myo-inositol in 27 Australian and 4 EU originated IF samples were 300-600 mg/kg of powder or 1.6-3.1 mg/100 kJ. The amount of bound inositol in lipid fraction of IF was, on average, 10% of free myo-inositol.

• 대한수학회논문집
• /
• 제17권4호
• /
• pp.719-729
• /
• 2002

Consider the random n $\times$ m assignment problem with m $\geq$ $_{i,j}$ Let $u_{i,j}$ be iid uniform random variables on [0, 1] and exponential random variables with mean 1, respectively, and let $U_{n, m}$ and $T_{n, m}$ denote the optimal assignment costs corresponding to $u_{i, j}$ and $t_{i, j}$. In this paper we first give a comparison result about the discrepancy E $T_{n, m}$ -E $U_{n, m}$. Using this comparison result with a known lower bound for Var( $T_{n, m}$) we obtains a lower bound for Var( $U_{n, m}$). Finally, we study the way that E $U_{n, m}$ and E $T_{n, m}$ vary as m does. It turns out that only when m - n is large enough, the cost decreases significantly.tly.