• 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.

• 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.

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

• Industrial Engineering and Management Systems
• /
• v.12 no.1
• /
• pp.9-15
• /
• 2013

An inverse minimum spanning tree problem makes the least modification on the edge weights such that a predetermined spanning tree is a minimum spanning tree with respect to the new edge weights. In this paper, the concept of uncertain ${\alpha}$-minimum spanning tree is initiated for minimum spanning tree problem with uncertain edge weights. Using different decision criteria, two uncertain programming models are presented to formulate a specific inverse minimum spanning tree problem with uncertain edge weights involving a sum-type model and a minimax-type model. By means of the operational law of independent uncertain variables, the two uncertain programming models are transformed to their equivalent deterministic models which can be solved by classic optimization methods. Finally, some numerical examples on a traffic network reconstruction problem are put forward to illustrate the effectiveness of the proposed models.

• 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].

• Communications for Statistical Applications and Methods
• /
• v.16 no.6
• /
• pp.989-995
• /
• 2009

Basu et al. (1998) proposed the minimum divergence estimating method which is free from using the painful kernel density estimator. Their proposed class of density power divergences is indexed by a single parameter $\alpha$ which controls the trade-off between robustness and efficiency. In this article, (1) we introduce a new large class the minimum squared distance which includes from the minimum Hellinger distance to the minimum $L_2$ distance. We also show that under certain conditions both the minimum density power divergence estimator(MDPDE) and the minimum squared distance estimator(MSDE) are asymptotically equivalent and (2) in finite samples the MDPDE performs better than the MSDE in general but there are some cases where the MSDE performs better than the MDPDE when estimating a location parameter or a proportion of mixed distributions.

• 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.

• Computers and Concrete
• /
• v.17 no.5
• /
• pp.673-692
• /
• 2016

In the standards, minimum reinforcement ratios are presented as the least reinforcement ratios that bearing elements should have in a way to include all systems and in general. However, naturally these general minimum ratios might be presented as being lower than the normally required reinforcement ratios by criteria such as system size, bearing system arrangement, section situation and distributions of the elements and earthquake effect. In this case, minimum reinforcement ratios may remain as meaningless restrictions. Then grouping the criterion that might affect reinforcement ratios according to certain parameters and creating minimum reinforcement ratios regarding preliminary design will provide ease and safety during the project designing. Moreover, it will enable fast and simple examinations in the beginning of project control and evaluation process. By means of the data which could be defined as "preliminary design & minimum reinforcement ratios", a more realistic and safe restriction compared to general minimum reinforcement ratios could be presented. As a result of numerous comprehensive studies, reinforcement ratios to include all certain systems might be obtained. Today, thanks to the development level of finite elements programs which can make reinforced concrete modelling, with the studies that are impossible to carry out beforehand, this deficiency in the minimum reinforcement ratios in the standarts may at least be partially made up with the advisory regulation of preliminary design & minimum reinforcement ratios. As the structure of the system to be examined and the diversity of the parameters range from the specific to the general, preliminary design & minimum reinforcement ratios will approximate to general minimum reinforcement ratios in real terms. By focusing on a more specific system structure and diversity of the parameters, preliminary design and even design reinforcement ratios will be approximated. In this preliminary study, a route between these two extremes was attempted to be followed. Today, it is possible to determine suggested practical ratios for project designs through carrying out numerous studies.

• Journal of the Korean Society for Precision Engineering
• /
• v.17 no.7
• /
• pp.156-161
• /
• 2000

Least Squares and Minimum Zone method are known for obtaining a datum or a continuous approximate function of measured data. This study is for a Minimum Zone algorithm for a circle, which is useful to obtain the exact roundness from the reference circle of measured data. The proposed method is compared with the Least Squares Limacon method and Chrystal-Peirce algorithm. A computational algorithm for the Minimum Zone circle is suggested and results in less roundness than the other two methods. This Minimum Zone circle method will be used for other geometrical measured data, such as plane or sphere for obtaining the exact flatness or sphericity.