• Advances in nano research
• /
• v.7 no.1
• /
• pp.39-49
• /
• 2019

This paper focuses on two main objectives. The first one is to exploit an energy equivalent model and finite element method to evaluate the equivalent Young's modulus of single walled carbon nanotubes (SWCNTs) at any orientation angle by using tensile test. The calculated Young's modulus is validated with published experimental results. The second target is to exploit the finite element simulation to investigate mechanical buckling and natural frequencies of SWCNTs. Energy equivalent model is presented to describe the atomic bonding interactions and their chemical energy with mechanical structural energies. A Program of Nanotube modeler is used to generate a geometry of SWCNTs structure by defining its chirality angle, overall length of nanotube and bond length between two adjacent nodes. SWCNTs are simulated as a frame like structure; the bonds between each two neighboring atoms are treated as isotropic beam members with a uniform circular cross section. Carbon bonds is simulated as a beam and the atoms as nodes. A finite element model using 3D beam elements is built under the environment of ANSYS MAPDL environment to simulate a tensile test and characterize equivalent Young's modulus of whole CNT structure. Numerical results are presented to show critical buckling loads, axial and transverse natural frequencies of SWCNTs with different orientation angles and lengths. The understanding of mechanical behaviors of CNTs are essential in developing such structures due to their great potential in wide range of engineering applications.

• Journal of the Korea Society for Simulation
• /
• v.18 no.1
• /
• pp.1-7
• /
• 2009

In this paper, we obtain the optimal number of interfaces/channels in wireless mesh networks by simulation. The simulation study is done in static multi-channel multi-interface environment. When many nodes use a single interface and channel and contend for the channel, collisions of RTS/CTS results in network performance degradation. To avoid such degradation and reduce interferences between the adjacent nodes, use of multi-interface/channel is considered. 802.11a and 802.11b systems offer 12 and 3 orthogonal channels respectively and multi-interface/channel scheme could be applied. But rare research about the optimal number of interfaces/channels has been studied. Therefore, in this paper, simulation study for the optimal number of interfaces/channels in wireless mesh network is made.

• Journal of the Korea Society of Computer and Information
• /
• v.14 no.5
• /
• pp.93-102
• /
• 2009

Environmental monitoring applications measure temporature, humidity, and pollution degrees of large areas periodically and are essential for ubiquitous society. In this paper, we propose a sensor network MAC protocol that is applicable to environmental monitoring applications. The proposing MAC protocol has scalability by constructing multiple groups of sensor nodes as in SMAC protocol. Differently from SMAC protocol, however, ours have hierarchical structure between adjacent groups. Data transmission schedules are efficient since lower groups are synchronized to higher groups. Thus. the end-to-end delays and energy consumption can be reduced due to sequential transmission schedules. But since the nodes within the same group are synchronized to themselves. they have good adaptability and scalability compared to existing hierarchical approaches such as DMAC. We show by simulations that the proposing MAC protocol is superior to SMAC for environmental monitoring applications.

• Proceedings of the Korea Information Processing Society Conference
• /
• 2007.05a
• /
• pp.333-336
• /
• 2007

We propose a simple method for tracking a nonparameterized subject contour in a single video stream with a moving camera and changing background. Then we present a method to eliminate the tracked contour object by replacing with the background scene we get from other frame. Our method consists of two parts: first we track the object using LOD (Level-of-Detail) canny edge maps, then we generate background of each image frame and replace the tracked object in a scene by a background image from other frame that is not occluded by the tracked object. Our tracking method is based on level-of-detail (LOD) modified Canny edge maps and graph-based routing operations on the LOD maps. To reduce side-effects because of irrelevant edges, we start our basic tracking by using strong Canny edges generated from large image intensity gradients of an input image. We get more edge pixels along LOD hierarchy. LOD Canny edge pixels become nodes in routing, and LOD values of adjacent edge pixels determine routing costs between the nodes. We find the best route to follow Canny edge pixels favoring stronger Canny edge pixels. Our accurate tracking is based on reducing effects from irrelevant edges by selecting the stronger edge pixels, thereby relying on the current frame edge pixel as much as possible. This approach is based on computing camera motion. Our experimental results show that our method works nice for moderate camera movement with small object shape changes.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2012.05a
• /
• pp.278-280
• /
• 2012

We are propose the position of the node context-awareness information and the validity of the head node in the path according to the clustering how to elect one of the energy efficiency ECOPS (Energy Conserving Optimal path Schedule) algorithm. Existing LEACH algorithm to elect the head node when the node's energy probability distribution function based on the management of the head node is optional cycle. However, in this case, the distance of the relay node status information including context-awareness parameters does not reflect. These factors are not suitable for the relay node or nodes are included in the probability distribution, if the head node selects occurs. In particular, to solve the problems from the LEACH-based hierarchical clustering algorithms, this study defines location with the status context information and the residual energy factor in choosing topology of the structure adjacent nodes. ECOPS algorithm that contextual information is contributed for head node selection in topology protocols. The proposed ECOPS algorithm has the head node replacement situations from the candidate head node in the optimal path and efficient energy conservation that is the path of the member nodes. The new head node election show as the entire node lifetime and network management technique improving the network lifetime and efficient management the simulation results.

• Journal of the Computational Structural Engineering Institute of Korea
• /
• v.28 no.2
• /
• pp.213-220
• /
• 2015

CFT column has a lot of structural advantages due to the composite behavior between in-filled concrete and steel tube. This paper deals with the development of an effective numerical model which can consider the bond-slip behavior between both components of concrete matrix and steel tube without taking double nodes. Since the applied axial load to in-filled concrete matrix is delivered to steel tube by the confinement effect and the friction, the governing equation related to the slip behavior can be constructed on the basis of the force equilibrium and the compatability conditions. In advance, the force and displacement relations between adjacent two nodes make it possible to express the slip behavior with the concrete nodes only. This model results in significant savings in the numerical modeling of CFT columns to take into account the effect of bond-slip. Finally, correlation studies between numerical results and experimental data are conducted to verifying the efficiency of the introduced numerical model.

• Journal of the Institute of Convergence Signal Processing
• /
• v.9 no.4
• /
• pp.313-320
• /
• 2008

The dynamic clustering technique has some problems regarding energy consumption. In the cluster configuration aspect the cluster structure must be modified every time the head nodes are re-selected resulting in high energy consumption. Also, there is excessive energy consumption when a cluster head node receives identical data from adjacent cluster sources nodes. This paper proposes a solution to the problems described above from the energy efficiency perspective. The round-robin cluster header(RRCH) technique, which fixes the initially structured cluster and sequentially selects duster head nodes, is suggested for solving the energy consumption problem regarding repetitive cluster construction. Furthermore, the issue of redundant data occurring at the cluster head node is dealt with by broadcasting metadata of the initially received data to prevent reception by a sensor node with identical data. A simulation experiment was performed to verify the validity of the proposed approach. The results of the simulation experiments were compared with the performances of two of the must widely used conventional techniques, the LEACH(Low Energy Adaptive Clustering Hierarchy) and HEED(Hybrid, Energy Efficient Distributed Clustering) algorithms, based on energy consumption, remaining energy for each node and uniform distribution. The evaluation confirmed that in terms of energy consumption, the technique proposed in this paper was 29.3% and 21.2% more efficient than LEACH and HEED, respectively.

• Journal of Korea Multimedia Society
• /
• v.12 no.11
• /
• pp.1609-1622
• /
• 2009

In wireless sensor networks, a clustering protocol is an efficient method to prolong network lifetime. In general, it results in more energy consumption at the cluster-head node. Hence, such a protocol must changes the cluster formation and cluster-head node in each round to prolong the network lifetime. But, this method also causes large amount of energy consumption during the set-up process of cluster formation. In order to improve energy efficiency, in this paper, we propose a new clustering algorithm. In this algorithm, we exclude duplicated data of adjacent nodes and transmits the threshold value. We define a group as the sensor nodes within close proximity of each other. In a group, a node senses and transmits data at a time on the round-robin basis. In a view of whole network, group is treated as one node. During the setup phase of a round, intra clusters are formed first and then they are re-clustered(network cluster) by choosing cluster-heads(group). In the group with a cluster-head, every member node plays the role of cluster-head on the round-robin basis. Hence, we can lengthen periodic round by a factor of group size. As a result of analysis and comparison, our scheme reduces energy consumption of nodes, and improve the efficiency of communications in sensor networks compared with current clustering methods.

• Journal of the Korea Academia-Industrial cooperation Society
• /
• v.19 no.1
• /
• pp.113-120
• /
• 2018

Angiography and CT angiography are used widely for the examination of vascular diseases, but the diagnosis of such diseases is made mostly by the subjective judgment of the inspector. This paper proposes a method for detecting the suspicious regions of stenosis and aneurysm in the inner surfaces of 3D blood vessel models reconstructed from medical images. Initially, the 3D curve-skeletons of the blood vessel models and the contours at the nodes of the curve-skeletons were generated. Next, the 3D curve-skeletons were divided into a set of branches and the areas of normal contours of nodes located in each branch were calculated. The nodes whose contours contain suspicious regions were detected by taking into account the average area, maximum and minimum areas, and the area difference between the adjacent normal contours. The diagnosis of stenosis and aneurysm can be supported by properly visualizing the suspicious regions detected. The suspicious regions of the disease were identified by implementing and testing it using several data sets of human blood vessels, highlighting the usefulness of the proposed method.

• Journal of Korea Multimedia Society
• /
• v.12 no.10
• /
• pp.1374-1385
• /
• 2009

Recently, advances in speed of the CPU have for out-paced advances in memory speed. Main-memory access is increasingly a performance bottleneck for main-memory database systems. To reduce memory access speed, cache memory have incorporated in the memory subsystem. However cache memories can reduce the memory speed only when the requested data is found in the cache. We propose a new cache sensitive T-tree index structure called as $CST^*$-tree for range query search. The $CST^*$-tree reduces the number of cache miss occurrences by loading the reduced internal nodes that do not have index entries. And it supports the sequential access of index entries for range query by connecting adjacent terminal nodes and internal index nodes. For performance evaluation, we have developed a cost model, and compared our $CST^*$-tree with existing CST-tree, that is the conventional cache sensitive T-tree, and $T^*$-tree, that is conventional the range query search T -tree, by using the cost model. The results indicate that cache miss occurrence of $CST^*$-tree is decreased by 20~30% over that of CST-tree in a single value search, and it is decreased by 10~20% over that of $T^*$-tree in a range query search.