bluuebunny/crossref_metadata_2025 huggingface dataset:
Post‐spike excitability indicates changes in membrane potential of isolated C‐fibers
Authors: Moalem‐Taylor Gila , Lang Philip M. , Tracey David J. , Grafe Peter
Published: May 2007

Recording of action potentials from single unmyelinated nerve fibers by microneurography is an important tool to investigate peripheral neural functions in human neuropathies. However, the interpretation of microneurography recordings can be difficult because axonal membrane potential is not revealed by this method. We tested the hypothesis that the recovery cycle of excitability after a single action potential is correlated with changes in the axonal membrane potential. To this end, we used the threshold tracking technique to study how different chemical mediators, with known effects on the membrane potential, influence the post‐spike superexcitability of C‐fiber compound action potentials in isolated rat sural and vagus nerves. We found that: (1) some chemical mediators (e.g., adenosine 5′‐triphosphate) produce a reduction or loss of superexcitability together with increased axonal excitability, indicating membrane depolarization; (2) blockade of axonal hyperpolarization‐activated (Ih) currents produces an enhancement of superexcitability together with a decreased excitability, indicating membrane hyperpolarization; and (3) application of calcium produces an increase in membrane threshold without an alteration in superexcitability, indicating a non‐specific increase in surface charge and a change in the voltage‐dependent activation of sodium channels. In addition, we demonstrated that membrane depolarization and hyperpolarization induce opposite post‐spike latency shifts (changes in supernormality) in rat and human nerve segments. Thus, recordings of post‐spike excitability and shifts in latency are sensitive techniques for detection of various types of neuromodulation, which are correlated with changes in membrane potential of unmyelinated peripheral axons and may help to understand observations obtained by microneurography in peripheral human neuropathies. Muscle Nerve, 2007
Altered mRNA splicing of dystrophin in type 1 myotonic dystrophy
Authors: Nakamori Masayuki , Kimura Takashi , Fujimura Harutoshi , Takahashi Masanori P. , Sakoda Saburo
Published: May 2007

Myotonic dystrophy type1 (DM1) is a multisystemic disorder caused by a CTG repeat expansion in the DMPK gene. Aberrant mRNA splicing of several genes has been reported to contribute to some of the symptoms, including myotonia and insulin resistance, but the cause of muscle wasting is unknown. Dystrophin is a cytoskeletal protein that is required for structural stability and signaling at the sarcolemma and has several spliced isoforms. We investigated the alternative splicing of dystrophin in skeletal and cardiac muscle of DM1 patients by using reverse transcriptase–polymerase chain reaction and found that dystrophin isoforms lacking exon 71 or 78, which is suggested to encode an important region for protein binding and hydrophobicity, were significantly increased. We suggest that the aberrantly spliced dystrophin is responsible for the muscle wasting in DM1. Muscle Nerve, 2007
Late‐onset monomelic amyotrophy in a Caucasian woman
Authors: Patel Dharmesh R. , Knepper Laurie , Jones H. Royden
Published: May 2007

We describe a 53‐year‐old Caucasian woman with a 19‐year history of an evolving amyotrophy confined to her dominant right arm and hand. Although this atypical case of a late‐onset monomelic amyotrophy in some respects mimics Hirayama disease or O'Sullivan–McLeod syndrome, it does not conform precisely with either of those disorders. We compare this individual's difficulties and clinical temporal profile to other disorders considered in the differential diagnoses with regard to her evolving clinical setting. Muscle Nerve, 2007
Urodynamic and ultrasound characteristics of incontinence after radical hysterectomy
Authors: Axelsen Susanne Maigaard , Bek Karl Moeller , Petersen Lone Kjeld
Published: May 2007

Aims

To test whether symptoms of urinary incontinence after radical hysterectomy could be objectified with urodynamics and ultrasound.

Methods

This case‐control study comprised 100 women who underwent radical hysterectomy for cervical cancer without post‐operative radiotherapy. Fifty women reporting urinary incontinence were matched with 50 women reporting continence. All women were assessed with ultrasound of the bladder neck movements and urodynamics.

Results

No differences were found in ultrasound or urodynamic findings regarding mobility of the bladder neck, maximal detrusor pressure, post‐voiding residual urine, flow of urine, or bladder capacity. A significant reduction in urethral pressure at rest and at contraction among the incontinent women was, however, demonstrated. Among urge‐incontinent women, urethral pressure at rest was significantly lower than among continent and stress‐incontinent women, respectively. Stress‐incontinent women had significantly lower urethral pressure at contraction than did urge‐incontinent and continent women.

Conclusions

No differences in urodynamic or ultrasound findings were observed between the two groups, except for an overall difference in the intraurethral pressure. A decrease in the urethral pressure could contribute to the characterization of incontinence after radical hysterectomy, indicating that the urethral sphincter mechanism plays a role in the pathophysiology. In this study design, the mobility of the bladder neck did not play any role. Neurourol. Urodynam. 26:794–799, 2007. © 2007 Wiley‐Liss, Inc.
Novel biomarkers of bladder decompensation after partial bladder obstruction
Authors: Guven Ahmet , Kalorin Carmin , Onal Bulent , Whitbeck Catherine , Chichester Paul , Kogan Barry A. , Levin Robert M. , Mannikarottu Anita
Published: May 2007

Aims

Partial bladder outlet obstruction (PBOO) results in marked contractile, biochemical, and histological alterations in the bladder. Our aim was to determine the time course of progressive PBOO in the rabbit and to find parameters that marked the shift to decompensation.

Materials and Methods

Twenty‐four rabbits were subjected to 1, 2, 4, and 8 weeks of PBOO. Sham operated rabbits served as controls. At each time period, cystometry was performed and individual bladder strips were used for contractility studies. Full‐thickness sections of bladder body from each rabbit were fixed in formalin and used to determine the vascular density and nerve density. The balance of the bladder body was separated between muscle and mucosa and was analyzed for superoxide dismutase (SOD) and catalase (CAT) activities.

Results

Bladder weight increased progressively and all contractile responses were reduced significantly over the course of obstruction. Markedly increased bladder weight and very large bladder volumes indicated decompensation. Nerve density was marked decreased in decompensated bladders. Similarly, SOD activity in muscle decreased progressively and was markedly lower in decompensated bladders. Although CAT activity of the muscle increased after 2–4 weeks of obstruction, it decreased markedly in decompensated bladders.

Conclusion

This study shows that prolonged PBOO causes progressive deterioration in the rabbit bladder with decompensation after 8 weeks. Markedly decreased nerve density and severely reduced SOD and CAT activities are associated with the shift from compensated to decompensated function of the bladder. They may be excellent biomarkers of decompensation. Neurourol. Urodynam. 26:1036–1042, 2007. © 2007 Wiley‐Liss, Inc.
Spontaneous activity of mouse detrusor smooth muscle and the effects of the urothelium
Authors: Meng En , Young John S. , Brading Alison F.
Published: May 2007

Aims

To characterize the detrusor muscle of the mouse urinary bladder in order to understand more precisely spontaneous contractile behavior of this organ. This study examined the spontaneous electrical activity and Ca2+ dynamics of the detrusor smooth muscle and investigated the role of the urothelium.

Materials and Methods

Detrusor smooth muscle strips were isolated from mouse bladders. The urothelium was either kept intact or removed. Changes in membrane potential were recorded using sharp electrode intracellular recording. To image Ca2+ dynamics, tissue strips were exposed to 10 µM Oregon Green 488 BAPTA‐1 AM for 70 min, and then image series were acquired with a laser‐scanning confocal microscope.

Results

(1) Mouse detrusor smooth muscle cells (SMCs) generate nifedipine‐sensitive spontaneous action potentials (sAPs) at a low frequency (1.3 ± 0.9 min−1, n = 11) in preparations with intact urothelium. This frequency increased when the urothelium was removed (7 ± 8.3 min−1, n = 17) (P < 0.05, Student's t test). (2) Frequent ATP‐mediated spontaneous depolarizations were recorded in all cells. (3) The frequency of whole cell Ca2+ flashes of detrusor smooth muscle cells was higher in preparations with the urothelium removed (median 1.2 min−1, n = 7) than in urothelium denuded preparations (median 0.6 min−1, n = 7) (P < 0.01, Mann–Whitney U‐test).

Conclusions

Spontaneous activity of the mouse detrusor smooth muscles was characterized enabling future comparative work on gene knock‐out strains. Evidence suggesting release of an inhibitory factor by the urothelium was apparent. Neurourol. Urodynam. © 2007 Wiley‐Liss, Inc.
Some problems in queueing with dynamic priorities
Authors: Jackson James R.
Published: May 2007

This paper presents some mathematical and numerical results concerning certain one‐machine discrete‐time queueing models, subject to various queue disciplines. Interest is focused upon systems in which service order is governed by “dynamic priorities,” under which a customer's relative priority is in effect upgraded with the passage of waiting time, so that the proportion of newcomers who can “step in front of him” becomes smaller and smaller as he waits.
Linearity of unrestrictedly transferable utilities
Authors: Aumann Robert J.
Published: May 2007

It is proved that for games with at least three players the assumption of unrestrictedly transferable utilities is equivalent to the assumption that the individual players' utilities are linear in money. This is not the case for two‐person games.
Research for command logistics
Authors: Scofield E. K.
Published: May 2007

A review of the control responsibilities of a typical unified commander emphasizing logistic aspects. These responsibilities will be related to tasks, missions, employment of forces, and structure of the command organization. An indication will be made of what further progress is required. particularly wherein operations analysis and research methods can be applied. The suggested use of such means will include applications for improving normal staff and command functioning as well as hardware and facility development. The development and use of operations centers and direction systems will be included.
Changing output‐input relations within the national economic accounts
Authors: Kendrick John W.
Published: May 2007

The national economic accounts provide the framework for a comprehensive numerical description of the economy. The most significant work of this decade in U. S. national accounting will be the integration of the related informational systems that have been developed in the past decade into the basic income and product accounts. This paper discusses one of the related bodies of estimates — real factor cost (input) and product (net output) by industry—developed by the author. These estimates are a link between the national production account and the interindustry matrix.

There is wide dispersion among industries and variability over a time period, in the rates of change of output in relation to the factor inputs, singly and in combination. But in almost all industries and over most decadal periods in this century, total factor productivity has risen. Capital has grown faster than labor input, but savings in capital as well as in labor have been recorded in most industries. There also have been substantial savings in purchased materials in many sectors, but in agriculture, purchased products have risen significantly faster than gross output. There are interesting systematic relationships among the several major “partial” productivity ratios.

Logistics and general economic or business forecasting and planning must allow for changing input‐output relations, especially over longer time periods. Productivity time‐series are a necessary background for projections, but they must be supplemented by special studies.

See The National Economic Accounts of the United States. Hearings before the Subcommittee in Economic Statistics of the Joint Economic Committee, Congress of the United States (U.S. Government Printing Office, 1957), especially the Appendix containing the Report of the National Accounts Review Committee, National Bureau of Economic Research.
Some flow models of production constraints
Authors: Noble Stedman B.
Published: May 2007

After a definition of resource flow models, the study of production constraints is broken into three parts: knowing the effect of a finished equipment upon the economy, recognizing the constraint of the economy, and determining the reactions to be made because of the constraints. Then various methods of analysis are considered: one method being current mobilization planning and another being a model based on the Census of Manufactures. Because of problems encountered in these methods, an abstract analysis is presented that is identified with steps in the desigr of an equipment.
The use of simulation to evaluate a multiechelon, dynamic inventory model
Authors: Clark Andrew J.
Published: May 2007

Simulation is normally used to investigate a problem that is too complex for analytic: solution. However, it is possible to have a solution algorithm that is itself so complex that simulation may profitably be used to study its behavior. A case in hand is a recently developed multiechelon inventory decision model which uses dynamic programming techniques. The use of simulation to evaluate this decision model is illustrated by a case study of a fictitious but realistic item. In particular, its use for comparative analyses of different maintenance policies is explained.

Additional uses of simulation in this context are mentioned. For example, the insertion into the simulation of complexities not included in the decision model provides a qualitative evaluation of the use of the decision model in an actual logistics system. Also, the ability of the decision model to cope with increasing information may be analyzed.
Realism in empirical logistics research
Authors: Hamilton J. E.
Published: May 2007

This discussion, although oriented toward research in logistics, including the initial gathering of pertinent data and subsequent search for structure, is limited to elemental aspects of problems in simulation of functions. The two specific problems outlined ‐ with suggestions for method of attack ‐ are pertinent to Navy ships only: What load should be carried when the ship is deployable and available for a mission, and what provisions are necessary for back‐up support? The load and support problems are, in turn, divisible into three subordinate considerations: manpower, facilities, and materials. The latter receives the most attention in this paper.

Because the present classification of materials is unsatisfactory, a new classification is suggested, based on three criteria: The nature of utilization, the status (as repairable or disposable), and the rate of utility exhaustion. The first two are important for classification; the third is the core of an empirical study.

In determining what is to be loaded into a ship, certain predictable items are considered: population, time, and usage rate. The Navy currently has no procedure for collecting good experience data on usage, although only specific experience is reducible to clerical statistics. A job order system is therefore proposed.
Some problems and models for time‐phased transport requirements. Chance constrained programs with normal deviates and linear decision rules
Authors: Charnes A. , Cooper W. W.
Published: May 2007

This paper discusses the possibilities of analysis of risk and uncertainty in forward planning in time for implementation of transport requirements by means of “chance‐constrained” programming models [1]. The possibilities of using chance‐constrained programming models, in place of queuing models, and the solution of such a model for the leasing of tanker fleets. is considered in some detail.
Scheduling of cargo containers
Authors: O'Neill R. R.
Published: May 2007

Containerization of both military and commercial cargo is being undertaken on a large scale. However, many problems have yet to be solved. An important me is the determination of optimum assignments of containers where less than 100 percent containerization of the ship's cargo must be considered. Mathematical models have been developed which relate possible economic advantages with the number of containers and their allocation to ports and commodities.
Recent developments in the job‐shop scheduling problem
Authors: Thompson G. L.
Published: May 2007

The job‐shop scheduling problem is a large‐scale combinatorial problem of great practical significance. First, a discussion of the size of the combinatorial problem involved will be given. Then, the various methods of attacks for solving this problem will be discussed and criticized by the use of examples. These methods include principally the integral linear programming, the heuristic, the loading rule, the simulation, and the Monte Carlo methods. The latter method, in the form devised by Giffler and Thompson, will be described in detail, and some computational results will he presented.
Some remarks on bayes solutions to the inventory problem
Authors: Scarf Herbert E.
Published: May 2007

A functional equation is described for the inventory problem in which the demand distribution contains an unknown parameter with a known a priori distribution. If the demand distribution is a member of the exponential family, then the minimum cost is a function of two variables: current stock and past mean demand. Some properties of the optimum policies are described, and some conditions are given which imply that the functional equation can be reduced to one involving functions of one variable only. Under these conditions, the computation of optimal policies becomes no more difficult than the corresponding computation with a known demand distribution.
Replacement of periodically inspected equipment. (An optimal optional stopping rule)
Authors: Derman C. , Sacks J.
Published: May 2007

The problem of choosing an optimal replacement rule is considered for deteriorating equipment where the amount of deterioration is observed periodically. A “near” optimal rule is obtained. The main tool is an optimal stopping lemma related to semimartingales.
Optimal system supply
Authors: Proschan Frank
Published: May 2007

This paper unifies and extends previous work by Guy Black and Frank Proschan which shows how to calculate minimum‐cost spare‐part kits yielding specified assurance against shutdown due to shortage in a complex military system. Optimal policies are determined for both the situation in which only the initial spare‐parts kit may be used to replace failed components (single‐period model) and the situation in which periodic replenishment of the spare‐part kit occurs (multiperiod model). In the multiperiod model, constant lag in delivery is permitted. The only input data required are component costs and failure distributions (assumed exponential in the multiperiod model); knowledge of component usage rates is not required. Actual applications of the single‐period model to certain large military systems are described briefly.
A model for evaluating the output of intelligence systems
Authors: Caldwell W. V. , Coombs C. H. , Thrall R. M. , Schoeffler M. S. , Hill Murray
Published: May 2007

A large‐scale experiment was designed to obtain the intuitive evaluations of intelligence reports from a large group of experienced Army officers. An interval scale of quality of the intelligence reports was constructed with a view to providing some mathematical models that describe in a simple fashion the way in which the components of an intelligence report combine to determine the value of the report. The results of the study indicate (a) that officers judge such intelligence reports consistently, (b) that they use criteria in judging intelligence estimates different from those they use in judging courses of action, and (c) that the judgments depend to some extent on the combat experience of the officer. The different techniques of obtaining rating scales were found to produce essentially the same results.
Fixed‐cost transportation problems
Authors: Balinski Michel L.
Published: May 2007

This paper formulates a fixed‐cost transportation problem as an integer program, describes some of its special properties, and suggests an approximate method of solution. Examples are given to demonstrate the approximation technique.
Decision on retention of excess stock following a normal probability law of obsolescence and deterioration
Authors: Mohan C. , Garg R. C.
Published: May 2007

This paper gives a method by which economic retention quantity of a material having a known shelf‐life and following a normal probability law of obsolescence and deterioration has been calculated. The relevant equations are solved by trial and error method.
On the estimation of scale parameters
Authors: Weiss Lionel
Published: May 2007

If Y1 ≤ … ≤ Yn are ordered observations from a population with cumulative distribution function \documentclass{article}\pagestyle{empty}\begin{document}${\rm G}\left( {{\textstyle{{{\rm X - B}} \over {\rm C}}}} \right)$\end{document}, probability density function \documentclass{article}\pagestyle{empty}\begin{document}$ {\rm (1/C)g}\left( {{\textstyle{{{\rm X - B}} \over {\rm C}}}} \right) $\end{document}, where B and C are unknown parameters with C > 0, and the function G(x) is known, it is shown that under mild restrictions on G(x), \documentclass{article}\pagestyle{empty}\begin{document}$ \frac{{{\rm n + 1}}}{{{\rm n - 1}}}\sum\limits_{{\rm j = 1}}^{{\rm n - 1}} {{\rm g[G}^{{\rm - 1}} {\rm (j/n)](Y}_{{\rm j + 1}} {\rm - Y}_{\rm j} {\rm)}} $\end{document} is a consistent estimate of C. In certain important cases, this estimate has a structure similar to that of estimates known to be optimal.
The minimax path in a search for a circle in a plane
Authors: Gluss Brian
Published: May 2007

The problem has been considered by Isbell of determining the path that minimizes the maximum distance along the path to a line in the same plane whose distance from the starting point of the search is known, while its direction is unknown. We consider in this article the analogous problem for the search for a circle of known radius, of known distance from a starting point in its plane. It is further shown that Isbell's solution is a limiting case of the problem posed as the radius of the circle tends to infinity. The problem appears to be of some practical significance, since it is equivalent to that of searching for an object a given distance away which will be spotted when we get sufficiently close—that is, within a specific radius.
Aircraft compartment design criteria for the army deployment mission
Authors: Sharpe W. F.
Published: May 2007

An important mission of military cargo aircraft is the deployment of army equipment to areas of actual or potential warfare. The large number of vehicles required to support army forces makes weight anti cube, the traditional measures of airlift capacity, insufficient for analysis of the amount of such cargo which can be carried by various aircraft. This paper uses a representative list of army deployment cargo to investigate the capacity of alternative aircraft designs. A loading model is developed to estimate the relationship between cargo compartment dimensions and loading efficiency. The relationship between Compartment floor area and floor area of vehicles loaded is found to be remarkably stable over a large range of alternative compartment sizes. A second model is used to minimize the distribution of total weight per aircraft when the aircraft are loaded in accordance with the criteria of the first model. The resultant distributions, presented for various compartment sizes, suggest the relationship between cargo compartment and payload capacity which would be optimum for this particular mission.
An AID to preliminary design of missile prelaunch checkout equipment
Authors: Firstman Sidney I.
Published: May 2007

The purpose of a missile prelaunch confidence checkout is to assure the commander that the weapon contains no undetected mission‐failure‐causing defects and, indeed, is ready to perform its assigned mission. If all the prelaunch tests that would be desirable cannot be scheduled because of the operational necessity to launch within a limited amount of time, then engineering and operational evaluations must be employed to determine the theoretically optimum content of the limited checkout and also the required capability of the checkout equipment. As an aid in preliminary design, perhaps as an objective point of departure for design compromises, this paper addresses the problem of making these design decisions from an operational viewpoint and, by use of reliability estimates as the basis for the analysis, develops (1) quantitative criteria for the value of inclusion of individual checks in the checkout, (2) an expression for the required efficiency of the checkout equipment, and (3) a mathematical method for determining the content of a theoretically optimum checkout. The latter result is for the case exemplified by ballistic missiles where, in general, all missile functions are energized prior to launch and where one operational constraint is dominant, namely, time allowed for checkout. The determination of the optimum checkout content can be done graphically, and the method developed can also be used to ascertain the launch confidence achieved by the checkout equipment of present missile systems.
On stock selection at spare parts stores sections
Authors: Johnson J. W.
Published: May 2007

This study considers the items to be stocked and the quantities thereof at Spare Parts Stores Sections of the Royal Canadian Ordnance Corps. Aspects of the problem given particular attention are identification of the relevant operating costs, shortage implications, the interaction between the stocking and replenishment policies, and the sensitivity to forecasting errors. Mathematical and simulated sampling models from which decision rules were derived are described. Adoption of the recommended stocking and replenishment policies would be expected to yield a 24‐percent increase in availability and an annual reduction in operating costs of $300,000.
An approximate method of solving Blotto games
Authors: Beale E. M. L. , Heselden G. P. M.
Published: May 2007

A Blotto game is a mathematical formulation of the problem of allocating forces in certain military situations, particularly when they are concerned with. an initial strike. In this paper an approximate method of solution is introduced. This is based on a new game involving the mean numbers of forces allocated to each battlefield in the original game.
A triangulafuzation method for computations in linear programming
Authors: Alway G. G.
Published: May 2007

This paper describes a method for computations in linear programming which is midway between methods such as the “stepping stone” procedure for the distribution model in which no inverses of bases are kept, and the modified simplex method in which one carries along the complete inverse of the basis at each stage. It is designed to avoid division by pivots until the optimum basis has been obtained. Thus a small pivot will not affect adversely all subsequent steps.
Surveillance problems
Authors: Savage I. Richard
Published: May 2007

This paper presents a detailed discussion of an economic model for the surveillance of a production process; it also presents optimal policies for making inspections of and adjustments to the process, which is characterized by a tendency to deteriorate after each adjustment. Some of the conclusions are for general processes, and, on the other hand, the more specific results are for Poisson processes.
A heuristic concept and an automatic computer program aid for operational simulation
Authors: Ledley R. S. , Rotolo L. S.
Published: May 2007

An operational simulation is a collection of interrelating events. In order to code a simulation more easily for an electronic computer the events should be isolated, i.e., free from immediate interactions. Logical aid is used to determine cause‐effect relationships and eliminate impossible interactions from consideration. A timing model is set up, partitioning the events in time and space finely enough to insure their mutual exclusiveness. An automatic computer program is described that will compile mutually exclusive events, which may all be precoded as if occurring at one time and at one place. The program allows flexibility for adding, omitting, and replacing events or their parts, and for interrupting the simulation to allow human decisions to be incorporated.
Queuing problem with limited waiting space
Authors: Jain H. C.
Published: May 2007

In this paper, the queuing problem characterised by Poisson arrivals and a wide class of service time distribution has been solved by applying the phase method under the condition of limited waiting space. This problem is already solved by Finch, but he gave only explicit solution for the case of exponential distribution. The phase method has an advantage of giving the solution in a form which is easily computable. Tables are presented for the operational parameters for exponential and 2‐Erlang service time distributions.
Pure strategy solutions to blotto games in closed auction bidding
Authors: Sakaguchi Minoru
Published: May 2007

This paper considers the problem of making simultaneous bids for two objects against competition by two competitors. A game‐theoretic formulation of the problem is made and optimal pure strategies, when they exist, are derived.
A generalized problem in air defense
Authors: Arora K. L.
Published: May 2007

In this paper a stochastic model for an air defense problem has been developed, in which it is assumed that the time during which the formation of enemy bombers is in free‐state and in contact‐state follows general distributions, and the probability of hits follows a Poisson process.
Toward a study of bidding processes, part II: Games with capacity limitations
Authors: Griesmer James H. , Shubik Martin , Watson Thomas J.
Published: May 2007

This paper is the second of a series on bidding. A previous paper (published in Mar., 1963 issue of NRLQ) considered bidding situations formulated as two‐person constant‐sum games; this article is devoted to the important case of non‐constant‐sum bidding models involving two participants.

Following an introduction on solution concepts, the single‐shot bid is analyzed, both for the case of no penalty in the case of a tie, and for the case of a penalty. The majority of the paper is then devoted to a study of bidding on a sequence of jobs, using three different assumptions about the amount of information revealed after the award of each job. They are, respectively, the super‐silent bid, where no information is given; the silent bid, where only the name of the winner is announced; and the noisy bid, where complete information is given. The analysis is primarily a study of equilibrium solutions under each assumption. What is shown is that, in passing from one type of bid to a second in which more information is given, new families of equilibrium solutions are added, and existing families become more extensive.
Toward a study of bidding processes, part III: Some special models
Authors: Griesmer James H. , Shubik Martin , Watson Thomas J.
Published: May 2007

This is the third paper in a series on the theory of bidding. It investigates the effect of the costs of preparing a bid and penalties for refusing to accept awards. Several other special models of bidding procedures are presented, together with their interpretations.
A comparison of queue disciplines when service orientation times occur
Authors: Gaver D. P.
Published: May 2007

A 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

Given 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

In 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

Koopman 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

The 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

This 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

The 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

This 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.
Note on an integer linear programming model for determining a minimum embarkation fleet
Authors: D'Esopo D. A. , Lefkowitz B.
Published: May 2007

An integer linear programming model for computing the minimum number of ships needed to embark a task organization and its attendant transfer vehicles is developed. The implementation of the model on a computer is discussed.
A game over spaces of probability distributions
Authors: Danskin John M.
Published: May 2007

This 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.
Programming with fractional linear objective functions
Authors: Joksch H. C.
Published: May 2007

Programming problems with linear constraints and certain objective functions containing fractions of linear functions are reduced to parametric linear programming problems by treating the value of one of the linear forms in the objective function as a parameter. Conditions for extrema are derived and the possibilities for local and global extrema are discussed.
A method of resource allocation using demand preference
Authors: Gilbert John C.
Published: May 2007

In many military problems, it is impossible to establish a function describing the relative military worth of resources. Demand for these resources is usually created from some higher level goal. The algorithm described in this paper provides a procedure for allocating scarce resources among competing demands in such a situation.
The Polaris military essentiality system
Authors: Denicoff M. , Fennell J. , Haber S. E. , Marlow W. H. , Segel F. W. , Solomon Henry
Published: May 2007

One 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

This 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

This 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.
Stock level distributions for (s,S) inventory problems
Authors: Greenberg Harold
Published: May 2007

The transient probability distribution for the stock level is found for the (s,S) inventory model. An integral equation is obtained for the stock level distribution from the state equations. The integral equation is solved in terms of a parameter, which is obtained by solving a renewal type equation. The steady‐state results are then obtained from the transient solutions.
Economical reorder quantities and reorder points with uncertain demand
Authors: Parker Lawrence L.
Published: May 2007

The 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

Using 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.