• Title/Summary/Keyword: 논리규칙

Search Result 290, Processing Time 0.027 seconds

Discriminant analysis based on a calibration model (Calibration 모형을 이용한 판별분석)

  • 이석훈;박래현;복혜영
    • The Korean Journal of Applied Statistics
    • /
    • v.10 no.2
    • /
    • pp.261-274
    • /
    • 1997
  • Most of the data sets to which the conventional discriminant rules have been applied contain only those which belong to one and only one class among the classes of interest. However the extension of the bivalence to multivlaence like Fuzzy concepts strongly influence the traditional view that an object must belong to only class. Thus the goal of this paper is to develop new discriminant rules which can handle the data each object of which may belong to moer than two classes with certain degrees of belongings. A calibration model is used for the relationship between the feature vector of an object and the degree of belongings and a Bayesian inference is made with the Metropolis algorithm on the degree of belongings when a feature vector of an object whose membership is unknown is given. An evalution criterion is suggested for the rules developed in this paper and comparision study is carried using two training data sets.

  • PDF

Morphological Analysis of the Korean Language (한국어의 형태소해석)

  • Lee, Soo-Hyon;Ozawa, S.;Lee, Joo-Keun
    • Journal of the Korean Institute of Telematics and Electronics
    • /
    • v.26 no.4
    • /
    • pp.53-61
    • /
    • 1989
  • A morphological analysis is described to extract the informations which are required in syntactic and semantic analysis of the Korean language. The noun and particle are separated in a noun phrase, the selecting conditions are specified to analyze the compound noun and a restoring rule is represented to process the irregular compound noun. The stem and ending are separated in normal verbals and a logical representive form is proposed to the anomalously inflected word and contracted vowels. The logical representation is composed of the attribute value an analyzing rule. The redundancy of noun is reduced in the dictionary as the verb of a "Nounformed HA-" is processed by "noun" and "HA-", separately and a predicative "IDA" is analyzed by Q parameter. The processing form of negation is also derived and the morpheme and basic structure of compound predicative parts are presented.

  • PDF

Adaptive Fuzzy Logic Control Using a Predictive Neural Network (예측 신경망을 이용한 적응 퍼지 논리 제어)

  • 정성훈
    • Journal of the Korean Institute of Intelligent Systems
    • /
    • v.7 no.5
    • /
    • pp.46-50
    • /
    • 1997
  • In fuzzy logic control, static fuzzy rules cannot cope with significant changes of parameters of plants or environment. To solve this prohlem, self-organizing fuzzy control. neural-network-hased fuzzy logic control and so on have heen introduced so far. However, dynamically changed fuzzy rules of these schemes may make a fuzzy logic controller Fall into dangerous situations because the changed fuzzy rules may he incomplete or inconsistent. This paper proposes a new adaptive filzzy logic control scheme using a predictivc neural network. Although some parameters of a controlled plant or environment are changed, proposed fuzzy logic controller changes its decision outputs adaptively and robustly using unchanged initial fuzzy rules and the predictive errors generated hy the predictive neural network by on-line learning. Experimental results with a D<' servo-motor position control problem show that propnsed cnntrol scheme is very useful in the viewpoint of adaptability.

  • PDF

Association Rule Mining Scheme of Large-Scale Database for Socially Aware Computing (Socially aware computing을 위한 대규모 데이터베이스의 연관 규칙 감축 기법)

  • Jeong, Hwi-Woon;Park, Geon-Yong;Park, Jong-Chang;Youn, Hee-Yong
    • Proceedings of the Korean Society of Computer Information Conference
    • /
    • 2013.01a
    • /
    • pp.291-294
    • /
    • 2013
  • 연관 규칙 감축 기법은 대규모 데이터를 사용하는 Socially aware computing분야에서 매우 중요한 이슈이다. 본 논문에서는 수집된 각종 데이터들을 각 속성 기준에 따라 이진 변환한 후 가중치를 부여하고 논리식 감축 방법을 이용하여 신뢰성을 보장하는 규칙을 도출하는 새로운 데이터 감축 기법을 제안한다. 이는 컴퓨터 시뮬레이션 결과 기존의 방식들에 비해 지지도, 신뢰도, 규칙 감소율, 연관 규칙 추출 시간에 좋은 성능을 보였으며 이는 빠른 시간 내에 신뢰성 높은 대규모 데이터 처리가 필요한 Socially aware computing분야에 적합하다고 판단한다.

  • PDF

Expressing Service Specifications for Context-Awareness using temporal logic (상황 인식 시스템의 서비스 명세를 시제 논리로 표현하기)

  • Kim, Tae-Kyun;Cho, Min-Taek;Kwon, Gi-Hwon
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2012.06b
    • /
    • pp.253-254
    • /
    • 2012
  • 상황 인식 시스템에서, 핵심 요소 중의 하나가 서비스 명세이다. 지금까지 서비스 명세를 표현하기 위해서 생성 규칙, 마크업 기반 언어 및 온톨로지 기반 언어 등이 사용되었다. 이들과는 다르게, 본 논문에서는 병행 시스템 및 반응형 시스템의 속성 명세에 널리 사용되는 시제 논리를 이용하여 상황 인식 서비스를 명세하고자 한다.

Structure Searching of Biological Sequence using DCG in Constraint Logic Programming Language (제한 논리 프로그래밍 언어에서 DCG를 이용한 생물학적 서열의 구조 검색)

  • 이근우;이수현;이명준
    • Proceedings of the Korean Information Science Society Conference
    • /
    • 2001.10a
    • /
    • pp.352-354
    • /
    • 2001
  • 생물학적 서열의 구조 검색은 생물학적 특성을 예측하는데 많은 도움을 주며, 서열에서 나타나는 구조의 패턴은 촘스키의 형식 언어로 기술 가능하다. 본 논문에서는 문맥무관문법의 확장된 표기법인 DCG를 이용하여 구조 검색을 위한 구조 패턴의 생성 규칙을 정의하였다. 또한 구조 검색의 효율향상을 위하여 구조와 관련한 제한(constraint)을 정의하였고 이를 제한 논리 프로그래밍 언어로 구현하였다. 구현된 구조 검색 엔진은 웹 인터페이스를 통하여 접근할 수 있다.

  • PDF

Design of a 323${\times}$2-Bit Modified Booth Multiplier Using Current-Mode CMOS Multiple-Valued Logic Circuits (전류모드 CMOS 다치 논리회로를 이용한 32${\times}$32-Bit Modified Booth 곱셈기 설계)

  • 이은실;김정범
    • Journal of the Institute of Electronics Engineers of Korea SD
    • /
    • v.40 no.12
    • /
    • pp.72-79
    • /
    • 2003
  • This paper proposes a 32${\times}$32 Modified Booth multiplier using CMOS multiple-valued logic circuits. The multiplier based on the radix-4 algorithm is designed with current mode CMOS quaternary logic circuits. Designed multiplier is reduced the transistor count by 67.1% and 37.3%, compared with that of the voltage mode binary multiplier and the previous multiple-valued logic multiplier, respectively. The multiplier is designed with a 0.35${\mu}{\textrm}{m}$ standard CMOS technology at a 3.3V supply voltage and unit current 10$mutextrm{A}$, and verified by HSPICE. The multiplier has 5.9㎱ of propagation delay time and 16.9mW of power dissipation. The performance is comparable to that of the fastest binary multiplier reported.

Definition of Secure Relational Schema using an Object Relationship Model (객체-관련성 모델을 이용한 보안 관계 스키마 정의)

  • 김영균;이영록;노봉남
    • Proceedings of the Korea Institutes of Information Security and Cryptology Conference
    • /
    • 1992.11a
    • /
    • pp.247-256
    • /
    • 1992
  • 개념적 데이터 모델의 스키마를 논리적 스키마의 하나인 관계 스키마로의 변환 과정은 개체 무결성과 참조 무결성을 보장하여야 한다. 또한 안전한 데이터 베이스를 설계하고 구현하기 위해서는 보안성을 기존의 데이터 모델에 첨가시켜서 변환 과정에 보안성을 보장하기 위한 변환 규칙을 정의하여야 한다. 이 과정을 일관성 있고 효율적으로 하기 위해 변환 과정을 자동적으로 수행하는 도구가 필요하다. 본 논문에서는 보안 객체-관련성 모델을 이용하여 보안 관계 스키마로 변환하기 위한 변환 규칙을 정의하고, 변환 처리 과정을 자동적으로 수행하는 자동화 도구를 설계 및 구현하였다.

  • PDF

Systematic Design Method of Fuzzy Logic Controllers by Using Fuzzy Control Cell (퍼지제어 셀을 이용한 퍼지논리제어기의 조직적인 설계방법)

  • 남세규;김종식;유완석
    • Transactions of the Korean Society of Mechanical Engineers
    • /
    • v.16 no.7
    • /
    • pp.1234-1243
    • /
    • 1992
  • A systematic procedure to design fuzzy PID controllers is developed in this paper. The concept of local fuzzy control cell is proposed by introducing both an adequate global control rule and membership functions to simplify a fuzzy logic controller. Fuzzy decision is made by using algebraic product and parallel firing arithematic mean, and a defuzzification strategy is adopted for improving the computational efficiency based on nonfuzzy micro-processor. A direct method, transforming the typical output of quasi-linear fuzzy operator to the digital compensator of PID form, is also proposed. Finally, the proposed algorithm is applied to an DC-servo motor. It is found that this algorithm is systematic and robust through computer simulations and implementation of controller using Intel 8097 micro-processor.

Higher-Order Vagueness and Radical Indeterminacy (고차모호성과 극단적 결정불가능성)

  • Lee, Jinhee
    • Korean Journal of Logic
    • /
    • v.17 no.1
    • /
    • pp.137-181
    • /
    • 2014
  • I will propose the radical indeterminacy for solving the higher-order vagueness' dilemma. The radical indeterminacy means that the indeterminacy of 'a is P' implies the indeterminacy of 'a is a borderline case of P.' I will compose my argument two steps: first I will suggest conditions for overcoming the dilemma by analyzing its structure and second I will offer the radical indeterminacy that satisfies aforementioned conditions. I think the higher-order vagueness' dilemma occurs owing to the misunderstanding about the unclarity or the indeterminacy of borderline cases that is an basic intuition of vagueness. So conditions for solving the dilemma are also criteria of adequacy on the theory of vagueness. Thus I will propose II-rule that satisfies above conditions and the radical indeterminacy as a new understanding about vagueness.

  • PDF