• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1379-1382
• /
• 2004

The use of a cache for storing and processing of Web objects is becoming larger. Also, many studies on the efficient management of the storing scope of caches are being done. Web caching algorithms have many differences from traditional algorithms. Particularly, heterogeneity of Web objects that are processing units of Web caching, and a variation of Web object reference characteristic with time are the important causes of the decrease the performance of existing algorithms. In this study, we proposed the new web-caching algorithm. A heterogeneity variation of an object can be reduced as the proposed method dividedly managing Web objects and a cache scope with heterogeneity, and it is adaptively reflecting a variation of object reference characteristics with the flowing of time. In the experiments, we verified that the performance of the proposed method was more improved than existing algorithms through the two experiment models which considered heterogeneity of an object.

• Journal of the Korea Furniture Society
• /
• v.19 no.2
• /
• pp.141-150
• /
• 2008

Exploring on two major questions: 'Why do we feel more love for certain objects?' and 'How can design use this knowledge to realize design sustainability?', this article presents an alternative way of approaching the problem of design sustainability from the perspective that our relationships with design objects are of an extended mode of social relations. Recent discussions on design sustainability have transformed the notion of the problem by seeing it as a problem of our basic perception of design objects and our relationships with them. In this light, I propose that design sustainability could not be achieved solely by approaching from a mechanistic perspective, but by re-framing the way we see and relate things around us and by supporting our changes and actions to move forward a more sustainable notion of our relationships with the objects. As a way to realize design sustainability, I propose that design should involve story-making quality that supports our initiatives to build more affectional relations with objects by seeing the objects as entities of communication that tell stories of us, thus reflect our identities and meanings of our lives. Proceeding on the exploration of the subject, I present some of conceptual outlines in forms of an image diary, an interplay-able furniture unit, and a performance instruction that suggest a way for a special story-making process and thus a stronger emotional tie with the objects.

• Proceedings of the KSRS Conference
• /
• v.2
• /
• pp.725-727
• /
• 2006

The development of GIS and Location-Based Services requires a high-level database that will be able to allow real-time access to moving objects for spatial and temporal operations. MODB.MM is able to meet these requirements quite adequately, providing operations with the abilities of acquiring, storing, and querying large-scale moving objects. It enables a dynamic and diverse query mechanism, including searches by region, trajectory, and temporal location of a large number of moving objects that may change their locations with time variation. Furthermore, MODB.MM is designed to allow for performance upon main memory and the system supports the migration on out-of-date data from main memory to disk. We define the particular query for truncation of moving objects data and design two migration methods so as to operate the main memory moving objects database system and file-based location storage system with.

• Journal of Digital Contents Society
• /
• v.12 no.4
• /
• pp.551-557
• /
• 2011

In this paper, we propose a stack allocation technique of Android Java objects in order to reduce the number of garbage collection which is one of major reason on Android performance degradation when running applications. The proposed technique is to allocate Java objects into stack rather than heap memory. To do so, stacked objects could escape the garbage collection process. We experiment the proposed technique in the latest Android 2.3 version. For the simulation, we take advantage of the well known Java benchmark, Caffeinemark, and our own. The result shows the performance degradation of Dalvik Virtual Machine execution time caused by the stack allocation of Java objects is very slight and the proposed method considerably reduces the frequency of garbage collection. This will increase application performance and give better user interfaces to Android phone users.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.

• Journal of Digital Convergence
• /
• v.10 no.5
• /
• pp.267-273
• /
• 2012

The semantic relationship structures hierarchically the huge amount of document objects which is usually not formatted. However, it is very difficult to structure relevant data from various distributed application domains. This paper proposed a new object management method to service the distributed domain objects by using semantic reference relationship. The proposed mechanism utilized the profile structure in order to extract the semantic similarity from application domain objects and utilized the joint matrix to decide the semantic relationship of the extracted objects. This paper performed the simulation to show the performance of the proposed method, and simulation results show that the proposed method has better retrieval performance than the existing text mining method and information extraction method.

• Journal of KIISE:Computing Practices and Letters
• /
• v.15 no.12
• /
• pp.948-952
• /
• 2009

Recently, a new distributed grid scheme, called DS-GRID(distributed S-GRID), has been proposed to manage the location information of moving objects in a spatial network[1]. However, because DS-GRID uses uniform grid cells, it cannot handle skewed data which frequently occur in the real application. To solve this problem, we propose a dynamic distributed grid scheme which splits a grid cell dynamically based on the density of moving objects. In addition, we propose a k-nearest neighbor processing algorithm for the proposed scheme. Finally, it is shown from the performance analysis that our scheme achieves better retrieval and update performance than the DS-GRID when the moving objects are skewed.

• The KIPS Transactions:PartD
• /
• v.10D no.7
• /
• pp.1077-1088
• /
• 2003

To increase the retrieval performance in spatial database systems, it is required to develop spatial indexing methods considered the spatial locality. The spatial locality is related to the location property of objects. The previous spatial indexing methods are not considered the circular location property that objects will be taken. In this paper, we propose a dynamic spatial index structure called $Cr^*$-tree, and evaluate the performance of the proposed index structure. This is a new spatial index structure considered the circular location property of objects in which a search space is constructed with the circular and linear domains. By the simulation results, the $Cr^*$-tree shows that the number of disk across is low and the bucket utilization is high regardless of object distribution and bucket capacity.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.1 s.16
• /
• pp.59-75
• /
• 2006

One of the most challenging and encouraging applications of state-of-the-art technology is the field of traffic control systems. It combines techniques from the areas of telecommunications and computer science to establish traffic information and various assistance services. The support of the system requires a moving objects database system (MODB) that stores moving objects efficiently and performs spatial or temporal queries with time conditions. In this paper, we propose schemes to distribute an index nodes of trajectory based on spatio-temporal proximity and the characteristics of moving objects. The scheme predicts the extendible MBB of nodes of index through the prediction of moving object, and creates a parallel trajectory index. The experimental evaluation shows that the proposed schemes give us the performance improvement by 15%. This result makes an improvement of performance by 50% per one disk.

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

Assisted by high technologies of information and communication in storing and collecting moving object information, many applications have been developing technical methods to exploit databases of moving objects effectively and variously. Among them, today, Current and Anticipated Future Position Indexing methods manage current positions of moving objects in order to anticipate future positions of them or more complex future queries. They, however, strongly demand update performance as fast enough to guarantee certainty of queries as possible. In this paper, we propose a new indexing mettled derived from the TPR-tree that should has update performance considerably improved, we named it BUR-tree. In our method, index structure can be inserted, deleted, and updated with a number (or bulk) of objects simultaneously rather than one object at a time as in conventional methods. This method is intended to be applied to a traffic network in which vast number of objects, such as cars, pedestrians, moves continuously.