• Journal of Korea Multimedia Society
• /
• v.15 no.2
• /
• pp.215-225
• /
• 2012

In multimedia database, a multidimensional space-based indexing has been used to increase search efficiency. However, this method is inefficient in terms of ubiquity because it uses Euclidean distance as a scale of distance calculation. On the contrary, a metric space-based indexing method, in which metric axiom is prerequisite is widely available because a metric scale other than Euclidean distance could be used. This paper is attempted to propose a way of improving VP-tree, one of the metric space indexing methods. The VP-tree calculates the distance with an object which is ultimately linked to the a leaf node depending on the node fit for the search range from a root node and examines if it is appropriate with the search range. Because search speed decreases as the number of distance calculations at the leaf node increases, however, this paper has proposed a method which uses the latest interface on query object as the base point of trigonometric inequality for improvement after focusing on the trigonometric inequality-based range compression method in a leaf node. This improvement method would be able to narrow the search range and reduce the number of distance calculations. According to a system performance test using 10,000 video data, the new method reduced search time for similar videos by 5-12%, compared to a conventional method.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.40 no.9
• /
• pp.1754-1766
• /
• 2015

Packet classification carried out in Internet routers is one of the challenging tasks, because it has to be performed at wire-speed using five header fields at the same time. In this paper, we propose a leaf-pushed AQT bitmap trie. The proposed architecture applies the leaf-pushing to an area-based quad-trie (AQT) to reduce unnecessary off-chip memory accesses. The proposed architecture also applies a bitmap trie, which is a kind of multi-bit tries, to improve search performance and scalability. For performance evaluation, simulations are conducted by using rule sets ACL, FW, and IPC, with the sizes of 1k, 5k, and 10k. Simulation results show that the number of off-chip memory accesses is less than one regardless of set types or set sizes. Additionally, since the proposed architecture applies a bitmap trie, the required number of on-chip memory accesses is the 50% of the leaf-pushed AQT trie. In addition, our proposed architecture shows good scalability in the required on-chip memory size, where the scalability is identified by the stable change in the required memory sizes, as the size of rule sets increases.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.17 no.4
• /
• pp.101-111
• /
• 2014

Spatial events are predictable using data mining classification algorithms. Decision trees have been used as one of representative classification algorithms. And they were normally used in the classification tasks that have label class values. However since using rule ranking methods, spatial prediction have been applied in the spatial prediction problems. This paper compared rule ranking methods for the spatial prediction application using a decision tree. For the comparison experiment, C4.5 decision tree algorithm, and rule ranking methods such as Laplace, M-estimate and m-branch were implemented. As a spatial prediction case study, landslide which is one of representative spatial event occurs in the natural environment was applied. Among the rule ranking methods, in the results of accuracy evaluation, m-branch showed the better accuracy than other methods. However in case of m-brach and M-estimate required additional time-consuming procedure for searching optimal parameter values. Thus according to the application areas, the methods can be selectively used. The spatial prediction using a decision tree can be used not only for spatial predictions, but also for causal analysis in the specific event occurrence location.

• Journal of Korea Spatial Information System Society
• /
• v.11 no.3
• /
• pp.55-62
• /
• 2009

Location based Services in the ubiquitous computing environment, namely u-LBS, use very large and skewed spatial objects that are closely related to locational information. It is especially essential to achieve fast search, which is looking for POI(Point of Interest) related to the location of users. This paper examines how to search large and skewed POI efficiently in the u-LBS environment. We propose the Dynamic-level Grid based R-Tree(DGR-Tree), which is an index for point data that can reduce the cost of stationary POI search. DGR-Tree uses both R-Tree as a primary index and Dynamic-level Grid as a secondary index. DGR-Tree is optimized to be suitable for point data and solves the overlapping problem among leaf nodes. Dynamic-level Grid of DGR-Tree is created dynamically according to the density of POI. Each cell in Dynamic-level Grid has a leaf node pointer for direct access with the leaf node of the primary index. Therefore, the index access performance is improved greatly by accessing the leaf node directly through Dynamic-level Grid. We also propose a K-Nearest Neighbor(KNN) algorithm for DGR-Tree, which utilizes Dynamic-level Grid for fast access to candidate cells. The KNN algorithm for DGR-Tree provides the mechanism, which can access directly to cells enclosing given query point and adjacent cells without tree traversal. The KNN algorithm minimizes sorting cost about candidate lists with minimum distance and provides NEB(Non Extensible Boundary), which need not consider the extension of candidate nodes for KNN search.

• Science of Emotion and Sensibility
• /
• v.24 no.4
• /
• pp.29-38
• /
• 2021

Korean typefaces are characterized on two axes: a font is either serifed or non-serifed, and it is either square-frame or non-squared. A serifed font entails small strokes that are regularly attached to the ends of larger strokes. Conversely, fonts without these marks are termed sans-serif. One of the exclusive features of Korean typeface of the square-frame type is that in such fonts, vowels and consonants often with their final vowels, are harmonically placed within the boundaries of the virtual square. We hypothesize that serifed and squared-frame typefaces are more popular and preferred owing to their widespread use throughout history. A survey incorporating Korean pangrams written with serif, sans-serif, squared, and non-squared typefaces was designed to test the present hypothesis. We found that people typically preferred and were more familiar with squared typefaces compared to non-squared typefaces. However, no difference was observed between serifed and san-serif typefaces. Furthermore, a positive correlation was found between familiarity and preference ratings only where the typefaces had squared and serifed features. The results revealed that Korean typefaces with the squared feature were more well-known and, therefore, more preferred to the typefaces without it. The results further indicated that Korean typefaces with the squared feature can be recommended for people's familiarity to it and the comfort it provides, and their emotional relevance and sensibility enhanced if serifs are added.

• Proceedings of the Korea Contents Association Conference
• /
• 2015.05a
• /
• pp.117-118
• /
• 2015

콘셉트 앨범에서 음악적 연출을 위한 기법으로 앨범 내 서로 다른 곡에서 사용한 반복적 음악 요소를 사용한다. 리프, 솔로, 멜로디, 화성 진행의 반복적 사용을 통하여 각각의 곡들이 콘셉트 앨범 내에서 연결되는 구조를 만든다. 이러한 연결 구조를 통하여 음악적 기법과 내러티브의 연관성을 찾는다. 연관성을 통하여 콘셉트 앨범의 음악적 연출과 내러티브 표현의 방법을 분석한다.

• Magazine of the Korea Concrete Institute
• /
• v.1 no.2
• /
• pp.101-112
• /
• 1989

콘크리트에 선형파괴역할의 적용가능성을 연구한 많은 논문이 발표되었다. 본 논문에서는 CLWL-DCB식편을 이용한 콘크리트의 개구형파괴를 연구하였다. 표면구열길이는 리프리카를 사용하여 직접적인 방법으로 측정하였고, 이 결과은 실험에서 얻은 측정가중과 구열개구변위의 관계곡선을 이용하여 분석하였다. 감계응력강도계수와 감계구열선단위는 Two Parameter 모델을 사용하여 유효구열선단에서 구하였다. LEFM 구열단면과 실험으로 구한 구열단면으로부터 폐쇄압력을 얻기 위하여 중첩법을 적용하여 5종의 균열모델을 평가하였다.

• Proceedings of the Korean Society of Coastal and Ocean Engineers Conference
• /
• 2002.08a
• /
• pp.266-269
• /
• 2002

최근 항구 및 해안지역의 오염과 대규모 준설 매립으로 인하여 습지 및 환경 생태계 파괴 가 심각한 문제로 대두되고 있다. 또한 파도와 조수의 이동으로 인한 해안침식, 태풍이나 폭풍 둥의 자연재해로 인한 해안 및 항만구조물의 파괴가 빈번히 발생되고 있다. 이에 지오텍스타일 공법을 해안생태계를 복원 및 보전하고 해안 및 항만구조물로 활용하기 시작했다. (중략)

• 한국지구물리탐사학회:학술대회논문집
• /
• 2011.10a
• /
• pp.29-30
• /
• 2011

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.04b
• /
• pp.103-105
• /
• 2004

본 논문에서는 XML 문서의 내용을 효율적으로 검색하기 위해 필요한 메타데이터의 스키마몰 개발하고 이론 바탕으로 구축되는 내용기반 인덱싱 모델을 제안한다. 제안하는 내용기반 인덱싱 모델은 엘리먼트타입에 따라 랭킹 검색과 불리언 검색을 지원한다. 랭킹 검색 결과의 재현도와 정확도를 높이기 위해, 검색 결과의 출력 기준 노드가 리프 노드와 내부 노드인 경우를 구별하여 색인어에 대한 가중치를 부여하고, 이를 이용하여 질의와 엘리먼트간의 유사도를 계산하는 방법을 제안한다.