• Journal of the Korean BIBLIA Society for library and Information Science
• /
• v.25 no.1
• /
• pp.295-318
• /
• 2014

The purpose of this study is to analyze the intellectual structure of reading studies by using Co-Word Analysis based on the mixed weight in which the level of academic journals and the position of keywords are calculated. To achieve it, 838 academic articles relating to reading studies from KCI during the period from 2003 to 2012 were retrieved and 56 keywords were extracted. The results of clustering analysis, MDS, network analysis are that the network based on the mixed weight has a better performance in above three methods and reading studies can be divided into 4 bigger divisions and 11 subdivisions. Finally, the result of document analysis shows reading studies changes its research tendency from theoretical studies to empirical studies.

• Journal of KIISE:Software and Applications
• /
• v.36 no.9
• /
• pp.749-757
• /
• 2009

A Internet user can easily access to the target information by web searching using some key-words or categories in the present Internet environment. When some meta-data which represent attributes of several data structures well are used, then more accurate result which is matched with the intention of users can be provided. This study proposes a multiple dimensional vector tagging method for the small web user group who interest in maintaining and sharing the bookmark for common interesting topics. The proposed method uses vector tag method for increasing the effect of categorization, management, and retrieval of target information. The vector tag composes with two or more components of the user defined priority. The basic vector space is created time of information and reference value. The calculated vector value shows the usability of information and became the metric of ranking. The ranking accuracy of the proposed method compares with that of a simply link structure, The proposed method shows better results for corresponding the intention of users.

• Journal of Korea Multimedia Society
• /
• v.14 no.5
• /
• pp.669-680
• /
• 2011

R-trees are widely used in various areas such as geographical information systems, CAD systems and spatial databases in order to efficiently index multi-dimensional data. As data sets used in these areas grow in size and complexity, however, range query operations on R-tree are needed to be further faster to meet the area-specific constraints. To address this problem, there have been various research efforts to develop strategies for acceleration query processing on R-tree by using the buffer mechanism or parallelizing the query processing on R-tree through multiple disks and processors. As a part of the strategies, approaches which parallelize query processing on R-tree through Graphics Processor Units(GPUs) have been explored. The use of GPUs may guarantee improved performances resulting from faster calculations and reduced disk accesses but may cause additional overhead costs caused by high memory access latencies and low data exchange rate between GPUs and the CPU. In this paper, to address the overhead problems and to adapt GPUs efficiently, we propose a novel approach which uses a GPU as a buffer to parallelize query processing on R-tree. The use of buffer algorithm can give improved performance by reducing the number of disk access and maximizing coalesced memory access resulting in minimizing GPU memory access latencies. Through the extensive performance studies, we observed that the proposed approach achieved up to 5 times higher query performance than the original CPU-based R-trees.

• Korean Journal of Cognitive Science
• /
• v.15 no.2
• /
• pp.1-15
• /
• 2004

The structure of sensibility from motion was developed for the purpose of understanding relationship between sensibilities and physical factors to apply it to dynamic visual display. Seventy adjectives were collected by assessing adequacy to express sensibilities from motion and reporting sensibilities recalled from dynamic displays with achromatic color. Various motion displays with a moving single dot were rated according to the degree of sensibility corresponding to each adjective, on the basis of the Semantic Differential (SD) method. The results of assessment were analyzed by means of the factor analysis to reduce 70 words into 19 fundamental sensibilities from motion. The Multidimensional Scaling (MDS) technique constructed the sensibility space in motion, in which 19 sensibilities were scattered with two dimensions, active-passive and bright-dark Motion types systemically varied in kinematic factors were placed on the two-dimensional space of motion sensibility, in order to analyze important variables affecting sensibility from motion. Patterns of placement indicate that speed and both of cycle and amplitude in trajectories tend to partially determine sensibility. Although color and motion affected sensibility according to the in dimensions, it seemed that combination of motion and color made each have dominant effect individually in a certain sensibility dimension, motion to active-passive and color to bright-dark.

• Journal of the HCI Society of Korea
• /
• v.9 no.2
• /
• pp.23-31
• /
• 2014

A variety of writing support systems focus on the information management or the feature analysis of the commercially successful narrative texts. In these approaches, the reader's role in the narrative creating process is overlooked. During a writing work, an author anticipates the reader's response or expectation to the narrative and he/she organizes the narrative either along or against the prediction about readers. Assessing and controlling the reader's comprehension in the development of events influences the aesthetic quality of the narrative. In this paper, we suggest a writing support system to visualize and adjust the characteristics of a narrative text related to the reader's comprehension, which is theoretically based on the narrative structure model and the event-indexing situation model. Under the development of the support system, we designed an interactive framework to create events as the basic units of story and arrange them onto both story- and discourse-time axes. Using this framework, we analyzed the organization of events about an actual film narrative. We also proposed both the continuity of the situational dimensions and the cognitive complexity as the characteristics to affect the reader's comprehension, hence we devised a method to visualize and evaluate them. This method was applied to the actual film narrative and the result was discussed in the aspect of the features of the narrative and wiring support strategies.

• The KIPS Transactions:PartD
• /
• v.13D no.4 s.107
• /
• pp.463-476
• /
• 2006

R-trees have been traditionally optimized for the I/O performance with the disk page as the tree node. Recently, researchers have proposed cache-conscious variations of R-trees optimized for the CPU cache performance in main memory environments, where the node size is several cache lines wide and more entries are packed in a node by compressing MBR keys. However, because there is a big difference between the node sizes of two types of R-trees, disk-optimized R-trees show poor cache performance while cache-optimized R-trees exhibit poor disk performance. In this paper, we propose a cache and disk optimized R-tree, called the PR-tree (Prefetching R-tree). For the cache performance, the node size of the PR-tree is wider than a cache line, and the prefetch instruction is used to reduce the number of cache misses. For the I/O performance, the nodes of the PR-tree are fitted into one disk page. We represent the detailed analysis of cache misses for range queries, and enumerate all the reasonable in-page leaf and nonleaf node sizes, and heights of in-page trees to figure out tree parameters for best cache and I/O performance. The PR-tree that we propose achieves better cache performance than the disk-optimized R-tree: a factor of 3.5-15.1 improvement for one-by-one insertions, 6.5-15.1 improvement for deletions, 1.3-1.9 improvement for range queries, and 2.7-9.7 improvement for k-nearest neighbor queries. All experimental results do not show notable declines of the I/O performance.

• Journal of KIISE
• /
• v.42 no.4
• /
• pp.522-529
• /
• 2015

Ever since the R-tree was proposed to index multi-dimensional data, many efforts have been made to improve its query performances. One common trend to improve query performance is to parallelize query processing with the use of multi-core architectures. To this end, a GPU-base R-tree has been recently proposed. However, even though a GPU-based R-tree can exhibit an improvement in query performance, it is limited in its ability to handle large volumes of data because GPUs have limited physical memory. To address this problem, we propose MGR-tree (Multi-GPU R-tree), which can manage large volumes of data by dividing nodes into multiple GPUs. Our experiments show that MGR-tree is up to 9.1 times faster than a sequential search on a GPU and up to 1.6 times faster than a conventional GPU-based R-tree.

• Proceedings of the Korean Information Science Society Conference
• /
• 2012.06b
• /
• pp.178-180
• /
• 2012

협업은 둘 이상의 사람들이 하나의 업무 또는 목적을 달성하기위해 공동으로 협력하여 일하는 것이다. 최근 개인 및 조직 간 협업 범위가 공동분석, 데이터 연계, 서비스 조합 등으로 확장되고 대용량 데이터 공유 및 실시간 연계분석 활동이 증대되면서 협업 지향적인 시스템 설계와 개발이 중요시 되고 있다. 특히 스마트워크와 지능화된 협업 기반은 데이터, 프로세스, 서비스, 사람 간의 다차원 연계와 실시간 활용, 의미 기반의 기계적 협력을 전재로 하고 있다. 본 연구에서는 Data, Process, Service, People 측면의 4가지 계층으로 전사적 자원을 설계하고 메타 메타데이터 기반의 온톨로지 분석을 통해 자원 간의 연계와 조합을 지원하는 시스템을 설계했다. Data 계층은 프로세스별 Input, Output 정보를 식별하여 Data의 메타 정보를 정의하고 이를 검색 에이전트가 색인하여 모델링에 참조할수록 한다. Process 계층은 BPMN모델을 확장한 exCPM의 개선 모델을 바탕으로 프로세스를 수행주체 간, 정보공유측면에서 프로세스를 분석했다. Service 계층은 협업지향적인 프로세스를 구성하는 컴포넌트를 서비스로 인식하고 프로파일을 통해 협업을 위한 검색과 프로세스를 연계지원하도록 설계 했다. 마지막으로 People계층은 자원, 프로세스, 서비스 등 시스템에 관여하는 참여자들의 메타정보를 정의하고 이를 온톨로지 기반의 모델에 통합하여 자동 검색되도록 설계했다. 이를 통해 프로세스와 서비스 측면에서 협업을 요구하는 에이전트와 일반 검색 사용자들이 프로세스 간 협업 자원을 파악하고 상호 관계를 분석할 수 있도록 하는 한편, 프로세스를 지원하는 컴포넌트와 서비스 간의 자동적인 조합을 통해 통합적 자원 협력과 실시간 협업 지원 기반을 제시했다.

• Journal of KIISE:Databases
• /
• v.33 no.7
• /
• pp.693-707
• /
• 2006

To improve performance using a multidimensional index in similar sequence matching, we transform a high-dimensional sequence to a low-dimensional sequence, and then construct a low-dimensional MBR that contains multiple transformed sequences. In this paper we propose a formal method that transforms a high-dimensional MBR itself to a low-dimensional MBR, and show that this method significantly reduces the number of lower-dimensional transformations. To achieve this goal, we first formally define the new notion of MBR-safe. We say that a transform is MBR-safe if a low-dimensional MBR to which a high-dimensional MBR is transformed by the transform contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. We then propose two MBR-safe transforms based on DFT and DCT, the most representative lower-dimensional transformations. For this, we prove the traditional DFT and DCT are not MBR-safe, and define new transforms, called mbrDFT and mbrDCT, by extending DFT and DCT, respectively. We also formally prove these mbrDFT and mbrDCT are MBR-safe. Moreover, we show that mbrDFT(or mbrDCT) is optimal among the DFT-based(or DCT-based) MBR-safe transforms that directly convert a high-dimensional MBR itself into a low-dimensional MBR. Analytical and experimental results show that the proposed mbrDFT and mbrDCT reduce the number of lower-dimensional transformations drastically, and improve performance significantly compared with the $na\"{\i}ve$ transforms. These results indicate that our MBR- safe transforms provides a useful framework for a variety of applications that require the lower-dimensional transformation of high-dimensional MBRs.

• Proceedings of the Korea Society of Poultry Science Conference
• /
• 2003.07b
• /
• pp.67-88
• /
• 2003

The consumption of poultry meat (chicken and turkey) grew the most during the past few decades due to several contributing factors such as low price. product research and development. favorable meat characteristics, responsive to consumer needs, vertical integration and industry consolidation, new processing equipments and technology, and aggressive marketing. The major processing technologies developed and used in chicken processing include forming/restructuring, tumbling, curing, smoking, massaging, injection, marination, emulsifying, breading, battering, shredding, dicing, and individual quick freezing. These processing technologies were applied to various parts of chicken including whole carcass. Product developments using breast, thigh, and mechanically separated chicken meat greatly increased the utilization of poultry meat. Chicken breast became the symbol of healthy food, which made chicken meat as the most frequent menu items in restaurants. However, the use of and product development for dark meat, which includes thigh, drum, and chicken wings were rather limited due to comparatively high fat content in dark meat. Majority of chicken are currently sold as further processed ready-to-cook or ready-to-eat forms. Major quality issues in chicken meat include pink color problems in uncured cooked breast, lipid oxidation and off-flavor, tenderness PSE breast, and food safety. Research and development to ensure the safety and quality of raw and cooked chicken meat using new processing technologies will be the major issues in the future as they are now. Especially, the application of irradiation in raw and cooked chicken meat products will be increased dramatically within next 5 years. The market share of ready-to-eat cooked meat products will be increased. More portion controlled finished products, dark meat products, and organic and ethnic products with various packaging approaches will also be introduced.