• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.31 no.2
• /
• pp.53-70
• /
• 2020

This study was intended to present the need for building the library as a hub of the community memory preservation which provides the collection, sharing, and curation services of the locality specific historical and local data based on the policy task, namely supporting the collection, preservation, and management system of the community's life memory. To this end, the current status of data collection, management, and operation of institutions serving regional-based materials such as cultural centers and regional archives was grasped, and the cases and status of curation services in libraries were investigated and analyzed. The discussion proposed via the results of the study are as follows. First, to the culture center, external demand has been increased from the aspect of social education including festivals, cultural and art event, cultural and art educational business, art activities business of local residents and managerial business is to be carried out, which makes it difficult for the culture center to manage its businesses. Accordingly, it is necessary to collect and preserve regional various data at the pubic libraries playing various roles including provision of informative services, cultural programs and information sharing places to local residents and provision of services to vulnerable social group. As the existing libraries have a plan to collect data systematically, it is considered that those libraries will smoothly operate the data management through cooperation with existing culture centers and various cultural organizations. Second, it appears that a plan will be needed to set up all the data including the ones owned by libraries, local administrative agencies, individuals and other competent agencies in online database so that they are easily available to the public and always available in the libraries because there are a lot of data which cannot be moved to other place and it is actually difficult to concentrate and set up all the data to those libraries.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.11
• /
• pp.723-729
• /
• 2014

In this paper, we derive the average repair bandwidth and/or read cost for arbitrary repairable linear code ensembles. The repair bandwidth and read cost are the required amount of data and access number of nodes to restore a failed node, respectively. Here, the repairable linear code ensemble is given by such parameters as the number k of data symbols, the number m of parity symbols, and their degree distributions. We further assume that the code is systematic, and no other constraint is assumed, except possibly that the exact repair could be done by the parity check-sum relation with fully connected n=k+m storages. This enables one to apply the result of this paper directly to any randomly constructed codes with the above parameters, such as linear fountain codes. The final expression of the average repair read cost shows that it is highly dependent on the degree distribution of parity symbols, and also the values n and k.

• Journal of Korea Spatial Information System Society
• /
• v.6 no.1 s.11
• /
• pp.3-17
• /
• 2004

With the rapid growth of the Internet geographic information services through the WWW such as a location-based service and so on. Web GISs (Geographic Information Systems) have also come to be a cluster-based architecture like most other information systems. That is, in order to guarntee high quality of geographic information service without regard to the rapid growth of the number of users, web GISs need cluster-based architecture that will be cost-effective and have high availability and scalability. This paper proposes the design of the cluster-based web GIS with high availability and scalability. For this, each node within a cluster-based web GIS consists of main memory spatial databases which accomplish role of caching by using data declustering and the locality of spatial query. Not only simple region queries but also the proposed system processed spatial join queries effectively. Compare to the existing method. Parallel R-tree spatial join for a shared-Nothing architecture, the result of simulation experiments represents that the proposed spatial join method achieves improvement of performance respectively 23% and 30% as data quantity and nodes of cluster become large.

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.17 no.2
• /
• pp.117-128
• /
• 1999

A Simple tree-structured line simplification method, which exactly follows the Douglas-Peucker algorithm, has a strength for its simplification index to be involved into the hierarchical data structures. However, the hierarchy of simplification index, which is the core in a simple tree method, may not be always guaranteed. It is validated that the local property of line features in such global approaches as Douglas-Peucker algorithm is apt to be neglected and the construction of hierarchy with no thought of locality may entangle the hierarchy. This study designed a new approach, CALS(Convex hull Applied Line Simplification), a) to search critical points of line feature with convex hull search technique, b) to construct the hierarchical data structure based on these critical points, c) to simplify the line feature using multiple trees. CALS improved the spatial accuracy as compared with a simple tree method. Especially CALS was excellent in case of line features having the great extent of sinuosity.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.3
• /
• pp.235-244
• /
• 2000

This paper addresses a new method for constructing surface representation of 3D structures from a sequence of tomographic cross-sectional images, Firstly, we propose cell-boundary representation by transforming the cuberille space into cell space. A cell-boundary representation consists of a set of boundary cells with their 1-voxel configurations, and can compactly describe binary volumetric data. Secondly, to produce external surface from the cell-boundary representation, we define 19 modeling primitives (MP) including volumetric, planar and linear groups. Surface polygons are created from those modeling primitives using a simple table look-up operation. Comparing with previous method such as Marching Cube or PVP algorithm, our method is robust and does not make any crack in resulting surface model. Hardware implementation is expected to be easy because our algorithm is simple(scan-line), efficient and guarantees data locality in computation time.

• Korean Journal of Adult Nursing
• /
• v.12 no.3
• /
• pp.418-430
• /
• 2000

Nurses in today's challenging health care settings need to be skilled critical thinkers and clinical experts. The nurse must be able to use a broad knowledge base to mobilize resources, coordinate actions and evaluate outcomes in complex new situations. So the national licensing examination for registered nurses is change to improve the quality of professional competency of nurses in Korea. Prior to this, learning objectives should be developed and improved periodically. The purpose of this study is to describe the nursing competency to provide base line data for developing learning objectives in adult health nursing. This study was conducted by means of a questionnaire which was developed by the researcher after reviewing the literature. The questionnaire was based on learning objectives which were developed by a nation-wide nursing faculty majoring in adult health nursing. The subjects were 45 nurses in a middle level hospital. The collected data were treated using SPSS Win 7.5 Statistical Package so as to obtain such descriptive statistics as mean score, frequency, and to test reliability test, nonpar-Friedman test. To summarize the major findings in this study, it showed the scope of nursing competency and can guide the direction of study and methodological criteria to develop learning objectives. Recommendations for further research are: firstly, it is necessary to state learning objectives with learners' behavioral terminology; secondly, to overcome locality in scope of this study, there is a need to analyze with nation-wide sampling by an in-depth statistical analysis; thirdly, because the subjects of this study are mostly three-year graduate nurses, there is a need to compare this study with other studies of different subjects.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.6
• /
• pp.567-582
• /
• 2000

We propose a new way of managing flash memory space for flash memory-specific file system based on log-structured file system. Flash memory has attractive features such as non-volatility, and fast I/O speed, but it also suffers from inability to update in place and limited usage cycles. These drawbacks require many changes to conventional storage (file) management techniques. Our focus is on lowering cleaning cost and evenly utilizing flash memory cells while maintaining a balance between the two often-conflicting goals. The proposed cleaning method performs well especially when storage utilization and the degree of locality are high. The cleaning efficiency is enhanced by dynamically separating cold data and non-cold data. The second goal, cycle-leveling is achieved to the degree where the maximum difference between erase cycles is below the error range of the hardware. Simulation results show that the proposed method has significant benefit over naxve methods: maximum of 35% reduction in cleaning cost with even spreading writes across segments.

• Korean journal of food and cookery science
• /
• v.32 no.6
• /
• pp.734-744
• /
• 2016

Purpose: This study investigated the preference and awareness of consumers residing in the capital area with respect to South and North Korean regional cuisine to provide baseline data for developing effective commercialization strategies. Methods: This survey was conducted among adults over the age of 19 years who were residing in Seoul and Gyeonggi province area, and data analysis was performed using SPSS WIN 18.0. Results: Analysis of the survey participants' preference for South and North Korean regional cuisine showed that Hwanghae province had the highest preference by $4.35{\pm}1.72$ points, whereas Gangwon province had the lowest preference by $3.75{\pm}0.66$ points. Factorial analysis on general characteristics of Korean regional cuisine resulted in 2 factors - 'locality' and 'health'. Cluster analysis showed that participants could be sorted into two clusters by their awareness of Korean regional cuisine - 'the lower cognitive group' and 'the higher cognitive group'. Cluster analysis on the tourism commercialization strategy for Korean regional cuisines showed that 'the higher cognitive group' had significantly higher awareness regarding the following 3 items: 'merchandising strategy', 'popularization strategy' and 'marketing strategy' (p<0.001). Cluster analysis of the world commercialization strategy showed that 'the higher cognitive group' had significantly higher awareness regarding all items of the 'R&D support strategy' and 'Food culture promotion strategy' categories than the 'the lower cognitive group' (p<0.01). Conclusion: Popularization strategies such as value perception based on the well-being concept, and standardization of recipes; merchandising strategies based on storytelling; and food and culture promotional strategies such as Korean cooking classes and food tasting events, were rated as effective commercialization strategies to increase the popularity of Korean regional cuisine.

• The Transactions of the Korea Information Processing Society
• /
• v.2 no.5
• /
• pp.677-690
• /
• 1995

In this paper, we propose the high efficiency data compression capable of error control using block-sorting, move to front(MTF) and arithmetic code with variable length in to fixed out. First, the substring with is parsed into length N is shifted one by one symbol. The cyclic shifted rows are sorted in lexicographical order. Second, the MTF technique is applied to get the reference of locality in the sorted substring. Then the preprocessed sequence is coded using VF(variable to fixed) arithmetic code which can be limited the error propagation in one codeword. The key point is how to split the fixed length codeword in proportion to symbol probabilities in VF arithmetic code. We develop the new VF arithmetic coding that split completely the codeword set for arbitrary source alphabet. In addition to, an extended representation for symbol probability is designed by using recursive Gray conversion. The performance of proposed method is compared with other well-known source coding methods with respect to entropy, compression ratio and coding times.

• Journal of the Korean Association of Geographic Information Studies
• /
• v.12 no.3
• /
• pp.116-127
• /
• 2009

One of the criteria provided by the law to spatially determine the zones to levy the so-called development impact fee requires that the increase rate of the development permit should exceed that of the entire locality by more than 20 percent. Since the permits are issued to scattered parcels, however, it renders significant difficulties in accurately figuring out the finite local areas that exceed such legal criteria. This study, in this context, tries to join the development permit time-series data with the Korea Land Information System (KLIS) so that, with the aid of the landform layer and existing infrastructure layer, it could pinpoint the local area where the development activities are concentrating. Taking a sector in Yangpyong County as the case, the study demonstrates the methods to designate the zone by processing the permit information data.