• Journal of the Korean Data and Information Science Society
• /
• 제16권3호
• /
• pp.657-663
• /
• 2005

Under the minimum risk point estimation formulation of Robbins(1959), we consider the sequential point estimation problem for normal population $N({\theta},\;{\theta})$ with unknown parameter ${\theta}$. In the case of completely unknown ${\theta}$, Stein's(1945) two-stage procedure is known to enjoy the consistency property, but it is not even first-order efficient. In the case when ${\theta}>{\theta}_L\;where\;{\theta}_L(>0)$ is known, the revised two-stage procedure is shown to enjoy all the usual second-order properties.

• 한국자동차공학회논문집
• /
• 제1권1호
• /
• pp.59-65
• /
• 1993

In a spark ignition engine, in order to make research on flame propagation, attentive concentration should be paid on initial combustion stage about the formation and development of flame. In addition, the initial stage of combustion governs overall combustion period in a spark ignition engine. With the increase of the size of flame kernel, it could reach initial flame stage easily, and the mixture could proceed to the combustion of stabilized state. Therefore, we must study the theoretical calculation of minimum flame kernel radius which effects on the formation and development of kernel. To calculate the minimum flame kernel radius, we must know the thermal conductivity, flame temperature, laminar burning velocity and etc. The thermal conductivity is derived from the molecular kinetic theory, the flame temperature from the chemical reaction equations and the laminar burning velocity from the D.K.Kuehl's formula. In order to estimate the correctness of the theoretically calculated minimum flame kernel radius, the researcheres compared it with the RMaly's experimental values.

• Journal of Advanced Marine Engineering and Technology
• /
• 제27권3호
• /
• pp.388-394
• /
• 2003

Hydraulic system is difficult to obtain a suitable performance due to the nonlinearity load pressure change and system parameter variation. The requirement of control a1gorithm has been complex in order to satisfy the performance. The adaptive control is a control method which is suggested to achieve the control object under the plant characteristics change. In spite of the case that plant characteristics and the degree of variation are difficult to grasp. the adaptive control could keep the characteristics of closed-loop system generally. In this study. a method of combined generalized minimum variance adaptive control (GMVAC) and output error feedback is proposed, in order to solve the problem of non-minimum phase of plant and the vibration and overshoot in initial response. The control performance according to the variation of characteristics of plant is evaluated by changing the supply pressure. The experimental results show the effectiveness of the proposed scheme.

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

This work proposes an optimality criteria applicable to the optimum design of plane frames. Stress constraints as well as displacement constraints are treated as behavioural constraints and thus the first order approximation of stress constraints is adopted. The design space of practical reinforced concrete frames with discrete design variables has been found to have many local minima, and thus it is desirable to find in advance the mathematical minimum, hopefully global, prior to starting to search a practical optimum design. By using the mathematical minimum as a trial design of any search algorithm, we may not full into a local minimum but apparently costly design. Therefore this work aims at establishing a mathematically rigorous method ⑴ by adopting first-order approximation of constraints, ⑵ by reducing the design space whenever minimum size restrictions become "active" and ⑶ by the of Newton-Raphson Method.

• 한국정밀공학회지
• /
• 제15권11호
• /
• pp.130-136
• /
• 1998

This paper develops an efficient algorithm for the minimum distance calculation between two general polyhedra(convex and/or concave) in three-dimensional space. The polyhedra approximate objects using flat polygons which composed of more than three vertices. The algorithm developed in this paper basically computes minimum distance between two polygons(one polygon per object) and finds a set of two polygons which makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that the minimum distance computing time is rapidly increased with the number of polygons which used to approximate an object. This paper develops a method to eliminate sets of two polygons which have no possibility of minimum distance occurrence, and an efficient algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. The correctness of the algorithm is verified not only comparing analytically calculated exact minimum distance with one calculated using the developed algorithm but also watching a line which connects two points making a global minimum distance of a convex object and/or a concave object. The algorithm efficiently finds minimum distance between two convex objects made of 224 polygons respectively with a computation time of about 0.1 second.

• ALGAE
• /
• 제17권1호
• /
• pp.21-31
• /
• 2002

Five species of Hypoglossum from the coasts of Korea were described. They were distinguished each other by vegetative morphology as well as reproductive structures. H. barbatum Okamura and H. simulans Wynne, Price et Ballantine were similar in their subalternate branchings but they were clearly different by developmental mode of 3rd-order cell rows. H. simulans is distinguished from H. barbatum as well as from the other three species in that only innermost cells of 2nd-order rows cut off 3rd-order cell rows. H. geminatum Okamura and H. caloglossoides Wynne et Kraft are oppositely branched but the latter is characterized by regular constrictions at branching points. H. minimum Yamada developed simple blades. Among them, H. simulans, H. caloglossoides, and H. minimum are newly recorded from Korean waters.

• 한국음향학회지
• /
• 제35권1호
• /
• pp.49-54
• /
• 2016

본 논문에서는 커널 백피팅 알고리즘에 가중 ${\beta}$-지수승 최소평균제곱오차 추정방식(weighted ${\beta}$-order minimum mean square error: WbE)을 적용한 보컬음 분리 방식에 대해 제안한다. 음성 향상 방식에서, WbE는 진폭 성분 기반 MMSE(Minimum Mean Square Error) 추정방식, 로그 스펙트럼 진폭 기반 MMSE 추정방식 등과 같은 기존의 베이지안(Bayesian) 기반의 추정방식들 보다 객관적 및 주관적 측면에서 모두 보다 높은 성능을 나타내는 방식으로 잘 알려져 있다. 이에 본 논문에서는 기본적인 반복적 커널 백피팅 알고리즘에 WbE를 적용하여 음악 신호에서의 보컬음 분리 성능을 향상시키고자 하였다. 실험결과는 본 논문에서 제안한 방식이 기존의 분리 방식보다 분리 성능이 더 뛰어나다는 것을 보인다.

• 대한안전경영과학회지
• /
• 제9권5호
• /
• pp.111-116
• /
• 2007

The objective of this paper is to calculate the minimum scale of management for transportation business in order to achieve a form of enterprise. In this study the tracking minimum scale of business is the minimum number of operating trucks. Transportation companies should ensure the number of trucks for a type of business model rather than a means of livelihood model. The method to calculate the minimum number of trucks for the transportation business model can use an approach of either the qualitative and the quantitative technique. This study chooses the quantitative technique to calculate the minimum number of trucks through the analysis of break-even point.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1997년도 한국자동제어학술회의논문집; 한국전력공사 서울연수원; 17-18 Oct. 1997
• /
• pp.1876-1879
• /
• 1997

This paper developes an efficient algorithm for the minimum distance calculation between general polyhedra(convex and/or concave). The polyhedron approximates and object using flat polygons which composed of more than three veritices. The algorithm developed in this paper basically computes minimun distance betwen two convex polygons and finds a set of polygons whcih makes a global minimum distance. The advantage of the algorithm is that the global minimum distance can be computed in any cases. But the big disadvantage is that minimum distance computing time is repidly increased with the number of polygons which used to approximate an object. This paper developes a method to eliminate unnecessary sets of polygons, and an efficinet algorithm to compute a minimum distance between two polygons in order to compensate the inherent disadvantage of the algorithm. It takes only a few times iteration to find minimum distance for msot polygons. The correctness of the algortihm are visually tested with a line which connects two points making a global minimum distance of simple convex object(box) and concave object(pipe). The algorithm can find minimum distance between two convex objects made of about 200 polygons respectively less than a second computing time.

• 한국농공학회지
• /
• 제21권4호
• /
• pp.108-117
• /
• 1979

In order to obtain the basic data for design of water structures which can be contributed to the planning of water use. Best fitted distribution function and the equations for the probable minimum flow were derived to the annual minimum flow of five subwatersheds along Geum River basin. The result were analyzed and summarized as follows. 1. Type III extremal distribution was considered as a best fit one among some other distributions such as exponential and two parameter lognormal distribution by $x^2$-goodness of fit test. 2. The minimum flow are analyzed by Type III extremal distribution which contains a shape parameter $\lambda$, a location parameter ${\beta}$ and a minimum drought $\gamma$. If a minimum drought $\gamma=0$, equations for the probable minimum flow, $D_T$, were derived as $D_T={\beta}e^{\lambda}1^{y'}$, with two parameters and as $D_T=\gamma+(\^{\beta}-\gamma)e^{{\lambda}y'}$ with three parameters in case of a minimum drought ${\gamma}>0$ respectively. 3. Probable minimum flow following the return periods for each stations were also obtained by above mentioned equations. Frequency curves for each station are drawn in the text. 4. Mathematical equation with three parameters is more suitable one than that of two parameters if much difference exist between the maximum and the minimum value among observed data.