• Journal of information and communication convergence engineering
• /
• v.8 no.6
• /
• pp.721-724
• /
• 2010

In a network router, packet loss may occur when it overflows due to sudden burst traffic. This paper studies how much large buffers are required to eliminate the packet losses. There are buffers on which packet arrive and one output port to which a packet is transmitted at a time. The buffer management algorithm should determine one of the buffers whose packet is transmitted to the output port at each time. The front packet belonging to the buffer determined by the algorithm is transmitted. The goal is to minimize the sum of the lengths of buffers to transmit all the packets. We provide an optimal off-line algorithm and also we show the lower bounds of on-line algorithms. The on-line algorithm has no prior information of the packets having arrived in the future. Its performance is compared to that of the optimal off-line algorithm.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.19 no.12
• /
• pp.2981-2986
• /
• 2015

In this paper, there are m servers to carry out broadcasts and the scheduling problem to serve the requests with deadlines is studied. If a server broadcasts a page, then all the requests which require the page are satisfied. A scheduling algorithm shall determine which pages are broadcasted on servers at a time. Its goal is to maximize the sum of weights of requests satisfied within their deadlines. The performance of an on-line algorithm is compared with that of the optimal off-line algorithm which can see all the inputs in advance. In general, the off-line algorithms outperform the on-line algorithms. So we will use the resource augmentation analysis in which the on-line algorithms can utilize more resources. We consider the case that the on-line algorithms can use more servers in this paper.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1741-1751
• /
• 2007

The imprecise computation technique ensures that all time-critical tasks produce their results before their deadlines by trading off the quality of the results for the computation time requirements of the tasks. In the imprecise computation, most scheduling problems of satisfying both 0/1 constraints and timing constraints, while the total error is minimized, are NP-complete when the optional tasks have arbitrary processing times. In the previous studies, the reasonable strategies of scheduling tasks with the 0/1 constraints on uniprocessors and multiprocessors for minimizing the total error are proposed. But, these algorithms are all off-line algorithms. Then, in the on-line scheduling, NORA(No Off-line tasks and on-line tasks Ready upon Arrival) algorithm can find a schedule with the minimum total error. In NORA algorithm, EDF(Earliest Deadline First) strategy is adopted in the scheduling of optional tasks. On the other hand, for the task system with 0/1 constraints, NORA algorithm may not suitable any more for minimizing total error of the imprecise tasks. Therefore, in this paper, an on-line algorithm is proposed to minimize total error for the imprecise real-time task system with 0/1 constraints. This algorithm is suitable for the imprecise on-line system with 0/1 constraints. Next, to evaluate performance of this algorithm, a series of experiments are done. As a consequence of the performance comparison, it has been concluded that IOSMTE(Imprecise On-line Scheduling to Minimize Total Error) algorithm proposed in this paper outperforms LOF(Longest Optional First) strategy and SOF(Shortest Optional First) strategy for the most cases.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.3 no.1
• /
• pp.105-111
• /
• 1999

This Paper is about how to deside the best parameter of PID controller, using Genetic Algorithms and Neural Networks. Control by Genetic Algorithms, which is off-line pass, has weakness for disturbance. So we want to improve like followings by adding Neural Network to controller and putting it on line. First we find PID parameter by Genetic Algorithms in forward pass of Neural Network and set the best output condition according to the increasing number of generation. Second, we explain the adaptability for disturbance with simulation by correcting parameter by backpropagation learning rule by using the learning ability of Neural Network.

• Journal of Mechanical Science and Technology
• /
• v.14 no.6
• /
• pp.645-654
• /
• 2000

In this paper, low level control algorithms of a metal belt CVT are suggested. A feedforward PID control algorithm is adopted for line pressure based on a steady state relationship between the input duty and the line pressure. Experimental results show that feedforward PID control of the line pressure guarantees a fast response while reducing the pressure undershoot which may result in belt slip. For ratio control, a fuzzy logic is suggested by considering the CVT shift dynamics and on-off characteristics of the ratio control valve. It is found from experimental results that a desired speed ratio can be achieved at steady state in spite of the fluctuating primary pressure. It is expected that the low level control algorithms for the line pressure and speed ratio suggested in this study can be implemented in a prototype CVT.

• 제어로봇시스템학회:학술대회논문집
• /
• 1996.10b
• /
• pp.40-43
• /
• 1996

An off-line programming, OLP, system is widely used in automation fines. To help an on-line robot system to carry out desirable tasks planned by the off-line simulation, an approach to the real-time communication is presented. The OLP system developed consists of a software, a host computer(PC), a SCARA robot body, four servo drivers, and four independent joint controllers. This study focuses on the software where real-time communication is included. The software, can be used in teaching, trajectory planning, real-time running, and performance evaluation. The evaluation of different control algorithms is one of the merits of the software. The software can give servo commands for task running. A comparison of generated and corresponding actual trajectories provides the evaluation of task performance. The safety, of the OLP system is ensured by alarming malfuntions of the system. The OLP system developed can reduce the teaching time and increase the user's convenience.

• Proceedings of the Korean Society of Machine Tool Engineers Conference
• /
• 1999.10a
• /
• pp.432-439
• /
• 1999

In this paper, an off-line programming(OLP) system is presented as the three dimensional graphic simulator and one of the human-robot interface systems for industrial robots. The OLP system has been especially developed to testify robot programs visually using three dimensional geometric modeling and graphics technologies in personal computes. A special feature is its capability of collision detection and of comparing performance of control algorithms. This paper places the focus on the structure and major characteristic of OLP system.

• Journal of Korea Society of Industrial Information Systems
• /
• v.7 no.4
• /
• pp.29-36
• /
• 2002

In this paper, a new edge detection method for area images is presented based on the scan-line image segmentation technology. The existing algorithms are lack of precision in its detections due to the noise factors such as depth perception and illumination problems when processing the 3D image into a 2D image. The general process of applying the scan-line method is to extract straight line components to determine the shape of the objects. However, we implement this method to an arc curve for precise detections. the paper proved precise detections that from off line to on line.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.25 no.5A
• /
• pp.717-725
• /
• 2000

Within the last several years, there has been a large number of algorithms developed for face recognition. The majority of these algorithms have been view- and projection-based algorithms. Our definition of projection is not restricted to projecting the image onto an orthogonal basis the definition is expansive and includes a general class of linear transformation of the image pixel values. The class includes correlation, principal component analysis, clustering, gray scale projection, and matching pursuit filters. In this paper, we perform a detailed analysis of this class of algorithms by evaluating them on the FERET database of facial images. In our experiments, a projection-based algorithms consists of three steps. The first step is done off-line and determines the new basis for the images. The bases is either set by the algorithm designer or is learned from a training set. The last two steps are on-line and perform the recognition. The second step projects an image onto the new basis and the third step recognizes a face in an with a nearest neighbor classifier. The classification is performed in the projection space. Most evaluation methods report algorithm performance on a single gallery. This does not fully capture algorithm performance. In our study, we construct set of independent galleries. This allows us to see how individual algorithm performance varies over different galleries. In addition, we report on the relative performance of the algorithms over the different galleries.

• Journal of Korea Water Resources Association
• /
• v.41 no.12
• /
• pp.1211-1218
• /
• 2008

This study is for design of the detention system distributed in a watershed by the Multi-Objective Genetic Algorithms(MOGAs). A new model is developed to determine optimal size and location of detention. The developed model has two primary interfaced components such as a rainfall runoff model to simulate water surface elevation(or flowrate) and MOGAs to get the optimal solution. The objective functions used in this model depend on the peak flow and storage of detention. With various constraints such as structural limitations, capacities of storage and operational targets. The developed model is applied at Gwanyang basin within Anyang watershed. The simulation results show the maximum outlet reduction is occurred at detention facilities located in upper reach of watershed in the peak discharge rates. It is also reviewed the simultaneous construction of an off-line detention and an on-line detention. The methodologies obtained from this study will be used to control the flood discharges and to reduce flood damage in urbanized watershed.