• 한국산업정보학회논문지
• /
• 제8권3호
• /
• pp.61-68
• /
• 2003

In this paper, a representation method for structure information retrieval without schema and DTD of XML documents is presented. While existing researches have used DTD or schema to extract structure information, we extract structure information directly from XML documents. Especially the well-formed XML documents are only required to retrieve documents in the proposed method. Thus it can retrieve more general and various documents easily compared to the existing XML retrieval systems requiring DTD or schema. Experimental result indicates that the proposed method retrieves effectively structure information of XML documents independently to DTD information.

• 한국도서관정보학회지
• /
• 제18권
• /
• pp.245-268
• /
• 1991

Some conclusions derived from the study are as follows : 1) Most conventional information retrieval systems require users do precisely that specify the information they require, but user's information needs are not always precise. 2) Information need arise from when users are in an anomalous stats of knowledge about some problem, so user's information needs are not always precise. 3) Information retrieval systems must assist to users make themselves correct, complement, and specify their information need. When information need arise, systems should understand the state of knowledge and will be design to present and specify their ill-defined potential information need. 4) Existing information retrieval techniques need a tool to complement current its disadvantages and to enhance retrieval efficiency. Browsing searching will be a role such as a tool. 5) Browsing searching can understand user's state of knowledge and assist to specify not only pre-searching information need but also changed information need during searching progress.

• 한국시뮬레이션학회논문지
• /
• 제10권3호
• /
• pp.71-82
• /
• 2001

Considering material handling delay which occurs between storage and processing stations, we propose an algorithm to estimate the required storage capacity, i.e., number of aisles and number of openings in vertical and horizontal directions in each aisle, of an automated storage/retrieval(AS/R) system. Due to the random nature of storage and retrieval requests, proportion of single and dual commands is not known in advance. Two design criteria, maximum permissible overflow probability and maximum allowable storage/retrieval(S/R) machine utilization, are used to compute the storage capacity. Most of studies assume that storage capacity of AS/R systems is given, although it is a very important decision variable in the design phase. Therefore, the proposed model can be effectively used in the design phase of new AS/R systems.

• 한국정보처리학회논문지
• /
• 제7권12호
• /
• pp.3762-3774
• /
• 2000

컴퓨터 하드웨어 및 멀티미디어 정보 처리 기술의 발달로 인하여 멀티미디어 정보 검색 시스템에 대한 요구가 증대되고 있다. 멀티미디어 정보 검색 시스템은 텍스트와 이미지 위주로 발전하였으나 비디오와 오디오 정보, 특히 음악 정보를 위한 멀티미디어 정보 검색 시스템에 대한 요구가 점차 증대되고 있다. 최근의 음악 정보 검색 시스템에서는 해당 음악 정보의 작곡가, 곡명 등과 같은 메타 정보만을 이용한 메타 정보 기반의 검색뿐만 아니라 음악의 내용을 기반으로 하는 내용 기반 검색까지도 가능하다. 음악의 내용 기반 검색에서는 메타 정보 기반 검색에서 흔히 볼 수 있는 문자열에 대한 패턴 매칭보다는 멀티미디어 데이타간의 유사도를 기반으로 검색한다. 본 논문에서는 음악을 일정한 선율에 따른 음들의 배합으로 정의하고, 선율을 구성하는 음의 높이와 음의 길이 정보를 복합적으로 이용하여 두 음악 정보간의 유사도를 계산하는 알고리즘을 제안한다. 또한, 본 논문에서는 제안된 유사도 계산 알고리즘의 검증을 위해 동요를 대상으로 실험을 하였다. 실험 결과에 따르면 제안된 유사도 계산 알고리즘이 기존에 제안된 내용기반 음악 정보 검색 시스템과 비교하여 음악의 선율 정보를 기준으로 음악들간의 유사도를 보다 정확하게 효과적으로 계산하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제12권10호
• /
• pp.4856-4872
• /
• 2018

The mobile internet has grown ubiquitous across the globe with the widespread use of smart devices. However, the designs of modern mobile operating systems and their applications limit content retrieval with mobile applications. The mobile internet is not as accessible as the traditional web, having more man-made restrictions and lacking a unified approach for crawling and content retrieval. In this study, we propose an automatic and scalable mobile application content crawler, which can recognize the interaction paths of mobile applications, representing them as interaction graphs and automatically collecting content according to the graphs in a parallel manner. The crawler was verified by retrieving content from 50 non-game applications from the Google Play Store using the Android platform. The experiment showed the efficiency and scalability potential of our crawler for large-scale mobile internet content retrieval.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 2006년도 춘계학술대회 학술발표 논문집 제16권 제1호
• /
• pp.94-95
• /
• 2006

A great deal of research has been made to model the vagueness and uncertainty in information retrieval. One such research is fuzzy ranking models, which have been showing their superior performance in handling the uncertainty involved in the retrieval process. In this study we develop a new fuzzy ranking model based on the user preference. Through the experiments on the TREC-2 collection of Wall Street Journal documents, we show that the proposed method outperforms the conventional fuzzy ranking models.

• 한국지능시스템학회논문지
• /
• 제16권3호
• /
• pp.326-331
• /
• 2006

A great deal of research has been made to model the vagueness and uncertainty in information retrieval. One such research is fuzzy ranking models, which have been showing their superior performance in handling the uncertainty involved in the retrieval process. In this study we develop a new fuzzy ranking model based on the user preference. Through the experiments on the TREC-2 collection of Wall Street Journal documents, we show that the proposed method outperforms the conventional fuzzy ranking models.

• 산업경영시스템학회지
• /
• 제18권34호
• /
• pp.9-14
• /
• 1995

A cost minimization model for designing AS/RS (Automated Storage/Retrieval Systtems) has been developed under the S/R (Storage/Retrieval) machine throughput rate and total storage capacity requirements. The objective function includes S/R machine cost storage rack cost, and interface conveyor cost. Since the model is a nonlinear integer programming problem which is very hard to solve with large problem size, the model is simplified using previous research results to be solved exactly and a simultion procedure is combined to verify that throughput rate requirements are satisfied.

• 한국정보과학회:학술대회논문집
• /
• 한국정보과학회 2001년도 가을 학술발표논문집 Vol.28 No.2 (1)
• /
• pp.250-252
• /
• 2001

With the growth in computer and network technologies, some content-based music retrieval systems have been developed. However, their retrieval efficiency does not satisfy user's requirement yet. Of course users hope to have a more efficient and higher precision for music retrieval. In this paper so for these reasons, we Propose an efficient content-based music retrieval algorithm using melodies represented as music sequences. From the experimental result, it is shown that the proposed algorithm has higher exact rate than the related algorithms.

• 정보관리학회지
• /
• 제12권1호
• /
• pp.87-97
• /
• 1995

부울 검색 시스템은 구현이 용이하고 빠를 검색 시간을 제공하기 때문에, 오늘날 정보 검색 분야에서 가장 널리 사용되고 있다. 그러나 순수한 부울 검색 시스템은 문서값을 계산할 수 없기 때문에, 검색된 문서들을 질의를 만족하는 정도에 따라 정렬 할 수 없다. 부울 검색 시스템에 순위 결정 기능을 부여하기 위하여 퍼지 집합, Waller-Kraft, Paice, P-Norm, Infinite-One과 같은 확장된 부울 모델들이 개발되어 왔다. 이들 모델에서 부울 연산자 AND와 OR에 대한 계산식은 순위 결정의 성능을 결정하는 중요한 요소이다. 본 논문에서는 부울 연산자 계산식의 수학적 특성을 제시하고, 이들이 검색효과에 미치는 영향을 분석한다. 분석 결과는 P-Norm 모델이 높은 검색 효과를 얻기에 가장 적합함을 보여준다.