• Proceedings of the KIEE Conference
• /
• 1987.07b
• /
• pp.1116-1120
• /
• 1987

In this paper, the Adjacency Matrix is applied to analyze the MIN, which is one of the kind and further implemented in designing the new kind of SSIN, which provides the special form of MIN that has identical link patterns between switching stages. At first, new theorems are established and next the classes of the SSIN are generated from computer simulation.

• Communications for Statistical Applications and Methods
• /
• v.18 no.1
• /
• pp.79-87
• /
• 2011

A spatial time series model was used for analyzing the method of spatial time series (not the ARIMA model that is popular for analyzing spatial time series) by using chicken pox data which is a highly contagious disease and grid data due to ARIMA not reflecting the spatial processes. Time series model contains a weighting matrix, because that spatial time series model influences the time variation as well as the spatial location. The weighting matrix reflects that the more geographically contiguous region has the higher spatial dependence. It is hypothesized that the weighting matrix gives neighboring areas the same influence in the study of the spatial time series model. Therefore, we try to present the conclusion with a weighting matrix in a way that gives the same weight to existing neighboring areas in the study of the suitability of the STARMA model, spatial time series model and STBL model, in the comparative study of the predictive power for statistical inference, and the results. Furthermore, through the Kalman-Filter method we try to show the superiority of the Kalman-Filter method through a parameter assumption and the processes of prediction.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2016.05a
• /
• pp.641-644
• /
• 2016

Unlike wired networks, broadcasting in wireless networks can transmit data at once to several nodes with a single transmission. For omnidirectional broadcast to a node in wireless networks, all adjacent nodes receive the data at the same time. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem of minimizing the total transmit power on broadcasting in wireless networks. We apply two matrices to the proposed algorithm: one is a distance matrix that represents the distance between each node, the other is an adjacency matrix having the number of adjacency nodes. Among the nodes that receive the data, a node that has the greatest number of the adjacent node transmits data to neighbor preferential. We compare the performance of the proposed algorithm with random method through computer simulation in terms of transmitting power of nodes. Experiment results show that the proposed algorithm outperforms better than the random method.

• The KIPS Transactions:PartA
• /
• v.11A no.2
• /
• pp.189-194
• /
• 2004

This paper describes method to distribute much high-dimensional facial expression motion data to 2 dimensional space, and method to create facial expression animation by select expressions that want by realtime as animator navigates this space. In this paper composed expression space using about 2400 facial expression frames. The creation of facial space is ended by decision of shortest distance between any two expressions. The expression space as manifold space expresses approximately distance between two points as following. After define expression state vector that express state of each expression using distance matrix which represent distance between any markers, if two expression adjoin, regard this as approximate about shortest distance between two expressions. So, if adjacency distance is decided between adjacency expressions, connect these adjacency distances and yield shortest distance between any two expression states, use Floyd algorithm for this. To materialize expression space that is high-dimensional space, project on 2 dimensions using Sammon's Mapping. Facial animation create by realtime with animators navigating 2 dimensional space using user interface.

• Journal of the Korea Society for Simulation
• /
• v.15 no.1
• /
• pp.1-10
• /
• 2006

The Flexible Management System (FMS) consists of parallel and concurrent machines, pieces of equipment, and carrying systems classified as buffers, tools, and routers, respectively. The concurrent flow of multiple productions in a system is competed with one another for resources and this resulting competition can cause a deadlock in FMS. Since a deadlock is a condition in which the excessive demand for the resources being used by others causes activities to stop, it is very important to detect and prevent a deadlock. Herein a new algorithm has been studied in order to detect and prevent deadlocks, after defining a relationship between the general places and resource share places in Petri nets like as DAPN: Deadlock Avoidance Petri Net. For presenting the results, the suggested algorithms were also adapted to the models that demonstrated FMS features.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.5
• /
• pp.1110-1115
• /
• 2014

The matrix-star and the transposition graphs are considered as star graph variants that have various merits in graph theory such as node symmetry, fault tolerance, recursive scalability, etc. This paper describes an one-to-one mapping algorithm from a matrix-star graph to a transposition graph using adjacent properties in graph theory. The result show that a matrix-star graph $MS_{2,n}$ can be embedded in a transposition graph $T_{2n}$ with dilation n or less and average dilation 2 or less.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2004.05a
• /
• pp.1641-1644
• /
• 2004

3차원 볼륨데이터에서 분할 대상영역의 밝기 값이 다양하면서 밝기 값이 유사한 영역과 인접한 경우 3차원 영역확장(region growing) 방법을 사용하여 영역을 분할하기 위해서는 영역확장의 중요한 요인인 동질성 기준 값의 적절한 선택이 요구된다. 본 논문에서는 영역 복셀(voxel)의 1차 미분 값의 크기인 기울기 크기(gradient magnitude)만으로 영역의 경계를 찾기가 쉽지않은 대상의 분할을 위해 볼륨데이터의 지역적인 밝기 값의 변화의 특징을 고려하면서 분할 대상영역의 복셀의 2차 미분(second partial derivation)을 행렬의 요소(element)로 갖는 Hessian 행렬의 고유치(eigenvalue)를 영역확장의 문턱치 결정에 이용하였다. 제안한 알고리즘은 3차원 영역확장의 결과에 가장 큰 영향을 미치는 적절한 문턱치의 선택으로 대상영역의 분할을 성공적으로 수행하여 3차원 영역확장의 단점을 보완하였다.

• Journal of Broadcast Engineering
• /
• v.15 no.5
• /
• pp.672-680
• /
• 2010

This paper presents an adaptive quantization matrix selection scheme for H.264 video encoding. Conventional H.264 coding standard applies the same quantization matrix to the entire video sequence without considering local characteristics in each frame. In this paper, we propose block adaptive selection of quantization matrix according to edge directivity of each block. Firstly, edge directivity of each block is determined using intra prediction modes of its spatially adjacent blocks. If the block is decided as a directional block, new weighted quantization matrix is applied to the block. Otherwise, conventional quantization matrix is used for quantization of the non-directional block. Since the proposed weighted quantization is designed based on statistical distribution of transform coefficients in accordance with intra prediction modes, we can achieve high coding efficiency. Experimental results show that the proposed scheme can improve coding efficiency by about 2% in terms of BD bit-rate.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.29 no.10C
• /
• pp.1363-1369
• /
• 2004

LDPC(Low Density Parity Check) codes are described by bipartite graphs with bit nodes and parity-check nodes. Tanner derived minimum distance bounds of the regular LDPC code in terms of the eigenvalues of the associated adjacency matrix. In this paper we generalize the Tanner's results. We derive minimum distance bounds applicable to both regular and blockwise-irregular LDPC codes. The first bound considers the relation between bit nodes in a minimum-weight codeword, and the second one considers the connectivity between parity nodes adjacent to a minimum-weight codeword. The derived bounds make it possible to describe the distance property of the code in terms of the eigenvalues of the associated matrix.

• KIPS Transactions on Software and Data Engineering
• /
• v.3 no.1
• /
• pp.31-36
• /
• 2014

Social network services(SNS) including Twitter and Facebook are good resources to extract various issues like public interest, trend and topic. This paper proposes a method to extract query-related issues by calculating relatedness between terms in Twitter. As a term that frequently appears near query terms should be semantically related to a query, we calculate term relatedness in retrieved documents by summing proximity that is proportional to term frequency and inversely proportional to distance between words. Then terms, relatedness of which is bigger than threshold, are extracted as query-related issues, and our system shows those issues with a connected network. By analyzing single transitions in a connected network, compound words are easily obtained.