• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2004년도 하계학술대회 논문집 B
• /
• pp.1025-1027
• /
• 2004

Recently, the Single phase SRM has been researched and developed in many appliances with various types. This paper presents a theoretical representation of the phase inductance of a single phase SRM, as function of position and current, taking into account the non-linearity of the magnetic circuit. The method is based on the Fourier series expansion. the theoretical expressions for the calculation of instantaneous phase inductance, flux linkage, coenergy and electromagnetic torque as a function of rotor position and winding currents are derived. And it is compared with the results of the finite element analysis.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2001년도 ICCAS
• /
• pp.88.4-88
• /
• 2001

In this paper, we propose a solver for differential equations, using a multi-layer neural network. The multi-layer neural network is a transformer function originally where the function is differential and the explicit representation has been developed. The learning determines the response of neural networks; however, the response is not equal to the output values. The differential relations are also the response. The differential conditions can be also set as teaching data; therefore, there is a possibility to reach a new solver for the differential equations. Since it is unknown how to define the input data for the neural network solver during long terms, we could not derive the expressions. Recently, the analogue type neural network is known and it transforms any vector to another The "any" must be...

• 한국통신학회논문지
• /
• 제19권6호
• /
• pp.1095-1106
• /
• 1994

본 논문에서는 최소자승오차법(LMSE, least mean square error)을 이용하여 function processing(FP) 형태학 필터를 최적화하는 알고리즘을 제안한다. Erosion이나 dilation 연산들은 원하는 신호와 실제 필터의 출력 신호 사이의 평균자승오차(MSE, mean square error)를 최소화하는 농담(農談) 구조요소(GSE. grayscale structuring element)를 결정함으로써 최적화 된다. 본 논문에서는 LMS 트레이닝 알고리즘을 형태학 필터의 최적화에 적용하기 위하여 스텝 사이즈 매개변수 n가 만족해야 하는 조건을 보이고, 이를 이용하여 erosion이나 dilation 형태학 필터들의 최적 GSE를 결정할 수 있음을 보였다. 또한, 본 논문에서는 행렬을 사용하여 복합 형상한 연산들을 소역 행열 연산자로 새롭게 정의하고, 이소역 연산들에 LMS 알고리즘과 back-propagation 알고리즘을 적용하여 복합 형태학 필터들을 최적화할 수 있음을 보였다. 실험 부분에서는 제안된 최적 형상학 필터들을 2-D 영상에 적용한 결과를 보였다.

• 한국산학기술학회논문지
• /
• 제20권6호
• /
• pp.314-321
• /
• 2019

본 연구에서 개발된 Self-Adaptive Vision Correction Algorithm (SAVCA)은 광학적 특성을 모방하여 개발된 Vision Correction Algorithm (VCA)의 총 6개의 매개변수 중 자가 적응형태로 구축된 Division Rate 1 (DR1) 및 Division Rate 2 (DR2)를 제외한 Modulation Transfer Function Rate (MR), Astigmatic Rate (AR), Astigmatic Factor (AF) 및 Compression Factor (CF) 등 4개의 매개변수를 변경하여 사용성을 증대시키기 위해 제시되었다. 개발된 SAVCA의 검증을 위해 기존 VCA를 적용하였던 2개 변수를 갖는 수학 문제 (Six hump camel back 및 Easton and fenton) 및 30개 변수를 갖는 수학 문제 (Schwefel 및 Hyper sphere)에 적용한 결과 SAVCA는 비교한 다른 알고리즘 (Harmony Search, Water Cycle Algorithm, VCA, Genetic Algorithms with Floating-point representation, Shuffled Complex Evolution algorithm 및 Modified Shuffled Complex Evolution)에 비해 우수한 성능을 보여주었다. 마지막으로 공학 문제인 Speed reducer design에서도 SAVCA는 가장 좋은 결과를 보여주었다. 복잡한 매개변수 조절과정을 거치지 않은 SAVCA는 여러 분야에서 적용이 가능할 것이다.

• 대한수학회지
• /
• 제52권4호
• /
• pp.853-868
• /
• 2015

Let G be a complex semisimple simply connected linear algebraic group. The main result of this note is to give several equivalent criteria for the untwistedness of the twisted cubes introduced by Grossberg and Karshon. In certain cases arising from representation theory, Grossberg and Karshon obtained a Demazure-type character formula for irreducible G-representations as a sum over lattice points (counted with sign according to a density function) of these twisted cubes. A twisted cube is untwisted when it is a "true" (i.e., closed, convex) polytope; in this case, Grossberg and Karshon's character formula becomes a purely positive formula with no multiplicities, i.e., each lattice point appears precisely once in the formula, with coefficient +1. One of our equivalent conditions for untwistedness is that a certain divisor on the special fiber of a toric degeneration of a Bott-Samelson variety, as constructed by Pasquier, is basepoint-free. We also show that the strict positivity of some of the defining constants for the twisted cube, together with convexity (of its support), is enough to guarantee untwistedness. Finally, in the special case when the twisted cube arises from the representation-theoretic data of $\lambda$ an integral weight and $\underline{w}$ a choice of word decomposition of a Weyl group element, we give two simple necessary conditions for untwistedness which is stated in terms of $\lambda$ and $\underline{w}$.

• 한국전산응용수학회:학술대회논문집
• /
• 한국전산응용수학회 2003년도 KSCAM 학술발표회 프로그램 및 초록집
• /
• pp.9-9
• /
• 2003

Let $\Omega$ be a bounded, open, and polygonal domain in $R^2$ with re-entrant corners. We consider the following Partial Differential Equations: $$(I-\nabla\nabla\cdot+\nabla^{\bot}\nabla\times)u\;=\;f\;in\;\Omega$$, $$n\cdotu\;0\;0\;on\;{\Gamma}_{N}$$, $${\nabla}{\times}u\;=\;0\;on\;{\Gamma}_{N}$$, $$\tau{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$, $$\nabla{\cdot}u\;=\;0\;on\;{\Gamma}_{D}$$ where the symbol $\nabla\cdot$ and $\nabla$ stand for the divergence and gradient operators, respectively; $f{\in}L^2(\Omega)^2$ is a given vector function, $\partial\Omega=\Gamma_{D}\cup\Gamma_{N}$ is the partition of the boundary of $\Omega$; nis the outward unit vector normal to the boundary and $\tau$represents the unit vector tangent to the boundary oriented counterclockwise. For simplicity, assume that both $\Gamma_{D}$ and $\Gamma_{N}$ are nonempty. Denote the curl operator in $R^2$ by $$\nabla\times\;=\;(-{\partial}_2,{\partial}_1$$ and its formal adjoint by $${\nabla}^{\bot}\;=\;({-{\partial}_1}^{{\partial}_2}$$ Consider a weak formulation(WF): Find $u\;\in\;V$ such that $$a(u,v):=(u,v)+(\nabla{\cdot}u,\nabla{\cdot}v)+(\nabla{\times}u,\nabla{\times}V)=(f,v),\;A\;v{\in}V$$. (2) We assume there is only one singular corner. There are many methods to deal with the domain singularities. We introduce them shortly and we suggest a new Finite Element Methods by using Singular representation for the solution.

• Journal of Electrical Engineering and Technology
• /
• 제6권6호
• /
• pp.867-873
• /
• 2011

A navigation mesh (NavMesh) is a suitable tool for the representation of a three-dimensional game world. A NavMesh consists of convex polygons covering free space, so the path can be found reliably without detecting collision with obstacles. The main disadvantage of a NavMesh is the huge state space. When the $A^*$ algorithm is applied to polygonal meshes for detailed terrain representation, the pathfinding can be inefficient due to the many states to be searched. In this paper, we propose a method to reduce the number of states searched by using visibility tests to achieve fast searching even on a detailed terrain with a large number of polygons. Our algorithm finds the visible vertices of the obstacles from the critical states and uses the heuristic function of $A^*$, defined as the distance to the goal through such visible vertices. The results show that the number of searched states can be substantially reduced compared to the $A^*$ search with a straight-line distance heuristic.

• 한국도서관정보학회지
• /
• 제39권4호
• /
• pp.283-304
• /
• 2008

본 연구의 목적은 이용자의 탐색 행태, 시스템의 정보 구축 행태를 기반으로 초기 질의어의 범주에 해당하는 연관 용어들(해당 용어의 지식구조와 관련된 연관 용어들)을 학습기능을 통해 자동으로 제시해 줄 수 있는 지능형 검색 시스템을 구현하는 것이다. 이를 위해 학습을 통해 전문가 수준의 색인어를 추출할 수 있는 지능형자동색인 알고리즘, 자동분류에 관련한 클러스터링 알고리즘과 문서 범주화 알고리즘 그리고 범주 표현 알고리즘에 대한 이론적 연구를 수행하였으며, 이들 이론적 연구를 근거로 비용과 시간적인 측면에서 그리고 재현율과 정도율이란 측면에서 우수한 성능을 발휘할 수 있는 지능형검색시스템을 구현하였다.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제11권3호
• /
• pp.1477-1491
• /
• 2017

Inspired by the multi-scale nature of hippocampal place cells, a biologically inspired model based on a multi-scale spatial representation for goal-directed navigation is proposed in order to achieve robotic spatial cognition and autonomous navigation. First, a map of the place cells is constructed in different scales, which is used for encoding the spatial environment. Then, the firing rate of the place cells in each layer is calculated by the Gaussian function as the input of the Q-learning process. The robot decides on its next direction for movement through several candidate actions according to the rules of action selection. After several training trials, the robot can accumulate experiential knowledge and thus learn an appropriate navigation policy to find its goal. The results in simulation show that, in contrast to the other two methods(G-Q, S-Q), the multi-scale model presented in this paper is not only in line with the multi-scale nature of place cells, but also has a faster learning potential to find the optimized path to the goal. Additionally, this method also has a good ability to complete the goal-directed navigation task in large space and in the environments with obstacles.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2000년도 제15차 학술회의논문집
• /
• pp.470-470
• /
• 2000

This paper describes a new method of identifcation of backlash nonlinear systems by use of M-sequence correlation method. In this method, we can obtain not only Volterra kernels of up to 3rd order of the nonlinear system, but also the width of the backlash element from observing the crosscorrelation between the input and the output. Here strictly speaking, a multi-valued nonlinear system such as backlash element can not be expressed by Volterra kernel representation mathematically. But in practice, we encounter many cases where it is difficult to treat them mathematically but they can be controlled from experience. So we here dare to suppose that backlash nonlinear system can be approximated by Volterra kernel representation. Simulations are carried out on a nonlinear system consisting of linear part plus backlash element. And Volterra kernels are measured. The output calculated from the observed Volterra kernels is in good agreement wi th the actual output. And we show that we can obtain the width of backlash element, which is one of the most important parameters, by observing the maximum value of crosscorrelation function between the input M-sequence and the output.