• Journal of KIISE:Software and Applications
• /
• v.29 no.4
• /
• pp.278-288
• /
• 2002

This paper presents a design and implementation of fuzzy retrieval system that could support an associated learning in problem banks. It tries to retrieve some of the problems conceptually related to specific semantics described by user's queries. In particular, the problem retrieval system employs a fuzzy thesaurus which represents relationships between domain dependent vocabularies as fuzzy degrees. It would keep track of characteristics of the associated learning, which should guarantee high recall and acceptable precision for retrieval effectiveness. That is, since the thesaurus could make a vocabulary mismatch problem resolved among query terms and document index terms, this retrieval system could take a chance to effectively support user's associated teaming. Finally, we have evaluated whether the fuzzy retrieval system is appropriate for the associated teaming or not, by means of its precision and recall rate point of view.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.4
• /
• pp.141-150
• /
• 2008

In this mobile computing environment, data broadcasting is widely used to resolve the problem of limited power and bandwidth of mobile equipments. Most previous broadcast indexing methods concentrate on flat data. However. with the growing popularity of XML, an increasing amount of information is being stored and exchanged in the XML format. We propose a novel indexing method. called TOP tree(Tree Ordering based Path summary tree), for indexing XML document on mobile broadcast environments. TOP tree is a path summary tree which provides a concise structure summary at group level using global IDs and element information at local level using local IDs. Based on the TOP tree representation, we suggest a broadcast stream generation and query Processing method that efficiently handles not only simple Path queries but also multiple path queries. We have compared our indexing method with other indexing methods. Evaluation results show that our approaches can effectively improve the access time and tune-in time in a wireless broadcasting environment.

• Journal of The Korean Association of Information Education
• /
• v.4 no.1
• /
• pp.109-119
• /
• 2000

In this paper, we design and implement educational system by using active database technique in www environments. The developed system consists of three modules such as user group interface, active-based monitor, and expert group interface. The roles of each module are summarized as follows. The user group interface provides with system accessibility the users who registered in the developed system. The active-based monitor, triggering modules, consists of three sub-modules such as keyword parser, exception handler, and DB access module. Also it manages five items such as keyword index, Q&A DB, user group mailing list, and expert group mailing list. The expect group interface provides answer filling form for the expert who registered in the developed system.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.7
• /
• pp.1733-1748
• /
• 1997

In this paper, we propose the classification scheme and retrieval mechanism which can apply to many application domains in order to construct the software reuse library. Classification scheme which is the core of the accessibility in the reusability, is defined by the hierarchical structure using the agglomerative clusters. Agglomerative cluster means the group of the reuse component by the functional relationships. Functional relationships are measured by the HACM which is the representation method about software components to calculate the similarities among the classes in the particular domain. And clustering informations are added to the library structure which determines the functionality and accuracy of the retrieval system. And the system stores the classification results such as the index information with the weights, the similarity matrix, the hierarchical structure. Therefore users can retrieve the software component using the query which is the natural language. The thesis is studied to focus on the findability of software components in the reuse library. As a result, the part of the construction process of the reuse library was automated, and we can construct the object-oriented reuse library with the extendibility and relationship about the reuse components. Also the our process is visualized through the browse hierarchy of the retrieval environment, and the retrieval system is integrated to the reuse system CARS 2.1.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2004.05b
• /
• pp.345-349
• /
• 2004

In order to index exactly moving objects(vehicle, mobile phone, PDA, etc.) in the mobile database, continuous updates of their locations are inevitable as well as time-consuming. The studies of pure spatial indices have focused on the efficient retrievals. However, the acquisition and management of the terminal Location of moving objects are more important than the efficiency of the query processing in the moving object databases. Therefore, it will be need to adopt parallel processing system for the moving object databases which should maintain the object's current location as precise as possible. This paper proposes a architecture of spatial indexing mobile objects using multiple processors. More precisely, we newly propose a method of splitting buckets using the properties of moving objects in order to minimize the number of database updates. We also propose a acquisition method for gathering the location information of moving objects and passing the information of the bucket extents in order to reduce the amount of passed messages between processors.

• Journal of Information Management
• /
• v.40 no.1
• /
• pp.133-156
• /
• 2009

In this study, we link informal Web resources to KISTI NDSL's collections using automatic semantic indexing and tagging to examine the possibility of the service which recommends related documents using the similarity between KISTI's formal information resources and informal web resources. We collect and index Web resources and make automatic semantic linking through STEAK with KISTI's collections for NDSL retrieval. The macro precision which shows retrieval precision per a subject category is 62.6% and the micro precision which shows retrieval precision per a query is 66.9%. The experts' evaluation score is 76.7. This study shows the possibility of semantic linking NDSL retrieval results with Web information resources and expanding information services' coverage to informal information resources.

• Korean Journal of Community Nutrition
• /
• v.3 no.3
• /
• pp.410-422
• /
• 1998

To promote health status, strategies and interventions to improve nutrition should be based on the proper diagnosis of the subject's eating patterns. The elderly usually have traditional food habits and preferences, and it is very difficult to change them. This study was designed to identify dietary behavior and food preference of the elderly, in order to provide baseline data for the Elderly Nutrition Intervention Program for the Public Health Center. A survey questionnaire was made for use by trained interviewers to query 151elderly people from 5 community elderly centers located in Suwon, Korea. The majority of them ate regularly and partook of all available side dishes. Their major dietary problems were frequent consumptions of salty foods, and eating too quickly. They consumed grains and vegetables regularly, but seldomly ate dairy products, fruits, meat and food prepared with oil. They also tended to eschew ready made processed food, high cholesterol food, and fast food. Also they did not dine out as much as younger people. Desirable eating habit score were not significantly influenced by socioeconomic variables and nutrition-related characteristics. These included nutrition knowledge, Nutritional Risk Index(NRI) and a score of health concerns. However, meal balance scores were significantly higher in the younger group(p<.05), the higher household income group(p<.05). According to stepwise multiple regression analysis, NRI was the most important determinant of a desirable eating habit score for the male elderly, whereas the score of health concerns was mo9st important for female elderly subjects. The greatest predictor of the meal f balance score was nutrition knowledge. The elderly liked sweet tasting food, grains, rice, stews and Korean style soups. They disliked sour food, dairy products, processed food, and bread. The results indicate that the Elderly Nutrition Education Program should focus on increasing consumption of dairy products, fruits and food with oil, prepared by traditional Korean cooking methods. It also suggests that the program planning should consider the socioeconomic status of the elderly, such as income and education level, as well as concern for health.

• Journal of Korea Society of Industrial Information Systems
• /
• v.25 no.6
• /
• pp.15-23
• /
• 2020

While research activities in the agricultural field for climate change are being actively carried out, smart agriculture using information and communication technology has become a new trend in line with the Fourth Industrial Revolution. Accordingly, research is being conducted to identify and respond to signs of abnormal growth in advance by monitoring the stress of crops in various outdoor environments and soil conditions. There are also attempts to analyze data collected in real time through various sensors using artificial intelligence techniques or big data technologies. In this paper, we propose a big data model that is effective in analyzing the growth environment informations and biometric information of crops by using the existing relational database for big data analysis. The performance of the model was measured by the response time to a query according to the amount of data. As a result, it was confirmed that there is a maximum time reduction effect of 23.8%.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.26 no.1
• /
• pp.1-6
• /
• 2022

Recently, IoT sensors are often used to produce stream data locally and they are provided for edge computing applications. Mass-produced data are stored in the mobile device's database for real-time processing and then synchronized with the server when needed. Many mobile databases are developed to support those applications. They are CloudScape, DB2 Everyplace, ASA, PointBase Mobile, etc, and the most widely used database is SQLite3 on Linux. In this paper, we focused on the performance required for synchronization with the server. The search performance required to retrieve SQLite3 was compared and analyzed according to the type of each Linux file system in which the database is stored. Thus, performance differences were checked for each file system according to various search query types, and criteria for applying the more appropriate Linux file system according to the index use environment and table scan environment were prepared and presented.

• Journal of KIISE:Databases
• /
• v.30 no.4
• /
• pp.381-396
• /
• 2003

Subsequence matching is an operation that finds subsequences whose changing patterns are similar to a given query sequence from time-series databases. This paper points out the performance bottleneck in subsequence matching, and then proposes an effective method that improves the performance of entire subsequence matching significantly by resolving the performance bottleneck. First, we analyze the disk access and CPU processing times required during the index searching and post processing steps through preliminary experiments. Based on their results, we show that the post processing step is the main performance bottleneck in subsequence matching, and them claim that its optimization is a crucial issue overlooked in previous approaches. In order to resolve the performance bottleneck, we propose a simple but quite effective method that processes the post processing step in the optimal way. By rearranging the order of candidate subsequences to be compared with a query sequence, our method completely eliminates the redundancy of disk accesses and CPU processing occurred in the post processing step. We formally prove that our method is optimal and also does not incur any false dismissal. We show the effectiveness of our method by extensive experiments. The results show that our method achieves significant speed-up in the post processing step 3.91 to 9.42 times when using a data set of real-world stock sequences and 4.97 to 5.61 times when using data sets of a large volume of synthetic sequences. Also, the results show that our method reduces the weight of the post processing step in entire subsequence matching from about 90% to less than 70%. This implies that our method successfully resolves th performance bottleneck in subsequence matching. As a result, our method provides excellent performance in entire subsequence matching. The experimental results reveal that it is 3.05 to 5.60 times faster when using a data set of real-world stock sequences and 3.68 to 4.21 times faster when using data sets of a large volume of synthetic sequences compared with the previous one.