• Proceedings of the Computational Structural Engineering Institute Conference
• /
• 2005.04a
• /
• pp.175-182
• /
• 2005

The present study is concerned with the application of dynamic relaxation method in the investigation of the large deflection behavior of spatial structures. This numerical algorithm do not require the computation or formulation of any tangent stiffness matrix. The convergence to the solution is achieved by using only vectorial quantities and no stiffness matrix is required in its overall assembled form. In an effort to evaluate the merits of the methods, extensive numerical studies were carried out on a number of selected structural systems. The advantages of using dynamic relaxation methods, in tracing the post-buckling behavior of spatial structures, are demonstrated.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.9 no.3
• /
• pp.1193-1209
• /
• 2015

Network coding is promising to maximize network throughput and improve the resilience to random network failures in various networking systems. In this paper, the problem of providing efficient confidentiality for practical network coding system against a global eavesdropper (with full eavesdropping capabilities to the network) is considered. By exploiting a novel combination between the construction technique of systematic Maximum Distance Separable (MDS) erasure coding and traditional cryptographic approach, two efficient schemes are proposed that can achieve the maximum possible rate and minimum encryption overhead respectively on top of any communication network or underlying linear network code. Every generation is first subjected to an encoding by a particular matrix generated by two (or three) Vandermonde matrices, and then parts of coded vectors (or secret symbols) are encrypted before transmitting. The proposed schemes are characterized by tunable and measurable degrees of security and also shown to be of low overhead in computation and bandwidth.

• Proceedings of the Korean Society for Technology of Plasticity Conference
• /
• 2001.10a
• /
• pp.113-116
• /
• 2001

Finite element analysis programs have been for metal forming process design They will become more and more important in understanding forming process For large-scale forging analysis problems, the performance of a linear equation solver is very important for the overall efficiency of the analysis code. With problem size increased, the computation time needs to be reduced, which is spent on setting the system of algebraic equations associated with finite element model Many matrix solvers have been developed and used usefully in finite element program for this purpose.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2019.11a
• /
• pp.246-248
• /
• 2019

In the ongoing standardization of Versatile Video Coding (VVC), DCT-2, DST-7 and DCT-8 are accounted as the vital transform kernels. While storing all of those transform kernels, ROM memory storage is considered as the major problem. So, to deal with this scenario, a common sparse unified matrix concept is introduced in this paper. From the proposed matrix, any point transform kernels (DCT-2, DST-7, DCT-8, DST-4 and DCT-4) can be achieved after some mathematical computation. DCT-2, DST-7 and DCT-8 are the used major transform kernel in this paper.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.5 no.1
• /
• pp.83-88
• /
• 2009

This paper consider the problem of direction of arrival(DOA) estimation in the presence of multipath propagation. The sensor elements are assumed to be linear and uniformly spaced. Numerous authors have advocated the use of a beamforming preprocessor to facilitate application of high resolution direction finding algorithms The benefits cited include reduced computation, improved performance in environments that include spatially colored noise, and enhanced resolution. Performance benefits typically have been demonstrated via specific example. The purpose of this paper is to provide an analysis of a beamspace version of the MUSIC algorithm applicable to two closely spaced emitters in diverse scenarios. Specifically, the analysis is applicable to uncorrelated far field emitters of any relative power level, confined to a known plane, and observed by an arbitrary array of directional antenna. In this paper, we researched about optimize beam forming to smart antenna system. The covariance matrix obtained using fourth order cumulant function. Simulations illustrate the performance of the techniques.

• Journal of the Korean Statistical Society
• /
• v.25 no.1
• /
• pp.49-66
• /
• 1996

The singular value decomposition is one of the most useful methods in the area of matrix computation. It gives dimension reduction which is the centeral idea in many multivariate analyses. But this method is not resistant, i.e., it is very sensitive to small changes in the input data. In this article, we derive the resistant version of singular value decomposition for principal component analysis. And we give its statistical applications to biplot which is similar to principal component analysis in aspects of the dimension reduction of an n x p data matrix. Therefore, we derive the resistant principal component analysis and biplot based on the resistant singular value decomposition. They provide graphical multivariate data analyses relatively little influenced by outlying observations.

• Proceedings of the Korea Contents Association Conference
• /
• 2006.05a
• /
• pp.459-461
• /
• 2006

The successive multiplication of all $n{\times}n$ boolean matrices is necessary for applications such as D-class computation. But, no research has been performed on it despite many researches dealing with boolean matrices. The paper suggests a theory with which successively multiplying a $n{\times}n$ boolean matrix by all $n{\times}n$ boolean matrices can be done efficiently, applies it to the successive multiplication of all $n{\times}n$ boolean matrices and shows its execution results.

• Publications of The Korean Astronomical Society
• /
• v.22 no.1
• /
• pp.21-33
• /
• 2007

Ever since the identification of 6830 and 7088 features as the Raman scattered O VI 1032, 1038 resonance doublets in symbiotic stars by Schmid (1989), Raman scattering by atomic hydrogen has been a very unique tool to investigate the mass transfer processes in symbiotic stars. Discovery of Raman scattered He II in young planetary nebulae (NGC 7027, NGC 6302, IC 5117) allow one to expect that Raman scattering can be an extremely useful tool to look into the mass loss processes in these objects. Because hydrogen is a single electron atom, their wavefunctions are known in closed form, so that exact calculations of cross sections are feasible. In this paper, I review some basic properties of Raman scattered features and present detailed and explicit matrix elements for computation of the scattering cross section of radiation with atomic hydrogen. Some astrophysical objects for which Raman scattering may be observationally pertinent are briefly mentioned.

• Proceedings of the KIEE Conference
• /
• 1992.07a
• /
• pp.276-278
• /
• 1992

This paper presents a method of hierachical optimal control for time invariant large scale systems via Single Term Walsh Series. It is well known that the optimal control of a large scale system with quadratic performance criteria often involves the determination of time varying feedback gain matrix by solving the matrix Riccati differential equation, which is usually quite difficult. Therefore, in order to solve the problem, this paper is introduced to Single Term Walsh Series. The advantages of proposed method are simple and attractive for the control of large scale system in computation.

• Journal of applied mathematics & informatics
• /
• v.4 no.1
• /
• pp.63-82
• /
• 1997

In experimental situations where n two or three level fac-tors are involoved and n observations are taken then the D-optimal first order saturated design is an $n{\times}n$ matrix with elements $\pm$1 or 0, $\pm$1, with the maximum determinant. Cononical forms are useful for the specification of the non-isomorphic D-optimal designs. In this paper we study canonical forms such as the Smith normal form the first sec-ond and the jordan canonical form of D-optimal designs. Numerical algorithms for the computation of these forms are described and some numerical examples are also given.