• Journal of the Korean Institute of Intelligent Systems
• /
• v.24 no.3
• /
• pp.285-291
• /
• 2014

Recently, many researchers have paid attention to the study on generation of new linked data from tables by using linked open data (e.g. RDF, OWL). This paper proposes a new method for such generation of linked data. A pattern-based method intrinsically has a conflict problem among patterns. For instance, several patterns, mapping a single header of a table into different properties of linked data, conflict with each others. Existing studies have sacrificed precision by applying a statistically dominant pattern or have ignored conflicting patterns to increase precision. The proposed method finds appropriate patterns for all headers in a given table by connecting patterns applied to the headers. Experiments using DBPedia and Wikipedia showed results that conflicts of patterns are effectively resolved by the proposed method.

• Journal of Korea Multimedia Society
• /
• v.9 no.11
• /
• pp.1381-1394
• /
• 2006

Generation methods of data cube have been studied for many years in data warehouse which supports decision making using stored data. There are two previous studies, one is multi-way array algorithm and the other is H-cubing algorithm which is based on the hyper-tree. The multi-way array algorithm stores all aggregation data in arrays, so if the base data is increased, the size of memory is also grow. The H-cubing algorithm which is based on the hyper-tree stores all tuples in one tree so the construction cost is increased. In this paper, we present an efficient data cube generation method based on hash table using weight mapping table and record hash table. Because the proposed method uses a hash table, the generation cost of data cube is decreased and the memory usage is also decreased. In the performance study, we shows that the proposed method provides faster search operation time and make data cube generation operate more efficiently.

• Progress in Medical Physics
• /
• v.16 no.1
• /
• pp.39-46
• /
• 2005

For the QA of IMRT treatment of head and neck cancer by using M3 (BrainLAB Inc. Germany), it is not easy to measure delivery dose exactly because the dose attenuation appears by the couch according to the position of table and gantry. In order to solve this problem, we fabricated head and neck phantom which would be implemented on the couch mount of Brain Lab Inc. We investigated dose attenuation by the couch and found the difference of dose distribution by the couch, in the applying this phantom to the clinic. After measurement, we found that point dose attenuation was 35% at maximum and dose difference was 5.4% for a point dose measurement of actual patient quality assurance plan.

• The Journal of the Korea Contents Association
• /
• v.11 no.5
• /
• pp.194-204
• /
• 2011

Tabletop display can take the benefits of the interactive device due to its possible user friendly input and display facilities simultaneously. Using this device, immersive edutainment content is effectively implemented with the convenient interactive interface. So considering this usefulness, tabletop display can be a very efficient device for constructing the edutainment system. In this paper, we describe a digitalized cooking edutainment contents based on the tabletop display interface. Enjoying our contents, we use the intuitive touch gestures for handling a variety of cooking actions. In the education effects such as the immersive strengthening and co-operation, the proposed system is more efficient interface than any other existing system. We implement the contents with the tabletop display and make sure about the efficiency of our proposed system. In the future, we will add more gestures to enhance the applicability of the intuitive interactive interface.

• The Journal of Society for e-Business Studies
• /
• v.15 no.4
• /
• pp.21-31
• /
• 2010

Recently e-business such as online financial trade and online shopping using mobile computes are widely spread. Most of mobile computers use NAND flash memory-based storage devices for storing data. Flash memory storage devices use a software called flash translation layer to translate logical address from a file system to physical address of flash memory by using mapping tables. The legacy FTLs have a problem that they must maintain very large mapping tables in the RAM. In order to address this issues, in this paper, we proposed a new caching scheme of mapping tables. We showed through the trace-driven simulations that the proposed caching scheme reduces the space overhead dramatically but does not increase the time overhead. In the case of online transaction workload in e-business environment, in particular, the proposed scheme manifests better performance in reducing the space overhead.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.5
• /
• pp.179-186
• /
• 2014

Current networks such as social network, web page link, traffic network are big data which have the large numbers of nodes and edges. Many applications such as social network services and navigation systems use these networks. Since big networks are not fit into the memory, existing in-memory based analysis techniques cannot provide high performance. Frontier-Expansion-Merge (FEM) framework for graph search operations using three corresponding operators in the relational database (RDB) context. FEM exploits an index table that stores pre-computed partial paths for efficient shortest path discovery. However, the index table of FEM has low hit ratio because the indices are determined by distances of indices rather than the possibility of containing a shortest path. In this paper, we propose an method that construct index table using high degree nodes having high hit ratio for efficient shortest path discovery. We experimentally verify that our index technique can support shortest path discovery efficiently in real-world datasets.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.10
• /
• pp.2079-2087
• /
• 2009

This paper describes the iTABLE tabletop tiled display system which is designed for displaying high-resolution scientific visualization. Unlike other tabletop systems that typically use a projection-based single display, iTABLE system is suitable for visualizing and sharing high-resolution data, and it is capable of facilitating group interaction with interactive data visualizations on a table and distributed collaborative visualizations with other tiled displays. First, it surveys prior works on tabletop and tiled display systems as well as scientific visualization, and it describes the design and implementation of iTABLE system, and middleware and an infrared camera-based tangible user interface designed for iTABLE system. It will then discuss some high-resolution scientific visualization applications developed for iTABLE followed by conclusions and future research directions.

• KSCI Review
• /
• v.14 no.2
• /
• pp.185-197
• /
• 2006

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row int the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table record in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.

• The KIPS Transactions:PartC
• /
• v.16C no.1
• /
• pp.73-82
• /
• 2009

The peers in the Chord method send messages periodically to keep the routing table updated. In a mobile P2P network, the peers in the Chord method should send messages more frequently to keep the routing table updated and reduce the failure of a request. However this results in increasing the overall network traffic. In our previous method, we proposed a method to reduce the update load of the routing table in the existing Chord by updating it in a reactive way, but there were disadvantages to generate more traffic if the number of requests per second increases and to have more delay in the request processing time than the existing Chord. In this paper, we propose an improved method of reactive routing table update to reduce the request processing time. In the proposed method, when a data request comes, the routing table is updated only if its information is not recent while it is always updated in the previous method. We perform experiments using Chord simulator (I3) made by UC Berkely. The experimental results show the performance improvement of the proposed method compared to the existing method.

• Journal of the Korea Society of Computer and Information
• /
• v.12 no.1 s.45
• /
• pp.177-188
• /
• 2007

A star schema consists of a central fact table, which is surrounded by one or more dimension tables. Each row in the fact table contains a multi-part primary key(or a composite foreign key) along with one or more columns containing various facts about the data stored in the row. Each of the composit foreign key components is related to a dimensional table. The combination of keys in the fact table creates a composite foreign key that is unique to the fact table record. The composite foreign key, however, is rarely unique to the fact table retold in real-world applications, particularly in financial applications. In order to make the composite foreign key be the determinant in real-world application, some precalculation might be performed in the SQL relational database, and cached in the OLAP database. However, there are many drawbacks to this approach. In some cases, this approach might give users the wrong results. In this paper, an approach to fact table modeling and related MDX query composing, which can be used in real-world applications without performing any precalculation and gives users the correct results, is proposed.