• Title/Summary/Keyword: service waiting

Search Result 452, Processing Time 0.024 seconds

Development of Left Turn Response System Based on LiDAR for Traffic Signal Control

  • Park, Jeong-In
    • Journal of the Korea Society of Computer and Information
    • /
    • v.27 no.11
    • /
    • pp.181-190
    • /
    • 2022
  • In this paper, we use a LiDAR sensor and an image camera to detect a left-turning waiting vehicle in two ways, unlike the existing image-type or loop-type left-turn detection system, and a left-turn traffic signal corresponding to the waiting length of the left-turning lane. A system that can efficiently assign a system is introduced. For the LiDAR signal transmitted and received by the LiDAR sensor, the left-turn waiting vehicle is detected in real time, and the image by the video camera is analyzed in real time or at regular intervals, thereby reducing unnecessary computational processing and enabling real-time sensitive processing. As a result of performing a performance test for 5 hours every day for one week with an intersection simulation using an actual signal processor, a detection rate of 99.9%, which was improved by 3% to 5% compared to the existing method, was recorded. The advantage is that 99.9% of vehicles waiting to turn left are detected by the LiDAR sensor, and even if an intentional omission of detection occurs, an immediate response is possible through self-correction using the video, so the excessive waiting time of vehicles waiting to turn left is controlled by all lanes in the intersection. was able to guide the flow of traffic smoothly. In addition, when applied to an intersection in the outskirts of which left-turning vehicles are rare, service reliability and efficiency can be improved by reducing unnecessary signal costs.

Waiting Times in the B/G/1 Queue with Server Vacations

  • Noh, Seung-Jong
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.19 no.3
    • /
    • pp.235-241
    • /
    • 1994
  • We consider a B/G/1 queueing with vacations, where the server closes the gate when it begins a vacation. In this system, customers arrive according to a Bernoulli process. The service time and the vacation time follow discrete distributions. We obtain the distribution of the number of customers at a random point in time, and in turn, the distribution of the residence time (queueing time + service time) for a customer. It is observed that solutions for our discret time B/G/1 gated vacation model are analogous to those for the continuous time M/G/1 gated vacation model.

  • PDF

MAP/G/1/K QUEUE WITH MULTIPLE THRESHOLDS ON BUFFER

  • Choi, Doo-Il
    • Communications of the Korean Mathematical Society
    • /
    • v.14 no.3
    • /
    • pp.611-625
    • /
    • 1999
  • We consider ΜΑΡ/G/ 1 finite capacity queue with mul-tiple thresholds on buffer. The arrival of customers follows a Markov-ian arrival process(MAP). The service time of a customer depends on the queue length at service initiation of the customer. By using the embeded Markov chain method and the supplementary variable method, we obtain the queue length distribution ar departure epochs and at arbitrary epochs. This gives the loss probability and the mean waiting time by Little's law. We also give a simple numerical examples to apply the overload control in packetized networks.

  • PDF

A New Local Information Distribution System on Multi-Hop Wireless Networks

  • Koide, Toshio;Watanabe, Hitoshi
    • Proceedings of the IEEK Conference
    • /
    • 2002.07c
    • /
    • pp.1363-1366
    • /
    • 2002
  • The studies of multi-hop wireless networks are active as the new communication media, which does not require any fixed communication infrastructure. One of application of the networks is local information distribution service, which is useful far daily activities in certain geographically restricted region or community within a radius of several kilometers. In this paper, MID-Net, which is the network enabling such distribution service, and effective information distribution algorithm MCMS are proposed. The behavior of the MID-Net is characterized by the waiting time function, three types of the functions are proposed in this paper.

  • PDF

Approximate sojourn time distribution for cyclic service systems and its applications to token passing networks (순환서비스시스템에서의 근사화된 체류시간 분포화 토큰 패싱 네트워크에의 응용)

  • 권욱현;정범진;박홍성
    • 제어로봇시스템학회:학술대회논문집
    • /
    • 1989.10a
    • /
    • pp.524-529
    • /
    • 1989
  • In this paper, an approximate sojourn time distribution is obtained for cyclic service systems. We consider symmetric and limited service systems in which each queue has an infinite capacity. The combined service time is defined which consists of the frame service time and server waiting time that is approximated by two cases of the uniform and exponential distributions. The approximate sojourn time distribution is obtained from the Pollaczek-Khinchine formula where the combined service time is used for the service time in the M/G/I model. And some numerical examples are given to validate the suggested approximate analysis.

  • PDF

Analysis of Customer Arrival Process in an Appointment-Based Service System (예약기반 서비스 시스템에서의 고객 도착 프로세스 분석)

  • Min, Dai-Ki
    • Journal of the Korean Operations Research and Management Science Society
    • /
    • v.37 no.2
    • /
    • pp.31-43
    • /
    • 2012
  • Delivery of a good quality of service in an efficient manner requires matching the supply of capacity with customer demand. Much research has employed queueing models that analyzed the service system on the basis of independent and stationary customer arrivals. However, the appointment system, which is widely used to facilitate customer access to service in many industries including healthcare, has significant influence on the customer arrival process so that the independent and stationary assumption does not hold in an appointment-based service system. In this regard, this paper aims to propose a model for accurate illustration of the appointment-based customer arrival process. The use of the proposed model allows us to evaluate the overall system performance such as mean waiting time and service level under various appointment policies instead of conducting simulation studies.

Utilization Status of Emergency Medical Service for Children (아동의 응급의료서비스 이용실태)

  • Jeon, Hye-Jin;Kim, So-Sun;Bae, Hyun-A;Yoo, Il-Young
    • Child Health Nursing Research
    • /
    • v.14 no.1
    • /
    • pp.5-13
    • /
    • 2008
  • Purpose: This study was done to describe utilization status of emergency medical service for children at one university affiliated hospital located in Seoul. Data were obtained from the medical records of patients under 13 years of age who visited the ER from January 1 to December 31, 2006. Method: Medical records missing the time of discharge were excluded in the analysis of waiting time, which resulted in 19,766 cases. Data were analyzed using SPSS WIN 14.0 version. Result: There were slightly more boys (58.4%), average age of the children was 3.97 years of age. More children at the aged 1 to 3 years (51.3%) visited the ER. Fever was the most frequent complaint: 5,180 cases (24.38%). The other complaints were head or facial laceration (10.55%), vomiting (9.63%), abdominal pain (8.06%), cough (7.67%), and painful limb swelling (6.34%). Average waiting time before the first medical examination was 17 minutes, and average ER stay time was 3 hours and 23 minutes. Conclusion: The results suggest the need to assign a nurse specialist for pediatric ER to provide more efficient care for the children. Also, extra staff assignment during the evening shift or extending office hours of local pediatricians should be considered.

  • PDF

Effective Broadcasting and Caching Technique for Video on Demand over Wireless Network

  • Alomari, Saleh Ali;Sumari, Putra
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • v.6 no.3
    • /
    • pp.919-940
    • /
    • 2012
  • Video on Demand (VOD) is a multimedia service which allows a remote user to select and then view video at his convenience at any time he wants, which makes the VOD become an important technology for many applications. Numerous periodic VOD broadcasting protocols have been proposed to support a large number of receivers. Broadcasting is an efficient transmission scheme to provide on-demand service for very popular movies. This paper proposes a new broadcasting scheme called Popularity Cushion Staggered Broadcasting (PCSB). The proposed scheme improves the Periodic Broadcasting (PB) protocols in the latest mobile VOD system, which is called MobiVoD system. It also, reduces the maximum waiting time of the mobile node, by partitioning the $1^{st}$ segment of the whole video and storing it in the Local Media Forwarder (LMF) exactly in the Pool of RAM (PoR), and then transmitting them when the mobile nodes miss the $1^{st}$ broadcasted segment. The results show that the PCSB is more efficient and better than the all types of broadcasting and caching techniques in the MobiVoD system. Furthermore, these results exhibits that system performance is stable under high dynamics of the system and the viewer's waiting time are less than the previous system.

A Study of Recognition and Acceptance on Pharmacists for the Enforcement of Drug Utilization Review (처방조제지원시스템 시행에 따른 약사의 인지도 및 수용성에 대한 조사)

  • Choi, Byung-Chul
    • YAKHAK HOEJI
    • /
    • v.53 no.6
    • /
    • pp.368-376
    • /
    • 2009
  • DUR (Drug Utilization Review) originally referred to the evaluation of drug usage details: however DUR refers to the system used to support the services of prescribing and dispensing through linking from Health Insurance Review and Assessment (HIRA) Service in Korea. HIRA is going to begin the DUR enforcement for extending to nationwide coverage after pilot test. Objectives: The aims for this study were to evaluate and clarify the current opinions of the pharmacists for the recognition and acceptance rates before nationwide coverage concerning DUR system. Methods: A 16-question-questionnaire was developed and pilot tested. For 40 days of survey by both on-line and fax paper, it was carried out on 80 pharmacists working at community pharmacy in Goyang-si, Gyeonggi-do. Results: Most of answers were broadly positive and interested in begining the DUR system and kept in mind that the goal of DUR is safety guarantee for people. On the other hand, most of answerers worry that delay of patient waiting time and inharmonious communication with doctors in DUR processing can be a major obstacle to begin the DUR system. Conclusion: To solve several problems, the most important things are to make good reciprocal relationships between doctors and pharmacists, investigate intervention tool to shorten patient waiting time, and activate educational program of inspecting items for the pharmacists.

Vehicle Routing for Maximizing Interlibrary-Loan Requests under Time Constraints (상호대차 요청 도서 운송량 최대화를 위한 차량 이동 방법 연구)

  • Lim, Heejong;Lee, Sangbok;Park, Sungjae
    • Journal of the Korean Society for Library and Information Science
    • /
    • v.51 no.2
    • /
    • pp.237-253
    • /
    • 2017
  • There are many systematic approaches to manage Interlibrary loan (ILL) efficiently. In this paper, we propose an operating method reducing user-waiting in ILL. Users are usually informed to wait around two to three days in a regional ILL service. The reason of the waiting is that there is inefficiency in running material-delivery vehicles. A mixed integer programming is employed to resolve this issue. It provides an optimal vehicle-route maximizing material-deliveries subject to time availability. We used an actual data of a regional ILL system to provide optimal vehicle routes under different time settings.