• Journal of the Korea Organic Resources Recycling Association
• /
• v.23 no.4
• /
• pp.40-51
• /
• 2015

This study is to estimate the viability of aerobic stabilization technology for reducing greenhouse gas (GHG) emissions from landfills in Korea. In this study, methane emissions were estimated by applying Landfill gas estimation model (LandGEM) to Y landfill in Korea. By comparison of an anaerobic condition (baseline) and an aerobic condition, the amount of $CO_2eq$ savings was calculated. The $CO_2eq$ savings take place inside the landfilled waste during aeration due to the conversion of previously anaerobic biodegradation to aerobic processes, releasing mainly $CO_2$. It was demonstrated that 86.6% of the total GHG emissions occurring under anaerobic conditions could be reduced by aerobic stabilization technology. This means the aerobic stabilization technology could reduce environmental contamination through early stabilization and GHG emissions considerably at the same time. Therefore, the aerobic stabilization technology is one of the optimal technologies that could be employed to domestic landfill sites to achieve sustainable landfill.

• Journal of the Korean Society for information Management
• /
• v.22 no.2 s.56
• /
• pp.125-145
• /
• 2005

This paper presents a semantic vector space retrieval model incorporating a word sense disambiguation algorithm in an attempt to improve retrieval effectiveness. Nine Korean homonyms are selected for the sense disambiguation and retrieval experiments. The total of approximately 120,000 news articles comprise the raw test collection and 18 queries including homonyms as query words are used for the retrieval experiments. A Naive Bayes classifier and EM algorithm representing supervised and unsupervised learning algorithms respectively are used for the disambiguation process. The Naive Bayes classifier achieved $92\%$ disambiguation accuracy. while the clustering performance of the EM algorithm is $67\%$ on the average. The retrieval effectiveness of the semantic vector space model incorporating the Naive Bayes classifier showed $39.6\%$ precision achieving about $7.4\%$ improvement. However, the retrieval effectiveness of the EM algorithm-based semantic retrieval is $3\%$ lower than the baseline retrieval without disambiguation. It is worth noting that the performances of disambiguation and retrieval depend on the distribution patterns of homonyms to be disambiguated as well as the characteristics of queries.

• Journal of KIISE:Databases
• /
• v.34 no.4
• /
• pp.343-356
• /
• 2007

Due to advances in position monitoring technologies such as global positioning systems and sensor networks, recent position information of moving objects has the form of streaming data which are updated continuously and rapidly. In this paper we propose an efficient trajectory maintenance method that stores the streaming position data of moving objects in the limited size of storage space and estimates past positions based on the stored data. For this, we first propose a new concept of incremental extraction of position information. The incremental extraction means that, whenever a new position is added into the system, we incrementally re-compute the new version of past position data maintained in the system using the current version of past position data and the newly added position. Next, based on the incremental extraction, we present an overall framework that stores position information and estimates past positions in the stream environment. We then propose two polynomial-based methods, line-based and curve-based methods, as the method of estimating the past positions on the framework. We also propose three incremental extraction methods: equi-width, slope-based, and recent-emphasis extraction methods. Experimental results show that the proposed incremental extraction provides the relatively high accuracy (error rate is less than 3%) even though we maintain only a little portion (only 0.1%) of past position information. In particular, the curve-based incremental extraction provides very low error rate of 1.5% even storing 0.1% of total position data. These results indicate that our incremental extraction methods provide an efficient framework for storing the position information of moving objects and estimating the past positions in the stream environment.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.528-545
• /
• 2007

Recently ontology has been an attractive technology along with the business strategy of providing a plenty of more intelligent services. The essential problem in application domains using ontology is that all members, agents, and application programs in the domains must share the same ontology concepts. However, a variety of mobile devices, sensing devices, and network components manufactured by various companies, a variety of common carriers, and a variety of contents providers make multiple heterogeneous ontologies more likely to coexist. We can see many past researches fallen into resolving this semantic interoperability. Such methods can be broadly classified into by-mapping, by-merging, and by-translation. In this research, we focus on by-translation among them which uses a translation rule directly made between two heterogeneous ontology data like OntoMorph. However, the manual composition of the direct translation rule is not convenient by itself and if there are N ontologies, the direct method has the rule composition complexity of $O(N^2)$ in the worst case. Therefore, in this paper we introduce the cascade composition of translation rules based on web openness in order to improve the complexity. The research result made us recognize some important factors in an ontology translation system, that is speediness of translation, and conveniency of translation rule composition, and some experiments and comparing analysis with existing methods showed that our cascade method has more conveniency with insuring the speediness and the correctness.

• Journal of KIISE:Databases
• /
• v.34 no.6
• /
• pp.503-517
• /
• 2007

In this paper we address the MBR-safe property of Piecewise Aggregation Approximation(PAA), and propose an of efficient subsequence matching method based on the MBR-safe PAA. A transformation is said to be MBR-safe if a low-dimensional MBR to which a high- dimensional MBR is transformed by the transformation contains every individual low-dimensional sequence to which a high-dimensional sequence is transformed. Using an MBR-safe transformation we can reduce the number of lower-dimensional transformations required in similar sequence matching, since it transforms a high-dimensional MBR itself to a low-dimensional MBR directly. Furthermore, PAA is known as an excellent lower-dimensional transformation single its computation is very simple, and its performance is superior to other transformations. Thus, to integrate these advantages of PAA and MBR-safeness, we first formally confirm the MBR-safe property of PAA, and then improve subsequence matching performance using the MBR-safe PAA. Contributions of the paper can be summarized as follows. First, we propose a PAA-based MBR-safe transformation, called mbrPAA, and formally prove the MBR-safeness of mbrPAA. Second, we propose an mbrPAA-based subsequence matching method, and formally prove its correctness of the proposed method. Third, we present the notion of entry reuse property, and by using the property, we propose an efficient method of constructing high-dimensional MBRs in subsequence matching. Fourth, we show the superiority of mbrPAA through extensive experiments. Experimental results show that, compared with the previous approach, our mbrPAA is 24.2 times faster in the low-dimensional MBR construction and improves subsequence matching performance by up to 65.9%.

• Journal of the Korean Society for information Management
• /
• v.34 no.1
• /
• pp.177-195
• /
• 2017

This study attempts to infer research fronts using factor graph model based on heterogeneous features. The model suggested by this study infers research fronts having documents with the potential to be cited multiple times in the future. To this end, the documents are represented by bibliographic, network, and content features. Bibliographic features contain bibliographic information such as the number of authors, the number of institutions to which the authors belong, proceedings, the number of keywords the authors provide, funds, the number of references, the number of pages, and the journal impact factor. Network features include degree centrality, betweenness, and closeness among the document network. Content features include keywords from the title and abstract using keyphrase extraction techniques. The model learns these features of a publication and infers whether the document would be an RF using sum-product algorithm and junction tree algorithm on a factor graph. We experimentally demonstrate that when predicting RFs, the FG predicted more densely connected documents than those predicted by RFs constructed using a traditional bibliometric approach. Our results also indicate that FG-predicted documents exhibit stronger degrees of centrality and betweenness among RFs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.31 no.5A
• /
• pp.459-468
• /
• 2006

Current routing in sensor networks focuses on finding methods for energy-efficient route setup and reliable relaying of data from the sensors to the sink so that the lifetime of the network is maximized. The existing routing protocols do not have routing tables to determine a path when packets are transferred. A sensor network by a routing table increases a cost of maintaining and updating a path, because sensor nodes have characteristics to be mobile and constrained capacity and resources. This paper proposes a new routing algorithm by broadcasting a bitmap in order to reduce the number of messages transferred when routing paths are established. Each node has a routing table with a bitmap, which contains link information. A bitmap is formed two-dimensional array, which consists of each row and column represented with a bit. The node only updates its own bitmap if it receives a bitmap from another adjacent nodes after the broadcasting. There by, each node has a bitmap with partial links information not total links information on the network. The proposed routing algorithm reduces the number of messages for routing establishment at least 10% compared with the previous algorithms.

• Journal of KIISE:Databases
• /
• v.37 no.2
• /
• pp.71-81
• /
• 2010

The problem of finding clusters is widely used in numerous applications, such as pattern recognition, image analysis, market analysis. The important factors that decide cluster quality are the similarity measure and the number of attributes. Similarity measures should be defined with respect to the data types. Existing similarity measures are well applicable to numerical attribute values. However, those measures do not work well when the data is described by categorical attributes, that is, when no inherent similarity measure between values. In high dimensional spaces, conventional clustering algorithms tend to break down because of sparsity of data points. To overcome this difficulty, a subspace clustering approach has been proposed. It is based on the observation that different clusters may exist in different subspaces. In this paper, we propose a new similarity measure for clustering of high dimensional categorical data. The measure is defined based on the fact that a good clustering is one where each cluster should have certain information that can distinguish it with other clusters. We also try to capture on the attribute dependencies. This study is meaningful because there has been no method to use both of them. Experimental results on real datasets show clusters obtained by our proposed similarity measure are good enough with respect to clustering accuracy.

• Journal of Life Science
• /
• v.12 no.5
• /
• pp.610-621
• /
• 2002

Conserved genes are importantly used to understand the major function in survival and replication of living organism. This study was focused on identification of conserved genes in microbial species and measuring the degree of conservation. For this purpose, in silico analysis was performed to search conserved genes based on the conservation level within microbial species. The ortholog list of COGs (Clusters of Orthologous Groups of proteins) in NCBI was used and whole genomes of 43 microbial species were included in that list. The distance value, derived from CLUSTALW multiple alignment program, was used as a descriptor of the conservation level of orthologs. It was revealed that 43 microbial genomes hold 72 conserved orthologs in common. The majority(72.2%) of the conserved genes was related to "translation, ribosomal structure and biogenesis" functional category. A GTPase-translation elogation factor(COG0050) was the best conserved gene from the distance value analysis. The 72 conserved genes, found in this research, would be useful not only to study minimal function genes but also new drug target among pathogens and to make a model of the virtual cell.tual cell.

• Science of Emotion and Sensibility
• /
• v.13 no.1
• /
• pp.197-206
• /
• 2010

For an emotion retrieval system implementation to support pedestrian navigation, coordinating the pedestrian emotion model with the system user's emotion is considered a key component. This study proposes a new method for capturing the user's model that corresponds to the pedestrian emotion model and examines the validity of the method. In the first phase, a database comprising a set of interior images that represent hypothetical destinations was developed. In the second phase, 10 subjects were recruited and asked to evaluate on navigation and satisfaction toward each interior image in five rounds of navigation experiments. In the last phase, the subjects' feedback data was used for of the pedestrian emotion model, which is called ‘learning' in this study. After evaluations by the subjects, the learning effect was analyzed by the following aspects: recall ratio, precision ratio, retrieval ranking, and satisfaction. Findings of the analysis verify that all four aspects significantly were improved after the learning. This study demonstrates the effectiveness of the learning algorithm for the proposed pedestrian emotion model. Furthermore, this study demonstrates the potential of such pedestrian emotion model to be well applicable in the development of various mobile contents service systems dealing with visual images such as commercial interiors in the future.