• 응용통계연구
• /
• 제22권6호
• /
• pp.1131-1142
• /
• 2009

We suggest a fast and accurate algorithm to compute ARLs of CUSUM chart for controling process variance. The algorithm solves the characteristic integral equations of CUSUM chart (for controling variance). The algorithm is directly applicable for the cases of odd sample sizes. When the sample size is even, by using well-known approximation algorithm combinedly with the new algorithm for neighboring odd sample sizes, we can also evaluate the ARLs of CUSUM charts efficiently and accurately. Based on the new algorithm we consider the optimal design of upward and downward CUSUM charts for controling process variance.

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

We propose a new algorithm for K-medoids clustering which runs like the K-means clustering algorithm and test several methods for selecting initial medoids. The proposed algorithm calculates similarity matrix once and uses it for finding new medoids at every iterative step. To evaluate the proposed algorithm we use real and artificial data and compare with the clustering results of other algorithms in terms of three performance measures. Experimental results show that the proposed algorithm takes the reduced time in computation with comparable performance as compared to the Partitioning Around Medoids.

• 한국ITS학회 논문지
• /
• 제6권3호
• /
• pp.165-173
• /
• 2007

본 논문에서는 최적의 설계 자동화를 위한 최소자원 할당 알고리듬을 제안한다. 제안된 할당 알고리듬은 연산자 간을 연결하는 신호선이 반복적으로 이용되어 연결 신호선 수가 최소가 될 수 있도록 기능 연산자를 할당한다. 레지스터 할당 시 연결구조에 따라 가중치를 갖는 구간 그래프를 구성한다. 최소의 클러스터 파티션 알고리듬을 이용하여 생성된 최대 크기의 클러스터들에 연결구조가 고려된 레지스터들을 할당한다. 또한 연결구조에 대한 멀티플렉서의 중복 입력을 제거하고 연산자에 연결된 멀티플렉서 간의 입력을 교환하는 입력 정렬 과정으로 연결 구조를 최소화한다. 또한, 벤치마크 실험을 통하여 제안된 알고리즘의 효용성을 보인다.

• Journal of Communications and Networks
• /
• 제5권3호
• /
• pp.197-201
• /
• 2003

We study in this paper both distributed power control and removal algorithms for multimedia CDMA wireless networks. In our study, users can have different data rates as well as different quality of service (QoS) requirements. We derive a necessary and sufficient condition for the fully distributed power control (FDPC) algorithm to find a feasible power set. We also prove that, if the maximal power level is used at the start, then the distributed constrained power control (DCPC) algorithm is equivalent to the FDPC algorithm. For the connection removal algorithm, we prove that the non-reinitialized removal algorithm finds a feasible power set faster and employs smaller power levels than the reinitialized one does. Performances of some connection removal criteria are also studied. Our simulation results reveal that the smallest normalized CIR (SNC) and largest CIR requirement (LCR) criteria result in smaller outage probability than the smallest CIR (SC) criterion in a multimedia environment.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2004년도 ICEIC The International Conference on Electronics Informations and Communications
• /
• pp.317-320
• /
• 2004

The exponential back-off algorithm doubles the back-off size after each collision without considering network traffic status, which causes degradation of system performance. In this paper, we propose a linear random back-off mechanism which dynamically selects the back-off window size based on the channel status which includes the number of active stations and collisions to significantly increase the protocol capacity. We present an analytical model for the saturated throughput of our linear random back-off algorithm. Simulation results show that performance can be substantially enhanced if binary exponential back-off algorithm is replaced by a linear back- off algorithm.

• 한국산업경영시스템학회:학술대회논문집
• /
• 한국산업경영시스템학회 2002년도 춘계학술대회
• /
• pp.203-208
• /
• 2002

In case of the problems with multiple plants, alternative operation sequence, alternative machine, setup time, and transportation time between plants, we need a robust methodology for the integration of process planning and scheduling in supply chain. The objective of this model is to minimize the tardiness and to maximize the resource utilization. So, we propose a multi-objective model with limited-capacity constraint. To solve this model, we develope an efficient and flexible model using adaptive genetic algorithm(AGA), compared to traditional genetic algorithm(TGA)

• 한국통계학회:학술대회논문집
• /
• 한국통계학회 2000년도 추계학술발표회 논문집
• /
• pp.173-179
• /
• 2000

Genetic algorithm(GA) is applied for detecting multiple outliers. GA is a heuristic optimization tool solving for near optimal solution. We compare the performance of GA and the other diagnostic measures commonly used for detecting outliers in regression model. The results show that GA seems to have better performance than the others for the detection of multiple outliers.

• 대한전기학회:학술대회논문집
• /
• 대한전기학회 2003년도 춘계학술대회 논문집 전기기기 및 에너지변환시스템부문
• /
• pp.258-261
• /
• 2003

This paper is a studying of the vector control of AC servo motor using a high performance DSP(TMX320F2812). This DSP has many special peripheral circuits to drive a AC Servo motor as AD converter, QEP and so on. It makes us reduce the time of developing a control system and also can be simple size controller. We use vector control algorithm for instantaneous torque control and SVPWM algorithm by offset voltage methods.

• 응용통계연구
• /
• 제25권3호
• /
• pp.485-501
• /
• 2012

This research is to find a design D that minimizes forecast variance in d dimensions over the candidate space ${\chi}$. We want a robust design since we may not know the specific covariance structure. We seek a design that minimizes a coverage criterion and hope that this design will provide a small forecast variance even if the covariance structure is unobservable. The details of an exchange or swapping algorithm and several properties of the parameters of coverage criterion with the unknown correlation structures are discussed.

• 한국정보처리학회:학술대회논문집
• /
• 한국정보처리학회 2003년도 춘계학술발표논문집 (상)
• /
• pp.317-320
• /
• 2003

본 논문에서는 각 도시마다 가중치가 있는 City domain을 tour하기 위한 문제를 해결하기 위해 Simulated Annealing Algorithm을 확장한 알고리즘을 제시하였고 Capacitated vehicle routing problem을 변형한 Augmented multiple salesman traveling problem을 정의하고 이를 해결하기 위한 에너지 함수와 알고리즘을 제시하였다.