• The Journal of Korean Institute of Electromagnetic Engineering and Science
• /
• v.19 no.8
• /
• pp.927-932
• /
• 2008

We propose a novel $4{\times}4$ Hadamard matrix feed network for a $4{\times}1$ array antenna to form a dual beam. If each element of the array is excited following the elements in a row of the Hadamard matrix, a two-lobed antenna beam can be obtained. The angle between the two lobes can be controlled. The Hadamard matrix feed network consists of four $90^{\circ}$ hybrids, a crossover and four $90^{\circ}$ phase shifters. The array, including the Hadamard matrix feed network, was fabricated on a microstip structure. The measured beam directions of the two lobes are $0^{\circ}$, ${\pm}15^{\circ}$, ${\pm}33^{\circ}$, ${\pm}45^{\circ}$ depending on the choice of the input port of the feed network.

• The Transactions of the Korea Information Processing Society
• /
• v.4 no.11
• /
• pp.2711-2720
• /
• 1997

Multitasking and microtasking on the CRAY machine provides still another way to improve computational power. Since CRAY-2 has 4 processors we can achieve speedup up to 4 properly designed algorithms. In this paper we present two parallelizations of linear system solution in the CRAY-2 with multitasking and microtasking library. One is the LU decomposition on the dense matrices and the other is the iterative solution of large sparse linear systems with the preconditioner proposed by Radicati di Brozolo. In the first case we realized a speedup of 1.3 with 2 processors for a matrix of dimension 600 with the multitasking and in the second case a speedup of around 3 with 4 processors for a matrix of dimension 600 with the multitasking and in the second case a speedup of around 3 with 4 processors for a matrix of dimension 8192 with the microtasking. In the first case the speedup is limited because of the nonuniform vector lenghts. In the second case the ILU(0) preconditioner with Radicati's technique seem to realize a reasonable high speedup with 4 processors.

• The Journal of the Acoustical Society of Korea
• /
• v.42 no.1
• /
• pp.32-41
• /
• 2023

Recently, studies on reverberation suppression using Non-negative Matrix Factorization (NMF) have been actively conducted. The NMF method uses a cost function based on the Kullback-Leibler divergence for optimization. And some constraints are added such as temporal continuity, pulse length, and energy ratio between reverberation and target. The tendency of constraints are controlled by hyperparameters. Therefore, in order to effectively suppress reverberation, hyperparameters need to be optimized. However, related studies are insufficient so far. In this paper, the reverberation suppression performance according to the three hyperparameters of the NMF was analyzed by using sea experimental data. As a result of analysis, when the value of hyperparameters for time continuity and pulse length were high, the energy ratio between the reverberation and the target showed better performance at less than 0.4, but it was confirmed that there was variability depending on the ocean environment. It is expected that the analysis results in this paper will be utilized as a useful guideline for planning precise experiments for optimizing hyperparameters of NMF in the future.

• The KIPS Transactions:PartA
• /
• v.10A no.2
• /
• pp.137-140
• /
• 2003

Recently, CG (Conjugate Gradient) scheme for the optimization of the Rayleigh quotient has been proven a very attractive and promising technique for interior eigenvalues for the following eigenvalue problem, Ax＝λx (1) The given matrix A is assummed to be large and sparse, and symmetric. Also, the method is very amenable to parallel computations. A proper choice of the preconditioner significantly improves the convergence of the CG scheme. We compare the parallel preconditioners for the computation of the interior eigenvalues of a symmetric matrix by CG-type method. The considered preconditioners are Point-SSOR, ILU (0) in the multi-coloring order, and Multi-Color Block SSOR (Symmetric Succesive OverRelaxation). We conducted our experiments on the CRAY­T3E with 128 nodes. The MPI (Message Passing Interface) library was adopted for the interprocessor communications. The test matrices are up to $512{\times}512$ in dimensions and were created from the discretizations of the elliptic PDE. All things considered the MC-BSSOR seems to be most robust preconditioner.

• Communications of Mathematical Education
• /
• v.23 no.3
• /
• pp.507-522
• /
• 2009

In general, we do fold paper and unfold, it remain paper traces. We can be obtained by using rectangular paper, a mathematical fact and the program had a combination. Depending on the direction of the rectangle, folding paper in the form of variety shows valley and ridge signs of the appearance of this paper. By using (0,1)-code and (0,1)-matrix, we study four kinds of research. Therefore, traces of this view upside down rectangle folding paper how to fold inductive reasoning ability of the code and explore the relationship of traces. Finally, the mathematical content and program development can practice in the field.

• Journal of the Korean Institute of Telematics and Electronics
• /
• v.11 no.2
• /
• pp.1-4
• /
• 1974

Matrix inversion is very inefficient for computing direct solutions of the large sparse systems of linear equations that arise in many network problems. This paper describes some computer programming techniques for taking advantage of the sparsity of the admittance matrix. with this method, direct solutions are computed from sparse matrix. It is Possible to gain a significant reduction in computing time, memory and round-off emir[r. Retails of the method, numerical examples and programming are given.

• Journal of KIISE:Computer Systems and Theory
• /
• v.28 no.1_2
• /
• pp.64-72
• /
• 2001

이 논문은 행렬 탐색 방법을 이용하여 평면상의 η개의 점에 대한 모든 L$_{p}$, 1$\leq$P$\leq$$\infty$ 거리의 양방향 각도제한 근접 점 문제를 0(nlogn) 시간에 계산하는 알고리즘을 고안한다. 이 방법은 최적의 시간 복잡도를 가지며 궤적추적 법을 쓰지 않기 때문에 수치오차가 적으며 구현이 용이하고 실용적이다.

• The Bulletin of The Korean Astronomical Society
• /
• v.35 no.2
• /
• pp.69.1-69.1
• /
• 2010

장주기 Mira 변광성의 외피층에서 발생하는 SiO 메이저에 대해 non-local한 1차원 수치계산 결과를 처음으로 제시한다. 별의 유체역학적인 맥동모델에서 얻은 시간에 따른 별 주위 가스의 속도, 온도, 밀도 분포를 사용하여 계산하였다. 임의의 속도장을 갖는 구형 분자운에서의 복사전달문제를 풀었던 이전 연구에서 개발한 수치계산코드를 이용하였고, 특정 구간에서 급격한 변화를 겪는 물리량을 잘 반영할 수 있도록 수정하였다. 또한 계산에 사용되는 거대희소행렬을 압축희소행렬로 변환하여 메모리를 절약하였고 비선형방정식의 자코비안을 해석적으로 구하여 계산속도를 향상시켰다. v=1, J=1-0, J=2-1과 v=2, J=1-0 SiO 메이저의 공간분포, 상대세기 등에 대해 이전의 LVG 모델을 이용한 연구결과와 정성적으로 비교 논의한다.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.6
• /
• pp.1263-1270
• /
• 2010

Sixty patients were divided into three groups. Each group of twenty persons had fed on different diet foods over 5 weeks. Cholesterol had been measured repeatedly five times at an interval of a week during 5 weeks. It resulted from mixed model analysis of repeated measurements data that homogeneous toeplitz covariance matrix pattern was selected as the optimal covariance pattern. The correlations between measurements of different times for the covariance matrix are somewhat highly correlated as 0.64-0.78. Based upon the homogeneous toeplitz covariance pattern model, the time effect was found to be highly significant, but the treatment effect and treatment-time interaction effect were found to be insignificant.

• Journal of the Korea Society of Computer and Information
• /
• v.17 no.9
• /
• pp.9-16
• /
• 2012

In this paper, we propose the two dimensional variable-length vector storage format which can be used for efficient storage of sparse matrix in the FEM (finite element method). The proposed storage format is the method storing only actual needed non-zero values of each row on upper triangular matrix with the total rows N, by using two dimensional variable-length vector instead of $N{\times}N$ large sparse matrix of entire equation of finite elements. This method only needs storage spaces of the number of minimum 1 to maximum 5 in 2D grid structure and the number of minimum 1 to maximum 14 in 3D grid structure of analysis target. The number doesn't excess two times although involving index number. From the experimental result, we can find out that the proposed storage format can reduce the memory space more effectively, as the total number of nodes increases, than the existing skyline storage format storing maximum column height.