id	sid	tid	token	lemma	pos
2164	1	1	Public	Public	NNP
2164	1	2	Library	Library	NNP
2164	1	3	Computer	Computer	NNP
2164	1	4	Waiting	Waiting	NNP
2164	1	5	Queues	Queues	NNPS
2164	1	6	:	:	:
2164	1	7	Alternatives	alternative	NNS
2164	1	8	to	to	IN
2164	1	9	the	the	DT
2164	1	10	First	First	NNP
2164	1	11	-Come	-Come	NNP
2164	1	12	-	-	HYPH
2164	1	13	First	first	JJ
2164	1	14	-	-	HYPH
2164	1	15	Served	Served	NNP
2164	1	16	Strategy	Strategy	NNP
2164	1	17	Stuart	Stuart	NNP
2164	1	18	Williamson	Williamson	NNP
2164	1	19	PUBLIC	PUBLIC	NNP
2164	1	20	LIBRARY	LIBRARY	NNP
2164	1	21	COMPUTER	computer	NN
2164	1	22	WAITING	waiting	NN
2164	1	23	QUEUES	QUEUES	NNP
2164	1	24	|	|	NNP
2164	1	25	WILLIAMSON	williamson	NN
2164	1	26	72	72	CD
2164	1	27	ABSTRACT	ABSTRACT	NNP
2164	1	28	This	this	DT
2164	1	29	paper	paper	NN
2164	1	30	summarizes	summarize	VBZ
2164	1	31	the	the	DT
2164	1	32	results	result	NNS
2164	1	33	of	of	IN
2164	1	34	a	a	DT
2164	1	35	simulation	simulation	NN
2164	1	36	of	of	IN
2164	1	37	alternative	alternative	JJ
2164	1	38	queuing	queuing	NN
2164	1	39	strategies	strategy	NNS
2164	1	40	for	for	IN
2164	1	41	a	a	DT
2164	1	42	public	public	JJ
2164	1	43	library	library	NN
2164	1	44	computer	computer	NN
2164	1	45	sign	sign	NN
2164	1	46	-	-	HYPH
2164	1	47	up	up	RP
2164	1	48	system	system	NN
2164	1	49	.	.	.
2164	2	1	Using	use	VBG
2164	2	2	computer	computer	NN
2164	2	3	usage	usage	NN
2164	2	4	data	datum	NNS
2164	2	5	gathered	gather	VBD
2164	2	6	from	from	IN
2164	2	7	a	a	DT
2164	2	8	public	public	JJ
2164	2	9	library	library	NN
2164	2	10	,	,	,
2164	2	11	the	the	DT
2164	2	12	performance	performance	NN
2164	2	13	of	of	IN
2164	2	14	these	these	DT
2164	2	15	various	various	JJ
2164	2	16	queuing	queuing	NN
2164	2	17	strategies	strategy	NNS
2164	2	18	is	be	VBZ
2164	2	19	compared	compare	VBN
2164	2	20	in	in	IN
2164	2	21	terms	term	NNS
2164	2	22	of	of	IN
2164	2	23	the	the	DT
2164	2	24	distribution	distribution	NN
2164	2	25	of	of	IN
2164	2	26	user	user	NN
2164	2	27	wait	wait	VB
2164	2	28	times	time	NNS
2164	2	29	.	.	.
2164	3	1	The	the	DT
2164	3	2	consequences	consequence	NNS
2164	3	3	of	of	IN
2164	3	4	partitioning	partition	VBG
2164	3	5	a	a	DT
2164	3	6	pool	pool	NN
2164	3	7	of	of	IN
2164	3	8	public	public	JJ
2164	3	9	computers	computer	NNS
2164	3	10	are	be	VBP
2164	3	11	illustrated	illustrate	VBN
2164	3	12	as	as	IN
2164	3	13	are	be	VBP
2164	3	14	the	the	DT
2164	3	15	potential	potential	JJ
2164	3	16	benefits	benefit	NNS
2164	3	17	of	of	IN
2164	3	18	prioritizing	prioritize	VBG
2164	3	19	users	user	NNS
2164	3	20	in	in	IN
2164	3	21	the	the	DT
2164	3	22	waiting	wait	VBG
2164	3	23	queue	queue	NN
2164	3	24	according	accord	VBG
2164	3	25	to	to	IN
2164	3	26	the	the	DT
2164	3	27	amount	amount	NN
2164	3	28	of	of	IN
2164	3	29	computer	computer	NN
2164	3	30	time	time	NN
2164	3	31	they	-PRON-	PRP
2164	3	32	desire	desire	VBP
2164	3	33	.	.	.
2164	4	1	INTRODUCTION	introduction	WRB
2164	4	2	Many	many	JJ
2164	4	3	of	of	IN
2164	4	4	us	-PRON-	PRP
2164	4	5	at	at	IN
2164	4	6	public	public	JJ
2164	4	7	libraries	library	NNS
2164	4	8	are	be	VBP
2164	4	9	all	all	RB
2164	4	10	too	too	RB
2164	4	11	familiar	familiar	JJ
2164	4	12	with	with	IN
2164	4	13	the	the	DT
2164	4	14	scene	scene	NN
2164	4	15	:	:	:
2164	4	16	a	a	DT
2164	4	17	crowd	crowd	NN
2164	4	18	of	of	IN
2164	4	19	customers	customer	NNS
2164	4	20	huddled	huddle	VBD
2164	4	21	around	around	IN
2164	4	22	the	the	DT
2164	4	23	library	library	NN
2164	4	24	entrance	entrance	NN
2164	4	25	in	in	IN
2164	4	26	the	the	DT
2164	4	27	morning	morning	NN
2164	4	28	,	,	,
2164	4	29	anxiously	anxiously	RB
2164	4	30	waiting	wait	VBG
2164	4	31	for	for	IN
2164	4	32	the	the	DT
2164	4	33	doors	door	NNS
2164	4	34	to	to	TO
2164	4	35	open	open	VB
2164	4	36	to	to	TO
2164	4	37	begin	begin	VB
2164	4	38	a	a	DT
2164	4	39	race	race	NN
2164	4	40	for	for	IN
2164	4	41	the	the	DT
2164	4	42	computers	computer	NNS
2164	4	43	.	.	.
2164	5	1	From	from	IN
2164	5	2	this	this	DT
2164	5	3	point	point	NN
2164	5	4	on	on	IN
2164	5	5	,	,	,
2164	5	6	the	the	DT
2164	5	7	wait	wait	NN
2164	5	8	for	for	IN
2164	5	9	a	a	DT
2164	5	10	computer	computer	NN
2164	5	11	at	at	IN
2164	5	12	some	some	DT
2164	5	13	libraries	library	NNS
2164	5	14	,	,	,
2164	5	15	such	such	JJ
2164	5	16	as	as	IN
2164	5	17	the	the	DT
2164	5	18	one	one	NN
2164	5	19	we	-PRON-	PRP
2164	5	20	will	will	MD
2164	5	21	examine	examine	VB
2164	5	22	,	,	,
2164	5	23	can	can	MD
2164	5	24	hover	hover	VB
2164	5	25	near	near	IN
2164	5	26	thirty	thirty	CD
2164	5	27	minutes	minute	NNS
2164	5	28	on	on	IN
2164	5	29	busy	busy	JJ
2164	5	30	days	day	NNS
2164	5	31	and	and	CC
2164	5	32	peak	peak	VB
2164	5	33	at	at	IN
2164	5	34	an	an	DT
2164	5	35	hour	hour	NN
2164	5	36	or	or	CC
2164	5	37	more	more	JJR
2164	5	38	.	.	.
2164	6	1	Such	such	JJ
2164	6	2	long	long	JJ
2164	6	3	waiting	wait	VBG
2164	6	4	times	time	NNS
2164	6	5	are	be	VBP
2164	6	6	a	a	DT
2164	6	7	common	common	JJ
2164	6	8	source	source	NN
2164	6	9	of	of	IN
2164	6	10	frustration	frustration	NN
2164	6	11	for	for	IN
2164	6	12	both	both	DT
2164	6	13	customers	customer	NNS
2164	6	14	and	and	CC
2164	6	15	staff	staff	NN
2164	6	16	.	.	.
2164	7	1	By	by	IN
2164	7	2	far	far	RB
2164	7	3	the	the	DT
2164	7	4	most	most	RBS
2164	7	5	effective	effective	JJ
2164	7	6	solution	solution	NN
2164	7	7	to	to	IN
2164	7	8	this	this	DT
2164	7	9	problem	problem	NN
2164	7	10	is	be	VBZ
2164	7	11	to	to	TO
2164	7	12	install	install	VB
2164	7	13	more	more	JJR
2164	7	14	public	public	JJ
2164	7	15	computers	computer	NNS
2164	7	16	at	at	IN
2164	7	17	your	-PRON-	PRP$
2164	7	18	library	library	NN
2164	7	19	.	.	.
2164	8	1	Of	of	RB
2164	8	2	course	course	RB
2164	8	3	,	,	,
2164	8	4	when	when	WRB
2164	8	5	the	the	DT
2164	8	6	space	space	NN
2164	8	7	or	or	CC
2164	8	8	money	money	NN
2164	8	9	run	run	VB
2164	8	10	out	out	RP
2164	8	11	,	,	,
2164	8	12	this	this	DT
2164	8	13	may	may	MD
2164	8	14	no	no	RB
2164	8	15	longer	longer	RB
2164	8	16	be	be	VB
2164	8	17	possible	possible	JJ
2164	8	18	.	.	.
2164	9	1	Another	another	DT
2164	9	2	approach	approach	NN
2164	9	3	is	be	VBZ
2164	9	4	to	to	TO
2164	9	5	reduce	reduce	VB
2164	9	6	the	the	DT
2164	9	7	length	length	NN
2164	9	8	or	or	CC
2164	9	9	number	number	NN
2164	9	10	of	of	IN
2164	9	11	sessions	session	NNS
2164	9	12	each	each	DT
2164	9	13	customer	customer	NN
2164	9	14	is	be	VBZ
2164	9	15	allowed	allow	VBN
2164	9	16	.	.	.
2164	10	1	Unfortunately	unfortunately	RB
2164	10	2	,	,	,
2164	10	3	reducing	reduce	VBG
2164	10	4	session	session	NN
2164	10	5	length	length	NN
2164	10	6	can	can	MD
2164	10	7	make	make	VB
2164	10	8	completion	completion	NN
2164	10	9	of	of	IN
2164	10	10	many	many	JJ
2164	10	11	important	important	JJ
2164	10	12	tasks	task	NNS
2164	10	13	difficult	difficult	JJ
2164	10	14	;	;	:
2164	10	15	whereas	whereas	IN
2164	10	16	,	,	,
2164	10	17	restricting	restrict	VBG
2164	10	18	the	the	DT
2164	10	19	number	number	NN
2164	10	20	of	of	IN
2164	10	21	sessions	session	NNS
2164	10	22	per	per	IN
2164	10	23	day	day	NN
2164	10	24	can	can	MD
2164	10	25	result	result	VB
2164	10	26	in	in	IN
2164	10	27	customers	customer	NNS
2164	10	28	upset	upset	VBN
2164	10	29	over	over	IN
2164	10	30	being	be	VBG
2164	10	31	unable	unable	JJ
2164	10	32	to	to	TO
2164	10	33	use	use	VB
2164	10	34	idle	idle	JJ
2164	10	35	computers.1	computers.1	CD
2164	10	36	Finally	finally	RB
2164	10	37	,	,	,
2164	10	38	faced	face	VBN
2164	10	39	with	with	IN
2164	10	40	daunting	daunt	VBG
2164	10	41	wait	wait	NN
2164	10	42	times	time	NNS
2164	10	43	,	,	,
2164	10	44	libraries	library	NNS
2164	10	45	eager	eager	JJ
2164	10	46	to	to	TO
2164	10	47	make	make	VB
2164	10	48	their	-PRON-	PRP$
2164	10	49	computers	computer	NNS
2164	10	50	accessible	accessible	JJ
2164	10	51	to	to	IN
2164	10	52	more	more	JJR
2164	10	53	people	people	NNS
2164	10	54	may	may	MD
2164	10	55	be	be	VB
2164	10	56	tempted	tempt	VBN
2164	10	57	to	to	TO
2164	10	58	partition	partition	VB
2164	10	59	their	-PRON-	PRP$
2164	10	60	waiting	wait	VBG
2164	10	61	queue	queue	NN
2164	10	62	by	by	IN
2164	10	63	installing	instal	VBG
2164	10	64	separate	separate	JJ
2164	10	65	fifteen	fifteen	CD
2164	10	66	-	-	HYPH
2164	10	67	minute	minute	NN
2164	10	68	“	"	``
2164	10	69	express	express	NN
2164	10	70	”	"	''
2164	10	71	computers	computer	NNS
2164	10	72	.	.	.
2164	11	1	A	a	DT
2164	11	2	primary	primary	JJ
2164	11	3	focus	focus	NN
2164	11	4	of	of	IN
2164	11	5	this	this	DT
2164	11	6	paper	paper	NN
2164	11	7	is	be	VBZ
2164	11	8	to	to	TO
2164	11	9	illustrate	illustrate	VB
2164	11	10	how	how	WRB
2164	11	11	partitioning	partition	VBG
2164	11	12	the	the	DT
2164	11	13	pool	pool	NN
2164	11	14	of	of	IN
2164	11	15	public	public	JJ
2164	11	16	computers	computer	NNS
2164	11	17	can	can	MD
2164	11	18	significantly	significantly	RB
2164	11	19	increase	increase	VB
2164	11	20	waiting	wait	VBG
2164	11	21	times	time	NNS
2164	11	22	.	.	.
2164	12	1	Additionally	additionally	RB
2164	12	2	,	,	,
2164	12	3	several	several	JJ
2164	12	4	alternative	alternative	JJ
2164	12	5	queuing	queuing	NN
2164	12	6	strategies	strategy	NNS
2164	12	7	are	be	VBP
2164	12	8	presented	present	VBN
2164	12	9	for	for	IN
2164	12	10	providing	provide	VBG
2164	12	11	express	express	JJ
2164	12	12	-	-	HYPH
2164	12	13	like	like	JJ
2164	12	14	computer	computer	NN
2164	12	15	access	access	NN
2164	12	16	without	without	IN
2164	12	17	increasing	increase	VBG
2164	12	18	overall	overall	RB
2164	12	19	waiting	wait	VBG
2164	12	20	times	time	NNS
2164	12	21	.	.	.
2164	13	1	We	-PRON-	PRP
2164	13	2	often	often	RB
2164	13	3	take	take	VBP
2164	13	4	for	for	IN
2164	13	5	granted	grant	VBN
2164	13	6	the	the	DT
2164	13	7	notion	notion	NN
2164	13	8	that	that	IN
2164	13	9	first	first	RB
2164	13	10	-	-	HYPH
2164	13	11	come	come	VB
2164	13	12	-	-	HYPH
2164	13	13	first	first	RB
2164	13	14	-	-	HYPH
2164	13	15	served	served	JJ
2164	13	16	(	(	-LRB-
2164	13	17	FCFS	FCFS	NNP
2164	13	18	)	)	-RRB-
2164	13	19	is	be	VBZ
2164	13	20	a	a	DT
2164	13	21	basic	basic	JJ
2164	13	22	principle	principle	NN
2164	13	23	of	of	IN
2164	13	24	fairness	fairness	NN
2164	13	25	.	.	.
2164	14	1	“	"	``
2164	14	2	I	-PRON-	PRP
2164	14	3	was	be	VBD
2164	14	4	here	here	RB
2164	14	5	first	first	JJ
2164	14	6	,	,	,
2164	14	7	”	"	''
2164	14	8	is	be	VBZ
2164	14	9	an	an	DT
2164	14	10	intuitive	intuitive	JJ
2164	14	11	claim	claim	NN
2164	14	12	that	that	IN
2164	14	13	we	-PRON-	PRP
2164	14	14	understand	understand	VBP
2164	14	15	from	from	IN
2164	14	16	an	an	DT
2164	14	17	early	early	JJ
2164	14	18	age	age	NN
2164	14	19	.	.	.
2164	15	1	However	however	RB
2164	15	2	,	,	,
2164	15	3	Stuart	Stuart	NNP
2164	15	4	Williamson	Williamson	NNP
2164	15	5	(	(	-LRB-
2164	15	6	swilliamson@metrolibrary.org	swilliamson@metrolibrary.org	NN
2164	15	7	)	)	-RRB-
2164	15	8	is	be	VBZ
2164	15	9	Researcher	Researcher	NNP
2164	15	10	,	,	,
2164	15	11	Metropolitan	Metropolitan	NNP
2164	15	12	Library	Library	NNP
2164	15	13	System	System	NNP
2164	15	14	,	,	,
2164	15	15	Oklahoma	Oklahoma	NNP
2164	15	16	City	City	NNP
2164	15	17	,	,	,
2164	15	18	Oklahoma	Oklahoma	NNP
2164	15	19	.	.	.
2164	16	1	mailto:swilliamson@metrolibrary.org	mailto:swilliamson@metrolibrary.org	NNP
2164	16	2	INFORMATION	INFORMATION	NNP
2164	16	3	TECHNOLOGY	TECHNOLOGY	NNP
2164	16	4	AND	and	CC
2164	16	5	LIBRARIES	LIBRARIES	NNP
2164	16	6	|	|	NNP
2164	16	7	JUNE	JUNE	NNP
2164	16	8	2012	2012	CD
2164	16	9	73	73	CD
2164	16	10	the	the	DT
2164	16	11	inefficiency	inefficiency	NN
2164	16	12	present	present	NN
2164	16	13	in	in	IN
2164	16	14	a	a	DT
2164	16	15	strictly	strictly	RB
2164	16	16	FCFS	FCFS	NNP
2164	16	17	queue	queue	NN
2164	16	18	is	be	VBZ
2164	16	19	implicitly	implicitly	RB
2164	16	20	acknowledged	acknowledge	VBN
2164	16	21	when	when	WRB
2164	16	22	we	-PRON-	PRP
2164	16	23	courteously	courteously	RB
2164	16	24	invite	invite	VBP
2164	16	25	a	a	DT
2164	16	26	person	person	NN
2164	16	27	with	with	IN
2164	16	28	only	only	RB
2164	16	29	a	a	DT
2164	16	30	few	few	JJ
2164	16	31	items	item	NNS
2164	16	32	to	to	TO
2164	16	33	bypass	bypass	VB
2164	16	34	our	-PRON-	PRP$
2164	16	35	overflowing	overflow	VBG
2164	16	36	grocery	grocery	NN
2164	16	37	cart	cart	NN
2164	16	38	to	to	TO
2164	16	39	proceed	proceed	VB
2164	16	40	ahead	ahead	RB
2164	16	41	in	in	IN
2164	16	42	the	the	DT
2164	16	43	check	check	VB
2164	16	44	-	-	HYPH
2164	16	45	out	out	RP
2164	16	46	line	line	NN
2164	16	47	.	.	.
2164	17	1	Most	Most	JJS
2164	17	2	of	of	IN
2164	17	3	us	-PRON-	PRP
2164	17	4	would	would	MD
2164	17	5	agree	agree	VB
2164	17	6	to	to	TO
2164	17	7	wait	wait	VB
2164	17	8	an	an	DT
2164	17	9	additional	additional	JJ
2164	17	10	few	few	JJ
2164	17	11	minutes	minute	NNS
2164	17	12	rather	rather	RB
2164	17	13	than	than	IN
2164	17	14	delay	delay	VB
2164	17	15	someone	someone	NN
2164	17	16	else	else	RB
2164	17	17	for	for	IN
2164	17	18	a	a	DT
2164	17	19	much	much	RB
2164	17	20	greater	great	JJR
2164	17	21	length	length	NN
2164	17	22	of	of	IN
2164	17	23	time	time	NN
2164	17	24	.	.	.
2164	18	1	When	when	WRB
2164	18	2	express	express	JJ
2164	18	3	lanes	lane	NNS
2164	18	4	are	be	VBP
2164	18	5	present	present	JJ
2164	18	6	,	,	,
2164	18	7	they	-PRON-	PRP
2164	18	8	formalize	formalize	VBP
2164	18	9	this	this	DT
2164	18	10	process	process	NN
2164	18	11	by	by	IN
2164	18	12	essentially	essentially	RB
2164	18	13	allowing	allow	VBG
2164	18	14	customers	customer	NNS
2164	18	15	needing	need	VBG
2164	18	16	help	help	NN
2164	18	17	for	for	IN
2164	18	18	only	only	RB
2164	18	19	a	a	DT
2164	18	20	short	short	JJ
2164	18	21	period	period	NN
2164	18	22	of	of	IN
2164	18	23	time	time	NN
2164	18	24	to	to	TO
2164	18	25	cut	cut	VB
2164	18	26	in	in	IN
2164	18	27	line	line	NN
2164	18	28	.	.	.
2164	19	1	These	these	DT
2164	19	2	line	line	NN
2164	19	3	cuts	cut	NNS
2164	19	4	are	be	VBP
2164	19	5	masked	mask	VBN
2164	19	6	by	by	IN
2164	19	7	the	the	DT
2164	19	8	establishment	establishment	NN
2164	19	9	of	of	IN
2164	19	10	separate	separate	JJ
2164	19	11	dedicated	dedicated	JJ
2164	19	12	lines	line	NNS
2164	19	13	,	,	,
2164	19	14	i.e.	i.e.	FW
2164	19	15	,	,	,
2164	19	16	the	the	DT
2164	19	17	queue	queue	NN
2164	19	18	is	be	VBZ
2164	19	19	partitioned	partition	VBN
2164	19	20	into	into	IN
2164	19	21	express	express	JJ
2164	19	22	and	and	CC
2164	19	23	non	non	JJ
2164	19	24	-	-	JJ
2164	19	25	express	express	JJ
2164	19	26	lines	line	NNS
2164	19	27	.	.	.
2164	20	1	One	one	CD
2164	20	2	question	question	NN
2164	20	3	addressed	address	VBN
2164	20	4	by	by	IN
2164	20	5	this	this	DT
2164	20	6	article	article	NN
2164	20	7	is	be	VBZ
2164	20	8	“	"	``
2164	20	9	is	be	VBZ
2164	20	10	there	there	EX
2164	20	11	a	a	DT
2164	20	12	middle	middle	JJ
2164	20	13	ground	ground	NN
2164	20	14	?	?	.
2164	20	15	”	"	''
2164	20	16	In	in	IN
2164	20	17	other	other	JJ
2164	20	18	words	word	NNS
2164	20	19	,	,	,
2164	20	20	how	how	WRB
2164	20	21	might	may	MD
2164	20	22	a	a	DT
2164	20	23	library	library	NN
2164	20	24	system	system	NN
2164	20	25	set	set	VBD
2164	20	26	up	up	RP
2164	20	27	its	-PRON-	PRP$
2164	20	28	computer	computer	NN
2164	20	29	waiting	wait	VBG
2164	20	30	queue	queue	NN
2164	20	31	to	to	TO
2164	20	32	achieve	achieve	VB
2164	20	33	express	express	JJ
2164	20	34	-	-	HYPH
2164	20	35	lane	lane	NN
2164	20	36	type	type	NN
2164	20	37	service	service	NN
2164	20	38	without	without	IN
2164	20	39	splitting	split	VBG
2164	20	40	the	the	DT
2164	20	41	set	set	NN
2164	20	42	of	of	IN
2164	20	43	public	public	JJ
2164	20	44	internet	internet	NN
2164	20	45	computers	computer	NNS
2164	20	46	into	into	IN
2164	20	47	partitions	partition	NNS
2164	20	48	that	that	WDT
2164	20	49	operate	operate	VBP
2164	20	50	separately	separately	RB
2164	20	51	and	and	CC
2164	20	52	in	in	IN
2164	20	53	parallel	parallel	NN
2164	20	54	?	?	.
2164	21	1	Several	several	JJ
2164	21	2	such	such	JJ
2164	21	3	strategies	strategy	NNS
2164	21	4	are	be	VBP
2164	21	5	presented	present	VBN
2164	21	6	here	here	RB
2164	21	7	along	along	IN
2164	21	8	with	with	IN
2164	21	9	the	the	DT
2164	21	10	results	result	NNS
2164	21	11	of	of	IN
2164	21	12	how	how	WRB
2164	21	13	each	each	DT
2164	21	14	performed	perform	VBN
2164	21	15	in	in	IN
2164	21	16	a	a	DT
2164	21	17	computer	computer	NN
2164	21	18	simulation	simulation	NN
2164	21	19	using	use	VBG
2164	21	20	actual	actual	JJ
2164	21	21	customer	customer	NN
2164	21	22	usage	usage	NN
2164	21	23	data	datum	NNS
2164	21	24	from	from	IN
2164	21	25	a	a	DT
2164	21	26	public	public	JJ
2164	21	27	library	library	NN
2164	21	28	.	.	.
2164	22	1	STRATEGIES	STRATEGIES	NNP
2164	22	2	Queuing	Queuing	NNP
2164	22	3	systems	system	NNS
2164	22	4	are	be	VBP
2164	22	5	heavily	heavily	RB
2164	22	6	researched	research	VBN
2164	22	7	in	in	IN
2164	22	8	a	a	DT
2164	22	9	number	number	NN
2164	22	10	of	of	IN
2164	22	11	disciplines	discipline	NNS
2164	22	12	,	,	,
2164	22	13	particularly	particularly	RB
2164	22	14	computer	computer	NN
2164	22	15	science	science	NN
2164	22	16	and	and	CC
2164	22	17	operations	operation	NNS
2164	22	18	research	research	NN
2164	22	19	.	.	.
2164	23	1	The	the	DT
2164	23	2	complexity	complexity	NN
2164	23	3	and	and	CC
2164	23	4	sheer	sheer	JJ
2164	23	5	number	number	NN
2164	23	6	of	of	IN
2164	23	7	different	different	JJ
2164	23	8	queuing	queuing	NN
2164	23	9	models	model	NNS
2164	23	10	can	can	MD
2164	23	11	present	present	VB
2164	23	12	a	a	DT
2164	23	13	formidable	formidable	JJ
2164	23	14	barrier	barrier	NN
2164	23	15	to	to	IN
2164	23	16	library	library	JJ
2164	23	17	professionals	professional	NNS
2164	23	18	.	.	.
2164	24	1	This	this	DT
2164	24	2	is	be	VBZ
2164	24	3	because	because	IN
2164	24	4	,	,	,
2164	24	5	in	in	IN
2164	24	6	the	the	DT
2164	24	7	absence	absence	NN
2164	24	8	of	of	IN
2164	24	9	real	real	JJ
2164	24	10	-	-	HYPH
2164	24	11	world	world	NN
2164	24	12	data	datum	NNS
2164	24	13	,	,	,
2164	24	14	it	-PRON-	PRP
2164	24	15	is	be	VBZ
2164	24	16	often	often	RB
2164	24	17	necessary	necessary	JJ
2164	24	18	to	to	TO
2164	24	19	analyze	analyze	VB
2164	24	20	a	a	DT
2164	24	21	queuing	queuing	NN
2164	24	22	system	system	NN
2164	24	23	mathematically	mathematically	RB
2164	24	24	by	by	IN
2164	24	25	approximating	approximate	VBG
2164	24	26	its	-PRON-	PRP$
2164	24	27	key	key	JJ
2164	24	28	features	feature	NNS
2164	24	29	with	with	IN
2164	24	30	an	an	DT
2164	24	31	applicable	applicable	JJ
2164	24	32	probability	probability	NN
2164	24	33	distribution	distribution	NN
2164	24	34	.	.	.
2164	25	1	Unfortunately	unfortunately	RB
2164	25	2	,	,	,
2164	25	3	applying	apply	VBG
2164	25	4	these	these	DT
2164	25	5	distributions	distribution	NNS
2164	25	6	entails	entail	VBZ
2164	25	7	adopting	adopt	VBG
2164	25	8	their	-PRON-	PRP$
2164	25	9	underlying	underlie	VBG
2164	25	10	assumptions	assumption	NNS
2164	25	11	as	as	RB
2164	25	12	well	well	RB
2164	25	13	as	as	IN
2164	25	14	any	any	DT
2164	25	15	additional	additional	JJ
2164	25	16	assumptions	assumption	NNS
2164	25	17	involved	involve	VBN
2164	25	18	in	in	IN
2164	25	19	calculating	calculate	VBG
2164	25	20	the	the	DT
2164	25	21	input	input	NN
2164	25	22	parameters	parameter	NNS
2164	25	23	.	.	.
2164	26	1	For	for	IN
2164	26	2	instance	instance	NN
2164	26	3	,	,	,
2164	26	4	the	the	DT
2164	26	5	Poisson	Poisson	NNP
2164	26	6	distribution	distribution	NN
2164	26	7	(	(	-LRB-
2164	26	8	used	use	VBN
2164	26	9	to	to	TO
2164	26	10	approximate	approximate	VB
2164	26	11	customer	customer	NN
2164	26	12	arrival	arrival	NN
2164	26	13	rates	rate	NNS
2164	26	14	)	)	-RRB-
2164	26	15	requires	require	VBZ
2164	26	16	that	that	IN
2164	26	17	the	the	DT
2164	26	18	expected	expect	VBN
2164	26	19	arrival	arrival	NN
2164	26	20	rate	rate	NN
2164	26	21	be	be	VB
2164	26	22	uniform	uniform	JJ
2164	26	23	across	across	IN
2164	26	24	all	all	DT
2164	26	25	time	time	NN
2164	26	26	intervals	interval	NNS
2164	26	27	,	,	,
2164	26	28	an	an	DT
2164	26	29	assumption	assumption	NN
2164	26	30	which	which	WDT
2164	26	31	is	be	VBZ
2164	26	32	clearly	clearly	RB
2164	26	33	violated	violate	VBN
2164	26	34	when	when	WRB
2164	26	35	school	school	NN
2164	26	36	lets	let	VBZ
2164	26	37	out	out	RP
2164	26	38	and	and	CC
2164	26	39	teenagers	teenager	NNS
2164	26	40	suddenly	suddenly	RB
2164	26	41	swarm	swarm	VBP
2164	26	42	the	the	DT
2164	26	43	computers.2	computers.2	CD
2164	26	44	Even	even	RB
2164	26	45	if	if	IN
2164	26	46	we	-PRON-	PRP
2164	26	47	can	can	MD
2164	26	48	account	account	VB
2164	26	49	for	for	IN
2164	26	50	such	such	JJ
2164	26	51	discrepancies	discrepancy	NNS
2164	26	52	,	,	,
2164	26	53	there	there	EX
2164	26	54	remains	remain	VBZ
2164	26	55	the	the	DT
2164	26	56	difficulty	difficulty	NN
2164	26	57	of	of	IN
2164	26	58	estimating	estimate	VBG
2164	26	59	the	the	DT
2164	26	60	correct	correct	JJ
2164	26	61	arrival	arrival	NN
2164	26	62	rate	rate	NN
2164	26	63	parameter	parameter	NN
2164	26	64	for	for	IN
2164	26	65	each	each	DT
2164	26	66	discrete	discrete	JJ
2164	26	67	time	time	NN
2164	26	68	interval	interval	NN
2164	26	69	being	be	VBG
2164	26	70	analyzed	analyze	VBN
2164	26	71	.	.	.
2164	27	1	Fortunately	fortunately	RB
2164	27	2	,	,	,
2164	27	3	many	many	JJ
2164	27	4	libraries	library	NNS
2164	27	5	now	now	RB
2164	27	6	use	use	VBP
2164	27	7	automated	automate	VBN
2164	27	8	computer	computer	NN
2164	27	9	sign	sign	NN
2164	27	10	-	-	HYPH
2164	27	11	up	up	RP
2164	27	12	systems	system	NNS
2164	27	13	which	which	WDT
2164	27	14	provide	provide	VBP
2164	27	15	access	access	NN
2164	27	16	to	to	IN
2164	27	17	vast	vast	JJ
2164	27	18	amounts	amount	NNS
2164	27	19	of	of	IN
2164	27	20	real	real	JJ
2164	27	21	-	-	HYPH
2164	27	22	world	world	NN
2164	27	23	data	datum	NNS
2164	27	24	.	.	.
2164	28	1	With	with	IN
2164	28	2	realistic	realistic	JJ
2164	28	3	data	datum	NNS
2164	28	4	,	,	,
2164	28	5	it	-PRON-	PRP
2164	28	6	is	be	VBZ
2164	28	7	possible	possible	JJ
2164	28	8	to	to	TO
2164	28	9	simulate	simulate	VB
2164	28	10	various	various	JJ
2164	28	11	queuing	queuing	NN
2164	28	12	strategies	strategy	NNS
2164	28	13	,	,	,
2164	28	14	a	a	DT
2164	28	15	few	few	JJ
2164	28	16	of	of	IN
2164	28	17	which	which	WDT
2164	28	18	will	will	MD
2164	28	19	be	be	VB
2164	28	20	analyzed	analyze	VBN
2164	28	21	in	in	IN
2164	28	22	this	this	DT
2164	28	23	article	article	NN
2164	28	24	.	.	.
2164	29	1	A	a	DT
2164	29	2	computer	computer	NN
2164	29	3	simulation	simulation	NN
2164	29	4	using	use	VBG
2164	29	5	real	real	JJ
2164	29	6	-	-	HYPH
2164	29	7	world	world	NN
2164	29	8	data	datum	NNS
2164	29	9	provides	provide	VBZ
2164	29	10	a	a	DT
2164	29	11	good	good	JJ
2164	29	12	picture	picture	NN
2164	29	13	of	of	IN
2164	29	14	the	the	DT
2164	29	15	practical	practical	JJ
2164	29	16	implications	implication	NNS
2164	29	17	of	of	IN
2164	29	18	any	any	DT
2164	29	19	queuing	queuing	NN
2164	29	20	strategy	strategy	NN
2164	29	21	we	-PRON-	PRP
2164	29	22	care	care	VBP
2164	29	23	to	to	TO
2164	29	24	devise	devise	VB
2164	29	25	without	without	IN
2164	29	26	the	the	DT
2164	29	27	need	need	NN
2164	29	28	for	for	IN
2164	29	29	complex	complex	JJ
2164	29	30	models	model	NNS
2164	29	31	.	.	.
2164	30	1	As	as	IN
2164	30	2	is	be	VBZ
2164	30	3	often	often	RB
2164	30	4	the	the	DT
2164	30	5	case	case	NN
2164	30	6	,	,	,
2164	30	7	designing	design	VBG
2164	30	8	a	a	DT
2164	30	9	waiting	wait	VBG
2164	30	10	queue	queue	NN
2164	30	11	strategy	strategy	NN
2164	30	12	involves	involve	VBZ
2164	30	13	striking	strike	VBG
2164	30	14	a	a	DT
2164	30	15	balance	balance	NN
2164	30	16	among	among	IN
2164	30	17	competing	compete	VBG
2164	30	18	factors	factor	NNS
2164	30	19	.	.	.
2164	31	1	For	for	IN
2164	31	2	instance	instance	NN
2164	31	3	,	,	,
2164	31	4	one	one	CD
2164	31	5	way	way	NN
2164	31	6	of	of	IN
2164	31	7	reducing	reduce	VBG
2164	31	8	waiting	waiting	NN
2164	31	9	times	time	NNS
2164	31	10	involves	involve	VBZ
2164	31	11	breaking	break	VBG
2164	31	12	with	with	IN
2164	31	13	the	the	DT
2164	31	14	FCFS	FCFS	NNP
2164	31	15	rule	rule	NN
2164	31	16	and	and	CC
2164	31	17	allowing	allow	VBG
2164	31	18	users	user	NNS
2164	31	19	in	in	IN
2164	31	20	one	one	CD
2164	31	21	category	category	NN
2164	31	22	to	to	TO
2164	31	23	cut	cut	VB
2164	31	24	in	in	IN
2164	31	25	front	front	NN
2164	31	26	of	of	IN
2164	31	27	other	other	JJ
2164	31	28	users	user	NNS
2164	31	29	.	.	.
2164	32	1	How	how	WRB
2164	32	2	many	many	JJ
2164	32	3	cuts	cut	NNS
2164	32	4	are	be	VBP
2164	32	5	acceptable	acceptable	JJ
2164	32	6	?	?	.
2164	33	1	Does	do	VBZ
2164	33	2	the	the	DT
2164	33	3	shorter	short	JJR
2164	33	4	wait	wait	VB
2164	33	5	time	time	NN
2164	33	6	for	for	IN
2164	33	7	users	user	NNS
2164	33	8	in	in	IN
2164	33	9	one	one	CD
2164	33	10	category	category	NN
2164	33	11	justify	justify	VBP
2164	33	12	the	the	DT
2164	33	13	longer	long	JJR
2164	33	14	waits	wait	NNS
2164	33	15	in	in	IN
2164	33	16	another	another	DT
2164	33	17	?	?	.
2164	34	1	There	there	EX
2164	34	2	are	be	VBP
2164	34	3	no	no	DT
2164	34	4	right	right	JJ
2164	34	5	answers	answer	NNS
2164	34	6	to	to	IN
2164	34	7	these	these	DT
2164	34	8	questions	question	NNS
2164	34	9	.	.	.
2164	35	1	While	while	IN
2164	35	2	simulating	simulate	VBG
2164	35	3	a	a	DT
2164	35	4	strategy	strategy	NN
2164	35	5	can	can	MD
2164	35	6	provide	provide	VB
2164	35	7	a	a	DT
2164	35	8	realistic	realistic	JJ
2164	35	9	picture	picture	NN
2164	35	10	of	of	IN
2164	35	11	its	-PRON-	PRP$
2164	35	12	results	result	NNS
2164	35	13	in	in	IN
2164	35	14	terms	term	NNS
2164	35	15	of	of	IN
2164	35	16	waiting	wait	VBG
2164	35	17	times	time	NNS
2164	35	18	,	,	,
2164	35	19	evaluating	evaluate	VBG
2164	35	20	which	which	WDT
2164	35	21	strategy	strategy	NN
2164	35	22	’s	’s	NN
2164	35	23	results	result	NNS
2164	35	24	are	be	VBP
2164	35	25	preferable	preferable	JJ
2164	35	26	for	for	IN
2164	35	27	a	a	DT
2164	35	28	particular	particular	JJ
2164	35	29	library	library	NN
2164	35	30	must	must	MD
2164	35	31	be	be	VB
2164	35	32	done	do	VBN
2164	35	33	on	on	IN
2164	35	34	a	a	DT
2164	35	35	case	case	NN
2164	35	36	-	-	HYPH
2164	35	37	by	by	IN
2164	35	38	-	-	HYPH
2164	35	39	case	case	NN
2164	35	40	basis	basis	NN
2164	35	41	.	.	.
2164	36	1	In	in	IN
2164	36	2	addition	addition	NN
2164	36	3	to	to	IN
2164	36	4	the	the	DT
2164	36	5	standard	standard	JJ
2164	36	6	FCFS	FCFS	NNP
2164	36	7	strategy	strategy	NN
2164	36	8	with	with	IN
2164	36	9	a	a	DT
2164	36	10	single	single	JJ
2164	36	11	pool	pool	NN
2164	36	12	of	of	IN
2164	36	13	computers	computer	NNS
2164	36	14	and	and	CC
2164	36	15	the	the	DT
2164	36	16	same	same	JJ
2164	36	17	FCFS	FCFS	NNP
2164	36	18	strategy	strategy	NN
2164	36	19	implemented	implement	VBN
2164	36	20	with	with	IN
2164	36	21	one	one	CD
2164	36	22	computer	computer	NN
2164	36	23	removed	remove	VBN
2164	36	24	from	from	IN
2164	36	25	the	the	DT
2164	36	26	pool	pool	NN
2164	36	27	to	to	TO
2164	36	28	serve	serve	VB
2164	36	29	as	as	IN
2164	36	30	a	a	DT
2164	36	31	dedicated	dedicated	JJ
2164	36	32	fifteen-	fifteen-	NN
2164	36	33	PUBLIC	PUBLIC	NNP
2164	36	34	LIBRARY	LIBRARY	NNP
2164	36	35	COMPUTER	computer	NN
2164	36	36	WAITING	waiting	NN
2164	36	37	QUEUES	QUEUES	NNP
2164	36	38	|	|	NNP
2164	36	39	WILLIAMSON	williamson	NN
2164	36	40	74	74	CD
2164	36	41	minute	minute	NN
2164	36	42	express	express	JJ
2164	36	43	computer	computer	NN
2164	36	44	(	(	-LRB-
2164	36	45	referred	refer	VBN
2164	36	46	to	to	IN
2164	36	47	as	as	IN
2164	36	48	FCFS-15	fcfs-15	CD
2164	36	49	)	)	-RRB-
2164	36	50	,	,	,
2164	36	51	we	-PRON-	PRP
2164	36	52	will	will	MD
2164	36	53	consider	consider	VB
2164	36	54	for	for	IN
2164	36	55	comparison	comparison	NN
2164	36	56	three	three	CD
2164	36	57	other	other	JJ
2164	36	58	well	well	RB
2164	36	59	-	-	HYPH
2164	36	60	known	know	VBN
2164	36	61	alternative	alternative	JJ
2164	36	62	queuing	queuing	NN
2164	36	63	strategies	strategy	NNS
2164	36	64	:	:	:
2164	36	65	Shortest	short	JJS
2164	36	66	-	-	HYPH
2164	36	67	Job	Job	NNP
2164	36	68	-	-	HYPH
2164	36	69	First	First	NNP
2164	36	70	(	(	-LRB-
2164	36	71	SJF	SJF	NNP
2164	36	72	)	)	-RRB-
2164	36	73	,	,	,
2164	36	74	Highest	high	JJS
2164	36	75	-	-	HYPH
2164	36	76	Response	response	NN
2164	36	77	-	-	HYPH
2164	36	78	Ratio	ratio	NN
2164	36	79	-	-	HYPH
2164	36	80	Next	Next	NNP
2164	36	81	(	(	-LRB-
2164	36	82	HRRN	HRRN	NNP
2164	36	83	)	)	-RRB-
2164	36	84	,	,	,
2164	36	85	and	and	CC
2164	36	86	a	a	DT
2164	36	87	variant	variant	NN
2164	36	88	of	of	IN
2164	36	89	Shortest	short	JJS
2164	36	90	-	-	HYPH
2164	36	91	Job	Job	NNP
2164	36	92	-	-	HYPH
2164	36	93	First	First	NNP
2164	36	94	(	(	-LRB-
2164	36	95	SJF	SJF	NNP
2164	36	96	-	-	HYPH
2164	36	97	FB	FB	NNP
2164	36	98	)	)	-RRB-
2164	36	99	which	which	WDT
2164	36	100	employs	employ	VBZ
2164	36	101	a	a	DT
2164	36	102	feedback	feedback	NN
2164	36	103	mechanism	mechanism	NN
2164	36	104	to	to	TO
2164	36	105	restrict	restrict	VB
2164	36	106	the	the	DT
2164	36	107	number	number	NN
2164	36	108	of	of	IN
2164	36	109	times	time	NNS
2164	36	110	a	a	DT
2164	36	111	given	give	VBN
2164	36	112	user	user	NN
2164	36	113	may	may	MD
2164	36	114	be	be	VB
2164	36	115	bypassed	bypass	VBN
2164	36	116	in	in	IN
2164	36	117	the	the	DT
2164	36	118	queue.3	queue.3	NN
2164	36	119	The	the	DT
2164	36	120	three	three	CD
2164	36	121	alternative	alternative	JJ
2164	36	122	strategies	strategy	NNS
2164	36	123	all	all	DT
2164	36	124	require	require	VBP
2164	36	125	advance	advance	JJ
2164	36	126	knowledge	knowledge	NN
2164	36	127	or	or	CC
2164	36	128	estimation	estimation	NN
2164	36	129	of	of	IN
2164	36	130	how	how	WRB
2164	36	131	long	long	JJ
2164	36	132	each	each	DT
2164	36	133	particular	particular	JJ
2164	36	134	computer	computer	NN
2164	36	135	session	session	NN
2164	36	136	will	will	MD
2164	36	137	last	last	VB
2164	36	138	.	.	.
2164	37	1	In	in	IN
2164	37	2	our	-PRON-	PRP$
2164	37	3	case	case	NN
2164	37	4	,	,	,
2164	37	5	this	this	DT
2164	37	6	means	mean	VBZ
2164	37	7	customers	customer	NNS
2164	37	8	would	would	MD
2164	37	9	need	need	VB
2164	37	10	to	to	TO
2164	37	11	indicate	indicate	VB
2164	37	12	how	how	WRB
2164	37	13	long	long	RB
2164	37	14	of	of	IN
2164	37	15	a	a	DT
2164	37	16	session	session	NN
2164	37	17	they	-PRON-	PRP
2164	37	18	desire	desire	VBP
2164	37	19	upon	upon	IN
2164	37	20	first	first	JJ
2164	37	21	signing	sign	VBG
2164	37	22	up	up	RP
2164	37	23	for	for	IN
2164	37	24	a	a	DT
2164	37	25	computer	computer	NN
2164	37	26	.	.	.
2164	38	1	Any	any	DT
2164	38	2	number	number	NN
2164	38	3	of	of	IN
2164	38	4	minutes	minute	NNS
2164	38	5	is	be	VBZ
2164	38	6	acceptable	acceptable	JJ
2164	38	7	so	so	IN
2164	38	8	we	-PRON-	PRP
2164	38	9	will	will	MD
2164	38	10	limit	limit	VB
2164	38	11	the	the	DT
2164	38	12	sign	sign	VB
2164	38	13	-	-	HYPH
2164	38	14	up	up	RP
2164	38	15	options	option	NNS
2164	38	16	to	to	IN
2164	38	17	four	four	CD
2164	38	18	categories	category	NNS
2164	38	19	in	in	IN
2164	38	20	fifteen	fifteen	CD
2164	38	21	-	-	HYPH
2164	38	22	minute	minute	NN
2164	38	23	intervals	interval	NNS
2164	38	24	:	:	:
2164	38	25	fifteen	fifteen	CD
2164	38	26	minutes	minute	NNS
2164	38	27	,	,	,
2164	38	28	thirty	thirty	CD
2164	38	29	minutes	minute	NNS
2164	38	30	,	,	,
2164	38	31	forty	forty	CD
2164	38	32	-	-	HYPH
2164	38	33	five	five	CD
2164	38	34	minutes	minute	NNS
2164	38	35	,	,	,
2164	38	36	and	and	CC
2164	38	37	sixty	sixty	CD
2164	38	38	minutes	minute	NNS
2164	38	39	.	.	.
2164	39	1	Each	each	DT
2164	39	2	session	session	NN
2164	39	3	will	will	MD
2164	39	4	then	then	RB
2164	39	5	be	be	VB
2164	39	6	initially	initially	RB
2164	39	7	categorized	categorize	VBN
2164	39	8	into	into	IN
2164	39	9	one	one	CD
2164	39	10	of	of	IN
2164	39	11	four	four	CD
2164	39	12	priority	priority	NN
2164	39	13	classes	class	NNS
2164	39	14	(	(	-LRB-
2164	39	15	P1	p1	NN
2164	39	16	,	,	,
2164	39	17	P2	P2	NNP
2164	39	18	,	,	,
2164	39	19	P3	p3	NN
2164	39	20	,	,	,
2164	39	21	and	and	CC
2164	39	22	P4	p4	NN
2164	39	23	)	)	-RRB-
2164	39	24	accordingly	accordingly	RB
2164	39	25	.	.	.
2164	40	1	As	as	IN
2164	40	2	the	the	DT
2164	40	3	data	data	NN
2164	40	4	will	will	MD
2164	40	5	show	show	VB
2164	40	6	,	,	,
2164	40	7	customers	customer	NNS
2164	40	8	selecting	select	VBG
2164	40	9	shorter	short	JJR
2164	40	10	sessions	session	NNS
2164	40	11	are	be	VBP
2164	40	12	given	give	VBN
2164	40	13	a	a	DT
2164	40	14	higher	high	JJR
2164	40	15	priority	priority	NN
2164	40	16	in	in	IN
2164	40	17	the	the	DT
2164	40	18	queue	queue	NN
2164	40	19	and	and	CC
2164	40	20	will	will	MD
2164	40	21	thus	thus	RB
2164	40	22	have	have	VB
2164	40	23	a	a	DT
2164	40	24	shorter	shorter	RBR
2164	40	25	expected	expect	VBN
2164	40	26	waiting	wait	VBG
2164	40	27	time	time	NN
2164	40	28	.	.	.
2164	41	1	It	-PRON-	PRP
2164	41	2	should	should	MD
2164	41	3	be	be	VB
2164	41	4	noted	note	VBN
2164	41	5	that	that	IN
2164	41	6	relying	rely	VBG
2164	41	7	on	on	IN
2164	41	8	users	user	NNS
2164	41	9	to	to	TO
2164	41	10	choose	choose	VB
2164	41	11	their	-PRON-	PRP$
2164	41	12	own	own	JJ
2164	41	13	session	session	NN
2164	41	14	length	length	NN
2164	41	15	presents	present	VBZ
2164	41	16	its	-PRON-	PRP$
2164	41	17	own	own	JJ
2164	41	18	set	set	NN
2164	41	19	of	of	IN
2164	41	20	problems	problem	NNS
2164	41	21	.	.	.
2164	42	1	It	-PRON-	PRP
2164	42	2	is	be	VBZ
2164	42	3	often	often	RB
2164	42	4	difficult	difficult	JJ
2164	42	5	to	to	TO
2164	42	6	estimate	estimate	VB
2164	42	7	how	how	WRB
2164	42	8	much	much	JJ
2164	42	9	time	time	NN
2164	42	10	will	will	MD
2164	42	11	be	be	VB
2164	42	12	required	require	VBN
2164	42	13	to	to	TO
2164	42	14	accomplish	accomplish	VB
2164	42	15	a	a	DT
2164	42	16	given	give	VBN
2164	42	17	set	set	NN
2164	42	18	of	of	IN
2164	42	19	tasks	task	NNS
2164	42	20	online	online	RB
2164	42	21	.	.	.
2164	43	1	However	however	RB
2164	43	2	,	,	,
2164	43	3	users	user	NNS
2164	43	4	face	face	VBP
2164	43	5	a	a	DT
2164	43	6	similar	similar	JJ
2164	43	7	difficulty	difficulty	NN
2164	43	8	in	in	IN
2164	43	9	deciding	decide	VBG
2164	43	10	whether	whether	IN
2164	43	11	to	to	IN
2164	43	12	opt	opt	VB
2164	43	13	for	for	IN
2164	43	14	a	a	DT
2164	43	15	dedicated	dedicated	JJ
2164	43	16	fifteen	fifteen	CD
2164	43	17	-	-	HYPH
2164	43	18	minute	minute	NN
2164	43	19	computer	computer	NN
2164	43	20	under	under	IN
2164	43	21	the	the	DT
2164	43	22	FCFS-15	fcfs-15	CD
2164	43	23	system	system	NN
2164	43	24	.	.	.
2164	44	1	The	the	DT
2164	44	2	trade	trade	NN
2164	44	3	-	-	HYPH
2164	44	4	off	off	NN
2164	44	5	between	between	IN
2164	44	6	use	use	NN
2164	44	7	time	time	NN
2164	44	8	and	and	CC
2164	44	9	wait	wait	VB
2164	44	10	time	time	NN
2164	44	11	should	should	MD
2164	44	12	provide	provide	VB
2164	44	13	an	an	DT
2164	44	14	incentive	incentive	NN
2164	44	15	for	for	IN
2164	44	16	some	some	DT
2164	44	17	users	user	NNS
2164	44	18	to	to	IN
2164	44	19	self	self	NN
2164	44	20	-	-	HYPH
2164	44	21	ration	ration	NN
2164	44	22	their	-PRON-	PRP$
2164	44	23	computer	computer	NN
2164	44	24	use	use	NN
2164	44	25	,	,	,
2164	44	26	placing	place	VBG
2164	44	27	an	an	DT
2164	44	28	additional	additional	JJ
2164	44	29	downward	downward	JJ
2164	44	30	pressure	pressure	NN
2164	44	31	on	on	IN
2164	44	32	wait	wait	NN
2164	44	33	times	time	NNS
2164	44	34	.	.	.
2164	45	1	However	however	RB
2164	45	2	,	,	,
2164	45	3	user	user	NN
2164	45	4	adaptations	adaptation	NNS
2164	45	5	in	in	IN
2164	45	6	response	response	NN
2164	45	7	to	to	IN
2164	45	8	various	various	JJ
2164	45	9	queuing	queuing	NN
2164	45	10	strategies	strategy	NNS
2164	45	11	are	be	VBP
2164	45	12	outside	outside	IN
2164	45	13	the	the	DT
2164	45	14	scope	scope	NN
2164	45	15	of	of	IN
2164	45	16	this	this	DT
2164	45	17	analysis	analysis	NN
2164	45	18	and	and	CC
2164	45	19	will	will	MD
2164	45	20	not	not	RB
2164	45	21	be	be	VB
2164	45	22	considered	consider	VBN
2164	45	23	further	further	RB
2164	45	24	.	.	.
2164	46	1	The	the	DT
2164	46	2	Shortest	shortest	RBS
2164	46	3	-	-	HYPH
2164	46	4	Job	Job	NNP
2164	46	5	-	-	HYPH
2164	46	6	First	First	NNP
2164	46	7	(	(	-LRB-
2164	46	8	SJF	SJF	NNP
2164	46	9	)	)	-RRB-
2164	46	10	strategy	strategy	NN
2164	46	11	functions	function	NNS
2164	46	12	by	by	IN
2164	46	13	simply	simply	RB
2164	46	14	selecting	select	VBG
2164	46	15	from	from	IN
2164	46	16	the	the	DT
2164	46	17	queue	queue	NN
2164	46	18	the	the	DT
2164	46	19	user	user	NN
2164	46	20	in	in	IN
2164	46	21	the	the	DT
2164	46	22	highest	high	JJS
2164	46	23	priority	priority	NN
2164	46	24	class	class	NN
2164	46	25	.	.	.
2164	47	1	The	the	DT
2164	47	2	amount	amount	NN
2164	47	3	of	of	IN
2164	47	4	time	time	NN
2164	47	5	spent	spend	VBN
2164	47	6	waiting	wait	VBG
2164	47	7	by	by	IN
2164	47	8	each	each	DT
2164	47	9	user	user	NN
2164	47	10	is	be	VBZ
2164	47	11	only	only	RB
2164	47	12	considered	consider	VBN
2164	47	13	as	as	IN
2164	47	14	a	a	DT
2164	47	15	tie	tie	NN
2164	47	16	breaker	breaker	NN
2164	47	17	among	among	IN
2164	47	18	users	user	NNS
2164	47	19	occupying	occupy	VBG
2164	47	20	the	the	DT
2164	47	21	same	same	JJ
2164	47	22	priority	priority	NN
2164	47	23	class	class	NN
2164	47	24	.	.	.
2164	48	1	Our	-PRON-	PRP$
2164	48	2	results	result	NNS
2164	48	3	demonstrate	demonstrate	VBP
2164	48	4	that	that	IN
2164	48	5	the	the	DT
2164	48	6	SJF	SJF	NNP
2164	48	7	strategy	strategy	NN
2164	48	8	is	be	VBZ
2164	48	9	generally	generally	RB
2164	48	10	best	good	JJS
2164	48	11	for	for	IN
2164	48	12	minimizing	minimize	VBG
2164	48	13	overall	overall	JJ
2164	48	14	average	average	JJ
2164	48	15	waiting	waiting	NN
2164	48	16	time	time	NN
2164	48	17	as	as	RB
2164	48	18	well	well	RB
2164	48	19	as	as	IN
2164	48	20	for	for	IN
2164	48	21	getting	get	VBG
2164	48	22	customers	customer	NNS
2164	48	23	needing	need	VBG
2164	48	24	the	the	DT
2164	48	25	least	least	JJS
2164	48	26	amount	amount	NN
2164	48	27	of	of	IN
2164	48	28	computer	computer	NN
2164	48	29	time	time	NN
2164	48	30	online	online	RB
2164	48	31	the	the	DT
2164	48	32	fastest	fast	JJS
2164	48	33	.	.	.
2164	49	1	The	the	DT
2164	49	2	main	main	JJ
2164	49	3	drawbacks	drawback	NNS
2164	49	4	of	of	IN
2164	49	5	this	this	DT
2164	49	6	strategy	strategy	NN
2164	49	7	are	be	VBP
2164	49	8	that	that	IN
2164	49	9	these	these	DT
2164	49	10	gains	gain	NNS
2164	49	11	come	come	VBP
2164	49	12	at	at	IN
2164	49	13	the	the	DT
2164	49	14	expense	expense	NN
2164	49	15	of	of	IN
2164	49	16	more	more	JJR
2164	49	17	line	line	NN
2164	49	18	cuts	cut	NNS
2164	49	19	and	and	CC
2164	49	20	higher	high	JJR
2164	49	21	average	average	JJ
2164	49	22	and	and	CC
2164	49	23	maximum	maximum	JJ
2164	49	24	waiting	waiting	NN
2164	49	25	times	time	NNS
2164	49	26	for	for	IN
2164	49	27	the	the	DT
2164	49	28	lowest	low	JJS
2164	49	29	priority	priority	NN
2164	49	30	users	user	NNS
2164	49	31	—	—	:
2164	49	32	those	those	DT
2164	49	33	needing	need	VBG
2164	49	34	the	the	DT
2164	49	35	longest	long	JJS
2164	49	36	sessions	session	NNS
2164	49	37	(	(	-LRB-
2164	49	38	sixty	sixty	CD
2164	49	39	minutes	minute	NNS
2164	49	40	)	)	-RRB-
2164	49	41	.	.	.
2164	50	1	There	there	EX
2164	50	2	is	be	VBZ
2164	50	3	no	no	DT
2164	50	4	limit	limit	NN
2164	50	5	to	to	IN
2164	50	6	how	how	WRB
2164	50	7	many	many	JJ
2164	50	8	times	time	NNS
2164	50	9	a	a	DT
2164	50	10	user	user	NN
2164	50	11	can	can	MD
2164	50	12	be	be	VB
2164	50	13	passed	pass	VBN
2164	50	14	over	over	RP
2164	50	15	in	in	IN
2164	50	16	the	the	DT
2164	50	17	queue	queue	NN
2164	50	18	.	.	.
2164	51	1	In	in	IN
2164	51	2	theory	theory	NN
2164	51	3	,	,	,
2164	51	4	this	this	DT
2164	51	5	means	mean	VBZ
2164	51	6	that	that	IN
2164	51	7	such	such	PDT
2164	51	8	a	a	DT
2164	51	9	user	user	NN
2164	51	10	could	could	MD
2164	51	11	be	be	VB
2164	51	12	continually	continually	RB
2164	51	13	bypassed	bypass	VBN
2164	51	14	and	and	CC
2164	51	15	never	never	RB
2164	51	16	be	be	VB
2164	51	17	assigned	assign	VBN
2164	51	18	a	a	DT
2164	51	19	computer	computer	NN
2164	51	20	during	during	IN
2164	51	21	the	the	DT
2164	51	22	day	day	NN
2164	51	23	.	.	.
2164	52	1	The	the	DT
2164	52	2	SJF	SJF	NNP
2164	52	3	-	-	HYPH
2164	52	4	FB	FB	NNP
2164	52	5	strategy	strategy	NN
2164	52	6	is	be	VBZ
2164	52	7	a	a	DT
2164	52	8	variant	variant	NN
2164	52	9	of	of	IN
2164	52	10	SJF	SJF	NNP
2164	52	11	with	with	IN
2164	52	12	the	the	DT
2164	52	13	addition	addition	NN
2164	52	14	of	of	IN
2164	52	15	a	a	DT
2164	52	16	feedback	feedback	NN
2164	52	17	mechanism	mechanism	NN
2164	52	18	that	that	WDT
2164	52	19	increases	increase	VBZ
2164	52	20	the	the	DT
2164	52	21	priority	priority	NN
2164	52	22	of	of	IN
2164	52	23	users	user	NNS
2164	52	24	each	each	DT
2164	52	25	time	time	NN
2164	52	26	they	-PRON-	PRP
2164	52	27	are	be	VBP
2164	52	28	cut	cut	VBN
2164	52	29	in	in	IN
2164	52	30	line	line	NN
2164	52	31	.	.	.
2164	53	1	For	for	IN
2164	53	2	instance	instance	NN
2164	53	3	,	,	,
2164	53	4	if	if	IN
2164	53	5	a	a	DT
2164	53	6	user	user	NN
2164	53	7	signs	sign	NNS
2164	53	8	up	up	RB
2164	53	9	for	for	IN
2164	53	10	a	a	DT
2164	53	11	sixty-	sixty-	JJ
2164	53	12	minute	minute	NN
2164	53	13	session	session	NN
2164	53	14	,	,	,
2164	53	15	he	-PRON-	PRP
2164	53	16	/	/	CC
2164	53	17	she	-PRON-	PRP
2164	53	18	is	be	VBZ
2164	53	19	initially	initially	RB
2164	53	20	assigned	assign	VBN
2164	53	21	a	a	DT
2164	53	22	priority	priority	NN
2164	53	23	of	of	IN
2164	53	24	4	4	CD
2164	53	25	.	.	.
2164	54	1	Suppose	suppose	VB
2164	54	2	that	that	DT
2164	54	3	shortly	shortly	RB
2164	54	4	after	after	IN
2164	54	5	,	,	,
2164	54	6	another	another	DT
2164	54	7	user	user	NN
2164	54	8	signs	sign	VBZ
2164	54	9	up	up	IN
2164	54	10	for	for	IN
2164	54	11	a	a	DT
2164	54	12	thirty	thirty	CD
2164	54	13	-	-	HYPH
2164	54	14	minute	minute	NN
2164	54	15	session	session	NN
2164	54	16	and	and	CC
2164	54	17	is	be	VBZ
2164	54	18	assigned	assign	VBN
2164	54	19	a	a	DT
2164	54	20	priority	priority	NN
2164	54	21	of	of	IN
2164	54	22	2	2	CD
2164	54	23	.	.	.
2164	55	1	The	the	DT
2164	55	2	next	next	JJ
2164	55	3	available	available	JJ
2164	55	4	computer	computer	NN
2164	55	5	will	will	MD
2164	55	6	be	be	VB
2164	55	7	assigned	assign	VBN
2164	55	8	to	to	IN
2164	55	9	the	the	DT
2164	55	10	user	user	NN
2164	55	11	with	with	IN
2164	55	12	the	the	DT
2164	55	13	priority	priority	NN
2164	55	14	2	2	CD
2164	55	15	.	.	.
2164	56	1	The	the	DT
2164	56	2	bypassed	bypassed	JJ
2164	56	3	user	user	NN
2164	56	4	’s	’s	POS
2164	56	5	priority	priority	NN
2164	56	6	will	will	MD
2164	56	7	now	now	RB
2164	56	8	be	be	VB
2164	56	9	bumped	bump	VBN
2164	56	10	up	up	RP
2164	56	11	by	by	IN
2164	56	12	a	a	DT
2164	56	13	set	set	VBN
2164	56	14	interval	interval	NN
2164	56	15	.	.	.
2164	57	1	In	in	IN
2164	57	2	this	this	DT
2164	57	3	simulation	simulation	NN
2164	57	4	an	an	DT
2164	57	5	interval	interval	NN
2164	57	6	of	of	IN
2164	57	7	0.5	0.5	CD
2164	57	8	is	be	VBZ
2164	57	9	used	use	VBN
2164	57	10	so	so	IN
2164	57	11	the	the	DT
2164	57	12	bypassed	bypassed	JJ
2164	57	13	user	user	NN
2164	57	14	’s	’s	POS
2164	57	15	new	new	JJ
2164	57	16	priority	priority	NN
2164	57	17	becomes	become	VBZ
2164	57	18	3.5	3.5	CD
2164	57	19	.	.	.
2164	58	1	As	as	IN
2164	58	2	a	a	DT
2164	58	3	result	result	NN
2164	58	4	,	,	,
2164	58	5	users	user	NNS
2164	58	6	beginning	begin	VBG
2164	58	7	with	with	IN
2164	58	8	a	a	DT
2164	58	9	priority	priority	NN
2164	58	10	of	of	IN
2164	58	11	4	4	CD
2164	58	12	will	will	MD
2164	58	13	reach	reach	VB
2164	58	14	the	the	DT
2164	58	15	highest	high	JJS
2164	58	16	priority	priority	NN
2164	58	17	of	of	IN
2164	58	18	1	1	CD
2164	58	19	after	after	IN
2164	58	20	being	be	VBG
2164	58	21	bypassed	bypass	VBN
2164	58	22	six	six	CD
2164	58	23	times	time	NNS
2164	58	24	and	and	CC
2164	58	25	will	will	MD
2164	58	26	not	not	RB
2164	58	27	be	be	VB
2164	58	28	bypassed	bypass	VBN
2164	58	29	further	far	RBR
2164	58	30	.	.	.
2164	59	1	This	this	DT
2164	59	2	effectively	effectively	RB
2164	59	3	restricts	restrict	VBZ
2164	59	4	the	the	DT
2164	59	5	maximum	maximum	JJ
2164	59	6	number	number	NN
2164	59	7	of	of	IN
2164	59	8	times	time	NNS
2164	59	9	a	a	DT
2164	59	10	user	user	NN
2164	59	11	can	can	MD
2164	59	12	be	be	VB
2164	59	13	cut	cut	VBN
2164	59	14	in	in	IN
2164	59	15	front	front	NN
2164	59	16	of	of	IN
2164	59	17	at	at	IN
2164	59	18	six	six	CD
2164	59	19	.	.	.
2164	60	1	INFORMATION	INFORMATION	NNP
2164	60	2	TECHNOLOGY	technology	NN
2164	60	3	AND	and	CC
2164	60	4	LIBRARIES	LIBRARIES	NNP
2164	60	5	|	|	NNP
2164	60	6	JUNE	JUNE	NNP
2164	60	7	2012	2012	CD
2164	60	8	75	75	CD
2164	60	9	The	the	DT
2164	60	10	final	final	JJ
2164	60	11	alternative	alternative	JJ
2164	60	12	strategy	strategy	NN
2164	60	13	,	,	,
2164	60	14	Highest	high	JJS
2164	60	15	-	-	HYPH
2164	60	16	Response	response	NN
2164	60	17	-	-	HYPH
2164	60	18	Ratio	ratio	NN
2164	60	19	-	-	HYPH
2164	60	20	Next	Next	NNP
2164	60	21	(	(	-LRB-
2164	60	22	HRRN	HRRN	NNP
2164	60	23	)	)	-RRB-
2164	60	24	,	,	,
2164	60	25	is	be	VBZ
2164	60	26	a	a	DT
2164	60	27	balance	balance	NN
2164	60	28	between	between	IN
2164	60	29	FCFS	FCFS	NNP
2164	60	30	and	and	CC
2164	60	31	SJF	SJF	NNP
2164	60	32	.	.	.
2164	61	1	It	-PRON-	PRP
2164	61	2	considers	consider	VBZ
2164	61	3	both	both	DT
2164	61	4	the	the	DT
2164	61	5	arrival	arrival	NN
2164	61	6	time	time	NN
2164	61	7	and	and	CC
2164	61	8	requested	request	VBN
2164	61	9	session	session	NN
2164	61	10	length	length	NN
2164	61	11	when	when	WRB
2164	61	12	assigning	assign	VBG
2164	61	13	a	a	DT
2164	61	14	priority	priority	NN
2164	61	15	to	to	IN
2164	61	16	each	each	DT
2164	61	17	user	user	NN
2164	61	18	in	in	IN
2164	61	19	the	the	DT
2164	61	20	queue	queue	NN
2164	61	21	.	.	.
2164	62	1	Each	each	DT
2164	62	2	time	time	NN
2164	62	3	a	a	DT
2164	62	4	user	user	NN
2164	62	5	is	be	VBZ
2164	62	6	selected	select	VBN
2164	62	7	from	from	IN
2164	62	8	the	the	DT
2164	62	9	queue	queue	NN
2164	62	10	,	,	,
2164	62	11	the	the	DT
2164	62	12	response	response	NN
2164	62	13	ratio	ratio	NN
2164	62	14	is	be	VBZ
2164	62	15	re-	re-	RB
2164	62	16	calculated	calculate	VBN
2164	62	17	for	for	IN
2164	62	18	all	all	DT
2164	62	19	users	user	NNS
2164	62	20	.	.	.
2164	63	1	The	the	DT
2164	63	2	user	user	NN
2164	63	3	with	with	IN
2164	63	4	the	the	DT
2164	63	5	highest	high	JJS
2164	63	6	response	response	NN
2164	63	7	ratio	ratio	NN
2164	63	8	is	be	VBZ
2164	63	9	selected	select	VBN
2164	63	10	and	and	CC
2164	63	11	assigned	assign	VBN
2164	63	12	the	the	DT
2164	63	13	open	open	JJ
2164	63	14	computer	computer	NN
2164	63	15	.	.	.
2164	64	1	The	the	DT
2164	64	2	formula	formula	NN
2164	64	3	for	for	IN
2164	64	4	response	response	NN
2164	64	5	ratio	ratio	NN
2164	64	6	is	be	VBZ
2164	64	7	:	:	:
2164	64	8	(	(	-LRB-
2164	64	9	)	)	-RRB-
2164	64	10	This	this	DT
2164	64	11	allows	allow	VBZ
2164	64	12	users	user	NNS
2164	64	13	with	with	IN
2164	64	14	a	a	DT
2164	64	15	shorter	short	JJR
2164	64	16	session	session	NN
2164	64	17	request	request	NN
2164	64	18	to	to	TO
2164	64	19	cut	cut	VB
2164	64	20	in	in	IN
2164	64	21	line	line	NN
2164	64	22	,	,	,
2164	64	23	but	but	CC
2164	64	24	only	only	RB
2164	64	25	up	up	IN
2164	64	26	to	to	IN
2164	64	27	a	a	DT
2164	64	28	point	point	NN
2164	64	29	.	.	.
2164	65	1	Even	even	RB
2164	65	2	customers	customer	NNS
2164	65	3	requesting	request	VBG
2164	65	4	the	the	DT
2164	65	5	longest	long	JJS
2164	65	6	possible	possible	JJ
2164	65	7	session	session	NN
2164	65	8	move	move	VBP
2164	65	9	up	up	RB
2164	65	10	in	in	IN
2164	65	11	priority	priority	NN
2164	65	12	as	as	IN
2164	65	13	they	-PRON-	PRP
2164	65	14	wait	wait	VBP
2164	65	15	,	,	,
2164	65	16	just	just	RB
2164	65	17	at	at	IN
2164	65	18	a	a	DT
2164	65	19	slower	slow	JJR
2164	65	20	pace	pace	NN
2164	65	21	.	.	.
2164	66	1	This	this	DT
2164	66	2	method	method	NN
2164	66	3	produces	produce	VBZ
2164	66	4	the	the	DT
2164	66	5	same	same	JJ
2164	66	6	benefits	benefit	NNS
2164	66	7	and	and	CC
2164	66	8	drawbacks	drawback	NNS
2164	66	9	as	as	IN
2164	66	10	the	the	DT
2164	66	11	SJF	SJF	NNP
2164	66	12	strategy	strategy	NN
2164	66	13	;	;	:
2164	66	14	but	but	CC
2164	66	15	the	the	DT
2164	66	16	effects	effect	NNS
2164	66	17	of	of	IN
2164	66	18	both	both	DT
2164	66	19	are	be	VBP
2164	66	20	moderated	moderate	VBN
2164	66	21	,	,	,
2164	66	22	and	and	CC
2164	66	23	the	the	DT
2164	66	24	possibility	possibility	NN
2164	66	25	of	of	IN
2164	66	26	unbounded	unbounded	JJ
2164	66	27	waiting	waiting	NN
2164	66	28	is	be	VBZ
2164	66	29	eliminated	eliminate	VBN
2164	66	30	.	.	.
2164	67	1	Still	still	RB
2164	67	2	,	,	,
2164	67	3	although	although	IN
2164	67	4	the	the	DT
2164	67	5	expected	expected	JJ
2164	67	6	number	number	NN
2164	67	7	of	of	IN
2164	67	8	cuts	cut	NNS
2164	67	9	will	will	MD
2164	67	10	be	be	VB
2164	67	11	lower	low	JJR
2164	67	12	using	use	VBG
2164	67	13	HRRN	HRRN	NNP
2164	67	14	than	than	IN
2164	67	15	with	with	IN
2164	67	16	SJF	SJF	NNP
2164	67	17	,	,	,
2164	67	18	there	there	EX
2164	67	19	is	be	VBZ
2164	67	20	no	no	DT
2164	67	21	limit	limit	NN
2164	67	22	on	on	IN
2164	67	23	how	how	WRB
2164	67	24	many	many	JJ
2164	67	25	times	time	NNS
2164	67	26	a	a	DT
2164	67	27	user	user	NN
2164	67	28	may	may	MD
2164	67	29	be	be	VB
2164	67	30	passed	pass	VBN
2164	67	31	over	over	RP
2164	67	32	in	in	IN
2164	67	33	the	the	DT
2164	67	34	queue	queue	NN
2164	67	35	.	.	.
2164	68	1	The	the	DT
2164	68	2	response	response	NN
2164	68	3	ratio	ratio	NN
2164	68	4	formula	formula	NN
2164	68	5	can	can	MD
2164	68	6	be	be	VB
2164	68	7	generalized	generalize	VBN
2164	68	8	by	by	IN
2164	68	9	scaling	scale	VBG
2164	68	10	the	the	DT
2164	68	11	importance	importance	NN
2164	68	12	of	of	IN
2164	68	13	the	the	DT
2164	68	14	waiting	waiting	NN
2164	68	15	time	time	NN
2164	68	16	factor	factor	NN
2164	68	17	.	.	.
2164	69	1	For	for	IN
2164	69	2	instance	instance	NN
2164	69	3	in	in	IN
2164	69	4	the	the	DT
2164	69	5	modified	modify	VBN
2164	69	6	response	response	NN
2164	69	7	ratio	ratio	NN
2164	69	8	below	below	RB
2164	69	9	,	,	,
2164	69	10	increasing	increase	VBG
2164	69	11	values	value	NNS
2164	69	12	of	of	IN
2164	69	13	x	x	NNS
2164	69	14	>	>	NN
2164	69	15	1	1	CD
2164	69	16	will	will	MD
2164	69	17	cause	cause	VB
2164	69	18	the	the	DT
2164	69	19	strategy	strategy	NN
2164	69	20	to	to	IN
2164	69	21	more	more	RBR
2164	69	22	resemble	resemble	JJ
2164	69	23	FCFS	FCFS	NNP
2164	69	24	,	,	,
2164	69	25	and	and	CC
2164	69	26	decreasing	decrease	VBG
2164	69	27	values	value	NNS
2164	69	28	of	of	IN
2164	69	29	0	0	CD
2164	69	30	<	<	XX
2164	69	31	x	x	NN
2164	69	32	<	<	XX
2164	69	33	1	1	CD
2164	69	34	will	will	MD
2164	69	35	more	more	RBR
2164	69	36	resemble	resemble	JJ
2164	69	37	SJF	SJF	NNP
2164	69	38	.	.	.
2164	70	1	(	(	-LRB-
2164	70	2	)	)	-RRB-
2164	70	3	One	one	CD
2164	70	4	could	could	MD
2164	70	5	experiment	experiment	VB
2164	70	6	with	with	IN
2164	70	7	different	different	JJ
2164	70	8	values	value	NNS
2164	70	9	of	of	IN
2164	70	10	x	x	NNS
2164	70	11	to	to	TO
2164	70	12	find	find	VB
2164	70	13	a	a	DT
2164	70	14	desired	desire	VBN
2164	70	15	balance	balance	NN
2164	70	16	between	between	IN
2164	70	17	the	the	DT
2164	70	18	number	number	NN
2164	70	19	of	of	IN
2164	70	20	line	line	NN
2164	70	21	cuts	cut	NNS
2164	70	22	and	and	CC
2164	70	23	the	the	DT
2164	70	24	impact	impact	NN
2164	70	25	on	on	IN
2164	70	26	average	average	JJ
2164	70	27	waiting	waiting	NN
2164	70	28	times	time	NNS
2164	70	29	for	for	IN
2164	70	30	customers	customer	NNS
2164	70	31	in	in	IN
2164	70	32	the	the	DT
2164	70	33	various	various	JJ
2164	70	34	priority	priority	NN
2164	70	35	classes	class	NNS
2164	70	36	.	.	.
2164	71	1	This	this	DT
2164	71	2	wo	will	MD
2164	71	3	n’t	not	RB
2164	71	4	be	be	VB
2164	71	5	pursued	pursue	VBN
2164	71	6	here	here	RB
2164	71	7	,	,	,
2164	71	8	and	and	CC
2164	71	9	x	x	NNP
2164	71	10	will	will	MD
2164	71	11	be	be	VB
2164	71	12	assumed	assume	VBN
2164	71	13	to	to	TO
2164	71	14	be	be	VB
2164	71	15	1	1	CD
2164	71	16	.	.	.
2164	72	1	METHODOLOGY	methodology	NN
2164	72	2	The	the	DT
2164	72	3	data	datum	NNS
2164	72	4	used	use	VBN
2164	72	5	in	in	IN
2164	72	6	this	this	DT
2164	72	7	simulation	simulation	NN
2164	72	8	come	come	VB
2164	72	9	from	from	IN
2164	72	10	the	the	DT
2164	72	11	Metropolitan	Metropolitan	NNP
2164	72	12	Library	Library	NNP
2164	72	13	System	System	NNP
2164	72	14	’s	’s	POS
2164	72	15	Southern	Southern	NNP
2164	72	16	Oaks	Oaks	NNPS
2164	72	17	Library	Library	NNP
2164	72	18	in	in	IN
2164	72	19	Oklahoma	Oklahoma	NNP
2164	72	20	City	City	NNP
2164	72	21	.	.	.
2164	73	1	This	this	DT
2164	73	2	library	library	NN
2164	73	3	has	have	VBZ
2164	73	4	eighteen	eighteen	CD
2164	73	5	public	public	JJ
2164	73	6	Internet	internet	NN
2164	73	7	computers	computer	NNS
2164	73	8	that	that	IN
2164	73	9	customers	customer	NNS
2164	73	10	can	can	MD
2164	73	11	sign	sign	VB
2164	73	12	up	up	RP
2164	73	13	for	for	IN
2164	73	14	using	use	VBG
2164	73	15	proprietary	proprietary	JJ
2164	73	16	software	software	NN
2164	73	17	developed	develop	VBN
2164	73	18	by	by	IN
2164	73	19	Jimmy	Jimmy	NNP
2164	73	20	Welch	Welch	NNP
2164	73	21	,	,	,
2164	73	22	Deputy	Deputy	NNP
2164	73	23	Executive	Executive	NNP
2164	73	24	Director	Director	NNP
2164	73	25	/	/	SYM
2164	73	26	Technology	Technology	NNP
2164	73	27	for	for	IN
2164	73	28	the	the	DT
2164	73	29	Metropolitan	Metropolitan	NNP
2164	73	30	Library	Library	NNP
2164	73	31	System	System	NNP
2164	73	32	.	.	.
2164	74	1	The	the	DT
2164	74	2	waiting	wait	VBG
2164	74	3	queue	queue	NN
2164	74	4	employs	employ	VBZ
2164	74	5	the	the	DT
2164	74	6	first-	first-	NN
2164	74	7	come	come	VB
2164	74	8	-	-	HYPH
2164	74	9	first	first	RB
2164	74	10	-	-	HYPH
2164	74	11	served	served	JJ
2164	74	12	(	(	-LRB-
2164	74	13	FCFS	FCFS	NNP
2164	74	14	)	)	-RRB-
2164	74	15	strategy	strategy	NN
2164	74	16	.	.	.
2164	75	1	Customers	customer	NNS
2164	75	2	are	be	VBP
2164	75	3	allotted	allot	VBN
2164	75	4	an	an	DT
2164	75	5	initial	initial	JJ
2164	75	6	session	session	NN
2164	75	7	of	of	IN
2164	75	8	up	up	IN
2164	75	9	to	to	TO
2164	75	10	sixty	sixty	CD
2164	75	11	minutes	minute	NNS
2164	75	12	but	but	CC
2164	75	13	may	may	MD
2164	75	14	extend	extend	VB
2164	75	15	their	-PRON-	PRP$
2164	75	16	session	session	NN
2164	75	17	in	in	IN
2164	75	18	thirty	thirty	CD
2164	75	19	-	-	HYPH
2164	75	20	minute	minute	NN
2164	75	21	increments	increment	NNS
2164	75	22	so	so	RB
2164	75	23	long	long	RB
2164	75	24	as	as	IN
2164	75	25	the	the	DT
2164	75	26	waiting	wait	VBG
2164	75	27	queue	queue	NN
2164	75	28	is	be	VBZ
2164	75	29	empty	empty	JJ
2164	75	30	.	.	.
2164	76	1	Repeat	repeat	NN
2164	76	2	customers	customer	NNS
2164	76	3	are	be	VBP
2164	76	4	also	also	RB
2164	76	5	allowed	allow	VBN
2164	76	6	to	to	TO
2164	76	7	sign	sign	VB
2164	76	8	up	up	RP
2164	76	9	for	for	IN
2164	76	10	additional	additional	JJ
2164	76	11	thirty	thirty	CD
2164	76	12	-	-	HYPH
2164	76	13	minute	minute	NN
2164	76	14	sessions	session	NNS
2164	76	15	during	during	IN
2164	76	16	the	the	DT
2164	76	17	day	day	NN
2164	76	18	,	,	,
2164	76	19	provided	provide	VBN
2164	76	20	that	that	IN
2164	76	21	no	no	DT
2164	76	22	user	user	NN
2164	76	23	currently	currently	RB
2164	76	24	in	in	IN
2164	76	25	the	the	DT
2164	76	26	queue	queue	NN
2164	76	27	has	have	VBZ
2164	76	28	been	be	VBN
2164	76	29	waiting	wait	VBG
2164	76	30	for	for	IN
2164	76	31	more	more	JJR
2164	76	32	than	than	IN
2164	76	33	ten	ten	CD
2164	76	34	minutes	minute	NNS
2164	76	35	(	(	-LRB-
2164	76	36	an	an	DT
2164	76	37	indication	indication	NN
2164	76	38	that	that	IN
2164	76	39	demand	demand	NN
2164	76	40	for	for	IN
2164	76	41	computers	computer	NNS
2164	76	42	is	be	VBZ
2164	76	43	currently	currently	RB
2164	76	44	high	high	JJ
2164	76	45	)	)	-RRB-
2164	76	46	.	.	.
2164	77	1	Anonymous	anonymous	JJ
2164	77	2	usage	usage	NN
2164	77	3	data	datum	NNS
2164	77	4	gathered	gather	VBN
2164	77	5	by	by	IN
2164	77	6	the	the	DT
2164	77	7	system	system	NN
2164	77	8	in	in	IN
2164	77	9	August	August	NNP
2164	77	10	2010	2010	CD
2164	77	11	was	be	VBD
2164	77	12	compiled	compile	VBN
2164	77	13	to	to	TO
2164	77	14	produce	produce	VB
2164	77	15	the	the	DT
2164	77	16	information	information	NN
2164	77	17	about	about	IN
2164	77	18	each	each	DT
2164	77	19	customer	customer	NN
2164	77	20	session	session	NN
2164	77	21	shown	show	VBN
2164	77	22	in	in	IN
2164	77	23	table	table	NN
2164	77	24	1	1	CD
2164	77	25	.	.	.
2164	78	1	PUBLIC	PUBLIC	NNP
2164	78	2	LIBRARY	LIBRARY	NNP
2164	78	3	COMPUTER	computer	NN
2164	78	4	WAITING	waiting	NN
2164	78	5	QUEUES	QUEUES	NNP
2164	78	6	|	|	NNP
2164	78	7	WILLIAMSON	williamson	NN
2164	78	8	76	76	CD
2164	78	9	Table	table	NN
2164	78	10	1	1	CD
2164	78	11	.	.	.
2164	79	1	Session	Session	NNP
2164	79	2	Data	Data	NNP
2164	79	3	(	(	-LRB-
2164	79	4	units	unit	NNS
2164	79	5	in	in	IN
2164	79	6	minutes	minute	NNS
2164	79	7	)	)	-RRB-
2164	79	8	The	the	DT
2164	79	9	information	information	NN
2164	79	10	about	about	IN
2164	79	11	each	each	DT
2164	79	12	session	session	NN
2164	79	13	required	require	VBN
2164	79	14	for	for	IN
2164	79	15	the	the	DT
2164	79	16	simulation	simulation	NN
2164	79	17	includes	include	VBZ
2164	79	18	the	the	DT
2164	79	19	time	time	NN
2164	79	20	at	at	IN
2164	79	21	which	which	WDT
2164	79	22	the	the	DT
2164	79	23	user	user	NN
2164	79	24	arrived	arrive	VBD
2164	79	25	to	to	TO
2164	79	26	sign	sign	VB
2164	79	27	up	up	RP
2164	79	28	for	for	IN
2164	79	29	a	a	DT
2164	79	30	computer	computer	NN
2164	79	31	,	,	,
2164	79	32	the	the	DT
2164	79	33	number	number	NN
2164	79	34	of	of	IN
2164	79	35	minutes	minute	NNS
2164	79	36	it	-PRON-	PRP
2164	79	37	took	take	VBD
2164	79	38	the	the	DT
2164	79	39	user	user	NN
2164	79	40	to	to	TO
2164	79	41	log	log	VB
2164	79	42	in	in	RP
2164	79	43	once	once	RB
2164	79	44	assigned	assign	VBN
2164	79	45	a	a	DT
2164	79	46	computer	computer	NN
2164	79	47	,	,	,
2164	79	48	how	how	WRB
2164	79	49	many	many	JJ
2164	79	50	minutes	minute	NNS
2164	79	51	of	of	IN
2164	79	52	computer	computer	NN
2164	79	53	time	time	NN
2164	79	54	were	be	VBD
2164	79	55	used	use	VBN
2164	79	56	,	,	,
2164	79	57	whether	whether	IN
2164	79	58	or	or	CC
2164	79	59	not	not	RB
2164	79	60	this	this	DT
2164	79	61	was	be	VBD
2164	79	62	the	the	DT
2164	79	63	user	user	NN
2164	79	64	’s	’s	POS
2164	79	65	first	first	JJ
2164	79	66	or	or	CC
2164	79	67	a	a	DT
2164	79	68	subsequent	subsequent	JJ
2164	79	69	session	session	NN
2164	79	70	for	for	IN
2164	79	71	the	the	DT
2164	79	72	day	day	NN
2164	79	73	,	,	,
2164	79	74	and	and	CC
2164	79	75	finally	finally	RB
2164	79	76	,	,	,
2164	79	77	whether	whether	IN
2164	79	78	the	the	DT
2164	79	79	user	user	NN
2164	79	80	gave	give	VBD
2164	79	81	up	up	RP
2164	79	82	waiting	wait	VBG
2164	79	83	and	and	CC
2164	79	84	abandoned	abandon	VBD
2164	79	85	his	-PRON-	PRP$
2164	79	86	/	/	SYM
2164	79	87	her	-PRON-	PRP$
2164	79	88	place	place	NN
2164	79	89	in	in	IN
2164	79	90	the	the	DT
2164	79	91	queue	queue	NN
2164	79	92	.	.	.
2164	80	1	Users	user	NNS
2164	80	2	are	be	VBP
2164	80	3	given	give	VBN
2164	80	4	eight	eight	CD
2164	80	5	minutes	minute	NNS
2164	80	6	to	to	TO
2164	80	7	log	log	VB
2164	80	8	in	in	RP
2164	80	9	once	once	RB
2164	80	10	a	a	DT
2164	80	11	computer	computer	NN
2164	80	12	station	station	NN
2164	80	13	is	be	VBZ
2164	80	14	assigned	assign	VBN
2164	80	15	to	to	IN
2164	80	16	them	-PRON-	PRP
2164	80	17	before	before	IN
2164	80	18	they	-PRON-	PRP
2164	80	19	are	be	VBP
2164	80	20	considered	consider	VBN
2164	80	21	to	to	TO
2164	80	22	have	have	VB
2164	80	23	abandoned	abandon	VBN
2164	80	24	the	the	DT
2164	80	25	queue	queue	NN
2164	80	26	.	.	.
2164	81	1	Once	once	IN
2164	81	2	this	this	DT
2164	81	3	data	data	NN
2164	81	4	has	have	VBZ
2164	81	5	been	be	VBN
2164	81	6	gathered	gather	VBN
2164	81	7	,	,	,
2164	81	8	the	the	DT
2164	81	9	computer	computer	NN
2164	81	10	simulation	simulation	NN
2164	81	11	runs	run	VBZ
2164	81	12	by	by	IN
2164	81	13	iterating	iterate	VBG
2164	81	14	through	through	IN
2164	81	15	each	each	DT
2164	81	16	second	second	JJ
2164	81	17	the	the	DT
2164	81	18	library	library	NN
2164	81	19	is	be	VBZ
2164	81	20	open	open	JJ
2164	81	21	.	.	.
2164	82	1	As	as	IN
2164	82	2	user	user	NN
2164	82	3	sign	sign	NN
2164	82	4	-	-	HYPH
2164	82	5	up	up	RP
2164	82	6	times	time	NNS
2164	82	7	are	be	VBP
2164	82	8	encountered	encounter	VBN
2164	82	9	in	in	IN
2164	82	10	the	the	DT
2164	82	11	data	datum	NNS
2164	82	12	,	,	,
2164	82	13	they	-PRON-	PRP
2164	82	14	are	be	VBP
2164	82	15	added	add	VBN
2164	82	16	to	to	IN
2164	82	17	the	the	DT
2164	82	18	waiting	wait	VBG
2164	82	19	queue	queue	NN
2164	82	20	.	.	.
2164	83	1	When	when	WRB
2164	83	2	a	a	DT
2164	83	3	computer	computer	NN
2164	83	4	becomes	become	VBZ
2164	83	5	available	available	JJ
2164	83	6	,	,	,
2164	83	7	a	a	DT
2164	83	8	user	user	NN
2164	83	9	is	be	VBZ
2164	83	10	selected	select	VBN
2164	83	11	from	from	IN
2164	83	12	the	the	DT
2164	83	13	queue	queue	NN
2164	83	14	using	use	VBG
2164	83	15	the	the	DT
2164	83	16	strategy	strategy	NN
2164	83	17	being	be	VBG
2164	83	18	simulated	simulate	VBN
2164	83	19	and	and	CC
2164	83	20	assigned	assign	VBN
2164	83	21	to	to	IN
2164	83	22	the	the	DT
2164	83	23	open	open	JJ
2164	83	24	computer	computer	NN
2164	83	25	.	.	.
2164	84	1	The	the	DT
2164	84	2	customer	customer	NN
2164	84	3	occupies	occupy	VBZ
2164	84	4	the	the	DT
2164	84	5	computer	computer	NN
2164	84	6	for	for	IN
2164	84	7	the	the	DT
2164	84	8	length	length	NN
2164	84	9	of	of	IN
2164	84	10	time	time	NN
2164	84	11	given	give	VBN
2164	84	12	by	by	IN
2164	84	13	their	-PRON-	PRP$
2164	84	14	associated	associate	VBN
2164	84	15	log	log	NN
2164	84	16	-	-	HYPH
2164	84	17	in	in	NN
2164	84	18	delay	delay	NN
2164	84	19	and	and	CC
2164	84	20	session	session	NN
2164	84	21	length	length	NN
2164	84	22	.	.	.
2164	85	1	When	when	WRB
2164	85	2	this	this	DT
2164	85	3	time	time	NN
2164	85	4	expires	expire	VBZ
2164	85	5	,	,	,
2164	85	6	customers	customer	NNS
2164	85	7	are	be	VBP
2164	85	8	removed	remove	VBN
2164	85	9	from	from	IN
2164	85	10	their	-PRON-	PRP$
2164	85	11	computer	computer	NN
2164	85	12	and	and	CC
2164	85	13	the	the	DT
2164	85	14	information	information	NN
2164	85	15	recorded	record	VBN
2164	85	16	during	during	IN
2164	85	17	their	-PRON-	PRP$
2164	85	18	time	time	NN
2164	85	19	spent	spend	VBN
2164	85	20	in	in	IN
2164	85	21	the	the	DT
2164	85	22	waiting	wait	VBG
2164	85	23	queue	queue	NN
2164	85	24	is	be	VBZ
2164	85	25	logged	log	VBN
2164	85	26	.	.	.
2164	86	1	RESULTS	RESULTS	NNP
2164	86	2	There	there	EX
2164	86	3	were	be	VBD
2164	86	4	7,403	7,403	CD
2164	86	5	sign	sign	NN
2164	86	6	-	-	HYPH
2164	86	7	ups	up	NNS
2164	86	8	for	for	IN
2164	86	9	the	the	DT
2164	86	10	computers	computer	NNS
2164	86	11	at	at	IN
2164	86	12	the	the	DT
2164	86	13	Southern	Southern	NNP
2164	86	14	Oaks	Oaks	NNPS
2164	86	15	Library	Library	NNP
2164	86	16	in	in	IN
2164	86	17	August	August	NNP
2164	86	18	2010	2010	CD
2164	86	19	.	.	.
2164	87	1	Each	each	DT
2164	87	2	of	of	IN
2164	87	3	these	these	DT
2164	87	4	requests	request	NNS
2164	87	5	is	be	VBZ
2164	87	6	assigned	assign	VBN
2164	87	7	a	a	DT
2164	87	8	priority	priority	NN
2164	87	9	class	class	NN
2164	87	10	based	base	VBN
2164	87	11	on	on	IN
2164	87	12	the	the	DT
2164	87	13	length	length	NN
2164	87	14	of	of	IN
2164	87	15	the	the	DT
2164	87	16	session	session	NN
2164	87	17	as	as	IN
2164	87	18	detailed	detail	VBN
2164	87	19	in	in	IN
2164	87	20	table	table	NN
2164	87	21	2	2	CD
2164	87	22	.	.	.
2164	88	1	The	the	DT
2164	88	2	intended	intended	JJ
2164	88	3	session	session	NN
2164	88	4	length	length	NN
2164	88	5	of	of	IN
2164	88	6	users	user	NNS
2164	88	7	choosing	choose	VBG
2164	88	8	to	to	TO
2164	88	9	abandon	abandon	VB
2164	88	10	the	the	DT
2164	88	11	queue	queue	NN
2164	88	12	is	be	VBZ
2164	88	13	unknown	unknown	JJ
2164	88	14	.	.	.
2164	89	1	Abandoned	abandon	VBN
2164	89	2	sign	sign	NN
2164	89	3	-	-	HYPH
2164	89	4	ups	up	NNS
2164	89	5	are	be	VBP
2164	89	6	assigned	assign	VBN
2164	89	7	a	a	DT
2164	89	8	priority	priority	NN
2164	89	9	class	class	NN
2164	89	10	randomly	randomly	NN
2164	89	11	in	in	IN
2164	89	12	proportion	proportion	NN
2164	89	13	to	to	IN
2164	89	14	the	the	DT
2164	89	15	overall	overall	JJ
2164	89	16	distribution	distribution	NN
2164	89	17	of	of	IN
2164	89	18	priority	priority	NN
2164	89	19	classes	class	NNS
2164	89	20	in	in	IN
2164	89	21	the	the	DT
2164	89	22	data	datum	NNS
2164	89	23	so	so	IN
2164	89	24	as	as	IN
2164	89	25	not	not	RB
2164	89	26	to	to	TO
2164	89	27	introduce	introduce	VB
2164	89	28	any	any	DT
2164	89	29	systematic	systematic	JJ
2164	89	30	bias	bias	NN
2164	89	31	into	into	IN
2164	89	32	the	the	DT
2164	89	33	results	result	NNS
2164	89	34	.	.	.
2164	90	1	Even	even	RB
2164	90	2	though	though	IN
2164	90	3	their	-PRON-	PRP$
2164	90	4	actual	actual	JJ
2164	90	5	session	session	NN
2164	90	6	length	length	NN
2164	90	7	is	be	VBZ
2164	90	8	zero	zero	CD
2164	90	9	,	,	,
2164	90	10	these	these	DT
2164	90	11	users	user	NNS
2164	90	12	participate	participate	VBP
2164	90	13	in	in	IN
2164	90	14	the	the	DT
2164	90	15	queue	queue	NN
2164	90	16	and	and	CC
2164	90	17	cause	cause	VB
2164	90	18	the	the	DT
2164	90	19	computer	computer	NN
2164	90	20	eventually	eventually	RB
2164	90	21	assigned	assign	VBN
2164	90	22	to	to	IN
2164	90	23	them	-PRON-	PRP
2164	90	24	to	to	TO
2164	90	25	sit	sit	VB
2164	90	26	idle	idle	JJ
2164	90	27	for	for	IN
2164	90	28	eight	eight	CD
2164	90	29	minutes	minute	NNS
2164	90	30	until	until	IN
2164	90	31	it	-PRON-	PRP
2164	90	32	is	be	VBZ
2164	90	33	re	re	VBN
2164	90	34	-	-	VBN
2164	90	35	assigned	assign	VBN
2164	90	36	.	.	.
2164	91	1	Customers	customer	NNS
2164	91	2	signing	sign	VBG
2164	91	3	up	up	RP
2164	91	4	for	for	IN
2164	91	5	a	a	DT
2164	91	6	subsequent	subsequent	JJ
2164	91	7	session	session	NN
2164	91	8	during	during	IN
2164	91	9	the	the	DT
2164	91	10	day	day	NN
2164	91	11	are	be	VBP
2164	91	12	always	always	RB
2164	91	13	assigned	assign	VBN
2164	91	14	the	the	DT
2164	91	15	lowest	low	JJS
2164	91	16	priority	priority	NN
2164	91	17	class	class	NN
2164	91	18	(	(	-LRB-
2164	91	19	P-4	P-4	NNP
2164	91	20	)	)	-RRB-
2164	91	21	regardless	regardless	RB
2164	91	22	of	of	IN
2164	91	23	their	-PRON-	PRP$
2164	91	24	requested	request	VBN
2164	91	25	session	session	NN
2164	91	26	length	length	NN
2164	91	27	.	.	.
2164	92	1	This	this	DT
2164	92	2	is	be	VBZ
2164	92	3	a	a	DT
2164	92	4	policy	policy	NN
2164	92	5	decision	decision	NN
2164	92	6	to	to	TO
2164	92	7	not	not	RB
2164	92	8	give	give	VB
2164	92	9	priority	priority	NN
2164	92	10	to	to	IN
2164	92	11	users	user	NNS
2164	92	12	who	who	WP
2164	92	13	have	have	VBP
2164	92	14	already	already	RB
2164	92	15	received	receive	VBN
2164	92	16	a	a	DT
2164	92	17	computer	computer	NN
2164	92	18	session	session	NN
2164	92	19	for	for	IN
2164	92	20	the	the	DT
2164	92	21	day	day	NN
2164	92	22	.	.	.
2164	93	1	INFORMATION	INFORMATION	NNP
2164	93	2	TECHNOLOGY	technology	NN
2164	93	3	AND	and	CC
2164	93	4	LIBRARIES	LIBRARIES	NNP
2164	93	5	|	|	NNP
2164	93	6	JUNE	JUNE	NNP
2164	93	7	2012	2012	CD
2164	93	8	77	77	CD
2164	93	9	Table	table	NN
2164	93	10	2	2	CD
2164	93	11	.	.	.
2164	94	1	Assignment	assignment	NN
2164	94	2	of	of	IN
2164	94	3	Priority	Priority	NNP
2164	94	4	Classes	Classes	NNPS
2164	94	5	Figure	figure	NN
2164	94	6	1	1	CD
2164	94	7	displays	display	VBZ
2164	94	8	the	the	DT
2164	94	9	average	average	JJ
2164	94	10	waiting	waiting	NN
2164	94	11	time	time	NN
2164	94	12	for	for	IN
2164	94	13	each	each	DT
2164	94	14	priority	priority	NN
2164	94	15	class	class	NN
2164	94	16	during	during	IN
2164	94	17	the	the	DT
2164	94	18	simulation	simulation	NN
2164	94	19	(	(	-LRB-
2164	94	20	bars	bar	NNS
2164	94	21	)	)	-RRB-
2164	94	22	along	along	IN
2164	94	23	with	with	IN
2164	94	24	the	the	DT
2164	94	25	total	total	JJ
2164	94	26	number	number	NN
2164	94	27	of	of	IN
2164	94	28	sessions	session	NNS
2164	94	29	initially	initially	RB
2164	94	30	assigned	assign	VBN
2164	94	31	to	to	IN
2164	94	32	each	each	DT
2164	94	33	class	class	NN
2164	94	34	(	(	-LRB-
2164	94	35	line	line	NN
2164	94	36	)	)	-RRB-
2164	94	37	.	.	.
2164	95	1	It	-PRON-	PRP
2164	95	2	is	be	VBZ
2164	95	3	immediately	immediately	RB
2164	95	4	obvious	obvious	JJ
2164	95	5	from	from	IN
2164	95	6	the	the	DT
2164	95	7	chart	chart	NN
2164	95	8	that	that	IN
2164	95	9	each	each	DT
2164	95	10	alternative	alternative	JJ
2164	95	11	strategy	strategy	NN
2164	95	12	excels	excel	NNS
2164	95	13	at	at	IN
2164	95	14	reducing	reduce	VBG
2164	95	15	the	the	DT
2164	95	16	average	average	JJ
2164	95	17	wait	wait	NN
2164	95	18	for	for	IN
2164	95	19	high	high	JJ
2164	95	20	priority	priority	NN
2164	95	21	(	(	-LRB-
2164	95	22	P1	p1	NN
2164	95	23	)	)	-RRB-
2164	95	24	users	user	NNS
2164	95	25	.	.	.
2164	96	1	Also	also	RB
2164	96	2	observe	observe	VB
2164	96	3	how	how	WRB
2164	96	4	removing	remove	VBG
2164	96	5	one	one	CD
2164	96	6	computer	computer	NN
2164	96	7	from	from	IN
2164	96	8	the	the	DT
2164	96	9	pool	pool	NN
2164	96	10	to	to	TO
2164	96	11	serve	serve	VB
2164	96	12	exclusively	exclusively	RB
2164	96	13	as	as	IN
2164	96	14	a	a	DT
2164	96	15	fifteen	fifteen	CD
2164	96	16	-	-	HYPH
2164	96	17	minute	minute	NN
2164	96	18	computer	computer	NN
2164	96	19	drastically	drastically	RB
2164	96	20	increases	increase	VBZ
2164	96	21	the	the	DT
2164	96	22	FCFS-15	fcfs-15	CD
2164	96	23	average	average	JJ
2164	96	24	wait	wait	NN
2164	96	25	times	time	NNS
2164	96	26	in	in	IN
2164	96	27	the	the	DT
2164	96	28	other	other	JJ
2164	96	29	priority	priority	NN
2164	96	30	classes	class	NNS
2164	96	31	.	.	.
2164	97	1	Clearly	clearly	RB
2164	97	2	,	,	,
2164	97	3	removing	remove	VBG
2164	97	4	one	one	CD
2164	97	5	(	(	-LRB-
2164	97	6	or	or	CC
2164	97	7	more	more	RBR
2164	97	8	)	)	-RRB-
2164	97	9	computer	computer	NN
2164	97	10	from	from	IN
2164	97	11	the	the	DT
2164	97	12	pool	pool	NN
2164	97	13	to	to	TO
2164	97	14	serve	serve	VB
2164	97	15	as	as	IN
2164	97	16	a	a	DT
2164	97	17	dedicated	dedicated	JJ
2164	97	18	fifteen	fifteen	CD
2164	97	19	-	-	HYPH
2164	97	20	minute	minute	NN
2164	97	21	station	station	NN
2164	97	22	is	be	VBZ
2164	97	23	a	a	DT
2164	97	24	poor	poor	JJ
2164	97	25	strategy	strategy	NN
2164	97	26	here	here	RB
2164	97	27	for	for	IN
2164	97	28	all	all	DT
2164	97	29	but	but	IN
2164	97	30	the	the	DT
2164	97	31	519	519	CD
2164	97	32	users	user	NNS
2164	97	33	in	in	IN
2164	97	34	class	class	NN
2164	97	35	P-1	P-1	NNP
2164	97	36	.	.	.
2164	98	1	Losing	lose	VBG
2164	98	2	just	just	RB
2164	98	3	one	one	CD
2164	98	4	of	of	IN
2164	98	5	the	the	DT
2164	98	6	eighteen	eighteen	CD
2164	98	7	available	available	JJ
2164	98	8	computers	computer	NNS
2164	98	9	nearly	nearly	RB
2164	98	10	doubles	double	VBZ
2164	98	11	the	the	DT
2164	98	12	average	average	JJ
2164	98	13	wait	wait	NN
2164	98	14	for	for	IN
2164	98	15	the	the	DT
2164	98	16	remaining	remain	VBG
2164	98	17	6,884	6,884	CD
2164	98	18	users	user	NNS
2164	98	19	in	in	IN
2164	98	20	the	the	DT
2164	98	21	other	other	JJ
2164	98	22	priority	priority	NN
2164	98	23	classes	class	NNS
2164	98	24	.	.	.
2164	99	1	Figure	figure	NN
2164	99	2	1	1	CD
2164	99	3	.	.	.
2164	100	1	Average	average	JJ
2164	100	2	User	User	NNP
2164	100	3	Wait	wait	VBP
2164	100	4	Minutes	Minutes	NNPS
2164	100	5	by	by	IN
2164	100	6	Priority	Priority	NNP
2164	100	7	Class	Class	NNP
2164	100	8	PUBLIC	PUBLIC	NNP
2164	100	9	LIBRARY	LIBRARY	NNP
2164	100	10	COMPUTER	computer	NN
2164	100	11	WAITING	waiting	NN
2164	100	12	QUEUES	QUEUES	NNP
2164	100	13	|	|	NNP
2164	100	14	WILLIAMSON	williamson	NN
2164	100	15	78	78	CD
2164	100	16	By	by	IN
2164	100	17	contrast	contrast	NN
2164	100	18	,	,	,
2164	100	19	note	note	VBP
2164	100	20	that	that	IN
2164	100	21	the	the	DT
2164	100	22	reduced	reduced	JJ
2164	100	23	average	average	NN
2164	100	24	wait	wait	VBP
2164	100	25	times	time	NNS
2164	100	26	for	for	IN
2164	100	27	the	the	DT
2164	100	28	highest	high	JJS
2164	100	29	priority	priority	NN
2164	100	30	users	user	NNS
2164	100	31	in	in	IN
2164	100	32	class	class	NN
2164	100	33	P-1	P-1	NNP
2164	100	34	persist	persist	NN
2164	100	35	in	in	IN
2164	100	36	classes	class	NNS
2164	100	37	P-2	P-2	NNP
2164	100	38	and	and	CC
2164	100	39	P-3	P-3	NNP
2164	100	40	for	for	IN
2164	100	41	the	the	DT
2164	100	42	non	non	JJ
2164	100	43	-	-	JJ
2164	100	44	FCSC	fcsc	JJ
2164	100	45	strategies	strategy	NNS
2164	100	46	.	.	.
2164	101	1	The	the	DT
2164	101	2	SJF	SJF	NNP
2164	101	3	strategy	strategy	NN
2164	101	4	produces	produce	VBZ
2164	101	5	the	the	DT
2164	101	6	most	most	RBS
2164	101	7	dramatic	dramatic	JJ
2164	101	8	reductions	reduction	NNS
2164	101	9	for	for	IN
2164	101	10	the	the	DT
2164	101	11	2,164	2,164	CD
2164	101	12	users	user	NNS
2164	101	13	not	not	RB
2164	101	14	in	in	IN
2164	101	15	class	class	NN
2164	101	16	P-4	P-4	NNP
2164	101	17	.	.	.
2164	102	1	However	however	RB
2164	102	2	,	,	,
2164	102	3	for	for	IN
2164	102	4	the	the	DT
2164	102	5	5,239	5,239	CD
2164	102	6	users	user	NNS
2164	102	7	in	in	IN
2164	102	8	class	class	NN
2164	102	9	P-4	P-4	NNP
2164	102	10	,	,	,
2164	102	11	the	the	DT
2164	102	12	SJF	SJF	NNP
2164	102	13	strategy	strategy	NN
2164	102	14	produced	produce	VBD
2164	102	15	an	an	DT
2164	102	16	average	average	JJ
2164	102	17	wait	wait	NN
2164	102	18	time	time	NN
2164	102	19	that	that	WDT
2164	102	20	was	be	VBD
2164	102	21	2.1	2.1	CD
2164	102	22	minutes	minute	NNS
2164	102	23	longer	long	RBR
2164	102	24	than	than	IN
2164	102	25	the	the	DT
2164	102	26	purely	purely	RB
2164	102	27	FCFS	FCFS	NNP
2164	102	28	strategy	strategy	NN
2164	102	29	.	.	.
2164	103	1	The	the	DT
2164	103	2	HRRN	HRRN	NNP
2164	103	3	strategy	strategy	NN
2164	103	4	achieves	achieve	VBZ
2164	103	5	lesser	less	JJR
2164	103	6	wait	wait	VBP
2164	103	7	time	time	NN
2164	103	8	reductions	reduction	NNS
2164	103	9	than	than	IN
2164	103	10	SJF	SJF	NNP
2164	103	11	in	in	IN
2164	103	12	the	the	DT
2164	103	13	higher	high	JJR
2164	103	14	priority	priority	NN
2164	103	15	classes	class	NNS
2164	103	16	,	,	,
2164	103	17	but	but	CC
2164	103	18	HRRN	HRRN	NNP
2164	103	19	increased	increase	VBD
2164	103	20	the	the	DT
2164	103	21	average	average	JJ
2164	103	22	wait	wait	NN
2164	103	23	for	for	IN
2164	103	24	users	user	NNS
2164	103	25	in	in	IN
2164	103	26	class	class	NN
2164	103	27	P-4	P-4	NNP
2164	103	28	by	by	IN
2164	103	29	only	only	RB
2164	103	30	0.7	0.7	CD
2164	103	31	minutes	minute	NNS
2164	103	32	relative	relative	JJ
2164	103	33	to	to	IN
2164	103	34	FCFS	FCFS	NNP
2164	103	35	.	.	.
2164	104	1	The	the	DT
2164	104	2	average	average	JJ
2164	104	3	wait	wait	NN
2164	104	4	using	use	VBG
2164	104	5	the	the	DT
2164	104	6	SJF	SJF	NNP
2164	104	7	-	-	HYPH
2164	104	8	FB	FB	NNP
2164	104	9	strategy	strategy	NN
2164	104	10	falls	fall	VBZ
2164	104	11	in	in	IN
2164	104	12	between	between	IN
2164	104	13	that	that	DT
2164	104	14	of	of	IN
2164	104	15	SJF	SJF	NNP
2164	104	16	and	and	CC
2164	104	17	HRRN	HRRN	NNP
2164	104	18	for	for	IN
2164	104	19	each	each	DT
2164	104	20	priority	priority	NN
2164	104	21	class	class	NN
2164	104	22	while	while	IN
2164	104	23	guaranteeing	guarantee	VBG
2164	104	24	users	user	NNS
2164	104	25	will	will	MD
2164	104	26	be	be	VB
2164	104	27	cut	cut	VBN
2164	104	28	at	at	IN
2164	104	29	most	most	JJS
2164	104	30	six	six	CD
2164	104	31	times	time	NNS
2164	104	32	.	.	.
2164	105	1	An	an	DT
2164	105	2	examination	examination	NN
2164	105	3	of	of	IN
2164	105	4	the	the	DT
2164	105	5	maximum	maximum	JJ
2164	105	6	wait	wait	NN
2164	105	7	times	time	NNS
2164	105	8	for	for	IN
2164	105	9	each	each	DT
2164	105	10	priority	priority	NN
2164	105	11	class	class	NN
2164	105	12	in	in	IN
2164	105	13	figure	figure	NN
2164	105	14	2	2	CD
2164	105	15	illustrates	illustrate	VBZ
2164	105	16	how	how	WRB
2164	105	17	the	the	DT
2164	105	18	express	express	JJ
2164	105	19	lane	lane	NN
2164	105	20	itself	-PRON-	PRP
2164	105	21	can	can	MD
2164	105	22	be	be	VB
2164	105	23	a	a	DT
2164	105	24	bottleneck	bottleneck	NN
2164	105	25	.	.	.
2164	106	1	Even	even	RB
2164	106	2	with	with	IN
2164	106	3	a	a	DT
2164	106	4	dedicated	dedicated	JJ
2164	106	5	fifteen	fifteen	CD
2164	106	6	-	-	HYPH
2164	106	7	minute	minute	NN
2164	106	8	express	express	JJ
2164	106	9	computer	computer	NN
2164	106	10	under	under	IN
2164	106	11	the	the	DT
2164	106	12	FCFS-15	fcfs-15	CD
2164	106	13	strategy	strategy	NN
2164	106	14	,	,	,
2164	106	15	at	at	RB
2164	106	16	least	least	RBS
2164	106	17	one	one	CD
2164	106	18	user	user	NN
2164	106	19	would	would	MD
2164	106	20	have	have	VB
2164	106	21	waited	wait	VBN
2164	106	22	over	over	IN
2164	106	23	half	half	PDT
2164	106	24	an	an	DT
2164	106	25	hour	hour	NN
2164	106	26	to	to	TO
2164	106	27	use	use	VB
2164	106	28	a	a	DT
2164	106	29	computer	computer	NN
2164	106	30	for	for	IN
2164	106	31	fifteen	fifteen	CD
2164	106	32	minutes	minute	NNS
2164	106	33	or	or	CC
2164	106	34	less	less	JJR
2164	106	35	.	.	.
2164	107	1	In	in	IN
2164	107	2	all	all	DT
2164	107	3	but	but	IN
2164	107	4	the	the	DT
2164	107	5	highest	high	JJS
2164	107	6	priority	priority	NN
2164	107	7	class	class	NN
2164	107	8	(	(	-LRB-
2164	107	9	P-2	P-2	NNP
2164	107	10	through	through	IN
2164	107	11	P-4	P-4	NNP
2164	107	12	)	)	-RRB-
2164	107	13	,	,	,
2164	107	14	the	the	DT
2164	107	15	FCFS-15	fcfs-15	CD
2164	107	16	strategy	strategy	NN
2164	107	17	again	again	RB
2164	107	18	performs	perform	VBZ
2164	107	19	poorly	poorly	RB
2164	107	20	with	with	IN
2164	107	21	at	at	RB
2164	107	22	least	least	RBS
2164	107	23	one	one	CD
2164	107	24	user	user	NN
2164	107	25	in	in	IN
2164	107	26	each	each	DT
2164	107	27	of	of	IN
2164	107	28	these	these	DT
2164	107	29	classes	class	NNS
2164	107	30	waiting	wait	VBG
2164	107	31	over	over	IN
2164	107	32	ninety	ninety	CD
2164	107	33	minutes	minute	NNS
2164	107	34	for	for	IN
2164	107	35	a	a	DT
2164	107	36	computer	computer	NN
2164	107	37	.	.	.
2164	108	1	Figure	figure	NN
2164	108	2	2	2	CD
2164	108	3	.	.	.
2164	109	1	Maximum	Maximum	NNP
2164	109	2	User	User	NNP
2164	109	3	Wait	Wait	NNP
2164	109	4	Minutes	Minutes	NNPS
2164	109	5	by	by	IN
2164	109	6	Priority	Priority	NNP
2164	109	7	Class	Class	NNP
2164	109	8	Capping	Capping	NNP
2164	109	9	the	the	DT
2164	109	10	number	number	NN
2164	109	11	of	of	IN
2164	109	12	times	time	NNS
2164	109	13	a	a	DT
2164	109	14	user	user	NN
2164	109	15	may	may	MD
2164	109	16	be	be	VB
2164	109	17	passed	pass	VBN
2164	109	18	over	over	RP
2164	109	19	in	in	IN
2164	109	20	the	the	DT
2164	109	21	queue	queue	NN
2164	109	22	under	under	IN
2164	109	23	the	the	DT
2164	109	24	SFJ	SFJ	NNP
2164	109	25	-	-	HYPH
2164	109	26	FB	fb	NN
2164	109	27	strategy	strategy	NN
2164	109	28	makes	make	VBZ
2164	109	29	it	-PRON-	PRP
2164	109	30	less	less	RBR
2164	109	31	likely	likely	JJ
2164	109	32	that	that	IN
2164	109	33	members	member	NNS
2164	109	34	of	of	IN
2164	109	35	classes	class	NNS
2164	109	36	P-2	P-2	NNP
2164	109	37	and	and	CC
2164	109	38	P-3	P-3	NNP
2164	109	39	will	will	MD
2164	109	40	be	be	VB
2164	109	41	able	able	JJ
2164	109	42	to	to	TO
2164	109	43	take	take	VB
2164	109	44	advantage	advantage	NN
2164	109	45	of	of	IN
2164	109	46	their	-PRON-	PRP$
2164	109	47	higher	high	JJR
2164	109	48	priority	priority	NN
2164	109	49	to	to	TO
2164	109	50	cut	cut	VB
2164	109	51	in	in	IN
2164	109	52	front	front	NN
2164	109	53	of	of	IN
2164	109	54	users	user	NNS
2164	109	55	in	in	IN
2164	109	56	class	class	NN
2164	109	57	P-4	P-4	NNP
2164	109	58	during	during	IN
2164	109	59	periods	period	NNS
2164	109	60	of	of	IN
2164	109	61	peak	peak	NN
2164	109	62	demand	demand	NN
2164	109	63	.	.	.
2164	110	1	As	as	IN
2164	110	2	a	a	DT
2164	110	3	result	result	NN
2164	110	4	,	,	,
2164	110	5	the	the	DT
2164	110	6	SJF	SJF	NNP
2164	110	7	-	-	HYPH
2164	110	8	FB	FB	NNP
2164	110	9	maximum	maximum	NN
2164	110	10	wait	wait	NN
2164	110	11	times	time	NNS
2164	110	12	for	for	IN
2164	110	13	classes	class	NNS
2164	110	14	P-2	P-2	NNP
2164	110	15	and	and	CC
2164	110	16	P-3	P-3	NNP
2164	110	17	are	be	VBP
2164	110	18	similar	similar	JJ
2164	110	19	to	to	IN
2164	110	20	those	those	DT
2164	110	21	under	under	IN
2164	110	22	the	the	DT
2164	110	23	FCFS	FCFS	NNP
2164	110	24	strategy	strategy	NN
2164	110	25	.	.	.
2164	111	1	This	this	DT
2164	111	2	was	be	VBD
2164	111	3	not	not	RB
2164	111	4	the	the	DT
2164	111	5	case	case	NN
2164	111	6	in	in	IN
2164	111	7	the	the	DT
2164	111	8	breakdown	breakdown	NN
2164	111	9	of	of	IN
2164	111	10	SJF	SJF	NNP
2164	111	11	-	-	HYPH
2164	111	12	FB	FB	NNP
2164	111	13	average	average	JJ
2164	111	14	waiting	wait	VBG
2164	111	15	times	time	NNS
2164	111	16	across	across	IN
2164	111	17	priority	priority	NN
2164	111	18	classes	class	NNS
2164	111	19	in	in	IN
2164	111	20	figure	figure	NN
2164	111	21	1	1	CD
2164	111	22	.	.	.
2164	112	1	INFORMATION	INFORMATION	NNP
2164	112	2	TECHNOLOGY	technology	NN
2164	112	3	AND	and	CC
2164	112	4	LIBRARIES	LIBRARIES	NNP
2164	112	5	|	|	NNP
2164	112	6	JUNE	JUNE	NNP
2164	112	7	2012	2012	CD
2164	112	8	79	79	CD
2164	112	9	Table	table	NN
2164	112	10	3	3	CD
2164	112	11	breaks	break	VBZ
2164	112	12	down	down	RP
2164	112	13	waiting	wait	VBG
2164	112	14	times	time	NNS
2164	112	15	for	for	IN
2164	112	16	each	each	DT
2164	112	17	queuing	queuing	NN
2164	112	18	strategy	strategy	NN
2164	112	19	according	accord	VBG
2164	112	20	to	to	IN
2164	112	21	the	the	DT
2164	112	22	overall	overall	JJ
2164	112	23	percentage	percentage	NN
2164	112	24	of	of	IN
2164	112	25	users	user	NNS
2164	112	26	waiting	wait	VBG
2164	112	27	no	no	RB
2164	112	28	more	more	JJR
2164	112	29	than	than	IN
2164	112	30	the	the	DT
2164	112	31	given	give	VBN
2164	112	32	number	number	NN
2164	112	33	of	of	IN
2164	112	34	minutes	minute	NNS
2164	112	35	.	.	.
2164	113	1	Here	here	RB
2164	113	2	we	-PRON-	PRP
2164	113	3	see	see	VBP
2164	113	4	the	the	DT
2164	113	5	effects	effect	NNS
2164	113	6	of	of	IN
2164	113	7	each	each	DT
2164	113	8	strategy	strategy	NN
2164	113	9	on	on	IN
2164	113	10	the	the	DT
2164	113	11	system	system	NN
2164	113	12	as	as	IN
2164	113	13	a	a	DT
2164	113	14	whole	whole	NN
2164	113	15	,	,	,
2164	113	16	instead	instead	RB
2164	113	17	of	of	IN
2164	113	18	by	by	IN
2164	113	19	priority	priority	NN
2164	113	20	class	class	NN
2164	113	21	.	.	.
2164	114	1	Notice	notice	VB
2164	114	2	that	that	IN
2164	114	3	the	the	DT
2164	114	4	overall	overall	JJ
2164	114	5	average	average	JJ
2164	114	6	wait	wait	VBP
2164	114	7	times	time	NNS
2164	114	8	for	for	IN
2164	114	9	the	the	DT
2164	114	10	non	non	JJ
2164	114	11	-	-	JJ
2164	114	12	FCFS	fcfs	JJ
2164	114	13	strategies	strategy	NNS
2164	114	14	are	be	VBP
2164	114	15	lower	low	JJR
2164	114	16	than	than	IN
2164	114	17	those	those	DT
2164	114	18	of	of	IN
2164	114	19	FCFS	FCFS	NNP
2164	114	20	.	.	.
2164	115	1	This	this	DT
2164	115	2	indicates	indicate	VBZ
2164	115	3	that	that	IN
2164	115	4	the	the	DT
2164	115	5	total	total	JJ
2164	115	6	reduction	reduction	NN
2164	115	7	in	in	IN
2164	115	8	waiting	wait	VBG
2164	115	9	times	time	NNS
2164	115	10	for	for	IN
2164	115	11	high	high	JJ
2164	115	12	-	-	HYPH
2164	115	13	priority	priority	NN
2164	115	14	users	user	NNS
2164	115	15	exceeds	exceed	VBZ
2164	115	16	the	the	DT
2164	115	17	additional	additional	JJ
2164	115	18	time	time	NN
2164	115	19	spent	spend	VBN
2164	115	20	waiting	wait	VBG
2164	115	21	by	by	IN
2164	115	22	users	user	NNS
2164	115	23	in	in	IN
2164	115	24	class	class	NN
2164	115	25	P-4	P-4	NNP
2164	115	26	.	.	.
2164	116	1	In	in	IN
2164	116	2	other	other	JJ
2164	116	3	words	word	NNS
2164	116	4	,	,	,
2164	116	5	these	these	DT
2164	116	6	strategies	strategy	NNS
2164	116	7	are	be	VBP
2164	116	8	globally	globally	RB
2164	116	9	more	more	RBR
2164	116	10	efficient	efficient	JJ
2164	116	11	than	than	IN
2164	116	12	FCFS	FCFS	NNP
2164	116	13	.	.	.
2164	117	1	Notice	notice	NN
2164	117	2	,	,	,
2164	117	3	too	too	RB
2164	117	4	,	,	,
2164	117	5	in	in	IN
2164	117	6	table	table	NN
2164	117	7	3	3	CD
2164	117	8	that	that	IN
2164	117	9	the	the	DT
2164	117	10	non	non	JJ
2164	117	11	-	-	JJ
2164	117	12	FCFS	fcfs	JJ
2164	117	13	strategies	strategy	NNS
2164	117	14	achieve	achieve	VBP
2164	117	15	significant	significant	JJ
2164	117	16	reductions	reduction	NNS
2164	117	17	in	in	IN
2164	117	18	the	the	DT
2164	117	19	median	median	JJ
2164	117	20	wait	wait	VBP
2164	117	21	time	time	NN
2164	117	22	compared	compare	VBN
2164	117	23	with	with	IN
2164	117	24	FCFS	FCFS	NNP
2164	117	25	.	.	.
2164	118	1	Table	table	NN
2164	118	2	3	3	CD
2164	118	3	.	.	.
2164	119	1	Distribution	distribution	NN
2164	119	2	of	of	IN
2164	119	3	Wait	Wait	NNP
2164	119	4	Times	Times	NNP
2164	119	5	by	by	IN
2164	119	6	Strategy	Strategy	NNP
2164	119	7	After	after	IN
2164	119	8	demonstrating	demonstrate	VBG
2164	119	9	the	the	DT
2164	119	10	impact	impact	NN
2164	119	11	that	that	IN
2164	119	12	breaking	break	VBG
2164	119	13	the	the	DT
2164	119	14	first	first	JJ
2164	119	15	-	-	HYPH
2164	119	16	come	come	VBN
2164	119	17	-	-	HYPH
2164	119	18	first	first	RB
2164	119	19	-	-	HYPH
2164	119	20	served	serve	VBN
2164	119	21	rule	rule	NN
2164	119	22	can	can	MD
2164	119	23	have	have	VB
2164	119	24	on	on	IN
2164	119	25	waiting	wait	VBG
2164	119	26	times	time	NNS
2164	119	27	,	,	,
2164	119	28	it	-PRON-	PRP
2164	119	29	is	be	VBZ
2164	119	30	important	important	JJ
2164	119	31	to	to	TO
2164	119	32	examine	examine	VB
2164	119	33	the	the	DT
2164	119	34	line	line	NN
2164	119	35	cuts	cut	NNS
2164	119	36	that	that	WDT
2164	119	37	are	be	VBP
2164	119	38	associated	associate	VBN
2164	119	39	with	with	IN
2164	119	40	each	each	DT
2164	119	41	of	of	IN
2164	119	42	these	these	DT
2164	119	43	strategies	strategy	NNS
2164	119	44	.	.	.
2164	120	1	Line	line	NN
2164	120	2	cuts	cut	NNS
2164	120	3	are	be	VBP
2164	120	4	recorded	record	VBN
2164	120	5	by	by	IN
2164	120	6	each	each	DT
2164	120	7	user	user	NN
2164	120	8	in	in	IN
2164	120	9	the	the	DT
2164	120	10	simulation	simulation	NN
2164	120	11	while	while	IN
2164	120	12	waiting	wait	VBG
2164	120	13	in	in	IN
2164	120	14	the	the	DT
2164	120	15	queue	queue	NN
2164	120	16	.	.	.
2164	121	1	Each	each	DT
2164	121	2	time	time	NN
2164	121	3	a	a	DT
2164	121	4	user	user	NN
2164	121	5	is	be	VBZ
2164	121	6	selected	select	VBN
2164	121	7	from	from	IN
2164	121	8	the	the	DT
2164	121	9	queue	queue	NN
2164	121	10	and	and	CC
2164	121	11	assigned	assign	VBD
2164	121	12	a	a	DT
2164	121	13	computer	computer	NN
2164	121	14	,	,	,
2164	121	15	remaining	remain	VBG
2164	121	16	users	user	NNS
2164	121	17	who	who	WP
2164	121	18	arrived	arrive	VBD
2164	121	19	prior	prior	RB
2164	121	20	to	to	IN
2164	121	21	the	the	DT
2164	121	22	one	one	CD
2164	121	23	just	just	RB
2164	121	24	selected	select	VBN
2164	121	25	note	note	NN
2164	121	26	having	have	VBG
2164	121	27	been	be	VBN
2164	121	28	skipped	skip	VBN
2164	121	29	over	over	IN
2164	121	30	.	.	.
2164	122	1	By	by	IN
2164	122	2	the	the	DT
2164	122	3	time	time	NN
2164	122	4	they	-PRON-	PRP
2164	122	5	are	be	VBP
2164	122	6	assigned	assign	VBN
2164	122	7	a	a	DT
2164	122	8	computer	computer	NN
2164	122	9	,	,	,
2164	122	10	users	user	NNS
2164	122	11	have	have	VBP
2164	122	12	recorded	record	VBN
2164	122	13	the	the	DT
2164	122	14	total	total	JJ
2164	122	15	number	number	NN
2164	122	16	of	of	IN
2164	122	17	times	time	NNS
2164	122	18	they	-PRON-	PRP
2164	122	19	were	be	VBD
2164	122	20	passed	pass	VBN
2164	122	21	over	over	RP
2164	122	22	in	in	IN
2164	122	23	the	the	DT
2164	122	24	queue	queue	NN
2164	122	25	.	.	.
2164	123	1	PUBLIC	PUBLIC	NNP
2164	123	2	LIBRARY	LIBRARY	NNP
2164	123	3	COMPUTER	computer	NN
2164	123	4	WAITING	waiting	NN
2164	123	5	QUEUES	QUEUES	NNP
2164	123	6	|	|	NNP
2164	123	7	WILLIAMSON	williamson	NN
2164	123	8	80	80	CD
2164	123	9	Figure	figure	NN
2164	123	10	3	3	CD
2164	123	11	.	.	.
2164	124	1	Cumulative	cumulative	JJ
2164	124	2	Distribution	distribution	NN
2164	124	3	of	of	IN
2164	124	4	Line	line	NN
2164	124	5	Cuts	cut	NNS
2164	124	6	by	by	IN
2164	124	7	Queuing	Queuing	NNP
2164	124	8	Strategy	Strategy	NNP
2164	124	9	Figure	Figure	NNP
2164	124	10	3	3	CD
2164	124	11	displays	display	VBZ
2164	124	12	the	the	DT
2164	124	13	cumulative	cumulative	JJ
2164	124	14	percentage	percentage	NN
2164	124	15	of	of	IN
2164	124	16	users	user	NNS
2164	124	17	experiencing	experience	VBG
2164	124	18	no	no	DT
2164	124	19	more	more	JJR
2164	124	20	than	than	IN
2164	124	21	the	the	DT
2164	124	22	listed	list	VBN
2164	124	23	number	number	NN
2164	124	24	of	of	IN
2164	124	25	cuts	cut	NNS
2164	124	26	for	for	IN
2164	124	27	each	each	DT
2164	124	28	non	non	JJ
2164	124	29	-	-	JJ
2164	124	30	FCFS	fcfs	JJ
2164	124	31	strategy	strategy	NN
2164	124	32	.	.	.
2164	125	1	The	the	DT
2164	125	2	majority	majority	NN
2164	125	3	of	of	IN
2164	125	4	users	user	NNS
2164	125	5	are	be	VBP
2164	125	6	not	not	RB
2164	125	7	passed	pass	VBN
2164	125	8	over	over	RP
2164	125	9	at	at	RB
2164	125	10	all	all	RB
2164	125	11	under	under	IN
2164	125	12	these	these	DT
2164	125	13	strategies	strategy	NNS
2164	125	14	.	.	.
2164	126	1	However	however	RB
2164	126	2	,	,	,
2164	126	3	there	there	EX
2164	126	4	is	be	VBZ
2164	126	5	a	a	DT
2164	126	6	small	small	JJ
2164	126	7	minority	minority	NN
2164	126	8	of	of	IN
2164	126	9	users	user	NNS
2164	126	10	that	that	WDT
2164	126	11	will	will	MD
2164	126	12	be	be	VB
2164	126	13	repeatedly	repeatedly	RB
2164	126	14	cut	cut	VBN
2164	126	15	in	in	IN
2164	126	16	line	line	NN
2164	126	17	.	.	.
2164	127	1	For	for	IN
2164	127	2	instance	instance	NN
2164	127	3	,	,	,
2164	127	4	in	in	IN
2164	127	5	our	-PRON-	PRP$
2164	127	6	simulation	simulation	NN
2164	127	7	,	,	,
2164	127	8	one	one	CD
2164	127	9	unfortunate	unfortunate	JJ
2164	127	10	individual	individual	NN
2164	127	11	was	be	VBD
2164	127	12	passed	pass	VBN
2164	127	13	over	over	RP
2164	127	14	in	in	IN
2164	127	15	the	the	DT
2164	127	16	queue	queue	NN
2164	127	17	sixteen	sixteen	CD
2164	127	18	times	time	NNS
2164	127	19	under	under	IN
2164	127	20	the	the	DT
2164	127	21	SJF	SJF	NNP
2164	127	22	strategy	strategy	NN
2164	127	23	.	.	.
2164	128	1	This	this	DT
2164	128	2	user	user	NN
2164	128	3	waited	wait	VBD
2164	128	4	ninety	ninety	CD
2164	128	5	-	-	HYPH
2164	128	6	one	one	CD
2164	128	7	minutes	minute	NNS
2164	128	8	using	use	VBG
2164	128	9	this	this	DT
2164	128	10	strategy	strategy	NN
2164	128	11	as	as	IN
2164	128	12	opposed	oppose	VBN
2164	128	13	to	to	IN
2164	128	14	only	only	RB
2164	128	15	fifty	fifty	CD
2164	128	16	-	-	HYPH
2164	128	17	nine	nine	CD
2164	128	18	minutes	minute	NNS
2164	128	19	under	under	IN
2164	128	20	the	the	DT
2164	128	21	familiar	familiar	JJ
2164	128	22	FCFS	FCFS	NNP
2164	128	23	waiting	wait	VBG
2164	128	24	queue	queue	NN
2164	128	25	.	.	.
2164	129	1	Most	Most	JJS
2164	129	2	customers	customer	NNS
2164	129	3	would	would	MD
2164	129	4	become	become	VB
2164	129	5	upset	upset	JJ
2164	129	6	upon	upon	IN
2164	129	7	seeing	see	VBG
2164	129	8	a	a	DT
2164	129	9	string	string	NN
2164	129	10	of	of	IN
2164	129	11	sixteen	sixteen	CD
2164	129	12	people	people	NNS
2164	129	13	jump	jump	VBP
2164	129	14	over	over	IN
2164	129	15	them	-PRON-	PRP
2164	129	16	in	in	IN
2164	129	17	the	the	DT
2164	129	18	queue	queue	NN
2164	129	19	and	and	CC
2164	129	20	get	get	VB
2164	129	21	on	on	IN
2164	129	22	a	a	DT
2164	129	23	computer	computer	NN
2164	129	24	while	while	IN
2164	129	25	they	-PRON-	PRP
2164	129	26	are	be	VBP
2164	129	27	enduring	endure	VBG
2164	129	28	such	such	PDT
2164	129	29	a	a	DT
2164	129	30	long	long	JJ
2164	129	31	wait	wait	NN
2164	129	32	.	.	.
2164	130	1	The	the	DT
2164	130	2	HRRN	HRRN	NNP
2164	130	3	strategy	strategy	NN
2164	130	4	caused	cause	VBD
2164	130	5	a	a	DT
2164	130	6	maximum	maximum	NN
2164	130	7	of	of	IN
2164	130	8	nine	nine	CD
2164	130	9	cuts	cut	NNS
2164	130	10	to	to	IN
2164	130	11	an	an	DT
2164	130	12	individual	individual	NN
2164	130	13	in	in	IN
2164	130	14	this	this	DT
2164	130	15	simulation	simulation	NN
2164	130	16	.	.	.
2164	131	1	This	this	DT
2164	131	2	user	user	NN
2164	131	3	waited	wait	VBD
2164	131	4	seventy	seventy	CD
2164	131	5	-	-	HYPH
2164	131	6	three	three	CD
2164	131	7	minutes	minute	NNS
2164	131	8	under	under	IN
2164	131	9	HRRN	HRRN	NNP
2164	131	10	versus	versus	IN
2164	131	11	only	only	RB
2164	131	12	fifty	fifty	CD
2164	131	13	-	-	HYPH
2164	131	14	five	five	CD
2164	131	15	minutes	minute	NNS
2164	131	16	using	use	VBG
2164	131	17	FCFS	FCFS	NNP
2164	131	18	.	.	.
2164	132	1	Extreme	extreme	JJ
2164	132	2	examples	example	NNS
2164	132	3	such	such	JJ
2164	132	4	as	as	IN
2164	132	5	those	those	DT
2164	132	6	above	above	RB
2164	132	7	are	be	VBP
2164	132	8	the	the	DT
2164	132	9	exception	exception	NN
2164	132	10	.	.	.
2164	133	1	Under	under	IN
2164	133	2	the	the	DT
2164	133	3	HRRN	HRRN	NNP
2164	133	4	and	and	CC
2164	133	5	SJF	SJF	NNP
2164	133	6	-	-	HYPH
2164	133	7	FB	FB	NNP
2164	133	8	strategies	strategy	NNS
2164	133	9	,	,	,
2164	133	10	99	99	CD
2164	133	11	%	%	NN
2164	133	12	of	of	IN
2164	133	13	users	user	NNS
2164	133	14	were	be	VBD
2164	133	15	passed	pass	VBN
2164	133	16	over	over	RP
2164	133	17	at	at	IN
2164	133	18	most	most	RBS
2164	133	19	four	four	CD
2164	133	20	times	time	NNS
2164	133	21	while	while	IN
2164	133	22	waiting	wait	VBG
2164	133	23	in	in	IN
2164	133	24	the	the	DT
2164	133	25	queue	queue	NN
2164	133	26	.	.	.
2164	134	1	CONCLUSION	conclusion	NN
2164	134	2	We	-PRON-	PRP
2164	134	3	have	have	VBP
2164	134	4	examined	examine	VBN
2164	134	5	the	the	DT
2164	134	6	simulation	simulation	NN
2164	134	7	of	of	IN
2164	134	8	several	several	JJ
2164	134	9	queuing	queuing	NN
2164	134	10	strategies	strategy	NNS
2164	134	11	using	use	VBG
2164	134	12	a	a	DT
2164	134	13	single	single	JJ
2164	134	14	month	month	NN
2164	134	15	of	of	IN
2164	134	16	computer	computer	NN
2164	134	17	usage	usage	NN
2164	134	18	data	datum	NNS
2164	134	19	from	from	IN
2164	134	20	the	the	DT
2164	134	21	Southern	Southern	NNP
2164	134	22	Oaks	Oaks	NNPS
2164	134	23	Library	Library	NNP
2164	134	24	.	.	.
2164	135	1	The	the	DT
2164	135	2	relative	relative	JJ
2164	135	3	performance	performance	NN
2164	135	4	difference	difference	NN
2164	135	5	between	between	IN
2164	135	6	queuing	queuing	NN
2164	135	7	strategies	strategy	NNS
2164	135	8	will	will	MD
2164	135	9	depend	depend	VB
2164	135	10	on	on	IN
2164	135	11	the	the	DT
2164	135	12	supply	supply	NN
2164	135	13	and	and	CC
2164	135	14	demand	demand	NN
2164	135	15	of	of	IN
2164	135	16	computers	computer	NNS
2164	135	17	at	at	IN
2164	135	18	any	any	DT
2164	135	19	given	give	VBN
2164	135	20	location	location	NN
2164	135	21	.	.	.
2164	136	1	Clearly	clearly	RB
2164	136	2	,	,	,
2164	136	3	at	at	IN
2164	136	4	libraries	library	NNS
2164	136	5	with	with	IN
2164	136	6	plenty	plenty	NN
2164	136	7	of	of	IN
2164	136	8	public	public	JJ
2164	136	9	computers	computer	NNS
2164	136	10	for	for	IN
2164	136	11	which	which	WDT
2164	136	12	customers	customer	NNS
2164	136	13	seldom	seldom	RB
2164	136	14	have	have	VBP
2164	136	15	to	to	TO
2164	136	16	wait	wait	VB
2164	136	17	,	,	,
2164	136	18	the	the	DT
2164	136	19	choice	choice	NN
2164	136	20	of	of	IN
2164	136	21	queuing	queuing	NN
2164	136	22	strategy	strategy	NN
2164	136	23	is	be	VBZ
2164	136	24	inconsequential	inconsequential	JJ
2164	136	25	.	.	.
2164	137	1	However	however	RB
2164	137	2	,	,	,
2164	137	3	for	for	IN
2164	137	4	libraries	library	NNS
2164	137	5	struggling	struggle	VBG
2164	137	6	with	with	IN
2164	137	7	waiting	wait	VBG
2164	137	8	times	time	NNS
2164	137	9	on	on	IN
2164	137	10	par	par	NN
2164	137	11	with	with	IN
2164	137	12	those	those	DT
2164	137	13	examined	examine	VBN
2164	137	14	here	here	RB
2164	137	15	,	,	,
2164	137	16	the	the	DT
2164	137	17	choice	choice	NN
2164	137	18	can	can	MD
2164	137	19	have	have	VB
2164	137	20	a	a	DT
2164	137	21	substantial	substantial	JJ
2164	137	22	impact	impact	NN
2164	137	23	.	.	.
2164	138	1	INFORMATION	INFORMATION	NNP
2164	138	2	TECHNOLOGY	technology	NN
2164	138	3	AND	and	CC
2164	138	4	LIBRARIES	LIBRARIES	NNP
2164	138	5	|	|	NNP
2164	138	6	JUNE	JUNE	NNP
2164	138	7	2012	2012	CD
2164	138	8	81	81	CD
2164	138	9	In	in	IN
2164	138	10	general	general	JJ
2164	138	11	,	,	,
2164	138	12	however	however	RB
2164	138	13	,	,	,
2164	138	14	these	these	DT
2164	138	15	simulation	simulation	NN
2164	138	16	results	result	NNS
2164	138	17	demonstrate	demonstrate	VBP
2164	138	18	the	the	DT
2164	138	19	ability	ability	NN
2164	138	20	of	of	IN
2164	138	21	non	non	JJ
2164	138	22	-	-	JJ
2164	138	23	FCFS	fcfs	JJ
2164	138	24	queuing	queuing	NN
2164	138	25	strategies	strategy	NNS
2164	138	26	to	to	IN
2164	138	27	significantly	significantly	RB
2164	138	28	lower	lower	VB
2164	138	29	waiting	wait	VBG
2164	138	30	times	time	NNS
2164	138	31	for	for	IN
2164	138	32	certain	certain	JJ
2164	138	33	classes	class	NNS
2164	138	34	of	of	IN
2164	138	35	users	user	NNS
2164	138	36	without	without	IN
2164	138	37	partitioning	partition	VBG
2164	138	38	the	the	DT
2164	138	39	pool	pool	NN
2164	138	40	of	of	IN
2164	138	41	computers	computer	NNS
2164	138	42	.	.	.
2164	139	1	These	these	DT
2164	139	2	reductions	reduction	NNS
2164	139	3	in	in	IN
2164	139	4	waiting	wait	VBG
2164	139	5	times	time	NNS
2164	139	6	come	come	VBP
2164	139	7	at	at	IN
2164	139	8	the	the	DT
2164	139	9	cost	cost	NN
2164	139	10	of	of	IN
2164	139	11	allowing	allow	VBG
2164	139	12	high	high	JJ
2164	139	13	priority	priority	NN
2164	139	14	users	user	NNS
2164	139	15	to	to	TO
2164	139	16	essentially	essentially	RB
2164	139	17	cut	cut	VB
2164	139	18	in	in	IN
2164	139	19	line	line	NN
2164	139	20	.	.	.
2164	140	1	This	this	DT
2164	140	2	causes	cause	VBZ
2164	140	3	slightly	slightly	RB
2164	140	4	longer	long	RBR
2164	140	5	wait	wait	VBP
2164	140	6	times	time	NNS
2164	140	7	for	for	IN
2164	140	8	low	low	JJ
2164	140	9	priority	priority	NN
2164	140	10	users	user	NNS
2164	140	11	;	;	:
2164	140	12	but	but	CC
2164	140	13	,	,	,
2164	140	14	overall	overall	JJ
2164	140	15	average	average	JJ
2164	140	16	and	and	CC
2164	140	17	median	median	JJ
2164	140	18	wait	wait	VB
2164	140	19	times	time	NNS
2164	140	20	see	see	VBP
2164	140	21	a	a	DT
2164	140	22	small	small	JJ
2164	140	23	reduction	reduction	NN
2164	140	24	.	.	.
2164	141	1	Of	of	RB
2164	141	2	course	course	RB
2164	141	3	,	,	,
2164	141	4	for	for	IN
2164	141	5	some	some	DT
2164	141	6	customers	customer	NNS
2164	141	7	,	,	,
2164	141	8	being	be	VBG
2164	141	9	passed	pass	VBN
2164	141	10	over	over	RP
2164	141	11	in	in	IN
2164	141	12	line	line	NN
2164	141	13	even	even	RB
2164	141	14	once	once	RB
2164	141	15	is	be	VBZ
2164	141	16	intolerable	intolerable	JJ
2164	141	17	.	.	.
2164	142	1	Furthermore	furthermore	RB
2164	142	2	,	,	,
2164	142	3	creating	create	VBG
2164	142	4	a	a	DT
2164	142	5	system	system	NN
2164	142	6	to	to	TO
2164	142	7	implement	implement	VB
2164	142	8	an	an	DT
2164	142	9	alternative	alternative	JJ
2164	142	10	queuing	queuing	NN
2164	142	11	strategy	strategy	NN
2164	142	12	may	may	MD
2164	142	13	present	present	VB
2164	142	14	obstacles	obstacle	NNS
2164	142	15	of	of	IN
2164	142	16	its	-PRON-	PRP$
2164	142	17	own	own	JJ
2164	142	18	.	.	.
2164	143	1	However	however	RB
2164	143	2	,	,	,
2164	143	3	if	if	IN
2164	143	4	the	the	DT
2164	143	5	need	need	NN
2164	143	6	to	to	TO
2164	143	7	provide	provide	VB
2164	143	8	for	for	IN
2164	143	9	quick	quick	JJ
2164	143	10	,	,	,
2164	143	11	short	short	JJ
2164	143	12	-	-	HYPH
2164	143	13	term	term	NN
2164	143	14	computer	computer	NN
2164	143	15	access	access	NN
2164	143	16	is	be	VBZ
2164	143	17	pressing	press	VBG
2164	143	18	enough	enough	RB
2164	143	19	for	for	IN
2164	143	20	a	a	DT
2164	143	21	library	library	NN
2164	143	22	to	to	TO
2164	143	23	create	create	VB
2164	143	24	a	a	DT
2164	143	25	separate	separate	JJ
2164	143	26	pool	pool	NN
2164	143	27	of	of	IN
2164	143	28	“	"	``
2164	143	29	express	express	VB
2164	143	30	”	"	''
2164	143	31	computers	computer	NNS
2164	143	32	;	;	:
2164	143	33	then	then	RB
2164	143	34	,	,	,
2164	143	35	one	one	CD
2164	143	36	of	of	IN
2164	143	37	the	the	DT
2164	143	38	non	non	JJ
2164	143	39	-	-	JJ
2164	143	40	FCFS	fcfs	JJ
2164	143	41	queuing	queuing	NN
2164	143	42	strategies	strategy	NNS
2164	143	43	discussed	discuss	VBN
2164	143	44	in	in	IN
2164	143	45	this	this	DT
2164	143	46	paper	paper	NN
2164	143	47	may	may	MD
2164	143	48	be	be	VB
2164	143	49	a	a	DT
2164	143	50	viable	viable	JJ
2164	143	51	alternative	alternative	NN
2164	143	52	.	.	.
2164	144	1	At	at	IN
2164	144	2	the	the	DT
2164	144	3	very	very	RB
2164	144	4	least	least	JJS
2164	144	5	,	,	,
2164	144	6	the	the	DT
2164	144	7	FCFS-15	fcfs-15	CD
2164	144	8	simulation	simulation	NN
2164	144	9	results	result	NNS
2164	144	10	should	should	MD
2164	144	11	give	give	VB
2164	144	12	one	one	CD
2164	144	13	pause	pause	NN
2164	144	14	before	before	IN
2164	144	15	resorting	resort	VBG
2164	144	16	to	to	IN
2164	144	17	designated	designate	VBN
2164	144	18	“	"	``
2164	144	19	express	express	NNP
2164	144	20	”	"	''
2164	144	21	and	and	CC
2164	144	22	“	"	``
2164	144	23	non-	non-	NNP
2164	144	24	express	express	NNP
2164	144	25	”	"	''
2164	144	26	computers	computer	NNS
2164	144	27	in	in	IN
2164	144	28	an	an	DT
2164	144	29	attempt	attempt	NN
2164	144	30	to	to	TO
2164	144	31	remedy	remedy	VB
2164	144	32	unacceptable	unacceptable	JJ
2164	144	33	customer	customer	NN
2164	144	34	waiting	waiting	NN
2164	144	35	times	time	NNS
2164	144	36	.	.	.
2164	145	1	ACKNOWLEDGMENTS	acknowledgment	NNS
2164	145	2	The	the	DT
2164	145	3	author	author	NN
2164	145	4	would	would	MD
2164	145	5	like	like	VB
2164	145	6	to	to	TO
2164	145	7	thank	thank	VB
2164	145	8	the	the	DT
2164	145	9	Metropolitan	Metropolitan	NNP
2164	145	10	Library	Library	NNP
2164	145	11	System	System	NNP
2164	145	12	,	,	,
2164	145	13	Kay	Kay	NNP
2164	145	14	Bauman	Bauman	NNP
2164	145	15	,	,	,
2164	145	16	Jimmy	Jimmy	NNP
2164	145	17	Welch	Welch	NNP
2164	145	18	,	,	,
2164	145	19	Sudarshan	Sudarshan	NNP
2164	145	20	Dhall	Dhall	NNP
2164	145	21	,	,	,
2164	145	22	and	and	CC
2164	145	23	Bo	Bo	NNP
2164	145	24	Kinney	Kinney	NNP
2164	145	25	for	for	IN
2164	145	26	their	-PRON-	PRP$
2164	145	27	support	support	NN
2164	145	28	and	and	CC
2164	145	29	assistance	assistance	NN
2164	145	30	with	with	IN
2164	145	31	this	this	DT
2164	145	32	paper	paper	NN
2164	145	33	as	as	RB
2164	145	34	well	well	RB
2164	145	35	as	as	IN
2164	145	36	Tracey	Tracey	NNP
2164	145	37	Thompson	Thompson	NNP
2164	145	38	and	and	CC
2164	145	39	Tim	Tim	NNP
2164	145	40	Spindle	Spindle	NNP
2164	145	41	for	for	IN
2164	145	42	their	-PRON-	PRP$
2164	145	43	excellent	excellent	JJ
2164	145	44	review	review	NN
2164	145	45	and	and	CC
2164	145	46	recommendations	recommendation	NNS
2164	145	47	.	.	.
2164	146	1	REFERENCES	reference	NNS
2164	146	2	1	1	CD
2164	146	3	.	.	.
2164	147	1	J.	J.	NNP
2164	147	2	D.	D.	NNP
2164	147	3	Slone	Slone	NNP
2164	147	4	,	,	,
2164	147	5	“	"	``
2164	147	6	The	the	DT
2164	147	7	Impact	Impact	NNP
2164	147	8	of	of	IN
2164	147	9	Time	Time	NNP
2164	147	10	Constraints	Constraints	NNP
2164	147	11	on	on	IN
2164	147	12	Internet	Internet	NNP
2164	147	13	and	and	CC
2164	147	14	Web	Web	NNP
2164	147	15	Use	Use	NNP
2164	147	16	,	,	,
2164	147	17	”	"	''
2164	147	18	Journal	Journal	NNP
2164	147	19	of	of	IN
2164	147	20	the	the	DT
2164	147	21	American	American	NNP
2164	147	22	Society	Society	NNP
2164	147	23	for	for	IN
2164	147	24	Information	Information	NNP
2164	147	25	Science	Science	NNP
2164	147	26	and	and	CC
2164	147	27	Technology	Technology	NNP
2164	147	28	58	58	CD
2164	147	29	(	(	-LRB-
2164	147	30	2007	2007	CD
2164	147	31	)	)	-RRB-
2164	147	32	:	:	:
2164	147	33	508–17	508–17	CD
2164	147	34	.	.	.
2164	148	1	2	2	LS
2164	148	2	.	.	.
2164	149	1	William	William	NNP
2164	149	2	Mendenhall	Mendenhall	NNP
2164	149	3	and	and	CC
2164	149	4	Terry	Terry	NNP
2164	149	5	Sincich	Sincich	NNP
2164	149	6	,	,	,
2164	149	7	Statistics	Statistics	NNPS
2164	149	8	for	for	IN
2164	149	9	Engineering	Engineering	NNP
2164	149	10	and	and	CC
2164	149	11	the	the	DT
2164	149	12	Sciences	Sciences	NNPS
2164	149	13	(	(	-LRB-
2164	149	14	Upper	Upper	NNP
2164	149	15	Saddle	Saddle	NNP
2164	149	16	River	River	NNP
2164	149	17	,	,	,
2164	149	18	NJ	NJ	NNP
2164	149	19	:	:	:
2164	149	20	Prentice	Prentice	NNP
2164	149	21	-	-	HYPH
2164	149	22	Hall	Hall	NNP
2164	149	23	,	,	,
2164	149	24	2006	2006	CD
2164	149	25	)	)	-RRB-
2164	149	26	,	,	,
2164	149	27	151–54	151–54	CD
2164	149	28	.	.	.
2164	150	1	3	3	LS
2164	150	2	.	.	.
2164	151	1	Abraham	Abraham	NNP
2164	151	2	Silberschatz	Silberschatz	NNP
2164	151	3	,	,	,
2164	151	4	Peter	Peter	NNP
2164	151	5	Baer	Baer	NNP
2164	151	6	Galvin	Galvin	NNP
2164	151	7	,	,	,
2164	151	8	and	and	CC
2164	151	9	Greg	Greg	NNP
2164	151	10	Gagne	Gagne	NNP
2164	151	11	,	,	,
2164	151	12	Operating	operate	VBG
2164	151	13	System	system	NN
2164	151	14	Concepts	concept	NNS
2164	151	15	(	(	-LRB-
2164	151	16	Hoboken	Hoboken	NNP
2164	151	17	,	,	,
2164	151	18	NJ	NJ	NNP
2164	151	19	:	:	:
2164	151	20	Wiley	Wiley	NNP
2164	151	21	,	,	,
2164	151	22	2009	2009	CD
2164	151	23	)	)	-RRB-
2164	151	24	,	,	,
2164	151	25	188–200	188–200	CD
2164	151	26	.	.	.