• The Transactions of The Korean Institute of Electrical Engineers
• /
• v.67 no.2
• /
• pp.285-292
• /
• 2018

In this paper, we propose a distributed search of a cluster robot using tree structure in an unknown environment. In the proposed method, the cluster robot divides the unknown environment into 4 regions by using the LRF (Laser Range Finder) sensor information and divides the maximum detection distance into 4 regions, and detects feature points of the obstacle. Also, we define the detected feature points as Voronoi Generators of the Voronoi Diagram and apply the Voronoi diagram. The Voronoi Space, the Voronoi Partition, and the Voronoi Vertex, components of Voronoi, are created. The generated Voronoi partition is the path of the robot. Voronoi vertices are defined as each node and consist of the proposed tree structure. The root of the tree is the starting point, and the node with the least significant bit and no children is the target point. Finally, we demonstrate the superiority of the proposed method through several simulations.

• Convergence Security Journal
• /
• v.13 no.4
• /
• pp.109-115
• /
• 2013

Security threats through e-mail service, a representative tool to convey information on the internet, are on the sharp rise. The security threats are made in the path where malicious codes are inserted into documents files attached and infect users' systems by taking advantage of the weak points of relevant application programs. Therefore, to block infection of camouflaged malicious codes in the course of file transfer, this work proposed an integrity-checking and behavior-based detection system using File Transfer System (FTS), logical network partition, and conducted a comparison analysis with the conventional security techniques.

• Korean Journal of Environmental Biology
• /
• v.36 no.4
• /
• pp.507-516
• /
• 2018

The closed chamber method, which is one of the most commonly used method for measuring greenhouse gases produced in rice paddy fields, has limitations in measuring dynamic $CH_4$ flux with spatio-temporal constrains. In order to deal with the limitation of the closed chamber method, some studies based on open-path of eddy covariance method have been actively conducted recently. The aim of this study was to compare the $CH_4$ fluxes measured by open-path and closed chamber method in the paddy rice fields. The open-path, one of the gas ($CO_2$, $CH_4$ etc.) analysis methods, is technology where a laser beam is emitted from the source passes through the open cell, reflecting multiple times from the two mirrors, and then detecting. The $CH_4$ emission patterns by these two methods during rice cultivation season were similar, but the total $CH_4$ emission measured by open-path method were 31% less than of the amount measured by closed chamber. The reason for the difference in $CH_4$ emission was due to overestimation by closed chamber and underestimation by open-path. The closed chamber method can overestimate $CH_4$ emissions due to environmental changes caused by high temperature and light interruption by acrylic partition in chamber. On the other hand, the open-path method for eddy covariance can underestimate its emission because it assumes density fluctuations and horizontal homogeneous terrain negligible However, comparing $CH_4$ fluxes at the same sampling time (AM 10:30-11:00, 30-min fluxes) showed good agreements ($r^2=0.9064$). The open-path measurement technique is expected to be a good way to compensate for the disadvantage of the closed chamber method because it can monitor dynamic $CH_4$ fluctuation even if data loss is taken into account.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2008.05a
• /
• pp.835-838
• /
• 2008

Many researches on hierarchical path search have been studied so far. Even though partitioning regions is essential part, the researches are not enough. This paper proposes two efficient methods to partition regions: 1)a method based on voronoi algorithm in which a major node is central point of a region, 2) a method based on fired grid that partitions regions into major and minor. The performances of the proposed methods are compared with the conventional hierarchical path search method in which a region is formed by the boundary line of nearest 4 points of a major node in terms of the path search time and the accuracy. The results obtained from the experiments show that the method based on voronoi achieves short execution time and the method based grid achieves high accuracy.

• Journal of the Institute of Electronics Engineers of Korea TC
• /
• v.47 no.11
• /
• pp.1-6
• /
• 2010

In Sensor Networks, the problem of finding the optimal routing path dynamically, which passes through all terminals or nodes once per each, may come up. Providing a generalized scheme of approximations that can be applied to the kind of problems, and formulating the bounds of the run time and the results of the algorithm made from the scheme, one may evaluate mathematically the routing path formed in a given network. This paper, dealing with Euclidean TSP(Euclidean Travelling Sales Person) that represents such problems, provides the scheme for constructing the approximated Euclidean TSP by parallel computing, and the ground for determining the difference between the approximated Euclidean TSP produced from the scheme and the optimal Euclidean TSP.

• Journal of the Institute of Electronics Engineers of Korea SD
• /
• v.37 no.6
• /
• pp.72-84
• /
• 2000

The test patterns for path delay faults consist of two patterns. So in order to test the delay faults, a new weight generation algorithm that is different from the weight generation algorithm for stuck-at faults must be applied. When deterministic test patterns for weight calculation are used, the deterministic test patterns must be divided into several subsets, so that Hamming distances between patterns are not too long. But this method makes the number of weight sets too large in delay testing, and may generate inaccurate weights. In this pater, we perform fault simulation without pattern partition. Experimental results for ISCAS 89 benchmark circuits prove the effectiveness of the new weight generation algorithm proposed in this paper.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.34S no.6
• /
• pp.11-20
• /
• 1997

This paper proposes a modified dynamic programming for finding the correspondence between right and left images. A dynamic programming is based on the intensity of images for stereo matching. But htis method is intended to mismatch at uniformed intensity region. To reduce thd mismatching, the stereo images are segmented to various regions with respective uniform intensity, and the different cost function has applied to the segmented region during the dynamci programming. Cost function costains jump cost. And jump cost included two parameter .alpha. and .beta. which have influence on minimum cost path. Experimental results show that the 3D shape of some stereo pairs cna be finely obtained by this proposed algorithm.

• Korean Journal of Computational Design and Engineering
• /
• v.6 no.4
• /
• pp.215-221
• /
• 2001

In the zigzag milling of a pocket having islands, tool retraction is one of the primary factors that decrease productivity. Therefore, tool path with minimum number of tool retraction has been needed. Most researches about this topic have been concentrated on obtaining the optimum solution formulated through the geometric reasoning off pocket. Recently, several attempts were made to simplify this problem into region partitioning in order to get the numerically expressed minimum solution. In this research, a method reducing the number of tool retractions extended from existing region partitioning is provided. Applying the segment that is normal to the reference direction of zigzag milling, region partitioning is carried out and structural elements of the region are searched via graphs of islands and characteristic points. Through the processes presented, the number of region partitioned is less than that of existing processes.

• Journal for History of Mathematics
• /
• v.30 no.2
• /
• pp.71-86
• /
• 2017

When looking for solutions of Jisuguimundo with magic number 88~92 and 94~98, alternating method is applied to each possible partitions of each magic number. But this method does not apply in case of finding solutions of Jisuguimundo with magic number 87, 93, and 99. In this study, it is shown that solutions of Jisuguimundo with magic number 87, 93, and 99 can be found by applying alternating method to two partitions. These two partitions are derived partitions obtained by each partitions of magic number 87, 93, and 99. If every number from 1 to 30 which satisfy every unit path of Jisuguimundo can be found in all components of these two derived partitions, that arrangement is just a solution of Jisuguimundo. The method suggested in this study is more developed one than the method which is applied to just one partition.

• Journal of the Chungcheong Mathematical Society
• /
• v.35 no.3
• /
• pp.205-225
• /
• 2022

In this paper, we derive analytical closed results for the first (a, b)-KA index, the Sombor index, the modified Sombor index, the first reduced (a, b)-KA index, the reduced Sombor index, the reduced modified Sombor index, the second reduced (a, b)-KA index and the mean Sombor index mSO_α for the OTIS biswapped networks by considering basis graphs as path, wheel graph, complete bipartite graph and r-regular graphs. Network theory plays a significant role in electronic and electrical engineering, such as signal processing, networking, communication theory, and so on. A topological index (TI) is a real number associated with graph networks that correlates chemical networks with a variety of physical and chemical properties as well as chemical reactivity. The Optical Transpose Interconnection System (OTIS) network has recently received increased interest due to its potential uses in parallel and distributed systems.