• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.37 no.4
• /
• pp.63-71
• /
• 2014

As power consumption increases, more power utilities are required to satisfy the demand and consequently results in tremendous cost to build the utilities. Another issue in construction of power utilities to meet the peak demand is an inefficiency caused by surplus power during non-peak time. Therefore, most power company considers power demand management with time-based electricity rate policy which applies different rate over time. This paper considers an optimal machine operation problem under the time-based electricity rates. In TOC (Theory of Constraints), the production capacities of all machines are limited to one of the bottleneck machine to minimize the WIP (work in process). In the situation, other machines except the bottleneck are able to stop their operations without any throughput loss of the whole manufacturing line for saving power utility cost. To consider this problem three integer programming models are introduced. The three models include (1) line shutdown, (2) block shutdown, and (3) individual machine shutdown. We demonstrate the effectiveness of the proposed IP models through diverse experiments, by comparing with a TOC-based machine operation planning considered as a current model.

• Proceedings of the KIEE Conference
• /
• 2000.07d
• /
• pp.2772-2774
• /
• 2000

According to the development of marine transportation business and the modernization and over sizing of vessel transportation equipment. shipping equipment used in the terminal are getting more atomized and speedier. thus the efficiency of shipping and discharging depends upon the degree of practice of terminal operating manpower. It means that cultivation of experts in this field is essentially needed and it is becoming a serious problem to guarantee the training programs to provide high-class. high-skilled manpower. The best result can be expected when we use the real equipment for training purposes. but it will cause many difficulties such as budget problem. To overcome this situation. we developed the Virtual Container Crane Simulator(VCCS System) which enables the operator to learn the operation of the equipment as well as safety problems within a short time. VCCS system begins with establishing the direction of operation by setting the appropriate motions for each step. and then it instructs the basic operation. It enhances the driver's ability to cope with accidents during operation and completes and completes the mastery of operating techniques with The repetition of practice.

• 제어로봇시스템학회:학술대회논문집
• /
• 1997.10a
• /
• pp.760-763
• /
• 1997

Using telesensor programming method, we control the space robot which has two 2-DOF manipulators. To make this control system, we devide total works by elemental operation. And we make a simulation system that can simulate sensors and robot. In the simulation system, we make a sensor data and robot paths by "Teaching by showing" method. And using these data, we control the real space robot. This off-line method can solve long time delay problem in teleoperation.operation.

• Proceedings of the Korea Institute of Applied Superconductivity and Cryogenics Conference
• /
• 2002.02a
• /
• pp.334-336
• /
• 2002

This study is concerned with the operation algorithm and power switch drive circuit for DC Reactor Type High-Tc Superconducting Fault Current Limiter (SFCL). In the case of SFCL, Power switching operation algorithm are very important problem. So, this driving will determine the performance of SFCL. In this paper, we provide a simple algorithm and easy drive circuit. Through experiment we found that ideal is right.

• Proceedings of the Korean Operations and Management Science Society Conference
• /
• 1996.04a
• /
• pp.570-573
• /
• 1996

The evaluation test for the operation of rotary type surface mounters which consist of the reel axis, the index table and the X-Y table, has been performed by comparing the new method with the old one in only fields. Because the problem seeking for the optimal operation of rotary type surface mounters, is NP complete, it is almost impossible to get the optimal solutions of large problems. This paper deals with a dynamic network modeling, which can reduce the effort, the cost, and the time used for the performance test of rotary type surface mounters.

• Kyungpook Mathematical Journal
• /
• v.63 no.4
• /
• pp.709-718
• /
• 2023

The inner automorphism groups of quandles are related to the classification problem of quandles. The inner automorphism group of a quandle is generated by inner automorphisms which are presented by columns in the operation table of the quandle. In this paper, we describe inner automorphisms of an abelian extension of a quandle by expressing columns of the operation table of the extended quandle as columns of the operation table of the original quandle. Such a description will be helpful in studying inner automorphism groups of abelian extensions of quandles.

• Journal of Elementary Mathematics Education in Korea
• /
• v.16 no.2
• /
• pp.203-225
• /
• 2012

The purpose of this study is to suggest a program for improvement of the mathematical creativity of mathematical gifted children in the elementary gifted class and to examine the effect of developed program. Gifted education program is developed through analyzing relevant literatures and materials. This program is based on the operation bingo game related to the area of number and operation, which accounts for the largest portion in the elementary mathematics. According to this direction, the mathematically gifted educational program has been developed. According to the results which examine the effectiveness of the creative problem solving by the developed program, students' performance ability has been gradually improved by feeding back and monitoring their problem solving process continuously.

• Journal of the Korea Institute of Information Security & Cryptology
• /
• v.28 no.2
• /
• pp.327-338
• /
• 2018

On-line/off-line signature is a technique for performing heavy computations required for signature generation in the off-line stage and completing the final signature by a simple operation in the online stage. This is suitable for application environments that require immediate signing responses to multiple users. In this paper, we propose two new on-line/off-line signature schemes based on RSA problem. The first technique can generate a signature with a fixed base exponentiation when signing online, and the second technique can complete an online signature with a very simple calculation such as a hash operation. The security of both signatures is based on the RSA problem, which is proven to be tightly secure without security loss in the random oracle model.

• Journal of information and communication convergence engineering
• /
• v.12 no.1
• /
• pp.33-38
• /
• 2014

This paper investigates the shaping operation problem introduced by Callahan et al., namely the k-fragility maximization problem (k-FMP), whose goal is to find a subset of personals within a terrorist group such that the regeneration capability of the residual group without the personals is minimized. To improve the impact of the shaping operation, the degree centrality of the residual graph needs to be maximized. In this paper, we propose a new greedy algorithm for k-FMP. We discover some interesting discrete properties and use this to design a more thorough greedy algorithm for k-FMP. Our simulation result shows that the proposed algorithm outperforms Callahan et al.'s algorithm in terms of maximizing degree centrality. While our algorithm incurs higher running time (factor of k), given that the applications of the problem is expected to allow sufficient amount of time for thorough computation and k is expected to be much smaller than the size of input graph in reality, our algorithm has a better merit in practice.

• The Transactions of the Korean Institute of Electrical Engineers
• /
• v.36 no.9
• /
• pp.609-615
• /
• 1987

The optimal operation of power system is developed by alternately using real power dispatch and reactive power dispatch problem. The real power system scheduling process is formulated as an optimization problem with linear inequality constraints. A.C. loadflow method is used for the problem solution and line losses are considered. The constraints under consideration are generator power limits, load scehdling limits and line capacity limits. In solving the objective function the Dual Relaxation method is adopted. Tests indicate that the method is practical for real time application. The reactive power control problem uses the Dual Simplex Relaxation method as in the real scheduling case. Insted of minimizing the cost of power system, the objective is selected as to determine the highest possible voltage schedule. The constraints under consideration are the voltage limits at each node and the possibilities of supply or absobtion of reactive energy by generator units and the compensation facilities. Tests indicate that the method is practical for real time applications. The overall optimization methods developed in this paper proved to obtained fine results in minimizing object function compared with the method without using voltage control. And the overall voltage profiles were also improved.