A single supplier–single retailer system with an order-up-to level inventory policy

We consider a two-level vendor-managed system in which external demand occurs only at a retailer and a supplier replenishes the retailer employing an order-up-to S policy over T periods. We present an O(T³) algorithm to coordinate the system when S is known. We also show that S can be optimized in O(aT³) time for an input parameter a.     

Strong Solutions to Non-stationary Channel Flows of Heat-Conducting Viscous Incompressible Fluids with Dissipative Heating

We study an initial-boundary-value problem for time-dependent flows of heat-conducting viscous incompressible fluids in channel-like domains on a time interval (0,T). For the parabolic system with strong nonlinearities and including the artificial (the so called “do nothing”) boundary conditions, we prove the local in time existence, global uniqueness and smoothness of the solution on a time interval (0,T ^∗), where 0<T ^∗≤T.     

-extension of Lie triple systems

In this paper, we introduce the notion of T^*-extension of a Lie triple system. Then we show that T^*-extension is compatible with nilpotency, solvability, and it preserves in certain sense the decomposition properties. In addition, we investigate the equivalence of T^*-extensions using cohomology. Finally, we show that every finite-dimensional nilpotent metrised Lie triple system over an algebraically closed field is the T^*-extension of an appropriate quotient system.     

Probabilistic order level system with lead time when delay in payments are permissible

The probabilistic order level inventory model with lead time when shortages are permitted is developed whe supplier allows some credit periodT ^* for setting the accounts for the purchase quantity. The scheduling periodT is known. Mathematical models are derived for both the cases: i)T ^*≤T and ii)T ^*>T. Expressions are derived for average expected total cost of the system and for obtaining optimum order levelZ=Z ₀ under each case.     

Optimal Operating Policy for an M/G/1 Exhaustive Server-Vacation Model

We consider an M/G/1 queueing system controlled by an exhaustive server–vacation policy, i.e, the server is turned off whenever the system becomes empty and it is turned on after a random time with at least a customer present in the system. In this paper, it is proved that there exists an exhaustive optimal policy which is of the form X + a(T - X)⁺, where, starting with the server off, X represents the time for the first arrival and T and a are non-negative real numbers. Using a classical average cost structure, the optimization problem is treated under the asymptotic average criterion. A structured definition of exhaustive policy is also derived.     

Fcfs-scheduling in a hard real-time environment under rush-hour conditions

We investigate some real-time behaviour of a (discrete time) single server system with FCFS (first come first serve) task scheduling under rush-hour conditions. The main result deals with the probability distribution of a random variable SRD(T), which describes the time the system operates without violating a fixed task service time deadlineT.Relying on a simple general probability model, asymptotic formulas concerning the mean and the variance of SRD(T) are determined; for instance, if the average arrival rate is larger than the departure rate, the expectation of SRD(T) is proved to fulfilE[SRD(T)]=c ₁+O(T ^–3) forT, wherec ₁ denotes some constant. If the arrival rate equals the departure rate, we findE[SRD(T)]c ₂ T ⁱ for somei2.     

Two thresholds of a batch arrival queueing system under modified T vacation policy with startup and closedown

This paper studies the operating characteristics of the variant of an M^[x]/G/1 vacation queue with startup and closedown times. After all the customers are served in the system exhaustively, the server shuts down (deactivates) by a closedown time, and then takes at most J vacations of constant time length T repeatedly until at least one customer is found waiting in the queue upon returning from a vacation. If at least one customer is present in the system when the server returns from a vacation, then the server reactivates and requires a startup time before providing the service. On the other hand, if no customers arrive by the end of the J th vacation, the server remains dormant in the system until at least one customer arrives. We will call the vacation policy modified T vacation policy. We derive the steady‐state probability distribution of the system size and the queue waiting time. Other system characteristics are also investigated. The long‐run average cost function per unit time is developed to determine the suitable thresholds of T and J that yield a minimum cost. Copyright © 2007 John Wiley & Sons, Ltd.     

An Efficient Procedure for Dynamic Lot-sizing Model with Demand Time Windows

We consider a dynamic lot-sizing model with demand time windows where n demands need to be scheduled in T production periods. For the case of backlogging allowed, an O(T ³) algorithm exists under the non-speculative cost structure. For the same model with somewhat general cost structure, we propose an efficient algorithm with O(max {T ², nT}) time complexity.     

Thermal avalanche for blowup solutions of semilinear heat equations

We consider the semilinear heat equation u_t = Δu + u^p both in ?^N and in a bounded domain with homogeneous Dirichlet boundary conditions, with 1 < p < p_s where p_s is the Sobolev exponent. This problem has solutions with finite‐time blowup; that is, for large enough initial data there exists T < ∞ such that u is a classical solution for 0 < t < T, while it becomes unbounded as t ↗ T. In order to understand the situation for t > T, we consider a natural approximation by reaction problems with global solution and pass to the limit. As is well‐known, the limit solution undergoes complete blowup: after it blows up at t = T, the continuation is identically infinite for all t > T. We perform here a deeper analysis of how complete blowup occurs. Actually, the singularity set of a solution that blows up as t ↗ T propagates instantaneously at time t = T to cover the whole space, producing a catastrophic discontinuity between t = T^? and t = T⁺. This is called the “avalanche.” We describe its formation as a layer appearing in the limit of the natural approximate problems. After a suitable scaling, the initial structure of the layer is given by the solution of a limit problem, described by a simple ordinary differential equation. As t proceeds past T, the solutions of the approximate problems have a traveling wave behavior with a speed that we compute. The situation in the inner region depends on the type of approximation: a conical pattern is formed with time when we approximate the power u^p by a flat truncation at level n, while for tangent truncations we get an exponential increase in time and a diffusive spatial pattern. © 2003 Wiley Periodicals, Inc.     

Speeding up the Dreyfus–Wagner algorithm for minimum Steiner trees

The Dreyfus–Wagner algorithm is a well-known dynamic programming method for computing minimum Steiner trees in general weighted graphs in time O ^*(3 ^k ), where k is the number of terminal nodes to be connected. We improve its running time to O ^*(2.684 ^k ) by showing that the optimum Steiner tree T can be partitioned into T = T ₁∪ T ₂ ∪ T ₃ in a certain way such that each T _i is a minimum Steiner tree in a suitable contracted graph G _i with less than terminals. In the rectilinear case, there exists a variant of the dynamic programming method that runs in O ^*(2.386 ^k ). In this case, our splitting technique yields an improvement to O ^*(2.335 ^k ).     

An LDLT factorization based ADI algorithm for solving large-scale differential matrix equations

Large-scale differential matrix equations appear in many applications like optimal control of partial differential equations, balanced truncation model order reduction of linear time varying systems etc. Here, we will focus on matrix Riccati differential equations (RDE). Solving such matrix valued ordinary differential equations (ODE) is a highly storage and time consuming process. Therefore, it is necessary to develop efficient solution strategies minimizing both. We present an LDL^T factorization based ADI method for solving algebraic Lyapunov equations (ALE) arising in the innermost iteration during the application of Rosenbrock ODE solvers to RDEs. We show that the LDL^T-type decomposition avoids complex arithmetic, as well as cancellation effects arising from indefinite right hand sides of the ALEs appearing in the classic ZZ^T based approach. Additionally, a certain number of linear system solves can be saved within the ADI algorithm by reducing the number of column blocks in the right hand sides while the full accuracy of the standard low-rank ADI is preserved. (© 2014 Wiley-VCH Verlag GmbH & Co. KGaA, Weinheim)     

The Global Existence of Small Solutions to the Oldroyd-B Model

The Cauchy problem to the Oldroyd-B model is studied. In particular, it is shown that if the smooth solution (u, τ) to this system blows up at a finite time T*, then ∫₀ ^T* ‖▿u(t)‖ _L ^∞dt = ∞. Furthermore, the global existence of smooth solution to this system is given with small initial data.     

On explicit L∞(QT)‐estimates for a model of tissue invasion by solid tumors

In this paper, we prove that if the initial data is small enough, we obtain an explicit L^∞(Q_T)‐estimate for a two‐dimensional mathematical model of cancer invasion, proving an explicit bound with respect to time T for the estimate of solutions. Copyright © 2017 John Wiley & Sons, Ltd.     

Coding of a translation of the two-dimensional torus

Let α be in the two-dimensional torus T ² = R ²/Z ². Assume that the translation map T : x → x + α acts ergodically. We present a symbolic coding of the map T which shares several properties with the Sturmian coding of a one-dimensional translation. The symbolic dynamical system is metrically isomorphic to the geometric dynamical system (T ², T). The coding is of quadratic growth complexity and 2-balanced. Moreover, there is a geometric underpinning, the coding is related to a fundamental domain for the action of Z ² on R ² and also to bounded remainder sets.      

Almost periodic measures on the torus

Given a skew product flow (T,T ²) on the two torus, we construct a family of flows onT ³ parametrized by elements of the circleT. We show that under a certain condition on (T,T ²) almost every flow in this family is strictly ergodic. This is used to characterize minimal subsets of the flow (T,P(T ²)) induced byT on the space of probability measures onT ². Using a result of M. Herman, we give an example to show that this characterization does not hold for everyT. To the memory of Shlomo Horowitz     

Coding of a translation of the two-dimensional torus

Let α be in the two-dimensional torus T ² = R ²/Z ². Assume that the translation map T : x → x + α acts ergodically. We present a symbolic coding of the map T which shares several properties with the Sturmian coding of a one-dimensional translation. The symbolic dynamical system is metrically isomorphic to the geometric dynamical system (T ², T). The coding is of quadratic growth complexity and 2-balanced. Moreover, there is a geometric underpinning, the coding is related to a fundamental domain for the action of Z ² on R ² and also to bounded remainder sets.     

Numerical solution of a nonlinear time-optimal control problem

Nonlinear systems with a stationary (i.e., explicitly time independent) right-hand side are considered. For time-optimal control problems with such systems, an iterative method is proposed that is a generalization of one used to solve nonlinear time-optimal control problems for systems divided by phase states and controls. The method is based on constructing finite sequences of simplices with their vertices lying on the boundaries of attainability domains. Assuming that the system is controllable, it is proved that the minimizing sequence converges to an ɛ-optimal solution after a finite number of iterations. A pair {T, u(·)} is called an ɛ-optimal solution if |T − T _opt| − ɛ, where T _opt is the optimal time required for moving the system from the initial state to the origin and u is an admissible control that moves the system to an ɛ-neighborhood of the origin over the time T.     

A convolution formula for time‐invariant linear communication systems

For every linear and time‐invariant time‐discrete (communication) system T : l^∞ → l^∞, formally, the following convolution formula can be derived: \input amssym.def $$(Tf)(n)=\sum_{k \in {\Bbb Z}} h(n‐k) f(k),\quad n \in {\Bbb Z}, f \in l^{\infty},$$ where h = Tδ is the delta impulse response. This paper is concerned with the question under which assumptions linear and time‐invariant time‐discrete systems T : l^∞ → l^∞ can be characterized by this formula. For this purpose we derive a convolution formula in a more general situation which also leads to a well‐known convolution formula in the time‐continuous case. Copyright © 1999 John Wiley & Sons, Ltd.     

Variational Formula for the Time Constant of First‐Passage Percolation

We consider first‐passage percolation with positive, stationary‐ergodic weights on the square lattice ?^d. Let T(x) be the first‐passage time from the origin to a point x in ?^d. The convergence of the scaled first‐passage time T([nx])/n to the time constant as n → ∞ can be viewed as a problem of homogenization for a discrete Hamilton‐Jacobi‐Bellman (HJB) equation. We derive an exact variational formula for the time constant and construct an explicit iteration that produces a minimizer of the variational formula (under a symmetry assumption). We explicitly identify when the iteration produces correctors.© 2016 Wiley Periodicals, Inc.     

A Lyapunov Lemma for Elliptic Systems

We study a possible extension to the infinite-dimensional case of the classicalLyapunov lemma for matrices. More precisely, for a fixed elliptic system A ofdifferential operators of order m, we consider the operator equationTA + A ^* T = Q, where Q is any given classical pseudodifferential system oforder m, and T is sought as a classical pseudodifferential system of order0.