• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11c
• /
• pp.1879-1882
• /
• 2002

본 논문에서는 불리언 모델을 지원하는 정보검색 시스템에서 사용자로부터 입력받은 불리언 질의를 효율적으로 연산하기 위한 3 가지 방법을 제안한다. 첫째, 불리언 대수를 사용하여 형태적으로 불필요한 노드를 제거한다. 둘째 색인어 출현 빈도 정보를 사용함으로써 빈도 0 을 가지는 노드와 이를 포함하는 노드의 연산 제외 여부를 결정하고, 연산 수행 시 시간이 적게 걸리는 순으로 피 연산자와 연산자의 순서를 재배열한다. 셋째, 불리언 질의 내에 복합 명사가 포함되어 있을 경우 구성 명사와 연산자의 조합을 이용한 질의 확장을 실시한다. 처음 두 가지 방법은 검색 속도의 향상을, 세 번째 방법은 정확도의 향상을 목표로 한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10b
• /
• pp.108-110
• /
• 1998

지리정보시스템에서는 방대한 공간데이타를 다루는 특성 때문에 효율적인 데이터의 관리 및 검색이 매우 중요하다. 본 연구에서는 공간데이타 질의처리를 위하여 여과-정제 방법을 사용하고 여과단계에서의 효과를 높이기 위하여 MBR 연산자와 대표점 필터, 그리고 그 instance들을 제안하였으며 이를 트리기반의 인덱싱 방법과 결합한 다중필터 방법을 제안하였다. MBR 연산자와 대표점 필터는 질의영역이 convex한 영역이고 특히 객체에 비하여 충분히 큰 경우 기존의 MBR만을 이용한 처리방법에 비해 매우 효율적이다. MBR과 질의영역의 위상관계를 분석하여 필요한 정보를 질의의 종류에 따라 적절히 사용함으로써 이후의 필터 및 정제 단계에서의 후보객체의 수를 줄일 수 있고, 따라서 수행시간을 줄일 수 있다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2002.04b
• /
• pp.214-216
• /
• 2002

시간에 따라 변화하는 사건을 기록하는 시간 데이타베이스에서는 사건을 저장할 때 시간 속성도 같이 저장한다. 최근에는 시간 데이타베이스의 속성을 고려하여 집지 함수와 같이 기존의 연산자를 확장하여 시간 데이타베이스에서 효율적으로 처리하려는 연구가 활발하게 진행되어 왔다. 사용자들은 종종 여러 애트리뷰트에 가중치를 두고 그 가중치 순서대로 결과가 보여지는 순위 질의를 실행한다. 기존의 순위 질의 개념을 그대로 시간 지인 데이타메이스에서 사용할 수 없다. 따라서 본 논문에서는 기존의 순위 질의에 시간 개념을 확장한 시간 순위 질의를 정의한다. 또한 시간 순위 질의 처리방법을 제 시 한다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.7
• /
• pp.639-649
• /
• 2000

In the relational database systems, the join operation is one of the most time-consuming query operations. Many parallel join algorithms have been developed to reduce the execution time. Multiple hash join algorithm using allocation tree is one of most efficient ones. However, it may have some delay on the processing each node of allocation tree, which is occurred in tuple-probing phase by the difference between one page reading time of outer relation and the processing time of already read one. In this paper, to solve the performance degrading problem by the delay, we develop a join algorithm using the concept of 'synchronization of page execution time' for multiple hash joins. We reduce the processing time of each nodes in the allocation tree and improve the total system performance. In addition, we analyze the performance by building the analytical cost model and verify the validity of it by various performance comparison with previous method.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.5 no.4
• /
• pp.18-32
• /
• 1995

Fuzzy rules, developed by experts thus far, may be often inconsistent and incomplete. This paper proposes a new methodology for automatic generation of fuzzy rules which are nearly complete and not inconsistent. This is accomplished by simulating a knowledge gathering process of humans from control experiences. This method is simpler and more efficient than existing ones. It is shown through simulation that our method even generates better rules than those generated by experts, under fine tuned parameters.

• Journal of the Korea Society of Computer and Information
• /
• v.29 no.6
• /
• pp.89-100
• /
• 2024

The primary goal of software testing is to identify and correct errors within software. A key challenge in this process is error masking, where errors disappear internally before reaching the output. This paper investigates the causes and characteristics of error masking, which complicates software testing. The study involved injecting artificial errors into three software programs to examine the extent of error masking by various test cases and to explore the underlying reasons. The experiment yielded four major findings. First, about 50% of the error masking occurred because the errors were not executed. Second, among various operators, logical and arithmetic operators masked errors less frequently, while relational and temporal operators tended to mask errors more extensively. Third, certain test cases demonstrated exceptional effectiveness in propagating errors to the output. Fourth, the type of error injected influenced the masking effect.

• Journal of the Korean Chemical Society
• /
• v.20 no.5
• /
• pp.340-350
• /
• 1976

Linear response theory is proposed to be applied for theoretical description of the phenomena in mechanical spectroscopy of solid high polymers below glass transition temperatures. The energy dissipation by sample is given in terms of certain time correlation functions. It is shown that the result leads to the result by Kirkwood on the energy loss and relaxation of cross-linked polymers, if the Liouville operator is replaced by the diffusion equation operator of Kirkwood. An approximation method of calculating the correlation functions is considered in order to show a way to calculate relaxation times. Using the approximation method, we consider a double-well potential model for energy relaxation, in order to see a connection between the present theory and a model theory used in mechanical energy relaxation phenomena of solid polymers containing pendant cyclohexyl groups at low temperature.

• Journal of Intelligence and Information Systems
• /
• v.22 no.2
• /
• pp.115-125
• /
• 2016

The Bollinger Band indicating the current price position in the recent price action range is obtained by adding/substracting the simple standard deviation (SSD) to/from the simple moving average (SMA). In this paper, we first compare the characteristics of the SMA and the exponential moving average (EMA) in the operator's point of view. A basic equation is obtained between the interval length N of the SMA operator and the weighting factor ${\rho}$ of the EMA operator, that makes the centers of the 1st order momentums of each operator impulse respoinse identical. For equivalent N and ${\rho}$, frequency response examples are obtained and compared by using the discrete time Fourier transform. Based on observation that the SMA operator reacts more excessively than the EMA operator, we propose a novel exponential standard deviation (ESD) band centered at the EMA and derive an auto recursive formula for the proposed ESD band. Practical examples for the ESD band show that it has a smoother bound on the price action range than the Bollinger Band. Comparisons are also made for the gap corrected chart to show the advantageous feature of the ESD band even in the case of gap occurrence. Trading techniques developed for the Bollinger Band can be straight forwardly applied to those for the ESD band.

• Journal of the Korean Society for information Management
• /
• v.12 no.1
• /
• pp.87-97
• /
• 1995

Boolean retrieval systems have been most widely used in the area of information retrieval due to easy implementation and efficient retrieval. Conventional Boolean retrieval systems. however, cannot rank retrieved documents in decreasing order of query-document similarities because they cannot compute similarity coefficients between queries and documents. Extended Boolean models such as fuzzy set. Waller-Kraft, Paice, P-Norm and Infinite-One have been developed to provide the document ranking facility. In extended Boolean models, the formulas evaluating Boolean operators AND and OR are an important component to affect the quality of document ranking. In this paper we present mathematical properties of the formulas, and analyse their effect on retrieval effectiveness. Our analyses show that P-Norm is the most suitable for achieving high retrieval effectiveness.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.1
• /
• pp.11-20
• /
• 1999

Because conventional spatial databases process the spatial information that is valid at current time, it is difficult to manage historical information efficiently which has been changed from the past to current. Recently, there are rapid increasing of interest to solve this problem so that makes databases to support historical information as well as spatial management at the same time. It can be eventually used in a various application areas. The formal semantics in a database is used to represent database structures and operations in order to prove the correctiveness of them in terms or mathematics. It also plays an important role in database to design a database and database management system. So in this paper, we suggest spatiotemporal domain, object, data, and spatiotemporal geometric/topological operations. And we not only formalize relational algebra/calculus using formal semantics for a spatiotemporal data model, but also show the example of real orld with them.