Web-Based Online Queue Design at Puskesmas Siak Hulu I Kabupaten Kampar-Riau

Increasing patient satisfaction in this case, especially Puskesmas as the government agency that provides health services for the community, will certainly have an impact on the quality of service from the Puskesmas Itself. One of them with an efficient queuing system. A good queue will support regularity in an agency. Previously, analysis and calculation of queuing time had been carried out using the Kolgomorov-Smirnov compatibility test at the Puskesmas Siak Hulu I Kabupaten Kampar- Riau, and the results obtained an average of six working hours of patient care. This research is a pilot project that was carried out as a form of increasing effectiveness and efficiency in Puskesmas. The research has been completed and the results are the basis for this research and further research. The purpose of the current research is to make an online queuing system design, where later the results of this design are used to create a web-based online queuing system. The design is adapted to the existing queuing model at the Puskesmas, namely the Sigle Channel-Multi Steps queuing model. System development using System Development Life Cycle (SDLC) consisting of, analysis, design, implementation, and maintenance. The design phase is carried out in three stages, namely conceptual modeling, database design, and interface design. The design starts from making the proposed Rich-Picture, then carries out the predetermined design stages. With this design, it is hoped that in the future it will facilitate the process of developing a web-based online queuing system.

Queuing Theory of Improved Practical Byzantine Fault Tolerant Consensus

In recent years, the use of consensus mechanism to maintain the security of blockchain system has become a considerable concern of the community. Delegated proof of stake (DPoS) and practical Byzantine fault tolerant (PBFT) consensus mechanisms are key technologies in maintaining the security of blockchain system. First, this study proposes a consensus mechanism combining DPoS and PBFT, which can rapidly deal with malicious witness nodes and shorten the time of block verification. Second, the M/PH/1 queuing model is used to analyze the performance of the proposed consensus mechanism, and the performance of the improved practical Byzantine fault tolerant consensus mechanism is evaluated from steady-state conditions and key performance measure of the system. Third, the current study uses the theoretical method of open (Jackson) queuing network, combined with the blockchain consensus process, and provides theoretical analysis with special cases. Lastly, this research utilizes numerical examples to verify the computability of the theoretical results. The analytic method is expected to open a series of potentially promising research in queueing theory of blockchain systems.

Specifications of a queuing model-driven decision support system for predicting the healthcare performance indicators pertaining to the patients flow

This article has developed specifications for a new model-driven decision support system (DSS) that aids the key stakeholders of public hospitals in estimating and tracking a set of crucial performance indicators pertaining to the patients flow. The developed specifications have considered several requirements for ensuring an effective system, including tracking the performance indicator on the level of the entire patients flow system, paying attention to the dynamic change of the values of the indicator’s parameters, and considering the heterogeneity of the patients. According to these requirements, the major components of the proposed system, which include a comprehensive object-based queuing model and an object-oriented database, have been specified. In addition to these components, the system comprises the equations that produce the required predictions. From the system output perspective, these predictions act as a foundation for evaluating the performance indicators as well as developing policies for managing the patients flow in the public hospitals.

ANALISIS METODE BAYESIAN PADA SISTEM ANTREAN RAWAT JALAN DI RSUP Dr. KARIADI DENGAN DISTRIBUSI SAMPEL POISSON DAN GEOMETRIK

Hospital service facilities cannot be separated from queuing events. Queues are an unavoidable part of life, but they can be minimized with a good system. The purpose of this study was to find out how the queuing system at Dr. Kariadi. Bayesian method is used to combine previous research and this research in order to obtain new information. The sample distribution and prior distribution obtained from previous studies are combined with the sample likelihood function to obtain a posterior distribution. After calculating the posterior distribution, it was found that the queuing model in the outpatient installation at Dr. Kariadi Semarang is (G/G/c): (GD/∞/∞) where each polyclinic has met steady state conditions and the level of busyness is greater than the unemployment rate so that the queuing system at Dr. Kariadi is categorized as good, except in internal medicine poly.

Studying the appointment scheduling window considering patient no-show behavior in one public and one private outpatient clinics

Purpose This study is carried out in one public and one private health-care centers based on different probabilities of patient’s no-show rate. The present study aims to determine the optimal queuing system capacity so that the expected total cost is minimized. Design/methodology/approach In this study an M/M/1/K queuing model is used for analytical properties of optimal queuing system capacity and appointment window so that total costs of these cases could be minimized. MATLAB software version R2014a is used to code the model. Findings In this paper, the optimal queuing system capacity is determined based on the changes in effective parameters, followed by a sensitivity analysis. Total cost in public center includes the costs of patient waiting time and rejection. However, the total cost in private center includes costs of physician idle time plus costs of public center. At the end, the results for public and private centers are compared to reach a final assessment. Originality/value Today, determining the optimal queuing system capacity is one of the most central concerns of outpatient clinics. The large capacity of the queuing system leads to an increase in the patient’s waiting-time cost, and on the other hand, a small queuing system will increase the cost of patient’s rejection. The approach suggested in this paper attempts to deal with this mentioned concern.

On the Price of Anarchy for Flows over Time

Dynamic network flows, or network flows over time, constitute an important model for real-world situations in which steady states are unusual, such as urban traffic and the internet. These applications immediately raise the issue of analyzing dynamic network flows from a game-theoretic perspective. In this paper, we study dynamic equilibria in the deterministic fluid queuing model in single-source, single-sink networks—arguably the most basic model for flows over time. In the last decade, we have witnessed significant developments in the theoretical understanding of the model. However, several fundamental questions remain open. One of the most prominent ones concerns the price of anarchy, measured as the worst-case ratio between the minimum time required to route a given amount of flow from the source to the sink and the time a dynamic equilibrium takes to perform the same task. Our main result states that, if we could reduce the inflow of the network in a dynamic equilibrium, then the price of anarchy is bounded by a factor, parameterized by the longest path length that converges to [Formula: see text], and this is tight. This significantly extends a result by Bhaskar et al. (SODA 2011). Furthermore, our methods allow us to determine that the price of anarchy in parallel-link and parallel-path networks is exactly 4/3. Finally, we argue that, if a certain, very natural, monotonicity conjecture holds, the price of anarchy in the general case is exactly [Formula: see text].

A MAC Layer Protocol For Smart Indoor Inventory Management System

The indoor inventory system is gaining more research attention and commercial value with the development of IoT. In this thesis, we presented the design of a MAC protocol that allows synchronized transmission of location and sensing data in a wireless positioning and sensor network for an indoor inventory system. The network supports real-life industrial applications and provides a highly specific positioning method.<div>In the network, mobile sensing tags are connected to smart readers that performs localization of tags and gathers sensing data from the tags. The readers are connected to the back-end cloud. The proposed MAC serves multiple classes of mobile tags with different priorities and latency requirements. These tags transmit critical, position and sensing data with different QoS requirements. The proposed MAC is a hybrid MAC that offers contention-based period for tag discovery and scheduled period for the transmission of sensing data with guaranteed latency. We conducted simulation to evaluate the performance of different methods of discovery process and their impact on latency assurance. We also developed a queuing model to analyze the relationship between parameters, acquiring parameters through experiment, and calculation of boundary values.<br></div><div>Simulation using MatLabTM software suggests that the joining period in design can increase the transmission success rate of high priority messages at the cost of a slight increment in the delay of low priority messages. Preliminary analysis suggests that by adaptively allocating the channel resources of the network to three types of tags, service efficiency can be improved. This result also guides the direction for further improvement.<br></div><div>We explored the performance of two options considered currently, which is selecting the discovery process according to modulo result of unique 16-bit tag ID and random select of an available discovery process. In the current environment where each tag does not have any information about other tags inside the network, the two methods have the same effect on avoiding collisions that could happen in a single discovery cycle.<br></div><div>The proposed MAC layer protocol can provide the best service when the available discovery process in the discovery cycle is for initialization and resetting. For an emergency, the joining period designs can still ensure a success rate for critical messages to be over 90%. Hence, the simulation results indicate the joining period method is able to improve MAC-layer performance.</div><div> <br></div>

A MAC Layer Protocol For Smart Indoor Inventory Management System

The indoor inventory system is gaining more research attention and commercial value with the development of IoT. In this thesis, we presented the design of a MAC protocol that allows synchronized transmission of location and sensing data in a wireless positioning and sensor network for an indoor inventory system. The network supports real-life industrial applications and provides a highly specific positioning method.<div>In the network, mobile sensing tags are connected to smart readers that performs localization of tags and gathers sensing data from the tags. The readers are connected to the back-end cloud. The proposed MAC serves multiple classes of mobile tags with different priorities and latency requirements. These tags transmit critical, position and sensing data with different QoS requirements. The proposed MAC is a hybrid MAC that offers contention-based period for tag discovery and scheduled period for the transmission of sensing data with guaranteed latency. We conducted simulation to evaluate the performance of different methods of discovery process and their impact on latency assurance. We also developed a queuing model to analyze the relationship between parameters, acquiring parameters through experiment, and calculation of boundary values.<br></div><div>Simulation using MatLabTM software suggests that the joining period in design can increase the transmission success rate of high priority messages at the cost of a slight increment in the delay of low priority messages. Preliminary analysis suggests that by adaptively allocating the channel resources of the network to three types of tags, service efficiency can be improved. This result also guides the direction for further improvement.<br></div><div>We explored the performance of two options considered currently, which is selecting the discovery process according to modulo result of unique 16-bit tag ID and random select of an available discovery process. In the current environment where each tag does not have any information about other tags inside the network, the two methods have the same effect on avoiding collisions that could happen in a single discovery cycle.<br></div><div>The proposed MAC layer protocol can provide the best service when the available discovery process in the discovery cycle is for initialization and resetting. For an emergency, the joining period designs can still ensure a success rate for critical messages to be over 90%. Hence, the simulation results indicate the joining period method is able to improve MAC-layer performance.</div><div> <br></div>

Quantitative Assessment on Navigation Impact of the Controlled Waterway in the Upper Yangtze River Using Queuing Model

As an important transportation link between eastern and western economic zones of China, the Yangtze River waterway has been globally ranked first in relation to freight volume since 2010, and the density of ship traffic has also increased significantly. However, the inland navigation system has been increasingly threatened by traffic congestion, which is more serious in the controlled waterways of the upper Yangtze River. In this study, the distribution laws of ship traffic flow and service time in the controlled waterway were analyzed, indicating that the traffic flow obeys the Poisson distribution, and the service time obeys a negative exponential distribution. Thereafter, by simplifying the queuing processes and rules, the M/M/1 queuing service model was established to calculate ship queuing indicators in a controlled waterway. It was found that the ship queuing indicators varied greatly among different controlled waterways. Compared with downstream ships, upstream ships usually had longer queuing lengths and times, which were also more affected by the increasing number of ship arrivals and service times. Consequently, a dimensionless loss coefficient was proposed to quantify the influence of the controlled waterway on the navigation capacity. As the service time and number of ships increased, the loss coefficient also increased. The results of this study could provide references for understanding the ship queuing problem, and thereby the assessment of navigation capacity and anchorage constructions in a controlled waterway.