• Journal of Internet Computing and Services
• /
• v.1 no.1
• /
• pp.47-62
• /
• 2000

Geographic Information System(GIS) deal with data which can potentially be useful for a wida range of applications. However, the information needs of each application usually vary, specially in resolution, detail level, and representation style, as defined in the modeling phase of the geographic database design. To be able to deal with such diverse needs, the GIS must after features that allow multiple representations for each geographic entity of phenomenon. This paper addresses the problem of formal definition of the objects and their relationships on geographical information systems. The geographical data is divided in two main classes: geo-objects and geo-fields, which describe discrete and continuous representations of spatial reality. I will study the classes and the roles of relationships over geo-fields, geo-objects and nongeo-objects. Therefore, this paper will contribute the efficient design of geographical class hierarchy schema by means of formalizing attribute-domains of classes.

• Journal of Internet Computing and Services
• /
• v.9 no.4
• /
• pp.115-131
• /
• 2008

Small mobile devices have become commonplace in our everyday life, from cellular phones to PDAs. Discovering dense regions for the mobile devices is one of the problems of grate practical importance. It can be used in monitoring movement of vehicles, concentration of troops, etc. In this paper, we propose a novel algorithm on continuously clustering a large set of mobile objects. We assume that a mobile object reports its position only if it is too far away from the expected position and thus the location data received may be imprecise. To compute the location of each individual object could be costly especially when the number of objects is large. To reduce the complexity of the computation, we want to first cluster objects that are in proximity into a group and treat the members in a group indistinguishable. Each individual object will be examined only when the inaccuracy causes ambiguity in the final results. We conduct extensive experiments on various data sets and analyze the sensitivity and scalability of our algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• v.9 no.1
• /
• pp.163-166
• /
• 2005

The latest wireless communications technology bring about the rapid developments of Global Position System and Location-Based Service. It is very important for the moving object database to deal with database queries related to the trajectories of a moving objects and the valid time of the query results as well. In this paper, we propose how to get not only the current result of query but also the valid time and the result after the time when a query point and objects are moving at the same time. We would like to predict the valid time by formula because the current results will be incorrect due to the characteristic of the continuous movements of the moving objects and the future results can not be calculated by iterative computations.

• Journal of the Korea Convergence Society
• /
• v.10 no.11
• /
• pp.79-84
• /
• 2019

Video image based technology is being used in various fields with continuous development. The demand for vision system technology that analyzes and discriminates image objects acquired through cameras is rapidly increasing. Image processing is one of the core technologies of vision systems, and is used for defect inspection in the semiconductor manufacturing field, object recognition inspection such as the number of tire surfaces and symbols. In addition, research into license plate recognition is ongoing, and it is necessary to recognize objects quickly and accurately. In this paper, propose a recognition model through the rotational alignment of objects after checking the angle value of the tilt of the object in the input video image for the recognition of inclined objects such as numbers or symbols marked on the surface. The proposed model can perform object recognition of the rotationally sorted image after extracting the object region and calculating the angle of the object based on the contour algorithm. The proposed model extracts the object region based on the contour algorithm, calculates the angle of the object, and then performs object recognition on the rotationally aligned image. In future research, it is necessary to study template matching through machine learning.

• Journal of the Korea Society of Computer and Information
• /
• v.11 no.6 s.44
• /
• pp.289-298
• /
• 2006

Many researches are going on with regard to issues and problems related to mobile database systems, which are caused by the weak connectivity of wireless networks, the mobility and the portability of mobile clients. Mobile computing satisfies user's demands for convenience and performance to use information at any time and in any place, but it has many problems to be solved in the aspect of data management. The purpose of our study is to design Mobile Continuous Query Processing System(MCQPS) to solve problems related to database hoarding, the maintenance of shared data consistency and the optimization of logging, which are caused by the weak connectivity and disconnection of wireless networks inherent in mobile database systems under mobile client server environments. We proved the superiority of the proposed MCQPS by comparing its performance to the C I S(Client-Intercept-Slaver) model. In Addition, we experiment on proposed index structure and methodology in various methods.

• The Journal of the Korea Contents Association
• /
• v.14 no.10
• /
• pp.454-462
• /
• 2014

With the development of location aware technologies and mobile devices, location-based services have been studied. To provide location-based services, many researchers proposed methods for processing various query types with Mapreduce(MR). One of the proposed methods, is a Reverse k-nearest neighbor(RkNN) query processing method with MR. However, the existing methods spend too much cost to process the continuous RkNN query. In this paper, we propose an efficient continuous RkNN query processing method with MR to resolve the problems of the existing methods. The proposed method uses the 60-degree-pruning method. The proposed method does not need to reprocess the query for continuous query processing because the proposed method draws and monitors the monitoring area including the candidate objects of a RkNN query. In order to show the superiority of the proposed method, we compare it with the query processing performance of the existing method.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.10
• /
• pp.3262-3271
• /
• 2000

Continuous media objects, due to large volume and real-time consiraints in their delivery,are likely to consume much network andwidth Generally, proxy servers are used to hold the fiequently requested objects so as to reduce the network traffic to the central server but most of them are designed for text and image dae that they do not go well with continuous media data. So, in this paper, we propose a two-layered network cache management policy for continuous media object delivery on the wide area networks. With the proposed cache management scheme,in cach LAN, there exists one LAN cache and each LAN is further devided into a group of sub-LANs, each of which also has its own sub-LAN eache. Further, each object is also partitioned into two parts the front-end and rear-end partition. they can be loaded in the same cache or separately in different network caches according to their access frequencics. By doing so, cache replacement overhead could be educed as compared to the case of the full size daa allocation and replacement , this eventually reduces the backbone network traffic to the origin server.

• Journal of Korea Multimedia Society
• /
• v.8 no.7
• /
• pp.943-952
• /
• 2005

This paper proposes a user's mobility based cooperative proxy caching policy for effective resource management of continuous media objects in mobile environments. This policy is different from the existing proxy caching policies in terms of how to exploit users' mobility. In other words, existing caching policies work based on the information about objects by referring to users' requests within a specified domain whereas the proposed caching policy runs by utilizing a number of users' requests across several domains. So, the proposed policy is applicable to random requests in mobile environments. Moreover, we also propose a replacement policy based on weights and playback time. To check the efficiency of the proposed caching policy, the proposed replacement policy is run with different size of caching unit: object or segment. The result of performance evaluation tells that segment sizes, ratio of users' mobility and weights are major factors for the efficient operation of the cooperative caching.

• Bulletin of the Korean Mathematical Society
• /
• v.27 no.2
• /
• pp.189-196
• /
• 1990

In this paper, we try to generalize ultraproducts in the category of locally convex spaces. To do so, we introduce D-ultracolimits. It is known [7] that the topology on a non-trivial ultraproduct in the category T $V^{ec}$ of topological vector spaces and continuous linear maps is trivial. To generalize the category Ba $n_{1}$ of Banach spaces and linear contractions, we introduce the category L $C_{1}$ of vector spaces endowed with families of semi-norms closed underfinite joints and linear contractions (see Definition 1.1) and its subcategory, L $C_{2}$ determined by Hausdorff objects of L $C_{1}$. It is shown that L $C_{1}$ contains the category LC of locally convex spaces and continuous linear maps as a coreflective subcategory and that L $C_{2}$ contains the category Nor $m_{1}$ of normed linear spaces and linear contractions as a coreflective subcategory. Thus L $C_{1}$ is a suitable category for the study of locally convex spaces. In L $C_{2}$, we introduce $l_{\infty}$(I. $E_{i}$ ) for a family ( $E_{i}$ )$_{i.mem.I}$ of objects in L $C_{2}$ and then for an ultrafilter u on I. we have a closed subspace $N_{u}$ . Using this, we construct ultraproducts in L $C_{2}$. Using the relationship between Nor $m_{1}$ and L $C_{2}$ and that between Nor $m_{1}$ and Ba $n_{1}$, we show thatour ultraproducts in Nor $m_{1}$ and Ba $n_{1}$ are exactly those in the literatures. For the terminology, we refer to [6] for the category theory and to [8] for ultraproducts in Ba $n_{1}$..

• The KIPS Transactions:PartD
• /
• v.10D no.1
• /
• pp.45-56
• /
• 2003

In the wireless environment, according to the development of technology, which is able to obtain location information of spatiotemporal moving object, the various application systems are developed such as vehicle tracking system, forest fire management system and digital battle field system. These application systems need the data model, which is able to represent and process the continuous change of moving object. However, if moving objects are expressed by a relational model, there is a problem which is not able to store all location information that changed per every time. Also, existing data models of moving object have a week point, which constrain the query time to the time that is managed in the database such as past or current and near future. Therefore, in this paper, we propose a data model, which is able to not only express the continuous movement of moving point and moving region but also process the operation at all query time by using shape-change process and location determination functions for past and future. In addition, we apply the proposed model to forest fire management system and evaluate the validity through the implementation result.