• Journal of KIISE:Information Networking
• /
• v.35 no.4
• /
• pp.251-267
• /
• 2008

In this paper, we present a distributed topology control algorithm for constructing an optimized topology having a minimal search-time in unstructured peer-to-peer network. According to the proposed algorithm, each node selects the best nodes having higher hit-ratio than other nodes as many as the number being exponentially proportional to the hit-ratio of the node itself, and then it connects to them. The ensemble behavior of the proposed algorithm is very similar to the recrystrallizing phenomenon that is observed in nature. There is a partial order relationship among the hit-ratios of most nodes of constructed topology. Therefore once query message visits a node, it has a higher hit-ratio than the node that was visited last by the message. The query message even sent from freeloader can escape to the node having high hit-ratio by one hop forwarding, and it never revisits any freeloader again. Thus the search can be completed within a limited search time. We also propose the Chain-reactive search scheme using the constructed topology. Such a controlled multicasting reduces the query messages by 43 percent compared to that of the naive Gnutella using broadcasting, while it saves the search time by 94 percent. The search success rate of the proposed scheme is 99 percent.

• 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 Journal of the Acoustical Society of Korea
• /
• v.23 no.7
• /
• pp.532-539
• /
• 2004

In this Paper, we propose a content-based music information retrieval (MIR) system base on the query-by-example (QBE) method. The proposed system is implemented to retrieve queried music from a dataset where 60 music samples were collected for each of the four genres in Classical, Hiphop. Jazz. and Reck. resulting in 240 music files in database. From each query music signal, the system extracts 60 dimensional feature vectors including spectral centroid. rolloff. flux base on STFT and also the LPC. MFCC and Beat information. and retrieves queried music from a trained database set using Euclidean distance measure. In order to choose optimum features from the 60 dimension feature vectors, SFS method is applied to draw 10 dimension optimum features and these are used for the Proposed system. From the experimental result. we can verify the superior performance of the proposed system that provides success rate of 84% in Hit Rate and 0.63 in MRR which means near 10% improvements over the previous methods. Additional experiments regarding system Performance to random query Patterns (or portions) and query lengths have been investigated and a serious instability problem of system Performance is Pointed out.

• Journal of the Korea Institute of Military Science and Technology
• /
• v.3 no.2
• /
• pp.121-130
• /
• 2000

A practical method is proposed to improve hit probability of the digital gun fire control system, when the measured rate of the tracking sensor becomes biased under some operational situation. For ground moving target it is shown that the well-known Kalman filter which uses position measurement only can be optimally used to eliminate the rate bias error. On the other hand, for 3D moving aircraft we present a new algorithm which incorporate FIR-type filter, which uses position and rate measurement at the same time, and the fixed-lag smoother using position measurement only, and show that it has the optimal performance in terms of both estimation accuracy and response time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.7B
• /
• pp.608-618
• /
• 2006

The increasing popularity of multimedia streaming services introduces new challenges in content distribution. Especially, it is important to provide the QoS guarantees as they are increasingly expected to support the multimedia applications. The service providers can improve the performance of multimedia streaming by caching the initial segment (prefix) of the popular streams at proxies near the requesting clients. The proxy can initiate transmission to the client while requesting the remainder of the stream from the server. In this paper, in order to apply the prefix caching service based on IETF's RTSP environment to the wireless networks, we propose the effective RTSP handling scheme that can adapt to the radio situation in wireless network and reduce the cutting phenomenon. Also, we propose the traffic based caching algorithm (TSLRU) to improve the performance of caching proxy. TSLRU classifies the traffic into three types, and improve the performance of caching proxy by reflecting the several elements such as traffic types, recency, frequency, object size when performing the replacement decision. In simulation, TSLRU and RTSP handling scheme performs better than the existing schemes in terms of byte hit rate, hit rate, startup latency, and throughput.

• Journal of Oriental Neuropsychiatry
• /
• v.24 no.1
• /
• pp.45-62
• /
• 2013

Objectives : The purpose of this study was to compare the efficacy of Needle-Embedding Therapy with Acupuncture for Chronic Tension-type Headache (CTTH) patients. Methods : The study recruited Chronic Tension-type Headache patients. A total of twenty-six patients were divided into 2 groups. 13 subjects were placed into a needle-embedding therapy group and 13 subjects into an acupuncture therapy group by a randomization table. The needle-embedding therapy group was treated with needle-embedding at Fengchi (GB20), while the acupuncture therapy was acupunctured at Fengchi (GB20). Then, a comparative analysis was conducted by comparing the results with those measured by a Blood pressor, Heart rate variability (HRV), Henry Ford Headache Disablity Inventory (HDI) Internet Headache Impact Test (HIT), and Visual Analogue Scale (VAS). Results & Conclusions : As a result of evaluation by using the self-rating headache index (VAS, HDI, HIT), pain score declined in both groups. But they were not difference between the two groups.

• The KIPS Transactions:PartC
• /
• v.10C no.7
• /
• pp.879-884
• /
• 2003

Generally we use web cache in order to increase performance of web base system, and a replacement technique has a great influence on performance of web cache. A web cache replacement technique is different from a replacement technique of memory scope, and a unit substituted for is web object Also, as for the web object, a variation of user reference characteristics is very great. Therefore, a web cache replacement technique can reflect enough characteristics of this web object. But the existing web caching techniques were not able to reflect enough these object reference characteristics. A principal viewpoint of this study is reference characteristic analysis, an elevation of an object hit rate, an improvement of response time. First of all we analyzed a reference characteristics of an web object by log analysis. And we divide web cache storage scope using the result of reference characteristics analysis. In the experiment result, we can confirm that performance of an object-hit ratio and a response speed was improved than a conventional technique about a proposal technique.

• Journal of the Korean Society for Nondestructive Testing
• /
• v.23 no.2
• /
• pp.116-124
• /
• 2003

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04d
• /
• pp.563-565
• /
• 2003

최근 클러스터에 대한 연구는 내용 기반 클러스터의 부하 분배와 캐시 정책에 집중되고 있다. 본 논문에서는 웹 서비스의 고가용성 및 확장성을 제공하는 클러스터 환경에서 힌트 기반 협력적 캐싱의 캐시 적중률을 향상시키기 위해 기존의 DFR 기법을 개선하였다. 서비스 접근 확률을 이용하여 주 복사본과 종속 복사본을 선택적으로 제거하는 메모리 교체 방법을 제시하였으며, DFR 방식과 성능을 비교, 분석한 결과 DFR 방식보다 적은 디스크 접근률을 얻을 수 있었다.

• Journal of the Korean Society for Library and Information Science
• /
• v.38 no.3
• /
• pp.119-139
• /
• 2004

This study intends to evaluate the quality of the Digital Library System DB and to suggest methods for its quality control. The evaluation criteria are hit rates, redundancy, completeness and accuracy. In spite of high hit rates excessive records representing one work resulted serious redundancy. The average completeness rate of records was $48.12\%$ due to low level of description. The Analysis of accuracy showed various errors in most of records corresponding to $92\%$. Emphasis on analysing the errors in detail detected the causing factors and suggested practical guidelines for school libraries' catalogers.