• The KIPS Transactions:PartC
• /
• v.17C no.1
• /
• pp.119-128
• /
• 2010

In the shipbuilding industry, due to the global trends where the number of IT (Information Technology) devices of a smart ship have been increased rapidly, the need to develop a new shipboard backbone network has recently emerged for integrating and managing the IT devices of a smart ship efficiently. A shipboard backbone network requires high survivability because it is constructed in automatic and unmanned smart ships where a failure of the backbone network can cause critical problems. The purpose of this paper thus is to study SAN (Ship Area Network) as a efficient shipboard backbone network, considering particularity of shipboard environment and requirement of high survivability. In order to do so, we designed a dual network topology that all network nodes, including the IT devices installed in a smart ship, are connected each other through dual paths, and reuding tht IT devices pnstalles supporices network survivability as well as t Iffic efficiency for the dual network topology. And then, we verified the performance of the suggested SAN by theoretical and practical analysis including the graph theory, the probability theory, implemental specifications, and computer simulations.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.5
• /
• pp.19-29
• /
• 2016

This paper suggests a method to refine a massive collective intelligence data, and visualize with multilevel sentiment network, in order to understand information in an intuitive and semantic way. For this study, we first calculated a frequency of sentiment words from each movie review. Second, we designed a Heatmap visualization to effectively discover the main emotions on each online movie review. Third, we formed a Sentiment-Movie Network combining the MDS Map and Social Network in order to fix the movie network topology, while creating a network graph to enable the clustering of similar nodes. Finally, we evaluated our progress to verify if it is actually helpful to improve user cognition for multilevel analysis experience compared to the existing network system, thus concluded that our method provides improved user experience in terms of cognition, being appropriate as an alternative method for semantic understanding.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.9
• /
• pp.2020-2028
• /
• 2013

In this paper, we propose a novel analysis and design methodology based on complex network theory for wireless large-scale ad hoc networks. We also enhance the conventional analysis methods which does not sufficiently consider the effect of the wireless communication channels and extend the existing random graph theory by reflecting the wireless communication environments. As a main result, the effect of the network topology such as average degree of each communication node on the network capacity through extensive computer simulations.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.8 no.2
• /
• pp.386-393
• /
• 2004

In order to maintain load balancing in distributed systems in a decentralized manner, every node should obtain workload information from all the nodes on the network. It requires $Ο({v^2})$ traffic overheads, where v is the number of nodes. This paper presents a new synchronous dynamic distributed load balancing algorithm for a ( v,k+1,1)-configured network topology, which is a kind of 2k regular graph, based on symmetric balanced incomplete block design, where v equals ${k^2}+k+1$. Our algorithm needs only Ο(v√v) message overheads and each node receives workload information from all the nodes without redundancy. And load balancing in this algorithm is maintained so that every link has same amount of traffic by √v for transferring workload information.

• 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.

• International Journal of Naval Architecture and Ocean Engineering
• /
• v.12 no.1
• /
• pp.832-842
• /
• 2020

The coordination control of multiple Underactuated Underwater Vehicles (UUVs) moving in three dimensional space is investigated in this paper. The coordinated path following control task is decomposed into two sub tasks, that is, path following control and coordination control. In the spatial curve path following control task, path following error dynamics is build in the Serret-Frenet coordinate frame. The virtual reference object can be chosen freely on the desired spatial path. Considering the speed of the UUV, the line-of-sight navigation is introduced to help the path following errors quickly converge to zero. In the coordination control sub task, the communication topology of multiple UUVs is described by the graph theory. The speed of each UUV is adjusted to achieve the coordination. The path following system and the coordination control system are viewed as the feedback connection system. Input-to-state stable of the coordinated path following system can be proved by small gain theorem. The simulation experiments can further demonstrate the good performance of the control method.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2023.05a
• /
• pp.374-376
• /
• 2023

최근 환율 예측에 관한 다양한 연구가 진행되어 왔다. 이러한 추세에 대응하여 본 연구에서는 Pearson 상관 계수 및 상호 정보를 사용하여 외환 시장의 환율 변동을 분석하는 다중 연결 네트워크를 구축하였다. 본 연구에서는 이러한 구성된 환율 변화에 대한 시공간 의존성 네트워크를 만들고 그래프 기계 학습의 잠재력을 조사하여 예측 정확도를 향상시키려고 노력하였다. 본 연구 결과는 선형 및 비선형 종속 네트워크 모두에 대해 그래프 신경망을 활용한 임베딩을 활용하여 기존의 기계 학습 알고리즘과 결합시킬 경우 환율 변화의 예측력이 향상될 수 있음을 경험적으로 확인하였다. 특히, 이러한 결과는 통화 간 상호 의존성에만 의존하여 추가 데이터 없이 달성되었다. 이 접근 방식은 데이터 효율성을 강화하고 그래프 시각화를 통해 설명력 있는 통찰력을 제공하며 주어진 데이터 세트 내에서 효과적인 데이터를 생성하여 예측력을 높이는 결과로 해석할 수 있다.

• Progress in Superconductivity and Cryogenics
• /
• v.25 no.4
• /
• pp.75-80
• /
• 2023

Rare earth barium copper oxide (REBCO) materials have shown the possibility of high-temperature superconductor (HTS) magnetic resonance imaging (MRI) magnets due to their elevated transition temperature. While numerous MRI magnet designs have emerged, there is a growing emphasis on estimating the cost before manufacturing. In this paper, we propose two designs of REBCO whole-body MRI magnets: (1) 1.5 T and (2) 3.0 T, the standard center field choices for hospital use, and compare their costs based on conductor usage. The basis topology of the design method is based on discretized solenoids to enhance field homogeneity. Magnetic stress calculation is done to further prove the mechanical feasibility of their construction. Multi-width winding technique and outer notch structure are used to improve critical current characteristic. We apply consistent constraints for current margins, sizes, and field homogeneities to ensure an equal cost comparison. A graph is plotted to show the cost increase with magnetic flux growth. Additionally, we compare our designs to two additional MRI magnet designs from other publications with respect to the cost and magnetic flux, and present the linear relationship between them.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.11a
• /
• pp.149-152
• /
• 2007

본 논문에서는 대규모 네트워크 상에서 발생되는 시뮬레이션 결과를 효과적으로 보여주기 위한 Visualization Tool 을 제안한다. 복잡하고 다양한 시뮬레이션 결과를 얻기 위해, 생태계 모방형 플랫폼을 이용한 Bio-IDS (Intrusion Detection System) 시뮬레이터의 실험 데이터를 이용하였다. 대규모 네트워크를 모두 보이기에는 화면이 너무 작기 때문에, Visualization Tool 은 화면의 확대 및 축소를 위한 Zoom In/Out 기능, 화면의 Panning 을 위한 Scroll Bar 및 현재 영역의 위치를 알려주는 Mini Map 이 필요하였다. 또한, 사용자가 쉽게 시뮬레이션의 속도를 조절할 수 있도록 Simulation Speed Control 기능을 구현하였으며, 각 노드의 효과적인 정상 및 침입 상태 표시를 위한 Icon, 각 노드의 진화 정도와 침입 탐지 정확도를 알려주는 Evolution Number와 Accuracy Gauge, 해당 시뮬레이션의 결과를 도시하기 위한 Simulation Graph 도 추가하였다. 네트워크 Off-line 환경도 대비하여, DB 로부터의 데이터 입력뿐만 아니라 Log File 을 통한 데이터 입력도 가능하게 하였다. 끝으로, 전체 Node 들의 다양한 상태변화를 확인할 수 있는 Topology Window 와 Simulation Demo Window 간의 Synchronization 을 위한 Socket 통신 등 다양한 기능들이 통합된 Visualization Tool 을 개발함으로써, 대규모 네트워크 시뮬레이션의 효과적인 시뮬레이션이 가능하게 되었다. 이로 인해 대규모 네트워크 상의 복잡한 시뮬레이션 결과도 사용자가 매우 쉽게 파악할 수 있 매우 효과적으로 사용자가 파악할 수 있게 되었다.