• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.6
• /
• pp.600-613
• /
• 2018

The purpose of this research was to introduce a network analysis method for analyzing the recent trend of the flexible solar cell using a scholarly database. Based on the five years from 2013 to 2017, we used centrality analysis of research papers via measurement of degree centrality, closeness centrality, and betweenness centrality. The results of network analysis show that cell has a centrality value above 0.8, which means that cell is connected with 80% of the total keywords, so it is recognized as the center of flexible solar cell research. The analysis results also indicate that perovskite and copper indium gallium diselenide (CuInGaSe2, or CIGS) are the center of the subgroup for cell. We recognize that the result refers to recent new technology called the CIGS/perovskite tandem solar cell. We hope that the network analysis method will be the appropriate and precise tool for technology and research planning via elaboration and optimization.

• Journal of KIISE:Databases
• /
• v.27 no.1
• /
• pp.64-78
• /
• 2000

In this paper, we design and implement a system for managing domain specific thesauri, where object-oriented paradigm is applied to thesaurus construction, concept browsing and query-based reference. This system provides an objected-oriented mechanism to assist domain experts in constructing thesauri; it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain eIn this paper, we design and implement a system for managing domain specific thesauri, where object oriented paradigm is applied to thesaurus construction, concept browsing and query based reference. This system provides an objected mechanism to assist domain experts in constructing thesauri: it determines a considerable part of relationship degrees between terms by inheritance and supplies domain experts with information available from a thesaurus being constructed. This information is especially useful to enforce consistency between the hierarchies of a thesaurus, each constructed by different experts in different sites through cooperation. It may minimize the burden of domain experts caused from the exhaustive specification of individual relationship. This system also provides an abstracted browsing and a query based reference, which allow users to easily verify thesaurus terms before they are used in usual boolean queries. The verification is made by actively searching for them in the thesaurus. Reference queries and abstracted browsing views facilitate this searching. The facility is indispensable especially when precision counts for much.

• Journal of KIISE:Databases
• /
• v.35 no.6
• /
• pp.459-468
• /
• 2008

A data stream which is a massive unbounded sequence of data elements continuously generated at a rapid rate. Many recent research activities for emerging applications often need to deal with the data stream. Such applications can be web click monitoring, sensor data processing, network traffic analysis. telephone records and multi-media data. For this. data processing over a data stream are not performed on the stored data but performed the newly updated data with pre-registered queries, and then return a result immediately or periodically. Recently, many studies are focused on dealing with a data stream more than a stored data set. Especially. there are many researches to optimize continuous queries in order to perform them efficiently. This paper proposes a query optimization algorithm to manage continuous query which has multiple join operators(Multi-way join) over data streams. It is called by an Extended Greedy query optimization based on a greedy algorithm. It defines a join cost by a required operation to compute a join and an operation to process a result and then stores all information for computing join cost and join cost in the statistics catalog. To overcome a weak point of greedy algorithm which has poor performance, the algorithm selects the set of operators with a small lay, instead of operator with the smallest cost. The set is influenced the accuracy and execution time of the algorithm and can be controlled adaptively by two user-defined values. Experiment results illustrate the performance of the EGA algorithm in various stream environments.

• The Journal of the Korea Contents Association
• /
• v.11 no.3
• /
• pp.26-35
• /
• 2011

In these days, internet environment are very quickly development as well on-line service have been using a online for the mission critical business around the world. As the amount of information to be processed by computers has recently been increased there has been cluster computing systems developed by connecting workstations server using high speed networks for high availability. but cluster computing technology are limited for a lot of IT resources. So, grid computing is an expanded technology of distributed computing technology to use low-cost and high-performance computing power in various fields. Although the purpose of Grid computing focuses on large-scale resource sharing, innovative applications, and in some case, high-performance orientation, it has been used as conventional distributed computing environment like clustered computer until now because grid middleware does not have common sharable information system. In order to use grid computing environment efficiently which consists of various grid middleware, it is necessary to have application-independent information system which can share information description and services, and expand them easily. This paper proposed new database architecture and load balancing for high availability through Grid technology.

• Journal of the Korea Society of Computer and Information
• /
• v.16 no.3
• /
• pp.17-25
• /
• 2011

Green IT, composed term with Green and Information Technology(IT), use IT for energy savings and carbon emission reductions. Green IT went beyond the scope of greening IT, and recently it's concept is expanded as far as counterplan of climate change including greening other industries by IT. 85% of total greenhouse gas emissions from the energy sector and 20% of them comes from transport parts, so it is time to research IT for automotive industry. In this paper, we take up the knowledge based fuzzy logic to provide life cycle analysis associated with greenhouse gas emissions for industry produced warranty claims frequently such as automobile industry. We propose a analysis method of warranty claims using expert knowledge about the warranty in car exhaust systems related to greenhouse gas emissions, past test results of malfunction, analysis of past field data, and warranty data. Furthermore, we propose life knowledge-based GWS (Greenery Warranty System). We demonstrate the applicability of IT in eco-friendly automotive industry by implementing knowledge-based fuzzy logic and applying.

• Journal of KIISE:Databases
• /
• v.28 no.3
• /
• pp.468-483
• /
• 2001

In order to enhance the performance, cursor stability, which is a variant of isolation lvel 2 in relational DBMSs, has been widely used in place of isolation level 3, which uses strict two phase locking. However, cursor stability is much less usable in object-relational DBMSs (ORDBMSs) because navigational applications in ORDBMSs can suffer from critical inconsistency problems such as dangling pointers, lost updates, and reading inconsistent complex objects. In this paper, we propose a new isolation level, navigation stability, that prevents the inconsistency problems of cursor stability for navigational applications, while avoiding significant degradation of the concurrency of level 3. First, we analyze the inconsistency problems of cursor stability for navigational applications. Second, we define navigation stability as an extension of cursor stability and show that it solves those inconsistency problems of cursor stability in ORDBMSs. For workloads consisting of transactions of long duration, compared with level 3, the throughput of navigation stability is enhanced by up to 200%; the average response time reduced by as much as 55%; and the abort ratio reduced by as much as 77%. From these results, we conclude that navigation stability is a useful isolation level in ORDBMSs that can be used in place of isolation level 3 to improve the performance and concurrency without significantly sacrificing consistency.

• Journal of KIISE:Databases
• /
• v.33 no.6
• /
• pp.578-589
• /
• 2006

Owing to the proliferation of Radio Frequency Identification (RFID) technologies which is being watched as a core technology of ubiquitous computing, applications which offer convenience to people using RFID technologies are more and more increased. To easily develop these applications, a middleware system which acts as a bridge between RFID hardware and application is essential. In this paper, we propose a novel XML-based RFID middleware system called UbiCore (Ubiquitous Core). UbiCore has following features: First, UbiCore employs its own query language called XQueryStream (XQuery for Stream Data) which is originated from XQuery. Second, UbiCore has the preprocessing phase called pre-filtering prior to query evaluation and reuses the intermediate result of previous evaluation to speed up the processing of RFID tag data stream. Third, UbiCore supports query on both continuously generated stream data and archived historical data. And last, UbiCore offers a distinct markup language called Context-driven Service Markup Language (CSML) to easily specify the linking information between context and service.

• Journal of KIISE:Databases
• /
• v.37 no.3
• /
• pp.127-136
• /
• 2010

With rapid growth of information and computer communication technologies, the numbers of digital documents including multimedia data have been recently exploded. In particular, news video database and news video mining have became the subject of extensive research, to develop effective and efficient tools for manipulation and analysis of news videos, because of their information richness. However, many research focus on browsing, retrieval and summarization of news videos. Up to date, it is a relatively early state to discover and to analyse the plentiful latent semantic knowledge from news videos. In this paper, we propose the news video mining system based on multi-modal approach and text mining, which uses the visual-textual information of news video clips and their scripts. The proposed system systematically constructs a taxonomy of news video stories in automatic manner with hierarchical clustering algorithm which is one of text mining methods. Then, it multilaterally analyzes the topics of news video stories by means of time-cluster trend graph, weighted cluster growth index, and network analysis. To clarify the validity of our approach, we analyzed the news videos on "The Second Summit of South and North Korea in 2007".

• Journal of KIISE:Databases
• /
• v.33 no.2
• /
• pp.175-187
• /
• 2006

The data cube is an aggregation operator that computes group-bys for all possible combination of dimension attributes. %on the number of the dimension attributes is n, a data cube computes $2^n$ group-bys. Each group-by in a data cube is called a cuboid. Data cubes are often precomputed and stored as materialized views in data warehouses. These data cubes need to be updated when source relation change. The incremental maintenance of a data cube is to compute and propagate only its changes. To compute the change of a data cube of $2^n$ cuboids, previous works compute a delta cube that has the same number of cuboids as the original data cube. Thus, as the number of dimension attributes increases, the cost of computing a delta cube increases significantly. Each cuboid in a delta cube is called a delta cuboid. In this paper. we propose an incremental cube maintenance method that can maintain a data cube by using only $_nC_{{\lceil}n/2{\rceil}}$ delta cuboids. As a result, the cost of computing a delta cube is substantially reduced. Through various experiments, we show the performance advantages of our method over previous methods.

• Journal of KIISE:Databases
• /
• v.33 no.1
• /
• pp.12-31
• /
• 2006

The n-gram inverted index has two major advantages: language-neutral and error-tolerant. Due to these advantages, it has been widely used in information retrieval or in similar sequence matching for DNA and Protein databases. Nevertheless, the n-gram inverted index also has drawbacks: the size tends to be very large, and the performance of queries tends to be bad. In this paper, we propose the two-level n-gram inverted index (simply, the n-gram/2L index) that significantly reduces the size and improves the query performance while preserving the advantages of the n-gram inverted index. The proposed index eliminates the redundancy of the position information that exists in the n-gram inverted index. The proposed index is constructed in two steps: 1) extracting subsequences of length m from documents and 2) extracting n-grams from those subsequences. We formally prove that this two-step construction is identical to the relational normalization process that removes the redundancy caused by a non-trivial multivalued dependency. The n-gram/2L index has excellent properties: 1) it significantly reduces the size and improves the Performance compared with the n-gram inverted index with these improvements becoming more marked as the database size gets larger; 2) the query processing time increases only very slightly as the query length gets longer. Experimental results using databases of 1 GBytes show that the size of the n-gram/2L index is reduced by up to 1.9${\~}$2.7 times and, at the same time, the query performance is improved by up to 13.1 times compared with those of the n-gram inverted index.