• 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.