• The Korean Journal of Applied Statistics
• /
• v.25 no.3
• /
• pp.485-501
• /
• 2012

This research is to find a design D that minimizes forecast variance in d dimensions over the candidate space ${\chi}$. We want a robust design since we may not know the specific covariance structure. We seek a design that minimizes a coverage criterion and hope that this design will provide a small forecast variance even if the covariance structure is unobservable. The details of an exchange or swapping algorithm and several properties of the parameters of coverage criterion with the unknown correlation structures are discussed.

• Proceedings of the Korean Society of Precision Engineering Conference
• /
• 2005.06a
• /
• pp.1468-1471
• /
• 2005

This Paper is to find out a solution for the full-coverage algorithm requiring the real-time processing such as mobile home service robots and vacuum cleaner robots. Previous methods are used by adopting based grid approach method. They used lots of sensors, a high speed CPU, expensive ranger sensors and huge memory. Besides, most full-coverage algorithms should have a map before obstacle avoidance. However, if a robot able to recognize the tangent vector of obstacles, it is able to bring the same result with less sensors and simplified hardware. Therefore, this study suggests a topological based approach and a local obstacle voidance method using a few of PSD sensors and ultra sonic sensors. The simulation results are presented to prove its applicability.

• Journal of the Korea Society of Computer and Information
• /
• v.13 no.2
• /
• pp.243-250
• /
• 2008

The coverage algorithm based on Boustrophedon path has been known to be the most efficient in places without or less obstacles If the map of an environmental area thru SLAM algorithm can be obtainable. However, the efficiency of the coverage algorithm based on Boustrophedon path drops drastically when obstacles are complex. In this paper, we propose and implement a new algorithm, which we call Group-k, that efficiently handles the complex area. The Group-k algorithm groups the obstacles and prioritizes the covering sequences with complex rank of the groups. Implementation-based experiments show about 20% improved performance when applying the nor- algorithm, compared to the Boustrophedon path algorithm.

• Journal of Internet of Things and Convergence
• /
• v.9 no.1
• /
• pp.77-87
• /
• 2023

Applying various association rule mining algorithms to the network intrusion detection task involves two critical issues: too large size of generated rule set which is hard to be utilized for IoT systems and hardness of control of false negative/positive rates. In this research, we propose an association rule mining algorithm based on the newly defined measures called coverage and exclusion. Coverage shows how frequently a pattern is discovered among the transactions of a class and exclusion does how frequently a pattern is not discovered in the transactions of the other classes. We compare our algorithm experimentally with the Apriori algorithm which is the most famous algorithm using the public dataset called KDDcup99. Compared to Apriori, the proposed algorithm reduces the resulting rule set size by up to 93.2 percent while keeping accuracy completely. The proposed algorithm also controls perfectly the false negative/positive rates of the generated rules by parameters. Therefore, network analysts can effectively apply the proposed association rule mining to the network intrusion detection task by solving two issues.

• Journal of Sensor Science and Technology
• /
• v.22 no.4
• /
• pp.268-275
• /
• 2013

Efficient energy management becomes a critical design issue for complex WSN (Wireless Sensor Network). Most of complex WSN employ the sleep mode to reduce the energy dissipation. However, it should cause the reduction of sensing coverage. This paper presents new wake-up algorithm for reducing energy consumption in complex WSN. The proposed wake-up algorithm is devised using geometric probability. It determined which node will be waked-up among the nodes having overlapped sensing coverage. The only one sensor node will be waked-up and it is ready to sense the event occurred uniformly. The simulation results show that the lifetime is increased by 15% and the sensing coverage is increased by 20% compared to the other scheduling methods. Consequently, the proposed wake-up algorithm can eliminate the power dissipation in the overlapped sensing coverage. Thus, it can be applicable for the various WSN suffering from the limited power supply.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.5
• /
• pp.1084-1090
• /
• 2015

In this paper, we propose a Tabu search algorithm to efficiently deploy the sensor nodes for maximizing the network sensing coverage in wireless sensor networks. As the number of the sensor nodes in wireless sensor networks increases, the amount of calculation for searching the solution would be too much increased. To obtain the best solution within a reasonable execution time in a high-density network, we propose a Tabu search algorithm to maximize the network sensing coverage. In order to search effectively, we propose some efficient neighborhood generating operations of the Tabu search algorithm. We evaluate those performances through some experiments in terms of the maximum network sensing coverage and the execution time of the proposed algorithm. The comparison results show that the proposed algorithm outperforms other existing algorithms.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.116-119
• /
• 2015

In this paper we propose an algorithm for environment monitoring using multiple mobile sensor (MS) nodes. Our focus is on maximizing sensing coverage of a group of MS nodes for monitoring a phenomenon in an unknown and open area over time. In the proposed algorithm, MS nodes are iteratively relocated to new positions at which a higher sensing coverage can be obtained. We formulated an integer linear programming (ILP) optimization problem to find the optimal positions for MS nodes with the objective of coverage maximization. The performance evaluation was performed to confirm that the proposed algorithm can enable MS nodes to relocate to high interest positions, and obtain a maximum sensing coverage.

• Journal of the Institute of Electronics Engineers of Korea CI
• /
• v.40 no.3
• /
• pp.137-143
• /
• 2003

Key frame extraction has been recognized as one of tile important research issues in video information retrieval. Although progress has been made in key frame extraction, the existing approaches do not evaluate the importance of extracted frame Quantitatively, and Dey are computationally expensive or ineffective. In this Paper, we introduce a new 미해rithm for key frame extraction using shot coverage and distortion. The algorithm finds significant key frames from candidate key frames. When selecting the candidate frames, the coverage rate to the total frames from each frame is computed by using the difference between the adjacent frames in tile shot. The frames within 10$\%$ from the top are selected as the candidates. Then, by comfuting the distortion rate of the candidates against all frames, pick the frames which arc most representative are selected. The performance of the proposed algorithm has been verified by a statistical test. Experiments show that more than 13-50$\%$ improvement has been obtained by the proposed algorithm compared to the existing methods.

• Korean Management Science Review
• /
• v.16 no.1
• /
• pp.89-99
• /
• 1999

Combat fatigues are issued to military personnel with ready made clothes. Ready made combat fatigues should be fitted to various bodies of military personnel within given standard size. This paper develops a standard sizes selection method in order to increase the coverage rate and fitness for combat fatigues. The method utilizes a generalized learning vector quantization(GLVQ) algorithm that is one of cluster algorithm in neural networks techniques. The GLVQ moves the standard sizes from initial arbitrary sizes to next sizes in order to increase more coverage rate and fitness. Finally, when it cannot increase those, algorithm is terminated. The results of this method show more coverage rate and fitness than those of the other methods.

• Management Science and Financial Engineering
• /
• v.17 no.2
• /
• pp.39-62
• /
• 2011

In wireless sensor network, since each sensor is equipped with a limited power, efficient use of the energy is important. One possible network management scheme is to cluster the sensors into several sets, so that the sensors in each of the sets can completely perform the monitoring task. Then the sensors in one set become active to perform the monitoring task and the rest of the sensors switch to a sleep state to save energy. Therefore, we rotate the roles of the active set among the sensors to maximize the network lifetime. In this paper, we suggest an optimal algorithm for the maximum lifetime coverage problem which maximizes the network lifetime. For comparison, we implemented both the heuristic proposed earlier and our algorithm, and executed computational experiments. Our algorithm outperformed the heuristic concerning the obtained network lifetimes, and it found the solutions in a reasonable amount of time.