Sung-Sam Hong

The study of selective encryption of motion vector based on the S-Box for the security improvement in the process of video

The Selective Encryption method encrypts the important and requisite parts of data. Since the method does not encrypt the whole of data, the amount of computation is small,which makes it faster and the resources can be used efficiently. The existing selective algorithms have vulnerabilities to the plain text attack and the image restoration attack using the motion vector. They are also vulnerable to the attack in storing and transmitting of the random table data using in encrypt and scramble. In this paper, we propose the selective encryption algorithm of motion vector based on S-Box to remove the vulnerabilities of the existing selective algorithms. The motion vectors generated by the end of motion estimation function of video encoding/decoding xored with S-Box table, are replaced to certain location by using mapping table. The S-Box and mapping table are generated by the secret key through the Rivest Cipher 4 (RC4) encryption algorithm. The proposed algorithm enhances the resistance against attacks through the reinforcement of video security, and thus, reduces the vulnerabilities of the existing algorithms such as I-Frame selective encryption and MVEA. Even though the level of security of the proposed algorithm is higher than the bit scrambling algorithms, it has much better security and higher processing rate than others selective algorithms.

The Efficient Method of Parallel Genetic Algorithm using MapReduce of Big Data

Big Data is data of big size which is not processed, collected, stored, searched, analyzed by the existing database management system. The parallel genetic algorithm using the Hadoop for BigData technology is easily realized by implementing GA(Genetic Algorithm) using MapReduce in the Hadoop Distribution System. The previous study that the genetic algorithm using MapReduce is proposed suitable transforming for the GA by MapReduce. However, they did not show good performance because of frequently occurring data input and output. In this paper, we proposed the MRPGA(MapReduce Parallel Genetic Algorithm) using improvement Map and Reduce process and the parallel processing characteristic of MapReduce. The optimal solution can be found by using the topology, migration of parallel genetic algorithm and local search algorithm. The convergence speed of the proposal method is 1.5 times faster than that of the existing MapReduce SGA, and is the optimal solution can be found quickly by the number of sub-generation iteration. In addition, the MRPGA is able to improve the processing and analysis performance of Big Data technology.

The Adaptive SPAM Mail Detection System using Clustering based on Text Mining

Spam mail is one of the most general mail dysfunctions, which may cause psychological damage to internet users. As internet usage increases, the amount of spam mail has also gradually increased. Indiscriminate sending, in particular, occurs when spam mail is sent using smart phones or tablets connected to wireless networks. Spam mail consists of approximately 68% of mail traffic; however, it is believed that the true percentage of spam mail is at a much more severe level. In order to analyze and detect spammail, we introduce a technique based on spam mail characteristics and text mining; in particular, spam mail is detected by extracting the linguistic analysis and language processing. Existing spam mail is analyzed, and hidden spam signatures are extracted using text clustering. Our proposed method utilizes a text mining system to improve the detection and error detection rates for existing spam mail and to respond to new spam mail types.

Improved WTA problem solving method using a parallel genetic algorithm which applied the RMI initialization method

The problem of Weapon Target Allocation (WTA) is to find an optimum solution, the type of vector that our weapons assign to targets, to minimize the damage of our assets from the target of an enemy offending us. we proposed the novel parallel genetic algorithm for solved to the WTA problem. The proposed. As the first step, our proposed algorithm is to expand the problem search space through the Random Mutation Inherit (RMI) population initialization method thereby improving convergence performance. We proposed an algorithm which obtains the WTA solution quickly and solves the WTA problem efficiently.

A Study of population Initialization Method to improve a Genetic Algorithm on the Weapon Target Allocation problem

The Weapon Target Allocation(WTA) problem is the NP-Complete problem. The WTA problem is that the threatful air targets are assigned by weapon of allies for killing the targets. A good solution of NP-complete problem is heuristic algorithms. Genetic algorithms are commonly used heuristic for global optimization, and it is good solution on the diverse problem domain. But there has been very little research done on the generation of their initial population. The initialization of population is one of the GA step, and it decide to initial value of individuals. In this paper, we propose to the population initialization method to improve a Genetic Algorithm. When it initializes population, the proposed algorithm reflects the characteristics of the WTA problem domain, and inherits the dominant gene. In addition, the search space widely spread in the problem space to find efficiently the good quality solution. In this paper, the proposed algorithm to verify performance examine that an analysis of various properties and the experimental results by analyzing the performance compare to other algorithms. The proposed algorithm compared to the other initialization methods and a general genetic algorithm. As a result, the proposed algorithm showed better performance in WTA problem than the other algorithms. In particular, the proposed algorithm is a good way to apply to the variety of situation WTA problem domain, because the proposed algorithm can be applied flexibly to WTA problem by the adjustment of RMI.

A dynamic neuro fuzzy knowledge based system in threat evaluation

With development of information technology, information system has been advanced in a battlefield situation, and it becomes key factors to obtain information about the enemy aircraft and analyze the situation in battlefield. Threat evaluation which is the key factor of analysis of a battlefield situation is a technology that evaluates threat values on the situation in accordance with air intelligence gotten through radar and provides information about weapon assignment. This stage requires the most accurate information than other stage in a battlefield situation. Most of data of threat evaluation is calculated by sensed sensor values and transmitted, but presentation of incorrect links of sensor data or data omission that could happen on the existing technique could cause confusion over decision making in a battlefield situation. Thus, the links must be defined accurately through knowledge of experts on various sensor data domain, and reliable threat consequences must be provided through adaptation and learning about unpredictable battlefields due to data omission. On this paper, a fusion system, a dynamic neuro fuzzy knowledge based inference system, which is favorable to adaptation and learning and presentation of expertise, is suggested and applied to threat evaluation.