• IE interfaces
• /
• v.14 no.4
• /
• pp.385-393
• /
• 2001

In this paper, a scheme of scheduling a bottleneck operation is presented for production planning of make-to-order. We focus on the problem of capacity-dependent processing time in which processing time of the bottleneck operation is not fixed, but varies with job sequence or equipment capacity. For this, a genetic algorithm is applied for job sequencing with an objective function of mean square of weighted deviation. An experimental study is implemented in power transformer plant and results are compared with those of the EDD rule. It shows that the genetic algorithm is relatively good for most cases.

• Journal of the Institute of Electronics Engineers of Korea SP
• /
• v.39 no.2
• /
• pp.39-49
• /
• 2002

This paper proposes the MAWUPC (Motion Adaptive Weighted Unmatched Pixel Count) algorithm to track multiple objects of similar color The MAWUPC algorithm has the new method that combines color and motion effectively. We apply the MAWUPC algorithm to face and hand tracking against complex background in an image sequence captured by using single camera. The MAWUPC algorithm is an improvement of previously proposed AWUPC (Adaptive weighted Unmatched Pixel Count) algorithm based on the concept of the Moving Color that combines effectively color and motion information. The proposed algorithm incorporates a color transform for enhancing a specific color, the UPC(Unmatched Pixel Count) operation for detecting motion, and the discrete Kalman filter for reflecting motion. The proposed algorithm has advantages in reducing the bad effect of occlusion among target objects and, at the same time, in rejecting static background objects that have a similar color to tracking objects's color. This paper shows the efficiency of the proposed MAWUPC algorithm by face and hands tracking experiments for several image sequences that have complex backgrounds, face-hand occlusion, and hands crossing.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.7 no.11
• /
• pp.2720-2736
• /
• 2013

Multi-view face detection has become an active area for research in the last few years. In this paper, a novel multi-view human face detection algorithm based on improved real Adaboost is presented. Real Adaboost algorithm is improved by weighted combination of weak classifiers and the approximately best combination coefficients are obtained. After that, we proved that the function of sample weight adjusting method and weak classifier training method is to guarantee the independence of weak classifiers. A coarse-to-fine hierarchical face detector combining the high efficiency of Haar feature with pose estimation phase based on our real Adaboost algorithm is proposed. This algorithm reduces training time cost greatly compared with classical real Adaboost algorithm. In addition, it speeds up strong classifier converging and reduces the number of weak classifiers. For frontal face detection, the experiments on MIT+CMU frontal face test set result a 96.4% correct rate with 528 false alarms; for multi-view face in real time test set result a 94.7 % correct rate. The experimental results verified the effectiveness of the proposed approach.

• 제어로봇시스템학회:학술대회논문집
• /
• 1993.10a
• /
• pp.233-238
• /
• 1993

In this paper, two diagnosis algorithms using the simple fuzzy, cognitive map (FCM) that is an useful qualitative model are proposed. The first basic algorithm is considered as a simple transition of Shiozaki's signed directed graph approach to FCM framework. And the second one is an extended version of the basic algorithm. In the extension, three important concepts, modified temporal associative memory (TAM) recall, temporal pattern matching algorithm and hierarchical decomposition are adopted. As the resultant diagnosis scheme takes short computation time, it can be used for on-line fault diagnosis of large scale and complex processes that conventional diagnosis methods cannot be applied. The diagnosis system can be trained by the basic algorithm and generates FCM model for every experienced process fault. In on-line application, the self-generated fault model FCM generates predicted pattern sequences, which are compared with observed pattern sequences to declare the origin of fault. In practical case, observed pattern sequences depend on transport time. So if predicted pattern sequences are different from observed ones, the time weighted FCM with transport delay can be used to generate predicted ones. The fault diagnosis procedure can be completed during the actual propagation since pattern sequences of tvo different faults do not coincide in general.

• IE interfaces
• /
• v.17 no.spc
• /
• pp.111-121
• /
• 2004

In this paper, we propose an urgency and efficiency based wireless packet scheduling (UEPS) algorithm that is able to schedule real time (RT) and non-real time (NRT) traffics at the same time. The proposed UEPS algorithm is designed to support wireless downlink packet scheduling in the OFDMA system which is a strong candidate wireless system for the next generation mobile communications. The UEPS algorithm uses the time-utility function as a scheduling urgency factor and the relative status of the current channel to the average one as an efficiency indicator of radio resource usage. The design goal of the UEPS algorithm is to maximize throughput of NRT traffics with satisfying QoS requirements of RT traffics. The simulation study shows that the proposed UEPS algorithm is able to give better throughput performance than existing wireless packet scheduling algorithms such as proportional fair (PF) and modified-largest weighted delay first (M-LWDF) while satisfying QoS requirements of RT traffics such as the average delay and the packet loss rate under various traffic loads.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.12 no.1
• /
• pp.43-50
• /
• 2013

This paper aims to determine the optimal location of expressway patrol vehicle stations that minimizes additional troubles caused by the delay of crash treatments. To do this, we formulate a maximum covering problem and a p-center problem weighted by crash frequency, using the shortest distance as the criteria for allocating service district, and we employ the Lagrangian relaxation algorithm to solve the former and Daskin's heuristic algorithm to solve the latter, respectively. Based on crash data of Korean expressways, the results from the proposed models are compared with the current location of patrol vehicle stations by using several indices as the level of service for crash treatment, such as maximum crash-weighted distance, average crash-weighted distance, and average access distance. The results show that the proposed models improve average access distance and time by about 10km and 10min, respectively. When allocation for service district is changed only with the fixed current location, the level of service can be also improved. The models and results proposed in this paper can contribute to improving the level of service for crash treatment on expressways. They can also provide the theoretical basis on the location decision for other various emergency facilities, and the allocation decision for floating service districts according to time-period crash data.

• Journal of KIBIM
• /
• v.13 no.2
• /
• pp.1-15
• /
• 2023

Since the 1960s, the Korean Peninsula, which consists of 77.4 of the country's land and mountains, has seen a surge in demand for buildings due to population concentration due to urbanization and industrialization. Since then, the development of slopes has been inevitable due to the concentration and expansion of the city's population. When building a building on a slope, it is important to set the height of the surface. In this case, the means of regulating buildings in construction-related laws, such as the building closure ratio, floor area ratio, number of floors and total floor area of buildings, have an overall effect on buildings through the height of the surface. In the Korean Building Act, the setting of the height of the ground affects the calculation of the building height limit standard and the calculation of the underground floor, and it takes a long time to calculate. Therefore, the time required for attempts to change various design plans of buildings increases. The purpose of this study is to speed up the time required to calculate the weighted average of the surface when constructing buildings on slopes. In addition, the existing calculation process allows various design attempts compared to the same time given.

• Journal of the Korean Institute of Telematics and Electronics A
• /
• v.31A no.1
• /
• pp.84-92
• /
• 1994

In this paper, we present a novel scheduling algorithm using the weighted interval graph. An interval graph is constructed, where an interval is a time frame of each operation. And for each operation type, we look for the maximum clique of the interval graph: the number of nodes of the maximum clique represents the number of operation that are executed concurrently. In order to minimize resource cost. we select the operation type to reduce the number of nodes of a maximum clique. For the selected operation type, an operation selected by selection rule is moved to decrease the number of nodes of a maximum clique. A selected operation among unscheduled operations is moved repeatly and assigned to a control step consequently. The proposed algorithm is applied to the pipeline and the nonpipeline data path synthesis. The experiment for examples shows the efficiency of the proposed scheduling algorithm.

• Transactions of the Korean Society of Mechanical Engineers
• /
• v.19 no.10
• /
• pp.2667-2677
• /
• 1995

A new numerical algorithm using equal order linear finite element and fractional step method has been developed which is capable of analyzing unsteady fluid flow and heat transfer problems. Streamline Upwind Petrov-Galerkin (SUPG) method is used for the weighted residual formulation of the Navier-Stokes equations. It is shown that fractional step method, in which pressure term is splitted from the momentum equation, reduces computer memory and computing time. In addition, since pressure equation is derived without any approximation procedure unlike in the previously developed SIMPLE algorithm based FEM codes, the present numerical algorithm gives more accurate results than them. The present algorithm has been applied preferentially to the well known bench mark problems associated with steady flow and heat transfer, and proves to be more efficient and accurate.

• Journal of Electrical Engineering and Technology
• /
• v.5 no.1
• /
• pp.28-35
• /
• 2010

This paper presents new Adaptive Linear Combination Structure (ADALINE) for tracking/estimating voltage-current phasor and frequency of power system. To estimate the phasors and frequency from sampled data, the algorithm assumes that orthogonal coefficients and speed of angular frequency of power system are unknown parameters. With adequate sampled data, the estimation problem can be considered as a linear weighted least squares (LMS) problem. In addition to determining the phasors (orthogonal coefficients), the procedure estimates the power system frequency. The main algorithm is verified through a computer simulation and data from field. The proposed algorithm is tested with transient and dynamic behaviors during power swing, a step change of frequency upon islanding of small generators and disconnection of load. The algorithm shows a very high accuracy, robustness, fast response time and adaptive performance over a wide range of frequency, from 10 to 2000 Hz.