• Journal of Korean Institute of Industrial Engineers
• /
• v.1 no.1
• /
• pp.67-71
• /
• 1975

This paper studies the efficiency of four algorithms in determining the shortest-route length between two specified nodes of a network in which every pair of nodes is connected by two nonnegative length arcs. The efficiency is measured in terms of number of additions and comparisons in computation of the shortest-route length. Also, each algorithm is programmed on the IBM 1130 for solving for example problems, and the computing time is measured for further efficiency comparisons.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.12C
• /
• pp.1129-1134
• /
• 2006

In this paper, we analyze the cycle structure of punctured finite-length RA-type LDPC codes and design interleavers which have good memory efficiency and avoid short cycles. Furthermore, we introduce the check-node merging scheme for punctured finite-length RA-type LDPC codes and design simple interleavers. Simulation results show that punctured finite-length RA-type LDPC codes using the proposed simple interleavers have better performance than those with random and S-random interleavers.

• KIEE International Transaction on Electrical Machinery and Energy Conversion Systems
• /
• v.12B no.1
• /
• pp.7-12
• /
• 2002

This paper presents a method to estimate an effective length of a 1000-kVA superconducting generator using three-dimensional FE analysis. Flux linkage of stator coil and the induced voltage are calculated with FEM program and Faraday's law. An effective length of the stator coil is estimated using the calculated voltage and geometric configurationn of the machine. In order to verify the estimation method, 30-kVA superconducting generator is built and tested. The test result agrees reasonably well with the estimation.

• Journal of the Korean Data and Information Science Society
• /
• v.22 no.3
• /
• pp.549-553
• /
• 2011

In this paper, we deal with the problem of deciding the length of data for estimating the parameters in geometric Brownian motion. As an approach to this problem, we consider the change point test and introduce simple test statistic based on the cumulative sum of squares test (cusum test). A real data analysis is performed for illustration.

• Proceedings of the IEEK Conference
• /
• 1999.11a
• /
• pp.79-82
• /
• 1999

In this paper, it was studied that the performance of OFDM transmission scheme was improved in fading channel by applying TCM, which has advantages of error correction and bandwidth efficiency. Simulation was carried out for two TCM models with different code efficient length. By mapping two models to square 16QAM, the model with the code efficient length of 2 achieved 3㏈ better than the other for the BER of 10$^{-3}$ . In conclusion, if we want to achieve a better performance with TCM in OFDM applications, we should select a TCM with langer code efficient length.

• Proceedings of the KSR Conference
• /
• 2001.10a
• /
• pp.316-321
• /
• 2001

The maximum span length is decided by the relation among the independent factors of rail, train and catenary. However, During the calculation of the maximum span length with the way of Kyung-Bu High railway design using by the commercial program $\ulcorner$MATLAB$\lrcorner$ the mathematical error was founded. Therefore, this paper presents the analysis of the reason why caused the mathematical error occur.

• Journal of Korean Society of Transportation
• /
• v.12 no.4
• /
• pp.21-33
• /
• 1994

The grade is a very significant factor in designing the bikeways. It affects the cyclist's maneuverability as well as route selection. The objective of this paper is to provide the vertical length by grade for bikeway. Field experiments were conducted by primary school children and university students to collect and analyze bike's climbing capability by grade. Combined data suggests that the desirable vertical length is 360m for 3% grade, 220m for 4%, 160m for 5%, 120m for 6% and 90m for 7% grade.

• Journal of the Korean Mathematical Society
• /
• v.44 no.3
• /
• pp.697-706
• /
• 2007

In [8], we showed that any ideal of $\mathbb{Z}_4[X]/(X^{2^n}-1)$ is generated by at most two polynomials of the standard forms. The purpose of this paper is to find a description of the cyclic codes of even length over $\mathbb{Z}_4$ namely the ideals of $\mathbb{Z}_4[X]/(X^l\;-\;1)$, where $l$ is an even integer.

• Journal of the Korean Mathematical Society
• /
• v.43 no.6
• /
• pp.1231-1252
• /
• 2006

In this paper we shall explicitly calculate the formula of the algebraic presentation of an embedding of the Teichmiiller space ${\Im}(M)$ into the Goldman space g(M). From this algebraic presentation, we shall show that the Goldman's length parameter on g(M) is an isometric extension of the Fenchel-Nielsen's length parameter on ${\Im}(M)$.

• Journal of applied mathematics & informatics
• /
• v.24 no.1_2
• /
• pp.505-511
• /
• 2007

In this paper, we examine the Markov chain $\{X_k,\;N_k;\;k=0,\;1,...$. We show that the marginal steady state distribution of Xk is discrete phase type. The implication of this result is that the queue length distribution of phase type for large number of examples where this Markov chain is applicable and shows a queueing application by matrix geometric methods.