A Generalized Block Replacement Policy with Minimal Repair and General Random Repair Costs for a Multi-unit System

A generalization of the block replacement policy (BRP) is proposed and analysed for a multi-unit system which has the specific multivariate distribution. Under such a policy an operating system is preventively replaced at times kT (k = 1, 2, 3,...), as in the ordinary BRP, and the replacement of the failed system at failure is not mandatory; instead, a minimal repair to the component of the system can be made. The choice of these two possible actions is based on some random mechanism which is age-dependent. The cost of the ith minimal repair of the component at age y depends on the random part C(y) and the deterministic part C_i(y). The aim of the paper is to find the optimal block interval T which minimizes the long-run expected cost per unit time of the policy.     

Nonparametric adaptive opportunity-based age replacement strategies

We consider opportunity-based age replacement (OAR) using nonparametric predictive inference (NPI) for the time to failure of a future unit. Based on n observed failure times, NPI provides lower and upper bounds for the survival function for the time to failure X_n+1 of a future unit which lead to upper and lower cost functions, respectively, for OAR based on the renewal reward theorem. Optimal OAR strategies for unit n+1 follow by minimizing these cost functions. Following this strategy, unit n+1 is correctively replaced upon failure, or preventively replaced upon the first opportunity after the optimal OAR threshold. We study the effect of this replacement information for unit n+1 on the optimal OAR strategy for unit n+2. We illustrate our method with examples and a simulation study. Our method is fully adaptive to available data, providing an alternative to the classical approach where the probability distribution of a unit's time to failure is assumed to be known. We discuss the possible use of our method and compare it with the classical approach, where we conclude that in most situations our adaptive method performs very well, but that counter-intuitive results can occur.     

Continuous and Discrete Age-Replacement Policies

This paper considers the combined continuous and discrete age-replacement policies when units deteriorate with age and use: a unit is replaced preventively before failure at time T of age or at number N of uses, whichever occurs first. The expected cost rate C (T,N) is derived, and both optimum time T* and number N* to minimize C (T,N) are discussed. There exist finite and unique T* and N* when the use occurs in a Poisson process under suitable conditions.     

A Combined Block and Repair Limit Replacement Policy

This paper considers a combined block and repair limit replacement policy. The policy is defined as follows:

• (i) The unit is replaced preventively at times kT(k=1, 2…
• (ii) For failures in [(k - 1)T, kT) the unit undergoes minimal repair if the estimated repair cost is less than x. Otherwise it is replaced by a new one.

The optimal policy is to select T* and x* to minimize the expected cost per unit time for an infinite time span. A numerical example is given to illustrate the method.     

Group analysis of the one-dimensional boltzmann equation: II. Equivalence groups and symmetry groups in the special case

We obtain relations that define the equivalence algebra of the family of one-dimensional Boltzmann equations f _t + cf _x + F(t, x, c)f _c = 0 and show that all equations of that form are locally equivalent. We carry out the group classification of the equation with respect to the function F in the special case where the function F and the transformations of the variables t and x are assumed to be independent of c. We show that, under such constraints for the transformation and the family of equations, the maximum possible symmetry algebra is eight-dimensional, which corresponds to an equation with a linear function F.     

On Riesz means of the coefficients of spinor zeta functions in genus two

Let F be a Siegel cusp form of integral weight k on the Siegel modular group Sp ₂(?) of genus 2. The Fourier coefficients of the spinor zeta function Z _F (s) are denoted by c _n . Let D _ρ (x;Z _F ) be the Riesz mean of c _n . In this paper, we obtain the truncated Voronoï-type formula of D _ρ (x;Z _F ) under the Ramanujan–Petersson conjecture.     

Condition monitoring: a new perspective

We present a novel approach to support preventive replacement decisions based on condition monitoring. It is assumed that the condition of a technical unit is measured continuously, with the measurement indicating in which of k≥2 states the unit is. A new unit is in state S₁, and failure occurs the moment a unit leaves state S _k . A unit will only go from state S _j to state S_j+1, and these immediately observed transitions occur at random times. At such transition moments a decision is required on preventive replacement of the unit, which would require preparation time. Such a decision needs to be based on inferences about the total residual time till failure. We present a method for such inferences that relies on minimal model assumptions added to data on state transitions. We illustrate the approach via simulated examples, and discuss possible use of the method and related aspects.     

Some Numerical Data for Single-Server Queues Involving Deterministic Input Arrangements

The steady-state parameters of the bulk input queue D _c /M/1 and the Erlang service queue D/E _c /1 have been tabulated for C = 1(1)6(2)12(4)20 and 25, 50 and 100 and for ρ = 0·1(0·1)0·9. The tabulation includes the mean waiting time, idle time and queue size. In addition the queue D/E _c /1 has been compared with the queue M/E _c /1 to indicate the gains to be achieved by regularizing the arrival mechanism for a given E _c service facility.     

Phase transition for SIR model with random transition rates on complete graphs

We are concerned with the susceptible-infective-removed (SIR) model with random transition rates on complete graphs C _n with n vertices. We assign independent and identically distributed (i.i.d.) copies of a positive random variable ξ on each vertex as the recovery rates and i.i.d. copies of a positive random variable ρ on each edge as the edge infection weights. We assume that a susceptible vertex is infected by an infective one at rate proportional to the edge weight on the edge connecting these two vertices while an infective vertex becomes removed with rate equals the recovery rate on it, then we show that the model performs the following phase transition when at t = 0 one vertex is infective and others are susceptible. There exists λ _c > 0 such that when λ < λ _c ; the proportion r∞ of vertices which have ever been infective converges to 0 weakly as n → +∞ while when λ > λ _c ; there exist c(λ) > 0 and b(λ) > 0 such that for each n ≥ 1 with probability p ≥ b(λ); the proportion r_∞ ≥ c(λ): Furthermore, we prove that λ _c is the inverse of the production of the mean of ρ and the mean of the inverse of ξ.     

On Dark Computably Enumerable Equivalence Relations

We study computably enumerable (c.e.) relations on the set of naturals. A binary relation R on ω is computably reducible to a relation S (which is denoted by R ≤ _c S) if there exists a computable function f(x) such that the conditions (xRy) and (f(x)Sf(y)) are equivalent for all x and y. An equivalence relation E is called dark if it is incomparable with respect to ≤ _c with the identity equivalence relation. We prove that, for every dark c.e. equivalence relation E there exists a weakly precomplete dark c.e. relation F such that E ≤ _c F. As a consequence of this result, we construct an infinite increasing ≤ _c -chain of weakly precomplete dark c.e. equivalence relations. We also show the existence of a universal c.e. linear order with respect to ≤ _c .     

Degeneracy of holomorphic curves in surfaces

LetX be a complex projective algebraic manifold of dimension 2 and let D₁, ..., D_u be distinct irreducible divisors onX such that no three of them share a common point. Let\(f:{\mathbb{C}} \to X\backslash ( \cup _{1 \leqslant i \leqslant u} D_i )\) be a holomorphic map. Assume thatu ? 4 and that there exist positive integers n₁, ... ,n_u,c such that n_in_J D _i.D_j) =c for all pairsi,j. Thenf is algebraically degenerate, i.e. its image is contained in an algebraic curve onX.     

On <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings of nearly bipartite graphs

Let G be a simple graph, let d(v) denote the degree of a vertex v and let g be a nonnegative integer function on V (G) with 0 ≤ g(v) ≤ d(v) for each vertex v ∈ V (G). A g _c -coloring of G is an edge coloring such that for each vertex v ∈ V (G) and each color c, there are at least g(v) edges colored c incident with v. The g _c -chromatic index of G, denoted by χ′g _c (G), is the maximum number of colors such that a gc-coloring of G exists. Any simple graph G has the g _c -chromatic index equal to δ _g (G) or δ _g (G) ? 1, where \({\delta _g}\left( G \right) = \mathop {\min }\limits_{v \in V\left( G \right)} \left\lfloor {d\left( v \right)/g\left( v \right)} \right\rfloor \). A graph G is nearly bipartite, if G is not bipartite, but there is a vertex u ∈ V (G) such that G ? u is a bipartite graph. We give some new sufficient conditions for a nearly bipartite graph G to have χ′g _c (G) = δ _g (G). Our results generalize some previous results due to Wang et al. in 2006 and Li and Liu in 2011.     

Holomorphic mappings of once-holed tori

Let T be the space of marked once-holed tori and Y₀ be a Riemann surface with marked handle. We investigate geometric properties of the set T_a[Y₀] of X ∈ T that allow holomorphic mappings of X into Y₀. We also examine the set T_c[Y₀] of marked once-holed tori conformally embedded into Y₀. It turns out that T_a[Y₀] and T_c[Y₀] have several properties in common. Our basic tool is a new notion, called a handle condition.     

A REALIZATION OF CERTAIN MODULES FOR THE <Emphasis Type="Italic">N</Emphasis> = 4 SUPERCONFORMAL ALGEBRA AND THE AFFINE LIE ALGEBRA <Emphasis Type="Italic">A</Emphasis><Stack><Subscript>2</Subscript><Superscript>(1)</Superscript></Stack>

We shall first present an explicit realization of the simple N = 4 superconformal vertex algebra L _c ^N?=?4 with central charge c = ?9. This vertex superalgebra is realized inside of the bcβγ system and contains a subalgebra isomorphic to the simple affine vertex algebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). Then we construct a functor from the category of L _c ^N?=?4 -modules with c = ?9 to the category of modules for the admissible affine vertex algebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). By using this construction we construct a family of weight and logarithmic modules for L _c ^N?=?4 and L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \). We also show that a coset subalgebra L _A1 \( \left(-\frac{3}{2}{\varLambda}_0\right) \) is a logarithmic extension of the W(2; 3)-algebra with c = ?10. We discuss some generalizations of our construction based on the extension of affine vertex algebra L _A1 (kΛ ₀) such that k + 2 = 1/p and p is a positive integer.     

Degeneration of the Hilbert pairing in formal groups over local fields

For an arbitrary local field K (a finite extension of the field Q_p) and an arbitrary formal group law F over K, we consider an analog c_F of the classical Hilbert pairing. A theorem by S.V. Vostokov and I.B. Fesenko says that if the pairing c_F has a certain fundamental symbol property for all Lubin–Tate formal groups, then c_F = 0. We generalize the theorem of Vostokov–Fesenko to a wider class of formal groups. Our first result concerns formal groups that are defined over the ring O_K of integers of K and have a fixed ring O₀ of endomorphisms, where O₀ is a subring of O_K. We prove that if the symbol c_F has the above-mentioned symbol property, then c_F = 0. Our second result strengthens the first one in the case of Honda formal groups. The paper consists of three sections. After a short introduction in Section 1, we recall basic definitions and facts concerning formal group laws in Section 2. In Section 3, we state and prove two main results of the paper (Theorems 1 and 2). Refs. 8.     

Tool replacement policy for one-sided processes with low fraction defective

In most manufacturing industries, tool replacement policy is essential for minimizing the fraction defective and the manufacturing cost. Tool wear is caused by the action of sliding chips in the shear zone, and the friction generated between the tool flank and workpiece. This wear, apparently, is a dominant and irremovable component of variability in many machining processes, which is a systematic assignable cause. As the tool wear occurs in the machining processes, the fraction of defectives would gradually become significant. When the fraction defective reaches a certain level, the tool must be replaced. Therefore, detecting suitable time for tool replacement operation becomes essential. In this paper, we present an analytical approach for unilateral processes based on the one-sided process capability index C _PU (or C _PL ) to find the appropriate time for tool replacement. Accurate process capability must be calculated, particularly, when the data contains assignable cause variation. By calculating the index C _PU (or C _PL ) in a dynamical environment, we propose estimators of C _PU (or C _PL ) and obtain exact form of the sampling distribution in the presence of systematic assignable cause. The proposed procedure is then applied to a real manufacturing process involving tool wear problem, to demonstrate the applicability of the proposed approach.     

Some class 1 graphs on <Emphasis Type="Italic">g</Emphasis><Subscript><Emphasis Type="Italic">c</Emphasis></Subscript>-colorings

An edge-coloring of a graph G is an assignment of colors to all the edges of G. A g _c -coloring of a graph G is an edge-coloring of G such that each color appears at each vertex at least g(v) times. The maximum integer k such that G has a g _c -coloring with k colors is called the g _c -chromatic index of G and denoted by \(\chi\prime_{g_{c}}\)(G). In this paper, we extend a result on edge-covering coloring of Zhang and Liu in 2011, and give a new sufficient condition for a simple graph G to satisfy \(\chi\prime_{g_{c}}\)(G) = δ _g (G), where \(\delta_{g}\left(G\right) = min_{v\epsilon V (G)}\left\{\lfloor\frac{d\left(v\right)}{g\left(v\right)}\rfloor\right\}\).     

Analysis of algorithms for an online version of the convoy movement problem

In the convoy movement problem (CMP), a set of convoys must be routed from specified origins to destinations in a transportation network, represented by an undirected graph. Two convoys may not cross each other on the same edge while travelling in opposing directions, a restriction referred to as blocking. However, convoys are permitted to follow each other on the same edge, with a specified headway separating them, but no overtaking is permitted. Further, the convoys to be routed are distinguished based on their length. Particle convoys have zero length and are permitted to traverse an edge simultaneously, whereas convoys with non-zero length have to follow each other, observing a headway. The objective is to minimize the total time taken by convoys to travel from their origins to their destinations, given the travel constraints on the edges. We consider an online version of the CMP where convoy demands arise dynamically over time. For the special case of particle convoys, we present an algorithm that has a competitive ratio of 3 in the worst case and (5/2) on average. For the particle convoy problem, we also present an alternate, randomized algorithm that provides a competitive ratio of (√13?1). We then extend the results to the case of convoys with length, which leads to an algorithm with an O(T+CL) competitive ratio, where T={Max _e t(e)}/{Min _e t(e)}, C is the maximum congestion (the number of distinct convoy origin–destination pairs that use any edge e) and L={Max _c L(c)}/{Min _c L(c)}; here L(c)>0 represents the time-headway to be observed by any convoy that follows c and t(e) represents the travel time for a convoy c on edge e.     

Almost Empty Monochromatic Quadrilaterals in Planar Point Sets

For positive integers c, s ≥ 1, r ≥ 3, let W _r (c, s) be the least integer such that if a set of at least W _r (c, s) points in the plane, no three of which are collinear, is colored with c colors, then this set contains a monochromatic r-gon with at most s interior points. As is known, if r = 3, then W _r (c, s)=W _r (c, s). In this paper, we extend these results to the case r = 4. We prove that W4(2, 1) = 11, W4(3, 2) ≤ 120, and the least integer μ4(c) such that W4(c, μ4(c)) < ∞ is bounded by \(\left\lfloor {\frac{{c - 1}}{2}} \right\rfloor \cdot 2 \leqslant \mu 4\left( c \right) \leqslant 2c - 3\),where c ≥ 2.