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

In this paper first, we find a canonical symmetrical trapezoidal(triangular) for the solution of the fuzzy linear system $A\tilde{x}=\tilde{b}$, where the elements in A and $\tilde{b}$ are crisp and arbitrary fuzzy numbers, respectively. Then, a model for fuzzy linear programming problem with fuzzy variables (FLPFV), in which, the right hand side of constraints are arbitrary numbers, and coefficients of the objective function and constraint matrix are regarded as crisp numbers, is discussed. A numerical procedure for calculating a canonical symmetrical trapezoidal representation for the solution of fuzzy linear system and the optimal solution of FLPFV, (if there exist) is proposed. Several examples illustrate these ideas.

• 대한수학회지
• /
• 제40권3호
• /
• pp.447-460
• /
• 2003

In this paper we study the non-degenerate n-connected canonical domains with n>1 related to the conjecture of S. Bell in [4]. They are connected to the algebraic property of the Bergman kernel and the Szego kernel. We characterize the non-degenerate doubly connected canonical domains.

• 대한수학회보
• /
• 제24권1호
• /
• pp.47-47
• /
• 1987

• 대한전기학회논문지
• /
• 제41권8호
• /
• pp.902-913
• /
• 1992

There have been several control schemes for the single input systems with unmeasurable state variables using variable structure control(VSC) theory. In the previous VSC, the systems must be represented in phase canonical form and the complete measurements for each state variable must be assumed. In order to eliminate these restrictions several VSC methods were proposed. And especially for the systems in phase canonical form with unmeasurable state variables, the reduced order switching function algorithm was proposed. But this method has many drawbacks and can not be used in the case of general form (not phase canonical form) dynamic system. Therefore this paper propose new construction method of switching fuction for the systems in phase canonical form, which reduce the restriction of reduced order switching function algorithm. And this algorithm can be realized for any state representation and adopted in the systems where not all states are available for switching function synthesis or control.

• 한국전자거래학회지
• /
• 제8권1호
• /
• pp.113-119
• /
• 2003

This paper proposes a new multiplicative inverse algorithm for the Galois field GF (2/sup m/) whose elements are represented by optimal normal basis type Ⅱ. One advantage of the normal basis is that the squaring of an element is computed by a cyclic shift of the binary representation. A normal basis element is always possible to rewrite canonical basis form. The proposed algorithm combines normal basis and canonical basis. The new algorithm is more suitable for implementation than conventional algorithm.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1593-1598
• /
• 2004

In this paper, we use the input and output maps and develop simple procedures to obtain realizations for linear continuous-time systems. The procedures developed are numerically efficient and yield explicit formulae for the state space matrices of the realization in terms of the system parameters, notably the system modes. Both cases of the systems with distinct modes and repeated modes are treated. We also present a procedure for converting a realization obtained through the input or output map into the Jordan canonical form. The transformation matrices required to bring the realization into the Jordan canonical form are specified entirely in terms of the system modes.

• 감성과학
• /
• 제11권4호
• /
• pp.501-510
• /
• 2008

규범적 표상은 단어나 주제가 주어졌을 때 자연스럽게 떠오르는 심상이다. 이러한 규범적 표상은 대상의 특징을 가장 잘 드러낼 수 있는 특정한 조망이나 방향으로 떠오르게 된다. 규범적 표상이 측면임을 시사하는 선행 연구를 바탕으로 본 연구에서는 규범적 표상의 방향성을 검토하였다. 규범적 표상을 자연범주와 인공범주로 구분하여 자극의 제시 방향에 따른 차이를 알아보았다. 실험은 그림의 방향성(왼쪽/오른쪽)과 범주(동물, 자연범주/도구, 인공범주)를 두 가지 독립변인으로 하여 설계하였으며 단어-그림 일치 판단과제를 사용하여 정답 반응률과 반응시간을 측정하였다. 그 결과, 정답 반응률은 범주 내에서 방향성에 따른 모든 조건에서 천장효과를 보였으며 아주 근소한 차이만 있었다. 반응시간에서 범주변인의 주효과, 범주와 방향성의 상호작용 효과가 나타났다. 특히 자연범주에 속하는 동물 그림에서 방향성 효과가 관찰되었다. 동물의 머리가 왼쪽으로 향하는 그림이 오른쪽으로 향하는 그림 보다 반응시간이 유의하게 빨랐다. 그러나 인공범주에 속하는 도구 그림에서는 방향성의 효과가 나타나지 않았다. 이러한 결과는 동물의 규범적 표상의 방향성은 왼쪽을 향하는 것임을 시사한다.

• 융합신호처리학회논문지
• /
• 제9권1호
• /
• pp.54-61
• /
• 2008

본 논문에서는 디지털 신호를 실시간으로 처리하기 인한 TIQ 방식의 Flash 6-bit ADC 회로를 설계하였다. 새로운 논리회로 설계나 소자들의 근접 배치로 ADC의 속도를 향상시키는 대신에 새로운 코드를 이용하여 DSP의 처리능력을 높이도록 하였다. 제안한 코드는 ADC의 출력으로 이진수를 세공하지 않고 2와 3진법을 동시에 사용하는 Double Base Number System(DBNS)방법이다. 전압은 기존의 이진수를 표시하는 방법과 동일하지만, 밑수로 2와 3의 두개를 동시에 사용하여 합의 형태로 표현하는 방법이다. DBNS 표현법은 곱셈기와 가산기를 이용하지 않고 연산을 좌우로 이동하여 연산을 신속히 처리할 수 있다. 디지털 신호처리에서 사용하는 DBNS는 합의 수가 적도록 Canonical 표현을 구하는 알고리즘을 사용하지만, A/D 변환기에서는 Fan-In 문제가 발생하여 균일한 분포를 이루도록 하는 새로운 알고리즘을 개발하였다. HSPICE를 이용한 ADC의 시뮬레이션 결과 0.18um 공정에서 최고 동작속도는 1.6 GSPS이며 최대 소비전력은 38.71mW이였다.

• 한국수학사학회지
• /
• 제26권5_6호
• /
• pp.355-370
• /
• 2013

Thomas Harriot has been introduced in middle school textbooks as a great mathematician who created the sign of inequality. This study is about Harriot's symbolism and the theory of equation. Harriot made symbols of mathematical concepts and operations and used the algebraic visual representation which were combinations of symbols. He also stated solving equations in numbers, canonical, and by reduction. His epoch-making inventions of algebraic equation using notation of operation and letters are similar to recent mathematical representation. This study which reveals Harriot's contribution to general and structural approach of mathematical solution shows many developments of algebra in 16th and 17th centuries from Viete to Harriot and from Harriot to Descartes.

• 말소리와 음성과학
• /
• 제7권3호
• /
• pp.27-35
• /
• 2015

The purpose of this study is to examine the lexical representation of phonological variants derived from optional vs. obligatory phonological processes. Given that place assimilation is optionally processed, whereas nasal assimilation is obligatory in Korean, a long-term repetition priming experiment was conducted, using a shadowing task. Korean speakers shadowed words containing either assimilated or unassimilated consonants in three priming conditions and their shadow responses were evaluated. It was shown that in both place and nasal assimilations, shadowing latencies for unassimilated stimuli were longer than those for assimilated stimuli in the mismatched condition. These results suggest that even in the optional assimilation, assimilated variants were processed more easily and faster than the canonical variants. The present results argue against the frequency-based account of multiple lexical representation (Connine, 2004; Connine & Pinnow, 2006; Ranbom & Connine, 2007; $B{\ddot{u}rki$, Ernestus, & Frauenfelder, 2010; $B{\ddot{u}rki$, Alario, & Frauenfelder, 2011).