• 대한전기학회논문지:시스템및제어부문D
• /
• 제54권8호
• /
• pp.501-503
• /
• 2005

In this paper, using ranks of co-occurrence frequency about indices in pairs of neighboring pixels, we introduce a new re-indexing algorithm for efficiency of index color image lossless compression. The proposed algorithm is suitable for arithmetic coding because it has concentrated distributions of small variance. Experimental results proved that the proposed algorithm reduces the bit rates than other coding schemes, more specifically $15\%$, $54\%$ and $12\%$ for LZW algorithm of GIF, the plain arithmetic coding method and Zeng's scheme, respectively.

• 컴퓨터교육학회논문지
• /
• 제6권4호
• /
• pp.49-59
• /
• 2003

자동차, 모바일 폰, PDA와 같은 이동 객체를 모바일 데이터베이스에 정확히 색인하기 위해서는 위치 정보를 계속적으로 변경해주어야 하며 또한 많은 시간이 소요된다. 이 논문에서는 효율적인 모바일 지도 서비스를 위한 이동 객체의 공간 색인 기법을 제안한다. 구체적으로 각 이동 객체의 위치 변경 보고 즉시 병경하는 방법과 일정 주기마다 전체 객체에 대해 재색인하는 방법의 장단점을 분석하고, 데이터베이스 변경 횟수의 최소화를 위해 이동체의 특성을 감안한 새로운 버켓 분할 방법을 제안한다. 이동 객체 환경에서의 실험 결과는 제안한 방법론이 모바일 지도 서비스에 적합함을 보여준다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제9권5호
• /
• pp.1807-1824
• /
• 2015

As the technologies advance, mobile peer-to-peer (MP2P) networks or systems become one of the major ways to share resources and information. On such a system, the information retrieval (IR), including the development of scalable infrastructures for indexing, becomes more complicated due to a huge increase on the amount of information and rapid information change. To keep the systems on MP2P networks more reliable and consistent, the index structures need to be updated frequently. For a semantic IR system, the index structure is even more complicated than a classic IR system and generally has higher update cost. The most well-known indexing technique used in semantic IR systems is Latent Semantic Indexing (LSI), of which the index structure is generated by singular value decomposition (SVD). Although LSI performs well, updating the index structure is not easy and time consuming. In an MP2P environment, which is fully distributed and dynamic, the update becomes more challenging. In this work, we consider how to update the sematic index generated by LSI and keep the index consistent in the whole MP2P network. The proposed Concept Space Update (CSU) protocol, based on distributed 2-Phase locking strategy, can effectively achieve the objectives in terms of two measurements: coverage speed and update cost. Using the proposed effective synchronization mechanism with the efficient updates on the SVD, re-computing the whole index on the P2P overlay can be avoided and the consistency can be achieved. Simulated experiments are also performed to validate our analysis on the proposed CSU protocol. The experimental results indicate that CSU is effective on updating the concept space with LSI/SVD index structure in MP2P semantic IR systems.

• 한국CDE학회논문집
• /
• 제16권1호
• /
• pp.21-30
• /
• 2011

Similarity assessment of a CAD model is one of important issues from the aspect of model re-using. In real practice, many new mechanical parts are designed by modifying existing ones. The reuse of part enables to save design time and efforts for the designers. Design time would be further reduced if there were an efficient way to search for existing similar designs. This paper proposes an efficient algorithm of similarity assessment for mechanical part model with design history embedded within the CAD model. Since it is possible to retrieve the design history and detailed-feature information using CAD API, we can obtain an accurate and reliable assessment result. For our purpose, our assessment algorithm can be divided by two: (1) we select suitable parts by comparing MSG (Model Signature Graph) extracted from a base feature of the required model; (2) detailed-features' similarities are assessed with their own attributes and reference structures. In addition, we also propose a indexing method for managing a model database in the last part of this article.

• The Plant Pathology Journal
• /
• 제23권4호
• /
• pp.260-265
• /
• 2007

Testing a large number of samples from field monitoring and routine indexing is cumbersome and the available virus detection tools were labor intensive and expensive. To circumvent these problems we established tissue blot immunoassay (TBIA) method an alternative detection tool to detect Barley mild mosaic virus (BaMMV) and Barley yellow mosaic virus (BaYMV) infection in the field and greenhouse inoculated plants for monitoring and routine indexing applications, respectively. Initially, leaf and stem were tested to determine suitable plant tissue for direct blotting on nitrocellulose membrane. The dilutions of antibodies were optimized for more efficient and economical purposes. Results showed that stem tissue was more suitable for direct blotting for it had no background that interferes in the reaction. Therefore, this technique was referred as direct stem blot immunoassay or DSBIA, in this study. Re-used diluted (1:1000) antiserum and conjugate up to 3 times with the addition of half strength amount of concentrated antibodies was more effective in detecting the virus. The virus blotted on the nitrocellulose membrane from stem tissues kept at room temperature for 3 days were still detectable. The efficiency of DSBIA and RT-PCR in detecting BaMMV and BaYMV were relatively comparable. Results further proved that DSBIA is a rapid, reliable and economical detection method suitable for monitoring BaMMV and BaYMV infection in the field and practical method in indexing large scale of barley materials for virus resistance screening.

• 정보처리학회논문지D
• /
• 제8D권5호
• /
• pp.483-494
• /
• 2001

일반적인 하이퍼텍스트 검색 모델은 문서와 문서사이의 관계나 링크의 의미를 무시하고, 모든 문서를 독립적인 존재로 간주하여 검색한다. 그러나 하이퍼텍스트 검색 시스템에 있어 링크 정보를 이용하며 검색의 성능을 향상시킬 수 있다. 기존의 링크 기반 하이퍼텍스트 검색 모델은 문서의 색인 과정에서 링크 정보를 무시하고, 검색 결과 집합에 대하여 문서의 우선 순위를 제조정하는데 링크 정보를 활용한다. 이는 링크정보의 활용이 검색 결과 집합의 문서들에만 한정된다는 단점이 있다. 본 논문에서는 링크 정보를 문서의 색인 과정에서 활용한다. 색인 과정에서 링크 정보를 이용하여 문서 내 용어의 가중치와 문서 내 inLinks의 가중치를 정의하고, 이들의 이용하여 문서의 우선 순위를 위한 확장된 RSV 계산식을 제시한다. 실험 결과에서 링크 의미에 따른 검색 조회율과 정확도를 제시하고 기존 링크 기반 검색 모델과의 비교, 분석 결과를 제시한다.

• 한국정보과학회논문지:소프트웨어및응용
• /
• 제27권1호
• /
• pp.84-95
• /
• 2000

본 논문에서는 명사구 색인과 복합명사 분할을 포함한 복합명사 처리를 위해 통계 정보와 자연언어 처리를 제한적으로 이용 가능하게 하는 통합적 색인 기법을 제안한다. 먼저 색인과 검색에서 복합명사 분할 및 합성 모두를 고려한 통합 기법을 제시하고, 이를 위해 통계 정보와 제한적인 자연언어 처리를 모두 이용하는 통합 색인 기법을 제안한다. 먼저 형태소 분석 및 태깅 과정에서 단일어를 색인어로 추출하고 구문분석의 결과에서 명사구를 합성해 낸다. 구문 분석 실패 시에는 형태소 분석 및 태깅의 결과만을 사용하게 된다. 또한 태깅의 결과에서 복합명사를 골라 통계 정보를 이용하여 단일 명사로 분할하고 재합성한다. 분할된 단일 명사와 합성된 명사구는 기존의 단일어로만 이루어진 색인어를 보완하기 위해 색인어로 사용된다. 실험은 한국어 정보검색의 실험 집합인 KTSET 2.0과 KRIST SET을 사용하여 통합색인 기법이 복합명사 처리에 효율적임을 보였다.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2005년도 심포지엄 논문집 정보 및 제어부문
• /
• pp.164-166
• /
• 2005

In this paper, using ranks of co-occurrence frequency about indices in neighboring pixels, we introduce a new re-indexing scheme for efficiency of index color image lossless compression. The proposed method is suitable for arithmetic coding because it has skewed distributions of small variance. Experimental results proved that the proposed method reduces the bit rates than other coding schemes, more specifically 15%, 54% and 12% for LZW algorithm of GIF, the plain arithmetic coding method and Zeng's scheme.

• 대한전기학회논문지
• /
• 제37권11호
• /
• pp.753-761
• /
• 1988

Partial Matrix Refactorization (PR) has been available for refactorization repeatedly. But this paper aims to present Modified PR(MPR), which is faster in (re) factorization speed and simpler in program than PR, but storage is almost as big as that of PR. MPR substitutes refactorization process of PR1 for Modifide Trifactortzation (MT) and, instead of PR 2, adds to PR1 the algoritm that calculates modified element values of modified row / cols. MT, which is subalgorithm for MPR, simplifies the algorithm by applying information vectors to currently used Trifactorization, and trifactorizes and refactorizes in high speed. The test results of Fast Decoupled Load Flow (FDLF) and Contingency Analysis useing Indexing Scheme and Optimal Ordering also prove that MPR is faster than PR.

• 한국환경과학회지
• /
• 제26권2호
• /
• pp.133-146
• /
• 2017

This study aimed to develop strategies to re-establish the Park Nature Conservation Area in Bukhansan National Park, reflecting landscape ecological value by using the zonation program Marxan with Zones. Planning unit was set by watershed, and the basic data were mapped, considering topographical and ecological values. Mapped indicators were analyzed with the application framework of Marxan with Zones by indexing some indicators. The zones divided into Park Nature Conservation Area (Zone A), Park Nature Environment Area I(Zone B) which is reflected on the concept of Potential Park Nature Conservation Area and Park Nature Environment Area II(Zone C). The best solution for each of the scenarios was fixed through the sensitiveness analysis. From these, the final solution was selected considering five criteria including area ratio of conservation area and grouping. Lastly, the final solution was verified in the overlapped analysis with recent zonation. According to the results, the number of watersheds was 77, with an average area of $1,007,481m^2$. In terms of basic mapping and indexation, the slope index and number of landscape resources for topographical property were average 0.22 and 38 places, respectively. Biotope index was average 0.69 and legally protected species was 14 species, reflecting ecological values. As the social and economic indicators, trail index was average 0.04, and the number of tour and management facilities was 43 places. Through the framework of Marxan with Zones, the best solution for scenario 1 which was set by the highest conservation criteria was selected as the final solution, and the area ratio of Park Nature Conservation Area and grouping was excellent. As the result of overlapped analysis, suggested zonation of the Park Nature Conservation was better than the recent zonation in the area raito (28.3%), biotope grade I(15.4%) and the distribution points (10 places) of legally protected species with verification of proper distribution of conservation features according to the zone.