• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.14 no.2
• /
• pp.702-723
• /
• 2020

The application of machine learning (ML) in intrusion detection has attracted much attention with the rapid growth of information security threat. As an efficient multi-label classifier, kernel extreme learning machine (KELM) has been gradually used in intrusion detection system. However, the performance of KELM heavily relies on the kernel selection. In this paper, a novel multiple kernel extreme learning machine (MKELM) model combining the ReliefF with nature-inspired methods is proposed for intrusion detection. The MKELM is designed to estimate whether the attack is carried out and the ReliefF is used as a preprocessor of MKELM to select appropriate features. In addition, the nature-inspired methods whose fitness functions are defined based on the kernel alignment are employed to build the optimal composite kernel in the MKELM. The KDD99, NSL and Kyoto datasets are used to evaluate the performance of the model. The experimental results indicate that the optimal composite kernel function can be determined by using any heuristic optimization method, including PSO, GA, GWO, BA and DE. Since the filter-based feature selection method is combined with the multiple kernel learning approach independent of the classifier, the proposed model can have a good performance while saving a lot of training time.

• The Journal of the Korea institute of electronic communication sciences
• /
• v.9 no.10
• /
• pp.1095-1102
• /
• 2014

In this paper, We proposed the approach of GPU and motion vector to analysis the Human activity in real-time surveillance system. The most important part, that is detect blob(human) in the foreground. We use to detect Adaptive Gaussian Mixture, Weighted subtraction image for salient motion and motion vector. And then, We use motion vector for human activity analysis. In this paper, the activities of human recognize and classified such as meta-classes like this {Active, Inactive}, {Position Moving, Fixed Moving}, {Walking, Running}. We created approximately 300 conditions for the simulation. As a result, We showed a high success rate about 86~98%. The results also showed that the high resolution experiment by the proposed GPU-based method was over 10 times faster than the cpu-based method.

• Journal of Advanced Marine Engineering and Technology
• /
• v.35 no.3
• /
• pp.341-347
• /
• 2011

The redundancy allocation problem (RAP) is a famous NP.complete problem that has beenstudied in the system reliability area of ships and airplanes. Recently meta-heuristic techniques have been applied in this topic, for example, genetic algorithms, simulated annealing and tabu search. In particular, tabu search (TS) has emerged as an efficient algorithmic approach for the series-parallel RAP. However, the quality of solutions found by TS depends on the initial solution. As a robust and efficient methodology for the series-parallel RAP, the hybrid metaheuristic (TSA) that is a interactive procedure between the TS and SA (simulated annealing) is developed in this paper. In the proposed algorithm, SA is used to find the diversified promising solutions so that TS can re-intensify search for the solutions obtained by the SA. We test the proposed TSA by the existing problems and compare it with the SA and TS algorithm. Computational results show that the TSA algorithm finds the global optimal solutions for all cases and outperforms the existing TS and SA in cases of 42 and 56 subsystems.

• Korean Institute of Interior Design Journal
• /
• v.20 no.1
• /
• pp.14-23
• /
• 2011

The purpose of this study is to analyse the inclinations and expressions in contemporary architecture. Specially, we call this tendency and architectural movements as architectural metamorphosis. Metamorphosis in architecture present the core of the change of Forms and spirits in a change of outward shape and terrestrial identity. As in Ovid's extended dramatic poem of change and transformation, Metamorphoses, all Souls are deathless, and migrates from one form to another. Like these stories in Metamorphoses, Ovid tells the soul never dies, but leaps one form to anther, and can take any shape. So the architectural form, transformation and deformation in contemporary architecture means architectural sensations and cognitions can even approach the soul of form and shape under the transformation. The expressions and design strategies of metamorphosis in comtemporary architecture reveal continuous and sequential formations of space, linear structure with force and vector, rhythmical wavement and folding surface, lively wiggly flows of volumns and objects, and so on. Such qualities came from the periodical needs; separation of structure and surface, poly-surfacial movement, poly-sensual expression and experience, dematerialization and the dematerialized space, formless of non-formal architecture, digital architecture. Architecture of Metamorphosis is the ways and the needs of our period to overcome the static limits prohibits the liberal thoughts, to find the ways toward the opportunities and diversities and to unlock the imaginaire of the contemporary architecture.

• Journal of KIISE
• /
• v.42 no.6
• /
• pp.755-763
• /
• 2015

As fixing bugs is a large part of software development and maintenance, estimating the time to fix bugs -bug fixing time- is extremely useful when planning software projects. Therefore, in this study, we propose a way to estimate bug fixing time using bug reports. First, we classify previous bug reports with meta fields by applying a k-NN method. Next, we compute the similarity of the new bug and previous bugs by using data from bug reports. Finally, we estimate how long it will take to fix the new bug using the time it took to repair similar bugs. In this study, we perform experiments with open source software. The results of these experiments show that our approach effectively estimates the bug fixing time.

• The Journal of the Korea Contents Association
• /
• v.10 no.9
• /
• pp.107-116
• /
• 2010

The facility location problem is one of the traditional optimization problems. In this paper, we deal with the single source capacitated facility location problem (SSCFLP) and it is known as an NP-hard problem. Thus, it seems to be natural to use a heuristic approach such as evolutionary algorithms for solving the SSCFLP. This paper introduces a new efficient evolutionary algorithm for the SSCFLP. The proposed algorithm is devised by incorporating a general adaptive link adjustment evolutionary algorithm and three heuristic local search methods. Finally we compare the proposed algorithm with the previous algorithms and show the proposed algorithm finds optimum solutions at almost all middle size test instances and very stable solutions at larger size test instances.

• Korean Management Science Review
• /
• v.28 no.1
• /
• pp.1-10
• /
• 2011

One of the fundamental roles of web object navigation is to support what the user wants precisely and efficiently from the enormous web database to the web browser. As long as the web search results are a set of individual lists, it is all right to display each and every web result for the web browser to display a web object one by one. However, in case the search results are a collection of multiple interrelated web objects, then there is a need to represent for a new mechanism for linked web objects at a time. We define a unit of web objects derived from a Steiner tree where the web objects include a set of specific keywords calculated by the weight from which the solutions are extracted. Even if a web object does not include all the keywords, then the related hypertext linked web objects are derived and displayed onto the mobile web browser with meta data in one shot. In this paper, it is applied for the mobile browser that the web contents can dynamically be displayed with Steiner trees until each renewal of the navigation request may be issued. In this paper, a new synchronized mobile browsing method is developed so that the navigating time can drastically be reduced and the web navigating efficiency can be dramatically enhanced without sacrificing memory consumption.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.1
• /
• pp.52-59
• /
• 2008

This paper describes the secant method for solving the economic dispatch (ED) problem with generator constraints and transmission losses. The ED problem is an important optimization problem in the economic operation of a power system. The proposed algorithm involves selection of minimum and maximum incremental costs (lambda values) and then the evaluation of optimal lambda at required power demand is done by secant method. The proposed algorithm has been tested on a power system having 6, 15, and 40 generating units. Studies have been made on the proposed method to solve the ED problem by taking 120 and 200 units with generator constraints. Simulation results of the proposed approach were compared in terms of solution quality, convergence characteristics, and computation efficiency with conventional methods such as lambda iterative method, heuristic methods such as genetic algorithm, and meta-heuristic methods like particle swarm optimization. It is observed from different case studies that the proposed method provides qualitative solutions with less computational time compared to various methods available in the literature.

• The Journal of the Korea Contents Association
• /
• v.5 no.3
• /
• pp.193-199
• /
• 2005

One of the important fields for heuristics algorithm is how to balance between Intensificationand Diversification. Ant Colony System(ACS) is a new meta heuristics algorithm to solve hard combinatorial optimization problem. It is a population based approach that uses exploitation of positive feedback as well as greedy search. It was first proposed for tackling the well known Traveling Salesman Problem(TSP). In this paper, we propose Multi Colony Interaction Ant Model that achieves positive negative interaction through elite strategy divided by intensification strategy and diversification strategy to improve the performance of original ACS. And, we apply multi colony interaction ant model by this proposed elite strategy to TSP and compares with original ACS method for the performance.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.17 no.6
• /
• pp.1354-1359
• /
• 2013

With the development of multimedia and network technology, the production of multimedia contents is rapidly increasing. Meanwhile, the technology to search and use the contents is still insufficient. There are standards for multimedia contents to address the problem, but they cannot fully support diverse multimedia data types or ensure their interoperability. In this paper, an ontology-based content search system is proposed to ensure the interoperability of multimedia contents. The ontology is configured by presenting the rules for it using the schema structure of the multimedia description scheme (MDS) of MPEG-7. Based on this ontology, This paper extend multimedia relationship based on ontology, thus established the semantic retrieval system.