• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2000.10a
• /
• pp.412-418
• /
• 2000

In this paper, we will propose that HCN(n,n) gets Hamiltonian Cycles and analyze embedding among HCN(n,n) and UFN(n,n), and HFN(n,n) and In-hypercube. Further, we will prove that HCN(n,n) can be embedded into HFN(n,n) with dilation 3 and the cost for HFN(n,n) to be embedded into HCN(n,n) will be O(n), and HW(n,n) can be embedded into 2n-hypercube with dilation 3 and the cost for In-hypercube to be embedded into HFN(n,n) will be O(n).

• The KIPS Transactions:PartA
• /
• v.14A no.6
• /
• pp.327-332
• /
• 2007

In this paper, we will analysis embedding between $2^{2n-k}{\times}2^k$ torus and interconnection networks HFN(n,n), HCN(n,n). First, we will prove that $2^{2n-k}{\times}2^k$ torus can be embedded into HFN(n,n) with dilation 3, congestion 4 and the average dilation is less than 2. And we will show that $2^{2n-k}{\times}2^k$ torus can be embedded into HCN(n,n) with dilation 3 and the average dilation is less than 2. Also, we will prove that interconnection networks HFN(n,n) and HCN(n,n) can be embedded into $2^{2n-k}{\times}2^k$ torus with dilation O(n). These results mean so many developed algorithms in torus can be used efficiently in HFN(n,n) and HCN(n,n).

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.18 no.6
• /
• pp.1361-1368
• /
• 2014

In this paper, we analyze emddings among HFCube(n,n), HCN(n,n), HFN(n,n) with lower network cost than that of Hypercube. The results are as follows. We propose that $Q_{2n}$ can be embedded into HFCube(n,n) with dilation 5, congestion 2. HCN(n,n) and HFN(n,n) are subgraphs of HFCube(n,n). HFCube(n,n) can be embedded into HFN(n,n) with dilation 3. HFCube(n,n) can be embedded into HCN(n,n) with dilation O(n). The results will be helpful to analyze several efficient properties in each interconnection network.

• 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 KIPS Transactions:PartA
• /
• v.16A no.4
• /
• pp.299-306
• /
• 2009

Hierarchical Folded HyperStar Network has lower network cost than HCN(n,n) and HFN(n,n) which are hierarchical networks with the same number of nodes. In this paper, we analyze embedding between Hierarchical Folded HyperStar HFH($C_n,C_n$) and Hypercube, HCN(n,n), HFN(n,n). The results of embedding are that HCN(n,n), HFN(n,n) and Hypercube $Q_{2n}$ can be embedded into HFH($C_n,C_n$) with expansion $\frac{C^n}{2^{2n}}$ and dilation 2, 3, and 4, respectively. Also, HFH($C_n,C_n$) can be embedded into HFN(2n,2n) with dilation 1. These results mean so many developed algorithms in Hypercube, HCN(n,n), HFN(n,n) can be used efficiently in HFH($C_n,C_n$).

• The KIPS Transactions:PartA
• /
• v.9A no.2
• /
• pp.191-196
• /
• 2002

It is one of the important measures in the area of algorithm design that any interconnection network should be embedded into another interconnection network for the practical use of algorithm. A HCN(n, n), HFN(n, n) graph also has such a good properties of a hypercube and has a lower network cost than a hypercube. In this paper, we propose a method to embed between hypercube $Q_2n$ and HCN(n, n), HFN(n, n) graph. We show that hypercube $Q_2n$ can be embedded into an HCN(n, n) and KFN(n, n) with dilation 3, and average dilation is smaller than 2. Also, we has a result that the embedding cost, a HCN(n, n) and KFN(n, n) can be embedded into a hypercube, is O(n)

• Proceedings of the Korea Information Processing Society Conference
• /
• 2000.10a
• /
• pp.637-640
• /
• 2000

본 논문에서는 하이퍼큐브보다 망비용이 개선된 HFN(n,n)과 2n-hypercube 사이의 임베딩을 분석한다. 2n-hypercube를 HFN(n,n)에 연장율 3에 임베딩 가능함을 보이고, HFN(n,n)을 2n-hypercube에 임베딩하는 비용이 O(n)임을 보인다.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2002.11a
• /
• pp.111-114
• /
• 2002

임베딩은 어떤 연결망이 다른 연결망 구조에 포함 혹은 어떻게 연관되어 있는지를 알아보기 위해 어떤 특정한 연결망을 다른 연결망에 사상하는 것으로, 특정한 연결망에서 사용하던 여러 가지 알고리즘을 다른 연결망에서 효율적으로 이용할 수 있도록 한다. 본 논문에서는 $2^{2n-k}\times2^k$ 토러스를 HFN(n,n)에 연장율 3, 밀집율 4 로 임베딩 가능함을 보이고, HFN(n,n)을 $2^{2n-k}\times2^k$ 토러스에 연장율 O(N)으로 임베딩됨을 보인다($N=2^n$).

• Smart Media Journal
• /
• v.10 no.1
• /
• pp.88-98
• /
• 2021

As blockchain technology has emerged as a security issue for IoT, technology which integrates block chain into IoT is being studied. In this paper is a research concerning token-based IoT service access control technology for data sharing, which propose a possessor focused data sharing technic by using the permissioned blockchain. To share IoT health data, a Hyperledger Fabric Network consisting of three organizations was designed to provide a way to share data by applying different access control policies centered on device owners for different services. In the proposed system, the device owner issues access control tokens with different security levels applied to the participants in the organization, and the token issue information is shared through the distributed ledger of the HFN. In IoT, it is possible to lightweight the access control processing of IoT devices by granting tokens to service requesters who request access to data. Furthmore, by sharing token issuance information among network participants using HFN, the integrity of the token is guaranteed and all network participants can trust the token. The device owners can trust that their data is being used within their authorized rights, and control the collection and use of data.

• The Korean Journal of Physiology and Pharmacology
• /
• v.3 no.6
• /
• pp.605-613
• /
• 1999

The purpose of the present study was to evaluate cardiovascular regulation during passive standing (PS) after ethanol ingestion by spectral analysis of heart rate variability (HRV) in flushed and nonflushed subjects. Of 24 young male subjects, 8 belonged to flushed group (F) and 16 to nonflushed group (NF). Two sessions of 10-min PS were performed before and after ethanol (0.5 g/kg) ingestion. Powers of R-R interval variability in very low frequency $(VLF,\;0{\sim}0.05\;Hz),$ low frequency $(LF,\;0.05{\sim}0.15\;Hz)$ and high frequency $(HF,\;0.15{\sim}0.50\;Hz)$ bands, normalized powers (LFn and HFn) and LF/HF ratio were obtained. After ethanol ingestion, F showed higher heart rate than NF. PS increased LFn $(+22.9{\pm}3.6\;in\;NF,\;+12.8{\pm}4.7$ in F, in normalized units) and LF/HF $(+3.10{\pm}0.57\;in\;NF,\;+3.00{\pm}1.08\;in\;F)$ and decreased HFn powers. Ethanol ingestion increased LFn and LF/HF and decreased HFn. PS after ethanol resulted in higher LFn and LF/HF and lower HFn than the prior PS. F showed a greater and more sustained HRV change than NF after ethanol. In conclusion, PS or ethanol ingestion increased LFn and LF/HF and decreased HFn. Flushed subjects showed an accentuated HRV response to ethanol.