• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.5
• /
• pp.27-37
• /
• 2012

Even thought the firefighters have to hurry to the scene to extinguish the blaze, the fire engines could not rushed out due to the worst of traffic condition. Traffic signal control is one of the most important methods to minimize the fire engines's travel time. The focus of this paper is to develop a traffic control strategy, which is emergency vehicle preemption algorithm considering pedestrian in order to reduce travel time of emergency vehicle. This algorithm also includes recovering strategy after preemption signal to minimize the other vehicle's delay. In order to estimate the effectiveness of traffic control, traffic simulation was performed using VISSIM micro simulation tool for two different kinds of networks, which were non-coordinated corridor and coordinated corridor. The differences of travel time and average delay between emergency vehicle and ordinary vehicle were respectively estimated under pre-existed pretimed signal and preemption traffic control at two respective networks. The results of the simulation for the emergency vehicle, travel time was reduced to 36.8~43.3% under "Add or Subtract" method whereas it was reduced to 30.7~46.0% under "Dwell" method. In addition, in non-coordinated corridor case of ordinary vehicle, average control delay of "Dwell" method was increased 33.5% whereas it grew 0.5% under coordinated corridor. And "Add or Subtract" method was confirmed that average control delay of ordinary vehicle was increased 0.7% under non-coordinated corridor whereas it swelled 4.5% under coordinated corridor.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.3_4
• /
• pp.204-212
• /
• 2004

Existing distributed systems have higher probability of failures occurrence than stand-alone system, so many fault tolerant techniques have been developed. Because of insufficient storage resulting from the increased fault tolerance information stored, the performance of system has been degraded. To avoid performance degradation, it needs delete useless fault tolerance information. In this paper, we propose a garbage collection algorithm for fault tolerance information. And we define and design the garbage collection agent for garbage collection of fault tolerance information, the information agent for management of fault tolerant data, and the facilitator agent for communication between agents. Also, we propose the garbage collection algorithm using the garbage collection agent. For rollback recovery, we use independent checkpointing protocol and sender based pessimistic message logging protocol. In our proposed garbage collection algorithm, the garbage collection, information, and facilitator agent is created with process, and the information agent constructs domain knowledge with its checkpoints and non-determistic events. And the garbage collection agent decides garbage collection time, and it deletes useless fault tolerance information in cooperation with the information and facilitator agent. For propriety of proposed garbage collection technique using agents, we compare domain knowledge of system that performs garbage collection after rollback recovery and domain knowledge of system that doesn't perform garbage collection.

• The KIPS Transactions:PartA
• /
• v.13A no.1 s.98
• /
• pp.71-78
• /
• 2006

For using XML data in programming languages, there is a data binding method, which generates classes from XML type definitions. However, since existing binding frameworks for this method generate all classes for element definitions, the number of generated classes becomes large and the complexity of the overall application system gets high. In this research, we propose an inline binding method for selecting necessary classes from element definitions. In the proposed method, classes are created only for elements with repetitions and recursions, and they include fields for values of terminal elements. We introduce a generation algorithm for binding classes and the marshaling methods for recovering the omitted paths. We develop IBinder system to validate the proposed method and compare the generated codes with the ones of existing systems. As a result, we carl show that the number of generated classes decrease substantially compared to other systems.

• Journal of KIISE:Computer Systems and Theory
• /
• v.35 no.5
• /
• pp.187-198
• /
• 2008

This paper develops a framework for efficient resource management within the grid service environment. Resource management is the core element of the grid service; therefore, GridRMF(Grid Resource Management Framework) is modeled and developed in order to respond to such variable characteristics of resources as accordingly as possible. GridRMF uses the participation level of grid resource as a basis of its hierarchical management. This hierarchical management divides managing domains into two parts: VMS(Virtual Organization Management System) for virtual organization management and RMS(Resource Management System) for metadata management. VMS mediates resources according to optimal virtual organization selection mechanism, and responds to malfunctions of the virtual organization by LRM(Local Resource Manager) automatic recovery mechanism. RMS, on the other hand, responds to load balance and fault by applying resource status monitoring information into adaptive performance-based task allocation algorithm.

• Journal of KIISE:Computer Systems and Theory
• /
• v.31 no.12
• /
• pp.692-703
• /
• 2004

Communication induced checkpointing (CIC) is one of the checkpointing techniques to provide fault tolerance for distributed systems. Independent checkpoints that each distributed process produces without coordination are likely to be useless. Useless checkpoints, which cannot belong to any consistent global checkpoint sets, induce nondeterminant rollback. To prevent the useless checkpoints, CIC forces processes to take additional checkpoints at proper moment. The number of those forced checkpoints is the main source of failure-free overhead in CIC. In this paper, we present two new CIC protocols which satisfy 'No Z-Cycle (NZC)'property. The proposed protocols reduce the number of forced checkpoints compared to the existing protocols with the drawback of the increase in message delay. Our simulation results with the synthetic data show that the proposed protocols have lower failure-free overhead than the existing protocols. Additionally, we show that the classical 'index-based checkpointing' protocols are inefficient in constructing the consistent global cut in distributed executions.

• Journal of Dental Rehabilitation and Applied Science
• /
• v.38 no.4
• /
• pp.196-203
• /
• 2022

Purpose: This study aimed to evaluate the accuracy and clinical usability of an identification model using deep learning for 79 dental implant types. Materials and Methods: A total of 45396 implant fixture images were collected through panoramic radiographs of patients who received implant treatment from 2001 to 2020 at 30 dental clinics. The collected implant images were 79 types from 18 manufacturers. EfficientNet and Meta Pseudo Labels algorithms were used. For EfficientNet, EfficientNet-B0 and EfficientNet-B4 were used as submodels. For Meta Pseudo Labels, two models were applied according to the widen factor. Top 1 accuracy was measured for EfficientNet and top 1 and top 5 accuracy for Meta Pseudo Labels were measured. Results: EfficientNet-B0 and EfficientNet-B4 showed top 1 accuracy of 89.4. Meta Pseudo Labels 1 showed top 1 accuracy of 87.96, and Meta pseudo labels 2 with increased widen factor showed 88.35. In Top5 Accuracy, the score of Meta Pseudo Labels 1 was 97.90, which was 0.11% higher than 97.79 of Meta Pseudo Labels 2. Conclusion: All four deep learning algorithms used for implant identification in this study showed close to 90% accuracy. In order to increase the clinical applicability of deep learning for implant identification, it will be necessary to collect a wider amount of data and develop a fine-tuned algorithm for implant identification.

• Journal of Internet Computing and Services
• /
• v.1 no.2
• /
• pp.1-10
• /
• 2000

ATM network technology is generally used for the solution of integrating multimedia service in high-speed Internet. In Internet protocol based on ATM services, If single cell is lost in ATM layer, the entire TCP packet will be lost. Therefore, TCP performance will be degraded. In order to reduce cell loss, when congestion occur, UBR+EPD mechanism is proposed to improve the throughput in TCP over UBR, and ER scheme is suggested in TCP over ABR. In this paper, we analyzed the performance improvement effect of UBR+EPD with FRR (Fast Retransmission and Recovery), the adjusting EPD threshold parameter (R), and variation of MTU (Maximum Transport Unit) size. As a result, through the analysis of performance, we know that the improved throughput and fairness are shown by the proposed scheme.