• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.8
• /
• pp.4021-4037
• /
• 2018

In network intrusion detection research, two characteristics are generally considered vital to building efficient intrusion detection systems (IDSs): an optimal feature selection technique and robust classification schemes. However, the emergence of sophisticated network attacks and the advent of big data concepts in intrusion detection domains require two more significant aspects to be addressed: employing an appropriate big data computing framework and utilizing a contemporary dataset to deal with ongoing advancements. As such, we present a comprehensive approach to building an efficient IDS with the aim of strengthening academic anomaly detection research in real-world operational environments. The proposed system has the following four characteristics: (i) it performs optimal feature selection using information gain and branch-and-bound algorithms; (ii) it employs machine learning techniques for classification, namely, Logistic Regression, Naïve Bayes, and Random Forest; (iii) it introduces bulk synchronous parallel processing to handle the computational requirements of large-scale networks; and (iv) it utilizes a real-time contemporary dataset generated by the Information Security Centre of Excellence at the University of Brunswick (ISCX-UNB) to validate its efficacy. Experimental analysis shows the effectiveness of the proposed framework, which is able to achieve high accuracy, low computational cost, and reduced false alarms.

• Korean Journal of Computational Design and Engineering
• /
• v.14 no.3
• /
• pp.186-196
• /
• 2009

Mass customization (MC) is a business practice that aims to provide customers with customized products and services at near mass production efficiency. To achieve the aim, a number of methods to implementing MC are proposed. However, most of them require changes in entire process of the company, which make companies hesitate to implement MC even if it is essential to survive. In this paper, we proposed alternatives to partially implement MC for quick adaptation of MC. The base line assumption is not to change the production lines. The pros and cons of alternatives are given by qualitative and quantitative evaluation. Especially, by giving radar chart analysis of the quantitative measures, we give insight on the changes in the business performance measures, such as time to market and cost. Proposed alternatives are based on sub-processes such as purchasing raw materials, production process changes and packaging for efficient logistics. In this way, companies are able to provide customized products with small changing of the current manufacturing system. The process and benefit of the proposed strategy is verified by real world cases of a Korean health food company.

• Journal of the Korean Society of Manufacturing Technology Engineers
• /
• v.23 no.4
• /
• pp.337-344
• /
• 2014

While implicit integration methods such as Newton's method have excellent stability for the analysis of stiff and constrained mechanical systems, they have the drawback that the evaluation and LU-factorization of the system Jacobian matrix required at every time step are time-consuming. This paper proposes a Jacobian update-free Newton's method in order to overcome these defects. Because the motions of all bodies in a vehicle model are limited with respect to the chassis body, the equations are formulated with respect to the moving chassis-body reference frame instead of the fixed inertial reference frame. This makes the system Jacobian remain nearly constant, and thus allows the Newton's method to be free from the Jacobian update. Consequently, the proposed method significantly decreases the computational cost of the vehicle dynamic simulation. This paper provides detailed generalized formulation procedures for the equations of motion, constraint equations, and generalized forces of the proposed method.

• Proceedings of the Korea Contents Association Conference
• /
• 2005.11a
• /
• pp.580-584
• /
• 2005

One of the problems of panoramic image stitching methods is that its computational cost is so high that the image processing required usually cannot be done in real-time. Real-time performance is important in applications such as video surveillance becausewe must see current scenes. But it takes more than several seconds to calculate transform coefficients between images. Panoramic VR technologies such as Apple QuickTime VR have problem that distorts images of top and bottom. This paper presents a fast stitching method and a methpd reducing distortions of top and bottom in cubic panoramic image.

• Journal of Korea Multimedia Society
• /
• v.17 no.9
• /
• pp.1104-1114
• /
• 2014

In large-scale crowd simulations, it is very important for the decision-making system of manipulating interactive behaviors to minimize the computational cost for controlling realistic behaviors such as collision avoidance. In this paper, we propose a large-scale realtime crowd simulation method using the affordance and navigation potential fields such as attractive and repulsive forces of electromagnetic fields. In particular, the model that we propose locally handles the realistic interactions between agents, and thus radically reduces the cost of expensive computation on interactions which has been the most problematic in crowd simulation. Our method is widely applicable to the expression and analysis of various crowd behaviors that are needed in behavior control in computer games, crowd scenes in movies, emergent behaviors of evacuation, etc.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.48 no.2
• /
• pp.96-101
• /
• 2011

Vanishing point can be defined as a point generated by converged perspective lines, which are parallel in the real world. In this paper, we propose a real-time vanishing point detection algorithm using this fundamental feature of vanishing point. The existing methods 1) require high computational cost or 2) are restricted to specific image contents. The proposed method detects the vanishing point in images based on the block-wise HOG (Histogram of Oriented Gradient) descriptor. First, we compute the HOG descriptor in a block-wise manner, then estimate the location of the vanishing point using the proposed dynamic programing. Experiments are performed on diverse images to confirm the efficiency of the proposed method.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 2003.05a
• /
• pp.262-269
• /
• 2003

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involved reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constructs. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model computational experiments using a commercial genetic algorithm based optimizer. The results show that the real size problems we encountered can be solved In reasonable time

• Journal of the Korea Society for Simulation
• /
• v.12 no.1
• /
• pp.59-71
• /
• 2003

Recently, a multi facility, multi product and multi period industrial problem has been widely investigated in Supply Chain Management (SCM). One of the key issues in the current SCM research area involves reducing both production and distribution costs. The purpose of this study is to determine the optimum quantity of production and transportation with minimum cost in the supply chain network. We have presented a mathematical model that deals with real world factors and constraints. Considering the complexity of solving such model, we have applied the genetic algorithm approach for solving this model using a commercial genetic algorithm based optimizer. The results for computational experiments show that the real size problems we encountered can be solved in reasonable time.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.9 no.6
• /
• pp.1195-1201
• /
• 2005

This paper deals with procedures and results for teal time implementation of G.729 speech coder and channel coder including convolution codec, viterbi decoder, and interleaver using a fixed point DSP chip for radio communication systems. We described the method for real-time implementation based on integer simulation results and explained the implemented results by quality performance and required complexity for real-time operation. The required complexity was 24MIPS and 9MIPS in computational load, and 12K words and 4K words in execution code length for speech and channel. The functional evaluation was performed into two steps. The one was bit exact comparison with a fixed point C code, the other was executed by actual speech samples and error test vectors. Unlik other results such as individual implementation, We implemented speech and channel coders on a DSP chip with 160MIPS computation capability and 64 K words memory on chip. This results outweigh the conventional methods in the point of system complexity and implementation cost for radio communication system.

• Journal of Sensor Science and Technology
• /
• v.32 no.2
• /
• pp.110-117
• /
• 2023

Reconstructing underwater geometry in real time with forward-looking sonar is critical for applications such as localization, mapping, and path planning. Geometrical data must be repeatedly calculated and overwritten in real time because the reliability of the acoustic data is affected by various factors. Moreover, scattering of signal data during the coordinate conversion process may lead to geometrical errors, which lowers the accuracy of the information obtained by the sensor system. In this study, we propose a three-step data processing method with low computational cost for real-time operation. First, the number of data points to be interpolated is determined with respect to the distance between each point and the size of the data grid in a Cartesian coordinate system. Then, the data are processed with a nonlinear interpolation so that they exhibit linear properties in the coordinate system. Finally, the data are transformed based on variations in the position and orientation of the sonar over time. The results of an evaluation of our proposed approach in a simulation show that the nonlinear interpolation operation constructed a continuous underwater geometry dataset with low geometrical error.