• 대한전기학회논문지:전기기기및에너지변환시스템부문B
• /
• 제53권7호
• /
• pp.437-443
• /
• 2004

In this work the AC loss measurement setup based on an iron core background magnet, not used in a conventional one, has been successfully developed. To prove its validity, a round-robin test for the same Bi-2223 tape sample among three institutes has been done. The results show that the self-field and magnetization losses from the developed setup well agree with the losses measured at two other institutes of Korea Basic Science Institute and Yokohama National University. The measured magnetization losses for parallel or perpendicular fields can be well predicted from the slab model or the strip model for a filamentary region. However the magnetization losses for longitudinal fields can be rather predicted by the slab model for a decoupled filament. The self-field losses are well explained by the Norris ellipse model.

• 제어로봇시스템학회논문지
• /
• 제3권5호
• /
• pp.532-541
• /
• 1997

This article derives an analytic solution to determine the optimal size of multiple noncontinuous process and storage units. The total cost to be minimized consists of the setup cost of noncontinuous processing units and the inventory holding cost of feedstock/product storages. A novel approach, which is called PSW(Periodic Square Wave) model, is applied to represent the material flow among non-continuous units and storages. PSW model presumes that the material flow between unit and storage is periodic square wave shaped. The resulting optimal unit size has similar characteristics with the classical economic lot sizing model such as EOQ(Economic Order Quantity) or EPQ(Economic Production Quantity) model in a sense that the unit size is determined as the balance between setup and inventory holding cost. However, the influence of inventory holding cost of PSW model is different from that of EOQ/EPQ model. EOQ/EPQ model includes only the product inventory holding cost but PSW model includes all inventory holding costs around the non-continuous unit with proportional contribution. PSW model is suitable for analyzing interlinked process-storage system. The optimal lot size of PSW model is smaller than that of EOQ/EPQ model. This is quitea remarkable result considering that the EOQ/EPQ model has been is widely used since last half century.

• Radiation Oncology Journal
• /
• 제14권4호
• /
• pp.333-338
• /
• 1996

목적 : 반복되는 환자 치료에서 환자의 Setup 오차가 Multi-leaf Collimator의 scallop penumbra에 미치는 효과와 이의 임상적 의미를 살펴보고자 하였다. 대상 및 방법 : MLC의 leaf 방향에 대해 $0^{circ},{\;}15^{circ},{\;}30^{circ},{\;}45^{circ},{\;}60^{circ},{\;}75^{circ}$ block 모양을 MLC와 통상적인 block으로 만들었다. 팬톰내에서 필름 측정법으로 통상적인 블록과 MLC가 만든 치료면의 penumbra 차이를 비교하였다. 방사선 치료는 30회 반복할 때의 setup 오차가 고려된 선량분포를 중첩방식으로 구하였다. 위치 변화값은 연구보고 수치를 근거하여 구하였다. 결과 : 평균 4mm setup error를 갖는 모델에서 1cm 폭분해능을 갖는 MLC가 만든 penumbra은 기존 차폐 블록에서 생긴 penumbra 보다 차폐 모양에 따라 $0\~3mm$ 증가하는 효과를 볼 수 있었다. 결론 : 치료 조사면을 결정할 때 MLC를 사용하더라도 ICRU 50에 따라 환자의 움직임을 고려하여 치료조사면을 결정하였다면, 기존의 방식과 동일하게 치료면을 정할 수 있으며, 필요에 따라 3mm의 여유를 두면 MLC 치료 조사면 내에 치료 부위가 충분히 포함된다.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 1992년도 한국자동제어학술회의논문집(국내학술편); KOEX, Seoul; 19-21 Oct. 1992
• /
• pp.1078-1083
• /
• 1992

Extracting the process planning information from the CAD data is the key issue in integrated CAD/CAM system. In this paper, we develop algorithms for extracting the shape and setup configuration for NC machining of prismatic parts. In determining the workpart shape, the minimum-enclosing condept is applied so that the material waste is minimized. To minimize the number of setups, feature based algorithm is developed considrint the part shape, tool shape, and tool approach direction. The validity and effectiveness of the developed algorithms were tested by computer simulations.

• 대한치과교정학회지
• /
• 제53권1호
• /
• pp.26-34
• /
• 2023

Objective: The purpose of the present study was to compare the root positions in virtual tooth setups using only crowns in a simulated treatment with those achieved in the actual treatment. Methods: Pre- and post-treatment intraoral and corresponding cone beam computed tomography (CBCT) scans were obtained from 15 patients who underwent orthodontic treatment with premolar extraction. A conventional virtual tooth setup was used for the treatment simulation. Pre- and post-treatment three-dimensional digital tooth models were fabricated by integrating the patients' intraoral and CBCT scans. The simulated root positions in the virtual setup were obtained by merging the crown in the virtual setup and root in the pre-treatment tooth model. The root positions of the simulated and actual post-treatment tooth models were compared. Results: Differences in root positions between the simulated and actual models were > 1 mm in all teeth, and statistically significant differences were observed (p < 0.05), except for the maxillary lateral incisors. The differences in the inter-root angulation were > 1° in all teeth, and statistically significant differences were observed in the maxillary and mandibular canines. Conclusions: The virtual tooth setup using only crown data showed errors over the clinical limits. The clinical application of a virtual setup using crowns and roots is necessary for accurate and precise treatment simulation, particularly in extraction treatment.

• Communications for Statistical Applications and Methods
• /
• 제24권5호
• /
• pp.421-441
• /
• 2017

In this survey, estimation methods for structural vector autoregressive models are presented in a systematic way. Both frequentist and Bayesian methods are considered. Depending on the model setup and type of restrictions, least squares estimation, instrumental variables estimation, method-of-moments estimation and generalized method-of-moments are considered. The methods are presented in a unified framework that enables a practitioner to find the most suitable estimation method for a given model setup and set of restrictions. It is emphasized that specifying the identifying restrictions such that they are linear restrictions on the structural parameters is helpful. Examples are provided to illustrate alternative model setups, types of restrictions and the most suitable corresponding estimation methods.

• Journal of the Korean Statistical Society
• /
• 제29권4호
• /
• pp.407-422
• /
• 2000

This article is concerned with the selecting predictor variables to be included in building a class of binary response t-link regression models where both probit and logistic regression models can e approximately taken as members of the class. It is based on a modification of the stochastic search variable selection method(SSVS), intended to propose and develop a Bayesian procedure that used probabilistic considerations for selecting promising subsets of predictor variables. The procedure reformulates the binary response t-link regression setup in a hierarchical truncated normal mixture model by introducing a set of hyperparameters that will be used to identify subset choices. In this setup, the most promising subset of predictors can be identified as that with highest posterior probability in the marginal posterior distribution of the hyperparameters. To highlight the merit of the procedure, an illustrative numerical example is given.

• 한국경영과학회:학술대회논문집
• /
• 한국경영과학회 2006년도 추계학술대회
• /
• pp.127-133
• /
• 2006

Minimizing the total number of setup changes of a machine increases the throughput and improves the stability of a production process, and as a result enhances the product quality. In this context, we consider a new product-mix problem that minimizes the total number of setup changes while producing the required quantities of a product over a given planning horizon. For this problem, we develop a mixed integer programming model. Also, we develop an efficient heuristic algorithm to find a feasible solution of good quality within reasonable time bounds. Computational results show that the developed heuristic algorithm finds a feasible solution as good as the optimal solution in most test problems. Also, we developed a web based scheduling and monitoring system for a zinc alloy production process using the developed heuristic algorithm. By using this system, we could find a monthly zinc alloy production schedule that significantly reduces the total number of setup changes.

• 대한산업공학회지
• /
• 제33권2호
• /
• pp.246-253
• /
• 2007

All of the machines in a production line can be classified into bottleneck and non-bottleneck machines. A bottleneck is a resource whose capacity limits the throughput of the whole production facility. This paper addresses a batch sizing problem at the bottleneck machine. Traditionally, most batch sizing decisions have been made based on the EOQ (economic order quantity) model where setup and inventory costs are considered while throughput rate is assumed to be given. However, since batch size affects the capacity of the bottleneck machine, the throughput rate may not be constant. As the batch size increases, the frequency of the setup decreases. The saved setup time can be transferred to processing time, which results in higher throughput. But, the larger batch size may also result in longer lead time and larger WIP inventory level. This paper presents an alternative method to determine batch size at the bottleneck machine in a manufacturing line. A linear search algorithm is introduced to find optimal throughput rate and batch size at the same time. Numerical examples are provided to see how the proposed method works and to investigate the effects of some parameters.

• 대한산업공학회지
• /
• 제19권4호
• /
• pp.125-135
• /
• 1993

An Unrelated Parallel Processing with Weighted jobs and Setup times scheduling prolem is studied. We consider a parallel processing in which a group of processors(machines) perform a single operation on jobs of a number of different job types. The processing time of each job depends on both the job and the machine, and each job has a weight. In addition each machine requires significant setup time between processing jobs of different job types. The performance measure is to minimize total weighted flow time in order to meet the job importance and to minimize in-process inventory. We present a 0-1 Mixed Integer Programming model as an optimizing algorithm. We also present a simple heuristic algorithm. Computational results for the optimal and the heuristic algorithm are reported and the results show that the simple heuristic is quite effective and efficient.