bluuebunny/crossref_metadata_2025_split huggingface dataset:
Strongly Generated Banach Spaces and Measures of Noncompactness
Authors: Kunze Markus , Schlüchtermann Georg 
Published: May 2007

AbstractTo generalize the Hausdorff measure of noncompactness to other classes of bounded sets (like e. g. conditionally weakly compact or Asplund sets), we introduce Grothendieck classes. We deduce integral inequalities for quantities (called Grothendieck measures) related to these classes. As a by‐product, we can answer a question concerning the measure of noncompactness for linear T : X → Y introduced in [14], and generalize a theorem about weak solutions of differential equations in Banach spaces.
Infinite Dimensional Geometric Properties of Real Interpolation Spaces
Authors: Kutzarova Denka , Nikolova Lyudmila I. , Prus Stanislaw 
Published: May 2007

AbstractEstimates for the moduli of noncompact convexity of lp‐sums and real interpolation spaces for finite families of spaces are given. It is proved that such an interpolation preserves nearly uniform convexity and property (β).
Boundedness of Sublinear Operators in Herz Spaces on Vilenkin Groups and its Application
Authors: Lu Shanzhen , Yang Dachun 
Published: May 2007

AbstractThe authors establish the boundedness of some sublinear operators in weighted Herz spaces on Vilenkin groups under certain weak local hypotheses on the size of these operators at the identity. This class of operators includes most of the important operators in harmonic analysis on Vilenkin groups. The main theorems are best possible under the conditions of the theorems. As applications, the authors establish the Littlewood‐Paley function characterization of some Herz spaces and the relations between Herz spaces and Herz‐type Hardy spaces.
The Poisson Voronoi Tessellation III. Miles' Formula
Authors: Muche Lutz 
Published: May 2007

AbstractThis paper gives distributional properties of geometrical characteristics of a Voronoi tessellation generated by a stationary Poisson point process. The considerations are based on a well‐known formula given by [10] describing size and shape of a cell of the Delaunay tessellation and on the close connection between Delaunay and Voronoi tessellation. Several results are given for the two‐dimensional case, but the main part is the investigation of the three‐dimensional case. They include the density functions of the angles perpendicular to the ‘typical’ edge, spanned by two neighbouring Poisson points and that spanned by two neighbouring faces, the angle between two edges emanating from the ‘typical’ vertex, the distance of two neighbouring Poisson points, the angle between two edges emanating from the ‘typical’ vertex of the Poisson Voronoi tessellation and some others. These density functions are given partly explicitely and partly in integral form.
The Newton Polygon and Elliptic Problems with Parameter
Authors: Denk Robert , Mennicken Reinhard , Volevich Leonid 
Published: May 2007

AbstractIn the study of the resolvent of a scalar elliptic operator, say, on a manifold without boundary there is a well‐known Agmon‐Agranovich‐Vishik condition of ellipticity with parameter which guarantees the existence of a ray of minimal growth of the resolvent. The paper is devoted to the investigation of the same problem in the case of systems which are elliptic in the sense of Douglis‐Nirenberg. We look for algebraic conditions on the symbol providing the existence of the resolvent set containing a ray on the complex plane. We approach the problem using the Newton polyhedron method. The idea of the method is to study simultaneously all the quasihomogeneous parts of the system obtained by assigning to the spectral parameter various weights, defined by the corresponding Newton polygon. On this way several equivalent necessary and sufficient conditions on the symbol of the system guaranteeing the existence and sharp estimates for the resolvent are found. One of the equivalent conditions can be formulated in the following form: all the upper left minors of the symbol satisfy ellipticity conditions. This subclass of systems elliptic in the sense of Douglis‐Nirenberg was introduced by A. KOZHEVNIKOV [K2].
Tauberian theorem for m‐spherical transforms on the Heisenberg group
Authors: Chang Der‐Chen , Eby Wayne M. 
Published: May 2007

AbstractIn this paper we prove a Tauberian type theorem for the space L $ ^1 _{\bf m} $(Hn ). This theorem gives sufficient conditions for a L $ ^1 _{\bf 0} $(Hn ) submodule J ⊂ L $ ^1 _{\bf m} $(Hn ) to make up all of L $ ^1 _{\bf m} $(Hn ). As a consequence of this theorem, we are able to improve previous results on the Pompeiu problem with moments on the Heisenberg group for the space L∞(Hn ). In connection with the Pompeiu problem, given the vanishing of integrals ∫zmLgf (z, 0) dσ (z) = 0 for all g ∈ Hn and i = 1, 2 for appropriate radii r1 and r2, we now have the (improved) conclusion $ {\bar {\bf Z}}^{\bf m} $ f ≡ 0, where $ {\bar {\bf Z}}^{\bf m} $ = $ \bar Z^{m_1}_1 $ · · · $ \bar Z^{m_n}_n $ and $ \bar Z_j $ form the standard basis for T(0,1)(Hn ). (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
An unknotting theorem for delta and sharp edge‐homotopy
Authors: Nikkuni Ryo 
Published: May 2007

AbstractTwo spatial embeddings of a graph are said to be delta (resp. sharp) edge‐homotopic if they are transformed into each other by self delta (resp. sharp) moves and ambient isotopies. We show that any two spatial embeddings of a graph are delta (resp. sharp) edge‐homotopic if and only if the graph does not contain a subgraph which is homeomorphic to the theta graph or the disjoint union of two 1‐spheres, or equivalently G is homeomorphic to a bouquet. (© 2007 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)
Positive sharp wave origin: Evidence supporting the electrode initiation hypothesis
Authors: Dumitru Daniel , Maria Daniel L. Santa 
Published: May 2007

AbstractThis investigation analyzes the temporal characteristics of maximal depolarization times for three waveforms: end‐plate spikes, fibrillation potentials, and positive sharp waves (PSWs) to provide support for the electrode initiation hypothesis of PSW induction. The maximal depolarization times for PSWs are documented to comprise two distinct populations conforming to relatively short and comparatively longer maximal depolarization times. Those PSWs with short maximal depolarization times were found to be equivalent to end‐plate spike maximal depolarization times, whereas those with longer times were comparable to fibrillation potentials. The PSW group with shorter maximal depolarization times was encountered more frequently. The combination of two distinct groups of PSWs with respective times comparable to end‐plate spikes and fibrillation potentials supports the hypothesis that the majority of PSWs originate at the recording electrode during insertion, whereas a smaller population of PSWs arises as propagating fibrillation potentials that block at the recording electrode. Subcutaneous compared to intramuscular recordings from denervated muscle document that the recording electrode is necessary to both record and produce PSWs. Hence, this study confirms the proposed hypothesis that the majority of observed PSWs represent a suprathreshold single muscle‐fiber discharge induced by, and originating in close proximity to, a perielectrode crushed membrane that then propagate away from the electrode; a smaller population of PSWs conform to that of a blocked fibrillation potential. Muscle Nerve, 2007
Programming the supply of a strategic material. Part I. A Nonstochastic Model
Authors: Karreman Herman F. 
Published: May 2007

AbstractThis paper deals with the various ways in which the requirements of a certain strategic material could be met in a period of limited war. Besides a small stock of ores to draw on at the beginning of the period, high‐quality foreign ores have to be imported or low‐quality domestic ores made suitable for the production of alloys. In the latter case, however, the plants for upgrading and processing the ores first have to be constructed. The objective is to meet the requirements, assumed here to be given for the years of limited war, at minimum cost. The cost function contains, besides linear, also quadratic terms, positive as well as negative ones. Two recently developed computational methods have been used to solve the problem.
The marriage of on‐line human decision with computer programs
Authors: Teager Herbert M. 
Published: May 2007

AbstractAs the logistics problems of current interest become more and more complex, it becomes apparent that heuristic methods hold more promise than exhaustive or algorithmic methods of solution. It is also becoming clearer that heuristics, per se, are useless in approaching large combinatorial problems (via pattern recognition, for example), unless some general techniques are developed to draw out the specific “best” heuristics required for each problem. It is a fact that humans are, at present, far more efficient in developing and applying such heuristics than a machine. It is therefore of considerable value to explore how the best features of both human and machine decision can be married. The general problem requires the development of common meaningful languages, specialized input‐output display and entry facilities, and a means of time‐sharing the computer, in order to efficiently match the machine‐vs the human‐decision time.
The use of man‐machine simulation for support planning
Authors: Geisler Murray A. 
Published: May 2007

AbstractSupport planning under present conditions of rapid exploitation of technological advances to maintain the most advanced weapon inventory creates many new stresses for planning the support of these new weapons. In addition, support planning has always been incomplete in that there has not been a systematic way of adjusting plans to reflect operational experience.The second major experiment of the RAND Logistics Systems Laboratory has produced techniques of support planning for new weapons which may represent major advances in such activities. This paper describes the conditions under which support planning must be performed in the present and future military environment and the experience of LP‐II in performing such planning for an ICBM weapon of the 1963–65 time period, as an example.
On‐line macro‐simulation in systems for logistics decision making
Authors: Dresch Francis 
Published: May 2007

AbstractMacro‐simulation has three types of application:1. Computer experimentation with simplified models of complex systems to explore the systems' sensitivity to variation in environmental parameters or changes in controllable decision variables. This use of macro‐simulation facilitates analysis of the realism of the various models as well as determination of optimal strategies.2. Pilot testing of complex decision systems against a detailed quantitative description of the real operating environment as observed in the past.3. Continuing on‐line simulation of a system over a future planning period to determine optimal levels or settings for current decision variables or to provide measures of effectiveness for feedback and control.While the first two applications are most familiar and are most frequent, the third application may have increasing importance in the future. The reasons for this will be discussed with illustrations from work at Stanford Research Institute on stock level policy and on air logistics. All three applications of macro‐simulation techniques have proved important in this work.
A comparative study of prediction techniques
Authors: Brown Bernice 
Published: May 2007

AbstractThis study deals with the techniques for predicting the future demands of spare parts. The results of studies about the Air Force Inventory problem have led us to believe that any improvement in the demand forecast could result in important savings. Demand prediction is actually based upon two separate estimating procedures. First, an estimate is made about the underlying pattern of demands per program element, Second, an estimate is made about the pattern of future program elements. It is the marriage of these two estimates that allows us to make predictions of the number of demands in future time periods. This study is restricted to finding ways of improving the estimates of the demands per program element, We used past demand data with the pattern of program elements known. We also used the known pattern of future program elements to make the prediction of future demand.There are seven prediction techniques used in this study. The first four techniques are based on the assumption that demand rate (demand per program element) is constant through time. The other three techniques assume that failures (demands) are related to the age of the part. These three techniques are routines for estimating the service Life characteristics of parts.We used as inputs to the study two batches of data: 33 months of demand, data on a sample of 300 B‐52 parts and 26 months of failures of 27 missile components. We made monthly estimates of demand for a year in the future and measured the prediction errors. In the evaluation of the estimating procedures, we used three measures of the accuracy of the forecasts, namely average monthly error, relative error expressed as percent of the actual demand and root mean square of the errors of the predictions.
Militlry worth and systems development
Authors: Folsom P. L. 
Published: May 2007

AbstractThis is an unclassified treatment of some problems in military worth which arise in the development of large systems. Recent studies in measures of effectiveness and value theory have been used to define this part of the discussion. Although the discussion will have points in common with many “large” systems, the model used in this discussion is a typical real‐time digital data system for executive use. Factors and constraints such as fund limits, pricing, service life, lead time and environment are treated. A typical practical attack on the problem of measuring the military worth of such a system is included. Most systems in this class have not yet accumulated sufficient life in service for measurement and determination of results of plans to “maximize” their military worth. Accordingly, this part of the discussion is restricted to some suggestions concerning defining and measuring military worth of these systems.
Investment policies for expanding businesses optimal in a long‐run sense
Authors: Breiman Leo 
Published: May 2007

AbstractAn entrepeneur has a given initial fortune and faces the following situation: during any time period he may invest various amounts of his available fortune in various alternatives (differing from interval to interval) and keep the remainder of his money as a reserve fund; The alternatives materialize and pay off according to a probability distribution in which occurrences in different time intervals are independent. We analyze the problem of finding the investment policies (that is, the division of funds during every time interval between the investment alternatives and the reserve) that will make the long‐run growth of the entrepeneur's fortune as rapid as possible.
Principles of dynamic weapon systems programming
Authors: Salveson M. E. 
Published: May 2007

AbstractOver the last several years, there has been considerable interest in the problems of effective programming, decision‐making, and progress evaluation, in the development and production of weapon systems. The need for solving these problems was great when budget ceilings were less restrictive. At the present time when budgets are more stringent, the need is indeed urgent if defense is to be most adequate. The principles and methods described in this article were developed as guides to the development and installation of a management system for programming, decision‐making, and progress evaluation in weapon systems development, procurement, and production in the U. S. Air Force. The principles, however, have applicability to programming, decision‐making, and control in other governmental and in industrial and business organizations. Some of these principles and methods already have been applied in other situations; some are new. However, the amount that is new is relatively small; we are confident the system is feasible and economic within the existing state of the art, and that it would contribute to efficiency in the development and production of weapon systems.
The organization and operation of a taxi fleet
Authors: Meyer Richard F. , Wolfe Harry B. 
Published: May 2007

AbstractIn dispatching a taxi fleet to meet random customer demand, two types of strategies must be defined: (a) the dispatching strategy, which sets the rules for choosing a taxi to serve a given call, and (b) the idle time strategy, which determines how the idle taxis are to be distributed most advantageously to meet future demand. The effect of dispatching and idle‐time strategies on taxi utilization and on passenger service is demonstrated under several conditions of operation. First, the simples taxi model is examined: random demand between two points serviced by one taxi. Next, we consider the effect of different strategies on the operation of a taxi fleet when demand is uniformly distributed in a two‐dimensional region. In the last section, the main properties of these simplified models are exhibited in an intermediate case by a Monte Carlo simulation of taxi service between a number of discrete points. The purpose of the paper is to provide simple and practical methods to determine the payoff in customer waiting time and/or taxi savings resulting from more sophisticated dispatching and idle‐time strategies. We conclude that good taxi redistribution policies markedly decrease customer waiting times, except when the level of taxi utilization is too high. Our results apply most directly to private transportation fleets, rather than to automobile taxi companies where cruising may be important.
On network flow functions
Authors: Shapley Lloyd S. 
Published: May 2007

AbstractThis article covers an investigation of the capacity of a network as a function of the capacities of its individual arcs. The case of two variables was investigated in detail, and it was found that each pair of arcs either consistently help each other or consistently hinder each other. Interaction types were computed for a number of special cases, such as arcs in parallel or arcs in series.
A direct method for the computation of waiting times
Authors: Lombardi Lionello 
Published: May 2007

AbstractA recurrence relation for the direct computation of the waiting times of an array of c customers served by s parallel channels on a first come first served basis, where the time of arrival and the holding time of each customer are known, is worked out. The number of operations required by this procedure is proportional to c.s, while the method commonly used, which is due to F. Pollaczek, requires a number of operations proportional to c2. In (c): this improvement is obtained by means of the adoption of sorting by insertion and by saving certain intermediate results.
“Hedging” on statetical assumptions
Authors: Weiss Lionel 
Published: May 2007

AbstractIt is pointed out that in many cases statistical assumptions, such as the assumption of a normal population, really cannot be known to be true with the absolute certainty that the word “assumption” has come to imply. In fact, in some instances data collected for purposes other than testing the assumptions cast serious doubt on the validity of the assumptions. A simple safety or hedging device is proposed, and illustrated for the case where the problem is to estimate the qth quantile (m, say) of a distribution assumed to be normal with given standard deviation σ. Let X, R denote the sample mean and the qth sample quantile, respectively. Under the assumption, the best estimate of m is X + t σ, where t is a properly chosen constant, while R is a reasonable estimate of m even if the assumption is not true. The hedging device is to use X + t σ as the estimate if |X + t σ – R| ≤ d, and to use R as the estimate if || + t σ – R| > d, where d is a preassigned value. In order to choose d to reflect our faith in the validity of the assumption, and to obtain the operating characteristics of our estimation rule, it is necessary to know the joint distribution of X and R. This is shown to approach a bivariate normal distribution as the sample size increases, for any population satisfying mild regularity conditions.
Budget constraints in logistics models
Authors: Hadley G. , Whitin T. M. 
Published: May 2007

AbstractIn application of operations research models in the area of logistics, important constraints are typically encountered in the form of limitations on the funds appropriated. A supply system must be operated within whatever budgeted funds are appropriated by Congress. In the present article, various possible types of budget constraints are discussed as well as their impact on certain types of operations research models. The possible misallocations that can result from the setting of specific budgets designated for particular purposes are discussed. The confusion existing in the literature concerning the type of constraints that are actually encountered versus those that are imposed upon the mathematical models is pointed out as well as the typical inconsistency of budget constraints and steady‐state models. The difference between a steady‐state budget and a transition‐phase budget is clarified.
Lognormal distribution and maintainability in support systems research
Authors: Bovaird R. L. , Zagor H. L. 
Published: May 2007

AbstractThis article presents a method for predicting the downtime distribution for a new complex electronic equipment. A theoretical discussion is given which indicates that the downtime distribution for such an equipment can be represented by a lognormal function. Experimental data are shown which establish that the two‐parameter lognormal distribution function adequately describes the downtimes of a diverse group of electronic equipments. It is concluded that this analytical expression for the downtime distribution of complex electronic equipments provides the basis for a quantitative and scientific approach to the measurement and prediction of maintainability. This approach takes account of equipment maintenance characteristics and maintenance personnel capabilities.