• Proceedings of the Korean Information Science Society Conference
• /
• 2000.04a
• /
• pp.680-682
• /
• 2000

이 논문은 에지와 정점에 고장이 있는 이중 루프 네트워크의 해밀톤 성질을 고려한다. 이중 루프 네트워크 G(mn;1,m)은 m$\times$n 그리드 그래프에 에지를 추가한 4-정규 그래프이다 m과 n이 모두 짝수인 이중 루프 네트워크G(mn;1,m)은 고장난 요소(에지와 정점)의 수가 1이하인 경우에 해밀톤 연결되어 있고, 고장난 요소의 수가 2이하인 경우에 항상 해밀톤 사이클을 가짐을 보인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.27 no.10
• /
• pp.868-879
• /
• 2000

이 논문은 에지나 정점, 혹은 모두에 고장이 있는 이중 루프 네트워크의 해밀톤 성질을 고려한다. 이중 루프 네트워크 G(mn;1,m)은 m$\times$m 그리드 그래프에 에지를 추가한 4-정규 그래프이다. m 과 n 이 모두 짝수인 이중 루프 네트워크 G(mn;1,m)은 고장난 요소(에지와 정점)의 수가 1이하인 경우에 해밀톤 연결되어 있고, 고장난 요소의 수가 2 이하인 경우에 항상 해밀톤 사이클을 가짐을 보인다.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.1_2
• /
• pp.19-26
• /
• 2004

In this paper, we investigate the longest fault-free paths joining every pair of vertices in a double loop network with faulty vertices and/or edges, and show that a bipartite double loop network G(mn；1, m) is strongly hamiltonian-laceable when the number of faulty elements is two or less. G(mn；1, m) is bipartite if and only if m is odd and n is even.

• Proceedings of the Korean Society of Broadcast Engineers Conference
• /
• 2012.11a
• /
• pp.67-68
• /
• 2012

전이중(full-duplex) 양방향 중계 네트워크는 전이중 방식을 사용하는 중계기에서 물리 계층 네트워크 부호화(physical layer network coding) 혹은 중첩 부호화(superposition coding)을 사용하여 기존 반이중(half duplex) 중계기를 사용하는 양방향 중계 네트워크에 비해 높은 주파수 효율을 제공한다. 본 논문에서는 전이중 양방향 중계 네트워크를 고려하여 전이중 방식에서 필연적으로 발생하는 루프간섭 신호의 영향을 살펴보았다. 여기에서 사용자 및 중계기는 루프간섭 신호를 제거하기 위해 루프간섭 신호를 추정한다. 하지만 루프간섭 신호를 추정할 때 추정 오류가 발생하여 수신 신호에서 루프간섭 신호를 완벽하게 제거하기는 어렵다. 모의실험에서는 이로 인해 발생할 수 있는 성능 변화를 불능 확률을 통해 분석하였다.

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

A many-to-many k-disjoint path cover (k-DPC) of a graph G is a set of k disjoint paths joining k distinct source-sink pairs in which each vertex of G is covered by a path. In this paper, we investigate many-to-many 2-DPC in a double loop network G(mn;1,m), and show that every nonbipartite G(mn;1,m), $m{\geq}3$, has 2-DPC joining any two source-sink pairs of vertices and that every bipartite G(mn;1,m) has 2-DPC joining any two source-sink pairs of black-white vertices and joining any Pairs of black-black and white-white vertices. G(mn;l,m) is bipartite if and only if n is odd and n is even.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.3
• /
• pp.3-9
• /
• 2014

Two-way full-duplex relay network provides improved spectral efficiency by using either superposition coding or physical layer network coding at relays compared to conventional two-way half-duplex relay network. In this paper, we investigate the impact of residual loop interference on the performance of the two-way full-duplex relay network. Users and relays in the two-way full-duplex relay network estimate the residual loop interference in order to cancel it. However, it is difficult to perfectly cancel the residual loop interference from the received signal due to the estimation error. Numerical results show the impact of the estimation error on the outage probability of the two-way full-duplex relay network.

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

We consider the fault hamiltonian properties of m ${\times}$ n meshes with two wraparound links on the first row and the last row, denoted by M$_2$(m,n), (m$\geq$2, n$\geq$3). M$_2$(m,n), which is bipartite, with a single faulty link has a fault-free path of length mn-l(mn-2) between arbitrary two nodes if they both belong to the different(same) partite set. Compared with the previous works of P$_{m}$ ${\times}$C$_{n}$ , it also has these hamiltonian properties. Our result show that two additional wraparound links are sufficient for an m${\times}$n mesh to have such properties rather than m wraparound links. Also, M$_2$(m,n) is a spanning subgraph of many interconnection networks such as multidimensional meshes, recursive circulants, hypercubes, double loop networks, and k-ary n-cubcs. Thus, our results can be applied to discover fault-hamiltonicity of such interconnection networks. By applying hamiltonian properties of M$_2$(m,n) to 3-dimensional meshes, recursive circulants, and hypercubes, we obtain fault hamiltonian properties of these networks.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.13-22
• /
• 2014

This study analyzed the globalization policy of ICT SMEs and ventures using cognitive map analysis and derived the priority to importance about action plans using AHP model, while the globalization paradigm has been rapidly changing in the ICT industry. Empirical results showed that policy tool variables should be needed to develop because policy goal variables are generally presented more than policy tool variables. In addition, this cognitive map could be characterized by a scarcity of feedback loops which means policy landscape for ICT SMEs and ventures' globalization is unilateral rather than cyclical to reach policy goal from policy tools. Another finding is that creative economy policy variable was not observed as policy tool variable but as policy goal variable. This means creative economy can be implemented through support for ICT SMEs and ventures' globalization. Finally, for detailed policy measures, installation of global start-up center, recruiting and utilization of global specialists, revitalization of ICT R&D international collaboration study, enlargement of global investment network, accompanied overseas advance of large enterprises and SMEs are presented in order in terms of the importance of policy priority.