• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.44 no.6
• /
• pp.19-29
• /
• 2007

This paper introduces a robot knowledge framework which is represented with multiple classes, levels and layers to implement robot intelligence at real environment for mobile robot. Our root knowledge framework consists of four classes of knowledge (KClass), axioms, rules, a hierarchy of three knowledge levels (KLevel) and three ontology layers (OLayer). Four KClasses including perception, model, activity and context class. One type of rules are used in a way of unidirectional reasoning. And, the other types of rules are used in a way of bi-directional reasoning. The robot knowledge framework enable a robot to integrate robot knowledge from levels of its own sensor data and primitive behaviors to levels of symbolic data and contextual information regardless of class of knowledge. With the integrated knowledge, a robot can have any queries not only through unidirectional reasoning between two adjacent layers but also through bidirectional reasoning among several layers even with uncertain and partial information. To verify our robot knowledge framework, several experiments are successfully performed for object recognition and navigation.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.18 no.6
• /
• pp.124-136
• /
• 2019

Autonomous driving at intersections requires assistance by exchanging traffic information between traffic objects due to the intersection of various vehicles and complicated driving environment. For this reason, traffic information exchange between adjacent intersections is required, but the node ID representing the intersection in the Korean standard node link system have limitations in updating intersections and identifying location information of intersections through IDs due to the configuration system including serial numbers. In this paper, we designed a coordinate-based intersection ID configuration system created by processing and merging two-dimensional coordinates of intersections to include location information in the intersection ID. In order to verify the applicability of the proposed intersection ID, we applied a new intersection ID to domestic intersections and confirmed that there are no duplicate values. Coordinate-based intersection ID reduces data size by 60% compared to existing node ID, and enables spatial queries such as searching for nearby intersections and extracting intersections in specific areas in the form of boxes without GIS tools. Therefore, coordinate-based intersection ID is expected to be more scalable and utilized than existing node ID.

• Journal of Oriental Neuropsychiatry
• /
• v.23 no.1
• /
• pp.93-114
• /
• 2012

Objective : This study aimed to review the performance of traditional herbal prescriptions for treating dementia and present a strategy for research on dementia therapy utilizing herbal medicine. Methods : A definition was made to clarify the technology regarding the development of herbal prescriptions for treating dementia. The queries were compounded based on the initial keywords provided by experts in the field, then applied to the Web of Science database search engines from January 1986 to September 2011 to search related scientific articles. Before performing the analysis, papers were extracted from the initial search reviewed by experts and 80 articles were selected. Then, the selected papers were analyzed in terms of publish year, country, and type of herbal prescriptions. Furthermore, the research performance evaluation for treating dementia by herbal prescriptions was also created in terms of country and organization based on forward citation analysis. In addition to, for the evaluation regarding research quality, we classified and reviewed papers into two types: clinical studies and experimental studies. Results : According to the quantitative information analysis of 80 articles, the number of papers has increased by 21.9% per the yearly mean from 1995, and Japan had the largest portion within this research field. There were 34 kinds of traditional herbal prescriptions, among them Ukgansan had the highest number of studies followed by Jodeungsan, Dangkisoosan and so on. In addition, quality index as calculated by cites per paper is higher than average in Switzerland, Turkey and Japan. In the view of the evaluation on quality there were 12 clinical studies, 8 RCT reported that herbal prescriptions had efficacy at cognition, behavioral & psychological symptoms (BPSD) and activity of daily life (ADL) in various type of dementia. In experimental studies most of the studies were performed using animal models. The studies using Ukgansan were aimed at improving BPSD. The papers studied with Jodeungsan and Dangkisoosan targeted vascular dementia. Conclusions : In this study, research to develop traditional herbal prescriptions for treating dementia has the potential to improve symptoms since herbal medicines work as both multi-function and multi-target in dementia with multiple pathological or neurotoxic pathways. Therefore, the results of the research should be used in order to establish strategies to develop technology for treating dementia with traditional herbal prescriptions in the future.

• Journal of IKEEE
• /
• v.11 no.4
• /
• pp.348-357
• /
• 2007

Due to the improved performance and cost of personal mobile devices and rapid progress of wireless communication technology, the number of users who utilize these devices is increasing. This trend requires various types of services be available to users. So far, there have been many solutions provided for the shortest path problem. But, technologies which can offer various recommendation services to user depending on user’s current location are focused on Euclidean spaces rather than road network. Thus, in this paper, we extend the previous work to satisfy this requirement on road network database. Our proposed scheme requires pre-computation for the efficient query processing. In the preprocessing step, we first partition the input road network into a fixed number of Voronoi polygons and then pre-compute routing information for each polygon. In the meantime, we select the number of Voronoi polygons in proposition to the scale of road network. Through this selection, the required size of pre-computation is linearly increasing to the size of road network. Using this pre-computated information, we can process queries more quickly. Through experiments, we have shown that our proposed scheme can achieve excellent performance in terms of scheduling time and the number of visited nodes.

• Journal of the Korea Society for Simulation
• /
• v.23 no.4
• /
• pp.31-39
• /
• 2014

Seasonal influenza epidemics cause 3 to 5 millions severe illness and 250,000 to 500,000 deaths worldwide each year. To prepare better controls on severe influenza epidemics, many studies have been proposed to achieve near real-time surveillance of the spread of influenza. Korea CDC publishes clinical data of influenza epidemics on a weekly basis typically with a 1-2-week reporting lag. To provide faster detection of epidemics, recently approaches using unofficial data such as news reports, social media, and search queries are suggested. Collection of such data is cheap in cost and is realized in near real-time. This research aims to develop regression models for early detecting the outbreak of the seasonal influenza epidemics in Korea with keyword query information provided from the Naver (Korean representative portal site) trend services for PC and mobile device. We selected 20 key words likely to have strong correlations with influenza-like illness (ILI) based on literature review and proposed a logistic regression model and a multiple regression model to predict the outbreak of ILI. With respect of model fitness, the multiple regression model shows better results than logistic regression model. Also we find that a mobile-based regression model is better than PC-based regression model in estimating ILI percentages.

• Proceedings of the Korean Society of Crop Science Conference
• /
• 2017.06a
• /
• pp.135-135
• /
• 2017

The Gramene database (http://www.gramene.org) is a powerful online resource for agricultural researchers, plant breeders and educators that provides easy access to reference data, visualizations and analytical tools for conducting cross-species comparisons. Learn the benefits of using Gramene to enrich your lectures, accelerate your research goals, and respond to your organismal community needs. Gramene's genomes portal hosts browsers for 44 complete reference genomes, including crops and model organisms, each displaying functional annotations, gene-trees with orthologous and paralogous gene classification, and whole-genome alignments. SNP and structural diversity data, available for 11 species, are displayed in the context of gene annotation, protein domains and functional consequences on transcript structure (e.g., missense variant). Browsers from multiple species can be viewed simultaneously with links to community-driven organismal databases. Thus, while hosting the underlying data for comparative studies, the portal also provides unified access to diverse plant community resources, and the ability for communities to upload and display private data sets in multiple standard formats. Our BioMart data mining interface enable complex queries and bulk download of sequence, annotation, homology and variation data. Gramene's pathway portal, the Plant Reactome, hosts over 240 pathways curated in rice and inferred in 66 additional plant species by orthology projection. Users may compare pathways across species, query and visualize curated expression data from EMBL-EBI's Expression Atlas in the context of pathways, analyze genome-scale expression data, and conduct pathway enrichment analysis. Our integrated search database and modern user interface leverage these diverse annotations to facilitate finding genes through selecting auto-suggested filters with interactive views of the results.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.53-73
• /
• 2006

Recently, the need for Location-Based Services (LBS) has increased due to the development of mobile devices, such as PDAs, cellular phones and GPS. As a moving object database that stores and manages the positions of moving objects is the core technology of LBS, the scheme for maintaining the main memory DBMS to the server is necessary to store and process frequent reported positions of moving objects efficiently. However, previous works on a moving object database have studied mostly a disk based moving object index that is not guaranteed to work efficiently in the main memory DBMS because these indexes did not consider characteristics of the main memory. It is necessary to study the main memory index scheme for a moving object database. In this paper, we propose the main memory index scheme based on the R-tree for storing and processing positions of moving objects efficiently in the main memory DBMS. The proposed index scheme, which uses a growing node structure, prevents the splitting cost from increasing by delaying the node splitting when a node overflows. The proposed scheme also improves the search performance by using a MergeAndSplit policy for reducing overlaps between nodes and a LargeDomainNodeSplit policy for reducing a ratio of a domain size occupied by node's MBRs. Our experiments show that the proposed index scheme outperforms the existing index scheme on the maximum 30% for range queries.

• Journal of Korea Spatial Information System Society
• /
• v.8 no.2 s.17
• /
• pp.75-89
• /
• 2006

LBS (Location-Based Service) systems have become a serious subject for research and development since recent rapid advances in wireless communication technologies and position measurement technologies such as global positioning system. The architecture named the GALIS (Gracefully Aging Location Information System) has been suggested which is a cluster-based distributed computing system architecture to overcome performance losses and to efficiently handle a large volume of data, at least millions. The GALIS consists of SLDS and LLDS. The SLDS manages current location information of moving objects and the LLDS manages past location information of moving objects. In this thesis, we implement a monitoring technique for the GALIS prototype, to allow dynamic load balancing among multiple computing nodes by keeping track of the load of each node in real-time during the location data management and spatio-temporal query processing. We also propose a buffering technique which efficiently manages the query results having overlapped query regions to improve query processing performance of the GALIS. The proposed scheme reduces query processing time by eliminating unnecessary query execution on the overlapped regions with the previous queries.

• Journal of Korea Spatial Information System Society
• /
• v.9 no.3
• /
• pp.35-50
• /
• 2007

In a data centric sensor network, a sensor node to store data is determined by the measured data value of each sensor node. Therefore, if the same data occur frequently, the energy of the sensor node to store the data is exhausted quickly due to the concentration of loads. And if the sensor network is extended, the communication cost for storing data and processing queries is increased, since the length of the routing path for them is usually in the distance. However, the existing researches that generally focus on the efficient management of data storing can not solve these problems efficiently. In this paper, we propose a NUNS(Non-Uniform Network Split) method that can distribute loads of sensor nodes and decrease the communication cost caused by the sensor network extension. By dividing the sensor network into non-uniform partitions that have the minimum difference in the number of sensor nodes and the splitted area size and storing the data which is occurred in a partition at the sensor nodes within the partition, the NUNS can distribute loads of sensor nodes and decrease the communication cost efficiently. In addition, by dividing each partition into non-uniform zones that have the minimum difference in the splitted area size as many as the number of the sensor nodes in the partition and allocating each of them as the processing area of each sensor node, the NUNS can protect a specific sensor node from the load concentration and decrease the unnecessary routing cost.

• The Journal of Society for e-Business Studies
• /
• v.12 no.3
• /
• pp.211-234
• /
• 2007

In e-business, XML is a major format of data and it is essential to efficiently process queries against XML data. XML query caching has received much attention for query performance improvement. In employing XML query caching, some efficient technique of cache replacement is required. The previous techniques considered as a replacement unit either the whole query result or the path in the query result. The former is simple to employ but it is not efficient whereas the latter is more efficient and yet the size difference among the potential victims is large, and thus, efficiency of caching would be limited. In this paper, we propose a new technique where the element in the query result is are placement unit to overcome the limitations of the previous techniques. The proposed technique could enhance the cache efficiency to a great extent because it would not pick a victim whose size is too large to store a new cached item, the variance in the size of victims would be small, and the unused space of the cache storage would be small. A technique of XML semantic cache replacement is presented which is based on the replacement function that takes into account cache hit ratio, last access time, fetch time, size of XML semantic region, size of element in XML semantic region, etc. We implemented a prototype XML semantic cache system that employs the proposed technique, and conducted a detailed set of experiments over a LAN environment. The experimental results showed that our proposed technique outperformed the previous ones.