• Title/Summary/Keyword: heuristic rules

Search Result 196, Processing Time 0.023 seconds

Design and Implementation of a Korean Analysis System for Multi-lingual Query Answering (다국어 질의응답을 위한 한국어 해석 시스템 설계 및 구현)

  • Kang, Won-Seog;Hwang, Do-Sam
    • The Journal of Korean Association of Computer Education
    • /
    • v.7 no.4
    • /
    • pp.43-50
    • /
    • 2004
  • Multi-lingual query answering system is the system which answers on the queries with several languages. LASSO[l] is the system that aims to answer the multi-lingual query. In this paper, we design and implement a Korean analysis system for LASSO. The Korean analysis system for query answering needs processing techniques of dialogue style. And the system must be practical and general so as to use on various domains. This system uses not dialogue processing techniques with high cost and low utility but heuristic rules with low cost and high utility. It is designed and implemented as a Korean interface of multi-lingual query answering system. The techniques of this system highly contribute to information retrieval and Korean analysis researches.

  • PDF

Rule-based Detection of Vehicles in Traffic Scenes (교통영상에서의 규칙에 기반한 차량영역 검출기법)

  • Park, Young-Tae
    • Journal of the Institute of Electronics Engineers of Korea SP
    • /
    • v.37 no.3
    • /
    • pp.31-40
    • /
    • 2000
  • A robust scheme of locating and counting the number of vehicles m urban traffic scenes, a core component of vision-based traffic monitoring systems, is presented The method is based on the evidential reasoning, where vehicle evidences m the background subtraction Image are obtained by a new locally optimum thresholding, and the evidences are merged by three heuristic rules using the geometric constraints The locally optimum thresholding guarantees the separation of bright and dark evidences of vehicles even when the vehicles are overlapped or when the vehicles have similar color to the background Experimental results on diverse traffic scenes show that the detection performance is very robust to the operating conditions such as the camera location and the weather The method may be applied even when vehicle movement is not observed since a static Image IS processed without the use of frame difference.

  • PDF

Hybrid Rule-Interval Variation(HRIV) Method for Stabilization a Class of Nonlinear Systems (비선형 시스템의 안정을 위한 HRIV 방법의 제안)

  • Myung, Hwan-Chun;Z. Zenn Bien
    • Proceedings of the Korean Institute of Intelligent Systems Conference
    • /
    • 2000.05a
    • /
    • pp.249-255
    • /
    • 2000
  • HRIV(Hybrid Rule-Interval Variation) method is presented to stabilize a class of nonlinear systems, where SMC(Sliding Mode Control) and ADC (ADaptive Control) schemes are incorporated to overcome the unstable characteristics of a conventional FLC(Fuzzy Logic Control). HRIV method consists of two modes: I-mode (Integral Sliding Mode PLC) and R-mode(RIV method). In I-mode, SMC is used to compensate for MAE(Minimum Approximation Error) caused by the heuristic characteristics of FLC. In R-mode, RIV method reduces interval lengths of rules as states converge to an equilibrium point, which makes the defined Lyapunov function candidate negative semi-definite without considering MAE, and the new uncertain parameters generated in R-mode are compensated by SMC. In RIV method, the overcontraction problem that the states are out of a rule-table can happen by the excessive reduction of rule intervals, which is solved with a dynamic modification of rule-intervals and a transition to I-mode. Especially, HRIV method has advantages to use the analytic upper bound of MAE and to reduce Its effect in the control input, compared with the previous researches. Finally, the proposed method is applied to stabilize a simple nonlinear system and a modified inverted pendulum system in simulation experiments.

  • PDF

An Ontological Approach to Select R&D Evaluation Metrics (온톨로지 기반 연구개발 평가지표 선정기법)

  • Lee, Hee-Jung
    • Journal of Korean Society of Industrial and Systems Engineering
    • /
    • v.33 no.1
    • /
    • pp.80-90
    • /
    • 2010
  • Performance management is very popular in business area and seems to be an exciting topic. Despite significant research efforts and myriads of performance metrics, performance management today as a rigorous approach is still in an immature state and metrics are often selected based on intuitive and heuristic approach. In a R&D sector, the difficulty to select the proper performance metrics is even more increasing due to the natural characteristics of R&D such as unique or domain-specific problems. In this paper, we present a way of presenting R&D performance framework using ontology language. Based on this, the specific metrics can be derived by reusing or inheriting the context in the framework. The proposed ontological framework is formalized using OWL(Ontology Web Language) and metrics selection rules satisfying the characteristics of R&D are represented in SWRL(Semantic Web Rule Language). Actual metrics selection procedure is carried out using JESS rule engine, a plug-in to Prot$\acute{e}$g$\acute{e}$, and illustrated with an example, incorporating a prevalent R&D performance model : TVP(Technology Value Pyramid).

A new method for an automated synthesis of heat exchanger networks (열교환망 자동합성을 위한 새로운 방법)

  • Lee, Gyu-Hwang;Kim, Min-Seok;Lee, In-Beom;Go, Hong-Cheol
    • Journal of Institute of Control, Robotics and Systems
    • /
    • v.4 no.2
    • /
    • pp.256-263
    • /
    • 1998
  • Among process synthesis problems, the heat exchanger network (HEN) has been subjected to the most concentrated effort because this kind of problems was well defined for solving it and 20-30% energy savings could be realized in the present chemical processes. In this paper, we use an evolutionary approach for HEN synthesis because this approach can overcome the local optimum and combine some heuristic rules. The basic evolutionary approach is composed of three parts, that is, initialization step, growth step and mutation step, as in the simulated annealing and genetic algorithm. This algorithm uses the ecological rule that a better cell will live and worse cell should decompose after repeated generations. With this basic concept, a new procedure is developed and a more efficient method is proposed to generate initial solutions. Its effectiveness is shown using test examples.

  • PDF

Improving Quality of Training Corpus for Named Entity Recognition Using Heuristic Rules (휴리스틱을 이용한 개체명 인식 학습 말뭉치 품질 향상)

  • Lee, Seong-Hee;Song, Yeong-Kil;Kim, Hark-Soo
    • Annual Conference on Human and Language Technology
    • /
    • 2015.10a
    • /
    • pp.202-205
    • /
    • 2015
  • 개체명 인식은 문서에서 개체명을 추출하고 추출된 개체명의 범주를 결정하는 작업이다. 기존의 지도 학습 기법을 이용한 개체명 인식을 위해서는 개체명 범주가 수동으로 부착된 대용량의 학습 말뭉치가 필요하며, 대용량의 말뭉치 구축은 인력과 시간이 많이 들어가는 일이다. 본 논문에서는 학습 말뭉치 구축비용을 최소화하고 초기 학습 말뭉치의 노이즈를 제거하여 말뭉치의 품질을 향상시키는 방법을 제안한다. 제안 방법은 반자동 개체명 사전 구축 방법으로 구축한 개체명 사전과 원거리 감독법을 사용하여 초기 개체명 범주 부착 말뭉치를 구축한다. 그리고 휴리스틱을 이용하여 초기 말뭉치의 노이즈를 제거하여 학습 말뭉치의 품질을 향상시키고 개체명 인식의 성능을 향상시킨다. 실험 결과 휴리스틱 적용을 통해 개체명 인식의 F1-점수를 67.36%에서 73.17%로 향상시켰다.

  • PDF

Process Evaluation Model based on Goal-Scenario for Business Activity Monitoring

  • Baek, Su-Jin;Song, Young-Jae
    • Journal of information and communication convergence engineering
    • /
    • v.9 no.4
    • /
    • pp.379-384
    • /
    • 2011
  • The scope of the problems that could be solved by monitoring and the improvement of the recognition time is directly correlated to the performance of the management function of the business process. However, the current monitoring process of business activities decides whether to apply warnings or not by assuming a fixed environment and showing expressions based on the design rules. Also, warnings are applied by carrying out the measuring process when the event attribute values are inserted at every point. Therefore, there is a limit for distinguishing the range of occurrence and the level of severity in regard to the new external problems occurring in a complicated environment. Such problems cannot be ed. Also, since it is difficult to expand the range of problems which can be possibly evaluated, it is impossible to evaluate any unexpected situation which could occur in the execution period. In this paper, a process-evaluating model based on the goal scenario is suggested to provide constant services through the current monitoring process in regard to the service demands of the new scenario which occurs outside. The new demands based on the outside situation are analyzed according to the goal scenario for the process activities. Also, by using the meta-heuristic algorithm, a similar process model is found and identified by combining similarity and interrelationship. The process can be stopped in advance or adjusted to the wanted direction.

Phoneme Segmentation Method of Handwrittem Hangul Based on Vowel Structure and Heuristic Rules (모음 구조와 경험적인 규칙을 이용한 필기된 한글의 자소 분리 방법)

  • Gwak, Hu-Geun;Choe, Yeong-U;Jeong, Gyu-Sik
    • The KIPS Transactions:PartB
    • /
    • v.8B no.1
    • /
    • pp.10-19
    • /
    • 2001
  • 기존의 필기된 한글의 자소 분리 방법은 일반적으로 다음과 같은 단점을 가진다 : 1) 자소 분리가 주로 세선화된 이미지에 적용되어 세선화 결과에 크게 의존하며, 2) 자소가 접촉되었을 때 명확한 자소 분리 특징점이 발생하는 단순한 접촉만을 대상으로 자소 분리 방법이 개발되어, 특징점이 없거나 특징점이 틀리게 찾아지는 경우처럼 복잡한 접촉에서는 자소 분리 오류가 쉽게 발생한다는 것이다. 본 논문에서는 이러한 단점을 보완하고자 세선화를 하지 않은 이미지에서 자소 분리를 수행하며, 자소가 접촉된 경우 명확한 분리 특징점이 발생하는 경우뿐만 아니라, 특징점이 없거나 특징점이 틀리게 찾아지는 경우에도 자소 분리를 원활하게 수행할 수 있는 방법을 제안한다. 본 논문에서는 자소의 접촉을 유형별로 나누고 각 유형에 대하여 모음의 구조와 상대적인 위치 정보, 접촉의 형태 및 경험적인 규칙들을 사용하여 자소를 분리한다. 제안된 자소 분리 방법은 다음과 같은 순서로 적용된다 : 1) 입력된 낱자 이미지에서 모음을 추적한다 ; 2) 모음의 관점에서 접촉 후 발생하는 특징점의 추출이 명확한가를 판단한다 ; 3) 각 경우에 대한 접촉 유형을 확인한다 ; 4) 접촉 유형에 따른 자소 분리 방법을 적용한다. 필기된 한글 데이터베이스 PE92를 사용한 분리 실험에서 89.5%의 높은 분리율을 얻어서 제안된 방법의 유효성을 확인할 수 있었다.

  • PDF

Subspace search mechanism and cuckoo search algorithm for size optimization of space trusses

  • Kaveh, A.;Bakhshpoori, T.
    • Steel and Composite Structures
    • /
    • v.18 no.2
    • /
    • pp.289-303
    • /
    • 2015
  • This study presents a strategy so-called Subspace Search Mechanism (SSM) for reducing the computational time for convergence of population based metaheusristic algorithms. The selected metaheuristic for this study is the Cuckoo Search algorithm (CS) dealing with size optimization of trusses. The complexity of structural optimization problems can be partially due to the presence of high-dimensional design variables. SSM approach aims to reduce dimension of the problem. Design variables are categorized to predefined groups (subspaces). SSM focuses on the multiple use of the metaheuristic at hand for each subspace. Optimizer updates the design variables for each subspace independently. Updating rules require candidate designs evaluation. Each candidate design is the assemblage of responsible set of design variables that define the subspace of interest. SSM is incorporated to the Cuckoo Search algorithm for size optimizing of three small, moderate and large space trusses. Optimization results indicate that SSM enables the CS to work with less number of population (42%), as a result reducing the time of convergence, in exchange for some accuracy (1.5%). It is shown that the loss of accuracy can be lessened with increasing the order of complexity. This suggests its applicability to other algorithms and other complex finite element-based engineering design problems.

Antecedent Decision Rules of Personal Pronouns for Coreference Resolution (Coreference Resolution을 위한 3인칭 대명사의 선행사 결정 규칙)

  • Kang, Seung-Shik;Yun, Bo-Hyun;Woo, Chong-Woo
    • The KIPS Transactions:PartB
    • /
    • v.11B no.2
    • /
    • pp.227-232
    • /
    • 2004
  • When we extract a representative term from text for information retrieval system or a special information for information retrieval and text milling system, we often need to solve the anaphora resolution problem. The antecedent decision problem of a pronoun is one of the major issues for anaphora resolution. In this paper, we are suggesting a method of deciding an antecedent of the third personal pronouns, such as “he/she/they” to analyze the contents of documents precisely. Generally, the antecedent of the third personal Pronouns seem to be the subject of the current statement or previous statement, and also it occasionally happens more than twice. Based on these characteristics, we have found rules for deciding an antecedent, by investigating a case of being an antecedent from the personal pronouns, which appears in the current statement and the previous statements. Since the heuristic rule differs on the case of the third personal pronouns, we described it as subjective case, objective case, and possessive case based on the case of the pronouns. We collected 300 sentences that include a pronoun from the newspaper articles on political issues. The result of our experiment shows that the recall and precision ratio on deciding the antecedent of the third personal pronouns are 79.0% and 86.8%, respectively.