• Proceedings of the Korean Information Science Society Conference
• /
• 2001.04a
• /
• pp.718-720
• /
• 2001

본 논문에서는 하이퍼큐브보다 망 비용이 개선된 상호연결망 HCN(n,n)의 임의의 두 노드간에 노드중복하지 않는 n+1개의 병렬경로를 구성하는 방법을 제시하고, 그 결과를 통하여 HCN(n,n)의 고장지름이 dia(HCN(n,n))+4 이하임을 보인다. 이러한 병렬경로는 노드간에 메시지를 전송하는 시간을 줄일 수 있으며, HCN(n,n)의 노드 몇 개가 고장이 발생해도 통신지연시간이 발생하지 않음을 의미한다.

• Proceedings of the KWS Conference
• /
• 2009.11a
• /
• pp.68-68
• /
• 2009

Recently, resistance spot welding using Inverter DC is applied to improve the weldability of high strength steel for the auto-body fabrication. In this study, inverter DC spot welding machine, which is developed in the domestic, was evaluated weldability of the galvanized and cold rolled dual-phase steel(tensile strength : 590MPa). The welding conditions (welding time, current and force) were decided by tensile-shear test, and welding strength and nugget size were analyzed by statistical analysis methods which involved dynamic resistance and indentation. The results of the statistical analysis was utilized for real-time estimation of the invisible nugget size and tensile strength. Moreover, it can be achieved without the conventional destructive testing of welds.

• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.8
• /
• pp.1009-1023
• /
• 1999

이 논문은 재귀원형군 G(2^m , 2^k ) 그래프 이론적 관점에서 고찰하고 정점이 서로소인 경로에 관한 위상 특성을 제시한다. 재귀원형군은 1 에서 제안된 다중 컴퓨터의 연결망 구조이다. 재귀원형군 {{{{G(2^m , 2^k )의 서로 다른 두 노드 v와 w를 잇는 연결도 kappa(G)개의 서로소인 경로의 길이가 두 노드 사이의 거리d(v,w)나 혹은 G(2^m , 2^k )의 지름 \dia(G)에 비해서 얼마나 늘어나는지를 고려한다. 서로소인 경로를 재귀적으로 설계하는데, 그 길이는 k ge2일 때 d(v,w)+2^k-1과 \dia(G)+2^k-1의 최솟값 이하이고, k=1일 때 d(v,w)+3과 \dia(G)\+2의 최솟값 이하이다. 이 연구는 (2^m , 2^k )의 고장 감내 라우팅, 고장 지름이나 persistence의 분석에 이용할 수 있다.Abstract In this paper, we investigate recursive circulant G(2^m , 2^k ) from the graph theory point of view and present topological properties concerned with node-disjoint paths. Recursive circulant is an interconnection structure for multicomputer networks proposed in 1 . We consider the length increments of {{{{kappa(G)disjoint paths joining arbitrary two nodes v and win G(2^m , 2^k )compared with distance d(v,w)between the two nodes and diameter {{{{\dia(G)of G(2^m , 2^k ), where kappa(G)is the connectivity of G(2^m , 2^k ). We recursively construct disjoint paths of length less than or equal to the minimum of {{{{d(v,w)+2^k-1and \dia(G)+2^k-1for kge2 and the minimum of d(v,w)+3 and \dia(G)+2for k=1. This work can be applied to fault-tolerant routing and analysis of fault diameter and persistence of G(2^m , 2^k )

• The KIPS Transactions:PartA
• /
• v.9A no.3
• /
• pp.333-340
• /
• 2002

Embedding is a mapping an interconnection network G to another interconnection network H. If a network G can be embedded to another network H, algorithms developed on G can be simulated on H. In this paper, we first propose a method to embed between Hierarchical Cubic Network HCN(n, n) and Hierarchical Folded-hypercube Network HFN(n, n). HCN(n, n) and HFN(n, n) are graph topologies having desirable properties of hypercube while improving the network cost, defined as degree${\times}$diameter, of Hypercube. We prove that HCN(n, n) can be embedded into HFN(n, n) with dilation 3 and congestion 2, and the average dilation is less than 2. HFN(n, n) can be embedded into HCN(n, n) with dilation 0 (n), but the average dilation is less than 2. Finally, we analyze the fault tolerance of HCN(n, n) and prove that HCN(n, n) is maximally fault tolerant.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.7
• /
• pp.1756-1769
• /
• 1999

Parallel paths in an interconnection network have some significance in that message transmission time can be reduced because message is divided into packets and transmitted in parallel through several paths, and also an whose nodes has 2n binary bit string, is an interconnection network which has a lower network cost than hypercube and its variation. In this paper, we analyze node disjoint parallel path in Folded Hyper-Star graph FHS(2n,n) proposed as the topology of parallel computers and, using the result, prove that the fault diameter of a Folded Hyper-Star graph FHS(2n,n) is 2n-1.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.20 no.11
• /
• pp.144-150
• /
• 2019

In this study, resistance spot welding was performed using a high tensile steel plate SGAFC 780. The shear tensile strength, fracture profile, nugget diameter, and simulation were compared according to the conditions. After the nugget diameter calibration, the minimum diameter of welding was more than 4.3mm when the welding current was 8kVA or more. At 9kVA and above 10kVA, the minimum nugget diameter of 4.3mm was satisfied. On the other hand, due to the high current and time, the fly phenomenon occurred and the deep indentation remained. An evaluation of the weldability confirmed that there was an interval that was evaluated as weld failure due to the creep phenomenon, which satisfied the tensile shear strength and minimum nugget diameter. On the other hand, areas that have sufficient load bearing capacity even when drift has occurred were also identified. The simulation results show that the error rate was less than 4.2% when comparing the nugget diameter in the simulation and the experimental results in the appropriate weld zone, and confirmed the reliability of the simulation.

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

Mesh structure is one of typical interconnection networks, and it is used in the part of VLSI circuit design. Torus and Hyper-Torus are advanced interconnection networks in the part of diameter and fault-tolerance of mesh structure. In this paper, we will analyze embedding between Torus and Hyper-Torus networks. We will show T(4k,2l) can be embedded into QT(m,n) with dilation 5, congestion 4, expansion 1. And QT(m,n) can be embedded into T(4k,2l) with dilation 3, congestion 3, expansion 1.