• Journal of the Korean Statistical Society
• /
• v.22 no.1
• /
• pp.71-81
• /
• 1993

Among k independent normal populations with unknown means and a common unknown variance, the problem of detecting the population with the largest absolute value of mean is considered. This problem is formulated in a manner close to the framework of testing hypotheses, and the maximum error probability and the minimum power are considered. The power charts necessary to determine the sample size are provided. The problem of detecting the population with the smallest absolute value of mean is also considered.

• Korean Journal of Air-Conditioning and Refrigeration Engineering
• /
• v.2 no.4
• /
• pp.288-294
• /
• 1990

A study has been conducted experimentally on heat transfer characteristics of louvered fin heat exchangers with various fin spacings in air. The experimental results are as follows; 1. Mean heat transfer coefficient is increased with increasing air velocity and the optimum fin spacing shows at S=5mm. 2. Pressure drop is increased with increasing air velocity and its maximum value shows at S=3.5mm and its minimum value shows at S=6mm. 3. $\bar{h}/{\Delta}P$ is decreased with increasing air velocity and its maximum value shows at S=5mm and its minimum value shows at S=3.5mm.

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

• Journal of Korean Society of Transportation
• /
• v.13 no.3
• /
• pp.53-65
• /
• 1995

Proposed are model and its solution algorithm for determining the minimum number of high speed exits and their locations. While the previous researches on exit location aimed to minimize the average runway occuancy time (ROT) of an aircraft mix, the proposed approach is to find the minimum number of exits required to meet maximum allowable ROT. The rationale behind the approach is that the capacity of a runway increases as the ROT decreases down to some value, but not any more even though the ROT keep decreasing below the value. Hence, a maximum allowable ROT might be set up without declining the capacity. The problem is transformed into a shortest path problem on a specially constructed network and Dijkstra's labeling algorithms is employed to solve the problem A hypothetical example is provided to illustrate how the algorithms solves the problem.

• Tribology and Lubricants
• /
• v.12 no.3
• /
• pp.63-71
• /
• 1996

The connecting rod bearing, which is subjected to periodical dynamic loading, is an impoRant component of the reciprocating engine. In the operation of this bearing, significant parameters are the oil film thickness and the film pressure. Peak film pressures of 20-30 MPa are not uncommon. So the elastic deformation of the bearing housing can have a significant effect on the bearing performance. In this study, a numerical analysis of connecting rod bearing is investigated. Elastic deformation of the bearing housing is considered in the analysis. Separate hydrodynamic and structural analysis are coupled through a direct iterative process. It is shown that as the result of the elastic deformation of the bearing housing, the eccentricity ratio is increased, and the minimum value of the minimum film thickness and the maximum value of the maximum film pressure are decreased. The variations of rotational speed and cylinder pressure affect the minimum film thickness and the maximum film pressure variations of the connecting rod bearing.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.1
• /
• pp.105-114
• /
• 1997

The phase retrieval problem is concerned with the reconstruction of a signal or its fourier transform phase form the fourier transform magnitude of the signal. This problem does not have a unique solution, in general. If, however, the desired signal is minimum-phase, then it can be decided uniquely. This paper shows that we can make a minimum-phase signal by adding a delta function having a large value at the origin of an arbitrary one-dimensional signal, and a two-dimensional signal can be uniquely specified from its fourier transform magnitude if it is added by a delta function having a large value at the origin, and finally we can solve a two-dimensional phase retrieval problem by decomposing it into several ine-dimensional phase retrieval problems.

• Bulletin of the Korean Mathematical Society
• /
• v.56 no.1
• /
• pp.111-130
• /
• 2019

The concepts of pseudocodeword and pseudoweight play a fundamental role in the finite-length analysis of LDPC codes. The pseudoredundancy of a binary linear code is defined as the minimum number of rows in a parity-check matrix such that the corresponding minimum pseudoweight equals its minimum Hamming distance. By using the value assignment of Chen and Kløve we present new results on the pseudocodeword redundancy of binary linear codes. In particular, we give several upper bounds on the pseudoredundancies of certain codes with repeated and added coordinates and of certain shortened subcodes. We also investigate several kinds of k-dimensional binary codes and compute their exact pseudocodeword redundancy.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2009.11a
• /
• pp.295-296
• /
• 2009

본 논문은 기존 PSO의 문제점으로 지적되는 Local minimum에의 고착을 해결하여 평균적인 성능을 향상시킬 수 있는 방법을 제안한다. 이를 위해 기존에는 하나의 Best Value만을 향해서 이동하는 것에서 벗어나, 각 Particle들을 Cluster로 나누고 각각의 Best Value를 중심으로 이동하며, 각 Cluster Leader들은 다른 Cluster Leader와 통신하며 순위에 따라 이동한다. 제안 방법으로 수렴속도와 Local minimum 회피에 대해 실험을 통해 비교 분석한다. 실험 결과로부터 제안 방법이 Local minimum 회피에서 성능 향상이 있음을 고찰하였다.

• Tribology and Lubricants
• /
• v.16 no.2
• /
• pp.114-120
• /
• 2000

This paper reports on the theoretical analysis on the lubrication characteristics between the piston ring and the grooved cylinder liner. The circular shape piston ring and two types grooves are consider, and the minimum oil film thickness during the full engine cycle are obtained by using iterative technique. The comparative results of minimum oil film thickness and viscous friction force between the smooth and grooved liner are presented. And various design parameter of piston ring and liner groove are tested. The groove in the liner generally reduces the minimum value of minimum oil film thickness, but the maximum viscous friction force is increased at the minimum film position.

• Journal of the Korea Safety Management & Science
• /
• v.11 no.4
• /
• pp.213-220
• /
• 2009

The minimum latency problem, also known as the traveling repairman problem and the deliveryman problem is to minimize the overall waiting times of customers, not to minimize their routing times. In this research, a genetic algorithm, a clonal selection algorithm and a population management genetic algorithm are introduced. The computational experiment shows the objective value of the clonal selection algorithm is the best among the three algorithms and the calculating time of the population management genetic algorithm is the best among the three algorithms.