• Journal of Korea Multimedia Society
• /
• v.13 no.11
• /
• pp.1643-1656
• /
• 2010

It is necessary to develop a system to judge inferiority of goods to minimize the loss at small factories in which produces various kinds of goods with small amounts. That system can be developed based on HTM theory. HTM is a model to apply the operation principles of the neocortex in human brain to the machine learning. We have to build the trained HTM network to use the HTM-based machine learning system. It requires the knowledge for the HTM theory. This paper presents the design and implementation of the training system to support the development of HTM networks which recognize the molding parts to judge its badness. This training system allows field technicians to train the HTM network with high accuracy without the knowledge of the HTM theory. It also can be applied to any kind of the HTM-based judging systems for molding parts.

• Journal of the Korean Society for information Management
• /
• v.34 no.4
• /
• pp.81-99
• /
• 2017

Technical documents are important research outputs generated by knowledge and information society. In order to properly use the technical documents properly, it is necessary to utilize advanced information processing techniques, such as summarization and information extraction. In this paper, to extract core information, we automatically extracted the terminologies and their definition based on definitional sentences patterns and the structure of technical documents. Based on this, we proposed the system to build a specialized terminology dictionary. And further we suggested the personalized services so that users can utilize the terminology dictionary in various ways as an knowledge memory. The results of this study will allow users to find up-to-date information faster and easier. In addition, providing a personalized terminology dictionary to users can maximize the value, usability, and retrieval efficiency of the dictionary.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1499-1507
• /
• 2009

With the abundance of digital contents, the necessity of precise indexing technology is consistently required. To meet these requirements, the intelligent software entity needs to be the subject of information retrieval and the interoperability among intelligent entities including human must be supported. In this paper, we analyze the unifying framework for multi-modality indexing that Snoek and Worring proposed. Our work investigates the method of improving the authenticity of indexing information in contents-based automated indexing techniques. It supports the creation and control of abstracted high-level indexing information through ontological concepts of Semantic Web skills. Moreover, it attempts to present the fundamental model that allows interoperability between human and machine and between machine and machine. The memory-residence model of processing ontology is inappropriate in order to take-in an enormous amount of indexing information. The use of ontology repository and inference engine is required for consistent retrieval and reasoning of logically expressed knowledge. Our work presents an experiment for storing and retrieving the designed knowledge by using the Minerva ontology repository, which demonstrates satisfied techniques and efficient requirements. At last, the efficient indexing possibility with related research is also considered.

• The KIPS Transactions:PartD
• /
• v.12D no.3 s.99
• /
• pp.335-344
• /
• 2005

Recently open data mining methods focusing on a data stream that is a massive unbounded sequence of data elements continuously generated at a rapid rate are proposed actively. Knowledge embedded in a data stream is likely to be changed over time. Therefore, identifying the recent change of the knowledge quickly can provide valuable information for the analysis of the data stream. This paper proposes a sliding window technique for finding recently frequent itemsets, which is applied efficiently in open data mining. In the proposed technique, its memory usage is kept in a small space by delayed-insertion and pruning operations, and its mining result can be found in a short time since the data elements within its target range are not traversed repeatedly. Moreover, the proposed technique focused in the recent data elements, so that it can catch out the recent change of the data stream.

• Journal of Intelligence and Information Systems
• /
• v.14 no.4
• /
• pp.1-18
• /
• 2008

By using previous similar case plans, the case-based planning (CBP) systems can generate efficiently plans for new problems. However, most existing CBP systems show limited functionalities for case retrieval and case generalization. Moreover, they do not allow their users to participate in the process of plan generation. To support efficient memory use and case retrieval, the proposed case-based planning system, JCBP, groups the set of cases sharing the same goal in each domain into individual case bases and maintains indexes to these individual case bases. The system applies the heuristic knowledge automatically extracted from the problem model to the case adaptation phase. It provides a sort of case generalization through goal regression. Also JCBP can operate in an interactive mode to support a mixed-initiative planning. Since it considers and utilizes user's preference and knowledge for solving the given planning problems, it can generate solution plans satisfying more user's needs and reduce the complexity of plan generation.

• Journal of Science Education
• /
• v.34 no.1
• /
• pp.164-174
• /
• 2010

The purpose of this study was to find out taxonomic characteristics of objectives infered from questions of summative evaluation by analyzing those objectives with Bloom's revised taxonomy of educational objectives. 1,711 questions of midterm and final examinations collected from 25 middle schools were analyzed to classify objective of each question. The major findings of the study were as follows: first, from the analysis of objectives in the knowledge dimension, the assessment of factual knowledge was most prevailing(67.6%) in the biology summative evaluation. In the cognitive process dimension, memory assessment was most dominant(76.1%). Thus, the main objectives of evaluation leaned toward particular classes in the Bloom's revised taxonomy, which was different from the findings of earlier studies on the weights of evaluation areas. Second, the level of the objectives should be determined in consideration of the grade of middle schoolers, as their cognitive level improves with grade. In fact, however, there was no difference among three grades in characteristics of objective taxonomy.

• The Transactions of the Korea Information Processing Society
• /
• v.7 no.1
• /
• pp.12-19
• /
• 2000

In the development of a production process scheduling system a collaboration method must be defined for the cooperation among submodules within the system. The blackboard architecture is exploited for solving the collaboration problem, which is one of the problem solving architecture that belongs to the distributed artificial intelligence. The dynamic states of the problem solving processes are presented in the hierarchically constructed shared working memory called as a blackboard. The communication for the collaboration is done through the blackboard. The problem solving steps are contained in the global controller, one of a component that consists the blackboard architecture, as knowledge. The global controller activates proper submodules based on the knowledge. By applying the blackboard architecture the collaboration problem among submodules in the grating production process scheduling system (GPSS) has been solved as well as the system became adaptable to the future modifications and expansions.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.6
• /
• pp.2781-2800
• /
• 2016

Emerging attacks aim to access proprietary assets and steal data for business or political motives, such as Operation Aurora and Operation Shady RAT. Skilled Intruders would likely remove their traces on targeted hosts, but their network movements, which are continuously recorded by network devices, cannot be easily eliminated by themselves. However, without complete knowledge about both inbound/outbound and internal traffic, it is difficult for security team to unveil hidden traces of intruders. In this paper, we propose an autonomous anomaly detection system based on behavior profiling and relation mining. The single-hop access profiling model employ a novel linear grouping algorithm PSOLGA to create behavior profiles for each individual server application discovered automatically in historical flow analysis. Besides that, the double-hop access relation model utilizes in-memory graph to mine time-sequenced access relations between different server applications. Using the behavior profiles and relation rules, this approach is able to detect possible anomalies and violations in real-time detection. Finally, the experimental results demonstrate that the designed models are promising in terms of accuracy and computational efficiency.

• Proceedings of the KSRS Conference
• /
• 2005.10a
• /
• pp.454-457
• /
• 2005

Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous studies adopt an Apriori-like candidate set generation-and-test approach. However, candidate set generation is still costly, especially when there exist prolific patterns and/or long patterns. And calendar based on temporal association rules proposes the discovery of association rules along with their temporal patterns in terms of calendar schemas, but this approach is also adopt an Apriori-like candidate set generation. In this paper, we propose an efficient temporal frequent pattern mining using TFP-tree (Temporal Frequent Pattern tree). This approach has three advantages: (1) this method separates many partitions by according to maximum size domain and only scans the transaction once for reducing the I/O cost. (2) This method maintains all of transactions using FP-trees. (3) We only have the FP-trees of I-star pattern and other star pattern nodes only link them step by step for efficient mining and the saving memory. Our performance study shows that the TFP-tree is efficient and scalable for mining, and is about an order of magnitude faster than the Apriori algorithm and also faster than calendar based on temporal frequent pattern mining methods.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.23 no.2
• /
• pp.169-179
• /
• 2013

Recently, with rapid advances of mobile devices such as smart phone and wireless networking, a number of services using mobile device based wireless network have been explosively increasing. From the viewpoint of security, because wireless network is more vulnerable than wired network, strong security is required in wireless network. On the contrary, the security for mobile devices has to be efficient due to the restrictions of battery powered mobile device such as low computation, low memory space and high communication cost. Therefore, in this paper, we propose an efficient authentication scheme with mobile devices in wireless network environment. The proposed scheme satisfies security requirements for the service using mobile device and it is suitable in wireless network environment.