• Journal of Advanced Marine Engineering and Technology
• /
• v.24 no.4
• /
• pp.435-440
• /
• 2000

The speed control system of diesel engine is considerably nonlinear. Therefore, a countermeasure such as gain scheduling used to be incorporated to compensate this nonlinearity. On the other hand, it is said that fuzzy control is very robust against nonlinearity. But it is difficult to get a satisfactory response with only fuzzy control in real system. In this paper authors design a fuzzy-PI controller for the speed control of Medium diesel engine and carry out experiments with dedicate system implemented by Intel 80916KC to real diesel engine, Deawoo MAN 6Cyl., 1800rpm driving 3$\psi$220V, 150KW generator. We confirm the effectiveness of proposed control system.

• Journal of the Korean Society for Precision Engineering
• /
• v.21 no.7
• /
• pp.124-129
• /
• 2004

Recently, the demand for the optical cable is rapidly growing because the number of internee user increases and high speed internet data transmission is required. But the present optical cable winding systems has some serious problems such as pile-up and collapse of cable usually near the flange of the bobbin in the process of the cable winding. To reduce the pile-up collapse in a cable winding systems, a new guiding system is developed for a high-speed self-align cable winding. First of all, the winding mechanism was analyzed and synchronization logics for the motions of winding, traversing, and the guiding were created. A prototype cable winding systems was manufactured to validate the new guiding system and the suggested logic. Experiment results showed that the winding system with the developed guiding system outperformed the system without the guiding system in reducing pile-up and collapse in the high-speed winding.

• Journal of the Korea Society for Simulation
• /
• v.18 no.2
• /
• pp.29-38
• /
• 2009

In the computing environment with heterogeneous resources, a job scheduling model is necessary for effective resource utilization and high-speed data processing. And, the job scheduling model has to cope with a dynamic change in the condition of resources. There have been lots of researches on resource estimation methods and heuristic algorithms about how to distribute and allocate jobs to heterogeneous resources. But, existing researches have a weakness for system compatibility and scalability because they do not support the standard language. Also, they are impossible to process jobs effectively and deal with a variety of computing situations in which the condition of resources is dynamically changed in real-time. In order to solve the problems of existing researches, this paper proposes a semantic computing-based dynamic job scheduling model that defines various knowledge-based rules for job scheduling methods adaptable to changes in resource condition and allocate a job to the best suited resource through inference. This paper also constructs a resource ontology to manage information about heterogeneous resources without difficulty as using the OWL, the standard ontology language established by W3C. Experimental results shows that the proposed scheduling model outperforms existing scheduling models, in terms of throughput, job loss, and turn around time.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.27 no.9C
• /
• pp.836-841
• /
• 2002

Packet scheduling is an essential function to guarantee a quality of service by differentiating services in the Internet. Scheduling algorithms that have been suggested so far can be devided into Round-Robin methods and Fair Queueing methods Round-Robin methods have the advantage of high-speed processing through simple implementations, while Fair Queueing methods offer accurate services. Fair queueing algorithms, however, have problems of computational overheads and implementation complexity as their schedulers manage the states of every flow. This paper suggests a new method in which each flow performs the calculation in a distributed way to decide the service order. Our algorithm significantly reduces the scheduler's computational overheads while providing the same level of accuracy with the previous Fair Queueing algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.12 no.6
• /
• pp.2658-2679
• /
• 2018

This paper proposes a novel Random Scheduling Algorithm based on Subregion Coverage (RSASC), to solve the SET K-cover problem (an NP-complete problem). SET K-cover problem distributes the set of sensors into the maximum number of mutually exclusive subsets (MESSs) in such a way that each of them can be scheduled for lifetime extension of WSN. Sensor coverage divides the target region into different subregions. RSASC first sorts the subregions in the ascending order concerning their sensor coverage. Then, it forms the subregion groups according to their similar sensor coverage. Lastly, RSASC ensures the K-coverage of each subregion from every group by randomly scheduling the sensors. We consider the target-coverage and area-coverage applications of WSN to analyze the usefulness of our proposed RSASC algorithm. The distinct quality of RSASC is that it utilizes less number of deployed sensors (33% less) to form the optimum number of MESSs with the higher computational speed (saves more than 93% of the time) as compared to the existing three algorithms.

• Journal of the Korea Institute of Information and Communication Engineering
• /
• v.13 no.5
• /
• pp.967-973
• /
• 2009

Recently, as 3rd-generation mobile communication services using high-speed data rate system are widely employed, the demand for a variety of real-time data services such as VoIP service are also increased. Unlike typical data packets, VoIP packets have delay bound and low loss rate requirement. In this paper we propose a new scheduling algorithm that schedule two deferent kinds of packets efficiently, considering the characteristics of VoIP. Basically this algorithm considers both time delay and channel condition and gives priority depending on the time delay. Simulation results show that the proposed algorithm works more efficiently than conventional algorithms.

• Proceedings of the KIEE Conference
• /
• 2004.07d
• /
• pp.2397-2399
• /
• 2004

This paper deals with the messages scheduling of a CAN (Controller Area Network), based on the distributed control scheme to integrate actuators and sensors in a humanoid robot. In order to supply the distributed processing for a humanoid robot, each control unit should have the efficient control method, fast calculation and valid data exchange. The preliminary study has concluded that the performance of CAN is better and easier to implement than other network such as FIP (Factory Instrumentation Protocol), VAN (Vehicle Area Network), etc. Since humanoid robot has to treat the significant control signals from many actuators and sensors, the communication time limitation could be critical according to the transmission speed and data length of CAN specification. In this paper, the CAN message scheduling in humanoid robot was suggested under the presence of Jitter in the message group, the existence of high load of messages over the network and the presence of transmission errors. In addition, the response time under the worst case is compared with the simulation by using the simulation algorithm. As a result, the suggested messages scheduling can guarantee our CAN limitation, and utilized to generate the walking patterns for the humanoid.

• JSTS:Journal of Semiconductor Technology and Science
• /
• v.16 no.1
• /
• pp.11-22
• /
• 2016

Clock skew scheduling is one of the essential steps to be carefully performed during the design process. This work addresses the clock skew optimization problem integrated with the consideration of the inter-dependent relation between the setup and hold times, and clock to-Q delay of flip-flops, so that the time margin is more accurately and reliably set aside over that of the previous methods, which have never taken the integrated problem into account. Precisely, based on an accurate flexible model of setup time, hold time, and clock-to-Q delay, we propose a stepwise clock skew scheduling technique in which at each iteration, the worst slack of setup and hold times is systematically and incrementally relaxed to maximally extend the time margin. The effectiveness of the proposed method is shown through experiments with benchmark circuits, demonstrating that our method relaxes the worst slack of circuits, so that the clock period ($T_{clk}$) is shortened by 4.2% on average, namely the clock speed is improved from 369 MHz~2.23 GHz to 385 MHz~2.33 GHz with no time violation. In addition, it reduces the total numbers of setup and hold time violations by 27.7%, 9.5%, and 6.7% when the clock periods are set to 95%, 90%, and 85% of the value of Tclk, respectively.

• Proceedings of the KSR Conference
• /
• 2008.06a
• /
• pp.1359-1370
• /
• 2008

In the track geometry such as rails, sleepers, ballasts and fastener, track deterioration occurs by repetitive train weight and the high-speed railway takes a trend faster than normal. Track deterioration of over threshold value harms ride comfort and furthermore affect in trains safety seriously. An organic and systematic track maintenance system is very important because a trend of the track deterioration effects on track life-cycle and running safety. Also costs of the railway track permanent way and its maintenance are extremely large, forming a significant part of the total infrastructure expenditure. Therefor reasonable and efficient track maintenance has to be planed on a budget. It is required to carry out not only corrective maintenance but preventive maintenance for the track maintenance. In order to perform maintenance jobs in the boundary of the machines and resources given regarding the type and amount jobs, it is necessary to determine feasible or optimal scheduling considering the priority. In this study, the system organization and required functions for the development of track maintenance system supported track deterioration prediction and optimal scheduling are proposed.

• Journal of the Korean Solar Energy Society
• /
• v.38 no.2
• /
• pp.1-13
• /
• 2018

This paper deals with the NREL (National Renewable Energy Laboratory) 5-MW reference wind turbine. The controller which include MPPT (Maximum power point tracking) control algorithm and tower load reduction control algorithm was designed by MATLAB Simulink. This paper propose a tower damper algorithm to improve the existing tower damper algorithm. To improve the existing tower damper algorithm, proposed tower damper algorithm were applied the thrust sensitivity scheduling and PI control method. The thrust sensitivity scheduling was calculated by thrust force formula which include thrust coefficient table. Power and Tower root moment DEL (Damage Equivalent Load) was set as a performance index to verify the load reduction algorithm. The simulation were performed 600 seconds under the wind conditions of the NTM (Normal Turbulence Model), TI (Turbulence Intensity)16% and 12~25m/s average wind speed. The effect of the proposed tower damper algorithm is confirmed through PSD (Power Spectral Density). The proposed tower damper algorithm reduces the fore-aft moment DEL of the tower up to 6% than the existing tower damper algorithm.