• Title/Summary/Keyword: ((0,1)-행렬

Search Result 186, Processing Time 0.026 seconds

A Study for Spectral Properties of Preconditioner of Symmetric Toeplitz Systems (대칭 토플리츠 시스템의 선행조건에 대한 특정성질 연구)

  • Baik, Ran
    • Journal of Digital Contents Society
    • /
    • v.10 no.4
    • /
    • pp.579-585
    • /
    • 2009
  • In [9], Tyrtshnikov proposed a preconditioned approach to derive a general solution from a Toeplitz linear system. Furthermore, the process of selecting a preconditioner matrix from symmetric Toeplitz matrix, which has been used in previous studies, is introduced. This research introduces a new method for finding the preconditioner in a Toeplitz system. Also, through analyzing these preconditioners, it is derived that eigenvalues of a symmetric Toeplitz are very close to eigenvalues of a new preconditioner for T. It is shown that if the spectrum of the preconditioned system $C_0^{-1}T$ is clustered around 1, then the convergence rate of the preconditioned system is superlinear. From these results, it is determined to get the superliner at the convergence rate by our good preconditioner $C_0$. Moreover, an advantage is driven by increasing various applications i. e. image processing, signal processing, etc. in this study from the proposed preconditioners for Toeplitz matrices. Another characteristic, which this research holds, is that the preconditioner retains the properties of the Toeplitz matrix.

  • PDF

Constructions of the special sign pattern matrices that allow normality (정규성을 허용하는 특별한 부호화 행렬의 구성)

  • Yu, Jin-Woo;Im, Hyung-Kyu;Park, Se-Won
    • The Journal of the Korea institute of electronic communication sciences
    • /
    • v.6 no.2
    • /
    • pp.193-198
    • /
    • 2011
  • By a nonnegative sign pattern we mean a matrix whose entries are from the set {+, 0}. A nonnegative sign pattern A is said to allow normality if there is a normal matrix B whose entries have signs indicated by A. In this paper we investigated some nonnegative normal pattern that is different to the pattern in [1]. Some interesting constructions of nonnegative integer normal matrices are provided.

Message Authentication Code based on k-invertible Matrices (k-역행렬을 이용한 메시지 인증 기법)

  • Lee Hee Jung;Kim Tae Gwon
    • Journal of the Korea Institute of Information Security & Cryptology
    • /
    • v.14 no.6
    • /
    • pp.105-110
    • /
    • 2004
  • MAC is used for data origin authentication or message integrity protection. In Crypto'03 Cary and Venkatesan introduced new MAC based on unimodular matrix groups. It is to encrypt messages using private keys and to encrypt them again using public keys which are matrices whose determinants are $\pm$1. These matrices have property called k-invertible. This k effects on the collision probability of this new MAC. The smaller k is, the less collisions occur. Cary shows 6-invertible matrices, and 10-invertible matrices whose components are only 1, 0, -1. In this paper we figure out sufficient conditions about choosing 4 matrices among special 22 matrices. Also, we introduce 5-invertible matrices whose components are 1, 0, -1. Those have better efficiency and security.

A Markov Chain Representation of Statistical Process Monitoring Procedure under an ARIMA(0,1,1) Model (ARIMA(0,1,1)모형에서 통계적 공정탐색절차의 MARKOV연쇄 표현)

  • 박창순
    • The Korean Journal of Applied Statistics
    • /
    • v.16 no.1
    • /
    • pp.71-85
    • /
    • 2003
  • In the economic design of the process control procedure, where quality is measured at certain time intervals, its properties are difficult to derive due to the discreteness of the measurement intervals. In this paper a Markov chain representation of the process monitoring procedure is developed and used to derive its properties when the process follows an ARIMA(0,1,1) model, which is designed to describe the effect of the noise and the special cause in the process cycle. The properties of the Markov chain depend on the transition matrix, which is determined by the control procedure and the process distribution. The derived representation of the Markov chain can be adapted to most different types of control procedures and different kinds of process distributions by obtaining the corresponding transition matrix.

The Economic Impact Analysis on the Water Industry with Social Accounting Matrix (사회계정행렬을 이용한 수자원분야 정책 효과 분석)

  • Choi, Hanjoo
    • Journal of Korea Water Resources Association
    • /
    • v.47 no.2
    • /
    • pp.95-106
    • /
    • 2014
  • This paper analyses the economic effects of the water industry on the Korean economy by using Social Accounting Matrix (SAM). The SAM is constructed based on the Input-Output table, National account and Family income and expenditure survey for Korea in 2009. Through the SAM multiplier analysis, I estimate the effects of water investment. As the results, this study has found the followings. i) output multiplier effects of water sector are 5.300~7.741, ii) value added multiplier effects of water sector are 0.685~1.158, iii) income multiplier effects of water sector are 0.511~0.984, iv) redistributed income multiplier effects of water sector are -0.096~0.247. The results indicate that a significant influence on the industrial production and the household income in Korea.

Network topology에 대하여 1

  • 고명삼
    • 전기의세계
    • /
    • v.14 no.4
    • /
    • pp.28-35
    • /
    • 1965
  • Kirchhoff는 유향성 선형 graph에 포함되어 있는 입상기하학적인 특성, 즉 주어진graph의 모든 정점과 변들의 연결상태를 0, +1, -1의 세가지 수자로 된 소위 incidence행렬란 개념으로 집약시켰다. 본 고에서는 Incidence Matrix, Tie-set Matrix과 연결지 전류(link current), Cut-set Matrix과 절점대 전압(Node pair voltage), Tie-set및 cut-set행렬의 선형변환, Duality(쌍대성)

  • PDF

A Study of Spectral Domain Electromagnetic Scattering Analysis Applying Wavelet Transform (웨이블릿을 이용한 파수영역 전자파 산란 해석법 연구)

  • 빈영부;주세훈;이정흠;김형동
    • The Journal of Korean Institute of Electromagnetic Engineering and Science
    • /
    • v.11 no.3
    • /
    • pp.337-344
    • /
    • 2000
  • The wavelet analysis technique is applied in the spectral domain to efficiently represent the multi-scale features of the impedance matrices. In this scheme, the 2-D quadtree decomposition (applying the wavelet transform to only the part of the matrix) method often used in image processing area is applied for a sparse moment matrix. CG(Conjugate-Gradient) method is also applied for saving memory and computation time of wavelet transformed moment matrix. Numerical examples show that for rectangular cylinder case the non-zero elements of the transformed moment matrix grows only as O($N^{1.6}$).

  • PDF

A Credit Card Sensing System based on Shared Key for Promoting Electronic Commerce (전자상거래 촉진을 위한 공유키 기반 신용카드 조회 시스템)

  • Jang, Si-Woong;Shin, Byoung-Chul;Kim, Yang-Kok
    • The KIPS Transactions:PartD
    • /
    • v.10D no.6
    • /
    • pp.1059-1066
    • /
    • 2003
  • In this paper, the magnetic sensing system is designed and implemented for the safe security in internet commerce system. When the payment is required inthe internet commerce system, the magnetic sensing system will get the information from a credit card without keyboard input and then encrypt and transmit the information to server. The credit card sensing system, which is proposed in this paper, is safe from keyboard hacking because it encrypts card information immediately in its internal chip and sends the information to host system. For the protection of information, the magnetic sensing system is basically based on a synchronous stream cipher cryptosystem which is related to a group of matrices. The size of matrices and the bits of keys for the best performances are determined for various cases. It is shown that for credit card payments. matrices of size 2 have good performance even at most 128bits keys with the consideration of inverse matrices. For authentication of general-purpose data, the magnetic sensing system needs more than 1.5KB data and in this case, the optimum size of matrices is 2 or 3 at more 256bits keys with consideration of inverse matrices.

The Evaluation of Predose Counts in the GFR Test Using $^{99m}Tc$-DTPA ($^{99m}Tc$-DTPA를 이용한 사구체 여과율 측정에서 주사 전선량계수치의 평가)

  • Yeon, Joon-Ho;Lee, Hyuk;Chi, Yong-Ki;Kim, Soo-Yung;Lee, Kyoo-Bok;Seok, Jae-Dong
    • The Korean Journal of Nuclear Medicine Technology
    • /
    • v.14 no.1
    • /
    • pp.94-100
    • /
    • 2010
  • Purpose: We can evaluate function of kidney by Glomerular Filtration Rate (GFR) test using $^{99m}Tc$-DTPA which is simple. This test is influenced by several parameter such as net syringe count, kidney depth, corrected kidney count, acquisition time and characters of gamma camera. In this study, we evaluated predose count according to matrix size in the GFR test using $^{99m}Tc$-DTPA. Materials and Methods: Gamma camera of Infinia in GE was used, and LEGP collimator, three types of matrix size ($64{\times}64$, $128{\times}128$, $256{\times}256$) and 1.0 of zoom factor were applied. We increased radioactivity concentration from 222 (6), 296 (8), 370 (10), 444 (12) up to 518 MBq (14 mCi) respectively and acquired images according to matrix size at 30 cm distance from detector. Lastly, we evaluated these values and then substituted them for GFR formula. Results: In $64{\times}64$, $128{\times}128$ and $256{\times}256$ of matrix size, counts per second was 26.8, 34.5, 41.5, 49.1 and 55.3 kcps, 25.3, 33.4, 41.0, 48.4 and 54.3 kcps and 25.5, 33.7, 40.8, 48.1 and 54.7 kcps respectively. Total counts for 5 second were 134, 172, 208, 245 and 276 kcounts from $64{\times}64$, 127, 172, 205, 242, 271 kcounts from $128{\times}128$, and 137, 168, 204, 240 and 273 kcounts from $256{\times}256$, and total counts for 60 seconds were 1,503, 1,866, 2,093, 2,280, 2,321 kcounts, 1,511, 1,994, 2,453, 2,890 and 3,244 kcounts, and 1,524, 2,011, 2,439, 2,869 and 3,268 kcounts respectively. It is different from 0 to 30.02 % of percentage difference in $64{\times}64$ of matrix size. But in $128{\times}128$ and $256{\times}256$, it is showed 0.60 and 0.69 % of maximum value each. GFR of percentage difference in $64{\times}64$ represented 6.77% of 222 MBq (6 mCi), 42.89 % of 518 MBq (14 mCi) at 60 seconds respectively. However it is represented 0.60 and 0.63 % each in $128{\times}128$ and $256{\times}256$. Conclusion: There was no big difference in total counts of percentage difference and GFR values acquiring from $128{\times}128$ and $256{\times}256$ of matrix size. But in $64{\times}64$ of matrix size when the total count exceeded 1,500 kcounts, the overflow phenomenon was appeared differently according to predose radioactivity of concentration and acquisition time. Therefore, we must optimize matrix size and net syringe count considering the total count of predose to get accurate GFR results.

  • PDF

A Study on the D-Class Computing Algorithm (D-클래스 계산 알고리즘에 관한 연구)

  • Shin, Chul-Gyu;Han, Jae-Il
    • Proceedings of the Korea Information Processing Society Conference
    • /
    • 2004.05a
    • /
    • pp.903-906
    • /
    • 2004
  • D-클래스는 원소가 0과 1값을 가지는 $n{\times}n$ 불리언 행렬에서 특정 관계(relation)에 따라 동치(equivalent) 관계에 있는 $n{\times}n$ 행렬의 집합을 의미한다. D-클래스의 계산은 NP-완전 문제로서 보안에 응용될 수 있는 가능성을 가지고 있으나 계산 복잡도로 인해 현재 극히 제한된 크기의 행렬에 대한 D-클래스만이 알려져 있다. 본 논문은 이러한 D-클래스의 계산을 효율적으로 할 수 있는 알고리즘의 설계와 실행 결과에 대하여 논한다.

  • PDF