• 한국공간정보시스템학회:학술대회논문집
• /
• 2004.12a
• /
• pp.81-88
• /
• 2004

GIS (geographic information system) applications increasingly require the representation of geospatial objects with fuzzy extent and querying of time-varying information. In this paper, we Introduce a FSTDB (fuzzy spatiotemporal database) to represent and manage states and events causing changes of dynamic fuzzy objects using fuzzy set theory. We also propose the algorithms for the operators to be included in a GIS to make it able to answer queries depending on fuzzy predicates during a time interval and a method to identify the development process of objects during a certain period based on the designed database. They can be used in application areas handling time-varying geospatial data, including global change (as in climate or land cover change) and social (demographic, health, ect.) application.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.27 no.4
• /
• pp.571-579
• /
• 1990

A dynamic relocation algorithm for non-deterministic process graph in distributed computer systems is proposed. A method is represented for determining the optimal policy for processing a process tree. A general database query request is modelled by a process tree which represent a set of subprocesses together with their precedence relationship. The process allocation model is based on operating cost which is a function fo selection of site for processing operation, data reduction function and file size. By using expected values of parameters for non-deterministic process tree, the process graph and optimal policy that yield minimum operating cost are determined. As process is relocated according to threshold value and new information of parameters after the execution of low level process for non-deterministic process graph, the assigned state that approximate to optiaml solution is obtained. The proposed algorihtm is heuristic By performing algorithm for sample problems, it is shown that the proposed algorithm is good in obtaining optimal solution.

• Korean Journal of Computational Design and Engineering
• /
• v.3 no.1
• /
• pp.31-39
• /
• 1998

This paper deals with a development of the system that implements a collaborative design environment with some intelligent agents on the m. Intelligent agents can design collaboratively trough an interchange of messages in their special domains. Such a collaborative design of agents is achieved on the WWW. In this paper, we propose special agents named intercessor and DCM (Dynamic Connection Manager) and suggest new connection architecture using these agents in the WWW in order to improve the pre-existed agent connection architecture. The proposed agents are developed using Java language and JATLite API. We apply the these agents to the new architecture and show some possibilities that the agent connection architecture can be extended in the WWW Agents interchange messages with others using KOML (Knowledge Query and Manipulation Language), agent communication protocol and language, and deal with message autonomously according to their rule base. Agents register and connect dynamically trough the intercessor agent, and infer from their.

• Proceedings of the IEEK Conference
• /
• 2002.07c
• /
• pp.1839-1842
• /
• 2002

Ad hoc networks are characterized by multi- hop wireless connectivity, frequently changing network topology and the need for efficient dynamic routing protocols. In this paper, we proposed a new technique to adjust the zone radius by concentrating the changes of network traffic in a particular direction, which we refer to as AZRP. We demonstrate that even though ZRP and AZRP share a similar hybrid routing behavior, the differences in the protocol mechanics can lead to significant performance differentials. We discuss the algorithm and report on the performance of AZRP scheme, and compare it to the ZRP routing protocol. Our results indicate clearly that AZRP outperforms ZRP by reducing significantly the number of route query messages. And thereby increases the efficiency of the network load.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.04a
• /
• pp.716-718
• /
• 2003

최근 들어 데이터가 연속적으로 생성되므로 인해 디스크에 저장된 형태로 모델링되기 어려운 특성을 갖는 데이터 응용환경에 대한 관심이 증대하고 있다. 스트림 데이터를 대상으로 이루어지는 스트림 질의는 저장된 릴레이션 내의 데이터를 대상으로 한번 적용되고 마는 기존의 데이터 응용에서와는 달리, 한번 등록이 되면 계속적으로 입력 데이터 스트림을 감시하다가 질의를 만족시키는 투플이 발생될 때마다 결과를 출력하는 연속성을 갖는다. 이러한 데이터 스트림 처리 시스템에서 성능 향상을 위한 질의 계획 최적화에 대한 연구가 이루어지고 있으며, 이를 위한 하나의 방법으로 현재 사용중인 질의 계획에서 질의 계획의 일부를 재구성하기 위해서 최적화 대상 질의 계획으로의 입력을 중단하고 최적화된 새로운 질의 계획으로 바꾸어 임시 저장된 데이터를 새로운 질의 계획에 입력하는 방법이 이용되고 있다. 그러나 이 방법을 사용하는 경우 입력 데이터 버퍼링을 위한 저장공간에 대한 비용이 증가하고. 부정확한 갑을 산출을 유발할 수 있는 등 몇 가지 문제점을 안고 있다. 본 논문에서는 이러한 문제를 해결하기 위하여 최적화 대상이 되는 질의 계획을 일시적으로 중복시켜 최적화가 진행되고 있는 과정 중에도 기존의 질의 계획이 입력 스트림을 계속 처리하고, 최적화된 새로운 질의 계획으로 입력 스트림을 처리하도록 하는 일시 중복을 이용한 동적 질의 계획 재구성 기법을 제시하였다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2001.10a
• /
• pp.179-182
• /
• 2001

본 논문은 웹 상에서 사용자에게 동적 컨텐츠를 제공하기 위한 멀티미디어 데이터베이스 관리 시스템의 일부로써 시스템의 하부 구조 및 기본 API 를 제공하는 멀티미디어 데이터베이스 클래스를 설계하고, 이를 기반으로 사용자 요구에 대한 멀티미디어 객체를 추출하는 질의 처리 모텔을 제시한다. 멀티미디어 데이터베이스 클래스는 다양한 형태의 멀티미디어 데이터에 대한 분류 지원 및 관련 객체를 집합으로 관리하는 기능과 멀티미디어 메타데이터 생성 및 관리 기능을 제공하며, 질의 처리 모델은 이러한 멀티미디어 데이터베이스 클래스에서 관리되는 멀티미디어 객체 및 메타 객체를 효율적으로 추출한다.

• Journal of Information Processing Systems
• /
• v.13 no.4
• /
• pp.689-702
• /
• 2017

The Structured Query Language (SQL) Injection continues to be one of greatest security risks in the world according to the Open Web Application Security Project's (OWASP) [1] Top 10 Security vulnerabilities 2013. The ease of exploitability and severe impact puts this attack at the top. As the countermeasures become more sophisticated, SOL Injection Attacks also continue to evolve, thus thwarting the attempt to eliminate this attack completely. The vulnerable data is a source of worry for government and financial institutions. In this paper, a detailed survey of different types of SQL Injection and proposed methods and theories are presented, along with various tools and their efficiency in intercepting and preventing SQL attacks.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2011.11a
• /
• pp.1474-1475
• /
• 2011

본 논문에서는 다중 테넌트를 지원하기 위한 도구를 이용한 질의 생성 방법 및 질의 처리 방법, 그에 따른 페이지 자동 생성 방법을 제안한다.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1581-1592
• /
• 2009

Recently, we can hear various kinds of music in everywhere and anytime. If a user wants to find the music which was heard before in a street or cafe, but he does not know the title of the music, it is difficult to find it. That is the limitation of previous retrieval system of music data. To overcome these problems, we research a method of content-based retrieval of music data based on the recorded humming, the part of recorded music and the played musical instrument. In this paper, we investigated previous content-based retrieval methods of papers, systems and patents. Based on that, we research a method of content-based retrieval of music data. That is, in case of using the recorded humming and music for query, we extract the frequency information from the recorded humming/music and the stored music data by using FFT. We use a MIDI file in case of query by the played musical instrument. And by using dynamic programming matching, the error caused by the disparity of length between the input source with the stored music data could be reduced.

• Journal of KIISE:Databases
• /
• v.30 no.1
• /
• pp.41-51
• /
• 2003

The spatiotemporal database concerns about the time-varying spatial attributes. One of the important research areas is related to the support of various location-based services in motile communication environments. It is known that database systems may be difficult to manage the accurate geometric locations of moving objects due to their continual changes of locations. However, this requirement is necessary in various spatiotemporal applications including mobile communications, traffic control and military command and control (C2) systems. In this paper we propose the $B^{st}$-tree that utilizes the concept of multi-version B-trees. It provides an indexing method (or the historical and future range query Processing on moving object's trajectories. Also we present a dynamic version management algorithm that determines the appropriate version evolution induced by the mobility patterns to keep the query performance. With experiments we .;hi)w that our indexing approach is a viable alternative in this area.