bluuebunny/crossref_metadata_2025_split huggingface dataset:
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

AbstractAimsPartial 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 MethodsTwenty‐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.ResultsBladder 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.ConclusionThis 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

AbstractAimsTo 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 MethodsDetrusor 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).ConclusionsSpontaneous 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

AbstractThis 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.
Research for command logistics
Authors: Scofield E. K. 
Published: May 2007

AbstractA 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

AbstractThe 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

AbstractAfter 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

AbstractSimulation 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

AbstractThis 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

AbstractThis 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

AbstractContainerization 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

AbstractThe 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

AbstractA 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.
Optimal system supply
Authors: Proschan Frank 
Published: May 2007

AbstractThis 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

AbstractA 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.
On the estimation of scale parameters
Authors: Weiss Lionel 
Published: May 2007

AbstractIf 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

AbstractThe 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

AbstractAn 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

AbstractThe 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

AbstractThis 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

AbstractA 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

AbstractThis 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.
A heuristic concept and an automatic computer program aid for operational simulation
Authors: Ledley R. S. , Rotolo L. S. 
Published: May 2007

AbstractAn 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

AbstractIn 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.
Toward a study of bidding processes, part II: Games with capacity limitations
Authors: Griesmer James H. , Shubik Martin , Watson Thomas J. 
Published: May 2007

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