• Journal of Korean Society of Steel Construction
• /
• v.14 no.4
• /
• pp.509-518
• /
• 2002

In order to perform the spatial buckling and static analysis of the nonsymmetric thin-walled beam-column element, improved exact static stiffness matrices were evaluated using equilibrium equation and force-deformation relationships. This numerical technique was obtained using a generalized linear eigenvalue problem, by introducing 14 displacement parameters and system of linear algebraic equations with complex matrices. Unlike the evaluation of dynamic stiffness matrices, some zero eigenvalues were included. Thus, displacement parameters related to these zero eigenvalues were assumed as polynomials, with their exact distributions determined using the identity condition. The exact displacement functions corresponding to three loadingcases for initial stress-resultants were then derived, by consistently combining zero and nonzero eigenvalues and corresponding eigenvectors. Finally, exact static stiffness matrices were determined by applying member force-displacement relationships to these displacement functions. The buckling loads and displacement of thin-walled beam were evaluated and compared with analytic solutions and results using ABAQUS' shell element or straight beam element.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.10 no.3
• /
• pp.535-541
• /
• 2006

This paper proposes a robust method to find corresponding points for un-calibrated stereo images by using a classical method based on the epipolar constraints and motion flows. If we detect matching for the only epipolar geometry, the problem is very high. Therefore, in order to nod an initial set of matches, we use the correlation technique and then exploit motion vectors to remove mismatches among matching candidates. Then, the epipolar geometry can be accurately estimated using a veil adapted criterion and computed the fundamental matrix. The proposed algorithm has been widely tested and works remarkably well in various scenes, evenly, with many repetitive patterns. The results show that the proposed algorithm is better than the conventional.

• The Korean Journal of Applied Statistics
• /
• v.26 no.2
• /
• pp.361-373
• /
• 2013

There are a wide variety of clustering algorithms; subsequently, we need a measure of similarity between two clustering methods. Such a measure can compare how well different clustering algorithms perform on a set of data. More numbers of compared clustering algorithms allow for more number of valuers for a measure of similarity between two clustering methods. Thus, we need a simple tool that presents the many values of a measure of similarity to compare many clustering methods. We suggest some graphical tools to compareg many clustering methods.

• Nuclear Engineering and Technology
• /
• v.5 no.2
• /
• pp.77-82
• /
• 1973

A method of obtaining the partition function for a system of electrons is developed by defining a new density matrix, in which the Fermi statistics is explicitly incorporated. The corresponding Bloch equation is formulated and a practical method of solving the equation is obtained for weak potential. This theory is applied to structurally disordered ststems which might be reasonable models for liquid metals.

• Proceedings of the Korean Statistical Society Conference
• /
• 2003.05a
• /
• pp.127-130
• /
• 2003

주변분포가 Laplace 분포인 세 가지 형태의 이변량 Laplace 분포를 연구한다. 각각의 이변량 Laplace 분포의 확률밀도함수와 누적분포함수를 유도하고, 분포의 그래프를 그려봄으로써 분포의 형태를 알아본다. 조건부 적률을 정리하여 조건부 첨도와 조건부 왜도를 구하고 분포의 성질을 파악한다. 상관계수를 구하여 다른 이변량 분포의 상관계수와 비교해 보았다. 그리고 정의된 분포함수를 응용하여 이변량 Laplace 분포를 따르는 난수벡터를 발생하는 알고리즘을 제안하였으며, 생성된 난수벡터의 표본으로부터 구한 표본평균과 중앙값의 분산-공분산 행렬식을 구하고 이변량 정규분포에 대응하는 행렬식과 비교 토론하였다.

• The Korean Journal of Applied Statistics
• /
• v.7 no.1
• /
• pp.69-74
• /
• 1994

Kim (1992) derived influence functions of rows and columns on the eigenvalues obtained in correspondence analysis (CA) of two-way contingency tables. As in principal component analysis, the eigenvalues are of great importance in CA. The goodness of a two dimensional correspondence plot is determined by the ratio of the sum of the two largest eigenvalues to the sum of all the eigenvalues. By investigating those rows and columns with high influence, a correspondence plot may be improved. In this paper, we extend the influence functions of CA to multiple correspondence analysis (MCA), which is a CA of multi-way contigency tables. An explicit formula of the influence function is given.

• Journal of Korea Multimedia Society
• /
• v.6 no.7
• /
• pp.1178-1188
• /
• 2003

In this paper, we describe image mosaicing techniques for constructing a large high-resolution image with images taken by a video camera in hand. we propose the method which is automatically retrieving the exact matching area using color information and shape information. The proposed method extracts first candidate areas which have similar form using a Voronoi Distance Matching Method which is rapidly estimating the correspondent points between adjacent images, and calculating initial transformations of them and finds the final matching area using color information. It is a method that creates Voronoi Surface which set the distance value among feature points and other points on the basis of each feature point of a image, and extracts the correspondent points which minimize Voronoi Distance in matching area between an input image and a basic image using the binary search method. Using the Levenberg-Marquadt method we turn an initial transformation matrix to an optimal transformation matrix, and using this matrix combine a basic image with a input image.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.7
• /
• pp.1599-1607
• /
• 2015

Recently, researches have been developing efficient techniques for accessing, querying, and managing XML documents which are frequently used in the Internet. In this paper, we propose a parent-child matrix to cluster XML documents efficiently. A parent-child matrix analyzes both the content and structural features of an XML document. Each cell of a parent-child matrix has either the value of a node in an XML tree or the value of a child node, where a parent-child relationship exists in the XML tree. Then, the similarity between two XML documents can be measured by the similarity between two corresponding parent-child matrices. The experiment shows that our proposed method has good performance.

• Journal of Korea Game Society
• /
• v.11 no.2
• /
• pp.13-18
• /
• 2011

Sid Meier said, "A game is a series of interesting choices." This means the interesting choices make the game funny. In this paper, we define the no interesting options in the gameplay as strategic errors of the gameplay and suggest a detection method of these errors of the gameplay. The suggested method detects the strategic errors of the gameplay by the inspection of the payoff matrices. This method can detect the options of no strategies of the opponent, dominant options, dominated options, similar options with almost same payoffs in the case of the inspection of the payoff matrices. Additionally it can detect the options of the expected payoff with excessively high, the options of the expected payoff with excessively low, the options of the usage probability with excessively high, and the options of the usage probability with excessively low in the case of the inspection of the payoff matrices with the corresponding frequency rates.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.16 no.3
• /
• pp.533-540
• /
• 2021

To evaluate the performance of a system, one-dimensional 3-neighborhood cellular automata(CA) based pseudo-random generators are widely used in many fields. Although two-dimensional CA and one-dimensional 5-neighborhood CA have been applied for more effective key sequence generation, designing symmetric one-dimensional 5-neighborhood CA corresponding to a given primitive polynomial is a very challenging problem. To solve this problem, studies on one-dimensional 5-neighborhood CA synthesis, such as synthesis method using recurrence relation of characteristic polynomials and synthesis method using Krylov matrix, were conducted. However, there was still a problem with solving nonlinear equations. To solve this problem, a symmetric one-dimensional 5-neighborhood CA synthesis method using a transition matrix of 90/150 CA and a block matrix has recently been proposed. In this paper, we detail the theoretical process of the proposed algorithm and use it to obtain symmetric one-dimensional 5-neighborhood CA corresponding to high-order primitive polynomials.