• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.30 no.3
• /
• pp.59-92
• /
• 2019

The purpose of the study is to develop the indicator and scale for evaluating the service environments of archives and to assess the physical service environments of National Archives of Korea (NAK), and then to suggest the alternatives to improve the current service environments on the basis of the results of evaluation. To achieve the purpose, the study designed three research phases: first, to develop the indicator and scale to measure the current service environments by merging universal design indicators and various standards of NAK for establishing facilities and environments on the basis of the barrier-free authentication indicators; second, to evaluate the current service environments of NAK with the newly developed scale; finally to suggest alternatives to improve the current environments on the basis of the evaluation findings. The study found that current service environments of NAK have critical limits on the areas and facilities to provide direct archival information services to users such as reference service desks, showrooms, education rooms, seminar rooms, etc. On the basis of the results, the study suggested the alternatives and further studies for making barrier-free service environments of archives.

• Journal of KIISE:Computer Systems and Theory
• /
• v.34 no.8
• /
• pp.319-326
• /
• 2007

To perform fast searching in massive data such as DNA strings, the most efficient method is to construct full-text index data structures of given strings. The widely used full-text index structures are suffix trees and suffix arrays. Since the suffix may uses less space than the suffix tree, the suffix array is proper for DNA strings. Previously developed construction algorithms of suffix arrays are not suitable for DNA strings since those are designed for integer alphabets. We propose a fast algorithm to construct suffix arrays on DNA strings whose alphabet sizes are fixed by 4. We reduce the construction time by improving encoding and merging steps on Kim et al.[1]'s algorithm. Experimental results show that our algorithm constructs suffix arrays on DNA strings 1.3-1.6 times faster than Kim et al.'s algorithm, and also for other algorithms in most cases.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.46 no.3
• /
• pp.24-33
• /
• 2009

Stream data, gathered from ubiquitous sensor networks, change continuously over time. Because they have quite different characteristics from traditional databases, we need new techniques for storing and querying/analyzing these stream data, which are research issues recently emerging. In this research, we implemented a storage manager gathering stream data and storing them into databases, which are sampled continuously from sensor networks. The storage manager cleans faulty data occurred in mobile sensors and it also reduces the size of stream data by merging repeatedly-sampled values into one and by employing the tilted time frame which stores stream data with several different sampling rates. In this research furthermore, we measured the performance of the storage manager in the context of a sensor network monitoring fires of a building. The experimental results reveal that the storage manager reduces significantly the size of storage spaces and it is effective to manage the data stream for real applications monitoring buildings and their fires.

• Journal of The Korean Digital Architecture Interior Association
• /
• v.5 no.1
• /
• pp.9-16
• /
• 2005

In Interior design, light is the most important factor in deciding color, texture and illumination level which are the basic factors of spatial design. To apply rendering technologies on prediction of illuminating effect, it is important to understand and analyse the basic properties of the illumination models that are local illumination model and global illumination model. The illumination models in computer graphics express the factors which determine the surface color, texture and light distribution through the reflection. The purpose of this study is to propose the best way of shading algorithm in interior space provided by the computer, based on the experimental analysis that 5 shading methods are applied to the interior space. The results of this study were as followed. 1) Local illumination models that are Lambert shading, Ground shading and Phong shading are not suitable to the prediction of interior illumination effect. 2) Ray tracing that is global illumination model could be adopted to interior illumination effects. Ray tracing is a very versatile algorithm because of the large range of lighting effects it can model. 3) Neither radiality nor ray tracing offers a complete solution for simulating all interior illumination effects. 4) Radiosity excels at rendering diffuse-to-diffuse inter-reflections and ray tracing excels at rendering specular reflections. By merging both shading techniques, that offers the best of both. Using computer technologies to simulate lighting in preliminary design stage which will provide information for designers and occupants to determine the effect of using artificial light sources at each stage of their design process. Further study in illumination analysis, prediction of illumination effect, and lighting calculation is required as computer media expands.

• Publications of The Korean Astronomical Society
• /
• v.22 no.2
• /
• pp.43-54
• /
• 2007

Many gravitational wave detectors are now being built or under operation throughout the world. In particular, LIGO has taken scientific data several times, although current sensitivity is not sufficient to detect the weak signals routinely. However, the sensitivities have been improving steadily over past years so that the real detection will take place in the near future. Data analysis is another important area in detecting the gravitational wave signal. We have carried out the basic research in order to implement data analysis software in Korea@home environment. We first studied the LIGO Science Collaboration Algorithm Library(LAL) software package, and extracted the module that can generate the virtual data of gravitational wave detector. Since burst sources such as merging binaries of neutron stars and black holes are likely to be detected first, we have concentrated on the simulation of such signals. This module can generate pure gravitational wave forms, noise suitable for LIGO, and combination of the signal and noise. In order to detect the gravitational signal embedded in the noisy data, we have written a simple program that employs 'matched filtering' method which is very effective in detecting the signal with known waveform. We found that this method works extremely well.

• The KIPS Transactions:PartD
• /
• v.8D no.4
• /
• pp.367-376
• /
• 2001

For the electronic map service by wireless, the existing map database cannot be used directly. This is because, the data volume of a map is too big to transfer by wireless and although the map is transferred successfully, the devices to display the map usually don’t have enough resources as the ones for desktop computers. It is also not acceptable to construct map database for the exclusive use of wireless service because of the vast cost. We propose new technique to generate a map for wireless service dynamically, from the existing map database. This technique includes the generalization method to reduce the map data volume and filtering method to guarantee that the data volume don’t exceed the limit of bandwidth. The generalization is performed in 3 steps :ㅁ step of merging the layers, a step of reducing the size of spatial objects, and a step of processing user interface. The filtering is performed by 2 module, counter and selector module. The counter module checks whether the data blume of generated map by generalization, exceeds the bandwidth limit. The selector module eliminates the excess objects and selects the rest, on the basis of distance.

• Journal of KIISE:Databases
• /
• v.29 no.1
• /
• pp.15-26
• /
• 2002

Most work on multimedia storage systems has assumed that client will be serviced using a round-robin strategy. The server services the clients in rounds and each client is allocated a time slice within that round. Furthermore, most such algorithms are evaluated on the basis of a tightly coupled cost function. This is the basis of well-known algorithm such as FCFS, SCAN, SCAN-EDF, etc. In this paper, we describe a scheduling module called Request Unifier(RU) that takes as input, a set of client request, and a set of constraints on the desired performance such as client waiting time or maximum disk bandwidth, and a cost function. It produces as output a Unified Read Request(URR), telling the storage server which data items to read and when these data items to be delivered to the clients. Given a cost function, a URR is optimal if there is no other URR satisfying the constraints with a lower cost. We present three algorithms in this paper that can accomplish this kind of request merging and compare their performance through an experimental evaluation.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.2
• /
• pp.123-134
• /
• 2000

This paper addresses a new triangulation method for constructing surface model from a set of wire-frame contours. The most important problem of contour triangulation is the branching problem, and we provide a new solution for the double branching problem, which occurs frequently in real data. The multiple branching problem is treated as a set of double branchings and an algorithm based on contour merging is developed. Our double branching algorithm is based on partitioning of root contour by Toussiant's polygon triangulation algorithml[14]. Our double branching algorithm produces quite natural surface model even if the branch contours are very complicate in shape. We treat the multiple branching problem as a problem of coarse section sampling in z-direction, and provide a new multiple branching algorithm which iteratively merge a pair of branch contours using imaginary interpolating contours. Our method is a natural and systematic solution for the general branching problem of contour triangulation. The result shows that our method works well even though there are many complicated branches in the object.

• Journal of KIISE:Software and Applications
• /
• v.31 no.5
• /
• pp.643-650
• /
• 2004

Control flow graph is used for Performing many Program-analysis techniques, such as data-flow and control-dependence analysis, and software-engineering techniques, such as program slicing and testings. For these analyses to be safe and useful, the CFG should incorporate the exception flows that are induced by exceptions. In previous research to construct control flow graph, normal flows and exception flows are computed at the same time, since these two flows are known to be mutually dependent. By investigating realistic Java programs, we found that the cases when these two flows are mutually dependent rarely happen. So, we can decouple exception flow analysis from normal flow analysis. In this paper we propose an analysis that estimates exception flows. We also propose exception flow graph to represent exception flows. And we show that the control flow graph that accounts for exception flows can be constructed by merging exception flow graph onto normal control flow graph.

• Journal of KIISE:Software and Applications
• /
• v.34 no.4
• /
• pp.359-367
• /
• 2007

The ontology is the underlying knowledge base to create the semantic web. Prerequisites for the success of the semantic web include widespread uses/sharing/merging of ontologies. In addition, it is very crucial to secure the integrity of ontology instances such as instance-identifying/referring integrity, and attribute domain constraints. In terms of ensuring instance-identifying integrity, OWL provides owl:sameAs property which is used to connect two separate ontology instances in order to represent that the two instances are the same. Recent semantic web works, however, have not sufficiently investigated the issues one may face in applying owl:sameAs to real semantic web applications. This study introduces our experiences of sameAs in developing a semantic web service framework for a research domain.