Fundamentals of queueing theory (2nd ed.).
Fundamentals of queueing theory (2nd ed.).
Numerical analysis: 4th ed
Exact and approximate numerical solutions of steady-state distributions arising in the queue GI/G/1
Queueing Systems: Theory and Applications - Numerical computations in queues
Machine Learning - Special issue on learning with probabilistic representations
The disambiguation of nominalizations
Computational Linguistics
Generalizing case frames using a thesaurus and the MDL principle
Computational Linguistics
Finding parts in very large corpora
ACL '99 Proceedings of the 37th annual meeting of the Association for Computational Linguistics on Computational Linguistics
Lexical chains for question answering
COLING '02 Proceedings of the 19th international conference on Computational linguistics - Volume 1
The descent of hierarchy, and selection in relational semantics
ACL '02 Proceedings of the 40th Annual Meeting on Association for Computational Linguistics
Learning semantic constraints for the automatic discovery of part-whole relations
NAACL '03 Proceedings of the 2003 Conference of the North American Chapter of the Association for Computational Linguistics on Human Language Technology - Volume 1
Classification of semantic relations between nouns
Classification of semantic relations between nouns
Automatic Discovery of Part-Whole Relations
Computational Linguistics
A semantic scattering model for the automatic interpretation of genitives
HLT '05 Proceedings of the conference on Human Language Technology and Empirical Methods in Natural Language Processing
The Google Similarity Distance
IEEE Transactions on Knowledge and Data Engineering
Models for the semantic classification of noun phrases
CLS '04 Proceedings of the HLT-NAACL Workshop on Computational Lexical Semantics
SemEval-2007 task 04: classification of semantic relations between nominals
SemEval '07 Proceedings of the 4th International Workshop on Semantic Evaluations
On the semantics of noun compounds
Computer Speech and Language
Introduction to the CoNLL-2005 shared task: semantic role labeling
CONLL '05 Proceedings of the Ninth Conference on Computational Natural Language Learning
Composition of semantic relations: Theoretical framework and case study
ACM Transactions on Speech and Language Processing (TSLP)
| Hi-index | 0.00 |
This article offers an approach for studying the time-dependent occupancy distribution for a modest generalization of the GI/G/1 queuing system in which interarrival times and service times, although mutually independent, are not necessarily identically distributed. We develop and explore an analytical model leading to a computational approach that gives tight bounds on the occupancy distribution. Although there is no general closed-form characterization of probability law dynamics for occupancy in the GI/G/1 queue, our results offer what might be termed “near-closed-form” in that accurate plots of the transient occupancy distribution can be constructed with an insignificant computational burden. We believe that our results are unique; we are unaware of any alternative analytical approach leading to a numerical characterization of the time-dependent occupancy distribution for the G/G/1 queuing systems considered here. Our analyses employ a marked point process that converges to the occupancy process at any fixed time t; it is shown that this process forms a Markov chain from which the transient occupancy law is available. We verify our analytical approach via comparison with the well-known closed-form expressions for time-dependent occupancy distribution of the M/M/1 queue. Additionally, we suggest the viability of our approach, as a computational means of obtaining the time-dependent occupancy distribution, through straightforward application to a Gamma[x]/Weibull/1 queuing system having batch arrivals and batch job services.