• 한국정보통신학회:학술대회논문집
• /
• 한국해양정보통신학회 2004년도 춘계종합학술대회
• /
• pp.682-684
• /
• 2004

Random Telegraph Signal(RTS)에 의한 1/f 잡음이 CMOS Ring Oscillator의 Phase Noise와 Jitter에 미치는 영향을 조사한다. 7단 Ring Oscillator의 각 노드에 병렬 연결된 10개의 Piece-Wise-Linear 전류원이 RTS 신호를 모델링 한다. RTS 전류원의 진폭과 Time Constant를 변화시키면서 Ring Oscillator 출력의 FFT 및 전력 스팩트럼 밀도, Jitter를 관찰한다. RTS 전류원의 진폭은 Phase Noise의 폭을 증가시키고 결과적으로 Jitter의 크기도 증가 시키는 것이 확인 되었다. 그리고 RTS Time Constant가 짧아질수록 출력 신호의 FFT peak의 폭이 커지고 Cycle to Cycle Jitter 값이 증가하였다.

• 산업경영시스템학회지
• /
• 제43권1호
• /
• pp.61-69
• /
• 2020

Systems such as database and socal network systems have been broadly used, and their unexpected failure, with great losses and sometimes a social confusion, has received attention in recent years. Therefore, it is an important issue to find optimal maintenance plans for such kind of systems from the points of system reliability and maintaining cost. However, it is difficult to maintain a system during its working cycle, since stopping works might incur users some troubles. From the above viewpoint, this paper discusses minimal repair maintenance policy with periodic replacement, while considering the random working cycles. The random working cycle and periodic replacement policies with minimal repair has been discussed in traditional literatures by usually analyzing cases for the nonstopping works. However, maintenance can be more conveniently done at discrete time and even during the working cycle in real applications. So, we propose that periodic replacement is planned at discrete times while considering the random working cycle, and moreover provide a model in which system, with a minimal repair at failures between replacements, is replaced at the minimum of discrete times KT and random cycles Y. The average cost rate model is used to determine the optimal number of periodic replacement.

• Journal of applied mathematics & informatics
• /
• 제4권2호
• /
• pp.457-468
• /
• 1997

The present paper deals with an economic order quan-tity model for items deteriorating at some constant rate with demand changing at a known and at a random point of time in the fixed pro-duction cycle.

• 제어로봇시스템학회논문지
• /
• 제16권3호
• /
• pp.305-312
• /
• 2010

The aim of this study is to find an analytic solution to the problem of determining the optimal capacity of a batch-storage network to meet demand for finished products in a system undergoing joint random variations of operating time and batch material loss. The superstructure of the plant considered here consists of a network of serially and/or parallel interlinked batch processes and storage units. The production processes transform a set of feedstock materials into another set of products with constant conversion factors. The final product demand flow is susceptible to joint random variations in the cycle time and batch size. The production processes have also joint random variations in cycle time and product quantity. The spoiled materials are treated through regeneration or waste disposal processes. The objective function of the optimization is minimizing the total cost, which is composed of setup and inventory holding costs as well as the capital costs of constructing processes and storage units. A novel production and inventory analysis the PSW (Periodic Square Wave) model, provides a judicious graphical method to find the upper and lower bounds of random flows. The advantage of this model is that it provides a set of simple analytic solutions while also maintaining a realistic description of the random material flows between processes and storage units; as a consequence of these analytic solutions, the computation burden is significantly reduced. The proposed method has the potential to rapidly provide very useful data on which to base investment decisions during the early plant design stage. It should be of particular use when these decisions must be made in a highly uncertain business environment.

• 품질경영학회지
• /
• 제48권1호
• /
• pp.201-214
• /
• 2020

Purpose: The purpose of this paper is to determine an optimal number of cycle times for the replacement under the circumstance where the system is replaced at the periodic time and the multiple number of working cycles whichever occurs first and the system is minimally repaired between the replacements if it fails. Methods: The system is replaced at periodic time () or cycle time, whichever occurs first, and is repaired minimally when it fails between successive replacements. To determine the optimal number of cycle times, the expected total cost rate is optimized with respect to the number of cycle times, where the expected total cost rate is defined as the ratio of the expected total cost between replacements to the expected time between replacements. Results: In this paper, we conduct a sensitivity analysis to find the following results. First, when the expected number of failures per unit time increases, the optimal number of cycle times decreases. Second, when the periodic time for replacement becomes longer, the optimal number of cycle times decreases. Third, when the expected value for exponential distribution of the cycle time increases, the optimal number of cycle times increases. Conclusion: A mathematical model is suggested to find the optimal number of cycle times and numerical examples are provided through the sensitivity analysis on the model parameters to see the patterns for changes of the optimal number of cycle times.

• 한국통신학회논문지
• /
• 제31권12A호
• /
• pp.1246-1252
• /
• 2006

본 논문에서는 random FHSS, synchronous FHSS 방식을 채용한 RFID 시스템의 충돌 확률, 트래픽 처리시간 및 주파수 채널 용량 분석을 위한 알고리즘을 제시하였다. 평균 서비스 시간, duty cycle, traffic intensity, 충돌이 발생하여 재전송 시도를 하기 위한 지연시간을 고려하여 정상상태에서의 충돌 확률 및 트래픽 처리 지연시간을 산출하였다. 모의실험을 통하여 최대처리 가능한 트래픽 용량 및 주파수 채널수를 평가하고, 제안된 분석 알고리즘 정확성을 입증하였다.

• 대한산업공학회지
• /
• 제14권1호
• /
• pp.73-82
• /
• 1988

This research is concerned with production scheduling for FMS (Flexible Manufacturing System) which consists of machine centers served by cycle conveyor. The objective of the research is to develop and evaluate scheduling procedures to minimize the mean flow time. An optimal algorithm called SCTF (Shortest Circle Time First) is proposed when the conveyor runs at minimum possible speed (CS=1) and a heuristic algorithm called SCTJMF (Shortest Cycle Time and Job Matching Algorithm) is suggested when the conveyor runs at double speed (CS=2). The evaluation of the heuristic algorithm was implemented by comparison with the optimal algorithm for 112 experimentations for CS=1 and random schedule. The results showed that the proposed heuristic algorithm provides better solution that can be regarded noticeable when compared with SCTF algorithm and random scheduling.

• 대한교통학회지
• /
• 제10권3호
• /
• pp.7-20
• /
• 1992

The common cycle time for the linded signals is usually determined for the critical intersecion, just because the cpacity of a signalized intersection depends on the cycle time. This may not be optimal since the interactions between the flow and the spatial structure of the route or the area are disregarded in this case. It is common to separate the total delay incurred at signals into two parts, a deterministic or uniform delay and a stochastic or random delay. The deterministic delays and the stochastic delays on the artery particularly related to signal cycle time. For this purpose a microscopic simulation technique is used to evaluate deterministic delays, and a macroscopic simulation technique based on the principles of Markov chains is used to evaluate stochastic delays with over flow queue. As a result of investigating the relations between deterministic delays and cycle time in the various circumstances of spacing of signals and traffic volume. As for stochastic delays the resalts of comparisons of the macroscopic simulation and Newell's approximation with the microscopic simulation indicate that the former is valid for the degree of saturation less than 0.95 and the latter is for that above 0.95. Newell's argument that the total stochastic delay on an arterial is dominated by that at or caused by critical intersection is certified by the simulation experiments. The comprehensive analyses of the values of optimal cycle time with various conditions lead to a model. The cycle time determined by this model shows to be approximately 70% of that calculated by Webster's.

• Communications for Statistical Applications and Methods
• /
• 제29권3호
• /
• pp.353-371
• /
• 2022

This paper analyzes death counts after World War II of several countries to identify and to compare their stochastic structures. The stochastic structures that this paper entertains are three structural time series models, a local level with a random walk model, a fixed local linear trend model and a local linear trend model. The structural time series models assume that a time series can be formulated directly with the unobserved components such as trend, slope, seasonal, cycle and daily effect. Random effect of each unobserved component is characterized by its own stochastic structure and a distribution of its irregular component. The structural time series models use the Kalman filter to estimate unknown parameters of a stochastic model, to predict future data, and to do filtering data. This paper identifies the best-fitted stochastic model for three types of death counts (Female, Male and Total) of each country. Two diagnostic procedures are used to check the validity of fitted models. Three criteria, AIC, BIC and SSPE are used to select the best-fitted valid stochastic model for each type of death counts of each country.

• 대한수학회지
• /
• 제61권4호
• /
• pp.693-711
• /
• 2024

A Markov-modulated Bernoulli process is a generalization of a Bernoulli process in which the success probability evolves over time according to a Markov chain. It has been widely applied in various disciplines for modeling and analysis of systems in random environments. This paper focuses on providing analytical characterizations of the Markovmodulated Bernoulli process by introducing key metrics, including success period, failure period, and cycle. We derive expressions for the distributions and the moments of these metrics in terms of the model parameters.