Localization of Frames,Banach Frames,and the Invertibility of the Frame Operator

We introduce a new concept to describe the localization of frames. In our main result we show that the frame operator preserves this localization and that the dual frame possesses the same localization property. As an application we show that certain frames for Hilbert spaces extend automatically to Banach frames. Using this abstract theory, we derive new results on the construction of nonuniform Gabor frames and solve a problem about non-uniform sampling in shift-invariant spaces.     

An Analogy Principle in Inductive Logic

We propose an Analogy Principle in the context of Unary Inductive Logic and characterize the probability functions which satisfy it. In particular in the case of a language with just two predicates the probability functions satisfying this principle correspond to solutions of Skyrms? ‘Wheel of Fortune’.     

Single phase limit for melting nanoparticles

The melting of a spherical or cylindrical nanoparticle is modelled as a Stefan problem by including the effects of surface tension through the Gibbs–Thomson condition. A one-phase moving boundary problem is derived from the general two-phase formulation in the singular limit of slow conduction in the solid phase, and the resulting equations are studied analytically in the limit of small time and large Stefan number. Further analytical approximations for the temperature distribution and the position of the solid–melt interface are found by applying an integral formulation together with an iterative scheme. All these analytical results are compared with numerical solutions obtained using a front-fixing method, and are shown to provide good approximations in various regimes. The inclusion of surface tension, which acts to decrease the melting temperature as the particle melts, is shown to accelerate the melting process. Unlike the classical one-phase Stefan problem without surface tension, the solid–melt interface exhibits blow-up at some critical radius of the particle (which for metals is of the order of a few nanometres), a phenomenon that has been observed experimentally. An interesting feature of the model is the prediction that surface tension drives superheating in the solid particle before blow-up occurs.     

A two-echelon base-stock inventory model with Poisson demand and the sequential processing of orders at the upper echelon

We consider a two-echelon inventory system with a number of non-identical, independent ‘retailers’ at the lower echelon and a single ‘supplier’ at the upper echelon. Each retailer experiences Poisson demand and operates a base stock policy with backorders. The supplier manufactures to order and holds no stock. Orders are produced, in first-come first-served sequence, with a fixed production time. The supplier therefore functions as an M/D/1 queue. We are interested in the performance characteristics (average inventory, average backorder level) at each retailer. By finding the distribution of order lead time and hence the distribution of demand during order lead time, we find the steady state inventory and backorder levels based on the assumption that order lead times are independent of demand during order lead time at a retailer. We also propose two alternative approximation procedures based on assumed forms for the order lead time distribution. Finally we provide a derivation of the steady state inventory and backorder levels which will be exact as long as there is no transportation time on orders between the supplier and retailers. A numerical comparison is made between the exact and approximate measures. We conclude by recommending an approach which is intuitive and computationally straightforward.     

Controlling adverse effect on work in process inventory while reducing machine setup time

Earlier research has found that the presence of setup time variance can cause an adverse effect on waiting time and inventory as one reduces setup time for a product on a single machine that processes a number of products in a cyclic production system [Sarkar, D., Zangwill, W.I., 1991. Variance effects in cyclic production systems. Management Science 37 (4) 444–453; Zangwill, W.I., 1987. From EOQ towards ZI. Management Science 33 (10) 1209–1223]. This finding validates what other researchers had believed from a rather anecdotal perspective: “variability reduction” is extremely important for improving overall effectiveness of a pull or JIT system [Schonberger, Richard J., 1982. Japanese Manufacturing Techniques: Nine Hidden Lessons in Simplicity. The Free Press, New York]. In this paper, we offer explicit mathematical equations that characterize the variance levels in order to offer exact conditions under which WIP improves or worsens when one reduces setup time.     

Exact join detection for convex polyhedra and other numerical abstractions

Deciding whether the union of two convex polyhedra is itself a convex polyhedron is a basic problem in polyhedral computations; having important applications in the field of constrained control and in the synthesis, analysis, verification and optimization of hardware and software systems. In such application fields though, general convex polyhedra are just one among many, so-called, numerical abstractions, which range from restricted families of (not necessarily closed) convex polyhedra to non-convex geometrical objects. We thus tackle the problem from an abstract point of view: for a wide range of numerical abstractions that can be modeled as bounded join-semilattices—that is, partial orders where any finite set of elements has a least upper bound—we show necessary and sufficient conditions for the equivalence between the lattice-theoretic join and the set-theoretic union. For the case of closed convex polyhedra—which, as far as we know, is the only one already studied in the literature—we improve upon the state-of-the-art by providing a new algorithm with a better worst-case complexity. The results and algorithms presented for the other numerical abstractions are new to this paper. All the algorithms have been implemented, experimentally validated, and made available in the Parma Polyhedra Library.     

The -local -homology of

In this paper, we introduce a Hopf algebra, developed by the author and André Henriques, which is usable in the computation of the -homology of a space. As an application, we compute the -homology of in a manner analogous to Mahowald and Milgram's computation of the -homology .

     

A two-echelon inventory model with lost sales

This paper considers a single-item, two-echelon, continuous-review inventory model. A number of retailers have their stock replenished from a central warehouse. The warehouse in turn replenishes stock from an external supplier. The demand processes on the retailers are independent Poisson. Demand not met at a retailer is lost. The order quantity from each retailer on the warehouse and from the warehouse on the supplier takes the same fixed value Q, an exogenous variable determined by packaging and handling constraints. Retailer i follows a (Q, R_i) control policy. The warehouse operates an (SQ, (S − 1)Q) policy, with non-negative integer S. If the warehouse is in stock then the lead time for retailer i is the fixed transportation time L_i from the warehouse to that retailer. Otherwise retailer orders are met, after a delay, on a first-come first-served basis. The lead time on a warehouse order is fixed. Two further assumptions are made: that each retailer may only have one order outstanding at any time and that the transportation time from the warehouse to a retailer is not less than the warehouse lead time. The performance measures of interest are the average total stock in the system and the fraction of demand met in the retailers. Procedures for determining these performance measures and optimising the behaviour of the system are developed.     

Necessary conditions for Schatten class localization operators

We study time-frequency localization operators of the form , where is the symbol of the operator and are the analysis and synthesis windows, respectively. It is shown in an earlier paper by the authors that a sufficient condition for , the Schatten class of order , is that belongs to the modulation space and the window functions to the modulation space . Here we prove a partial converse: if for every pair of window functions with a uniform norm estimate, then the corresponding symbol must belong to the modulation space . In this sense, modulation spaces are optimal for the study of localization operators. The main ingredients in our proofs are frame theory and Gabor frames. For and , we recapture earlier results, which were obtained by different methods.