• Title/Summary/Keyword: canonical representation

Search Result 21, Processing Time 0.026 seconds

A CANONICAL REPRESENTATION FOR THE SOLUTION OF FUZZY LINEAR SYSTEM AND FUZZY LINEAR PROGRAMMING PROBLEM

  • NEHI HASSAN MISHMAST;MALEKI HAMID REZA;MASHINCHI MASHAALAH
    • Journal of applied mathematics & informatics
    • /
    • v.20 no.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.

ALGEBRAIC KERNEL FUNCTIONS AND REPRESENTATION OF PLANAR DOMAINS

  • Jeong, Moon-Ja;Taniguchi, Masahiko
    • Journal of the Korean Mathematical Society
    • /
    • v.40 no.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.

The Design of Variable Structure Controller for the System in Phase Canonical Form with Incomplete State Measurements (비 측정 상태변수를 갖는 위상 표준형계통에 대한 가변구조 제어기의 설계)

  • 박귀태;최중경
    • The Transactions of the Korean Institute of Electrical Engineers
    • /
    • v.41 no.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.

  • PDF

An Efficient Algorithm for Computing Multiplicative Inverses in GF($2^m$) Using Optimal Normal Bases (최적 정규기저를 이용한 효율적인 역수연산 알고리즘에 관한 연구)

  • 윤석웅;유형선
    • The Journal of Society for e-Business Studies
    • /
    • v.8 no.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.

  • PDF

Realization and Canonical Representation of Linear Systems through I/O Maps

  • Fadali, M. Sami;Oloomi, Hossein M.
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 2004.08a
    • /
    • 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.

  • PDF

The effect of orientation on recognizing object representation (규범적 표상의 방향성 효과)

  • Jung, Hyo-Sun;Lee, Seung-Bok;Jung, Woo-Hyun
    • Science of Emotion and Sensibility
    • /
    • v.11 no.4
    • /
    • pp.501-510
    • /
    • 2008
  • The purpose of this study was to investigate whether the orientation of the head position across different categories affect reaction time and accuracy of object recognition. Fifty four right handed undergraduate students were participated in the experiment. Participants performed the word-picture matching tasks, which were different in terms of head direction of object (i.e., Left-headed or Right-headed) and object category (i.e., natural : animal or artificial : tool). Participants were asked to decide whether each picture matched the word which was followed by the picture. For accuracy, no statistically significant difference was found for both animal and tool pictures due to the ceiling effect. Interaction effect of category and orientation were statistically significant, whereas only the main effect of category was significant. In the animal condition, faster reaction times were observed for left to right than right to left presentation, while no statistical significant difference was found in the tool condition. The orientation of the object's canonical representation was different across different categories. The faster RT for the animal condition implies that the canonical representation for animal is left-headed. This could be due to the orientation of the face.

  • PDF

A New Flash A/D Converter Adopting Double Base Number System (2개의 밑수를 이용한 Flash A/D 변환기)

  • Kim, Jong-Soo;Kim, Man-Ho;Jang, Eun-Hwa
    • Journal of the Institute of Convergence Signal Processing
    • /
    • v.9 no.1
    • /
    • pp.54-61
    • /
    • 2008
  • This paper presents a new TIQ based CMOS flash 6-bit ADC to process digital signal in real time. In order to improve the conversion speed of ADC by designing new logic or layout of ADC circuits, a new design method is proposed in encoding logic circuits. The proposed encoding circuits convert analog input into digitally encoded double base number system(DBNS), which uses two bases unlike the normal binary representation scheme. The DBNS adopts binary and ternary radix to enhance digital arithmetic processing capability. In the DBNS, the addition and multiplication can be processed with just shift operations only. Finding near canonical representation is the most important work in general DBNS. But the main disadvantage of DBNS representation in ADC is the fan-in problem. Thus, an equal distribution algorithm is developed to solve the fan-in problem after assignment the prime numbers first. The conversion speed of simulation result was 1.6 GSPS, at 1.8V power with the Magna $0.18{\mu}m$ CMOS process, and the maximum power consumption was 38.71mW.

  • PDF

Harriot's Symbolism and the Theory of Equation (해리엇의 기호주의와 방정식론)

  • Kye, Young Hee;Shin, Kyunghee
    • Journal for History of Mathematics
    • /
    • v.26 no.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.

Processing of allophonic variants from optional vs. obligatory phonological processes

  • Han, Jeong-Im
    • Phonetics and Speech Sciences
    • /
    • v.7 no.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).