• Journal of the Korea Society for Simulation
• /
• v.16 no.3
• /
• pp.49-56
• /
• 2007

There are many application areas of wireless sensor networks, such as combat field surveillance, terrorist tracking and highway traffic monitoring. These applications collect sensed data from sensor nodes to monitor events in the territory of interest. One of the important issues in these applications is the existence of the radio-jamming zone between source nodes and the base station. Depending on the routing protocol the transmission of the sensed data may not be delivered to the base station. To solve this problem we propose a genetic algorithm based routing method for reliable transmission while considering the balanced energy depletion of the sensor nodes. The genetic algorithm finds an efficient routing path by considering the radio-jamming zone, energy consumption needed fur data transmission and average remaining energy level. The fitness function employed in genetic algorithm is implemented by applying the fuzzy logic. In simulation, our proposed method is compared with LEACH and Hierarchical PEGASIS. The simulation results show that the proposed method is efficient in both the energy consumption and success ratio of delivery.

• The Transactions of the Korea Information Processing Society
• /
• v.1 no.1
• /
• pp.129-139
• /
• 1994

This paper presents a morphological analysis method for the Korean language. The characteristics and adjacency information of the words can be obtained from sentences in a large corpus. Generally a word can be analyzed to a result by applying the adjacency attributes and rules. However, we have to choose one from the several results for the ambiguous words. The collected morpheme's adjacency attributes and relations with neighbor words are recorded in a well designed dictionaries. With this information, abbreviated words as well as ambiguous words can be almost analyzed successfully. Efficiency of morphological analyzer depends on the information in the dictionaries. A morpheme dictionary and a phrase dictionary have been designed with lexical database, and necessary information extracted from the corpus is stored in the dictionaries.

• Journal of KIISE:Databases
• /
• v.31 no.3
• /
• pp.232-242
• /
• 2004

Metadata is a general notion of data about data to improve data sharing and exchanging by definitely describing meaning and representation of data. However, metadata has been created in various ways and It caused another kind of heterogeneity problem named metadata heterogeneity problem. Recently, the research on metadata gateway approach that allows metadata heterogeneity is being more actively progressed. However, the existing commercialized systems that have been implemented with the metadata gateway approach are dependent on a metadata schema. In this paper, we propose a message conversion system which separates the mapping information from the mapping rules between heterogeneous metadata schemas. The proposed system dynamically manages standardized data elements by applying ISO/IEC l1179. Therefore, the proposed system provides the set of standard data elements to create consistently metadata of new databases and provides a fundamental resolution to the metadata heterogeneity problem.

• Journal of KIISE:Databases
• /
• v.35 no.1
• /
• pp.29-43
• /
• 2008

Although RDF ontologies might be expressed in XML tree model, existing methods for protection of XML documents are not suitable for securing RDF ontologies. The graph style and inference feature of RDF demands a new security model development. Driven by this goal, this paper proposes a new query-oriented model for the RDF ontology access control. The proposed model rewrites a user query using a three-layered ontology view. The proposal resolves the problem that the existing approaches should generate inference models depending on inference rules. Accessible ontology concepts and instances which a user can visit are defined as ontology views, and the inference view defined for controling an inference query enables a controlled inference capability for the user. This paper defines the three-layered view and describes algorithms for query rewriting according to the views. An implemented prototype with its system architecture is shown. Finally, the experiment and comparative evaluation result of the proposal and the previous approach is described.

• The Korean Journal of Petroleum Geology
• /
• v.6 no.1_2 s.7
• /
• pp.20-24
• /
• 1998

Expert system is one type of artificial intelligence softwares that incorporate problem-solving knowledges and experiences of human experts by use of symbolic reasoning and rules about a specific topic. In this study, an expert system, PLAYMAKER2, is used to interpret sedimentary facies and depositional settings of the sedimentary sequence. The original version of the expert system, PLAYMAKER, was developed in University of South Carolina in 1990, and modified into the present PLAYMAKER2 with some changes in the knowledge-base of the previous system. The late Cenozoic sedimentary sequence with maximum 10,000 m in thickness, which is located in the Korean Oil Exploration Block VI-1 at the southwestern margin of the Ulleung Basin, is analysed by the expert system, PLAYMAKER2. The Cenozoic sedimentary sequence is divided into two units-lower Miocene and upper Pliocene-Pleistocene sediments. The depositional settings and sedimentary facies of the Miocene sediments interpreted by PLAYMAKER2 in terms of belief values are: for depositional settings, slope; $57.4\%$, shelf; $21.4\%$, basin; $10.1\%$, and for sedimentary facies, submarine fan; $35.7\%$, continental slope; $26.3\%$, delta; $16.1\%$, deep basinplain; $6.1\%$ continental shelf; $3.2\%$, shelf margin; $1.4\%$. The depositional settings and sedimentary facies of the Pliocene-Pleistocene sediments in terms of belief values we: for depositional settings, slope; $59.0\%$, shelf; $22.8\%$, basin; $7.0\%$, and for sedimentary facies, delta; $24.1\%$, continental slope; $22.2\%$, submarine fan; $17.3\%$, continental shelf; $7.0\%$, deep basinplain; $4.8\%$, shelf margin; $2.6\%$. The comparison of the depositional settings and sedimentary facies consulted by PLAYMAKER2 with those of the classical interpretation from previous studies shows resonable similarity for the both sedimentary units-the lower Miocene sediments and the upper Pliocene-Pleistocene sediments. It demonstrates that PLAYMAKER2 is an efficient tool to interpret the depositional setting and sedimentary facies for sediments. However, to be a more reliable system, many sedimentologists should work to refine and add geological rules in the knowledge-base of the expert system, PLAYMAKER2.

• Journal of KIISE:Computing Practices and Letters
• /
• v.9 no.3
• /
• pp.322-331
• /
• 2003

As the complexity of a 3D game is increased by various factors of the game scenario, it has a problem for controlling the interrelation of the game objects. Therefore, a game system has a necessity of the coordination of the responses of the game objects. Also, it is necessary to control the behaviors of animations of the game objects in terms of the game scenario. To produce realistic game simulations, a system has to include a structure for designing the interactions among the game objects. This paper presents a method that designs the dynamic control mechanism for the interaction of the game objects in the game scenario. For the method, we suggest a game agent system as a framework that is based on intelligent agents who can make decisions using specific rules. Game agent systems are used in order to manage environment data, to simulate the game objects, to control interactions among game objects, and to support visual authoring interface that ran define a various interrelations of the game objects. These techniques can process the autonomy level of the game objects and the associated collision avoidance method, etc. Also, it is possible to make the coherent decision-making ability of the game objects about a change of the scene. In this paper, the rule-based behavior control was designed to guide the simulation of the game objects. The rules are pre-defined by the user using visual interface for designing their interaction. The Agent State Decision Network, which is composed of the visual elements, is able to pass the information and infers the current state of the game objects. All of such methods can monitor and check a variation of motion state between game objects in real time. Finally, we present a validation of the control method together with a simple case-study example. In this paper, we design and implement the supervised classification systems for high resolution satellite images. The systems support various interfaces and statistical data of training samples so that we can select the most effective training data. In addition, the efficient extension of new classification algorithms and satellite image formats are applied easily through the modularized systems. The classifiers are considered the characteristics of spectral bands from the selected training data. They provide various supervised classification algorithms which include Parallelepiped, Minimum distance, Mahalanobis distance, Maximum likelihood and Fuzzy theory. We used IKONOS images for the input and verified the systems for the classification of high resolution satellite images.

• Journal of Intelligence and Information Systems
• /
• v.14 no.2
• /
• pp.179-192
• /
• 2008

This case study shows constructing the knowledge-based system using a rule-based approach for detecting illegal transactions regarding money laundering in the Korea Financial Intelligence Unit (KoFIU). To better manage the explosive increment of low risk suspicious transactions reporting from financial institutions, the adoption of a knowledge-based system in the KoFIU is essential. Also since different types of information from various organizations are converged into the KoFIU, constructing a knowledge-based system for practical use and data management regarding money laundering is definitely required. The success of the financial information system largely depends on how well we can build the knowledge-base for the context. Therefore we designed and constructed the knowledge-based system for anti-money laundering by committing domain experts of each specific financial industry co-worked with a knowledge engineer. The outcome of the knowledge base implementation, measured by the empirical ratio of Suspicious Transaction Reports (STRs) reported to law enforcements, shows that the knowledge-based system is filtering STRs in the primary analysis step efficiently, and so has made great contribution to improve efficiency and effectiveness of the analysis process. It can be said that establishing the foundation of the knowledge base under the entire framework of the knowledge-based system for consideration of knowledge creation and management is indeed valuable.

• Journal of Advanced Navigation Technology
• /
• v.2 no.1
• /
• pp.61-67
• /
• 1998

In this paper, we have described the Ramp Activity Coordination Expert System (RACES) which can solve aircraft parking problems. RACES includes a knowledge-based scheduling problem which assigns every daily arriving and departing flight to the gates and remote spots with the domain specific knowledge and heuristics acquired from human experts. RACES processes complex scheduling problem such as dynamic inter-relations among the characteristics of remote spots/gates and aircraft with various other constraints, for example, custome and ground handling factors at an airport. By user-driven modeling for end users and knowledge-driven near optimal scheduling acquired from human experts, RACES can produce parking schedules of aircraft in about 20 seconds for about 400 daily flights, whereas it normally takes about 4 to 5 hours by human experts. Scheduling results in the form of Gantt charts produced by the RACES are also accepted by the domain experts. RACES is also designed to deal with the partial adjustment of the schedule when unexpected events occur. After daily scheduling is completed, the messages for aircraft changes and delay messages are reflected and updated into the schedule according to the knowledge of the domain experts. By analyzing the knowledge model of the domain expert, the reactive scheduling steps are effectively represented as rules and the scenarios of the Graphic User Interfaces (GUI) are designed. Since the modification of the aircraft dispositions such as aircraft changes and cancellations of flights are reflected to the current schedule, the modification should be notified to RACES from the mainframe for the reactive scheduling. The adjustments of the schedule are made semi-automatically by RACES since there are many irregularities in dealing with the partial rescheduling.

• Journal of KIISE:Software and Applications
• /
• v.32 no.3
• /
• pp.202-214
• /
• 2005

The semantic web is the web paradigm that represents not general link of documents but semantics and relation of document. In addition it enables software agents to understand semantics of documents. We propose a semantic search based on inference with ontologies, which has the following characteristics. First, our search engine enables retrieval using explicit ontologies to reason though a search keyword is different from that of documents. Second, although the concept of two ontologies does not match exactly, can be found out similar results from a rule based translator and ontological reasoning. Third, our approach enables search engine to increase accuracy and precision by using explicit ontologies to reason about meanings of documents rather than guessing meanings of documents just by keyword. Fourth, domain ontology enables users to use more detailed queries based on ontology-based automated query generator that has search area and accuracy similar to NLP. Fifth, it enables agents to do automated search not only documents with keyword but also user-preferable information and knowledge from ontologies. It can perform search more accurately than current retrieval systems which use query to databases or keyword matching. We demonstrate our system, which use ontologies and inference based on explicit ontologies, can perform better than keyword matching approach .

• Journal of the Korean Society of Surveying, Geodesy, Photogrammetry and Cartography
• /
• v.10 no.2
• /
• pp.63-71
• /
• 1992

The digital map database is often produced for multiple purposes, including mapping at multiple scales; it is increasingly rare that a base map is digitized for mapping at a single scale. The most important problems in process of line simplification in map generalization and multiple representation is that tolerance value selected for simplifying base map information must be modified as feature geometry varies within the digital file to ensure both accuracy and recognizability of graphic details on a generalized map. In this study, we explored various algorithms regarding to line simplication at many scales from a single digital file, and presents a rule by which to determine those scale at which line feature geometry might be expected to change in map representation. By applying two measured of displacement between a digitized line and its simplification, five algorithms have been evaluated. The results indicate that, of the five, the Douglas-Peucker routine produced less displacement between a line and its simplification. The research has proved to automating map simplification, incorporating numeric guidelines into digital environment about what magnitude and variation in geometric detail should be preserved as the digital data is simplified for representation at reduced map scales.