• Journal of KIISE:Databases
• /
• v.27 no.4
• /
• pp.549-561
• /
• 2000

In database management systems(DBMSs), partial rollback is a useful facility that cancels part of the executed operations upon user's requests without a total rollback. Many relational DBMSs(RDBMSs) provide this facility, However, object-orientccd DBMSs (OODBMSs) cannot utilize the previous recovery scl18lne of partial rollback usccd in (RDBMSs) since, unlike RDBMSs, they use a dual buffer consisting of an object buffer and a page buffer. Therefore, a new recovery scheme is required that rolls back the data efficiently in the dual buffer. We propose four partial rollback schemes in OODBMSs that use a dual buffer. We classify the proposed schemes into the single buffer based partial rollback scheme and the dual buffer based partial rollback scheme according to the number of buffers used for partial rollback processing. We further classify them into Uthe page buffer based partial rollback scheme, 2)the object buffccr based partial rollback scheme, 3)the dual buffer based partial rollback scheme using soft log, and 4)the dual buffer based partial rollback scheme using shadows. We evaluate the performance by mathematical analysis and experiments. The results show that the dual buffer based partial rollback scheme using shadows provides the best performance.

• The Journal of the Korea Contents Association
• /
• v.14 no.1
• /
• pp.119-127
• /
• 2014

As keen marketing competition for increasing corporate image has been begun, the creative level of annual report design, which is deeply involved with investment, has became a fundamental measure of corporate value. Good commercial design has to have both practical and aesthetic aspect. For make more creative annual report project. it's worth to find world design trend in practical way. The point of study focuses and sorts on physical properties of out-put works by the view point of editorial design, and tries to find the possibility of common design style. It analyzes key message, pagination plan and feature pages of 2013 ARC awarded annual report works in interior design category. The visual image and typographic style study of awarded works will help planner and designer who develop annual report project, because this research data reduces their process. Then it's possible to have more opportunities to create project and supports background material for making a presentation for clients.

• Cartoon and Animation Studies
• /
• s.24
• /
• pp.49-64
• /
• 2011

Comics is sequential art. In comics, the story is developped by its sequential panels which have their own sizes and sites. Accordingly, comics is closer to 'space' art than text. The reading order in a page of comic book follows the human long-standing reading habit, and it is the same as that of textbook. When we read a korean comic book, our eyes run from left to right, and downward on the page. But some factors related to panels or comic structures can change the typical reading order. Meanwhile, breaking the typical reading order is easier in the "infinite canvas" by reason of unconstrained spatial composition. This paper introduces the factors that change the comic book readers' reading order and proposes a tablet PC comic book layout which includes an arbitrary reading path using interaction

• The KIPS Transactions:PartB
• /
• v.13B no.5 s.108
• /
• pp.533-540
• /
• 2006

The semantic web environment promise semantic search of heterogeneous data from distributed web page. Semantic search would resuit in an overwhelming number of results for users is increased, therefore elevating the need for appropriate personalized ranking schemes. Culture Finder helps semantic web agents obtain personalized culture information. It extracts meta data for each web page(culture news, culture performance, culture exhibition), perform semantic search and compute result ranking point to base user profile. In order to work efficient, Culture Finder uses five major technique: Machine learning technique for generating user profile from user search behavior and meta data repository, an efficient semantic search system for semantic web agent, query analysis for representing query and query result, personalized ranking method to provide suitable search result to user, upper ontology for generating meta data. In this paper, we also present the structure used in the Culture Finder to support personalized search service.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.12B
• /
• pp.1407-1417
• /
• 2009

We propose a e-document management system that can provide segmented page information on a document according to different levels of authority from access control environment. The proposed system creates hierarchy identifier using a one-way hash chain and therefore does not need to own key information for all users as in existing system. Also by creating group keys by compounding hash chain hierarchy identifier with randomly formed group identifier, the system can flexibly respond to dynamic changes from group member movements while at the same time resolving the problems of key formation and management in document encoding technique using symmetric key for each page. Lastly as a result of comparative analysis through an experiment with existing e-document management systems, the proposed system showed superiority in the efficiency of encoding and decoding document and the speed of encoding and decoding by the pages.

• Journal of Digital Contents Society
• /
• v.9 no.4
• /
• pp.583-590
• /
• 2008

These days Mobile web Full Browsing is getting the issues which displays whole Web Site contents in browser of mobile device. Since the size of browser is too small, in this paper, it recommends a new method that web users can choose variable service and web contents for mobile contents by adopting new platform. The mobile web would be generated automatically to apply the web 2.0 through the web users pattern. The platform is that no one belong in data, anyone can use this, anyone can modify the data, so variable users can create new contents for proper mobile web. It is the Mobilder application which can build Mobile web pages. Any User can make mobile web pages with Mobilder Before producing the program, in this paper, it will build mobile web pages by web users navigation pattern. After analysing the web users pattern, we will produce the mobile web pages through this.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.6
• /
• pp.414-423
• /
• 2014

The number and size of resource constituting the web page has been increasing steadily, and this circumstance leads to rapidly falling quality of web service in mobile network that offer relatively higher delay. Moreover, Improving the quality of a web services protocol is difficult to provide network function because the current network architecture has closed structure. In this paper, we suggest schemes to enhance web performance in mobile network, which are Check Coded DOM scheme and Functional JavaScript Transmission scheme, and then try to seek idea which can be provided suggested schemes as a network function using NFV(Network Function Virtualization). For the performance evaluation and analysis about the suggested schemes, we perform network simulation using SMPL library. We confirm that suggested schemes offer better performance in term of page loading time, the number of message and the amount of traffic in the network than HTTP Protocol.

• Journal of KIISE:Computer Systems and Theory
• /
• v.36 no.5
• /
• pp.422-428
• /
• 2009

NAND flash memory is widely used in embedded systems because of many attractive features, such as small size, light weight, low power consumption and fast access speed. However, it requires garbage collection, which includes erase operations. Erase operation is slower than other operations. Further, a block has a limited erase lifetime (typically 100,000) after which a block becomes unusable. The proposed garbage collection policy focuses on minimizing the total number of erase operations, the deviation value of each block and the garbage collection time. NAND flash memory consists of pages of three types, such as valid pages, invalid pages and free pages. In order to achieve above goals, we use a page ratio to decide when to do garbage collection and to select the target victimblock. Additionally, we implement allocating method and group management method. Simulation results show that the proposed policy performs better than Greedy or CAT with the maximum rate 85% of reduction in the deviation value of the erase operations and 6% reduction in garbage collection time.

• Journal of KIISE
• /
• v.45 no.1
• /
• pp.61-68
• /
• 2018

The identification of genes that contribute to the prediction of prognosis in patients with cancer is one of the challenges in providing appropriate therapies. To find the prognostic genes, several classification models using gene expression data have been proposed. However, the prediction accuracy of cancer prognosis is limited due to the heterogeneity of cancer. In this paper, we integrate microarray data with biological network data using a modified PageRank algorithm to identify prognostic genes. We also predict the prognosis of patients with 6 cancer types (including breast carcinoma) using the K-Nearest Neighbor algorithm. Before we apply the modified PageRank, we separate samples by K-Means clustering to address the heterogeneity of cancer. The proposed algorithm showed better performance than traditional algorithms for prognosis. We were also able to identify cluster-specific biological processes using GO enrichment analysis.

• The Journal of the Korea Contents Association
• /
• v.5 no.2
• /
• pp.187-197
• /
• 2005

In this paper, we propose an extended TB-tree, called ETB-tree, which can improve the performance of an existing TB-tree proposed for indexing the trajectories of moving objects in Location-Based Service(LBS). The proposed ETB-tree directly accesses the preceding node by maintaining a direct table, called D-Table which contains the page number in disk and memory pointers pointing the leaf node with the first and last lines segment of moving objects. It can improve the insertion performance by quick searching the preceding node of a moving object and retrieval performance owing to accessing directly the corresponding trajectories In disk for the trajectory-based query. In addition, the ETB-tree provides consistency of a tree by reflecting a newly inserted line segment to the tree both in memory and disk. The experimental results show that the proposed indexing technique gains better performance than other traditional ones with respect to the insertion and retrieval of a trajectory query.