• Title/Summary/Keyword: modular representation theory

Search Result 3, Processing Time 0.018 seconds

SUBREGULAR POINTS FOR SOME CASES OF LIE ALGEBRAS

  • KIM, Y.K.;SO, K.H.;JEONG, J.W.;PARK, D.Y.;CHOI, S.H.
    • Honam Mathematical Journal
    • /
    • v.21 no.1
    • /
    • pp.75-95
    • /
    • 1999
  • Dimensions of irreducible $so_5(F)$-modules over an algebraically closed field F of characteristics p > 2 shall be obtained. It turns out that they should be coincident with $p^{m}$, where 2m is the dimension of coadjoint orbits of ${\chi}{\in}so_5(F)^*{\backslash}0$ as Premet asserted. But there is no subregular point for $g=sp_4(F)=so_5(F)$ over F.

  • PDF

Parallel Modular Multiplication Algorithm to Improve Time and Space Complexity in Residue Number System (RNS상에서 시간 및 공간 복잡도 향상을 위한 병렬 모듈러 곱셈 알고리즘)

  • 박희주;김현성
    • Journal of KIISE:Computer Systems and Theory
    • /
    • v.30 no.9
    • /
    • pp.454-460
    • /
    • 2003
  • In this paper, we present a novel method of parallelization of the modular multiplication algorithm to improve time and space complexity on RNS (Residue Number System). The parallel algorithm executes modular reduction using new table lookup based reduction method. MRS (Mixed Radix number System) is used because algebraic comparison is difficult in RNS which has a non-weighted number representation. Conversion from residue number system to certain MRS is relatively fast in residue computer. Therefore magnitude comparison is easily Performed on MRS. By the analysis of the algorithm, it is known that it requires only 1/2 table size than previous approach. And it requires 0(ι) arithmetic operations using 2ㅣ processors.

Structured DEVS Formalism: A Structural Modelling Method of Discrete Event Systems (Structured DEVS Formalism: 이산사건 시스템의 구조적 모델링 기법)

  • Song, Hae-Sang
    • Journal of the Korea Society for Simulation
    • /
    • v.21 no.2
    • /
    • pp.19-30
    • /
    • 2012
  • In recent decades, it has been known that the Discrete Event System Specification, or DEVS, formalism provides sound semantics to design a modular and hierarchical model of a discrete event system. In spite of this benefit, practitioners have difficulties in applying the semantics to real-world systems modeling because DEVS needs to specify a large size of sets of events and/or states in an unstructured form. To resolve the difficulties, this paper proposes an extension of the DEVS formalism, called the Structured DEVS formalism, with an associated graphical representation, called the DEVS diagram, by means of structural representation of such sets based on closure property of set theory. The proposed formalism is proved to be equivalent to the original DEVS formalism in their model specification, yet the new formalism specifies sets in a structured form with a concept of phases, variables and ports. A simplified example of the structured DEVS with the DEVS diagram shows the effectiveness of the proposed formalism which can be easily implemented in an objected-oriented simulation environment.