• 제목/요약/키워드: computational primitive

검색결과 57건 처리시간 0.025초

SOME REMARKS ON IRREDUCIBLE AUTOMATA AND PRIMITIVE SEMIGROUPS ASSOCIATED WITH THEM

  • Park, Chin-Hong;Shim, Hong-Tae
    • Journal of applied mathematics & informatics
    • /
    • 제14권1_2호
    • /
    • pp.485-491
    • /
    • 2004
  • We shall discuss irreducible and primitive S-automata. A variety of properties of transitive and primitive semigroups associated with them have been obtained. Also a classification of primitive semi groups will be given with S-automata.

서로 다른 프리미티브 집합을 사용하는 CAD 시스템 사이에 선박 의장 설계 데이터의 교환 (Ship Outfitting Design Data Exchange between CAD Systems Using Different Primitive Set)

  • 이승훈;한순흥
    • 한국CDE학회논문집
    • /
    • 제18권3호
    • /
    • pp.234-242
    • /
    • 2013
  • Different CAD systems are used in ship outfitting design on different usage and purpose. Therefore, data exchanges between CAD systems are required from different formats. For data exchange, boundary representation standard formats such as IGES and ISO 10303 (STEP) are widely used. However, they present only B-rep representation. Because of different CAD systems have their own geometry format, data exchanges with design intend are difficult. Especially, Tribon and PDMS use primitives for express their geometry in ship outfitting design. However, Tribon primitives are represented their parameter by values that are non-parametric. Therefore, data size of catalogue library is bigger than different CAD system using parametric primitive representation. And that system has difficulty on data reprocessing. To solve that problem, we discuss about shape DB which contains design parameters of primitive for exchange Tribon primitives. And geometry data exchange between Tribon and Shape Database that defines based on PDMS scheme are specified using primitive mapping that can represent design intend.

VHDL을 이용한 다차원 디지털 필터의 PLD 구현 (PLD implementation of the N-D digital filter with VHDL)

  • 정재길
    • 공학논문집
    • /
    • 제6권1호
    • /
    • pp.111-124
    • /
    • 2004
  • 반도체 기술의 발전과 설계환경의 변화로 비용과 시간이 많이 소요되는 Custom-VLSI 구현 방식보다 Programmable Logic Device (PLD)를 이용한 시스템 구현이 일반화 되어 가는 추세이다. 또한 설계 방식도 Schematic Capture 방식 대신에 보다 효율적이고 표준화된 방식인 Hardware Description Language (HDL)의 활용으로 변화하고 있다. 본 연구에서는 지난 연구 결과를 확장하여 활용영역을 넓혀 가고 있는 다차원 디지털 필터를 PLD를 이용하여 효율적으로 구현할 수 있는 구조를 연구하여 제안하였다. 다차원 디지털 필터링 알고리즘의 효율적인 구현을 위하여 알고리즘 분해방법을 이용하였다. 알고리즘 분해방법은 다차원 디지털 신호처리 알고리즘에 내재된 병렬성을 상태공간식을 이용하여 추출하고, 이로부터 computational primitive(CP)를 얻을 수 있도록 하여준다. 구해진 CP는 VHDL을 이용하여 설계하였으며, 이를 component로 활용하여 효율적인 다차원 디지털 필터를 설계하였다. 설계된 필터를 PLD에 구현함으로써 시스템에 장착된 상태에서 upgrade가 가능하게 되었을 뿐만 아니라, 다차원 디지털 필터를 필요로 하는 모든 시스템의 설계에 component로 사용함으로써 시스템의 Time-to-market 시간을 크게 단축할 수 있다.

  • PDF

ON FINITE GROUPS WITH EXACTLY SEVEN ELEMENT CENTRALIZERS

  • Ashrafi Ali-Reza;Taeri Bi-Jan
    • Journal of applied mathematics & informatics
    • /
    • 제22권1_2호
    • /
    • pp.403-410
    • /
    • 2006
  • For a finite group G, #Cent(G) denotes the number of centralizers of its elements. A group G is called n-centralizer if #Cent(G) = n, and primitive n-centralizer if #Cent(G) = #Cent($\frac{G}{Z(G)}$) = n. The first author in [1], characterized the primitive 6-centralizer finite groups. In this paper we continue this problem and characterize the primitive 7-centralizer finite groups. We prove that a finite group G is primitive 7-centralizer if and only if $\frac{G}{Z(G)}{\simeq}D_{10}$ or R, where R is the semidirect product of a cyclic group of order 5 by a cyclic group of order 4 acting faithfully. Also, we compute #Cent(G) for some finite groups, using the structure of G modulu its center.

알고리즘 분해방법을 이용한 Linear Window Operator의 구현 (A Linear Window Operator Based Upon the Algorithm Decomposition)

  • 정재길
    • 정보학연구
    • /
    • 제5권1호
    • /
    • pp.133-142
    • /
    • 2002
  • 본 논문에서는 linear window operator의 효율적인 구현 방안을 제안하였다. 블록 상태 공간함수를 이용하여 computational primitive를 찾아내고 이를 이용하여 프로세사의 datapath의 구현에 사용함으로서 효율적인 linear window operator의 구현을 가능하게 하였다. 또한 linear window operator의 실시간 처리를 위하여 데이터 분할 기법을 사용한 다중 프로세서 구조를 제안하였다. 블록의 크기에 따른 성능 분석을 통하여 제시된 프로세서 및 다중 프로세서의 성능이 우수함을 보였다.

  • PDF

TIGHT UPPER BOUND ON THE EXPONENTS OF A CLASS OF TWO-COLORED DIGRAPHS

  • Wang, Rong;Shao, Yanling;Gao, Yubin
    • Journal of applied mathematics & informatics
    • /
    • 제26권3_4호
    • /
    • pp.627-641
    • /
    • 2008
  • A two-colored digraph D is primitive if there exist nonnegative integers hand k with h + k > 0 such that for each pair (i, j) of vertices there exists an (h, k)-walk in D from i to j. The exponent of the primitive two-colored digraph D is the minimum value of h + k taken over all such hand k. In this paper, we give the tight upper bound on the exponents of a class of primitive two-colored digraphs with (s + 1) n-cycles and one (n - 1)-cycle, and the characterizations of the extremal two-colored digraphs.

  • PDF

MINIMAL QUADRATIC RESIDUE CYCLIC CODES OF LENGTH $2^{n}$

  • BATRA SUDHIR;ARORA S. K.
    • Journal of applied mathematics & informatics
    • /
    • 제18권1_2호
    • /
    • pp.25-43
    • /
    • 2005
  • Let F be a finite field of prime power order q(odd) and the multiplicative order of q modulo $2^{n}\;(n>1)\;be\; {\phi}(2^{n})/2$. If n > 3, then q is odd number(prime or prime power) of the form $8m{\pm}3$. If q = 8m - 3, then the ring $R_{2^n} = F[x]/ < x^{2^n}-1 >$ has 2n primitive idempotents. The explicit expressions for these primitive idempotents are obtained and the minimal QR cyclic codes of length $2^{n}$ generated by these idempotents are completely described. If q = 8m + 3 then the expressions for the 2n - 1 primitive idempotents of $R_{2^n}$ are obtained. The generating polynomials and the upper bounds of the minimum distance of minimal QR cyclic codes generated by these 2n-1 idempotents are also obtained. The case n = 2,3 is dealt separately.

메커니즘 공간 배치의 정성적 표현과 부호 대수를 이용한 공간 거동 추론 (Qualitative Representation of Spatial Configuration of Mechanisms and Spatial Behavior Reasoning Using Sign Algebra)

  • 한영현;이건우
    • 한국CDE학회논문집
    • /
    • 제5권4호
    • /
    • pp.380-392
    • /
    • 2000
  • This paper proposes a qualitative reasoning approach for the spatial configuration of mechanisms that could be applied in the early phase of the conceptual design. The spatial configuration problem addressed in this paper involves the relative direction and position between the input and output motion, and the orientation of the constituent primitive mechanisms of a mechanism. The knowledge of spatial configuration of a primitive mechanism is represented in a matrix form called spatial configuration matrix. This matrix provides a compact and convenient representation scheme for the spatial knowledge, and facilitates the manipulation of the relevant spatial knowledge. Using this spatial knowledge of the constituent primitive mechanisms, the overall configuration of a mechanism is described and identified by a spatial configuration state matrix. This matrix is obtained by using a qualitative reasoning method based on sign algebra and is used to represent the qualitative behavior of the mechanism. The matrix-based representation scheme allows handling the involved spatial knowledge simultaneously and the proposed reasoning method enables the designer to predict the spatial behavior of a mechanism without knowing specific dimension of the components of the mechanism.

  • PDF

Biased hooking for primitive chain network simulations of block copolymers

  • Masubuchi Yuichi;Ianniruberto Giovanni;Marrucci Giuseppe;Greco Francesco
    • Korea-Australia Rheology Journal
    • /
    • 제18권2호
    • /
    • pp.99-102
    • /
    • 2006
  • Primitive chain network model for block copolymers is used here to simulate molecular dynamics in the entangled state with acceptable computational cost. It was found that i) the hooking procedure rearranging the topology of the entangled network is critical for the equilibrium structure of the system, and ii) simulations accounting for the different chemistry, i.e., with a biased hooking probability based on interaction parameter ${\chi}$ for selection of the hooked partner, generates a reasonable phase diagram.