• Journal of Korea Spatial Information System Society
• /
• v.7 no.3 s.15
• /
• pp.119-130
• /
• 2005

A spatial data warehouse is a system that stores geographical information as a subject oriented, integrated, time-variant, non-volatile collection for efficiently supporting decision. This system consists of a builder and a spatial data warehouse server. A spatial data warehouse server suspends user services, stores transferred data in the data repository and constructs index using stored data for short response time. Existing methods that construct index are bulk-insertion and index transfer methods. The Bulk-insertion method has high clustering cost for constructing index and searching cost. The Index transfer method has improper for the index reconstruction method of a spatial data warehouse where periodic source data are inserted. In this paper, the efficient index reconstruction method using a partial index in a spatial data warehouse is proposed. This method is an efficient reconstruction method that transfers a partial index and stores a partial index with expecting physical location. This method clusters a spatial data making it suitable to construct index and change treated clusters to a partial index and transfers pages that store a partial index. A spatial data warehouse server reserves sequent physical space of a disk and stores a partial index in the reserved space. Through inserting a partial index into constructed index in a spatial data warehouse server, searching, splitting, remodifing costs are reduced to the minimum.

• Journal of KIISE:Computing Practices and Letters
• /
• v.10 no.2
• /
• pp.146-155
• /
• 2004

Currently most of commercial operating systems contain a high-level audit feature to increase their own security level. Linux does not fall behind the other commercial operating systems in performance and stability, but Linux does not have a good audit feature. Linux is required to support a higher security feature than C2 level of the TCSEC in order to be used as a server operating system, which requires the kernel-level audit feature that provides the system call auditing feature and audit event. In this paper, we present LxBSM, which is a kernel module to provide the kernel-level audit features. The audit record format of LxBSM is compatible with that of Sunshield BSM. The LxBSM is implemented as a loadable kernel module, so it has the enhanced usability. It provides the rich audit records including the user-level audit events such as login/logout. It supports both the pipe and file interface for increasing the connectivity between LxBSM and intrusion detection systems (IDS). The performance of LxBSM is compared and evaluated with that of Linux kernel without the audit features. The response time was increased when the system calls were called to create the audit data, such as fork, execve, open, and close. However any other performance degradation was not observed.

• Journal of KIISE:Databases
• /
• v.34 no.5
• /
• pp.448-464
• /
• 2007

Location-Based Services (LBSs) provide results to queries according to the location of the client issuing the query. In LBS, techniques such as caching and prefetching are effective approaches to reducing the data transmission from a server and query response time. However, they can lead to cache inefficiency and network overload due to the client's mobility and query pattern. To solve these drawbacks, we propose a semantic prefetching (SP) scheme using prefetching segment concept and improved cache replacement policies. When a mobile client enters a new service area, called semantic prefetching area, proposed scheme fetches the necessary semantic information from the server in advance. The mobile client maintains the information in its own cache for query processing of location-dependent data (LDD) in mobile computing environment. The performance of the proposed scheme is investigated in relation to various environmental variables, such as the mobility and query pattern of user, the distributions of LDDs and applied cache replacement strategies. Simulation results show that the proposed scheme is more efficient than the well-known existing scheme for range query and nearest neighbor query. In addition, applying the two queries dynamically to query processing improves the performance of the proposed scheme.

• Journal of the Korean GEO-environmental Society
• /
• v.9 no.5
• /
• pp.45-52
• /
• 2008

The present study has extended OpenSees, which is an open-source software framework DOS program for developing applications to idealize geotechnical and structural problems, for the static analysis of axial load capacity and settlement of single piles in MS Windows environment. The Windows version of OpenSees as improved by this study has enhanced the DOS version from a general purpose software program to a special purpose program for driven and bored pile analysis with additional features of pre-processing and post-processing and a user friendly graphical interface. The method used in the load capacity analysis is the numerical methods based on load transfer functions combined with finite elements. The use of empirical nonlinear T-z and Q-z load transfer curves to model soil-pile interaction in skin friction and end bearing, respectively, has been shown to capture the nonlinear soil-pile response under settlement due to load. Validation studies have shown the static load capacity and settlement predictions implemented in this study are in fair agreement with reference data from the static loading tests.

• The KIPS Transactions:PartA
• /
• v.13A no.7 s.104
• /
• pp.615-622
• /
• 2006

Caching in a Wireless Internet Proxy Server Cluster Environment has an effect that minimizes the time on the request and response of Internet traffic and Web user As a way to increase the hit ratio of cache, we can use a hash function to make the same request URLs to be assigned to the same cache server. The disadvantage of the hashing scheme is that client requests cannot be well-distributed to all cache servers so that the performance of the whole system can depend on only a few busy servers. In this paper, we propose an improved load balancing scheme using hashing and Round Robin scheme that distributes client requests evenly to cache servers. In the existing hashing scheme, if a hashing value for a request URL is calculated, the server number is statically fixed at compile time while in the proposed scheme it is dynamically fixed at run time using round robin method. We implemented the proposed scheme in a Wireless Internet Proxy Server Cluster Environment and performed experiments using 16 PCs. Experimental results show the even distribution of client requests and the 52% to 112% performance improvement compared to the existing hashing method.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.34-43
• /
• 2002

Since traditional static metadata set like Dublin Core has static metadata attributes about bibliography information, integration of metadata for various metadata, problems about standard and extension of metadata must be considered for applying it to new environment. Specially, as event-driven metadata write method included the notion of e-commerce come out for interoperability in digital libraries, traditional metadata management which cannot distinguish between different kinds of update operations to new extension of metadata set occurs unsuitable waiting of update operation. So, improvement is needed about it. In this paper, we show whether alleviative transaction consistency can be applied to digital library or not. Also it would divide newer metadata into static metadata attribute connected in read operation within user read-only transaction and dynamic metadata attribute in update operation within dynamic(e-commerce) update transactions. We propose newer metadata management algorithm considered in classfication of metadata attributes and dynamic update transaction. Using two version for minimal maintenance cost and ARU(Appended Refresh Unit) for dynamic update transaction, to minimize conflict between read and write operations shows fast response time and high recency ratio. As a result of the performance evaluation, we show our algorithm is proved to be better than other algorithms in newer metadata environments.

• Journal of the Korea Society for Simulation
• /
• v.26 no.1
• /
• pp.21-38
• /
• 2017

Information Centric Networking is changing the way how content is being transmitted. The shift from IP and host based networking towards content based networking scenario is growing day by day. Many researches have been done about different frameworks of ICN. Caching is an important part of ICN and many researchers have also proposed different ways for caching the data. With caching of data in intermediate devices like the network devices as well the user devices in some cases, the issue of content security as well as the role of the content producer becomes a major concern. A modified ICN architecture based on the current Content Centric Networking (CCN) model is presented in the paper. The architecture mainly focuses on involving the content producer in content delivery in the real time. The proposed architecture provides better security aspects for the CCN architecture. Apart from security the paper will also consider the issue of applicability of CCN architecture to replace the TCP/IP based architecture. The efficiency of the proposed architecture is compared with the previous CCN architecture based on the response time for a content delivery which shows very comparable level of efficiency. The paper than analyzes different beneficial aspects of the proposed architecture over the current architecture.

• Journal of Korean Society of Archives and Records Management
• /
• v.20 no.1
• /
• pp.115-137
• /
• 2020

This study aims to examine the limitations of status that describe archives based on the Archival rules, and to propose a new method using the Records in Context - Conceptual model (RiC-CM) as a solution. Given this, the study conducted literature reviews and case studies. The solutions based on RiC-CM and its effects on the limitations of the existing environment are as follows. First, RiC-CM can describe multiple provenances about archives. This can be solved by defining individual records and provenances as "entity" and expressing their associations as relationships. The interrelation of entities alone can more accurately represent the information of provenances associated with a particular archive, making it easier to identify the overall context that makes records. Second, RiC-CM can link related files. Those that belong to a specific records group (fonds) can be resolved by assigning them to individual entities and making interrelation according to the context that makes records. This method makes it possible to serve information about the context that makes records. From the user's point of view, more options are available for searching records. Third, RiC-CM can link all relevant producer-made records related to a specific production organization. If organizations are related to each other, they can be defined as "entity," and their relationship can be expressed as "associated with." It helps to comprehensively examine the context of provenances. The findings of this study are expected to be used as a basis for future research on RiC-CM, in response to the paradigm shift for electronic records management systems.

• Korean Journal of Agricultural Science
• /
• v.38 no.4
• /
• pp.753-759
• /
• 2011

Protected crop production has been popular in Korea as well as in other countries. Intensive and continuous monitoring and control of the environment, which is labor- and time-consuming, is critical for stable crop productivity and profitability, otherwise damage could be happened due to unfavorable ambient and soil conditions. In the study, potential utilization of smartphone and remote access application in protected crop production environment was investigated. Tested available remote access applications provided functions of mouse click (left and right buttons), zooming in and out, and screen size and color resolution control. Wi-Fi data communication speeds were affected by signal intensity and user place. Data speeds at high (> -55 dBm), medium (-70~-56 dBm), and low (< -71 dBm) signal intensity levels were statistically different (${\alpha}=0.05$). Means of data communication speed were 6.642, 4.923, and 2.906 Mbps at hot spot, home, and office, respectively, and the differences were significant at a 0.05 level. Smart phone and remote access application were applied successfully to remote monitoring (inside temperature and humidity, and outside precipitation, temperature, and humidity) and control (window and light on/off) of green house environment. Response times for monitoring and control were less than 1 s at all places for high signal intensity (> -55 dBm), but they were increased to 1 ~ 10 s at home and office and to 10 ~ 30 s at hot spot for low signal intensity (< -71 dBm) for Wi-Fi. Results of the study would provide useful information for farmers to apply these techniques for their crop production.

• KSCE Journal of Civil and Environmental Engineering Research
• /
• v.31 no.2D
• /
• pp.227-235
• /
• 2011

At present, the characteristics of drivers are not properly considered when informations are provided via VMS even though the Variable Message Signs(VMS) are one of the key information provision medias on the roads. In this study, the driver's psychological response(stress index) was evaluated using a driving simulator for the position of the VMS provided, the contents of the VMS provided, the size of characters on VMS, and types of VMS expression. It was appeared that the stress is the least when the position of the VMS provided 1.5km proceeded from exit, the contents of the VMS provided are time information and types of VMS expression are character form respectively and the size of characters on VMS is appeared not important. In addition, the change of the users' satisfaction level was measured when increasing the numbers of VMS on unit distance and the size of characters. The size of character was almost not effected in similar to the result of stress index and the satisfaction level increased when increasing the number of VMS on the unit distance. The results of this research can be utilized as basic data for the ITS system design and operation stages.