Relevant bibliographies by topics / Queue Count

Contents

  1. Journal articles
  2. Dissertations / Theses
  3. Book chapters
  4. Conference papers

Academic literature on the topic 'Queue Count'

Author: Grafiati
Published: 4 June 2021
Last updated: 11 February 2022

Create a spot-on reference in APA, MLA, Chicago, Harvard, and other styles

Select a source type:

Consult the lists of relevant articles, books, theses, conference reports, and other scholarly sources on the topic 'Queue Count.'

Next to every source in the list of references, there is an 'Add to bibliography' button. Press on it, and we will generate automatically the bibliographic reference to the chosen work in the citation style you need: APA, MLA, Harvard, Chicago, Vancouver, etc.

You can also download the full text of the academic publication as pdf and read online its abstract whenever available in the metadata.

Journal articles on the topic "Queue Count"

1

Gelenbe, Erol. "Product-form queueing networks with negative and positive customers." Journal of Applied Probability 28, no. 3 (September 1991): 656–63. http://dx.doi.org/10.2307/3214499.

Full text
Abstract:
We introduce a new class of queueing networks in which customers are either ‘negative' or ‘positive'. A negative customer arriving to a queue reduces the total customer count in that queue by 1 if the queue length is positive; it has no effect at all if the queue length is empty. Negative customers do not receive service. Customers leaving a queue for another one can either become negative or remain positive. Positive customers behave as ordinary queueing network customers and receive service. We show that this model with exponential service times, Poisson external arrivals, with the usual independence assumptions for service times, and Markovian customer movements between queues, has product form. It is quasi-reversible in the usual sense, but not in a broader sense which includes all destructions of customers in the set of departures. The existence and uniqueness of the solutions to the (nonlinear) customer flow equations, and hence of the product form solution, is discussed.
APA, Harvard, Vancouver, ISO, and other styles
2

Gelenbe, Erol. "Product-form queueing networks with negative and positive customers." Journal of Applied Probability 28, no. 03 (September 1991): 656–63. http://dx.doi.org/10.1017/s0021900200042492.

Full text
Abstract:
We introduce a new class of queueing networks in which customers are either ‘negative' or ‘positive'. A negative customer arriving to a queue reduces the total customer count in that queue by 1 if the queue length is positive; it has no effect at all if the queue length is empty. Negative customers do not receive service. Customers leaving a queue for another one can either become negative or remain positive. Positive customers behave as ordinary queueing network customers and receive service. We show that this model with exponential service times, Poisson external arrivals, with the usual independence assumptions for service times, and Markovian customer movements between queues, has product form. It is quasi-reversible in the usual sense, but not in a broader sense which includes all destructions of customers in the set of departures. The existence and uniqueness of the solutions to the (nonlinear) customer flow equations, and hence of the product form solution, is discussed.
APA, Harvard, Vancouver, ISO, and other styles
3

Bertini, Robert L., and Aaron M. Myton. "Use of Performance Measurement System Data to Diagnose Freeway Bottleneck Locations Empirically in Orange County, California." Transportation Research Record: Journal of the Transportation Research Board 1925, no. 1 (January 2005): 48–57. http://dx.doi.org/10.1177/0361198105192500106.

Full text
Abstract:
To improve freeway modeling and operations, it is important to understand how traffic conditions evolve in both time and space. The widespread availability of freeway sensor data makes detailed operational analysis possible in ways that were not available in the past. This study, inspired by several other studies of a 6-mi segment of Interstate 405 in Orange County, California, describes the evolution of traffic conditions over one morning peak period by using inductive loop detector data, including vehicle count and lane occupancy measured at 30-s intervals. With cumulative curves of vehicle count and occupancy, transformed in ways that enhanced their resolution, 10 bottleneck activations were identified in time and space over one morning peak period. At bottleneck activation, queue propagation was observed in generally predictable ways. Bottleneck outflows were carefully measured only while the bottlenecks were active, that is, while queued conditions persisted upstream and unqueued (freely flowing) conditions prevailed downstream. When bottlenecks were activated immediately following freely flowing conditions, outflow reductions were observed at queue formation. These reductions were consistent with those in previous studies. The study was limited in that only one day's data were analyzed and ramp data were not available on the day analyzed. Future research will include further analysis of the same site by using more recent data now that ramp counts are available in the California Performance Measurement System database. Understanding the mechanisms that lead to bottleneck activation is a critical step toward improving the understanding of how freeways function and is necessary for addressing operational issues. This clear understanding provides a foundation for determining ramp metering rates and addressing the freeway characteristics that cause bottlenecks to form.
APA, Harvard, Vancouver, ISO, and other styles
4

Moore, Lindsey. "‘What happens after saying no?’ Egyptian Uprisings and Afterwords in Basma Abdel Aziz'sThe Queueand Omar Robert Hamilton'sThe City Always Wins." CounterText 4, no. 2 (August 2018): 192–211. http://dx.doi.org/10.3366/count.2018.0127.

Full text
Abstract:
This article compares two creative continuations to the 2011–13 Egyptian uprisings: Basma Abdel Aziz's dystopian novel The Queue (Melville House, 2016; al-Tābour, 2013) and Omar Robert Hamilton's semi-autobiographical fiction The City Always Wins (Faber & Faber, 2017). These two novels, written in the bitter aftermath of Egypt's spectacular twenty-first century revolts, share a morbid tonality and concomitantly sceptical outlook toward representation, despite their different generic affiliations. They nevertheless both gamble on the performative potential of creative fiction. In the context of an ostensibly failed revolution, we need to ask what kinds of reader response are evoked by literary diagnoses of the present that flirt with alexithymia (the inability to describe feeling); in other words, how a counterfuturistic afterwardly aspires to be productive. I argue that these two novels, as afterwords on a revolution, animate a tensile present that sediments a century of thwarted popular aspirations, enfolds critical temporalities, and resists closure. The article uses the concepts of achrony and ‘robbed time’ to define the afterwardly as creative, counter-textual provocation – skirmishes that continually reterritorialise the political and material ground.
APA, Harvard, Vancouver, ISO, and other styles
5

Su, Na, Zhe Hui Wu, Ji Min Liu, Tai An Liu, Xin Jun An, and Chang Qing Yan. "Mining Approximate Frequent Itemsets over Data Streams." Applied Mechanics and Materials 685 (October 2014): 536–39. http://dx.doi.org/10.4028/www.scientific.net/amm.685.536.

Full text
Abstract:
This paper proposes a method based on Lossy Counting to mine frequent itemsets. Logarithmic tilted time window is adopted to emphasize the importance of recent data. Multilayer count queue framework is used to avoid the counter overflowing and query top-Kitemsets quickly using a index table.
APA, Harvard, Vancouver, ISO, and other styles
6

Nawaz Jadoon, Rab, Mohsin Fayyaz, WuYang Zhou, Muhammad Amir Khan, and Ghulam Mujtaba. "PCOI: Packet Classification‐Based Optical Interconnect for Data Centre Networks." Mathematical Problems in Engineering 2020 (July 17, 2020): 1–11. http://dx.doi.org/10.1155/2020/2903157.

Full text
Abstract:
To support cloud services, Data Centre Networks (DCNs) are constructed to have many servers and network devices, thus increasing the routing complexity and energy consumption of the DCN. The introduction of optical technology in DCNs gives several benefits related to routing control and energy efficiency. This paper presents a novel Packet Classification based Optical interconnect (PCOI) architecture for DCN which simplifies the routing process by classifying the packet at the sender rack and reduces energy consumption by utilizing the passive optical components. This architecture brings some key benefits to optical interconnects in DCNs which include (i) routing simplicity, (ii) reduced energy consumption, (iii) scalability to large port count, (iv) packet loss avoidance, and (v) all-to-one communication support. The packets are classified based on destination rack and are arranged in the input queues. This paper presents the input and output queuing analysis of the PCOI architecture in terms of mathematical analysis, the TCP simulation in NS2, and the physical layer analysis by conducting simulation in OptiSystem. The packet loss in the PCOI has been avoided by adopting the input and output queuing model. The output queue of PCOI architecture represents an M/D/32 queue. The simulation results show that PCOI achieved a significant improvement in terms of throughput and low end-to-end delay. The eye-diagram results show that a good quality optical signal is received at the output, showing a very low Bit Error Rate (BER).
APA, Harvard, Vancouver, ISO, and other styles
7

Hu, Ran, Jing Shuang Hu, and Ying Wu. "A New Queuing Algorithm of Ophthalmic Hospital Beds Arrangement." Advanced Materials Research 433-440 (January 2012): 1971–74. http://dx.doi.org/10.4028/www.scientific.net/amr.433-440.1971.

Full text
Abstract:
In this paper, we build a new queuing algorithm based on Multi-objective linear programming about the ophthalmic hospital sickbeds arrangement. In the new algorithm we divide the traditional queue into four subqueues depending on the different treatment of diseases and following the law of FCFS. We find a random day for reference and count the data of this day, and then we focus on the arrangement of the next day, which means to choose how many patients from each of the four subqueues to be settled into hospital in the next day. Considering the fair principle, the utilization of sickbeds, and the waiting time of the patients, we found an objective function with several constraint conditions to calculate the arrangement of the next day. In order to simplify the constraint conditions, we transfer the length of the queues into the waiting time of patients and finally get the result through programming by Lingo software.
APA, Harvard, Vancouver, ISO, and other styles
8

Keerthana, S., S. Ainul Inaya, and S. Abarna. "Design of Smart Shopping Enabler For Visually Challenged People." Biomedical and Pharmacology Journal 11, no. 4 (November 29, 2018): 2143–49. http://dx.doi.org/10.13005/bpj/1594.

Full text
Abstract:
India has changed the four decade old definition of blindness as “A person who is unable to count the fingers at a distance of 3 meters rather than the earlier count of 6 meters”. This is to reduce the count of blind people in India and to bring in line with the criteria of world health organization (WHO). By this the population count of blind people will be reduced from 1.20 crore to 80 lakh. This great population not only in India but also many countries faces a major challenge i.e shopping independently. They aspire for an independent life. They have to depend on others for buying the products they are in need of. Our project aims at facilitating the visually impaired customers to identify the products in the supermarket, guiding the customers to navigate through all the sections and to automate billing. The user need not stand in long queue for billing the items bought. This eliminates assistance and provides a friendly shopping environment to the customers.
APA, Harvard, Vancouver, ISO, and other styles
9

Salsabela, Aurum Anisa, Sugito Sugito, and Budi Warsito. "ANALISIS METODE BAYESIAN PADA SISTEM ANTREAN PELAYANAN LOKET TIKET STASIUN TAWANG SEMARANG." Jurnal Gaussian 10, no. 2 (May 31, 2021): 200–210. http://dx.doi.org/10.14710/j.gauss.v10i2.29410.

Full text
Abstract:
Jamming is one of the serious problem in Indonesia caused by the increase of vehicle. The government has made solution for this situation for example was public transportation. Train is one of the suitable public transportation because of the ticket price was cheap. Tawang Railway Stasion Semarang was the biggest railway station in Semarang. In the specific day such long holiday or celebrating day, many people have chosen train to bring them. This make a queuing situation on the counter of station. Queue theory models provide the random of arrival and service time. The Bayesian theory suits to handle the problem of queuing that has been working for several times. Based on the analysis of the queue models for customer service, self-print tickets, cancellation and ordering are (G/G/c):(GD/∞/∞) from the posterior distribution with combination from prior distribution and likelihood sample. The combination of prior distribution and likelihood sample used in this research is Poisson distribution for all ticket counter except the arrival for cancellation counter which Normal distribution. The likelihood sample used Poissonn distribution for all ticket counter, except for self-print tickets which Diskrit Uniform Distribution. Queue models can be used to count the size of the system performance. Based on the calculations and analysis, it can be concluded that the queueing system to the customer service, self-print tickets, cancellation and ordering have been good because its steady state and busy probability is higher than jobless probability. Keywords: Tawang Railway Station, Queue, Bayesian, size of the system performance
APA, Harvard, Vancouver, ISO, and other styles
10

Pan, Jing Shan, and Li Dong Zhang. "Traffic Overflow Modeling and Numerical Simulation." Applied Mechanics and Materials 241-244 (December 2012): 2072–75. http://dx.doi.org/10.4028/www.scientific.net/amm.241-244.2072.

Full text
Abstract:
Traffic overflow has great negative impact on normal traffic flow. Improper time setting and offset, even more right turn input traffic flow can cause this extreme phenomenon. In order to discover the intrinsic factor and relationship between overflow and signal setting, traffic flow incoming, we build the traffic flow model. This model takes two adjacent crosses as example, and to count the remained traffic flow queue length in given time interval. The simulation results prove our model’s feasibility. Our model well helps us to understand the overflow characteristics and to find the effective solution to conquer it in the future.
APA, Harvard, Vancouver, ISO, and other styles
More sources

Dissertations / Theses on the topic "Queue Count"

1

Cooke, Payton, and Payton Cooke. "Comparative Analysis of Multiple Data Sources for Travel Time and Delay Measurement." Thesis, The University of Arizona, 2016. http://hdl.handle.net/10150/622847.

Full text
Abstract:
Arterial performance measurement is an essential tool for both researchers and practitioners, guiding decisions on traffic management, future improvements, and public information. Link travel time and intersection control delay are two primary performance measures that are used to evaluate arterial level of service. Despite recent technological advancements, collecting travel time and intersection delay data can be a time-consuming and complicated process. Limited budgets, numerous available technologies, a rapidly changing field, and other challenges make performance measurement and comparison of data sources difficult. Three common data collection sources (probe vehicles, Bluetooth media access control readers, and manual queue length counts) are often used for performance measurement and validation of new data methods. Comparing these and other data sources is important as agencies and researchers collect arterial performance data. This study provides a methodology for comparing data sources, using statistical tests and linear correlation to compare methods and identify strengths and weaknesses. Additionally, this study examines data normality as an issue that is seldom considered, yet can affect the performance of statistical tests. These comparisons can provide insight into the selection of a particular data source for use in the field or for research. Data collected along Grant Road in Tucson, Arizona, was used as a case study to evaluate the methodology and the data sources. For evaluating travel time, GPS probe vehicle and Bluetooth sources produced similar results. Bluetooth can provide a greater volume of data more easily in addition to samples large enough for more rigorous statistical evaluation, but probe vehicles are more versatile and provide higher resolution data. For evaluating intersection delay, probe vehicle and queue count methods did not always produce similar results.
APA, Harvard, Vancouver, ISO, and other styles
2

Arvidsson, Klas. "Simulering av miljoner grindar med Count Algoritmen." Thesis, Linköping University, Department of Computer and Information Science, 2004. http://urn.kb.se/resolve?urn=urn:nbn:se:liu:diva-2476.

Full text
Abstract:

A key part in the development and verification of digital systems is simulation. But hardware simulators are expensive, and software simulation is not fast enough for designs with a large number of gates. As today’s digital zesigns constantly grow in size (number of gates), and that trend shows no signs to end, faster simulators handling millions of gates are needed.

We investigate how to create a software gate-level simulator able to simulate a high number of gates fast. This involves a trade-off between memory requirement and speed. A compact netlist representation can utilize cache memories more efficient but requires more work to interpret, while high memory requirements can limit the performance to the speed of main memory.

We have selected the Counting Algorithm to implement the experimental simulator MICA. The main reasons for this choice is the compact way in which gates can be stored, but still be evaluated in a simple and standard way.

The report describes the issues and solutions encountered and evaluate the resulting simulator. MICA simulates a SPARC architecture processor called Leon. Larger netlists are achieved by simulating several instances of this processor. Simulation of 128 instances is done at a speed of 9 million gates per second using only 3.5MB memory. In MICA this design correspond to 2.5 million gates.

APA, Harvard, Vancouver, ISO, and other styles
3

Shrestha, Sajan. "SENSITIVITY OF QUEUE ESTIMATES TO THE SIZE OF THE TIME INTERVAL USED TO AGGREGATE TRAFFIC VOLUME DATA." Cleveland State University / OhioLINK, 2015. http://rave.ohiolink.edu/etdc/view?acc_num=csu1431087335.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Naimi, Mohamed. "Une structure arborescente pour une classe d'algorithmes distribués d'exclusion mutuelle." Besançon, 1987. http://www.theses.fr/1987BESA2003.

Full text
Abstract:
Dans la premiere partie, une presentation des solutions existantes pour les reseaux complets est proposee. La deuxieme partie contient l'idee fondamentale de la these: au lieu de diffuser une demande d'entree en section critique, un site va demander l'autorisation a un seul site. Les chemins d'acces a ce site sont structures en arborescence. La troisieme partie presente un algorithme de reorganisation de l'arborescence en cas de panne d'un site: un algorithme d'exclusion mutuelle, base sur la notion d'arborescence est valable quand le reseau n'est pas complet. La preuve de l'exclusion mutuelle, de l'absence d'interblocage et de la famine est aussi donnee
APA, Harvard, Vancouver, ISO, and other styles

Book chapters on the topic "Queue Count"

1

Graetsch, W., and T. Brand. "UNIX Fehlertoleranz mit dem Queue and Count Verfahren." In Fehlertolerierende Rechensysteme / Fault-tolerant Computing Systems, 233–43. Berlin, Heidelberg: Springer Berlin Heidelberg, 1989. http://dx.doi.org/10.1007/978-3-642-75002-1_19.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Maroufi, Bouchra El, Moulay Driss Rahmani, and Mohammed Rziza. "Congestion Avoidance in AODV Routing Protocol Using Buffer Queue Occupancy and Hop Count." In Lecture Notes in Electrical Engineering, 193–200. Cham: Springer International Publishing, 2016. http://dx.doi.org/10.1007/978-3-319-30298-0_20.

Full text
APA, Harvard, Vancouver, ISO, and other styles
3

Ashbee, Andrew, David Lasocki, Peter Holman, and Fiona Kisby. "QUERE, HANS. Drumslade (1539-1540)." In A Biographical Dictionary of English Court Musicians 1485-1714, 936–37. Routledge, 2018. http://dx.doi.org/10.4324/9781315097817-16.

Full text
APA, Harvard, Vancouver, ISO, and other styles

Conference papers on the topic "Queue Count"

1

Assiri, Basem, and Costas Busch. "Approximate Count and Queue Objects in Transactional Memory." In 2017 IEEE International Parallel and Distributed Processing Symposium Workshops (IPDPSW). IEEE, 2017. http://dx.doi.org/10.1109/ipdpsw.2017.69.

Full text
APA, Harvard, Vancouver, ISO, and other styles
2

Hu, Hsu-Chieh, Allen M. Hawkes, and Stephen F. Smith. "Incorporating Queueing Dynamics into Schedule-Driven Traffic Control." In Thirtieth International Joint Conference on Artificial Intelligence {IJCAI-21}. California: International Joint Conferences on Artificial Intelligence Organization, 2021. http://dx.doi.org/10.24963/ijcai.2021/561.

Full text
Abstract:
Key to the effectiveness of schedule-driven approaches to real-time traffic control is an ability to accurately predict when sensed vehicles will arrive at and pass through the intersection. Prior work in schedule-driven traffic control has assumed a static vehicle arrival model. However, this static predictive model ignores the fact that the queue count and the incurred delay should vary as different partial signal timing schedules (i.e., different possible futures) are explored during the online planning process. In this paper, we propose an alternative arrival time model that incorporates queueing dynamics into this forward search process for a signal timing schedule, to more accurately capture how the intersection’s queues vary over time. As each search state is generated, an incremental queueing delay is dynamically projected for each vehicle. The resulting total queueing delay is then considered in addition to the cumulative delay caused by signal operations. We demonstrate the potential of this approach through microscopic traffic simulation of a real-world road network, showing a 10-15% reduction in average wait times over the schedule-driven traffic signal control system in heavy traffic scenarios.
APA, Harvard, Vancouver, ISO, and other styles
3

Sleurs, K., J. Potemans, J. Theunis, Dagang Li, E. Van Lil, and A. Van de Capelle. "A Qualitative Description of the Effect of Single Queues on Bin Counts." In 2008 IEEE International Conference on Communications. IEEE, 2008. http://dx.doi.org/10.1109/icc.2008.28.

Full text
APA, Harvard, Vancouver, ISO, and other styles
4

Xu Zhang, Chen-guang Gai, and Jun Huang. "Optimization of PET (Post Etch Treatment) steps to enlarge queue time and decrease defect counts in Ultra low-k material AIO (all in one) etch processes." In 2015 China Semiconductor Technology International Conference (CSTIC). IEEE, 2015. http://dx.doi.org/10.1109/cstic.2015.7153375.

Full text
APA, Harvard, Vancouver, ISO, and other styles
You might also be interested in the extended bibliographies on the topic 'Queue Count' for particular source types:
Journal articles
We offer discounts on all premium plans for authors whose works are included in thematic literature selections. Contact us to get a unique promo code!

To the bibliography