• 제어로봇시스템학회:학술대회논문집
• /
• 2005.06a
• /
• 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
• /
• v.4 no.1
• /
• pp.117-134
• /
• 1997

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

• 제어로봇시스템학회:학술대회논문집
• /
• 2002.10a
• /
• 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
• /
• v.20 no.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.10a
• /
• 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.

• 전기의세계
• /
• v.21 no.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.

• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.57 no.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.

• Journal of KIISE
• /
• v.41 no.10
• /
• pp.774-784
• /
• 2014

Studies of fault-injection into state machine diagram have been studied for generating robustness test cases. Conventional studies have, however, tended to inject too many faults into diagrams because they only have considered structural aspects of diagrams. In this paper, we propose a method that aims to reduce the number of injected fault without a decrease in effectivenss of robustness test. A proposed method is demonstrated using a microwave oven sate machine diagram and evaluated using a hash table state machine diagram. The result of the evaluation shows that the number of injected faults is decreased by 43% and the number of test cases is decreased by 63% without a decrease in effectiveness of hash table robustness test.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.50 no.5
• /
• pp.253-261
• /
• 2013

In this paper, we study the problem of controlling composite asynchronous sequential machines. The considered asynchronous machine consists of two input/state machines in cascade connection, where the output of the front machine is delivered to the input channel of the rear machine. The objective is to design a corrective controller realizing model matching such that the stable state behavior of the closed-loop system matches that of a reference model. Since the controller receives the state feedback of the rear machine only, there exists uncertainty about the present state of the front machine. We specify the existence condition for a corrective controller given the uncertainty. The design procedure for the proposed controller is described in a case study.

• Journal of Advanced Marine Engineering and Technology
• /
• v.37 no.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.