• Proceedings of the KIEE Conference
• /
• 2015.07a
• /
• pp.669-670
• /
• 2015

In this paper, rotor design modification of a novel proposed machine termed the Axial Flux Doubly Fed Reluctance Machine (AF-BDFRM) is studied. The main potential advantage of AF-BDFRM is that it has larger torque and power density compared to radial flux-BDFRM. However, with the general rotor pole shape, this machine output back EMF has high THD % and high cogging torque. This paper studies the rotor design modification in the proposed AF-BDFRM to reduce the THD % in inducedd back EMF and cogging torque. Also the transient 3D finite element analysis (FEA) optimization of initial design is presented.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.17 no.1
• /
• pp.29-34
• /
• 2008

A modeling technique for the 2-way coupling of heat transfer and conduction currents has been performed to inspire a combined analytical simulation. The 3-D finite element method is used to solve steady conduction currents and heat generation in an aluminum film deposited on a silicon substrate. The model investigates the temperature in the device after the current is applied. The conservation equation of energy, the Maxwell equations for conduction currents, the unsteady state heat transfer equation and the Fourier's law for heat transfer are implemented as a bidirectionally coupled problem. It is found that the strongly coupled temperature and time dependent heat equations give a reasonable results and an explicit solving technique.

• Proceedings of the Korean Information Science Society Conference
• /
• 2006.06a
• /
• pp.178-180
• /
• 2006

저 전력 마이크로 프로세서와 무선 통신 모듈, 통합된 시스템 장치들을 내장한 센서 노드를 이용하여 구축 된 센서 네트워크는 동작환경과 구조가 특이하며 시스템 설계 시 많은 제약 조건들이 고려되어야 한다. 이러한 센서 네트워크의 각 노드는 센서를 이용한 정보 수집과 같은 여러 가지 응용 프로그램, 노드 간 통신, 제한된 시스템 자원을 효율적으로 관리 할 수 있는 기능들이 필요하며 이에 센서 노드를 위한 여러 가지 운영체제들이 제안되었다. 본 논문에서는 센서 노드를 위해 효과적이고 응용의 변화에 대처할 수 있도록 동적 재구성 기능을 지원하도록 설계된 유한 상태 머신 (finite state machine) 기반의 운영체제인 SenOS의 특징과 구현된 SenOS를 개선한 결과를 발표한다.

• Journal of Korea Game Society
• /
• v.2 no.2
• /
• pp.52-59
• /
• 2002

This paper introduces FSM, statistical FSM and NFA that are used for assigning behaviors of NPCs in computer games. We propose a new method for remedy of the weakness of previous studies. We use the method of inferencing stochastic grammars to generate NPCs behaviors. Using this method we can generate a lot of MPCs or Computer Players behaviors automatically and the games will be more enjoyable.

• Transactions of the Korean Society of Machine Tool Engineers
• /
• v.10 no.1
• /
• pp.16-22
• /
• 2001

In this study for reduction degree of freedom of dynamic model, a mixed method to combined finite element method and transfer matrix method is presented. This offers the advantages of an automatic reduction in the size of the eigenvalues problem and of a straightforward means of dynamic substructuring. The analytical procedure in this method for dynamic analysis of 3-dimensional cantilevered box beam are described. the result of numerical example is shown to demonstate the efficiency and accuracy of this method. The result form this example agree well those obtained by ANSYS, By using this technique, the number of nodes required in the regular finite element method is reduced and therefore a smaller com-puter can be used.

• Journal of Korea Society of Industrial Information Systems
• /
• v.16 no.2
• /
• pp.85-97
• /
• 2011

Wireless sensor networks have emerged as one of the key enabling technologies for ubiquitous computing since wireless intelligent sensor nodes connected by short range communication media serve as a smart intermediary between physical objects and people in ubiquitous computing environment. We recognize the wireless sensor network as a massively distributed and deeply embedded system. Such systems require concurrent and asynchronous event handling as a distributed system and resource-consciousness as an embedded system. Since the operating environment and architecture of wireless sensor networks, with the seemingly conflicting requirements, poses unique design challenges and constraints to developers, we propose a very new operating system for sensor nodes based on finite state machine. In this paper, we clarify the design goals reflected from the characteristics of sensor networks, and then present the heart of the design and implementation of a compact and efficient state-driven operating system, SenOS. We describe how SenOS can operate in an extremely resource constrained sensor node while providing the required reactivity and dynamic reconfigurability with low update cost. We also compare our experimental results after executing some benchmark programs on SenOS with those on TinyOS.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.13 no.3
• /
• pp.231-238
• /
• 1988

A new approach to the reachability analysis of communication protocols is presented using a modified maximal progress state exploation for two communicating finite state machines. The task of generating all reachable states is divided into two independent subtasks. In each subtask, only the states which are reachable by forcing modified maximal progress sequence for one machine are generated. Modified maximal progress state exploration saves space and time over maximal progress state exploration.

• Journal of Electrical Engineering and information Science
• /
• v.2 no.6
• /
• pp.43-47
• /
• 1997

A procedure presented in this paper generates test sequences to check the conformity of an implementation with a protocol specification, which is modeled as a deterministic finite state machine (FSM). Given a FSM, a common procedure of test sequence generation, first, constructs a directed graph which edges include the state check after each transition, and produces a symmetric graph G* from and, finally, finds a Euler tour of G*. We propose a technique to determine a minimum-cost tour of the transition graph of the FSM. The proposed technique using Multiple Unique State Signature (MUSS) solves an open issue that one MUIO sequence assignment may lead to two more edges of unit cost being replicated to from G* while an optimal assignment may lead to the replication of a single edge of high cost. In this paper, randomly generated FSMs have been studied as test cases. The result shows that the proposed technique saves the cost 4∼28% and 2∼21% over the previous approach using MUIO and MUSP, respectively.

• Journal of Digital Convergence
• /
• v.14 no.8
• /
• pp.415-421
• /
• 2016

A behavior tree is to express the behavior of artificial intelligence. The behavior tree has a characteristic that is easy to change state transitions than FSM(Finite State Machine), see the progress of the action. For these reasons, the behavior tree is widely used in more than FSM. This paper is to analyze the advantages and disadvantages on behavior trees of game engines, proposes the improved behavior tree based on analyzed them. To achieve this, in this paper, first, examines the role of node and the behavior tree structure of the unity engine, unreal engine. Second, discusses the advantages and disadvantages based on it. Third, proposes the behavior tree to improve the disadvantages of behavior tree of unity engine and unreal engine, depth of behavior tree and search time required to select the execution node. This paper can help developers using the tree to develop the game.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.19-25
• /
• 2013

The increasing demand for fast, flexible and guaranteed Quality of Service (QoS) in core networks has caused to deploy MultiProtocol Label Switching (MPLS) and Generalized MPLS (GMPLS) control plane. In GMPLS control plane, path computation and cooperation processes are one of the crucial element to maintain an acceptable level of service. The Internet Engineering Task Force (IETF) has proposed the Path Computation Element (PCE) architecture. The PCE is a dedicated network element devoted to path computation process and communications between Path Computation Clients (PCC) and PCEs is realized through the PCE Protocol (PCEP). This paper examines the PCE-based path computation architecture to include the design and implementation of PCEP. The functional modules including Finite State Machine (FSM) and related key design issues of each state are presented. In particular we also discuss internal/external protocol interfaces that efficiently control the communication channels.