• Journal of Korean Society for Quality Management
• /
• v.35 no.1
• /
• pp.24-34
• /
• 2007

This paper investigates the average run length (ARL) of a selectively moving average (S-MA) control chart. The S-U chart is designed to detect shifts in the process mean. The basic idea of the S-MA chart is to accumulate previous samples selectively in order to increase the sensitivity. The ARL of the S-MA chart was shown to be monotone decreasing with respect to the decision length in a previous research [3]. This paper derives the steady-state ARL in a closed-form and shows that the monotone property is resulted from head-start assumption. The steady-state ARL is shown to be a sum of head-start ARL and an additional term. The statistical design procedure for the S-MA chart is revised according to this result. Sensitivity study shorts that the steady-state ARL performance is still better than the CUSUM chart or the Exponentially Weighted Moving Average (EWMA) chart.

• 제어로봇시스템학회:학술대회논문집
• /
• 1991.10b
• /
• pp.1601-1606
• /
• 1991

We present an algorithm to approximate the Voronoi diagrams of 2D objects bounded by algebraic curves. Since the bisector curve for two algebraic curves of degree d can have a very high algebraic degree of 2 * d$^{4}$, it is very difficult to compute the exact algebraic curve equation of Voronoi edge. Thus, we suggest a simple polygonal approximation method. We first approximate each object by a simple polygon and compute a simplified polygonal Voronoi diagram for the approximating polygons. Finally, we approximate each monotone polygonal chain of Voronoi edges with Bezier cubic curve segments using least-square curve fitting.

• International Journal of CAD/CAM
• /
• v.2 no.1
• /
• pp.23-28
• /
• 2002

This paper presents an efficient line-offset algorithm for general polygonal shapes with islands. A developed sweep-line algorithm (SL) is introduced to find all self-intersection points accurately and quickly. The previous work is limited to handle polygons that having no line-segments in parallel to sweep-line directions. The proposed algorithm has been implemented in Visual C++ and applied to offset point sequence curves, which contain several islands.

• Journal of Korean Institute of Industrial Engineers
• /
• v.39 no.5
• /
• pp.440-449
• /
• 2013

We consider a reverse supply chain with a production facility and a recovery facility, and address the joint control of production and disposal decisions for sustainable operations. Demands are satisfied from on-hand inventory of serviceable products, replenished via manufacturing or remanufacturing. Sold products may be returned after usage and each returned product is disposed of or accepted for recovery. Accepted returned products are converted into serviceable products after remanufacturing process. Formulating the model as a Markov decision process, we characterized the structure of the optimal production and disposal policy as two monotone switching curves under a special condition. Three types of heuristic policies are presented and their performance is numerically compared.

• Korean Journal of Computational Design and Engineering
• /
• v.4 no.3
• /
• pp.190-199
• /
• 1999

Presented in this paper is an algorithm for finding all intersections among polygonal chains with an O((n+k)·log m) worst-case time complexity, where n is the number of lien segments in the polygonal chains, k is the number of intersections, and m is the number of monotone chains. The proposed algorithm is based on the sweep line algorithm. Unlike the previous polygonal-chain intersection algorithms that are designed to handle special only cases, such as convex polygons or C-oriented polygons, the proposed algorithm can handle arbitrarily shaped polygonal chains having self-intersections and singularities (tangential contact, multiple intersections). The algorithms has been implemented and applied to 1) testing simplicity of a polygon, 2) finding intersections among polygons and 3) offsetting planar point-sequence curves.

• Korean Journal of Computational Design and Engineering
• /
• v.16 no.4
• /
• pp.300-304
• /
• 2011

This paper proposes an approach to generate tool-path for laser pattern machining. Considering the mechanical structure of a laser pattern machine, it is quite similar to that of a 2D milling machine. Based on the observation, one may try to utilize the tool-path generation methodologies of 2D milling for the laser pattern machining. However, it is not possible to generate tool-path without considering the technological requirements of laser pattern machining which are different from those of 2D milling. In this paper, we identify the technological requirement of laser pattern machining, and propose a proper tool-path generation methodology to satisfy the technological requirements. For the efficient generation of tool-path, this paper proposes a tool-path element computation method, which is based on the concept of a monotone chain.