• Language and Information
• /
• v.6 no.2
• /
• pp.105-128
• /
• 2002

Morphologically annotated corpora are the basis for many tasks of computational linguistics. Most current approaches use statistically driven methods of morphological analysis, that provide just POS-tags. While this is sufficient for some applications, a rule-based full morphological analysis also yielding lemmatization and segmentation is needed for many others. This work thus aims at 〔1〕 introducing a rule-based Korean morphological analyzer called Kormoran based on the principle of linearity that prohibits any combination of left-to-right or right-to-left analysis or backtracking and then at 〔2〕 showing how it on be used as a POS-tagger by adopting an ordinary technique of preprocessing and also by filtering out irrelevant morpho-syntactic information in analyzed feature structures. It is shown that, besides providing a basis for subsequent syntactic or semantic processing, full morphological analyzers like Kormoran have the greater power of resolving ambiguities than simple POS-taggers. The focus of our present analysis is on Korean text.

• Journal of the Korea Computer Industry Society
• /
• v.9 no.4
• /
• pp.171-176
• /
• 2008

Most booking techniques make a reservation without customer's preference on internet. These techniques have booking problems not to improve customer's preference in the service industry. We have tried to apply object-based scheduling technique to performing art reservation. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The scheduling technique for performing art reservation proposed in this thesis is based on object-oriented concepts. To consider the over all satisfaction, the events of every object are alloted to the sitting plan board along its priority. To minimize backtracking or not to fail the allotment of events, we have scheduled to rise customer's preference in the scheduling.

• Journal of the Korea Computer Industry Society
• /
• v.5 no.2
• /
• pp.227-233
• /
• 2004

Complex scheduling problems are related to planning, scheduling, constraint satisfaction problems, object-oriented concepts, and agent systems. Human preference-driven scheduling technique was to solve complex scheduling problems using constraint satisfaction problems and object-oriented concepts. We have tried to apply human preference-driven scheduling technique to reservation problems. For customer's satisfaction, we have considered customer's preferences in the reservation scheduling. The technique of reservation scheduling proposed in this thesis is based on object-oriented concepts. 1'o consider the over all satisfaction, the events of every object are alloted to the board along its priority. Constraints to reservation scheduling are classified to global and local. The definition of board and information of every event are global constraints and the preferences to object's board slots are local constraints. We have applied look-ahead technology to reservation scheduling in order to minimize backtracking not to fail the allotment of events.

• Proceedings of the KIEE Conference
• /
• 1989.07a
• /
• pp.241-245
• /
• 1989

A knowledge based expert system is a computer program that emulates the reasoning process of a human expert in a specific problem domain. This paper presents an expert system to diagnose the various faults in power system. The developed expert system is represented considering two points; the possibility of solution and the fast processing speed. As uncertainties exist in the facts and rules which comprise the knowledge base of the expert system, Certainty Factor, which is based on the confirmation theory is used for the inexact reasoning. Also, as the diagnosis problem requires the inductive reasoning process in nature, the solution is imperfect and not unique in general. So the expert system is designed to generate all the possible hypothesis in order of the possibility and also it can explain the propagation procedure of the faults for each solution using the built in backtracking mechanism. In realization of the expert system, the processing speed is greatly dependent upon the problem representation, reasoning scheme and search strategy. So, in this paper the fault diagnosis problem itself is analysed from the view point of Artificial Intelligence and as a result, the expert system has the following basic features. 1) The certainty factor is adopted in the inference engine for inexact reasoning. 2) Problem apace is represented using the problem reduction technique. 3) Bidirectional reasoning scheme is used. 4) Best first search strategy is adopted for rapid processing. The expert system was developed us ing PROLOG language.

• Proceedings of the Korea Committee for Ocean Resources and Engineering Conference
• /
• 2004.05a
• /
• pp.96-100
• /
• 2004

In the ship building industry various problems of erection is counterfeited due to formation of bottle necks in the block erection flow pattern This kind of problems cause accumulated problems in real-time erection right on the floor, When such a problem is approached, a support data of the entire erection sequence should be available, Here planning is done by reasoning about the future events in order to verify the existence of a reasonable series of actions to accomplish a goal. This technique helps in achieving benefits like handling search complications, in resolving goal conflicts and anticipation of bottleneck formation well in advance to take necessary countermeasures and boosts the decision support system, The data is being evaluated and an anticipatory function is to be developed This function is quite relevant in day to day planning operation. The system updates database with rearrangement of off-critical blocks in the erection sequence diagram, As a result of such a system, planners can foresee months ahead and can effectively make decisions regarding the control of loads on the man, machine and work flow pattern, culminating to an efficient load management. Such a foreseeing concept helps us in eliminating backtracking related adjustment which is less efficient compared to the look-ahead concept. An attempt is made to develop a computer program to update the database of block arrangement pattern based on heuristic formulation.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.1
• /
• pp.203-209
• /
• 2012

Recently, k-nearest neighbors query methods based on wireless broadcasting environment are actively studied. The advantage of wireless broadcasting environment is the scalability that enables collective query processing for unspecified users connected to the server. However, in case existing k-NN query is applied in wireless broadcasting environment, there can be a disadvantage that backtracking may occur and consequently the query processing time is increasing. In this paper proposes a hierarchical bitmap-based spatial index in order to efficiently process the k-NN queries in wireless broadcasting environment. HBI reduces the bitmap size using such bitmap information and tree structure. As a result, reducing the broadcast cycle can reduce the client's tuning time and query processing time. In addition, since the locations of all the objects can be detected using bitmap information, it is possible to tune to necessary data selectively. For this paper, a test was conducted implementing HBI to k-NN query and the proposed technique was proved to be excellent by a performance evaluation.