• Journal of the Korean Society for information Management
• /
• v.13 no.1
• /
• pp.65-82
• /
• 1996

The aim of this study is to identify how searchers reflect the search goal requirements associated with search questions in process and outcome. One query which has two different search goal requirements was given to subjects, that is, one is to increase high precision and the other is to increase high recall. Using ERIC ONTAP file through DIALOG online search system, 54 subjects conducted online searches twice for the high precision search and for the high recall search. Subjects employed significantly different search strategies, invested significantly different efforts, and achieved significantly different results between the high precision and the high recall search.

• Journal of the Korean Society for information Management
• /
• v.17 no.2
• /
• pp.139-153
• /
• 2000

This article focuses on a transaction log analysis of the DISCOVER online catalog user interface at Duksung Women's University Library. The results show that the most preferred access point is the title field with rate of 59.2%. The least used access point is the author field with rate of 11.6%. Keyword searching covers only about 16% of all access points used. General failure rate of searching is 13.9% with the highest failure rate of 19.8% in the subject field and the lowest failure rate of 10.9% in author field.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1995.08a
• /
• pp.37-40
• /
• 1995

본 연구는 자연언어시스템에서 색인어와 탐색어의 특정성에 기인하는 재현율 감소를 극복하기 위한 방법론으로써 탐색어의 확장을 통한 검색효율을 평가하였다. 이를 위하여 우리말 데이터베이스를 대상으로 주제전문가가 자연언어로 작성한 원 질의문 (Q1), 원 질의문에 사용된 탐색어와 데이터베이스내의 색인어간의 유사도를 이용하여 탐색어를 확장한 질의문 (Q2(0.2), Q2(0.3)), 주제전문가인 이용자가 Q1의 의미적인 관계를 고려해서 자연언어로 탐색어를 확장한 질의문 (Q3)을 검색효율면에서 비교하였다. 실험결과, 평균재현율은 Q2(0.2), Q2(0.3), Q3, Q1의 검색의 순이었다. 평균정확율은 Q3, Q2(0.3), Q1, Q2(0.2)검색의 순으로 나타났다.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.26 no.6A
• /
• pp.1107-1116
• /
• 2001

고속 IP 주소 룩업(lookup)은 고속 인터넷 라우터의 성능을 좌우하는 주요 요소이다. LPM(longest prefix matching) 탐색은 IP 주소 룩업에서 가장 시간이 많이 걸리는 부분이다. PICAM은 고속 LPM 탐색을 위한 파이프라인 CAM 구조로서, 기존 CAM(content addressable memory, 내용 주수화 메모리)을 이용한 방법보다 룩업 테이블의 갱신속도가 빠르면서도 LPM 탐색율이 높은 CAM 구조이다. PICAM은 3단계의 파이프라인으로 구성된다. 단계 1 및 단계 2의 키필드분할수 및 매칭점의 분포에 따라 파이프라인의 성능이 좌우되며, LPM 탐색율이 달라질 수 있다. 본 논문에서는 PICAM의 파이프라인 성능모델을 제시하고, 이산사건 시뮬레이션(discrete event simulation)을 수행하여, 최적의 PICAM 구조를 도출하였다. IP version 4인 경우 키필드분할수를 8로 하고, 부하가 많이 걸리는 키필드블록을 중복 설치하는 것이 최적구조이며, IP version 6인 경우 키필드블록의 개수를 16으로 하는 것이 최적구조다.

• Proceedings of the Korean Society for Information Management Conference
• /
• 1999.08a
• /
• pp.109-112
• /
• 1999

본 연구는 이용자의 정보요구를 최대한 충족시키고 보다 사용하기 편한 이용자 지향의 탐색엔진을 개발하기 위해서 이용자 관점에서 국내 탐색엔진 한글알타비스타와 네이버를 평가하고자 한다. 이용자 중심의 탐색엔진 평가를 위해, 본 연구는 이용자가 자신의 검색질의로 탐색엔진을 통해 직접 검색을 하게 한 후 검색결과에 대해 이용자 스스로 평가하도록 한다. 평가기준은 수와 첸의 탐색엔진의 평가기준을 바탕으로 하여 탐색시간 및 노력, 탐색결과의 정확율, 연결성, 중복률, 유용성, 이용자의 만족도로 한글알타비스타와 네이버의 검색효율성 출 비교·평가하고자 한다.

• Korean Journal of Cognitive Science
• /
• v.14 no.3
• /
• pp.1-11
• /
• 2003

Two experiments were conducted to investigate effects of target types and retinal eccentricity on the search of a target while both target and background stimuli were static or moving. A visual search task was used in both experiments. The retinal eccentricity was determined by five concentric circles increasing by the unit of 1.6 and the target was different from the background stimuli in either orientation(orientation target) or a distinctive feature(feature target). In Experiment 1 where both the target and background stimuli were presented statically, an interaction between retinal eccentricity arid target type was found. While search time of the orientation target was not affected by the retinal eccentricity, that of the feature target increased as the retinal eccentricity increased. In Experiment 2 where all stimuli were moving, the interaction effect was also found. But the reason was not the same as that in Experiment 1. In the moving condition, while the search time of the orientation target decreased consistently as the retinal eccentricity increased, that of the feature target was not affected by the retinal eccentricity. The implications and limitations of the present results were discussed with respects to the real world situations such as driving cars or flying airplanes.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.28 no.7B
• /
• pp.647-659
• /
• 2003

LPM(Longest Prefix Matching)searching in If address lookup is a major bottleneck of IP packet processing in the high speed router. In the conventional lookup table for the LPM searching in CAM(Content Addressable Memory) the complexity of fast update take 0(1). In this paper, we designed pipeline architecture for fast update of 0(1) cycle of lookup table and high throughput and low area complexity on LPM searching. Lookup-table architecture was designed by CAM(Content Addressable Memory)away that uses 1bit RAM(Random Access Memory)cell. It has three pipeline stages. Its LPM searching rate is affected by both the number of key field blocks in stage 1 and stage 2, and distribution of matching Point. The RTL(Register Transistor Level) design is carried out using Verilog-HDL. The functional verification is thoroughly done at the gate level using 0.35${\mu}{\textrm}{m}$ CMOS SEC standard cell library.

• Journal of the Korean Society for Aeronautical & Space Sciences
• /
• v.40 no.4
• /
• pp.292-299
• /
• 2012

The line-of-sight(LOS) rate is estimated using Kalman filter in Radio-Frequency(RF) seeker. For the two axis gimbaled seeker, proper system modeling is considered and the basic filter structure is set up. The main issue for Kalman filter is choosing the proper process and measurement noise. For the measurement process, the signal to noise ratio(SNR) and other components are introduced. To cope with the eclipse problem or other abnormal seeker status, the pseudo input signal concept is proposed. By conditioning abnormal signals, the LOS rate estimation performance is increased. The process noise is also an important factor in the propagation phase. The analytical approach on a process noise component is performed and a reliable region for the filter is calculated based on the eigenvalue analysis. Some numerical simulations are performed to check the validity of suggested algorithm.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.3
• /
• pp.18-27
• /
• 2009

In this paper, we propose a frame rate conversion algorithm using adaptive search-based motion estimation (ME). The proposed ME method uses recursive search, 3-step search, and single predicted search as candidates for search strategy. The best method among the three candidates is adaptively selected on a block basis according to the predicted motion type. The adaptation of the search method improves the accuracy of the estimated motion vectors while curbing the increase of computational load. To support the proposed ME method, an entire image is divided into three regions with different motion types. Experimental results show that the proposed FRC method achieves better image quality than existing algorithms in both subjective and objective measures.

• Journal of the Korean Society for Library and Information Science
• /
• v.30 no.2
• /
• pp.51-86
• /
• 1996

The primary purpose of this study is to verify the difference of behavioural characteristics between the subject specialists and professional searchers in searching full-text databases. The major findings and conclusions from this study are summarized as follows. Analyses of Search questions(the degree of understanding with search questions, the degree of difficulty in selecting terms, and the degree of expectation of search results), search processes(the number of search terms used, the number of Boolean operators and qualifiers used, the number of documents browsed and the search time(the connecting time, time to spend per one output document, time to spend per one relevant output document) and search results(the searching efficiency(the number of relevant documents, the ,recall ratio and the precision ratio), the search cost(the total search cost. the search cost per one output document and the search cost per one relevant output document) and the degree of satisfaction with search results) are significantly different between the subject specialists and professional searchers in searching full-text databases.