bluuebunny/crossref_metadata_2025_split huggingface dataset:
Refined prediction for linear regression models
Authors: Hess J. L. , Gunst R. F. 
Published: May 2007

AbstractAdequate prediction of a response variable using a multiple linear regression model is shown in this article to be related to the presence of multicollinearities among the predictor variables. If strong multicollinearities are present in the data, this information can be used to determine when prediction is likely to be accurate. A region of prediction,R, is proposed as a guide for prediction purposes. This region is related to a prediction interval when the matrix of predictor variables is of full column rank, but it can also be used when the sample is undersized. The Gorman‐Toman ten‐variable data is used to illustrate the effectiveness of the regionR.
A note on the stochastic shortest‐route problem
Authors: Croucher John S. 
Published: May 2007

AbstractThis paper develops an algorithm for a “shortest route” network problem in which it is desired to find the path which yields the shortest expected distance through the network. It is assumed that if a particular arc is chosen, then there is a finite probability that an adjacent arc will be traversed instead. Backward induction is used and appropriate recursion formulae are developed. A numerical example is provided.
Survey of approaches to readiness
Authors: Barzily Zeev , Marlow W. H. , Zacks S. 
Published: May 2007

AbstractAbout thirty references that feature naval logistics environments are considered. All are unclassified and all appear in the open literature or are available from the Defense Logistics Studies Information Exchange. Three approaches are identified–data analysis, theoretical models, and readiness indexes–and conclusions are presented as to possibilities for answering two questions: (a) Can the unit do the job? (b) How does readiness depend on resources? Four cases are treated in detail to illustrate methodology.
Computational results with a branch‐and‐bound algorithm for the general knapsack problem
Authors: Bulfin R. L. , Parker R. G. , Shetty C. M. 
Published: May 2007

AbstractIn this paper, a branch‐and‐bound procedure is presented for treating the general knapsack problem. The fundamental notion of the procedure involves a variation of traditional branching strategies as well as the incorporation of penalties in order to improve bounds. Substantial computational experience has been obtained, the results of which would indicate the feasibility of the procedure for problems of large size.
Multiproduct lot‐size scheduling with proportional product demands
Authors: Murphy F. H. , Soyster A. L. 
Published: May 2007

AbstractIn this paper we consider the multiproduct, multiperiod production‐scheduling model of Manne under the assumption that, across products, demands are interrelated over time. When demand requirements are proportional we show that the solution has a specific structure determined by the ratio of setup to production‐run time of each product. This structure holds for any length horizon and may permit a substantial (time) savings for column generation solution procedures.
An exact branch‐and‐bound procedure for the quadratic‐assignment problem
Authors: Bazaraa M. S. , Elshafei A. N. 
Published: May 2007

AbstractThe quadratic‐assignment problem is a difficult combinatorial problem which still remains unsolved. In this study, an exact branch‐and‐bound procedure, which is able to produce optimal solutions for problems with twelve facilities or less, is developed. The method incorporates the concept of stepped fathoming to reduce the effort expended in searching the decision trees. Computational experience with the procedure is presented.
Coordinated replenishments of items under time‐varying demand: Dynamic programming formulation
Authors: Silver Edward A 
Published: May 2007

AbstractWe consider a group (or family) of items having deterministic, but time‐varying, demand patterns. The group is defined by a setup‐cost structure that makes coordination attractive (a major setup cost for each group replenishment regardless of how many of the items are involved). The problem is to determine the timing and sizes of the replenishments of all of the items so as to satisfy the demand out to a given horizon in a cost‐minimizing fashion. A dynamic programming formulation is illustrated for the case of a two‐item family. It is demonstrated that the dynamic programming approach is computationally reasonable, in an operational sense, only for small family sizes. For large families heuristic solution methods appear necessary.
A note on duality in homogeneous fractional programming
Authors: Craven B. D. , Mond B. 
Published: May 2007

AbstractFor a linear fractional programming problem, Sharma and Swarup have constructed a dual problem, also a linear fractional program, in which the objective functions of both primal and dual problems are the same. Craven and Mond have extended this result to a nonlinear fractional programming problem with linear constraints, and a dual problem for which the objective function is the same as that of the primal. This theorem is now further extended from linear to differentiable convex constraints.
A methodology for studying the dynamics of extended logistic systems
Authors: Graves Stephen C. , Keilson Julian 
Published: May 2007

AbstractAn extended logistic system is a well‐defined configuration of equipment, modules, inventories, and repair and replacement facilities modeling a complex, repairable system with on‐going repair. The design of such systems has been based largely on the static tools of inventory theory and reliability theory, i.e., on steady‐state distributions and on associated means and variances. Such static tools suppress the scale of real lime and ignore system persistence time in up‐states and persistence time in down‐states.A reasonably simple dynamic methodology is presented, focusing on system failure time as a more meaningful objective function for system‐design tradeoff studies. In the presence of good reliability, it is shown that different candidates for system failure time effectively merge to yield an unambiguous, single system failure time. Examples illustrating the importance of dynamic information for system design are given.
A three‐echelon, multi‐item model for recoverable items
Authors: Muckstadt J. A. 
Published: May 2007

AbstractThe main objective of this paper is to develop a mathematical model for a particular type of three‐echelon inventory system. The proposed model is being used by the Air Force to evaluate inventory investment requirements for alternative logistic structures. The system we will model consists of a group of locations, called bases, and a central depot. The items of concern in our analysis are called recoverable items, that is, items that can be repaired when they fail. Furthermore, each item has a modular or hierarchical design. Briefly, the model is used to determine the stock levels at each location for each item so as to achieve optimum inventory‐system performance for a given level of investment. An algorithm for the computation of stock levels for each item and location is developed and illustrated. Some of the ways the model can be used are illustrated with Air Force data.
Some bayes tests and their asymptotic properties for the multivariate, multisample goodness‐of‐fit problem
Authors: Ramani K. V. 
Published: May 2007

AbstractIndependent samples are taken from C multivariate populations with continuous but unknown cumulative distribution function c.d.f.). The problem is to test the hypothesis that the C population c.d.f's are identical to a specified c.d.f. We approach this problem by first transforming the data so that the hypothesis being tested is that the common distribution is uniform over a unit hypercube. We then construct some Bayes tests and investigate their asymptotic properties. These tests are based on the asymptotic normality of the number of observations falling in the “asymptotically sufficient groupings”.
Multiple‐attribute decision making with partial information: The expected‐value criterion
Authors: Charnetski Johnnie R. , Soland Richard M. 
Published: May 2007

AbstractWe consider the multiple‐attribute decision problem with finite action set and additive utility function. We suppose that the decision maker cannot specify nonnegative weights for the various attributes which would resolve the problem, but that he/she supplies ordinal information about these weights which can be translated into a set of linear constraints restricting their values. A bounded polytope W of feasible weight vectors is thus determined. Supposing that each element of W has the same chance of being the “appropriate one,” we compute the expected utility value of each action. The computation method uses a combination of numerical integration and Monte Carlo simulation and is equivalent to finding the center of mass of the bounded polytope W. Comparisons are made with another criterion already presented, the comparative hyper‐volume criterion, and two small examples are presented.
A capacity‐expansion model for two facility types
Authors: Luss Hanan 
Published: May 2007

AbstractThis paper describes a deterministic capacity‐expansion model for two facility types with a finite number of discrete time periods. Capacity expansions are initialed either by new construction or by the conversion of idle capacity from one facility type to the other. Once converted, the capacity becomes an integral part of the new facility type. The costs incurred include construction, conversion, and holding costs. All cost functions are assumed to be nondecreasing and concave. Using a network flow approach, the paper develops an efficient dynamic‐programming algorithm to minimize the total costs when the demands for additional capacity are nonnegative in each period. Thereafter, the algorithm is extended for arbitrary demands. The model is applied to a cable‐sizing problem that occurs in communication networks, and numerical examples are discussed.
Distribution of sample correlation coefficients
Authors: Alam Khursheed 
Published: May 2007

AbstractLet (Y, Xl,…, XK) be a random vector distributed according to a multivariate normal distribution where Xl,…, XK are considered as predictor variables and y is the predictand. Let ri, and Ri denote the population and sample correlation coefficients, respectively, between Y and Xi. The population correlation coefficient ri is a measure of the predictive power of Xi. The author has derived the joint distribution of Rl,…, RK and its asymptotic property. The given result is useful in the problem of selecting the most important predictor variable corresponding to the largest absolute value of ri.
A new analysis of a lot‐size model with partial backlogging
Authors: Rosenberg David 
Published: May 2007

AbstractWe reformulate the cost equation for the lot‐size model with partial back‐logging. The formulation is in terms of “fictitious demand rate,” a new inventory decision variable that simplifies the analysis. Using decomposition by projection, we obtain an optimal solution in a straightforward manner. The form of the solution sheds additional light on the behavior of the model. Some of these insights are elucidated by numerical examples.
Optimal betting strategies for favorable games
Authors: Subelman Eduardo J. 
Published: May 2007

AbstractWe examine the problem of a gambler interested in maximizing the expected value of a convex utility function of his fortune after n plays of a game. We allow any probability distribution to rule the outcome of each play, and this distribution may change from play to play according to a Markov process. We present results regarding the existence of an optimal policy and its structural dependence on the gambler's fortune. The well‐known results of Bellman and Kalaba for exponential and logarithmic utility functions and coin‐tossing games are generalized. We also examine the situation of general stale spaces and show that the same structural results hold.
Geometry of the total time on test transform
Authors: Barlow Richard E. 
Published: May 2007

AbstractTotal time on test (TTT) plots provide a useful graphical method for tentative identification of failure distribution models. Identification is based on properties of the TTT transform. New properties of the TTT transform distribution are obtained. These results are useful to the user of TTT plots. Although IFR (DFR) distributions are particularly easy to identify from TTT plots, the user must exercise caution relative to identification of IFR A (DFRA) distributions.
Simulation of nonhomogeneous poisson processes by thinning
Authors: Lewis P. A. W , Shedler G. S. 
Published: May 2007

AbstractA simple and relatively efficient method for simulating one‐dimensional and two‐dimensional nonhomogeneous Poisson processes is presented The method is applicable for any rate function and is based on controlled deletion of points in a Poisson process whose rate function dominates the given rate function In its simplest implementation, the method obviates the need for numerical integration of the rate function, for ordering of points, and for generation of Poisson variates.
Bounds on optimal cost for a replacement problem with partial observations
Authors: White Chelsea C. 
Published: May 2007

AbstractThis paper characterizes the structure of optimal strategies for a replacement problem for two special cases of observation quality. It is shown that when the state of the system is either completely observed or completely unobserved at every decision epoch by the controller, reasonable assumptions are sufficient for the existence of optimal replacement strategies composed of policies having a generalized, control‐limit form. These structural results are of particular interest since the optimal cost functions for the two special cases represent bounds on the optimal cost function for the general partially observed case, significant computational simplification can result for the two special cases due to their optimal strategy structure, and optimal strategies possessing a control‐limit structure do not necessarily exist for the general partially observed case.
Survival distributions in crossing fields containing clusters of mines with possible detection and uncertain activation or kill
Authors: Zacks S. 
Published: May 2007

AbstractThe present paper presents an algorithm for the exact determination of survival distributions in crossing mine fields. The model under consideration considers clusters of mines, scattered at random in the field around specified aim points. The scatter distributions of the various clusters are assumed to be known The encounter process allows for a possible detection and destruction of the mines, for inactivation of the mines and for the possibility that an activated mine will not destroy the object. Recursive formulae for the determination of the survival probabilities of each object (tank) in a column of n crossing at the same path are given. The distribution of the number of survivors out of n objects in a column is also determined. Numerical examples are given.
Design of a process control scheme for defects per 100 units based on aoql
Authors: Leavenworth Richard S. , Scheaffer Richard L. 
Published: May 2007

AbstractA process control scheme is developed in which decisions as to the frequency of sampling are made based upon the choice of an Average Outgoing Quality Limit. The scheme utilizes plotted points on a U‐control chart for defects and the theory of runs to determine when to switch among Reduced, Normal, Tightened, and 100 percent inspection. The scheme is formulated as a semi‐Markov process to derive steady stale equations for the probabilities of being in Reduced, Normal, Tightened, or 100 percent inspection and for Average Outgoing Quality and Average Fraction Inspected. The resulting system and the computer programs used to derive it are discussed.
A single server queue with arrival rate dependent on server breakdowns
Authors: Shogan Andrew W. 
Published: May 2007

AbstractThis paper considers a single server queueing system that alternates stochastically between two states: operational and failed. When operational, the system functions as anM/Ek/1 queue. When the system is failed, no service takes place but customers continue to arrive according to a Poisson process; however, the arrival rate is different from that when the system is operational. The durations of the operating and failed periods are exponential with mean 1/cβ and Erlang with mean 1/cβ, respectively. Generating functions are used to derive the steady‐state quantitiesLandW, both of which, when viewed as functions ofc, decrease at a rate inversely proportional to c2. The paper includes an analysis of several special and extreme cases and an application to a production‐storage system.
Statistical tests for exponential service from m/g/1 waiting‐time data
Authors: Thiagarajan T. R. , Harris Carl M. 
Published: May 2007

AbstractFrom an original motivation in quantitative inventory modeling, we develop methods for testing the hypothesis that the service times of an M/G/1 queue are exponentially distributed, given a sequence of observations of customer line and/or system waits. The approaches are mostly extensions of the well‐known exponential goodness‐of‐fit test popularized by Gnedenko, which results from the observation that the sum of a random exponential sample is Erlang distributed and thus that the quotient of two independent exponential sample means is F distributed.
Analyzing availability using transfer function models and cross spectral analysis
Authors: Singpurwalla Nozer D. 
Published: May 2007

AbstractIf we look at the literature of reliability and life testing we do not see much on the use of the powerful methods of time series analysis. In this paper we show how the methods of multivariate time series analysis can be used in a novel way to investigate the interrelationships between a series of operating (running) times and a series of maintenance (down) times of a complex system. Specifically, we apply the techniques of cross spectral analysis to help us obtain a Box‐Jenkins type transfer function model for the running times and the down times of a nuclear reactor. A knowledge of the interrelationships between the running times and the down times is useful for an evaluation of maintenance policies, for replacement policy decisions, and for evaluating the availability and the readiness of complex systems.
Optimal admission pricing policies for M/Ek/1 queues
Authors: Anderson Michael Q. 
Published: May 2007

AbstractThis paper extends the Low‐Lippman M/M/1 model to the case of Gamma service times. Specifically, we have a queue in which arrivals are Poisson, service time is Gamma‐distributed, and the arrival rate to the system is subject to setting an admission fee p. The arrival rate λ(p) is non‐increasing in p. We prove that the optimal admission fee p* is a non‐decreasing function of the customer work load on the server. The proof is for an infinite capacity queue and holds for the infinite horizon continuous time Markov decision process. In the special case of exponential service time, we extend the Low‐Lippman model to include a state‐dependent service rate and service cost structure (for finite or infinite time horizon and queue capacity). Relatively recent dynamic programming techniques are employed throughout the paper. Due to the large class of functions represented by the Gamma family, the extension is of interest and utility.
Theoretical analysis of lanchester‐type combat between two homogeneous forces with supporting fires
Authors: Taylor James G. 
Published: May 2007

AbstractThis paper studies combat between two homogeneous forces modelled with variable‐coefficient Lanchester‐type equations of modern warfare with supporting fires not subject to attrition. It shows that this linear differential‐equation model for combat with supporting fires may be transformed into one without the supporting fires so that all the previous results for variable‐coefficient Lanchester‐type equations of modern warfare (without supporting fires) may be invoked. Consequently, new important results for representing the solution (i.e. force levels as functions of time) in terms of canonical Lanchester functions and also for predicting force annihilation are developed for this model with supporting fires. Important insights into the dynamics of combat between two homogeneous forces with such supporting fires are discussed.
On single‐machine sequencing with order constraints
Authors: Glazebrook K. D. 
Published: May 2007

AbstractA collection of jobs is to be processed by a single machine. Each job has a cost function associated with it which may be either linear or exponential, costs accruing when a job is completed. The machine may be allocated to the jobs according to a precedence relation. The problem is to find a strategy for allocating the machine which minimizes the total cost and which is consistent with the precedence relation. The paper extends and simplifies some previous work done by Sidney.
Computational experience on an algorithm for the transportation problem with nonlinear objective functions
Authors: Rao Ram C. , Shaftel Timothy L. 
Published: May 2007

AbstractThis paper explores computational implications of allowing nonlinear objective functions in the transportation problem. Two types of nonlinearities, including polynomials, are studied. The choice of these functions resulted from our interest in models of integrated water management. Zangwill's convex simplex method and the primal method of transportation problem form the basis of our algorithm. Innovative features of our work are compact storage and efficient computation procedures. We study the effects on computation time of problem size; the density of nonlinear terms; the size of tolerances for stopping rules; and rules for choice of new variables to enter the solution. We find that problems up to 95 × 95 in size are capable of reasonably fast solution. A particularly surprising finding is that one‐dimensional search for improving solutions performs adequately, at least for the kinds of problems posed in this paper. We are encouraged by our results and believe that models involving nonlinear objective functions may be tractable even for relatively large problems, thus making possible more accurate descriptions of real situations.
Statistical analysis of a conventional fuze timer
Authors: Cohen Edgar A. 
Published: May 2007

AbstractIn this paper, a statistical analytic model for evaluation of the performance of a standard electric bomb fuze timer is presented. The model is based on what is called a selective design assembly, where one item, namely, a resistor, is used to time the circuit. In such an assembly, the remaining components are chosen a priori from predetermined distributions. Based on the analysis, a general numerical integration scheme is utilized for assessing performance of the timer. The results of a computer simulation are also given. In the last section of the paper, a theory for evaluation of the yield of two or more timers designed to operate in sequence is derived. To appraise such a scheme, a numerical quadrature routine is developed.
The asymptotic sufficiency of sparse order statistics in tests of fit with nuisance parameters
Authors: Weiss Lionel 
Published: May 2007

AbstractIn an earlier paper, it was shown that for the problem of testing that a sample comes from a completely specified distribution, a relatively small number of order statistics is asymptotically sufficient, and for all asymptotic probability calculations the joint distribution of these order statistics can be assumed to be normal. In the present paper, these results are extended to certain cases where the problem is to test the hypothesis that a sample comes from a distribution which is a member of a specified parametric family of distributions, with the parameters unspecified.