• Proceedings of the IEEK Conference
• /
• 2005.11a
• /
• pp.159-162
• /
• 2005

Random Early Detection (RED), one of the most well-known Active Queue Management (AQM), has been designed to substitute Tail Drop and is nowadays widely implemented in commercially available routers. RED algorithm provides high throughput and low delay as well as a solution of global synchronization. However RED is sensitive to parameters setting, so the performance of RED, significantly depends on the fixed parameters. To solve this problem, the Adaptive RED (ARED) algorithm is suggested by S. Floyd. But, ARED also uses fixed parameters like target-queue length; it is hard to respond to bursty traffic actively. In this paper, we proposed AQM algorithm based on the variation of current queue length in order to improve adaptability about burst traffic. We measured performance of proposed algorithm through a throughput, marking-drop rate and bias phenomenon. In experimentation, we raised a packet throughput as reduced packet drop rate, and we confirmed to reduce a bias phenomenon about bursty traffic.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 2001.01a
• /
• pp.237-245
• /
• 2001

Automated essay grading has been proposed for over thirty years. Only recently have practical implementations been constructed and tested. This paper investigated the role of the nearest-neighbour algorithm within the information retrieval as a way of grading the essay automatically called Automated Essay Grading System. It intended to offer teachers an individualized assistance in grading the student\`s essay. The system involved several processes, which are the indexing, the structuring of the model answer and the grade processing. The indexing process comprised the document indexing and query processing which are mainly used for representing the documents and the query. Structuring the model answer is actually preparing the marking scheme and the grade processing is the process of assessing the essay. To test the effectiveness of the developed algorithms, the algorithms are tested against the History text in Malay. The result showed that th information retrieval and the nearest-neighbour algorithm are practical combination that offer acceptable performance for grading the essay.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.1-8
• /
• 2002

Digital image watermarking is a technique for the purpose of protecting the ownership of the image by embedding proprietary watermarks in a digital image. It is required for the digital image watermarking scheme to pursue the robustness against water marking attacks and the perceptual Invisibility more than usual in steganography area, to guarantee not a hidden watermarking algorithm but the publicity of water-marking algorithm details and hidden use of key, which can protect the unauthorized user access from detection. In this paper we propose a new copyright watermarking scheme, which is barred on one-way hash functions using ElGamal functions and modular operations. ElGamal functions are widely used in cryptographic systems. Our watermarking scheme is robust against LSB(least significant bit) attacks and gamma correction attack, and also perceptually invisible. We demonstrate the characteristics of our proposed watermarking scheme through experiments. It is necessary to proceed as the future work the algorithm of achieving at the same time both the pseudo-randomness for the steno-key generation and the asymmetric-key generation.

• The KIPS Transactions:PartC
• /
• v.9C no.1
• /
• pp.55-64
• /
• 2002

A number of MPLS ATM systems have been proposed to increase the access speed of current rooters, which only support the beat-effort service. However, the MPLS ATM systems have to support the so-called differential service, which discriminates the applications according to the servile clads because they do not be satisfied the Internet users who use diverse applications. In this paper, to support this differential service a detailed forwarding procedure based on a LSP control method and an application-based marking algorithm is suggested. The LSP control method establishes several different LSPs for each FEC according to the service class and the application-based marking algorithm chooses a proper differential service depending on the application category. Also, a design scheme of forwarding engine, which can be easily implemented with a minimum modification of existing MPLS ATM systems is proposed. And, the best simulation result of high priority application category is gained when the proposed forwarding algorithm is compared with existing algorithms.

• Proceedings of the KIEE Conference
• /
• 2006.11a
• /
• pp.167-169
• /
• 2006

Systematic studies on the dispatch scheduling algorithm and related constraints can enhance the effectiveness of electricity market operation. Moreover the introduction of competition in electricity market emphasizes various decision-marking matters connected to dispatch scheduling procedure. Because these affect the market participants' profit, the dispatch scheduling procedure should be reasonable. In this paper, we propose a constrained Pre-dispatch algorithm with considered security using sensitivity indices.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.3B
• /
• pp.557-564
• /
• 2000

This paper presents a watermarking algorithm for embedding visually recognizable pattern (Mark, Logo, Symbol, stamping or signature) into the image. first, the color image(RGB model)is transformed in YCbCr model and then the Y component is transformed into 3-level wavelet transform. Next, the values are assembled with pattern watermark. PN(pseudo noise) code at spread spectrum communication method and mutilevel watermark weights. This values are inserted into discrete wavelet domain. In our scheme, new calculating method is designed to calculate wavelet transform with integer value in considering the quantization error. and we used the color conversion with fixed-point arithmetic to be easy to make the hardware hereafter. Also, we made the new solution using mutilevel threshold to robust to common signal distortions and malicious attack, and to enhance quality of image in considering the human visual system. the experimental results showed that the proposed watermarking algorithm was superior to other similar water marking algorithm. We showed what it was robust to common signal processing and geometric transform such as brightness. contrast, filtering. scaling. JPEG lossy compression and geometric deformation.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.3C
• /
• pp.201-210
• /
• 2002

A number or MPLS ATM switching system have been proposed to increase the access speed or current routers, but they cannot satisfy the Internet users who use diverse applications. So they are required to support the so-called differential service, which discriminates service behaviors according to the service class. In this paper, to support this differential service we suggest an LSP control method, which uses the extended LDP message and establishes several different LSPs for each FEC according to the service class. Also, we propose an marking algorithm using the cell loss priority field or ATM cells in order to process the differential service according to application categories. In addition, we present a forwarding procedure based on the LSP control method and the marking algorithm. A forwarding model applied this forwarding procedure can be easily implemented with a minimum modification of existing MPLS ATM switching systems. Therefore, we can save cost and time needed to implement the proposed model. Finally, we estimate the performance behaviors of the proposed application-based forwarding model by the AweSim simulation package.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.12
• /
• pp.158-164
• /
• 2015

Lane detection is one of the key parts among autonomous vehicle technologies because lane keeping and path planning are based on lane detection. Camera is used for lane detection but there are severe limitations such as narrow field of view and effect of illumination. On the other hands, Lidar sensor has the merits of having large field of view and being little influenced by illumination because it uses intensity information. Existing researches that use methods such as Hough transform, histogram hardly handle multiple lanes in the co-occuring situation of lanes and road marking. In this paper, we propose a method based on RANSAC and regularization which provides a stable and precise detection result in the co-occuring situation of lanes and road marking in highway scenarios. This is performed by precise lane point extraction using circular model RANSAC and regularization aided least square fitting. Through quantitative evaluation, we verify that the proposed algorithm is capable of multi lane detection with high accuracy in real-time on our own acquired road data.

• The Transactions of the Korean Institute of Electrical Engineers P
• /
• v.52 no.1
• /
• pp.35-41
• /
• 2003

In this paper, a machine vision system for recognizing and classifying the patterns and marks engraved by die molding or laser marking on the glass panels of computer monitors is suggested and evaluated experimentally. The vision system is equipped with a neural network and an NGC pattern classifier including searching process based on normalized grayscale correlation and adaptive binarization. This system is found to be applicable even to the cases in which the segmentation of the pattern area from the background using ordinary blob coloring technique is quite difficult. The inspection process is accomplished by the use of the NGC hypothesis and ANN verification. The proposed pattern recognition system is composed of three parts: NGC matching process and the preprocessing unit for acquiring the best quality of binary image data, a neural network-based recognition algorithm, and the learning algorithm for the neural network. Another contribution of this paper is the method of generating the training patterns from only a few typical product samples in place of real images of all types of good products.

• Journal of Korea Society of Digital Industry and Information Management
• /
• v.6 no.2
• /
• pp.153-167
• /
• 2010

Traffic conditions, in particular number of active TCP flows, change dramatically over time. The main goal of this paper is an adaptive queue management algorithm that can maintain network state of high-throughput and low-delay under changing traffic conditions In this paper, we devise Probability Adaptive RED(PARED) that combines the more effective elements of recent algorithms with a RED core. It automatically adjusts its adaptive marking function to account for changes in traffic load and to keep queue length within the desired target queue length. We simulate that PARED algorithm results in under changes in traffic load and mixed traffic load. The simulation test confirm this stability, and indicate that overall performances of PARED are substantially better than the RED and ARED algorithms.