• Journal of Korea Spatial Information System Society
• /
• v.9 no.1
• /
• pp.59-77
• /
• 2007

Advances in mobile techknowledges and supporting techniques require an effective representation and analysis of moving objects. Similarity search of moving object trajectories is an active research area in data mining. In this paper, we propose a trajectory search algorithm for spatio-temporal similarity of moving objects on road network. For this, we define spatio-temporal distance between two trajectories of moving objects on road networks, and propose a new method to measure spatio-temporal similarity based on the real road network distance. In addition, we propose a similar trajectory search algorithm that retrieves spatio-temporal similar trajectories in the road network. The algorithm uses a signature file in order to retrieve candidate trajectories efficiently. Finally, we provide performance analysis to show the efficiency of the proposed algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.4
• /
• pp.877-882
• /
• 2005

We propose a strategy to manage temporal data which are occurred on scientific applications. Firstly, We define LB and RB to separate temporal data, and entity versions to be stored in past, current, future segments. Also, We describe an algorithm to migrate temporal data with hotspot distribution among segments. The performance evaluation of average response time and space utilization is conducted. Average response time between two methods is similar, and space is saved in proposed method.

• Journal of Information Processing Systems
• /
• v.11 no.1
• /
• pp.39-56
• /
• 2015

Continuous multi-interval prediction (CMIP) is used to continuously predict the trend of a data stream based on various intervals simultaneously. The continuous integrated hierarchical temporal memory (CIHTM) network performs well in CMIP. However, it is not suitable for CMIP in real-time mode, especially when the number of prediction intervals is increased. In this paper, we propose a real-time integrated hierarchical temporal memory (RIHTM) network by introducing a new type of node, which is called a Zeta1FirstSpecializedQueueNode (ZFSQNode), for the real-time continuous multi-interval prediction (RCMIP) of data streams. The ZFSQNode is constructed by using a specialized circular queue (sQUEUE) together with the modules of original hierarchical temporal memory (HTM) nodes. By using a simple structure and the easy operation characteristics of the sQUEUE, entire prediction operations are integrated in the ZFSQNode. In particular, we employed only one ZFSQNode in each level of the RIHTM network during the prediction stage to generate different intervals of prediction results. The RIHTM network efficiently reduces the response time. Our performance evaluation showed that the RIHTM was satisfied to continuously predict the trend of data streams with multi-intervals in the real-time mode.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.2
• /
• pp.182-190
• /
• 2003

For temporal relations of interactive media such as MPEG-4, it is necessary for a temporal model that can update dynamically presentation time and temporal relations among objects by user events occurring during playback. Also, 811hough the temporal attributes are changed by user events, the validity of scene must be maintained. In this paper, we propose a temporal model that supports user interaction and developed an MPES-4 contents authoring system applying this model. We define the temporal relations of MPEG-4 that tan be authored and user interactions that can change the temporal properties. This authoring system defines the constraints on temporal relations and events and can generate the scene without error by checking the constraints. Also it provides the authoring environment to author visual]y temporal relations and events in MPEG-4 scene and generates the MPEG-4 stream by encoding the authored scene.

• The Journal of the Institute of Internet, Broadcasting and Communication
• /
• v.11 no.1
• /
• pp.109-113
• /
• 2011

Recently, according to the development of ubiquitous computing, the u-GIS which not only used in u-Transport, u-Care, u-Fun, u-Green, u-Business, u-Government, and u-City but also used to provides various spatial information such as the location of user is being the core technology of the ubiquitous computing environment. In this paper, we implemented an mobile spatio-temporal Query Processing Systems for handling the Spatio-Temporal Data in mobile equipment.The mobile spatio-temporal Query Processing Systems provides the spatio-temporal data type and the spatio-temporal operator that is expanded by the spatial data type and the spatial operator from OepenGIS "Simple Feature Specification for SQL". It supports arithmetic coding compression techniques that is considered with a spatio-temporal data specific character. It also provides the function of data cashing for improving the importation and exportation of the spatio-temporal data between a embedded spatio-temporal DBMS and u-GIS server.

• The KIPS Transactions:PartD
• /
• v.9D no.4
• /
• pp.531-542
• /
• 2002

As most of metadata have been handled on restricted applications, we need a same metadata in order to represent a same video data. However, these metadata make problems that the same video data should be supported by the same metadata. Therefore, in this paper, we extend the Dublin core elements to support the metadata which can solve the problems. The proposed video data representation is managed by the extended metadata of Doblin core model, by using the information of structure, content and manipulation of video data. The thirteen temporal relationship operators are reduced to the six temporal relationship operators by using a dummy shot temporal transformation relationship. The reduced six temporal relationship operators through excluding reverse temporal relationship not only maintain a consistency of representation between a metadata and a video data, but also transform n-ary temporal relationship to binary relationship on shots. We show that the proposed metadata model can be applied to representing and retrieving on various applications as equivalent as the same structure.

• The KIPS Transactions:PartD
• /
• v.18D no.4
• /
• pp.215-224
• /
• 2011

U-Health collects patient information with various kinds of sensor. Stream data can be summarized as an interval event which has aninterval between start-time-point and end-time-point. Most of temporal mining techniques consider only the event occurrence-time-point and ignore stream data change of state. In this paper, we propose the temporal mining technique considering the event change of state in U-Health. Our method overcomes the restrictions of the environment by sending a significant event in U-Health from sensors to a server. We define four event states of stream data and perform the temporal data mining considered the event change of state. Finally, we can remove an ambiguity of discovered rules by describing cause-and-effect relations among events in temporal relation sequences.

• Journal of Korea Society of Industrial Information Systems
• /
• v.14 no.4
• /
• pp.37-48
• /
• 2009

Household service robots should be able to provide their users with a variety of temporal reasoning services. In this paper, we propose an effective way of developing such temporal reasoning services using a domain-independent AI planner. Developing temporal reasoning services with a domain-independent AI planner, we have to address both the knowledge engineering problem of how to represent various real-world temporal constraints in a planning domain definition language, and the system design problem of how to realize the interface between the AI planner and the service consumer. In this paper, we introduce an example scenario and a set of typical temporal constraints for a household service robot, and then present how to represent them in the standard planning domain definition language. We also explain how to implement a service agent based on an AI planner in order to develop and provide new services efficiently.

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

In this paper we study on an interface connection between spatial operators and temporal operators to support the unified operations for spationtemporal data. The integration development of the spatiotemporal operations will be defined as a common use of spatiotemporal relationship operators by spatiotemporal referencing macros. additionally we propose an integration algorithm of a history operator and temporal relationship operators. Then the proposed system will be implemented on the commercial GIS software and evaluated by examples of spatiotemporal query expressions. Here, our integration of spatial and temporal operators will provide spatiotemporal query expressions with a useful framework.

• The Transactions of the Korea Information Processing Society
• /
• v.5 no.7
• /
• pp.1671-1679
• /
• 1998

Temporal databases support an efficient hist0rical representation and operation for an object in the real world. Especiallv, temporal aggregates generate In additional by information by means of computations from objects that is valid at past as well as current time. It is one of important areas to serve to users as various type of aggregates as possible so that they enhance the overall system performance and efficiency. In this paper, we not only introduce temporal aggregate tree strategy as an efficient processing technique for given temporal aggregate query, but also analyze the ovemll processing cost and then evaluate its perfomlance.