• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.4
• /
• pp.151-154
• /
• 2013

In this paper, we will analyze embedding between Folded Hypercube and HFH. We will show Folded Hypercube $FQ_{2n}$ can be embedded into HFH($C_n,C_n$) with dilation 4, expansion $\frac{(C_n)^2}{2^{2n}}$ and HFH($C_d,C_d$) can be embedded into $FQ_{4d-2}$ with dilation O(d).

• Journal of the Korea Computer Graphics Society
• /
• v.24 no.1
• /
• pp.1-8
• /
• 2018

We propose a modified real-time marching cubes technique that extracts isosurfaces in the form of connected meshes instead of triangle soup. In this way, a various mesh-based isosurface rendering techniques can be implemented and additional information of the isosurfaces such as its topology can be extracted in real-time. In addition, we propose a real-time technique to extract adjacency-triangle structure for geometry shaders that can be used for various shading effects such as silhouette rendering. Compared with the previous technique that welds the output triangles of classical marching cubes, our technique shows up to 300% performance improvement.

• The KIPS Transactions:PartA
• /
• v.11A no.5
• /
• pp.341-346
• /
• 2004

Recently A Hyper-Star Graph HS(m, k) has been introduced as a new interconnection network of new topology for parallel processing. Hyper-Star Graph has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show that Hyper-Star Graph HS(m, k) is subgraph of hypercube. And we also show that regular graph, Hyper-Star Graph HS(2n, n) is node-symmetric by introduced mapping algorithm. In addition, we introduce an efficient one-to-all broadcasting scheme - takes 2n-1 times - in Hyper-Star Graph HS(2n, n) based on a spanning tree with minimum height.

• Aerospace Engineering and Technology
• /
• v.13 no.2
• /
• pp.73-79
• /
• 2014

During developing cubesat flight software, Communication test between cubesat and ground station is needed. For this, we have constructed indoor ground station without outdoor antenna for decreasing total cost and time. In this time, if output power of ground station is high, it will affect for cubesat transceiver to be fail. For solving this problem, ground station must be designed for output power of it to be lower than input power of cubesat satellite, and it must be verified. In this paper, first, we describe cubesat indoor ground station using UHF and VHF. Second, we describe output power decreasing test for indoor operation of ground station by attaching attenuators in the end of the output connector.

• The KIPS Transactions:PartA
• /
• v.8A no.2
• /
• pp.99-106
• /
• 2001

In this paper, we study fault-tolerant multicasting in multicomputers based on multistage interconnection networks (MIN’s). In addition to one-to-one routing among processing nodes, efficient multicasting has an important effect on the performance of multicomputers. This paper presents a multicasting algorithm to tolerate faulty switching elements. The proposed algorithm uses the cube encoding scheme to represent multicast destinations in MIN, and is based on a recursive scheme in order to bypass faults. This algorithm can route any multicast message to its own destinations in only two passes through the MIN containing several faulty switching elements. Moreover, we prove the correctness of our algorithm by exploiting well-known nonblocking property of MIN.

• Journal of KIISE:Computer Systems and Theory
• /
• v.32 no.8
• /
• pp.393-398
• /
• 2005

In interconnection networks, a Hamiltonian path has been utilized in many applications such as the implementation of linear array and multicasting. In this paper, we consider the Hamiltonian properties of mesh networks which are used as the topology of parallel machines. If a network is strongly Hamiltonian laceable, the network has the longest path joining arbitrary two nodes. We show that a two-dimensional mesh M(m, n) is strongly Hamiltonian laceabie, if $m{\geq}4,\;n{\geq}4(m{\geq}3,\;n{\geq}3\;respectively)$, and the number of nodes is even(odd respectively). A mesh is a spanning subgraph of many interconnection networks such as tori, hypercubes, k-ary n-cubes, and recursive circulants. Thus, our result can be applied to discover the fault-hamiltonicity of such networks.

• The KIPS Transactions:PartA
• /
• v.15A no.6
• /
• pp.345-350
• /
• 2008

Recently, a HyperStar network HS(2n,n) has been introduced as a new interconnection network of new topology for parallel processing. HyperStar network has properties of hypercube and star graph, further improve the network cost of a hypercube with the same number of nodes. In this paper, we show a construction algorithm of edge-disjoint spanning trees in HyperStar network HS(2n,n). Also, we prove that edge-disjoint spanning tree by the algorithm is optimal.

• Asia-pacific Journal of Multimedia Services Convergent with Art, Humanities, and Sociology
• /
• v.8 no.8
• /
• pp.825-834
• /
• 2018

Broadcasting is a basic data communication method for interconnection networks. There are two types of broadcasting. One-to-all broadcasting is to transmit a message from one node to all other nodes and all-to-all broadcasting is to transmit a message from all the nodes that have messages to other nodes. And by the using way of the transmission port per unit time, there are two schemes of broadcasting. Single port telecommunication(SLA) is to transmit messages from one node that contains the messages to one adjacent node only and all port telecommunication(MLA) is to transmit messages from one node to all adjacent nodes within a time of unit. Matrix hypercube is that an interconnection network has improved network cost than that of hypercube with the same number of nodes. In this paper, we analyze broadcasting scheme of matirx hypercube. First, we propose one-to-all and all-to-all broadcasting algorithms of matrix hypercube. And we prove that one-to-all broadcasting times are 2n+1 and $2{\lceil}{\frac{n}{2}}{\rceil}+1$ based on the SLA and MLA models, respectively. Also, we show all-to-all broadcasting time using SLA model is $5{\times}2^{\frac{n}{2}}-2$ when n=even, and is $5{\times}2^{\frac{n-1}{2}}+2$ when n=odd.

• Proceedings of the Korean Information Science Society Conference
• /
• 2003.10a
• /
• pp.373-375
• /
• 2003

최근에 하이퍼큐브의 망비용을 개선한 상호연결망 하이퍼-스타가 제안되었다. 본 논문에서는 상호연결망 하이퍼-스타 HS(2n,n)가 제안된 매핑 알고리즘에 의해 노드 대칭임을 보인다.

• Proceedings of the Korean Information Science Society Conference
• /
• 2004.10a
• /
• pp.61-63
• /
• 2004

최근에 하이퍼큐브의 망비용을 개선한 상호연결망 하이퍼-스타가 제안되었다. 본 논문에서는 삼진트리가 하이퍼-스타 연결망 HS(2n, n)에 연장율 1로 임베딩 가능함을 보인다.