Hyun Sim

Multiple Reduced Hypercube MRH(n): A New Interconnection Network Reducing Both Diameter and Edge of Hypercube

In this paper, Multiple Reduced Hypercube(MRH), which is a new interconnection network based on a hypercube interconnection network, is suggested. Also, this paper demonstrates that MRH(n) proposed in this study is superior to the previously proposed hypercube interconnection networks and the hypercube transformation interconnection networks in terms of network cost(diameter × degree). In addition, several network properties(connectivity, routing algorithm, diameter, broadcasting) of MRH(n) are analyzed.

One-to-One Embedding between Honeycomb Mesh and Petersen-Torus Networks

As wireless mobile telecommunication bases organize their structure using a honeycomb-mesh algorithm, there are many studies about parallel processing algorithms like the honeycomb mesh in Wireless Sensor Networks. This paper aims to study the Peterson-Torus graph algorithm in regard to the continuity with honeycomb-mesh algorithm in order to apply the algorithm to sensor networks. Once a new interconnection network is designed, parallel algorithms are developed with huge research costs to use such networks. If the old network is embedded in a newly designed network, a developed algorithm in the old network is reusable in a newly designed network. Petersen-Torus has been designed recently, and the honeycomb mesh has already been designed as a well-known interconnection network. In this paper, we propose a one-to-one embedding algorithm for the honeycomb mesh (HMn) in the Petersen-Torus PT(n,n), and prove that dilation of the algorithm is 5, congestion is 2, and expansion is 5/3. The proposed one-to-one embedding is applied so that processor throughput can be minimized when the honeycomb mesh algorithm runs in the Petersen-Torus.

Embedding algorithms for bubble-sort, macro-star, and transposition graphs

Bubble-sort, macro-star, and transposition graphs are interconnection networks with the advantages of star graphs in terms of improving the network cost of a hypercube. These graphs contain a star graph as their sub-graph, and have node symmetry, maximum fault tolerance, and recursive partition properties. This study proposes embedding methods for these graphs based on graph definitions, and shows that a bubble-sort graph Bn can be embedded in a transposition graph Tn with dilation 1 and expansion 1. In contrast, a macro-star graph MS(2, n) can be embedded in a transposition graph with dilation n, but with an average dilation of 2 or under.

Embedding Methods for Bubble-Sort, Pancake, and Matrix-Star Graphs

Bubble-sort, pancake, and matrix-star graphs are interconnection networks with all the advantages of star graphs but with lower network costs. This study proposes and analyzes embedding methods for these graphs based on the edge definition of graphs. Results show that bubble-sort graph B n can be embedded in pancake graph T n with dilation 3 and expansion 1, while bubble-sort graph B 2n can be embedded in matrix-star MS 2,n with dilation 5 and expansion 1.

Valve monitoring system design and implementation using an infrared sensor and ZigBee

The valve device is installed in hazardous areas, such as a chemical plant explosion has been sealed with fire protection device to prevent the risk of explosion. In this paper, due to the explosion-proof devices using external power the device can not be used in infrared sensors and Zigbee sensor valve device by measuring the open degree of valve opening and closing of the danger zone to check whether. Valve opening and closing operation log screen time, we propose a low-power operation monitoring system administrators to manage and control the plant. Develop power control relay board apply an improved algorithm to apply the asynchronous LPL power management. The plant monitoring system and explosion-proof valve opening and closing the valve system with the intelligent device designed and implemented and tested it.

The Development of On-line Self-Test Module using Tracing Method

The higher thinking skills, such as creativity and problem-solving about a given problem, are difficult to assess and diagnose. For an accurate diagnosis of these higher thinking abilities, we need to fully observe learner`s problem-solving process or learner`s individual reports. However, in an online learning or virtual class environments, evaluation of learner`s problem-solving process becomes more difficult to diagnose. The best way to solve this problem is through reporting by tracking learner`s actions when he tries to solve a problem. In this study, we developed a module which can evaluate and diagnose student`s problem-solving ability by tracking actions in MS-Office suite, which is used by students to solve a given problem. This module performs based on the learner`s job history through user tracking. To evaluate the effectiveness of this diagnostic module, we conducted satisfaction survey from students who were preparing the actual MOS exams. As a result, eighty-one (81) of the participants were positive on the effectiveness of the learning system with the use of this module.

Scalable Cooperative Positioning System in Wireless Sensor Networks

Locations of positioned nodes as well as gathered data from nodes are very important because generally multiple nodes are deployed randomly and data are gathered in wireless sensor network. Since the nodes composing wireless sensor network are low cost and low performance devices, it is very difficult to add specially designed devices for positioning into the nodes. Therefore in wireless sensor network, technology positioning nodes precisely using low cost is very important and valuable. This research proposes Cooperative Positioning System, which raises accuracy of location positioning and also can find positions on multiple sensors within limited times. And this research verifies this technology is excellent in terms of performance, accuracy, and scalability through simulation.

Embedding Algorithm between MRH(n) and Hypercube

In MRH(n) interconnection network, which has been recently proposed as a new phase for parallel processing, network cost (degree × diameter) is improved by reducing diameter and edge at the same time, while existing hypercube transformation graphs reduce just one of diameter or edge. This paper suggests an embedding method between Hypercube Network Q n and Multiple Reduced Hypercube Network MRH(n). In addition, this paper demonstrates that Hypercube Q n is embedded in MRH(n) at dilation 3 and expansion 2, and that average dilation is 2 or less.