bluuebunny/crossref_metadata_2025_split huggingface dataset:
A comparison of queue disciplines when service orientation times occur
Authors: Gaver D. P. 
Published: May 2007

AbstractA single manufacturing facility (server) is confronted with stationary Poisson demands. Each demand belongs to one of two classes, A or B. Manufacturing (service) times are independently and arbitrarily distributed random variables. In addition, orientation times are required when a switch is made from A customers to B customers.Two disciplines describing the order of service are discussed: “first‐come, first‐served,” and a preemptive priority procedure. Long‐run delays for the “first‐come, first‐served” disciplines are given. It is shown that, when orientation times occur, “first‐come, first‐served” may cause the system to saturate for smaller total demand rate than will a priority discipline that economizes on orientations.
A model for determining protection levels for equipment classes within a set of subsystems
Authors: Sracken Jerome , Varley Thomas C. 
Published: May 2007

AbstractGiven a system of the structure assumed, or which has been transformed into the structure assumed, we present a model which generates alternative sets of protection levels for equipment classes to satisfy specified subsystem protection levels. The calculation of alternatives is algorithmic or canonical once the system has been represented by the model. Procedures are also given for generating further alternatives from those computed.
Analytical study of a complex system having two types of components
Authors: Garg R. C. 
Published: May 2007

AbstractIn this paper, a complex system having two types of components is examined with regard to dependability [1]. The probabilities that the system is operating under normal efficiency, reduced efficiency, and is in the failed state have been obtained. Some particular cases are also deduced in the body of the paper. In the end, the behavior of the complex system under steady‐state has been examined and from this, the behavior of a system having one component of each class has been derived.
Search theory: A sequential approach
Authors: Dobbie James M. 
Published: May 2007

AbstractKoopman and others have noted that the optimal distribution of effort, to maximize the detection probability with a given effort, has the property that it is the sum of the distributions obtained by optimizing conditionally when the effort is applied sequentially. The approach taken in this present investigation is to reverse the procedure by determining conditions under which the optimal distribution has this property, and then to use this property to find the optimal distribution. This method easily yields essentially all of the known results, both for the discrete and continuous cases, and for the two criteria of maximizing the detection probability with a given effort and minimizing the expected effort to attain a given attainable probability of detection. The method also yields some modest extensions. In the discrete case the method is equivalent to the simplest form of dynamic programming.
Surveillance problems: Poisson models with noise
Authors: Savage I. Richard 
Published: May 2007

AbstractThe basic model starts with three stochastic processes satisfying y(t) = x(t) + z(t). Observations are made on the y‐process from which inferences are made about the production process, x(t). The z‐process constitutes noise. For each unit of time that x(t) = x the income is i(x). The producer, at a cost in both time and money, can repair the y‐process, i.e., bring its value back to zero. Continuous surveillance at no cost and intermittent surveillance with a fixed cost for each observation are considered, When the x‐ and z‐processes are independent Poisson processes, it is shown that the strategies which maximize the average income per unit of time depend only on the last observed value of the y‐process. Production is continued until the y‐process exceeds a specified integer which depends on the economic parameters. When i(x) is nonincreasing and costly inspections are being made, the time between inspections decreases as a function of the last observed value of the y‐process. The model is a generalization of the model used in Ref. [3]See References, page 13.
.
Some transportation problems and techniques for solving them
Authors: Holladay J. 
Published: May 2007

AbstractThis article describes some transportation problems and presents algorithms for solving them. Except for the brief review of Network Flow Theory, which is used in developing the algorithm for the Fixed Resources‐Maximum Job Scheduling Problem, these are all scheduling problems.The Fixed Job–Minimum Resources Scheduling Problem presents a finite set of jobs, called sorties, to be done at given fixed times. The problem is to find, for vehicles of a given type, a schedule of greatest merit. One of the objectives involved in the definition of the merit function is that of minimizing the number of vehicles used.The Fixed Resources–Maximum Job Scheduling Problem is similar to the Fixed Job–Minimum Resources Scheduling Problem except that only a certain maximum number of vehicles maybe used, and the objective of minimizing the number of vehicles is replaced by the objective of maximizing the amount of work done. Also, in this section, it is shown that problems possessing certain symmetries are equivalent to simpler ones.The Slack Time–Fixed Job Scheduling Problem is somewhat analogous to the Fixed Job–Minimum Resources Scheduling Problem, and the Slack Time–Fixed Resources Scheduling Problem is somewhat analogous to the Fixed Resources, Maximum Job Scheduling Problem. The main difference is that instead of requiring that each sortie be performed at some given time, it is only required that it be performed within some given interval of time.The Slack Time–Fixed Job Scheduling and–Fixed Resources Scheduling Problems are more difficult to solve than the Fixed Job–Minimum Resources Scheduling and the Fixed Resources–Maximum Job Scheduling Problems. So in the Slack Time–Fixed Job Scheduling Problem a simplifying assumption is made concerning the times that it would take vehicles to return from destination points of sorties to the starting points of others. The method of solution presented for the Slack Time–Fixed Resources Scheduling Problem does not guarantee optimum solutions, but, it is hoped, good solutions. For a certain type of shuttling problem, it is proven that it does produce an optimum solution.
Cycling in the transportation problem
Authors: Gassner Betty Jane 
Published: May 2007

AbstractThe assignment problem, which is the most degenerate form of the transportation problem, and therefore the most likely to cycle, is investigated by means of linear graphs. It is proved that cycling is impossible in the 3 × 3 case, but possible in the 4 × 4 case. For the 5 × 5 case, it is shown both that there is a cycle independent of the one found for the 4 × 4 case and also that the cycle found in the 4 × 4 case can exist in the 5 × 5 case. Numerical examples are given.
A computational note on von Neumann's algorithm for determining optimal strategy
Authors: Hershkowitz Martin 
Published: May 2007

AbstractThis article is concerned with von Neumann's algorithm for solving a matrix game. Some of the numerical comparisons, made between this algorithm and three others from the literature, have been abstracted for discussion. In general, the performance of von Neumann's algorithm is inferior to other methods for solving matrix games; Dantzig's Simplex Method converges in fewer iterations; and Brown's Fictitious Play requires a much simpler arithmetic process and fewer iterations for a similar convergence.
A game over spaces of probability distributions
Authors: Danskin John M. 
Published: May 2007

AbstractThis paper analyzes a two person zero‐sum game in which the strategies on the two sides are probability distributions. The solutions always turn out to contain jumps. In most cases the distributions are combinations of delta functions and density functions.The problem is as follows: a submarine chooses a range r, within a declared war zone, at which to fire his missile. If he is detected at a larger range he attempts to fire at that larger range with the effectiveness at that range decreased by defense measures such as attempts to kill the submarine, shoot down the missile, or protect the target. If this defense effectiveness is denoted by ω, with ω = 0 referring to perfect defensive reaction measures, and ω = 1 referring to poor defensive reaction measures, the following is true. If ω = 0, the problem is analogous to a problem (“The Two Machine‐gun Duel”) solved by L. Gillman and the author in 1949 (Ref. 2) and is not difficult. The defenses in this case are in close to the coast. If ω = 1 the problem is different but not difficult and the defenses are well out towards (and in some cases at) maximum missile range. There are for ω = 1 no defenses near the coast; this is referred to as an “initial gap.”.The first problem that arises is to find for what values of ω is there an “initial gap.” A necessary and sufficient condition for such gaps was found. For general ω there may be instead an “interior gap,” i.e., defense contiguous to the coast and out near or at maximum missile range, but none at intermediate ranges. Necessary and sufficient conditions for such interior gaps were found. In a typical case the solution for the defense follows one function out to a certain target, then is zero, then follows another function to maximum missile range, then has a delta function at maximum missile range.It was necessary to study in detail the behavior of expressions involving discontinuous functions by breaking into continuous parts and discontinuous parts. A great deal of the complexity of the paper arises from this fact. A second cause is that it is essential to admit completely arbitrary distribution functions on the two sides as strategies. There is no a priori reason for instance, why the attacking player could not choose his plays from the Cantor distribution, a function increasing on (0, 1) from 0 to 1, but having almost everywhere a zero derivative. These possibilities emphasize the need for great care in the analysis and for the somewhat tedious existence proof of a later section of this paper.
The Polaris military essentiality system
Authors: Denicoff M. , Fennell J. , Haber S. E. , Marlow W. H. , Segel F. W. , Solomon Henry 
Published: May 2007

AbstractOne of the major requirements for military systems has been the need for a measure of the relative importance of stocking one item rather than another. The present study develops one such system which has been implemented for the Polaris weapons system. Considerable emphasis is placed on systematic development of underlying principles. It is concluded that the present approach could readily be adapted to other weapons systems.
A Polaris logistics model
Authors: Denicoff M. , Fennell J. , Haber S. E. , Marlow W. H. , Solomon Henry 
Published: May 2007

AbstractThis paper presents a basic loss minimization model which has been applied in varying contexts for Polaris logistics problems. Definitive results are obtained in a general framework which extends the classic newsboy problem in two principal directions. First, probability distributions for demand are unrestricted. Second, a general framework for “penalties” or “premiums” is introduced to permit formulation of possibly non‐convex loss functions. The main result is a constructive existence theorem for minimum values of these general expected loss functions.
The distribution of rounds fired in stochastic duels
Authors: Ancker C. J. , Gafarian A. V. 
Published: May 2007

AbstractThis paper continues the development of the theory of stochastic duels to include the distribution of the number of rounds fired. This distribution is principally of interest in estimating stock levels and resupply requirements in appropriate combat situations. Most generally, the duel between two contestants who fire at each other with constant kill probabilities per round is considered. The time between rounds fired may be either a continuous random variable or it may be constant. These two cases are treated separately. The number of rounds available to each contestant at the beginning of the duel may be limited and is a discrete random variable. Besides the distribution of rounds fired, its first two moments and right tail are obtained. In addition to general results, special cases and specific examples are worked out.
Economical reorder quantities and reorder points with uncertain demand
Authors: Parker Lawrence L. 
Published: May 2007

AbstractThe problem of determining reorder quantities and reorder points that minimize the total costs of carrying inventory, placing orders, and penalties for back orders, in the face of uncertain demand, is considered in this paper. By making approximations to the total cost function and the safety factor versus service function relationship, an economic order quantity is derived that depends on the uncertainty in the foiecast of demand during the lead time, but is independent of the back order cost. Reorder points are then determined for the case in which the back order cost is explicitly stated, and for the case in which the back order cost is unknown and the desired customer service is used as the controlling parameter. Simulations indicate that, when compared with use of the Wilson economic order quantity, the use of the formulae derived in this paper will lead to approximately a 5‐7‐percent reduction in the total cost.
Note on A model for minimizing cost of aerial tankers support of a practice bomber mission
Authors: Bracken J. , Longhill J. D. 
Published: May 2007

AbstractUsing a typical example of a practice bomber penetration of the North American Air Defense Net, a hypothetical linear programming model for minimizing the cost of aerial tanker support is developed. Fuel requirements of the bombers, delivery capabilities of the aerial tankers, and various aspects of costs of refueling are considered.
A complete constructive algorithm for the general mixed linear programming problem
Authors: Graves Glenn W. 
Published: May 2007

AbstractAn algorithm that seems to have several advantages for application to the general mixed linear programming problem is described. Although it does not make any non‐degeneracy assumption or stipulate conditions for consistency of constraints or finiteness of extrenal value, it has the following distinct advantages: (1) it does away with all augmentation for any reason, in particular “artificial variables” for “initial feasible solutions” and the doubling of rows and columns for equations and variables of arbitrary sign; (2) it does not resort to any perturbation technique or arbitrary cycling of “basis” to cope with the “degeneracy problem,” but instead shows how to capitalize on it by concentrating on a greatly restricted subset of rows and columns; (3) it isolates and identifies inconsistent constraints in a simple, natural way; and (4) it features a small segregated inverse of a “basic kernel,” opening the way to easy generation of elements techniques with large sparse systems.
Utility functions of money for clear games
Authors: Peleg Bezalel 
Published: May 2007

AbstractIn this paper we discuss the question of clearness of K‐games for catalogues as defined by Jentzsch in Ref. [4]. It is proved that when the coalition K has at least two members, a necessary and sufficient condition that all money games played by K will be clear is that the utility functions for money of the players of K are linear in money. In the proof we assume that the utility functions are concave.
Finding the inverse and connections of a type of large sparse matrix
Authors: Hershkowitz Martin , Noble Stedman B. 
Published: May 2007

AbstractMuch interest is being shown in methods for determining structure of matrices in order to simplify computation. This paper takes a slightly different approach, giving an algorithm that determines the structure of a matrix while inverting it. The algorithm applies to matrices with dominant diagonal or similar matrices that can be inverted using the C. Neumann series. This series is decomposed into terms which are products of connected coefficients: the procedure lends itself to an efficient method of truncation that obtains an approximation to the inverse matrix. While this algorithm might not be efficient for some matrices, it is quite efficient for the 430‐order Minkowski‐Leontief matrix upon which it was tested. Furthermore, the computation enumerates the connections in the matrix; hence the model can be “tested” by comparing the connections of the model with those known to exist in the underlying phenomena.
The minimal cost flow problem with convex costs
Authors: Menon V. V. 
Published: May 2007

AbstractA new characterization of the solution to the transshipment problem where the cost of transporting along each route is a convex function of the amount shipped, is presented. The method of proof, that of using network theoretic methods, is elementary. Notion of duality, or the Kuhn‐Tucker theorem, are not used, and a “Primal” algorithm to solve the problem is outlined.
A conservation law for a wide class of queueing disciplines
Authors: Kleinrock Leonard 
Published: May 2007

AbstractA large class of queueing disciplines is defined for Poisson arrival statistics. For this class, a Conservation Law is proven which constrains the allowed variation in the average waiting times. Specifically, defining ρp as the product of the average arrival rate and the average service time for customers from the pth priority group (where the priority system is any queue discipline included in the defined class) and Wp as their average waiting time (in queue), the Conservation Law states that Σ ρp Wp is invariant over the set of queue disciplines in the class.
Characteristic functions of stochastic integrals and reliability theory
Authors: Antelman Gordon , Savage I. Richard 
Published: May 2007

AbstractThis paper concerns reliability theoretic problems involving systems of n components subject to stochastic hazard rates with independent increments. General methods are given for finding the probabilities of service at specified times and the joint characteristic function of the system failure time and the component hazard rates at the time of failure. These methods involve evaluation of integrals of the formmagnified imagewhere u′ is an n‐component row vector, W(t) is an n by n matrix, and X(t) is an n‐component stochastic process with independent increments and X(0) = 0. Some illustrative applications to one component systems and multicomponents systems in series and in parallel are presented.
The distribution of the time‐duration of stochastic duels
Authors: Ancker C. J. , Gafarian A. V. 
Published: May 2007

AbstractThe Theory of Stochastic Duels is extended by considering the distribution of time‐to‐completion of the fundamental duel. The model has fixed kill probabilities and either random or fixed time between rounds fired. Time‐limitation is included. Special cases and examples are worked out. Clearly, the time‐duration of combat has both tactical and logistic implications for the decision‐maker.
Queues with batch poisson arrivals and hyper‐exponential service
Authors: Cupta S. K. , Goyal J. K. 
Published: May 2007

AbstractWe consider in this paper the queueing system in which the input is in batches of variable numbers following a Poisson distribution; queue discipline is “first come first served,” it being assumed that the batches are preordered for service purposes; and service time distribution is hyperexponential with n branches. The Laplace transform of the system size distribution is determined by applying the method of generating functions, devised by Bailey [1] . Some of the known results are derived as particular cases.
Time‐cost tradeoffs in uncertain empirical research projects
Authors: Scherer F. M. 
Published: May 2007

AbstractThis paper explores the relationship between research project cost and expected time to completion under various scheduling strategies; it assumes that many potential technical approaches to the research problem can be identified; and that each approach has a low but finite subjective probability of success. It is shown that under a variety of assumptions, expected time to project completion can be reduced, but that as a result expected project cost rises at an increasing rate. Some cases in which this convex time‐cost tradeoff relationship might not hold generally are identified. When the time‐cost tradeoff function is convex, the desirability of concurrent as opposed to series scheduling of approaches depends crucially upon the depth of the stream of benefits expected to be realized upon successful project completion. The deeper the benefit stream is, the more desirable concurrent scheduling is.
Toward a multi‐stage information conversion model of the research and development process
Authors: Brandenburg Richard G. , Stedry Andrew C. 
Published: May 2007

AbstractResearch and development activities in a business firm or government laboratory are portrayed as a multi‐stage information generation and conversion process. A “basic research” phase generates opportunities, in the form of findings in a set of scientific disciplines, which are available for subsequent exploitation. It is assumed that increments to information in a subject area are stochastic, proportional to the amount of knowledge which already exists in the area, and have values which are randomly distributed. An “exploratory development” phase is viewed as a process of selecting a subset of alternative research opportunities, improving each opportunity in the direction of its applications, estimating the value of the improved opportunity and using these estimates to choose the exploratory development results to be implemented in engineering development. The “engineering development” phase makes the value of exploratory results realizable without changing value or risk. Engineering development costs are assumed to increase as value increases. If exploratory development is not successful, additional costs in engineering development must be incurred to bring the design up to a minimum desirable level. The model is intended as a step toward formulating and analyzing problems in management planning and control of the several interrelated stages of the research and development process.
Minimizing reductions in readiness caused by time‐phased decreases in aircraft overhaul and repair activities
Authors: Bracken Jerome , Simmons Kendall W. 
Published: May 2007

AbstractThe Navy is often required to conduct personnel planning studies, A recent study on the assessment of effects of personnel reductions at the various aircraft Overhaul and Repair Activities (O & Rs) of the Bureau of Naval Weapons was carried out by one of the writers of the present paper. The methodology was systematic but relied on informal, judgmental decision procedures rather than on formal models incorporating optimization. Later study of the problem resulted in the approach described herein.The paper addresses this question: How can a personnel reduction in the Navy's aircraft O & Rs be distributed among activities with minimum reduction in readiness? A two‐stage procedure involving linear programming models is developed. Solutions involve either extensions of aircraft overhaul cycles or a combination of such extensions with reductions in aircraft inventories.