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.     

Optimizing System Availability Under Minimal Repair with Non-Negligible Repair and Replacement Times

Availability measures are given for a repairable system under minimal repair with constant repair times. A new policy and an existing replacement policy for this type of system are discussed. Each involves replacement at the first failure after time T, with T representing total operating time in the existing model and total elapsed time (i.e. operating time + repair time) in the new model. Optimal values of T are found for both policies over a wide range of parameter values. These results indicate that the new and administratively easier policy produces only marginally smaller optimal availability values than the existing policy.     

Costing a Finite Minimal Repair Replacement Policy

In this paper an integral equation technique is used to evaluate the expected cost for the period (0, t] of a policy involving minimal repair at failure with replacement after N failures. This cost function provides an appropriate criterion to determine the optimal replacement number N* for a system required for use over a finite time horizon. In an example, it is shown that significant cost savings can be achieved using N* from the new finite time horizon model rather than the value predicted by the usual asymptotic model.     

The 〈G<Emphasis Type="Italic">/M/r/</Emphasis>FIFO〉 Machine-Interference Model with State-Dependent Speeds

This article treats a version of the multiple machine-interference problem with r operatives under FIFO repair discipline. The running times of machine i are supposed to be identically and arbitrarily distributed random variables with density function f _i (x), i = 1,…, n. The repair times of all machines are assumed to be identically and exponentially distributed random variables with mean 1/μ. The paper provides the main steady-state operational characteristics of the system when the running and repair speeds are dependent on the number of machines in working order.     

Packing circles in the smallest circle: an adaptive hybrid algorithm

The circular packing problem (CPP) consists of packing n circles C _i of known radii r _i , i∈N={1,?…,?n}, into the smallest containing circle ?. The objective is to determine the coordinates (x _i ,?y _i ) of the centre of C _i , i∈N, as well as the radius r and centre (x,?y) of ?. CPP, which is a variant of the two-dimensional open-dimension problem, is NP hard. This paper presents an adaptive algorithm that incorporates nested partitioning within a tabu search and applies some diversification strategies to obtain a (near) global optimum. The tabu search is to identify the n circles’ ordering, whereas the nested partitioning is to determine the n circles’ positions that yield the smallest r. The computational results show the efficiency of the proposed algorithm.     

Generalized competition index of primitive digraphs

For any positive integers k and m, the k-step m-competition graph C _m ^k (D) of a digraph D has the same set of vertices as D and there is an edge between vertices x and y if and only if there are distinct m vertices v₁, v₂, · · ·, v _m in D such that there are directed walks of length k from x to v _i and from y to v _i for all 1 ≤ i ≤ m. The m-competition index of a primitive digraph D is the smallest positive integer k such that C _m ^k (D) is a complete graph. In this paper, we obtained some sharp upper bounds for the m-competition indices of various classes of primitive digraphs.     

Regular variation of a random length sequence of random variables and application to risk assessment

When assessing risks on a finite-time horizon, the problem can often be reduced to the study of a random sequence C(N) = (C ₁,…,C _N ) of random length N, where C(N) comes from the product of a matrix A(N) of random size N × N and a random sequence X(N) of random length N. Our aim is to build a regular variation framework for such random sequences of random length, to study their spectral properties and, subsequently, to develop risk measures. In several applications, many risk indicators can be expressed from the extremal behavior of ∥C(N)∥, for some norm ∥?∥. We propose a generalization of Breiman’s Lemma that gives way to a tail estimate of ∥C(N)∥ and provides risk indicators such as the ruin probability and the tail index for Shot Noise Processes on a finite-time horizon. Lastly, we apply our main result to a model used in dietary risk assessment and in non-life insurance mathematics to illustrate the applicability of our method.     

Isotopes of the alternative monster and the Skosyrsky algebra

We prove that the isotopes of the alternative monster and the Skosyrsky algebra satisfy the identity П_i=1⁴ [x_i, y_i] = 0. Hence, the algebras themselves satisfy the identity П_i=1⁴ (c, x_i, y_i) = 0. We also show that none of the identities П_i=1ⁿ(c, x_i, y_i) = 0 holds in all commutative alternative nil-algebras of index 3. Thus, we refute the Grishkov–Shestakov hypothesis about the structure of the free finitely generated commutative alternative nil-algebras of index 3.     

Annihilating and power-commuting generalized skew derivations on lie ideals in prime rings

Let R be a prime ring of characteristic different from 2 and 3, Q_r its right Martindale quotient ring, C its extended centroid, L a non-central Lie ideal of R and n ≥ 1 a fixed positive integer. Let α be an automorphism of the ring R. An additive map D: R → R is called an α-derivation (or a skew derivation) on R if D(xy) = D(x)y + α(x)D(y) for all x, y ∈ R. An additive mapping F: R → R is called a generalized α-derivation (or a generalized skew derivation) on R if there exists a skew derivation D on R such that F(xy) = F(x)y + α(x)D(y) for all x, y ∈ R.     

Repair Replacement Modelling over Finite Time Horizons

In this paper an integral equation approach is given for evaluating the expected cost of repair replacement policies over finite time horizons. An asymptotic estimate of this expected cost is also obtained. The policy involving imperfect repair on failure with replacement after N failures is taken as an illustrative example and optimal policies N* are found for both infinite and finite time horizons of use.     

Baum-Bott indices for curves of singularities

Let F be a holomorphic foliation on Pⁿ by curves such that the components of its singular locus are curves C_i and points p_j. We compute the Baum-Bott indices BB_φ(F, C_i) in terms of the main invariants of F and C_i. We also determine the sum of the BB_φ(F, p_i) in terms of the same invariants.When φ corresponds to the determinant, the latter result generalizes, from special to all holomorphic foliations, a formula for the number of isolated singularities of F, counted with multiplicities.     

BTTB preconditioners for BTTB systems

In this paper, we consider solving the BTTB system \({\cal T}_{m,n}[f] {\bf{x}} = {\bf{b}}\) by the preconditioned conjugate gradient (PCG) method, where \({\cal T}_{m,n}[f]\) denotes the m × m block Toeplitz matrix with n × n Toeplitz blocks (BTTB) generated by a (2π, 2π)-periodic continuous function f(x, y). We propose using the BTTB matrix \({\cal T}_{m,n}[1/f]\) to precondition the BTTB system and prove that only O(m)?+?O(n) eigenvalues of the preconditioned matrix \({\cal T}_{m,n}[1/f] {\cal T}_{m,n}[f]\) are not around 1 under the condition that f(x, y)?>?0. We then approximate 1/f(x, y) by a bivariate trigonometric polynomial, which can be obtained in O(m n log(m n)) operations by using the fast Fourier transform technique. Numerical results show that our BTTB preconditioner is more efficient than block circulant preconditioners.     

On the strong Brillinger-mixing property of α-determinantal point processes and some applications

First, we derive a representation formula for all cumulant density functions in terms of the non-negative definite kernel function C(x, y) defining an α-determinantal point process (DPP). Assuming absolute integrability of the function C₀(x) = C(o, x), we show that a stationary α-DPP with kernel function C₀(x) is “strongly” Brillinger-mixing, implying, among others, that its tail-σ-field is trivial. Second, we use this mixing property to prove rates of normal convergence for shot-noise processes and sketch some applications to statistical second-order analysis of α-DPPs.     

On nonregular ideals and <Emphasis Type="Italic">z</Emphasis>°-ideals in <Emphasis Type="Italic">C</Emphasis>(<Emphasis Type="Italic">X</Emphasis>)

The spaces X in which every prime z°-ideal of C(X) is either minimal or maximal are characterized. By this characterization, it turns out that for a large class of topological spaces X, such as metric spaces, basically disconnected spaces and one-point compactifications of discrete spaces, every prime z°-ideal in C(X) is either minimal or maximal. We will also answer the following questions: When is every nonregular prime ideal in C(X) a z°-ideal? When is every nonregular (prime) z-ideal in C(X) a z°-ideal? For instance, we show that every nonregular prime ideal of C(X) is a z°-ideal if and only if X is a ?-space (a space in which the boundary of any zeroset is contained in a zeroset with empty interior).     

On the gonality sequence of smooth curves

Let C be a smooth curve of genus g. For each positive integer r the r-gonality d _r (C) of C is the minimal integer t such that there is \({L\in {\rm Pic}^t(C)}\) with h ⁰(C, L) = r + 1. Here we use nodal plane curves to construct several smooth curves C with d ₂(C)/2 < d ₃(C)/3, i.e., for which a slope inequality fails.     

On the additive complexity of GCD and LCM matrices

In the paper, the additive complexity of matrices formed by positive integer powers of greatest common divisors and least common multiples of the indices of the rows and columns is considered. It is proved that the complexity of the n × n matrix formed by the numbers GCD^r(i, k) over the basis {x + y} is asymptotically equal to rn log²n as n→∞, and the complexity of the n × n matrix formed by the numbers LCM^r(i, k) over the basis {x + y,?x} is asymptotically equal to 2rn log₂n as n→∞.     

Parallelogram-free distance-regular graphs having completely regular strongly regular subgraphs

Let Γ=(X,R) be a distance-regular graph of diameter d. A parallelogram of length i is a 4-tuple xyzw consisting of vertices of Γ such that ?(x,y)=?(z,w)=1, ?(x,z)=i, and ?(x,w)=?(y,w)=?(y,z)=i?1. A subset Y of X is said to be a completely regular code if the numbers

$\pi_{i,j}=|\Gamma_{j}(x)\cap Y|\quad (i,j\in \{0,1,\ldots,d\})$

depend only on i=?(x,Y) and j. A subset Y of X is said to be strongly closed if

$\{x\mid \partial(u,x)\leq \partial(u,v),\partial(v,x)=1\}\subset Y,\mbox{ whenever }u,v\in Y.$

Hamming graphs and dual polar graphs have strongly closed completely regular codes. In this paper, we study parallelogram-free distance-regular graphs having strongly closed completely regular codes. Let Γ be a parallelogram-free distance-regular graph of diameter d≥4 such that every strongly closed subgraph of diameter two is completely regular. We show that Γ has a strongly closed subgraph of diameter d?1 isomorphic to a Hamming graph or a dual polar graph. Moreover if the covering radius of the strongly closed subgraph of diameter two is d?2, Γ itself is isomorphic to a Hamming graph or a dual polar graph. We also give an algebraic characterization of the case when the covering radius is d?2.

     

Stability of Cubic and Quartic Functional Equations in Non-Archimedean Spaces

We prove generalized Hyers-Ulam–Rassias stability of the cubic functional equation f(kx+y)+f(kx?y)=k[f(x+y)+f(x?y)]+2(k ³?k)f(x) for all \(k\in \Bbb{N}\) and the quartic functional equation f(kx+y)+f(kx?y)=k ²[f(x+y)+f(x?y)]+2k ²(k ²?1)f(x)?2(k ²?1)f(y) for all \(k\in \Bbb{N}\) in non-Archimedean normed spaces.     

Banach–Stone Theorems for maps preserving common zeros

Let X and Y be completely regular spaces and E and F be Hausdorff topological vector spaces. We call a linear map T from a subspace of C(X, E) into C(Y, F) a Banach–Stone map if it has the form T f (y) =  S _y (f (h(y))) for a family of linear operators S _y : E → F, \({y \in Y}\) , and a function h: Y → X. In this paper, we consider maps having the property:

$\bigcap^{k}_{i=1}Z(f_{i}) \neq\emptyset \iff \bigcap^{k}_{i=1}Z(Tf_{i})\neq\emptyset , \quad({\rm Z}) $

where Z(f) =  {f =  0}. We characterize linear bijections with property (Z) between spaces of continuous functions, respectively, spaces of differentiable functions (including C ^∞), as Banach–Stone maps. In particular, we confirm a conjecture of Ercan and Önal: Suppose that X and Y are realcompact spaces and E and F are Hausdorff topological vector lattices (respectively, C ^*-algebras). Let T: C(X, E) → C(Y, F) be a vector lattice isomorphism (respectively, *-algebra isomorphism) such that

$ Z(f) \neq\emptyset\iff Z(Tf) \neq\emptyset. $

Then X is homeomorphic to Y and E is lattice isomorphic (respectively, C ^*-isomorphic) to F. Some results concerning the continuity of T are also obtained.

     

On the approximation of continuous functions of two variables

It is shown that if P _m ^α,β (x) (α, β > ?1, m = 0, 1, 2, …) are the classical Jaboci polynomials, then the system of polynomials of two variables {Ψ _mn ^α,β (x, y)} _m,n=0 ^r = {P _m ^α,β (x)P _n ^α,β (y)} _{m, n=0} ^r (r = m + n ≤ N ? 1) is an orthogonal system on the set Ω _N×N = ?ub;(x _i , y _i ) _i,j=0 ^N , where x _i and y _i are the zeros of the Jacobi polynomial P _n ^α,β (x). Given an arbitrary continuous function f(x, y) on the square [?1, 1]², we construct the discrete partial Fourier-Jacobi sums of the rectangular type S _{m, n, N} ^α,β (f; x, y) by the orthogonal system introduced above. We prove that the order of the Lebesgue constants ∥S _{m, n, N} ^α,β ∥ of the discrete sums S _{m, n, N} ^α,β (f; x, y) for ?1/2 < α, β < 1/2, m + n ≤ N ? 1 is O((mn) ^{q + 1/2}), where q = max?ub;α,β?ub;. As a consequence of this result, several approximate properties of the discrete sums S _{m, n, N} ^α,β (f; x, y) are considered.