• Journal of KIISE:Computer Systems and Theory
• /
• v.26 no.10
• /
• pp.1264-1274
• /
• 1999

본 논문에서는 분산된 클록들을 주기적으로 동기화 시키는 분산 실시간 시스템에서 시간적 제약을 만족시키기 위한 정적/동적 시간 제약(timing constraint) 변환 기법을 제안한다. 전형적인 이산클록동기화(discrete clock synchronization) 알고리즘은 클록의 값을 순간적으로 조정하여 클록의 시간이 불연속적으로 진행한다. 이러한 시간상의 불연속성은 시간적 이벤트를 잃어버리거나 다시 발생시키는 오류를 범하게 한다.클록 시간의 불연속성을 피하기 위해 일반적으로 연속클록동기화(continuous clock synchronization) 기법이 제안되고 있지만 소프트웨어적으로 구현되면 많은 오버헤드를 유발시키는 문제점이 있다. 본 논문에서는 시간적 제약을 동적으로 변환시키는 DCT (Dynamic Constraint Transformation) 기법을 제안하였으며, 이를 통해 기존의 이산클록동기화 알고리즘을 수정하지 않고서도 클록 시간의 불연속성에 의한 문제점들을 해결할 수 있도록 하였다. 아울러 DCT에 의해 이산클록동기화 하에서 생성된 태스크 스케쥴이 연속클록동기화에 의해 생성된 스케쥴과 동일함을 증명하여 DCT의 동작이 이론적으로 정확함을 증명하였다.또한 분산 실시간 시스템에서 지역 클록(local clock)이 기준 클록과 완벽하게 일치하지 않아서 발생하는 스케쥴링상의 문제점을 다루었다. 이를 위해 먼저 두 가지의 스케쥴링 가능성, 지역적 스케쥴링 가능성(local schedulability)과 전역적 스케쥴링 가능성(global schedulability)을 정의하고, 이를 위해 시간적 제약을 정적으로 변환시키는 SCT (Static Constraint Transformation) 기법을 제안하였다. SCT를 통해 지역적으로 스케쥴링 가능한 태스크는 전역적으로 스케쥴링이 가능하므로, 단지 지역적 스케쥴링 가능성만을 검사하면 스케쥴링 문제를 해결할 수 있도록 하였고 이를 수학적으로 증명하였다.Abstract In this paper, we present static and dynamic constraint transformation techniques for ensuring timing requirements in a distributed real-time system possessing periodically synchronized distributed local clocks. Traditional discrete clock synchronization algorithms that adjust local clocks instantaneously yield time discontinuities. Such time discontinuities lead to the loss or the gain of events, thus raising serious run-time faults.While continuous clock synchronization is generally suggested to avoid the time discontinuity problem, it incurs too much run-time overhead to be implemented in software. We propose a dynamic constraint transformation (DCT) technique which can solve the problem without modifying discrete clock synchronization algorithms. We formally prove the correctness of the DCT by showing that the DCT with discrete clock synchronization generates the same task schedule as the continuous clock synchronization.We also investigate schedulability problems that arise when imperfect local clocks are used in distributed real-time systems. We first define two notions of schedulability, global schedulability and local schedulability, and then present a static constraint transformation (SCT) technique. The SCT ensures that it is sufficient to check the schedulability of a task locally in a node with a local clock, since the global schedulability of the task is derived from its local schedulability through SCT. We formally prove the correctness of SCT.

• The Journal of Korean Society for Radiation Therapy
• /
• v.31 no.2
• /
• pp.13-24
• /
• 2019

Purpose: CT scan range is insufficient for various reasons in head and neck Tomotherapy^®. To solve that problem, Re-CT simulation is good because CT scan range affects accurate dose calculations, but there are problems such as increased exposure dose, inconvenience, and a change in treatment schedule. We would like to evaluate the minimum CT scan range required by changing the plan setup parameter of the existing CT scan range. Materials and methods: CT Simulator(Discovery CT590 RT, GE, USA) and In House Head & Neck Phantom are used, CT image was acquired by increasing the image range from 0.25cm to 3.0cm at the end of the target. The target and normal organs were registered in the Head & Neck Phantom and the treatment plan was designed using ACCURAY Precision^®. Prescription doses are Daily 2.2Gy, 27 Fxs, Total Dose 59.4Gy. Target is designed to 95%~107% of prescription dose and normal organ dose is designed according to SMC Protocol. Under the same treatment plan conditions, Treatment plans were designed by using five methods(Fixed-1cm, Fixed-2.5cm, Fixed-5cm, Dynamic-2.5cm Dynamic-5cm) and two pitches(0.43, 0.287). The accuracy of dose delivery for each treatment plan was analyzed by using EBT3 film and RIT(Complete Version 6.7, RIT, USA). Results: The accurate treatment plan that satisfying the prescribed dose of Target and the tolerance dose in normal organs(SMC Protocol) require scan range of at least 0.25cm for Fixed-1cm, 0.75cm for Fixed-2.5cm, 1cm for Dynamic-2.5cm, and 1.75cm for Fixed-5cm and Dynamic-5cm. As a result of AnalysisAnalysis by RIT. The accuracy of dose delivery was less than 3% error in the treatment plan that satisfied the SMC Protocol. Conclusion: In case of insufficient CT scan range in head and neck Tomotherapy^®, It was possible to make an accurate treatment plan by adjusting the FW among the setup parameter. If the parameter recommended by this author is applied according to CT scan range and is decide whether to re-CT or not, the efficiency of the task and the exposure dose of the patient are reduced.

• Spatial Information Research
• /
• v.20 no.3
• /
• pp.83-93
• /
• 2012

Recent environmental concerns have made interest in environment-friendly transportation means such as walking, biking, and public transportation. However, since it is difficult to move long distance by walking or biking, their scope of application is rather limited. On the other hand, public transportation can solve traffic congestion, a recent social issue, though its usability may depend on its time schedule. Currently available information services on public transportation in the Web do not reflect well such traits of the public transportation; thus, in some cases, they may provide wrong information to end users. To solve such problems and provide information based on timetable of public transportations, this paper proposes a STP(Space Time Point) data model. Unlike existing space-time data models, this model recognizes the bottommost element of an object as a point and structures these points in hierarchical way to define an object. In particular, It can make it possible to implement a variety of dynamic spatial objects changing object information according to time. An objective of this study is to design a STP model for bus and subway based on timetables of public transportation in Daejeon area and builds a system to provide path navigation. With the designed navigation function, a path from the Daejeon National Cemetery to Hannam University was searched by time slot. The result showed that the system provided different paths by time, as the system guided different paths when bus operation was limited in midnight. As existing data model could not provide such results, it is confirmed that the system can provide path navigation based on real-time traffic information. It is expected that based on such functionality, it is possible to provide additional functionalities by applying diverse data models such as real-time transport information or traffic history information.

• Journal of the Korean Institute of Illuminating and Electrical Installation Engineers
• /
• v.21 no.1
• /
• pp.42-51
• /
• 2007

An AC electrical railroad system has rapidly changing dynamic single-phase load, and at a feeding substation, three-phase electric power is transformed to the paired directional single-phase electric power. There is a great difference in electrical phenomenon between the load of AC electrical railroad system and that of general power system. Electric characteristics of AC electrical railroad's trainload are changed continuously according to the traction, operating characteristic, operating schedule, track slope, etc. Because of the long feeding distance of the dynamic trainload, power quality problems such as voltage drop, voltage imbalance and harmonic distortion my also occur to AC electrical railroad system. These problems affect not only power system stability, but also power quality deterioration in AC electrical railroad system. The dynamic simulation model of AC electrical railroad system presented by PSCAD/EMTDC is modeled in this paper, andthen, it is analyzed voltage drop for AC electrical railroad system both with single-phase distributed STATCOM(Static Synchronous Compensator) installed at SP(Sectioning Post) and without.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.51 no.11
• /
• pp.11-18
• /
• 2014

Most of the energy efficient MAC protocols for wireless sensor networks (WSNs) are based on duty cycling in a single channel and show competitive performances in a small number of traffic flows; however, under concurrent multiple flows, they result in significant performance degradation due to contention and collision. We propose a multi-channel pipelining (MCP) method for convergecast WSN in order to address these problems. In MCP, a staggered dynamic phase shift (SDPS) algorithms devised to minimize end-to-end latency by dynamically staggering wake-up schedule of nodes on a multi-hop path. Also, a phase-locking identification (PLI) algorithm is proposed to optimize energy efficiency. Based on these algorithms, multiple flows can be dynamically pipelined in one of multiple channels and successively handled by sink switched to each channel. We present an analytical model to compute the duty cycle and the latency of MCP and validate the model by simulation. Simulation evaluation shows that our proposal is superior to existing protocols: X-MAC and DPS-MAC in terms of duty cycle, end-to-end latency, delivery ratio, and aggregate throughput.

• Proceedings of the Korean Institute of Navigation and Port Research Conference
• /
• 2007.12a
• /
• pp.337-339
• /
• 2007

The productivity of container terminal is usually regarded same as the productivity of quay crane. Operation of quay crane for the export is started from picking up a container in yard block. In doing so, smooth flow of container is vital to maximize the productivity of quay crane. Improvement of quay crane's productivity means improvement of entire productivity in container terminal, which reinforces the competitiveness of terminal consequently. Setting effective plan is essential to improve work flow from yard to quay crane. For optimal plan, it is necessary to gather information about exact time schedule of come-and-go containers for loading, amount of containers that will be come to terminal. Generally, the arrival time of containers and the amount of containers are definite and predictable. However, in the case of export container, the arrival time of containers is random and unpredictable. This study examines the pattern of coming-in containers as time goes in container yard and provides the solution to how to plan export yard considering the change of state in terminal and adapt it to container yard plan

• Journal of KIISE
• /
• v.45 no.2
• /
• pp.141-149
• /
• 2018

Nowadays, mobile computing has become a common computing paradigm that provides convenience to people's daily life. More and more useful mobile applications' appearance makes it possible for a user to manage personal schedule, enjoy entertainment, and do many useful activities. However, there are some inherent defects in a mobile device that battery constraints and bandwidth limitations. These drawbacks get a user into troubles when to run computationally intensive applications. As a remedy scheme, component offloading makes room for handling mentioned issues via migrating computationally intensive component to the cloud server. In this paper, we will present the predictive offloading method for efficient mobile cloud computing. At last, we will present experiment result for validating applicability and practicability of our proposal.

• Asia pacific journal of information systems
• /
• v.12 no.4
• /
• pp.193-213
• /
• 2002

The sales activity of most of small manufacturing companies is based on orders of buyers. The process of promotion, negotiation, receipt and selection of orders of the manufacturers is closely coupled with the load status of the production lines. The decision on whether to accept an order or not, or the selection of optimal order set among excessive orders is entirely dependent on the schedule of production lines. However, in the real world, since the production scheduling activity is mainly performed by human experts, most of small manufacturers are suffer from being unable to meet due dates, lack of rapid decision on the acceptance of new order. Recently, Internet based Electronic Commerce is recognized as one of the alternatives for strengthening sales power of small and medium companies. However, small and medium manufacturers can't adjust properly to the new environment because they are in short of money, personnel, and technology. To cope with this problem, this paper deals with development of part sales agent coupled with virtual manufacturing in Internet environment that consist of selection agent, advertisement agent, selection agent, negotiation agent, and virtual manufacturing system. This paper develops a time-bounded negotiation mechanism for small and medium manufacturers in agent-based automated negotiation between customers and negotiation agents. Furthermore, to select optimal order set maximized profit, we first formulate the order selection problem with mixed integer programming, but the computation time of IP is not acceptable for real world scale problem. To overcome this problem and dynamic nature of virtual manufacturing, we suggest a genetic algorithm approach, which shows a reasonable computation time for real world case and good incremental problem solving capability.

• KIISE Transactions on Computing Practices
• /
• v.23 no.1
• /
• pp.65-73
• /
• 2017

Advances in Internet of Things Technology lead to the increasing number of daily-life things that are interconnected over the Internet. Also, several smart services are being developed by utilizing the connected things. Among the daily-life things surrounding user, the mirror can supports broad range of functionality and expandable service as it plays various roles in daily-life. Recently, various smart mirrors have been launched in certain places where people with specific goals and interests meet. However, most mirrors give the user limited information. Therefore, we designed and implemented a smart mirror that can support customized service. The proposed smart mirror utilizes information provided by other existing internet services to give user dynamic information as real_time traffic information, news, schedule, weather, etc. It also supports recommendation service based on user usage information.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.6
• /
• pp.1678-1685
• /
• 1999

In most of the existing real-time schedulers producing the total value as large as possible, the service times for all schedulable tasks are computed at each time a new task arrives. If all scheduled tasks would be executed completely before a new task arrives, the schedule may produce the greatest total value. But this is not always true in real situations. In many cases, (a) new tasks arrive(s) before all the scheduled tasks are executed completely. In this paper, we propose a unique scheduling algorithm for real-time tasks. The proposed algorithm determines the service times only for some tasks with earlier deadlines while the existing algorithms determine the service times for all tasks. This partial computation decreases the average scheduling complexity ramatically, even though, in the worst case, the complexity of the proposed algorithm becomes O(N2), which is equal to that of a previous algorithm that has been known as a less complicated one.