• 산업기술연구
• /
• 제21권B호
• /
• pp.85-89
• /
• 2001

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. The probability that an MT is j rings away from the center cell is obtained by computer programming. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.

• 대한전자공학회:학술대회논문집
• /
• 대한전자공학회 2003년도 하계종합학술대회 논문집 I
• /
• pp.169-173
• /
• 2003

In this paper, we analyze a time-based update method in location management and calculate the optimal time-interval. We obtain the probability that an MT is j rings away from the center cell. And using these values, an exact analysis is made for the time-based location management cost. From the result, when the time-based method is applied to location update, we can get the optimal time-interval which minimizes the location management cost.

• 대한간호학회지
• /
• 제42권5호
• /
• pp.730-737
• /
• 2012

Purpose: This study was done to identify the time interval to pressure ulcer and to determine the optimal time interval for position change depending on pressure ulcer risk in patients using foam mattress in intensive care units. Methods: The Braden scale score, occurrence of pressure ulcers and position change intervals were assessed with 56 patients admitted to an intensive care unit from April to November, 2011. The time to pressure ulcer occurrence by Braden scale risk group was analyzed with Kaplan-Meier survival analysis and log rank test. Then, the optimal time interval for position change was calculated with ROC curve. Results: The median time to pressure ulcer occurrence was 5 hours at mild or moderate risk, 3.5 hours at high risk and 3 hours at very high risk on the Braden scale. The optimal time interval for position change was 3 hours at mild and moderate risk, 2 hours at high and very high risk of Braden scale. Conclusion: When foam mattresses are used a slight extension of the time interval for position change can be considered for the patients with mild or moderate pressure ulcer risk but not for patients with high or very high pressure ulcer risk by Braden scale.

• Management Science and Financial Engineering
• /
• 제10권1호
• /
• pp.53-75
• /
• 2004

Most existing studies on time-dependent networks have been focused on finding a minimum delay path given a departure time at the origin. There, however, frequently happens a situation where users can select any departure time in a certain time interval and want to spend as little time as possible on traveling the networks. In that case. the delay spent on traveling networks depends on not only paths but also the actual departure time at the origin. In this paper, we propose a new problem in time-dependent networks whose objective is to find an optimal departure time given possible departure time interval at the origin. From the optimal departure time, we can obtain a path with minimum delay among all paths for possible departure times at the origin. In addition, we present an algorithm for finding an optimal departure time by enumerating trees which remain shortest path tree for a certain time interval.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• 제10권8호
• /
• pp.3689-3700
• /
• 2016

It is not practically feasible to apply hardware-based fault-tolerant schemes, such as hardware replication, in mobile devices. Therefore, software-based fault-tolerance techniques, such as checkpoint and rollback schemes, are required. In checkpoint and rollback schemes, the optimal checkpoint interval should be applied to obtain the best performance. Most previous studies focused on minimizing the expected execution time or response time for completing a given task. Currently, most mobile applications run in real-time environments. Therefore, it is extremely essential for mobile devices to employ optimal checkpoint intervals as determined by the real-time constraints of tasks. In this study, we tackle the problem of determining the optimal inter-checkpoint interval of checkpoint and rollback schemes to maximize the deadline meet ratio in real-time systems and to build a probabilistic cost model. From this cost model, we can numerically find the optimal checkpoint interval using mathematical tools. The performance of the proposed solution is evaluated using analytical estimates.

• 대한교통학회지
• /
• 제35권1호
• /
• pp.63-78
• /
• 2017

연구는 국도 단속류 구간에서 DSRC로 수집한 개별차량 통행시간의 대푯값 산정 시 신뢰도를 높이는 최적 수집 간격을 결정하는데 목적이 있다. 이를 위하여, 단속류 구간에서 수집되는 가장 대표적인 개별차량 통행시간의 분포인 양봉형태의 비대칭 분포를 따르는 수집데이터를 활용하고 개별차량 통행시간의 수집 간격 크기를 변화시켜 MSE(Mean Square Error)를 추정함으로 오차가 최소가 되는 최적 수집 간격 크기를 결정한다. MSE 산정을 위한 편의 추정식은 비대칭 분포에서도 활용이 가능한 t-분포의 최대 추정 오차식을 활용하였다. 최적 수집 간격 분석을 위한 데이터 수집 간격은 단속류 구간에서 신호정지로 데이터 수집이 정상적으로 결측 되는 1-2분 수집 간격은 제외하고, 3분 이상의 수집 간격만을 대상으로 하였다. 데이터 수집 시 결측을 발생시키는 수집 간격은 결측 데이터 보정처리 과정에서 또 다른 오차를 유발하게 되어 배제하였다. 분석결과 MSE가 최소가 되는 최적 수집 간격은 3-5분이며, 통행시간 증가 시 최적 수집 간격은 3분으로 짧아짐을 확인하였다. 시스템 운영의 효율성과 통행시간 대푯값 산정의 신뢰도 향상을 모두 고려할 때 기본 수집 간격은 기존과 같이 5분으로 운영하고, 정체 시는 3분으로 수집 간격을 줄여 운영하는 것이 효과적일 것으로 사료된다.

• 전기학회논문지
• /
• 제56권6호
• /
• pp.1122-1129
• /
• 2007

For a system with multiple real-time tasks of different deadlines, it is very difficult to find the optimal checkpoint interval because of the complexity in considering the scheduling of tasks. In this paper, we determine the optimal checkpoint interval for multiple real-time tasks that are scheduled by RM(Rate Monotonic) algorithm. Faults are assumed to occur with Poisson distribution. Checkpoints are inserted in the execution of task with equal distance in the same task, but different distances in other tasks. When faults occur, rollback to the latest checkpoint and re-execute task after the checkpoint. We derive the equation of maximum slack time for each task, and determine the number of re-executable checkpoint intervals for fault recovery. The equation to check the schedulibility of tasks is also derived. Based on these equations, we find the probability of all tasks executed within their deadlines successfully. Checkpoint intervals which make the probability maximum is the optimal.

• 전기학회논문지
• /
• 제57권5호
• /
• pp.875-880
• /
• 2008

In this paper, a novel method to determine the optimal checkpoint interval for real-time control task is proposed considering its performance degradation according to tasks's execution time. The control task in this paper has a specific sampling period shorter than its deadline. Control performance is degraded as the control task execution time is prolonged across the sampling period and eventually zero when reached to the deadline. A new performance index is defined to represent the performance variation due to the extension of task execution time accompanying rollback fault recovery. The procedure to find the optimal checkpoint interval is addressed and several simulation examples are presented.

• 대한산업공학회지
• /
• 제15권2호
• /
• pp.87-91
• /
• 1989

A warranty is a contractual obligation incurred by a producer in connection with the sale of a product. The warranty specifies that producer agrees to remedy certain failures in the product sold. There have been many articles dealing with warranties, but they have studied about optimal warranty cost for the warranty period. In this study, an optimal preventive maintenance time interval is computed. The optimal preventive maintenance time interval minimizing warranty cost for the warranty period is discussed. It is assumed that failure rate is increasing and the failure rate after preventive maintenance or corrective maintenance lies between good as new and bad as old.

• 전기학회논문지
• /
• 제60권1호
• /
• pp.193-200
• /
• 2011

This paper presents an optimal checkpoint strategy for fault-tolerance in real-time systems. In our environment, multiple real-time tasks with arbitrary periods are scheduled in the system by Rate Monotonic (RM) algorithm, and checkpoints are inserted at a constant interval in each task while the width of interval is different with respect to the task. We propose a method to determine the optimal checkpoint interval for each task so that the probability of completing all the tasks is maximized. Whenever a fault occurs to a checkpoint interval of a task, the execution time of the task would be prolonged by rollback and re-execution of checkpoints. Our scheme includes the schedulability test to examine whether a task can be completed with an extended execution time. A numerical experiment is conducted to demonstrate the applicability of the proposed scheme.