• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2005년도 ICCAS
• /
• pp.1617-1620
• /
• 2005

The current control for interior permanent magnet machines is more complicate than surface permanent magnet machine because of its torque characteristic depending on the reluctance. For high performance torque control, it requires state decoupling between the d-current and q-current dynamics. However the variation of the inductances, which couples the state dynamics of the currents, makes the state decoupling difficult. So some decoupling methods have developed to cope this variations and each current can be regulated independently. This paper presents a novel approach for fully decoupling the states cross-coupling using parameter adaptation. The adaptation method is based on the error between reference currents and the currents with state decoupling which have to follow the references. This method is more object-oriented than the other online parameter estimation methods in IPM machine and other electrical machines

• Journal of applied mathematics & informatics
• /
• 제4권1호
• /
• pp.117-134
• /
• 1997

In this paper we introduce the notions of TL-subsystems strong TL-subsystems and discuss their basic properties.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2002년도 ICCAS
• /
• pp.120.5-120
• /
• 2002

1. Introduction 2. Property of FPGA 3. Evolvable Hardware (EHW) 4. Genetic Algorithm Processor (GAP) 5. State Machine 6. Conclusion

• Journal of applied mathematics & informatics
• /
• 제20권1_2호
• /
• pp.315-325
• /
• 2006

The notion of intuitionistic fuzzy finite switchboard state machines and (strong) homomorphisms of intuitionistic fuzzy finite state machines are introduced, and related properties are investigated. After we give a congruence relation on the set of all words of elements of X of finite length, the quotient structure is discussed. We show that the family of equivalence classes is a finite semigroup with identity.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.212-217
• /
• 1992

In this paper, a two ports machine(TPM) model for discrete event dynamic systems(DEDS) is proposed. The proposed model is a finite state machine which has two inputs and two outputs. Inputs and outputs have two components, events and informations. TPM is different from other state machine models, since TPM has symmetric input and output. This symmetry enables the block diagram representation of the DEDS with TPM blocks, summing points, multiplying points, branch points, and connections. The graphical representation of DEDS is analogous to that of control system theory. TPM has a matrix representation of its transition and information map. This matrix representation simplifies the analysis of the DEDS.

• 전기의세계
• /
• 제21권6호
• /
• pp.9-16
• /
• 1972

This work intends to study the machine dynamics in the state-space approah and to formulate the operating characteristics of a namplidyne generator, with balanced control field winding and an auxiliary feedback winding for compensating purpose. In the derivation of the dynamic equation, investigations on the demagnetization effects are accentuated, based on the magnetic interlinks between windings of the machine. From the machine dynamic relation obtained, a state-variable representation of the machine dynamics is approached in the first part of this work.

• 전기학회논문지
• /
• 제57권8호
• /
• pp.1440-1446
• /
• 2008

In this paper, a novel TMR (Triple Modular Redundancy) memory structure is proposed using state feedback control of asynchronous sequential machines. The main ability of the proposed structure is to correct the fault of SEU (Single Event Upset) asynchronously without resorting to the global synchronous clock. A state-feedback controller is combined with the TMR realized as a closed-loop asynchronous machine and corrective behavior is operated whenever an unauthorized state transition is observed so as to recover the failed state of the asynchronous machine to the original one. As a case study, an asynchronous machine modelling of TMR and the detailed procedure of controller construction are presented. A simulation results using VHDL shows the validity of the proposed scheme.

• 정보과학회 논문지
• /
• 제41권10호
• /
• pp.774-784
• /
• 2014

상태 머신 다이어그램 결함 주입을 통하여 강건성 테스트 케이스를 생성하기 위한 연구가 수행되고 있다. 그러나 기존의 연구들은 상태 머신 다이어그램의 구조적인 측면만을 단순 고려하고 있기 때문에 작은 크기의 모델임에도 불구하고 많은 결함이 주입될 수 있다. 본 논문에서는 강건성 테스트의 효과성은 유지한 채, 주입될 결함의 수를 줄이기 위한 결함 주입 방법을 제안한다. 제안 방법은 전자레인지 상태 머신 다이어그램을 이용하여 설명되었으며, 유효성을 검증하기 위하여 해쉬 테이블 상태 머신 다이어그램에 제안 방법을 적용하였다. 해쉬 테이블에 적용된 실험 결과, 제안 연구는 강건성 테스트의 효과성은 유지하였으며, 주입된 결함의 수는 43%, 생성한 테스트 케이스의 수는 63% 감소시킨 것을 확인할 수 있었다.

• 전자공학회논문지
• /
• 제50권5호
• /
• pp.253-261
• /
• 2013

본 논문에서는 복합 비동기 순차 머신을 제어하는 방법을 다룬다. 논문에서 고려하는 비동기 머신은 입력/상태 머신 두 개가 직렬 결합된 것으로서 선행 머신의 출력 값이 후행 머신의 입력으로 전달된다. 제어 목적은 폐루프 시스템의 입력과 출력의 정상 상태 특성을 원하는 모델의 동작과 일치시키는 모델 정합 문제를 구현하는 교정 제어기를 꾸미는 일이다. 교정 제어기는 후행 머신의 상태 피드백 정보만 전달 받기 때문에 선행 머신의 상태를 정확하게 알 수 없는 불확실성이 존재한다. 본 논문에서는 그러한 불확실성 하에서 모델 정합 교정 제어기가 존재할 조건을 구하고 설계 알고리듬을 제안한다. 또한 사례 연구를 통해서 제안된 제어기의 설계 과정을 예시한다.

• Journal of Advanced Marine Engineering and Technology
• /
• 제37권7호
• /
• pp.760-770
• /
• 2013

Detecting grammatical errors from a text is a long-history application. In this paper, we compare the performance of two grammatical error detection techniques, which are implemented as a sub-module of an automated English scoring system. One is to use a full syntactic parser, which has not only grammatical rules but also extra-grammatical rules in order to detect syntactic errors while paring. The other one is to use a finite state machine which can identify an error covering a small range of an input. In order to compare the two approaches, grammatical errors are divided into three parts; the first one is grammatical error that can be handled by both approaches, and the second one is errors that can be handled by only a full parser, and the last one is errors that can be done only in a finite state machine. By doing this, we can figure out the strength and the weakness of each approach. The evaluation results show that a full parsing approach can detect more errors than a finite state machine can, while the accuracy of the former is lower than that of the latter. We can conclude that a full parser is suitable for detecting grammatical errors with a long distance dependency, whereas a finite state machine works well on sentences with multiple grammatical errors.