• Journal of the Korean Statistical Society
• /
• v.25 no.2
• /
• pp.277-288
• /
• 1996

The minimum aberration criterion is commonly used for selecting good fractional factorial designs. In this paper we give same necessary conditions for $3^{n-k}$ fractional factorial designs. We obtain minimum aberration $3^{n-k}$ designs for k = 2 and any n. For k > 2, minimum aberration designs have not found yet. As an alternative, we select a design with minimum aberration among minimum-variance designs.

• Korean Institute of Interior Design Journal
• /
• v.26 no.4
• /
• pp.3-11
• /
• 2017

The appropriate area for human's most basic living space is an important factor. Therefore, the 'minimum housing standard' is a very important factor to ensure a minimum quality of living space for human life. In Korea, however, the importance of the 'minimum housing standard' has been neglected for about 20 years. Even in Korea, the 'minimum housing standard' has become an nominal existence. In other countries, studies have long been conducted on the minimum housing standards, but studies have shown that studies on the minimum housing standard are not actively occurring in Korea. The purpose of this study is to diagnose the current status of the 'minimum housing standard' in Korea and to explore the direction of future research. The study included a total of 29 researches commissioned by the Korea Academic Research Institute (KCI). To ensure the objectivity and reliability of the analysis, analyzed year of research, field of research, method of research, contents of research. Through this study, it is possible to grasp the tendency of previous studies on 'minimum housing standard' in Korea and it is meaningful to increase the usability of 'minimum housing standard' in residential planning. It is also expected that future research on 'minimum housing standards' will be able to present the direction of the field to be developed.

• Journal of the Korean Society for Precision Engineering
• /
• v.15 no.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.

• Proceedings of the KSRS Conference
• /
• 2000.04a
• /
• pp.96-101
• /
• 2000

SAR(Synthetic Aperture Radar) interferometry 기술은 co-registration, 정밀궤도 계산, phase unwrapping, 지형보정과 같은 기술로 구성되어있다. 구속화된 위상값을 절대 위상값으로 변환하는 과정인 phase unwrapping 기술은 정밀지형고도를 얻는데 있어서 핵심기술이다. 본 연구에서는 JERS-1 SAR 영상으로부터 interferogram을 구하고, 이로부터 추출된 위상정보를 이용하여 branch cut(Goldstein et. al, 1988), minimum discontinuity(Flynn, 1997) 그리고 minimum $L^p$-norm(Ghiglia and Romero, 1996)방법 적용결과에 대한 비교 분석을 실시하였다. Goldstein 알고리즘은 수행속동가 매우 빠르지만 residue를 연결한 branch cut에 의해 분활된 영역 내에서, 서로 다른 적분 경로로 인해 위상이 단절되었다. 영상내의 모든 화소에서 절대 위상을 구한 minimum discontinuity와 minimum $L^p$-norm 알고리즘 수행 결과는 상관관계가 0.995로 매우 유사하였는데, 가중된 불연속선의 합을 최소화하는 minimum discontinuity 알고리즘이 minimum $L^p$-norm에 비해 영상 일부 지역에서 발생하는 위상 오차를 전파시키지 않는다는 장점이 있다. Minimum $L^p$-norm 방법은 다른 두 방법과 달리 위상정보 내에 많은 잡음이 있더라도 적절한 해를 구할 수 있다는 장점이 있다. 각 방법은 대상 자료의 특성에 따라 효율성이 있으나 Flynn의 알고리즘이 지역적 특성과 무관하게 가장 효과적임을 알 수 있었다.

• Journal of the Korea Society of Computer and Information
• /
• v.19 no.1
• /
• pp.57-64
• /
• 2014

As Steiner minimum tree building belongs to NP-Complete problem domain, heuristics for the problem ask for immense amount execution time and computations in numerous inputs. In this paper, we propose an efficient mechanism of euclidean Steiner minimum tree construction for numerous inputs using combination of Delaunay triangulation and Prim's minimum spanning tree algorithm. Trees built by proposed mechanism are compared respectively with the Prim's minimum spanning tree and minimums spanning tree based Steiner minimum tree. For 30,000 input nodes, Steiner minimum tree by proposed mechanism shows about 2.1% tree length less and 138.2% execution time more than minimum spanning tree, and does about 0.013% tree length less and 18.9% execution time less than minimum spanning tree based Steiner minimum tree in experimental results. Therefore the proposed mechanism can work moderately well to many useful applications where execution time is not critical but reduction of tree length is a key factor.

• Journal of Labour Economics
• /
• v.41 no.4
• /
• pp.107-131
• /
• 2018

This paper presents a model for the Minimum Wage Commission's decision process and analyzes the strategic actions of the participants in the process. The Minimum Wage Commission has used two ways of setting the minimum wage. The commission has voted either on the labor's against the management' final proposals or has voted on the public interest commissioners' proposal. According to the model, the minimum wage is determined at a level that is very close to or at a level preferred by the median voter among the public interest commissioners. But the probability of adopting labor or management proposal is ex-ante the same. Empirical evidence from the minimum wage decision process is consistent with the predictions of the model. The probability of adopting the labor's proposal in the minimum wage commission voting is not statistically significantly different from 50%. The model also suggests that the preference of the median voter among public interest commissioners determines the minimum wage level. Since the government appoints public interest commissioners and thus, in fact, the median voters, the government can decide the minimum wage level. This proposition is also consistent with data. The annual growth rate of the minimum wage under the progressive governments is higher than under conservative governments.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• 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.

• Magazine of the Korean Society of Agricultural Engineers
• /
• v.21 no.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.

• Kyungpook Mathematical Journal
• /
• v.57 no.4
• /
• pp.701-709
• /
• 2017

In this paper, we introduce the minimum covering Randic energy of a graph. We compute minimum covering Randic energy of some standard graphs and establish upper and lower bounds for this energy. Also we disprove a conjecture on Randic energy which is proposed by S. Alikhani and N. Ghanbari, [2].

• Proceedings of the Korea Concrete Institute Conference
• /
• 2004.05a
• /
• pp.248-251
• /
• 2004

This study was performed to propose the minimum thickness of RC slab that satisfies constructibility, fatigue safety, and serviceability requirements such as deflection control. Three different minimum thicknesses are calculated using concrete shear and rebar fatigue formulas, and deflection control, respectively, and checked by constructiblity. The maximum of these three minimum thicknesses is proposed as the minimum thickness of RC slab, which shows that the minimum thickness requirement of RC slab from Korean Bridge Design Code can be thinner than now.