• Journal of Fashion Business
• /
• v.15 no.3
• /
• pp.97-111
• /
• 2011

This study aims to apply 3D virtual fabric parameters - as obtained from previous research experiments - to 3D virtual clothing simulation in comparing its similarity with actual clothing as worn, with a view to verifying the objectivity and validity of the 3D virtual fabric simulation method devised by the drape image analysis method. In addition, the result is intended to be used as the basic data for new 3D virtual clothing simulation methods. As the results, 3D virtual fabric parameters designed to simulate 3D drape to be similar to actual fabrics were found to be Bending Strength, Buckling Point, Density, Particle Distance, and Shear. They were also found to be important measurements when evaluating visual similarity between drape shadow images and number of nodes. 3D virtual fabric simulation method devised by the drape image analysis method was appropriate in extracting 3D fabric parameters with the reflection of actual fabrics' physical and dynamic characteristics, in connection with 3D virtual fabric simulation. 3D virtual fabric parameters with the reflection of actual fabrics' physical and dynamic characteristics using the proposed 3D virtual fabric simulation method are accumulated and provided as a standard, this will facilitate the introduction 3D virtual fabric simulation technology.

• Journal of Society of Preventive Korean Medicine
• /
• v.25 no.2
• /
• pp.33-43
• /
• 2021

Objectives : This study seeks to grasp the current status of Koryo medical research in North Korea, by focusing on researchers and research topics. Methods : A network analysis of co-authors and keyword which were extracted from Koryo Medicine - a North Korean traditional medicine journal, was conducted. Results : The results of author network analysis was a sparse network due to the low correlation between authors. The domain-wide network density of co-authors was 0.001, with a diameter of 14, average distance between nodes 4.029, and average binding coefficient 0.029. The results of the keyword network analysis showed the keyword "traditional medicine" had the strongest correlation weight of 228. Other keywords with high correlation weight was common acupuncture (84) and intradermal acupuncture(80). Conclusions : Although the co-authors of the Koryo Medicine did not have a high correlation with each other, they were able to identify key researchers considered important for each major sub-network. In addition, the keywords of the Koryo Medicine journals had a very high linkage to herbal medicines.

• Journal of Korea Multimedia Society
• /
• v.16 no.8
• /
• pp.943-953
• /
• 2013

By the enormous increase in mobile nodes and diverse service requests on wireless networks, wireless mesh network(WMN) takes an interest as the solution for such requests. However, lots of issues which should be solved to deploy WMN are still remained. In the network layer, the performance improvement of routing protocols is the major issue of nowadays researches. WMN can be easily deployed by use of protocols for mobile ad-hoc networks(MANET) because it is much similar with MANET in multi-hop wireless routing and which node plays as host and router concurrently. Unfortunately, most routing protocols for MANET have drawbacks such as large traffic overhead and long delay time for route discovery due to the network extension. They are major factors of performance degradation of WMN and most researches are focused on them. In this paper, domain-based AODV which is amended AODV to be applied in hybrid WMN is proposed. The proposed scheme divides a hybrid WMN as several domains and performs route discovery by header layer domain. Therefore it can reduce the distance for route discovery as much as average hop count between domain header and member nodes. From the simulation, domain-based AODV was showed slowly increasing delay time due to the network extension.

• Journal of Advanced Marine Engineering and Technology
• /
• v.39 no.2
• /
• pp.179-186
• /
• 2015

In the indoor location estimation system, which has recently been actively studied, the received signal strength indicator contains a high level of noise when measuring the signal strength in the range between two nodes consisting of a receiver and a transceiver. To minimize the noise level, this paper proposes an improved adaptive smoothing filter that provides different exponential weights to the current value and previous averaged one of the data that were obtained from the nodes, because the characteristic signal attenuation of the received signal strength indicator generally has a log distribution. The proposed method can effectively decrease the noise level by using a feedback filter that can provide different weights according to the noise level of the obtained data and thus increase the accuracy in the distance and location without an additional filter such as the link quality indicator, which can verify the communication quality state to decrease the range errors in the indoor location recognition using ZigBee based on IEEE 802.15.4. For verifying the performance of the proposed improved adaptive smoothing filter, actual experiments are conducted in three indoor locations of different spatial sections. From the experimental results, it is verified that the proposed technique is superior to other techniques in range measurement.

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

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.46 no.4
• /
• pp.139-147
• /
• 2009

In this paper, optimum design of energy-aware distributed detection is considered for a parallel sensor network system consisting of a fusion center and two passive sonar nodes. AND rule and OR rule are employed as the fusion rules of the sensor network. For the fusion rules, it is shown that a threshold rule of each sensor node has uniformly most powerful properties. Optimum threshold for each sensor is investigated that maximizes the probability of detection under a constraint on energy consumption due to false alarms. It is also investigated through numerical experiments how signal strength, an energy constraint, and the distance between two sensor nodes affect the system detection performances.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.8
• /
• pp.1926-1933
• /
• 2013

Many localization algorithms have been proposed for Wireless Sensor Networks (WSNs). The IEEE 802.15.4a-based location-aware-system can provide precise ranging distance between two mobile nodes. The mobile nodes can obtain their exact locations by using accurate ranging distances. However, the indoor environments contain various obstacles which cause non-line-of-sight (NLOS) conditions. In NLOS condition, the IEEE 802.15.4a-based location-aware system has a large scale location error. To solve the problem, we propose location error compensation in indoor environment by using MST-based topology control. Experimental and simulation results show that the proposed algorithm improves location accuracy in NLOS conditions.

• KIPS Transactions on Software and Data Engineering
• /
• v.9 no.1
• /
• pp.17-24
• /
• 2020

The traveling salesman problem is an algorithmic problem tasked with finding the shortest route that a salesman visits, visiting each city and returning to the started city. Due to the exponential time complexity of TSP, it's hard to implement on cases like amusement park or delivery. Also, TSP is hard to meet user's demand that is associated with multi-dimensional attributes like travel time, interests, waiting time because it uses only one attribute - distance between nodes. This paper proposed Top-n Skyline-Multi Dimension TSP to resolve formerly adverted problems. The proposed algorithm finds the shortest route faster than the existing method by decreasing the number of operations, selecting multi-dimensional nodes according to the dominance of skyline. In the simulation, we compared computation time of dynamic programming algorithm to the proposed a TS-MDT algorithm, and it showed that TS-MDT was faster than dynamic programming algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.29 no.2
• /
• pp.65-74
• /
• 2002

Recently star networks are considered as attractive alternatives to the widely used hypercube for interconnection networks in parallel processing systems by many researchers. One of the fundamental communication problems on star graph networks is broadcasing In this paper we consider the broadcasting problems in star graph networks using wormhole routing. In wormhole routed system minimizing link contention is more critical for the system performance than the distance between two communicating nodes. We use Hamiltonian paths in star graph to set up link-disjoint communication paths We present a broadcast algorithm in n-dimensional star graph of N(=n!) nodes such that the total completion time is no larger than $([long_n n!]+1)$ steps where $([long_n n!]+1)$ is the lower bound This result is significant improvement over the previous n-1 step broadcasting algorithm.

• Smart Media Journal
• /
• v.11 no.3
• /
• pp.39-53
• /
• 2022

Cloud of Things (CoT) can provide IoT applications with unlimited storage functions and processing power supported by cloud services. However, in a centralized cloud of things, it can create a single point of failure that can lead to bottleneck problems, outages of the CoT network. In this paper, to solve the problem of centralized cloud of things and interoperate between different service domains, we propose an IoT service interoperability system using distributed fog computing and blockchain technology. Distributed fog is used to provide real-time data processing and services in fog systems located at a geographically close distance to IoT devices, and to enable service interoperability between each fog using smart contracts and distributed ledgers of the blockchain. The proposed system provides services within a region close to the distributed fog entrusted with the service from the cloud, and it is possible to access the services of other fogs without going through the cloud even between fogs. In addition, by sharing a service right token issuance information between the cloud and fog nodes using a blockchain network, the integrity of the token can be guaranteed and reliable service interoperability between fog nodes can be performed.