• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.37 no.1C
• /
• pp.89-96
• /
• 2012

Since tactical robots are going to be grown and tactical data communications will be more network-centric, the reliability of wireless tactical data networks is going to be very important in the future. However, the connectivity of such wireless tactical data networks can be extremely uncertain in practical circumstances. In this paper, we propose a searching technique to find out the weak boundary area of the network connectivity using a small UAV(unmanned aerial vehicle) which has a simple polling access function to wireless nodes on the ground in wireless tactical data networks. The UA V calculates the network topology of the wireless tactical data networks and coverts it to the Lapalcian matrix. In the proposed algorithm, we iteratively search the eigenvalues and find a minimum cut in the network resulting in finding the weak boundary of the connectivity for the wireless tactical data networks. If a UAV works as a relay nodes for the weak area, we evaluate that the throughput performance of the proposed algorithm outperforms star connection method and MST(minimum Spanning Tree) connection method. The proposed algorithm can be applied for recovering the connectivity of wireless tactical data networks.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.21 no.5
• /
• pp.921-928
• /
• 2017

Unlike wired networks, broadcasting in wireless networks can transmit data to several nodes at a time in a single transmission. The omnidirectional broadcasting of node in wireless networks simultaneously reaches all neighboring nodes. In this paper, we propose a greedy algorithm to solve the minimum power broadcasting problem that minimizes the total transmission power when broadcasting in wireless networks. The proposed algorithm uses a neighborhood list which is a set of nodes that can transmit messages within the maximum transmission range of each node, and among the transmitting nodes that have received the data, the node having the largest number of the neighboring nodes firstly transmits the data to neighboring node. The performance of the proposed algorithm was evaluated by computer simulation, and was compared with existing algorithms in terms of total transmission power and broadcasting frequency for broadcasting to all nodes. Experiment results show that the proposed algorithm outperforms the conventional algorithms.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.34 no.10B
• /
• pp.981-987
• /
• 2009

Recently, the study on wireless body area network for providing ubiquitous healthcare services has been actively done, including the standardization of the IEEE and others. Wireless body area network is usually configured in tree format using multi-hop communication mode due to the power limitation and the characteristics of human body. In this case, differently from existing sensor network, the wireless body area network tends to be disconnected due to the frequent movement of human body. The number of connections which can be supported at each node has some limitations due to the constraint imposed on power consumption. In this paper, we have proposed a heuristic algorithm for optimal selection of parent node with guaranteed QoS for a disconnected node, which considers the priority on packet transmission. Simulation has been performed to evaluate the performance of the proposed algorithm.

• Journal of information and communication convergence engineering
• /
• v.5 no.2
• /
• pp.140-143
• /
• 2007

Fingerprint Recognition System is made up of Off-line treatment and On-line treatment; the one is registering all the information of there trieving features which are retrieved in the digitalized fingerprint getting out of the analog fingerprint through the fingerprint acquisition device and the other is the treatment making the decision whether the users are approved to be accessed to the system or not with matching them with the fingerprint features which are retrieved and database from the input fingerprint when the users are approaching the system to use. In matching between On-line and Off-line treatment, the most important thing is which features we are going to use as the standard. Therefore, we have been using "Delta" and "Core" as this standard until now, but there might have been some deficits not to exist in every person when we set them up as the standards. In order to handle the users who do not have those features, we are still using the matching method which enables us to make up of the spanning tree or the triangulation with the relations of the spanned feature. However, there are some overheads of the time on these methods and it is not sure whether they make the correct matching or not. In this paper, introduces a new data structure, called Union and Division, representing binary fingerprint image. Minutiae detecting procedure using Union and Division takes, on the average, 32% of the consuming time taken by a minutiae detecting procedure without using Union and Division.

• Journal of Digital Convergence
• /
• v.12 no.1
• /
• pp.415-421
• /
• 2014

In this paper, we proposed problem and improvement of halftoning using random space filling curve. Random space filling curve is developed as a solution for shortcoming which space filling curve has self-similarity. It is used to reduce regular pattern can be occurred in constant brightness area in order that randomness apply to scanning path. But there is a problem that some area along scanning path can show too bright result in halftoning using random space filling curve. In this paper, we analyzed cause of problem and proposed single pixel error diffusion as a solution method. This method can avoid over-accumulated error and show better result in halftoning.

• Journal of information and communication convergence engineering
• /
• v.14 no.1
• /
• pp.57-63
• /
• 2016

In generally, the resolution of reconstructed three-dimensional images can be seriously degraded by undesired occlusions in the integral imaging system, because the undesired information of the occlusion overlap the three-dimensional images to be reconstructed. To solve the problem of the undesired occlusion, we present an exemplar-based image restoration method in integral imaging system. In the proposed method, a minimum spanning tree-based stereo matching method is used to remove the region of undesired occlusions in each elemental image. After that, the removed occlusion region of each elemental images are re-established by using the exemplar-based image restoration method. For further improve the performance of the image restoration, the structure tensor is used to solve the filling error cause by discontinuous structures. Finally, the resolution enhanced three-dimensional images are reconstructed by using the restored elemental images. The preliminary experiments are presented to demonstrate the feasibility of the proposed method.

• Animal cells and systems
• /
• v.13 no.3
• /
• pp.305-314
• /
• 2009

The control region of mitochondrial DNA (13516-14619) is located between srRNA and $tRNA^{lle}$ gene in swimming crab, Portunus trituberculatus. The present study was investigated the genetic polymorph isms of the control region in samples of P. trituberculatus collected at coastal waters of the Yellow Sea in Korea. A total of 300 substitution and indel polymorphic sites were identified. In addition to SNPs and indel variation, a hypervariable microsatellite motif was also identified at position from 14358 to 14391, which exhibited 10 alleles including 53 different suballeles. When the hypervariable microsatellite motif was removed from the alignment, 95 haplotypes were identified (93 unique haplotypes). The nucleotide and haplotype diversities were ranged from 0.024 to 0.028 and from 0.952 to 1.000, respectively. The statistically significant evidence for geographical structure was not detected from the analyses of neighbor-joining tree and minimum-spanning network, neither. This result suggest that population of P. trituberculatus are capable of extensive gene flow among populations. We believed that the polymorph isms of the control region will be used for informative markers to study phylogenetic relationships of P. trituberculatus.

• Journal of Korean Society of Disaster and Security
• /
• v.9 no.1
• /
• pp.19-24
• /
• 2016

In this study, we conducted a study on the development of Internet of Things-based disaster response system. We researched the method of building the network-based disaster prevention system using a client machine that the sensor network and the keeper. Also, we developed the algorithm for optimal evacuation shelter based on spanning tree algorithm. The system is tested actually in Seoul Gaepo station, and we verified the usability of the system.

• Journal of Biosystems Engineering
• /
• v.24 no.4
• /
• pp.301-308
• /
• 1999

Path planning for field operation of agricultural machinery is an indispensible part for precision farming or autonomous field operation. In this study, two algorithms (I, II) of generating a time-based shortest operation path were suggested to plan an optimal operation of an agricultural tractor-implement in a rectangular shaped field. The algorithms were based on modification of a minimum spanning tree algorithm, and applied for tractor-implement operations. the generated path was consisted of round operation and returning operation sections. The number of round operation was determined from the condition that a tractor can turn smoothly at headlands. The performance of the algorithms was evaluated by the calculation number for path generation and the total path length generated. Their stability was affected by the number of returning operation, but the algorithm II was considered to be more stable. In addition, the performances of the developed algorithms were compared with those of the conventional field operations at selected field sizes and shapes. The results showed that the algorithms could reduce field operation time greatly. For a 100m$\times$40m field, the reduced path length was 78m. The study also included an user interface program for implementing the algorithms and generating GPS coordinates that could be used in GIS softwares for precision farming.

• International Journal of Contents
• /
• v.3 no.2
• /
• pp.18-24
• /
• 2007

Biological sequences such as DNA and amino acid sequences typically contain a large number of items. They have contiguous sequences that ordinarily consist of more than hundreds of frequent items. In biological sequences analysis(BSA), a frequent contiguous sequence search is one of the most important operations. Many studies have been done for mining sequential patterns efficiently. Most of the existing methods for mining sequential patterns are based on the Apriori algorithm. In particular, the prefixSpan algorithm is one of the most efficient sequential pattern mining schemes based on the Apriori algorithm. However, since the algorithm expands the sequential patterns from frequent patterns with length-1, it is not suitable for biological datasets with long frequent contiguous sequences. In recent years, the MacosVSpan algorithm was proposed based on the idea of the prefixSpan algorithm to significantly reduce its recursive process. However, the algorithm is still inefficient for mining frequent contiguous sequences from long biological data sequences. In this paper, we propose an efficient method to mine maximal frequent contiguous sequences in large biological data sequences by constructing the spanning tree with a fixed length. To verify the superiority of the proposed method, we perform experiments in various environments. The experiments show that the proposed method is much more efficient than MacosVSpan in terms of retrieval performance.