113
113

Oct 5, 2013
10/13

by
E. Altman, B. Gaujal and A. Hordijk

texts

######
eye 113

######
favorite 0

######
comment 0

Opening new directions in research in both discrete event dynamic systems as well as in stochastic control, this volume focuses on a wide class of control and of optimization problems over sequences of integer numbers. This is a counterpart of convex optimization in the setting of discrete optimization. The theory developed is applied to the control of stochastic discrete-event dynamic systems. Some applications are admission, routing, service allocation and vacation control in queuing...

Topics: Queueing Theory, "

2,186
2.2K

Oct 5, 2013
10/13

by
Robert B. Cooper.

texts

######
eye 2,186

######
favorite 0

######
comment 0

This classic book on Queueing Theory is available on line through Robert Cooper's home page. Lecture Notes Collection FreeScience.info ID1287 Obtained from http://www.cse.fau.edu/~bob/publications/IntroToQueueingTheory_Cooper.pdf http://www.freescience.info/go.php?pagename=books&id=1287

Topics: Queueing Theory, "

29
29

Oct 8, 2015
10/15

by
Gaver, Donald Paul.;Jacobs, Patricia A.

texts

######
eye 29

######
favorite 0

######
comment 0

Title from cover

Topic: QUEUEING THEORY.

Naval Postgraduate School

122
122

Jan 25, 2013
01/13

by
Gaver, Donald Paul.;Jacobs, Patricia A.

texts

######
eye 122

######
favorite 0

######
comment 0

Title from cover

Topic: QUEUEING THEORY.

40
40

Oct 7, 2015
10/15

by
Gaver, Donald Paul.;Jacobs, Patricia A.;Becker, Kevin J.;Lawphongpanich, Siriphong, 1956-

texts

######
eye 40

######
favorite 0

######
comment 0

Cover title

Topic: JOBS.,QUEUEING THEORY.

Naval Postgraduate School

449
449

Jan 16, 2013
01/13

by
Gaver, Donald Paul.;Jacobs, Patricia A.;Becker, Kevin J.;Lawphongpanich, Siriphong, 1956-

texts

######
eye 449

######
favorite 0

######
comment 0

Cover title

Topics: JOBS., QUEUEING THEORY.

36
36

Oct 7, 2015
10/15

by
Gaver, Donald Paul;Jacobs, Patricia A.

texts

######
eye 36

######
favorite 0

######
comment 0

Cover title

Topic: TIME INTERVALS.,STOCHASTIC PROCESSES.,QUEUEING THEORY.,TELECOMMUNICATIONS.

Naval Postgraduate School

292
292

Jan 16, 2013
01/13

by
Gaver, Donald Paul;Jacobs, Patricia A.

texts

######
eye 292

######
favorite 0

######
comment 0

Cover title

Topics: TIME INTERVALS., STOCHASTIC PROCESSES., QUEUEING THEORY., TELECOMMUNICATIONS.

232
232

May 23, 2011
05/11

by
Hendricks, Robert C.; Griffin, Thomas A.; Bobula, George A.; Bill, Robert C.; Hull, David R.; Csavina, Kristine R

texts

######
eye 232

######
favorite 0

######
comment 0

Post-test investigation of a T-700 engine brush seal found regions void of bristles ('yanked out'), regions of bent-over bristles near the inlet, some 'snapped' bristles near the fence, and a more uniform 'smeared' bristle interface between the first and last axial rows of bristles. Several bristles were cut from the brush seal, wax mounted, polished, and analyzed. Metallographic analysis of the bristles near the rub tip showed tungsten-rich phases uniformly distributed throughout the bristle...

Topics: SCHEDULING, AIRPORTS, SLOTS, RUNWAYS, QUEUEING THEORY, LIGHT AIRCRAFT, TRAFFIC

376
376

Jun 1, 2011
06/11

by
Froessling, Nil

texts

######
eye 376

######
favorite 0

######
comment 0

The fundamental boundary layer equations for the flow, temperature and concentration fields are presented. Two dimensional symmetrical and unsymmetrical and rotationally symmetrical steady boundary layer flows are treated as well as the transfer boundary layer. Approximation methods for the calculation of the transfer layer are discussed and a brief survey of an investigation into the validity of the law that the Nusselt number is proportional to the cube root of the Prandtl number is presented.

Topics: OPERATING COSTS, AIRPORTS, RUNWAYS, CONGESTION, QUEUEING THEORY, CALIBRATING

323
323

May 31, 2011
05/11

by
Jedrich, Nick; Zimbelman, Darrell; Turczyn, Mark; Sills, Joel; Voorhees, Carl; Clapp, Bria

texts

######
eye 323

######
favorite 0

######
comment 0

This paper presents an overview of the Hubble Space Telescope (HST) Near Infrared Camera and Multi-Object Spectrometer (NICMOS) Cryo Cooler (MCC) system, a description of the micro-vibration characterization testing performed, and a discussion of the simulated performance. The NCC is a reverse Brayton cycle system that employs micro turbo-machinery to provide cooling to the NICMOS instrument. Extensive testing was conducted to quantify the expected on-orbit disturbances caused by the micro...

Topics: ALGORITHMS, QUEUEING THEORY, MATHEMATICAL MODELS, SCHEDULING, COMPUTERIZED SIMULATION

Journal of Research of the National Bureau of Standards

Topics: Allocation, queueing theory, scheduling, switching theory, traffic flow, transportation theory

The project was concerned with optimizing performance in complex network content dissemination and cloud systems. We employed tools of theory, convex optimization and control theory, to study how to disseminate content in a distributed network, managing tradeoffs inefficiency, energy, and resource allocation. Fluid models provide a tractable path to represent these high dimensional problems, retaining accuracy in key performance questions. A first line of work, initiated in our previous...

Topics: DTIC Archive, Paganini,Fernando, URUGUAY UNIVERSIDADE ORT MONTEVIDO MONTEVIDEO Uruguay, QUEUEING...

213
213

Jul 25, 2010
07/10

by
Cattolica, R. J.; Schmitt, R. L.; Palmer, R. E

texts

######
eye 213

######
favorite 0

######
comment 0

We have examined the feasibility of implementing nonintrusive optical diagnostics to measure the properties of the boundary layer surrounding a hypersonic vehicle. Measurements of density, temperature, location of the shock front, and N2, O2, and NO concentrations are feasible using electron-beam fluorescence, for which instrumentation appropriate for flight experiments already exists. In particular, NO will be a key indicator of the chemistry occurring at the vehicle nose and leading edges....

Topics: COMPUTER TECHNIQUES, LOCAL AREA NETWORKS, NETWORK ANALYSIS, QUEUEING THEORY, COMPUTER PROGRAMMING,...

We describe the participation of the University of Amsterdam's ILPS group in the blog track at TREC 2008. We mainly explored different ways of using external corpora to expand the original query. In the blog post retrieval task we did not succeed in improving over a simple baseline (equal weights for both the expanded and original query). Obtaining optimal weights for the original and the expanded query remains a subject of investigation. In the blog distillation task we tried to improve over...

Topics: DTIC Archive, AMSTERDAM UNIV (NETHERLANDS), *QUEUEING THEORY, *INFORMATION RETRIEVAL, METRICS, BASE...

This paper addresses the problem in which jobs of different types arrive at a system that consists of a collection of individual and somewhat diverse processors. The processors differ in that each may spedalize in one job type, but may also do others. Job types that are totally incompatible with a processor have an infinite service on that processor, but degrees of incompatibility may exist, and are modeled here. Using static queuing models, several practical performance measures may be...

Topics: DTIC Archive, Gaver, Donald P., NAVAL POSTGRADUATE SCHOOL MONTEREY CA, *JOBS, *QUEUEING THEORY,...

173
173

Jul 10, 2010
07/10

by
BACHERIKOV, V. V.; KAGAYN, V. E.; MAKAROV, Y. A.; STEPANOV, B. M

texts

######
eye 173

######
favorite 0

######
comment 0

A DESCRIPTION IS GIVEN OF HIGH-SPEED (PASSBAND 20 MHZ) LOGARITHMIC PHOTODETECTORS WITH A LARGE INPUT SIGNAL RANGE (UP TO 100,000). THE METHODS AND FACILITIES OF OBTAINING NONLINEAR LUMINOUS CHARACTERISTICS OVER A WIDE AMPLITUDE AND TIME RANGE ARE DISCUSSED. THE RESULTS ARE PRESENTED OF A STUDY OF THE AMPLITUDE AND TIME CHARACTERISTICS OF PHOTODETECTORS BASED ON CERTAIN PHOTOMULTIPLIERS. THE MECHANISM OF NONLINEAR CONVERSION OF ELECTRON FLUXES (CONVERSION REGULATED BY A SPACE CHARGE) IS...

Topics: COMPUTER STORAGE DEVICES, DIGITAL COMPUTERS, LANGUAGES, TIME SHARING, COMPUTER PROGRAMS, DATA...

This work establishes a simple characterization of stationary distributions of a broad class of reflected diffusions in piecewise smooth domains with oblique reflection, including those that are not necessarily semimartingales, and uses it to identify classes of reflected diffusions with state-dependent drift for which the stationary density takes an explicit form. Reflected diffusions arise in a variety of applications, ranging from queueing theory and operations research to finance and...

Topics: DTIC Archive, BROWN UNIV PROVIDENCE RI, *STOCHASTIC PROCESSES, DIFFUSION, DISTRIBUTION, OPERATIONS...

The theory of series cyclic queues is generalized to other configurations such as branching series queueing models. An equivalence relation is developed between time average steady state probabilities and the stationary probabilities of the imbedded Markov Chain of a series cyclic queue. A statistical inference model is developed to estimate the mean exponential service rate for a series cyclic queue model.

Topics: DTIC Archive, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *QUEUEING THEORY, PERMUTATIONS,...

We describe the participation of the University of Amsterdam's ILPS group in the blog track at TREC 2009. We focus on the top stories identification task, and take an approach that does not require the headlines of top stories to be known beforehand. We explore the feasibility of a so-called blogs to news approach: given a date and a set of blog posts, identify the main topics for that date. This approach is more general than just finding top stories, but it can still be applied to the task of...

Topics: DTIC Archive, AMSTERDAM UNIV (NETHERLANDS), *PREPROCESSING, *IDENTIFICATION, RANKING, QUEUEING...

We analyze a sequence of single-server queueing systems with impatient customers in heavy traffic. Our state process is the offered waiting time and the customer arrival process has a state dependent intensity. Service times and customer patient-times are independent, i.i.d. with general distributions subject to mild constraints. We establish the heavy traffic approximation for the scaled offered waiting time process and obtain a diffusion process as the heavy traffic limit. The drift...

Topics: DTIC Archive, IOWA STATE UNIV AMES DEPT OF MATHEMATICS, *QUEUEING THEORY, STOCHASTIC CONTROL,...

A backward equation technique is used to derive properties of a Time-dependent infinite server system subject to compound Poisson demand. The method is used to suggest a model leading to Zipf's law. (Author)

Topics: DTIC Archive, Gaver,Donald P, NAVAL POSTGRADUATE SCHOOL MONTEREY CALIF, *QUEUEING THEORY, DELAY,...

The setting for the spectrum allocation problems that we are currently considering consists of n tasks (i.e. flight tests). Each task has a bandwidth requirement, and a length. Thus each test can be thought of as a rectangle, with the vertical height of the rectangle being the bandwidth requirement. The scheduling space is a larger rectangle space, with height equal to the total spectrum available and length equal to the time period to be scheduled (e.g. a day). In order to avoid interference,...

Topics: DTIC Archive, Kalyanasundaram, Bala, PITTSBURGH UNIV PA, *SPECTRA, *ALLOCATIONS, ALGORITHMS,...

Importance sampling is a technique that is commonly used to speed up Monte Carlo simulation of rare events. However, little is known regarding the design of efficient importance sampling algorithms in the context of queueing networks. The standard approach, which simulates the system using an a priori fixed change of measure suggested by large deviation analysis, has been shown to fail in even the simplest network setting (e.g., a two-node tandem network). Exploiting connections between...

Topics: DTIC Archive, Dupuis, Paul, BROWN UNIV PROVIDENCE RI DIV OF APPLIED MATHEMATICS, *STATISTICAL...

Described is the implementation of a networked, UNIX based queueing system developed on contract for NASA. The system discussed supports both batch and device requests, and provides the facilities of remote queueing, request routing, remote status, queue access controls, batch request resource quota limits, and remote output return.

Topics: NASA Technical Reports Server (NTRS), COMPUTER NETWORKS, COMPUTER PROGRAMS, QUEUEING THEORY, BATCH...

We establish heavy traffic limit theorems for queue-length processes in critically loaded single class queueing networks with state-dependent arrival and service rates. A distinguishing feature of our model is non-Markovian state dependence. The limit stochastic process is a continuous-path reflected process on the nonnegative orthant. We give an application to generalised Jackson networks with state-dependent rates.

Topics: DTIC Archive, COLORADO STATE UNIV FORT COLLINS, *NETWORKS, *QUEUEING THEORY, *STOCHASTIC PROCESSES,...

The relaxed heap is a priority queue data structure that achieves the same amortized time bounds as the Fibonacci heap - a sequence of m decrease key and n delete min operations takes time O(m + n log n). A variant of relaxed heaps achieves similar bounds in the worst case- o(1) time for decrease key and O(log n) for delete min. A relaxed heap is a type of binomial queue that allows heap order to be violated.

Topics: DTIC Archive, Driscoll, James R, PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE, *QUEUEING THEORY,...

We consider an M/G/1 queue that operates under a (T,N)-policy: whenever the system becomes empty, the server is idle for a time T and then it inspects the queue continuously without serving customers until there are N customers waiting - thereupon the server is activated for service and serves customers continuously until the system becomes empty. This idle-inspection-service cycle is repeated indefinitely. There are costs for inspecting the queue, activating and running the server, and holding...

Topics: DTIC Archive, Kim,Sung S, GEORGIA INST OF TECH ATLANTA, *QUEUEING THEORY, COMPUTATIONS, POLICIES,...

112
112

May 27, 2011
05/11

by
Reames, Donald V

texts

######
eye 112

######
favorite 0

######
comment 0

This report concerns the energy spectra and abundances of ions with atomic number, Z, in the interval 2 greater than or equal to Z and Z less than or equal to 36 and energies approximately 3-20 MeV/amu for solar and interplanetary quiet periods between November 1994 and April 1998 as measured by the large-geometry LEMT telescope on the Wind spacecraft near Earth. The energy spectra show the presence of galactic (GCR) and 'anomalous' cosmic ray (ACR) components, depending on the element. ACR...

Topics: DATA BASES, DISKS, INPUT/OUTPUT ROUTINES, COOLING, QUEUEING THEORY, MATHEMATICAL MODELS, ARRAYS,...

SIMD computers with local indirect addressing allow programs to have queues and buffers, making certain kinds of problems much more efficient. Examined here are a class of problems characterized by computations on data points where the computation is identical, but the convergence rate is data dependent. Normally, in this situation, the algorithm time is governed by the maximum number of iterations required by each point. Using indirect addressing allows a processor to proceed to the next data...

Topics: NASA Technical Reports Server (NTRS), ARCHITECTURE (COMPUTERS), DATA PROCESSING, ITERATION,...

This document studies the asymptotic behavior of maximum values of birth and death processes over large time intervals. In most cases, the distributions of these maxima, under standard linear normalizations, either do not converge or they converge to a degenerate distribution. However, by allowing the birth and death rates to vary in a certain manner as the time interval increases, we show that the maxima do indeed have three possible limit distributions. Two of these are classical extreme...

Topics: DTIC Archive, Serfozo,Richard F, GEORGIA INST OF TECH ATLANTA, *TIME INTERVALS, *STATISTICAL...

193
193

May 29, 2011
05/11

by
Winder, Lee F.; Kuchar, James K

texts

######
eye 193

######
favorite 0

######
comment 0

The goal of the research was to develop formal guidelines for the design of hazard avoidance systems. An alerting system is automation designed to reduce the likelihood of undesirable outcomes that are due to rare failures in a human-controlled system. It accomplishes this by monitoring the system, and issuing warning messages to the human operators when thought necessary to head off a problem. On examination of existing and recently proposed logics for alerting it appears that few commonly...

Topics: HELICOPTERS, FLIGHT SIMULATION, MOTION SIMULATION, FLIGHT ENVELOPES, FLIGHT TESTS, HORIZONTAL...

This report outlines TREC-2008 Relevance Feedback Track experiments done at RMIT University. Relevance feedback in text retrieval systems is a process where a user gives explicit feedback on an initial set of retrieval results returned by a search system. For example, the user might mark some of the items as being relevant, or not relevant, to their current information need. This feedback can be used in different ways; one approach is query expansion, where terms from the relevant documents are...

Topics: DTIC Archive, ROYAL MELBOURNE INST OF TECH (AUSTRALIA), *INFORMATION RETRIEVAL, *FEEDBACK,...

We propose a parametric class of myopic scheduling and routing policies for open and closed multiclass queueing networks. In open networks, they steer the state of the system toward a predetermined and fixed target, while, in closed networks they steer instantaneous throughputs toward a fixed target. In both cases, the proposed policies measure distance from the target using a weighted norm. In open networks, we establish that for an L2 norm the corresponding policies are stable. In closed...

Topics: DTIC Archive, BOSTON UNIV MA, *QUEUEING THEORY, *ROUTING, *SCHEDULING, HEURISTIC METHODS, NUMERICAL...

The long-range objectives of this program is to develop tools and techniques to define, measure, and predict the capacity of an air traffic control system, which can then be used in analytical studies in support of long- range plans, management decisions, and system performance evaluations. The method of approach in this contract provides for testing and refining these tools by using them in typical current problems. This report illustrates the application of these tools to five typical current...

Topics: DTIC Archive, Raisbeck, G, LITTLE (ARTHUR D) INC CAMBRIDGE MA, *AIR TRAFFIC CONTROL SYSTEMS, COST...

The goals of the work are: To define the capacity of an ATC system and its major elements; To find quantitative relations between capacity and the overall performance of the air transportation system; and To find quantitative relations between capacity and the specifications, operating parameters, and environment of the ATC system.

Topics: DTIC Archive, Raisbeck, G, LITTLE (ARTHUR D) INC CAMBRIDGE MA, *AIR TRAFFIC CONTROL SYSTEMS,...

The expected delay of a side-road driver attempting to merge with, or cross, a main-road traffic stream is studied. The model includes the effect of mixture of 'slow' and 'fast' drivers at the side road, and of different gap acceptance probabilities. Numerical results show the manner in which long-run delays are approached, and an approximation to the transient behavior of delays is studied.

Topics: DTIC Archive, CARNEGIE INST OF TECH PITTSBURGH PA GRADUATE SCHOOL OF INDUSTRIAL ADMINISTRATION,...

Renewal theory plays a prominent role in the analysis of the behavior of type I and type II particle counters. There is an integral formula (due to R. pyke) for the distribution of the time between successive registrations with a Type I counter under the assumptions that the particles arrive according to a general re current process and that the counter has a random dead time. A resume is given of the renewal theoretic approach to particle counting problems and a shorter proof of Pyke's...

Topics: DTIC Archive, Gastwirth, Joseph L, COLUMBIA UNIV NEW YORK, *RADIATION MEASURING INSTRUMENTS,...

New classes of stochastic models for network systems having stochastically dependent components are studied by a combination of probabilistic analysis and efficient simulation techniques. For instance, in a model in which shocks of r different types occur, with component i failing when there have been a total of n(i) type i shocks, we give a method for studying the distribution of the the number of shocks needed to cause the system to fail.

Topics: DTIC Archive, UNIVERSITY OF SOUTHERN CALIFORNIA LOS ANGELES, *OPTIMIZATION, *STOCHASTIC PROCESSES,...

We study the resequencing delay caused by multi-path routing. We use a queueing model which consists of parallel queues to model the network routing behavior. We define a new metric, denoted by gamma, to study the impact of resequencing on the customer end-to-end delay. Our results characterize some properties of gamma with respect to different service time distributions. In particular, the resequencing delay can be negligible when the delay along each path is light-tailed, but can be of major...

Topics: DTIC Archive, Han, Yijie, MARYLAND UNIV COLLEGE PARK INST FOR SYSTEMS RESEARCH, *QUEUEING THEORY,...

The era of obtaining increased performance via faster single cores and optimized single-thread programs is over. Instead, a major factor in new processors' performance comes from parallelism: increasing numbers of cores per processor and threads per core. At the same time, highly parallel GPU cores, initially developed for shading are increasingly being adopted to offload and augment conventional CPUs, and vendors are already discussing chips that combine CPU and GPU cores. These trends are...

Topics: DTIC Archive, STANFORD UNIV CA, *COMPUTER GRAPHICS, *PARALLEL PROCESSING, *COMPUTER PROGRAMMING,...

A random sum formula is derived for the forward recurrence time associated with the busy period length of the M/G/perp endicular queue. This result is then used to (i) provide a necessary and suffcient condition for the subexponentiality of this forward recurrence time, and (ii) establish a stochastic comparison in the convex increasing (variability) ordering between the busy periods in two M/G/perp endicular queues with service times comparable in the convex increasing ordering.

Topics: DTIC Archive, Makowski, Armand M, ARMY RESEARCH LAB ADELPHI MD, *STOCHASTIC PROCESSES, *QUEUEING...

In this paper the following queueing system is investigated: A single server facility operates on a First Come First Served (FCFS) basis with Poisson arrivals and exponential service distribution. An arriving customer may either join the end of the queue or he may chose to balk at no cost. It is assumed that a customer who balks never returns to the system. Customers are risk neutral, have identical cost per unit of service and waiting time, and receive a given identical benefit at the instant...

Topics: DTIC Archive, Hassin,Rafael, STANFORD UNIV CA CENTER FOR RESEARCH ON ORGANIZATIONAL EFFICIENCY,...

The project was concerned with dynamics in telecommunication networks, with principal focus on peer-to-peer dissemination systems. A first line of work was to develop the theory for a fluid-PDE model for content evolution in peer-to-peer networks. We rigorously proved its mathematical relationship with queueing systems. We also included heterogeneity in the model for peer access bandwidth. The PDE dynamics was analyzed comprehensively froma control-theoretic perspective. A second line of...

Topics: DTIC Archive, URUGUAY UNIVERSIDADE ORT MONTEVIDO, *CLOUD COMPUTING, *COMPUTER NETWORKS, BROADBAND,...

The expected wait in the Gl/G/1 queue is related to the mean and variance of the idle time. For arrival distributions which are IFR or have man residual life bounded by 1/lambda, simple bounds are obtained which give, for example, the expected number in queue to within at most one customer. By equating input with output, relations between random variables are used to obtain expressions for the moments of the waiting time in terms of moments of the inter-arrival, service, and idle time...

Topics: DTIC Archive, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *INEQUALITIES, *QUEUEING THEORY,...

Researchers have made substantial progress in the decomposition of large-scale nonlinear problems for accelerated convergence. A Newton method for nonsmooth equations has been developed and conditions for its convergence determined. The original proposal suggested work in the general area of large-scale optimization: in particular, methods for decomposition based on the so-called Bundle method, decomposition of large-scale nonlinear problems, including parameter optimization in networks of...

Topics: DTIC Archive, Papadopoulos, Gregory M, WISCONSIN UNIV-MADISON, *NONLINEAR ANALYSIS, *OPTIMIZATION,...

This paper considers an M/G/K queueing model having finite capacity N. That is, a model in which customers, arriving in accordance with a Poisson process having rate lambda, enter the system if there are less than N others present when they arrive, and are then serviced by one of k servers, each of whom has service distribution G. Upon entering, a customer will either immediately enter service if at least one server is free or else join the queue if all servers are busy. Our results will be...

Topics: DTIC Archive, Nozaki, Shirley A, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *QUEUEING...

Consider an N server queuing system in which service times of server i are exponentially distributed random variables with rate lambda sub i. Customers arrive in accordance with some arbitrary arrival process. If a customer arrives when all servers are busy, then he is lost to the system; otherwise, he is assigned to one of the free servers according to some policy. Once a customer is assigned to a server he remains in that status until service is completed. We show that the policy that always...

Topics: DTIC Archive, Derman,Cyrus, CALIFORNIA UNIV BERKELEY OPERATIONS RESEARCH CENTER, *OPTIMIZATION,...

This document investigates efficient implementations of Dijkstra's shortest path algorithm. The authors propose a new data structure, called the redistributive heap, for use in this algorithm. On a network with n vertices, m edges, and nonnegative integer arc costs bounded by C, a one-level form of redistributive heap give a time bound of Dijkstra's algorithm of O(m + n log C). A two-level form of redistributive heap give a bound of O(m + n log C / log log C). A combination of a redistributive...

Topics: DTIC Archive, Ahuja, Ravindra K, PRINCETON UNIV NJ DEPT OF COMPUTER SCIENCE, *ALGORITHMS, *PATHS,...

A simple queueing model of busy airport departure operations is proposed. This model is calibrated and validated using available runway configuration and traffic data. The model is then used to evaluate preliminary control schemes aimed at alleviating departure traffic congestion on the airport surface. The potential impact of these control strategies on direct operating costs, environmental costs and overall delay is quantified and discussed.

Topics: NASA Technical Reports Server (NTRS), OPERATING COSTS, AIRPORTS, RUNWAYS, CONGESTION, QUEUEING...