• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.10a
• /
• pp.369-372
• /
• 2008

무선 센서 네트워크(WSN)는 소규모, 저비용, 저전력 지능형의 센서 노드로 구성되고, 원격 환경 감시와 군사작전 및 재난 상황 등에 응용 될 수 있는 기술이다. 이러한 센서 네트워크에서 구성된 노드의 에너지 공급은 독립된 소형배터리를 통해 이루어진다. 따라서 각 노드에서의 에너지의 효율적인 관리가 무선 센서 네트워크의 최대 쟁점이 되고 있다. 본 논문에서는 이러한 노드의 제한된 배터리 자원을 보다 효율적으로 유지 관리하기 위한 방법으로 ASIT(Advanced Sensing Interval Time) 알고리즘을 제안한다. 제안된 ASIT란 입력된 센싱 값의 변화와 센서 노드의 에너지 잔여량에 따라 센싱 주기를 제어 관리하는 방법으로 이에 대한 모델링을 수립하고, 실제 노드 관리 결과와 모델링 된 결과의 오차를 관찰하여 적중율을 향상하는 기법을 제안한 것이다. 제안된 ASIT의 알고리즘으로부터 센서 노드의 수명을 향상 시켜 궁극적으로는 무선 센서 네트워크 전체의 망 접속의 신뢰성과 노드 관리 수명을 연장시키며, 망의 토폴로지 구성의 측면에서는 전체적인 영역의 커버리지를 향상시키는 동시에 제한된 배터리 자원을 효율적으로 관리 할 수 있는 걸과를 얻게 된다.

• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.27-34
• /
• 2000

Recently, the use of Geographic Information System in each field of our society is on the increase according to the development of the Internet. But, thereis a problem of the user access latencies, the network traffic, and the server overload in Internet Geographic Information System because spatial data are transferred in large volumes. In this paper, we propose a cache algorithm on client side to solve the above problems. The proposed algorithm demonstrates the performance improvement over known studies by utilizing unit time and spatial proximity. In addition, this paper conducts a performance evaluation to measure the improvement in algorithm efficiency and analyzes the results of the performance evaluation. When spatial data queries are conducted, according to our performance evaluation, hit rate has been improved over the existing algorithms.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.4
• /
• pp.410-419
• /
• 2003

The buffer cache of general operating systems such as Linux manages file data by using global block replacement policy and read ahead. As a result, multimedia data with a low locality of reference and various consumption rate have low cache hit ratio and consume additional buffers because of read ahead. In this paper we have designed and implemented a new buffer allocation algorithm for multimedia data on Linux. Our approach keeps one read-ahead cache per every opened multimedia file and dynamically changes the read-ahead group size based on the buffer consumption rate of the file. This distributes resources fairly and optimizes the buffer consumption. This paper compares the system performance with that of Linux 2.4.17 in terms of buffer consumption and buffer hit ratio.

• The Korean Journal of Applied Statistics
• /
• v.21 no.3
• /
• pp.429-439
• /
• 2008

Canonical correlation biplot is 2-dimensional plot for investigating the relationship between two sets of variables and the relationship between observations and variables in canonical correlation analysis graphically. In general, biplot is useful for giving a graphical description of the data. However, this general biplot and also canonical correlation biplot do not give some concise interpretations between variables and observations when the number of observations are large. Recently, for overcoming this problem, Choi and Kim (2008) suggested a method to interpret the biplot analysis by applying the K-means clustering analysis. Therefore, in this study, we will apply their method for investigating the relationship between skill and competition score factors of KLPGA players using canonical correlation biplot and cluster analysis.

• Korean Journal of Breeding Science
• /
• v.40 no.3
• /
• pp.308-313
• /
• 2008

"Jeokjoong", a white winter wheat (Triticum aestivum L.) variety was developed from the cross "Keumkang"/"Tapdong". "Jeokjoong" is an awned, semi-dwarf and soft white winter wheat, similar to "Keumkang" (check variety). The heading and maturing date of "Jeokjoong" were similar to "Keumkang". Culm and spike length of "Jeokjoong" were 78 cm and 7.5 cm, similar to "Keumkang". "Jeokjoong" had lower test weight (800 g) and lower 1,000-grain weight (40.1 g) than "Keumkang" (811 g and 44.0 g, respectively). It had resistance to winter hardiness, wet-soil tolerance and lodging tolerance. "Jeokjoong" showed moderate to scab in test of specific character although "Keumkang" is susceptible to scab. "Jeokjoong" had lower flour yield (69.2%) and ash content (0.36%) than "Keumkang" (72.0% and 0.41%, respectively) and similar flour color to "Keumkang". It showed lower protein content (8.9%) and SDS-sedimentation volume (36.8 ml) and shorter mixograph mixing time (3.5 min) than "Keumkang" (11.0%, 59.7 ml and 4.5 min, respectively). Amylose content and pasting properties of "Jeokjoong" were similar to "Keumkang". "Jeokjoong" had softer and more elastic texture of cooked noodles than "Keumkang". Average yield of "Jeokjoong" in the regional adaptation yield trial was 6.19 MT ha-1 in upland and 5.33 MT/ha in paddy field, which was 19% and 16% higher than those of "Keumkang" (5.21 MT/ha and 4.58 MT/ha, respectively). "Jeokjoong" would be suitable for the area above the daily minimum temperature of $-10^{\circ}C$ in January in Korean peninsula.

• Journal of the Korean Data and Information Science Society
• /
• v.24 no.3
• /
• pp.543-555
• /
• 2013

This study is to analyze effectiveness of golf skills (driving distance, rating of fairway, green in regulation, sand save ratio, recovery ratio, putting average) to average score using records of PGA, LPGA, KPGA, KLPGA. Independent variables were driving distance, rating of fairway, green in regulation, sand save ratio or recovery ratio, putting average. Dependent variable was the scoring average in this study. To analyze these variables, multi-group (PGA vs LPGA, KPGA vs KLPGA, PGA vs KPGA, LPGA vs KLPGA) path analysis was used through AMOS 18.0 program and significance level was set at 0.05. As the result, the variables that show significant differences of path coefficient between PGA model and LPGA model were driving distance and green in regulation to average score. The variables that show significant differences of path coefficient between KPGA model and KLPGA model were driving distance, recovery ratio, and putting average to average score. The variables that show significant differences of path coefficient between PGA model and KPGA model were driving distance, recovery ratio, and putting average to average score. There was not significant difference of path coefficient between LPGA model and KLPGA model.

• Journal of Biosystems Engineering
• /
• v.24 no.6
• /
• pp.539-546
• /
• 1999

Some stress for a plant could be detected to a certain degree by plant physiological measuring technique of the state of the art. The capability of early detection of my measuring system depends on kind of plant and kind and level of stress. The objectives of this study were to evaluate the capability of several fast and intact type plant stress detection systems to detect nitrogen deficiency of cucumber in the field. A series of experiment was carried out with four kinds of intact type measuring devices - a chlorophyll content meter, a chlorophyll fluorescence measurement system, an infrared thermometer and an optical spectrometer. The experiments resulted that the chlorophyll content meter could detect the stress of N deficiency at a confidence level higher than 95% on 3rd day for the earliest case and the detection of high precision was possible from 7th day after the stress was applied. The chlorophyll fluorescence measurement system detected the stress at a confidence level higher than 95% on 3rd day for the earliest case but the detection was not as much precise as the chlorophyll content meter. Leaf temperature measurement noted very poor results to detect the stress. Using the spectrometer, sensitive wavelength regions to detect the stress were searched and found out as 562∼564 nm, 700∼724 nm and 1,886∼1,894 nm. With the spectrometer using any of wavelength within the sensitive wavelength region, detection of the stress at a confidence level higher than 95% was possible from 3rd or 4th day after the stress was applied.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2002.11a
• /
• pp.535-542
• /
• 2002

최근 IT 산업이 급성장하면서 화상 회의, 게임, 채팅 등에서의 아바타(avatar) 제어를 위한 자연스러운 인터페이스 기술이 요구되고 있다. 본 논문에서는 동적 윤곽선 모델(active contour models; snakes)을 이용하여 복잡한 배경이 있는 컬러 CCD 카메라 영상에서 얼굴과 눈, 입, 눈썹, 코 등의 얼굴 요소에 대해 윤곽선을 추출하거나 위치를 파악하는 방법을 제안한다. 일반적으로 스네이크 알고리즘은 잡음에 민감하고 초기 모델을 어떻게 설정하는가에 따라 추출 성능이 크게 좌우되기 때문에 주로 단순한 배경의 영상에서 정면 얼굴의 추출에 사용되어왔다 본 연구에서는 이러한 단점을 파악하기 위해, 먼저 YIQ 색상 모델의 I 성분을 이용한 색상 정보와 차 영상 정보를 사용하여 얼굴의 최소 포함 사각형(minimum enclosing rectangle; MER)을 찾고, 이 얼굴 영역 내에서 기하학적인 위치 정보와 에지 정보를 이용하여 눈, 입, 눈썹, 코의 MER을 설정한다. 그런 다음, 각 요소의 MER 내에서 1차 미분과 2차 미분에 근거한 내부 에너지와 에지에 기반한 영상 에너지를 이용한 스네이크 알고리즘을 적용한다. 이때, 에지 영상에서 얼굴 주변의 복잡한 잡음을 제거하기 위하여 색상 정보 영상과 차 영상에 각각 모폴로지(morphology)의 팽창(dilation) 연산을 적용하고 이들의 AND 결합 영상에 팽창 연산을 다시 적용한 이진 영상을 필터로 사용한다. 총 7명으로부터 양 눈이 보이는 정면 유사 방향의 영상을 20장씩 취득하여 총 140장에 대해 실험한 결과, MER의 오차율은 얼굴, 눈, 입에 대해 각각 6.2%, 11.2%, 9.4%로 나타났다. 또한, 스네이크의 초기 제어점을 얼굴은 44개, 눈은 16개, 입은 24개로 지정하여 MER추출에 성공한 영상에 대해 스네이크 알고리즘을 수행한 결과, 추출된 영역의 오차율은 각각 2.2%, 2.6%, 2.5%로 나타났다.해서 Template-based reasoning 예를 보인다 본 방법론은 검색노력을 줄이고, 검색에 있어 Feasibility와 Admissibility를 보장한다.매김할 수 있는 중요한 계기가 될 것이다.재무/비재무적 지표를 고려한 인공신경망기법의 예측적중률이 높은 것으로 나타났다. 즉, 로지스틱회귀 분석의 재무적 지표모형은 훈련, 시험용이 84.45%, 85.10%인 반면, 재무/비재무적 지표모형은 84.45%, 85.08%로서 거의 동일한 예측적중률을 가졌으나 인공신경망기법 분석에서는 재무적 지표모형이 92.23%, 85.10%인 반면, 재무/비재무적 지표모형에서는 91.12%, 88.06%로서 향상된 예측적중률을 나타내었다.ting LMS according to increasing the step-size parameter $\mu$ in the experimentally computed. learning curve. Also we find that convergence speed of proposed algorithm is increased by (B+1) time proportional to B which B is the number of recycled data buffer without complexity of computation. Adaptive transversal filter with proposed data recycling buffer algorithm could efficiently reject ISI of channel and increase speed of convergence in avoidance burden of computational complexity in reality when it was experimented having the same condition of

• Journal of Korean Society of Transportation
• /
• v.17 no.1
• /
• pp.113-129
• /
• 1999

It is widely recognized that the value of travel time (VOT) plays an important role both in choosing the transportation alternatives on an individual level, and in analyzing and evaluating transportation plans and other public policy makings on a collective level. There is, however, a great deal of difficulties to correctly estimate the VOT. In addition, although there are lots of methods to estimate the VOT so for, not many recommendations have been presented to reflect the localities associated with the VOT derivation in Korea. This study aims at deriving the VOT for different trip purposes and travel modes with their significances tested. To accomplish this purposes, a logit-based travel mode choice model based on revealed preference (RP) data has been formulated, calibrated using the discrete choice model of LIMDEP package for various trip purpose models. For each trip purpose and travel mode, the VOT has been calculated along with the significance testing of the derived VOTs. From the results given in this research, the VOTs for different purposes and modes are identified different, and they are statistically significant. The updated results here in this paper may be a yardstick in evaluating the transportation plans and policies by providing more detailed VOT information for different categories, especially in urban context.

• Journal of KIISE
• /
• v.41 no.11
• /
• pp.871-877
• /
• 2014

Cache replacement algorithms have been developed in order to reduce miss counts. In modern processors, the performance gap between the processor and main memory has been increasing, creating a more important role for cache replacement policies. The Least Recently Used (LRU) policy is one of the most common policies used in modern processors. However, recent research has shown that the performance gap between the LRU and the theoretical optimal replacement algorithm (OPT) is large. Although LRU replacement has been proven to be adequate over and over again, the OPT/LRU performance gap is continuously widening as the cache associativity becomes large. In this study, we observed that there is a potential chance to improve cache performance based on existing LRU mechanisms. We propose a method that enhances the performance of the LRU replacement algorithm based on the access proportion among the lines in a cache set during a period of two successive replacement actions that make the final replacement action. Our experimental results reveals that the proposed method reduced the average miss rate of the baseline 512KB L2 cache by 15 percent when compared to conventional LRU. In addition, the performance of the processor that applied our proposed cache replacement policy improved by 4.7 percent over LRU, on average.