• Korean Journal of Comparative Education
• /
• v.22 no.4
• /
• pp.75-98
• /
• 2012

This study aims to investigate and compare with each other the global scholarship policy of Korea, China, and Japan, which is supported by government, and to suggest the improvement plan of the Global Korea Scholarship(GKS) program in Korea. Based on the results of comparison study with Chinese and Japanese policies, the implications for GKS program are as follows. First, GKS program needs to be redesigned according to the boundaries of in-bound and out-bound countries. Especially, the GKS program for 'neighboring countries' focusing on East Asian countries, could be developed as the Union of East Asian Nations. Second, to maximize the performance of GKS, the government needs to cooperate more actively and systematically among related departments through all the steps as a national foreign policy, that is, from establishing goals to evaluating performance. Third, the perspectives on GKS must be expanded, not just as a kind of scholarship, but as a policy for developing Korean culture and language. Fourth, out-bound GKS programs must be greatly expanded in relation to short-term programs as well as the quality of in-bound GKS programs. Finally, out-bound GKS programs for the Asian developing countries need to be redesigned and operated under the focus of ODA, to support the invited Parties beyond the foreign resource policy.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.19 no.1
• /
• pp.111-116
• /
• 2019

Recently, GPU expands application domains from graphic processing to various kinds of parallel workloads. However, current GPU systems focus on the maximization of each workload's parallelism through simplified control rather than considering various workload characteristics. This paper classifies the resource usage characteristics of GPU workloads into computing-bound, memory-bound, and dependency-latency-bound, and quantifies the fine-grained bottleneck for efficient workload allocation. For example, we identify the exact bottleneck resources such as single function unit, double function unit, or special function unit even for the same computing-bound workloads. Our analysis implies that workloads can be allocated together if fine-grained bottleneck resources are different even for the same computing-bound workloads, which can eventually contribute to efficient workload allocation in GPU.

• Geomechanics and Engineering
• /
• v.31 no.5
• /
• pp.519-527
• /
• 2022

Shear failure in soil is the primary cause of most geotechnical structure failures or instability. Soil water content is a significant factor affecting soil shear strength. In this study, the shear strength of samples with different water contents was tested. The shear strength, cohesion, and internal friction angle decreased with increasing water content. Based on the variation of cohesion and internal friction angle, the water content zone was divided into a high-water content zone and low-water content zone with a threshold water content of 15.05%. Cohesion and internal friction angle have a good linear relationship with water content in both zones. Environmental Scanning Electron Microscopy (ESEM) test presented that the aggregates size of the compacted loess gradually increases with increasing water content. Meanwhile, the clay in the compacted loess forms a matric that envelops around the surface of the aggregates and fills the inter-aggregates pores. A quantitative analysis of bound water and free water under different water contents using a nuclear magnetic resonance (NMR) test was carried out. The threshold water content between bound water and free water was slightly below the plastic limit, which is consistent with the results of shear strength parameters. Combined with the T2 distributions obtained by NMR, one can define a T2 relaxation time of 1.58 ms as the boundary point for bound water distribution without free water. Finally, the effects of bound water and free water on shear strength parameters were analyzed using linear regression analysis.

• Archives of Pharmacal Research
• /
• v.15 no.3
• /
• pp.215-219
• /
• 1992

S. fradiae exhibited the highest acetanilide p-hydroxylation activity among the Streptomyces spp. screened. Studies with inhibitors (metyrapone, 2. 6-dichloroindophenol, $\alpha,\alpha'$-dipyridyl, o-phenanthroline) and an absorption peak after CO treatment suggested that S. fradiae hydroxylase activity was due to cytochrome p-450. This hydroxylase activity was increased to ten times in the cell extract containing 0.5 mM sodium azide. Furthermore, the sedimentary activity in $105,000\times{g}$ centrifugal forces and solubilization of the activity with Triton-X 100 implied that this enzyme was membrane bound monooxygenase. pH Optimum of the enzyme was 6.5 in membrane bound state.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.6
• /
• pp.960-967
• /
• 2008

This paper shows that design of a robustly stable repetitive control system is equivalent to that of a feedback control system for an uncertain linear time-invariant system satisfying the well-known robust performance condition. Once a feedback controller is designed to satisfy the robust performance condition, the feedback controller and the repetitive controller using the performance weighting function robustly stabilizes the repetitive control system. It is also shown that we can obtain a steady-state tracking error described in a simple form without time-delay element if the robust stability condition is satisfied for the repetitive control system. Moreover, using this result, a sufficient condition is provided, which ensures that the least upper bound of the steady-state tracking error generated by the repetitive control system is less than or equal to the least upper bound of the steady-state tracking error only by the feedback system.

• Journal of the Korean Institute of Navigation
• /
• v.11 no.2
• /
• pp.33-52
• /
• 1987

The disasters of wet bound vessels have been more frequent than those of east bound ones on the sea routes of the North Pacific Ocean in winter season. M/V Hanjin-Inchon was also west bound in her missing voyage. The container vessel of 17, 676 gross tons, M/V Hanjin-Inchon owned by Hanjin Shipping Co.Ltd in Seoul Korea left seattle in west coast of U.S.A for Pusan , Korea on the 5th Feb., 1987 and sailed along the exact courses recommended by Ocean Routes until she reported her position and speed as 49-30N, 158-00E and 8 knots to her head office in Seoul by this ship's time 2200 hours on the 13th Feb., 1987. The above message turned out to be last message from her because she had been missing since then leaving no message but only two life boats of her name, three containers cases, large scale of oil slicks and the corpse of her 3rd mate drifting on the sea near the position reported by her last message.

• Korean Journal of Computational Design and Engineering
• /
• v.15 no.2
• /
• pp.115-123
• /
• 2010

We present an efficient algorithm for computing the Hausdorff distance between two planar curves. The algorithm is based on an efficient trimming technique that eliminates the curve domains that make no contribution to the final Hausdorff distance. The input curves are first approximated with biarcs within a given error bound in a pre-processing step. Using the biarc approximation, the distance map of an input curve is then approximated and stored into the graphics hardware depth-buffer by rendering the distance maps (represented as circular cones) of the biarcs. We repeat the same procedure for the other input curve. By sampling points on each input curve and reading the distance from the other curve (stored in the hardware depth-buffer), we can easily estimate a lower bound of the Hausdorff distance. Based on the lower bound, the algorithm eliminates redundant curve segments where the exact Hausdorff distance can never be obtained. Finally, we employ a multivariate equation solver to compute the Hausdorff distance efficiently using the remaining curve segments only.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.636-638
• /
• 1998

WDM망을 구성하는데 있어서 광학적 파장은 가장 중요한 자원의 하나이다. 그러나 주어진 통신 요구를 모두 수용하면서 동시에 최소한의 파장만을 사용하는 WDM망의 설계 문제는 이미 NP-complete 계열의 문제인 것으로 밝혀졌으며 많은 휴리스틱 알고리즘들이 제안되었다. 본 논문에서는 임의의 물리적 망 위상(topology)과 완전 연결(full connection)형태의 통신 요구가 주어질 경우, 요구되는 파장 경로(Wavelength Path, lightpath)를 확립하기 위한 방법으로써 각 노드 사이의 최단 거리 경로를 기반으로 하여 탐색 공간을 만들고 구성된 탐색 공간 내에서 Branch-and-bound 탐색방식을 수행하는 파장 경로 설정 알고리즘을 제안한다. Branch-and-bound탐색방식은 초기에 좋은 bound조건을 가질 경우 주어진 시간 안에 보다 넓은 탐색 공간을 검색할 수 있으므로 최초의 탐색에서 가능한 좋은 성능의 파장 경로 설정을 발견할 수 있어야한다. 시뮬레이션 실험을 통하여 최초의 탐색에서 발견한 파장 경로 설정과 구성된 탐색 공간내의 최적해를 얻고, cut-set를이용하여 요구 파장 개수의 하위 한계값을 계산한후, 이를 상호 비교하여 제안된 알고리즘의 성능을 평가한다.

• ETRI Journal
• /
• v.31 no.5
• /
• pp.518-524
• /
• 2009

Single parity check (SPC) product codes are simple yet powerful codes that are used to correct errors and/or recover erasures. The focus of this paper is to evaluate the performance of such codes under erasure scenarios and to develop a closed-form tight upper bound for the post-decoding erasure rate. Closed-form exact expressions are derived for up to seven erasures. Previously published closed-form bounds assumed that all unrecoverable patterns should contain four erasures in a square. Additional non-square patterns are accounted for in the proposed expressions. The derived expressions are verified using exhaustive search. Eight or more erasures are accounted for by using a bound. The developed expressions improve the evaluation of the recoverability of SPC product codes without the need for simulation or search algorithms, whether exhaustive or novel.

• International Journal of Control, Automation, and Systems
• /
• v.6 no.5
• /
• pp.776-784
• /
• 2008

In this paper, new upper matrix bounds for the solution of the continuous algebraic Riccati equation (CARE) are derived. Following the derivation of each bound, iterative algorithms are developed for obtaining sharper solution estimates. These bounds improve the restriction of the results proposed in a previous paper, and are more general. The proposed bounds are always calculated if the stabilizing solution of the CARE exists. Finally, numerical examples are given to demonstrate the effectiveness of the present schemes.