• Journal of Korea Spatial Information System Society
• /
• v.9 no.2
• /
• pp.13-23
• /
• 2007

Recently there is growing Interest in LBS(Location Based Service) requiring real-time services and the spatial main memory DBMS for efficient Telematics services. In order to optimize existing disk-based multi-dimensional Indexes of the spatial main memory DBMS in the main memory, multi-dimensional index structures have been proposed, which minimize failures in cache access by reducing the entry size. However, because the reduction of entry size requires compression based on the MBR of the parent node or the removal of redundant MBR, the cost of MBR reconstruction increases in index update and the efficiency of search is lowered in index search. Thus, to reduce the cost of MBR reconstruction, this paper proposed the RSMBR(Relative-Sized MBR) compression technique, which applies the base point of compression differently in case of broad distribution and narrow distribution. In case of broad distribution, compression is made based on the left-bottom point of the extended MBR of the parent node, and in case of narrow distribution, the whole MBR is divided into cells of the same size and compression is made based on the left-bottom point of each cell. In addition, MBR was compressed using a relative coordinate and size to reduce the cost of search in index search. Lastly, we evaluated the performance of the proposed RSMBR compression technique using real data, and proved its superiority.

• Journal of Korea Spatial Information System Society
• /
• v.7 no.1 s.13
• /
• pp.13-24
• /
• 2005

Objects, which change their positions over time such as cars, are called moving objects. Trajectories of a moving object have large volumes because trajectories are accumulated. Efficient indexing techniques for searching these large volumes of trajectories are needed in the moving object databases. Especially the TB-tree which supports bundling trajectories is suitable for processing combined queries which have 2 steps: first step is selecting trajectories (range search), next is selecting the parts of each trajectory (trajectory search). But the TB-tree has unnecessary disk accesses cause of lack of spatial discrimination in range queries. In this paper, we propose and implement the splitting polity which can reduce dead spaces of non-leaf node in order to process range queries efficiently. The policy has better performance about range queries than the TB-tree as well as the advantages of the TB-tree, such as highly space utilization and efficient trajectory extraction. This paper shows that the newly proposed split policy has better performance in processing the range queries than that of the TB-tree by experimental evaluation.

• Journal of Korea Multimedia Society
• /
• v.7 no.8
• /
• pp.1107-1119
• /
• 2004

There is Electronic-cash system as important payment means in Electronic-commerce and the requirement of electronic cash is independence, transferability, divisibility etc. This is important requirement in DRM to provide contents as a same requirement to contents. Because contents itself can see that requirement of Electronic-cash can be transferred the control of to contents requirement as monetary concept. Can apply equally in reproduction and copy for contents, anonymity user's access etc, and several relations. In this paper, wish to put by value that is equal about Electronic-cash and contents, and apply concept of Electronic-cash through this and present DRM model after examine requirement of Electronic-cash and DRM's requirement. Concept used in this paper left copy use authority to use hierarchic tree structure and endowed anonymity for contents and anonymity about user for anonymous user. Finally, examines and compares and analyzes proposed existing methods.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.6 no.5
• /
• pp.747-754
• /
• 2002

We propose a Web-based collaborative CAD system which is independent from any platforms, and develop a 3D solid modeler in the system. We developed a new prototype of 3D solid modeler based on the web using Java 3D API, which could be executed without any 3D graphics software and worked collaboratively interacting with each user. The modeler can create primitive objects and get various 3D objects by using loader. The interactive control is available to manipulate-objects such as picking, translating, rotating, zooming. Users connect to this solid modeler and they can create 3D objects and modify them as they want. When this solid modeler is imported to collaborative design system, it will be proved its real worth in today's CAD system. Moreover, if we improve this solid modeler adding to the 3D graphic features such as rendering and animation, it will be able to support more detail design and effect view.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.15 no.3
• /
• pp.31-42
• /
• 2005

We consider a network storage model whose administrator can not be fully trusted. In this model, we assume that all data stored are encrypted for data confidentiality and one owner distributes the decryption key for each time period to users. In this paper, we propose three privilege management schemes. In the first scheme, called Temporal Privilege Management (TPM), we use a symmetric encryption based on one-way function chains for key encapsulation. In the second scheme, called Asymmetric Temporal Privilege Management (ATPM), anyone can encrypt the data using the public key of owner, but only privileged users can decrypt the encrypted data. Finally, we present a scheme to restrict writers' privilege using ID-based signatures in ATPM. In our schemes, the privilege managements are based on the time and the addition of users is efficient. Specially, applying TPM and ATPM, we can solve the back-issue problem.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.21 no.1
• /
• pp.93-104
• /
• 2011

A conditional access system is an essential element in IPTV services enabling service providers to allow authorized access to their services only to paid subscribers. Currently, there are two types of IPTV service models, namely PPC (pay-per-channel) and PPV (pay-per-view). However, a more desirable model would be the flexible PPC model, in which subscribers are free to choose any combination of preferred channels and add/remove channels independently. In this paper, we first point out that a previously proposed key management scheme for F-PPC is not secure. We then propose a new conditional access system using 4-level key hierarchy to realize secure F-PPC services. Compared to existing schemes, the proposed system is very efficient, just requiring O(1) communication for key update.

• Journal of KIISE:Information Networking
• /
• v.30 no.2
• /
• pp.282-292
• /
• 2003

This paper proposes an efficient data structure for forwarding IPv4 and IPv6 packets at the gigabit speed in backbone routers. The LPM(Longest Prefix Matching) search becomes a bottleneck of routers' performance since the LPM complexity grows in proportion to the forwarding table size and the address length. To speed up the forwarding process, this paper introduces a data structure named BMT(Bit-Map Tie) to minimize the frequent main memory accesses. All the necessary search computations in BMT are done over a small index table stored at cache. To build the small index table from the tie representation of the forwarding table, BMT represents a link pointer to the child node and a node pointer to the corresponding entry in the forwarding table with one bit respectively. To improve the poor performance of the conventional tries when their height becomes higher due to the increase of the address length, BMT adopts a binary search algorithm for determining the appropriate level of tries to start. The simulation experiments show that BMT compacts the IPv4 backbone routers' forwarding table into a small one less than 512-kbyte and achieves the average speed of 250ns/packet on Pentium II processors, which is almost the same performance as the fastest conventional lookup algorithms.

• Journal of IKEEE
• /
• v.23 no.1
• /
• pp.80-90
• /
• 2019

Even though Non-Volatile Memory (NVM) is used for data storage, a page table should be built to access data in it. And this observation leads us to the Persistent Page Table (PPT) scheme that keeps the page table in NVM persistently. By the way, processors have different page table structures and really operational page table cannot be built without virtual and physical addresses of NVM. However, those addresses are determined dynamically when NVM storage is attached to the system. Thus, the PPT should have system-independent and also address-independent structure and really working system-dependent page table should be built from the PPT. Moreover, entries of PPT should be updated atomically and, in this paper, we describe the design of PPT that meets those requirements. And we investigate how file systems can decrease the journaling overhead with the swap operation, which is a new operation created by the PPT. We modified the Ext4 file system in Linux and experiments conducted with Filebench workloads show that the swap operation enhances file system performance up to 60%.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.12B
• /
• pp.1022-1036
• /
• 2004

In mobile cellular network the ever-changing location of a mobile host necessitates the continuous tracking of its current position and efficient management of location information. A database called Home Location Register(HLR) plays a major role in location management in this distributed environment, providing table management, index management, and backup management facilities. The objectives of this paper are to identify the p개blems of the current HLR system through rigorous analysis, to suggest solutions to them, and to propose a new architecture for the HLR system. In the HLR system, a main memory database system is used to provide real-time accesses and updates of subscriber's information. Thus it is suggested that the improvement bemade to support better real-time facilities, to manage subscriber's information more reliably, and to accommodate more subscribers. In this paper, I propose an efficient backup method that takes into account the characteristics of HLR database transactions. The retrieval speed and the memory usage of the two-level index method are better than those of the T-tree index method. Insertion md deletion overhead of the chained bucket hashing method is less than that of modified linear hashing method. In the proposed backup method, I use two kinds of dirty flags in order to solve the performance degradation problem caused by frequent registration-location operations. Performance analysis has been performed to evaluate the proposed techniques based on a system with subscribers. The results show that, in comparison with the current techniques, the memory requirement is reduced by more than 62%,directory operations, and backup operation by more than 80%.

• Journal of health informatics and statistics
• /
• v.42 no.4
• /
• pp.309-316
• /
• 2017

Objectives: Radon and its progeny pose environmental risks as a carcinogen, especially to the lungs. Investigating factors affecting indoor radon concentrations and models thereof are needed to prevent exposure to radon and to reduce indoor radon concentrations. The purpose of this study was to identify factors affecting indoor radon concentration and to construct a comprehensive model thereof. Methods: Questionnaires were administered to obtain data on residential environments, including building materials and life style. Decision tree and structural equation modeling were applied to predict residences at risk for higher radon concentrations and to develop the comprehensive model. Results: Greenery ratio, impermeable layer ratio, residence at ground level, daily ventilation, long-term heating, crack around the measuring device, and bedroom were significantly shown to be predictive factors of higher indoor radon concentrations. Daily ventilation reduced the probability of homes having indoor radon concentrations ${\geq}200Bq/m^3$ by 11.6%. Meanwhile, a greenery ratio ${\geq}65%$ without daily ventilation increased this probability by 15.3% compared to daily ventilation. The constructed model indicated greenery ratio and ventilation rate directly affecting indoor radon concentrations. Conclusions: Our model highlights the combined influences of geographical properties, groundwater, and lifestyle factors of an individual resident on indoor radon concentrations in Korea.