• Journal of the Korean Society for information Management
• /
• v.7 no.1
• /
• pp.79-95
• /
• 1990

A retrieval technique was defined as a technique for comparing the document representations. So this study classified retrieval technique in terms of the charactristics of the retrieved set of documents and the representations that are used. The distinction is whether the set of retrieved documents contains only documents whose representations are an exact match with the query, or a partial match with query. For a partial match, the set of retrieved document will include also those that are an exact match with the query. Boolean-logic as one of the exact match retrieval techniques is in current in most of the large operational information retrieval systems despite of its problems and limitatlons. Partial match as an alternative technique has also various problems. Existing information retrieval systems are successful in aSSisting the user whose needs are well- defined (e.g. Boolean-logic), to retrieve relevant documents but it should be successful in providing retrieval assistance to the browser whose information requirements is ill-defined.

• Journal of KIISE:Databases
• /
• v.33 no.3
• /
• pp.251-260
• /
• 2006

Homology searching on the primary structure (i.e., amino acid arrangement) of protein sequences is an essential part in predicting the functions and evolutionary histories of proteins. However, proteins distant in an evolutionary history do not conserve amino acid residue arrangements, while preserving their structures. Therefore, homology searching on proteins' secondary structure is quite important in finding out distant homology. In this manuscript, we propose an indexing scheme for efficient approximate searching on the secondary structure of protein sequences which can be easily implemented in RDBMS. Exploiting the concept of clustering and lookahead, the proposed indexing scheme processes three types of secondary structure queries (i.e., exact match, range match, and wildcard match) very quickly. To evaluate the performance of the proposed method, we conducted extensive experiments using a set of actual protein sequences. CSI was proved to be faster than the existing indexing methods up to 6.3 times in exact match, 3.3 times in range match, and 1.5 times in wildcard match, respectively.

• ETRI Journal
• /
• v.43 no.3
• /
• pp.483-510
• /
• 2021

In computational biology, desired patterns are searched in large text databases, and an exact match is preferable. Classical benchmark algorithms obtain competent solutions for pattern matching in O (N) time, whereas quantum algorithm design is based on Grover's method, which completes the search in $O(\sqrt{N})$ time. This paper briefly explains existing quantum algorithms and defines their processing limitations. Our initial work overcomes existing algorithmic constraints by proposing the quantum-based combined exact (QBCE) algorithm for the pattern-matching problem to process exact patterns. Next, quantum random access memory (QRAM) processing is discussed, and based on it, we propose the QRAM processing-based exact (QPBE) pattern-matching algorithm. We show that to find all t occurrences of a pattern, the best case time complexities of the QBCE and QPBE algorithms are $O(\sqrt{t})$ and $O(\sqrt{N})$, and the exceptional worst case is bounded by O (t) and O (N). Thus, the proposed quantum algorithms achieve computational speedup. Our work is proved mathematically and validated with simulation, and complexity analysis demonstrates that our quantum algorithms are better than existing pattern-matching methods.

• Proceedings of the KSRS Conference
• /
• 1998.09a
• /
• pp.274-279
• /
• 1998

For the accurate generation of DEMs, the determination of match quality in adaptive least square matching algorithm is significantly important. Traditionally, only the degree of convergence of a solution matrix in least squares estimation has been considered for the determination of match quality. It is, however, not enough to determine the true match quality. This paper reports two approaches of match quality determination based on adaptive least square correlation : the conventional if-then logic approaches with scene geometry and correlation as additional quality measures; and, the fuzzy logic approaches. Through these, accurate decision of match quality will minimize the number of blunder and maximize the number of exact match. The proposed methods have been tested on JERS and SPOT images and the results show good performance.

• Journal of KIISE:Databases
• /
• v.32 no.3
• /
• pp.263-275
• /
• 2005

In a large DNA database, indexing techniques are widely used for rapid approximate sequence searching. However, most indexing techniques require a space larger than original databases, and also suffer from difficulties in seamless integration with DBMS. In this paper, we suggest a space-efficient and disk-based indexing and query processing algorithm for approximate DNA sequence searching, specially exact match queries, wildcard match queries, and k-mismatch queries. Our indexing method places a sliding window at every possible location of a DNA sequence and extracts its signature by considering the occurrence frequency of each nucleotide. It then stores a set of signatures using a multi-dimensional index, such as R*-tree. Especially, by assigning a weight to each position of a window, it prevents signatures from being concentrated around a few spots in index space. Our query processing algorithm converts a query sequence into a multi-dimensional rectangle and searches the index for the signatures overlapped with the rectangle. The experiments with real biological data sets revealed that the proposed method is at least three times, twice, and several orders of magnitude faster than the suffix-tree-based method in exact match, wildcard match, and k- mismatch, respectively.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.30 no.3B
• /
• pp.65-71
• /
• 2005

The primary function of the Internet routers is to forward incoming packets toward their final destinations. IP address lookup is one of the most important functions in evaluating router performance since IP address lookup should be performed in wire-speed for the hundred-millions of incoming packets per second. With CIDR, the IP prefixes of routing table have arbitrary lengths, and hence address lookup by exact match is no longer valid. As a result, when packets arrive, routers compare the destination IP addresses of input packets with all prefixes in its routing table and determine the most specific entry among matching entries, and this is called the longest prefix matching. In this paper, based on parallel multiple hashing and prefix grouping, we have proposed a hardware architecture which performs an address lookup with a single memory access.

• Proceedings of the Korean Information Science Society Conference
• /
• 1998.10a
• /
• pp.386-388
• /
• 1998

Multiprotocol Label Switching(MPLS)는 기존 인터넷 라우팅에서 사용하는 longest prefix match 방식 대신에 short label exact match 방식을 사용함으로써 더 단순한 고속 포워딩 기술을 제공한다. 또한, 동일한 Forwarding Equivalence Class(FEC)에속하는 플로우들을 합성하여 하나의 레이블을 사용하는 방법 즉, Multipoint-to-point Tree(MPT)를 형성함으로써 확장설을 향상시켰다. 본 논문에선 현재 이슈가 괴고 있는 "IP address prefix"와 "host LSP"의 FEC타입과는 전송방식이 다른 브로드캐스팅을 위한"broadcast"FEC 타입을 제안하였으며, 브로드캐스트 패킷을 전송하는데 있어서 각각의Label Switched Path(LSP)제어 방식을 사용할 경우의 문제점을 분석하고, 유니캐스팅과 브로드캐스팅의 서로 다른 레이블 할당방식으로 인한 레이블 충돌을 해결하기 위해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.해서 레이블 범위를 분류하여 사용하는 방식을 제안한다.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 1998.11a
• /
• pp.354-357
• /
• 1998

MPLS (Multiprotocol Label Switching)는 인터넷에서 속도, 확장성 그리고 서비스 제공 능력을 향상시키기 위한 백본 네트웍으로 이용하기 위하여 Internet Engineering Task Force (IETF) standard로 급속하게 성장하고 있다. MPLS는 기존의 인터넷 라우팅에서 사용하는 longest prefix match 방식을 이용하는 라우팅 방법 대신에 short label exact match 방식과 L3 forwarding 방법을 사용함으로써 고속 인터넷 서비스 기술을 제공한다. 한편, 기존 인터넷의 IP format을 보면 Host Id, (Address prefix, Host Id), Broadcasting, Multicasting의 네 가지 종류의 구조를 가지고 있다. 그러나 아직 MPLS에서의 멀티캐스트 서비스에 대한 방식이 아직 표준화되고 있지 않고 있는 상황에서, MPLS 서비스 도메인 내에서 멀티캐스트 패킷은 기존의 멀티캐스트 라우팅 프로토콜과 연계되어 MPLS상에서 멀티캐스트 서비스가 이루어져야 한다. 본 논문에서는 기존의 인터넷상에서 제공되어지는 멀티캐스트 IP 플로우들을 MPLS 상에서 수용하기 위한 방식을 제안한다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2001.10c
• /
• pp.361-363
• /
• 2001

본 논문은 IPv6 헤더의 플로우 레이블 필드를 이용한 레이블 포워딩 방법을 제안하고 이 방법을 기반으로 리눅스 운영체제에서 멀티캐스팅 라우팅 레몬과 유니 캐스팅 데몬과 구현하여 레이블 포워딩에 의한 유니 캐스트 및 멀티캐스트 전송을 구현하였다. 레이블을 이용한 포워딩은 라우팅 엔트리를 결정하기 위해 If주소 중 가장 많은 부분이 일치되는 엔트리를 찾는 방법(longest prefix match) 을 기본으로 하는 IP주소정색 방법에 비해, 짧은 레이블 값 전체가 일치하는 엔트리를 찾는 방법 (short label exact match)을 원칙으로 하고있어 상대적으로 빠른 속도로 라우팅 테이블을 검색할 수 있으며, 쉽게 QoS를 제공할 수 있는 구조를 제공한다. 실험을 통해 구현된 레이블 포워딩을 이용한 유니캐스트 및 멀티캐스트 전송이 잘 동작함을 확인하였고, 성능비교 실험을 통해 레이불 포워딩이 일반 IP 검색 포워딩 방법보다 더 좋은 성능을 발휘함을 확인할 수 있다.

• 한국체육학회지인문사회과학편
• /
• v.54 no.5
• /
• pp.581-592
• /
• 2015

This research was fairness in sport and power is how they form and change through historical discussion on the sport's doping and ran afoul of fairness Explored in match-fixing in relationship with power, the product of the problems of human desires. First, doping and exploration of power. The history of doping in sports, history as long as it existed before. Medication is ruler of the players can't or don't conform with authority between the pair formed a relationship, where, in accordance with the victory of a temptation for wealth and fame and vested interests and desire, is personal, Society and country ranging and widely is committed. In particular, power of expression is reflected well reflected in the sport in the Cold War era and, in those days was wrong thinking and practices are still truly understands the connection between doping and anti-doping. Second, match-fixing and exploration of power. Also in the history of sport as doping, match-fixing, always existed. Sport and fairness of match-fixing in relation to artificial sources, and well decide the outcome of which ended with sport, not an issue connected to gambling and other crimes, And that's another sport and bring about a vicious circle of even turn into a row. The reason for this match fixing in power part of the formation of capital and profits for the exact cause has developed that further threatens the fair sport. Thus, in fairness, and relations of power in sport doping and match-fixing is historically very meaningful and, further research and discussion is needed. Buried the materialistic values of sport doping and match-fixing, nothing is being tolerated and other researchers' power as the elements of the pie grow only by sport only No one can guarantee that only satisfied if we hold a bright future of sport.