• Journal of the Korean Operations Research and Management Science Society
• /
• v.30 no.4
• /
• pp.99-115
• /
• 2005

For an analysis of the performance of a computer system, the minimum cycle time method has been widely used. The minimum cycle time method is a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the Initial marking in a timed net. A timed net is a modified version of a Petri net where a transition is associated with a delay time. In the real world, an event is associated with a probability of occurrence. However, a timed net is not equipped with any facility of specifying probability of event occurrence. Therefore, the minimum cycle time method applied on a timed net can easily overlook probabilities of occurrences of events and yield a wrong result. We are proposing 'Timed Net with Probabilities of Choices' where a transition can be associated with both delay time and a probability of occurrence. We also introduce an algorithm for minimum cycle time analysis on a 'Timed Net with Probabilities of Choices'. As an example of application, we are performing an analysis of the location based service system using 'Timed Net with Probabilities of Choices'.

• Journal of Korea Multimedia Society
• /
• v.9 no.5
• /
• pp.671-680
• /
• 2006

As a mathematical technique with which we can find the minimum duration time needed to fire all the transitions at least once and coming back to the initial marking in a timed net, the minimum cycle time method has been widely used in computer system analysis. A timed net is a modified version of a Petri net where a transition is associated with a delay time. A delay time used in a timed net is a constant even though the duration time associated with an event in the world is a stochastic number in general. In the consequence, the result of minimum cycle time analysis is not realistic. Therefore, we propose ‘Stochastic Timed Net' where a transition can be associated with a stochastic number and introduce a minimum cycle time analysis method for ‘Stochastic Timed Net’ As an example of the application of ‘Stochastic Timed Net’, we introduce a ‘Stochastic Timed Net' model of a Location Based Service Providing Multimedia System and the result of minimum cycle time analysis of it. Whereas the typical form of the result of the existing minimum cycle time analysis is 'It takes at least 10 time units', the typical form of the result of minimum cycle time analysis of a ‘Stochastic Timed Net' is in the probability form such as "The probability of the events in which it finishes its job within 10 time units is 85%."

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.7
• /
• pp.47-52
• /
• 2016

This paper introduces an algorithm to construct an Eulerian cycle for Chinese postman problem. The Eulerian cycle is formed only when all vertices in the graph have an even degree. Among available algorithms to the Eulerian cycle problem, Edmonds-Johnson's stands out as the most efficient of its kind. This algorithm constructs a complete graph composed of shortest path between odd-degree vertices and derives the Eulerian cycle through minimum-weight complete matching method, thus running in $O({\mid}V{\mid}^3)$. On the contrary, the algorithm proposed in this paper selects minimum weight edge from edges incidental to each vertex and derives the minimum spanning tree (MST) so as to finally obtain the shortest-path edge of odd-degree vertices. The algorithm not only runs in simple linear time complexity $O({\mid}V{\mid}log{\mid}V{\mid})$ but also obtains the optimal Eulerian cycle, as the implementation results on 4 different graphs concur.

• The Bulletin of The Korean Astronomical Society
• /
• v.36 no.2
• /
• pp.99-99
• /
• 2011

A statistical study of coronal hole merging and splitting has been performed through Solar Cycle 23. The NOAA/SESC solar synoptic maps are examined to identify inarguably clear events of coronal hole merging and splitting. The numbers of merging events and splitting events are more or less comparable regardless of the phase in the solar cycle. The number of both events, however, definitely shows the phase dependence in the solar cycle. It apparently has a minimum at the solar minimum whereas its maximum is located in the declining phase of the sunspot activity, about a year after the second peak in Solar Cycle 23. There are more events of merging and splitting in the descending phase than in the ascending phase. Interestingly, no event is found at the local minimum between the two peaks of the sunspot activity. This trend can be compared with the variation of the average magnetic field strength and the radial field component in the solar wind through the solar cycle. In Ulysses observations, both of these quantities have a minimum at the solar minimum while their maximum is located in the descending phase, a while after the second peak of the sunspot activity. At the local minimum between the two peaks in the solar cycle, the field strength and the radial component both have a shallow local minimum or an inflection point. At the moment, the physical reason for these resembling tendencies is difficult to understand with existing theories. Seeing that merging and splitting of coronal holes are possible by passage of opposite polarity magnetic structures, we may suggest that the energizing activities in the solar surface such as motions of flux tubes are not exactly in phase with sunspot generation, but are more active some time after the sunspot maximum.

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

Based on the minimum cutting time criteria, the tool path generation algorithm of a pocket machining is developed as a form of a built-in cycle for the WOP(workshop oriented programming) of a CNC controller. Based on the given CAD database and tool information, an optimal cutting depth and geometric properties can be generated, then six different tool paths will be generated internally and automatically. Finally, the G code which commands tool movements is generated for CNC machining.

• 제어로봇시스템학회:학술대회논문집
• /
• 1990.10a
• /
• pp.258-262
• /
• 1990

Several optimum control algorithms have been proposed to minimize the robot cycle time by velocity scheduling. Most of these algorithms assume that the dynamic and kinematic characteristics of a manipulator are fixed. This paper presents the study of a minimum-time optimum control for robotic manipulators considering parameter changes. A complete set of solutions for parameter identification of the robot dynamics has been developed. The minimum-time control algorithm has been revised to be updated using estimated parameters from measurements.

• Journal of the Korea Society of Computer and Information
• /
• v.21 no.2
• /
• pp.97-103
• /
• 2016

This paper deals with the cycle time minimization problem that determines the productivity in printed circuit board (PCB) with n components using the m placement machines. This is known as production cycle time determination problem (PCTDP). The polynomial time algorithm to be obtain the optimal solution has been unknown yet, therefore this hard problem classified by NP-complete. This paper gets the initial assignment result with the machine has minimum unit placement time per each component firstly. Then, the balancing process with reallocation from overhead machine to underhead machine. Finally, we perform the swap optimization and get the optimal solution of cycle time $T^*$ within O(mn) computational complexity. For experimental data, the proposed algorithm can be obtain the same result as integer programming+branch-and-bound (IP+B&B) and B&B.

• Journal of the Korea Society of Computer and Information
• /
• v.20 no.3
• /
• pp.107-113
• /
• 2015

This paper presents a polynomial time algorithm to the minimum cardinality feedback edge set and minimum weight feedback edge set problems. The algorithm makes use of the property wherein the sum of the minimum spanning tree edge set and the minimum feedback edge set equals a given graph's edge set. In other words, the minimum feedback edge set is inherently a complementary set of the former. The proposed algorithm, in pursuit of the optimal solution, modifies the minimum spanning tree finding Kruskal's algorithm so as to arrange the weight of edges in a descending order and to assign cycle-deficient edges to the maximum spanning tree edge set MXST and cycle-containing edges to the feedback edge set FES. This algorithm runs with linear time complexity, whose execution time corresponds to the number of edges of the graph. When extensively tested on various undirected graphs both with and without the weighed edge, the proposed algorithm has obtained the optimal solutions with 100% success and accuracy.

• Journal of the Korean Society of Industry Convergence
• /
• v.4 no.1
• /
• pp.41-49
• /
• 2001

This study developed signal optimization algorithm by analyzing vehicle arrival patterns. The major principle of signal optimization is dissipate all queueing vehicle in 1cycle and assign delay time uniformly for all approaches. For this, this study used optimal green time and surplus green time. Optimal green time calculated by estimated traffic volume from vehicle arrival model. Surplus green time defined as the gap of optimal green time and queue dissipated time. And alternative cycle has minimum surplus green time was selected as the optimal cycle. Finally, total delay and average delay per vehicle can be calculated by using queueing theory.

• Journal of the Korean Operations Research and Management Science Society
• /
• v.19 no.2
• /
• pp.217-228
• /
• 1994

This paper presents a new integer formulation (Type III ALB) for a single model assembly line balancing problem. The objective of the formulation is to minimize the total idle time, which is defined as the product of the number of work stations and the cycle times minus the total work content. This formulation considers currently existing Type I (minimizing the number of work stations for a given cycle time) and type II (minimizing the cycle time for a given number of work stations) formulations as its special cases and provides the global minimum solutions of the cycle time and the number of work stations. This information would be of great value to line designers involved in designing new assembly lines and rebalancing old lines under flexible conditions. Solution methods based on combination of Type I and Type II approaches are also suggested and compared.