• Title/Summary/Keyword: Class function table matrix

Search Result 3, Processing Time 0.015 seconds

Class function table matrix of finite groups

  • Park, Won-Sun
    • Journal of the Korean Mathematical Society
    • /
    • v.32 no.4
    • /
    • pp.689-695
    • /
    • 1995
  • Let G be a finite group with k distinct conjugacy classes $C_1, C_2, \cdots, C_k$ and F an algebraically closed field such that char$(F){\dag}\left$\mid$ G \right$\mid$$. We denoted by $Irr_F$(G) the set of all irreducible F-characters of G and $Cf_F$(G) the set of all class functions of G into F. Then $Cf_F$(G) is a commutative F-algebra with an F-basis $Irr_F(G) = {\chi_1, \chi_2, \cdots, \chi_k}$.

  • PDF

Development of Monte Carlo Simulation Code for the Dose Calculation of the Stereotactic Radiosurgery (뇌 정위 방사선수술의 선량 계산을 위한 몬테카를로 시뮬레이션 코드 개발)

  • Kang, Jeongku;Lee, Dong Joon
    • Progress in Medical Physics
    • /
    • v.23 no.4
    • /
    • pp.303-308
    • /
    • 2012
  • The Geant4 based Monte Carlo code for the application of stereotactic radiosurgery was developed. The probability density function and cumulative density function to determine the incident photon energy were calculated from pre-calculated energy spectrum for the linac by multiplying the weighting factors corresponding to the energy bins. The messenger class to transfer the various MLC fields generated by the planning system was used. The rotation matrix of rotateX and rotateY were used for simulating gantry and table rotation respectively. We construct accelerator world and phantom world in the main world coordinate to rotate accelerator and phantom world independently. We used dicomHandler class object to convert from the dicom binary file to the text file which contains the matrix number, pixel size, pixel's HU, bit size, padding value and high bits order. We reconstruct this class object to work fine. We also reconstruct the PrimaryGeneratorAction class to speed up the calculation time. because of the huge calculation time we discard search process of the ThitsMap and used direct access method from the first to the last element to produce the result files.

Construction of the Multiple Processing Unit by De Bruijn Graph (De Bruijn 그래프에 의한 다중처리기 구성)

  • Park, Chun-Myoung
    • Journal of the Korea Institute of Information and Communication Engineering
    • /
    • v.10 no.12
    • /
    • pp.2187-2192
    • /
    • 2006
  • This paper presents a method of constructing the universal multiple processing element unit(UMPEU) by De Bruijn Graph. The second method is as following. First, we propose transformation operators in order to construct the De Bruijn UMPEU using properties of graph. Second, we construct the transformation table of De Bruijn graph using above transformation operators. Finally we construct the De Bruijn graph using transformation table. The proposed UMPEU be able to construct the De Bruijn graph for any prime number and integer value of finite fields. Also the UMPEU is applied to fault-tolerant computing system, pipeline class. parallel processing network, switching function and its circuits.