Modelling ship operational reliability over a mission under regular inspections

A ship is required to operate for a fixed mission period. Should a critical item of equipment fail at sea, the ship is subject to a costly event with potentially high risk to ship and crew. Given warning of a pending defect, the ship can try to return to port under its own power and thus attempt to avoid an at sea failure. Defects which lead to a failure are detected by inspection, and the task is to select the appropriate frequency of inspection to balance the number of occasions that a ship fails at sea and the number of preventive inspection based returns to port during a mission to correct a defect. The modelling entails using the delay time concept. Expressions are established for the expected number of preventive and failure returns over a mission, and an example given of a cost based balance to select an optimal inspection period. Although addressing ship reliability, the model has relevance to the mission reliability of any repairable equipment with remote main repair facilities.     

Subspaces and quotients of Banach spaces with shrinking unconditional bases

The main result is that a separable Banach space with the weak* unconditional tree property is isomorphic to a subspace as well as a quotient of a Banach space with a shrinking unconditional basis. A consequence of this is that a Banach space is isomorphic to a subspace of a space with a shrinking unconditional basis if and only if it is isomorphic to a quotient of a space with a shrinking unconditional basis, which solves a problem dating to the 1970s. The proof of the main result also yields that a uniformly convex space with the unconditional tree property is isomorphic to a subspace as well as a quotient of a uniformly convex space with an unconditional finite dimensional decomposition.     

On Martingale Approximation of Adapted Processes

We show that the existence of a martingale approximation of a stationary process depends on the choice of the filtration. There exists a stationary linear process which has a martingale approximation with respect to the natural filtration, but no approximation with respect to a larger filtration with respect to which it is adapted and regular. There exists a stationary process adapted, regular, and having a martingale approximation with respect to a given filtration but not (regular and having a martingale approximation) with respect to the natural filtration.     

A Note On A Loaded Piezoelectric Transformer

Due to the coupling of mechanical and electrical quantities in a piezoceramic material, it is possible to transform a harmonic input voltage to a harmonic output voltage by using a piezoceramic transformer. The advantage of such a transformer is the avoidance of magnetic fields and the very simple assembly. The piezoelectric transformer considered here consists of several parts. Three brass and two piezoceramic rods, that are glued together. The purpose of the system is to transform a determined input voltage to a determined ouput voltage with a high efficiency. Therefore, one of the piezoceramics is excited harmonically with a frequency close to a resonance frequency of the system. According to the electromechanical coupling in piezoceramics, the transformer oscillates with the excitation frequency. Due to the piezoelectric effect an electric displacement or an electric voltage is generated between the electrodes of the second piezoceramic. The amplitude of the output voltage depends on the geometry and the load connected between the electrodes of the second piezoceramic. In this paper a theoretical model to determine the gain and input impedance for such a transformer is derived and the results are compared with experiments.     

On a Mathematical Comparison between Hierarchy and Network with a Classification of Coordination Structures

This paper proposes a mathematical model to compare a network organization with a hierarchical organization. In order to formulate the model, we define a three-dimensional framework of the coordination structure of a network and of other typical coordination structures. In the framework, we can define a network structure by contrasting it with a hierarchy, in terms of the distribution of decision making, which is one of the main features of information processing. Based on this definition, we have developed a mathematical model for evaluating coordination structures. Using this model, we can derive two boundary conditions among the coordination structures with respect to the optimal coordination structure. The boundary conditions help us to understand why an organization changes its coordination structure from a hierarchy to a network and what factors cause this change. They enable us, for example, to find points of structural change where the optimal coordination structure shifts from a hierarchy to a hierarchy with delegation or from a hierarchy with delegation to a network, when the nature of the task changes from routine to non-routine. In conclusion, our framework and model may provide a basis for discussing the processes that occur when coordination structures change between a hierarchy and a network.     

Linear facility location — Solving extensions of the basic problem

The basic problem is to locate a linear facility to minimize the sume of weighted shortest Euclidean distances from demand points to the facility. We extend the analysis to locating a constrained linear facility, a radial facility, a linear facility where distances are rectangular and a linear facility under the minimax criterion. Each case is shown to admit a simple solution technique.     

A parallel domain reduction method

We relate a particular version of a parallel multigrid method to a domain decomposition method, showing that the parallel multigrid method reduces computation to a small portion of the domain and then extends the solution to the entire domain using the correct reflections to get the exact solution. We extend a particular example to double the parallelism in a nonobvious manner. While the techniques of this paper are applied to twodimensional problems, they can be applied to higher dimensional problems in an obvious manner.     

On Testing for the Number of Components in a Mixed Poisson Model

Poisson mixtures are usually used to describe overdispersed data. Finite Poisson mixtures are used in many practical situations where often it is of interest to determine the number of components in the mixture. Identifying how many components comprise a mixture remains a difficult problem. The likelihood ratio test (LRT) is a general statistical procedure to use. Unfortunately, a number of specific problems arise and the classical theory fails to hold. In this paper a new procedure is proposed that is based on testing whether a new component can be added to a finite Poisson mixture which eventually leads to the number of components in the mixture. It is a sequential testing procedure based on the well known LRT that utilises a resampling technique to construct the distribution of the test statistic. The application of the procedure to real data reveals some interesting features of the distribution of the test statistic.     

Gaussian Curvature and Gyroscopes

We relate Gaussian curvature to the gyroscopic force, thus giving a mechanical interpretation of the former and a geometrical interpretation of the latter. We do so by considering the motion of a spinning disk constrained to be tangent to a curved surface. It is shown that the spin gives rise to a force on the disk that is equal to the magnetic force on a point charge moving in a magnetic field normal to the surface, of magnitude equal to the Gaussian curvature, and of charge equal to the disk's axial spin. In a special case, this demonstrates that the precession of Lagrange's top is due to the curvature of a sphere determined by the parameters of the top. © 2017 Wiley Periodicals, Inc.     

Integrated Shipment Dispatching and Packing Problems: a Case Study

In this paper we examine a consolidation and dispatching problem motivated by a multinational chemical company which has to decide routinely the best way of delivering a set of orders to its customers over a multi-day planning horizon. Every day the decision to be made includes order consolidation, vehicle dispatching as well as load packing into the vehicles. We develop a heuristic based on a cutting plane framework, in which a simplified Integer Linear Program (ILP) is solved to optimality. Since the ILP solution may correspond to a infeasible loading plan, a feasibility check is performed through a tailored heuristic for a three-dimensional bin packing problem with side constraints. If this test fails, a cut able to remove the infeasible solution is generated and added to the simplified ILP. Then the procedure is iterated. Computational results show that our procedure allows achieving remarkable cost savings.      

Koszul Bicomplexes and Generalized Koszul Complexes in Projective Dimension One

We describe Koszul type complexes associated with a linear map from any module to a free module, and vice versa with a linear map from a free module to an arbitrary module, generalizing the classical Koszul complexes. Given a short complex of finite free modules, we assemble these complexes to what we call Koszul bicomplexes. They are used in order to investigate the homology of the Koszul complexes in projective dimension one. As in the case of the classical Koszul complexes, this homology turns out to be grade sensitive. In a special setup, we obtain necessary conditions for a map of free modules to be lengthened to a short complex of free modules.     

Improving the computational efficiency of metric-based spares algorithms

We propose a new heuristic algorithm to improve the computational efficiency of the general class of Multi-Echelon Technique for Recoverable Item Control (METRIC) problems. The objective of a METRIC-based decision problem is to systematically determine the location and quantity of spares that either maximizes the operational availability of a system subject to a budget constraint or minimizes its cost subject to an operational availability target. This type of sparing analysis has proven essential when analyzing the sustainment policies of large-scale, complex repairable systems such as those prevalent in the defense and aerospace industries. Additionally, the frequency of these sparing studies has recently increased as the adoption of performance-based logistics (PBL) has increased. PBL represents a class of business strategies that converts the recurring cost associated with maintenance, repair, and overhaul (MRO) into cost avoidance streams. Central to a PBL contract is a requirement to perform a business case analysis (BCA) and central to a BCA is the frequent need to use METRIC-based approaches to evaluate how a supplier and customer will engage in a performance based logistics arrangement where spares decisions are critical. Due to the size and frequency of the problem there exists a need to improve the efficiency of the computationally intensive METRIC-based solutions. We develop and validate a practical algorithm for improving the computational efficiency of a METRIC-based approach. The accuracy and effectiveness of the proposed algorithm are analyzed through a numerical study. The algorithm shows a 94% improvement in computational efficiency while maintaining 99.9% accuracy.     

An exact algorithm to extend lifetime through roles allocation in sensor networks with connectivity constraints

We face the problem of scheduling optimally the activities in a wireless sensor network in order to ensure that, in each instant of time, the activated sensors can monitor all points of interest (targets) and route the collected information to a processing facility. Each sensor is allocated to a role, depending on whether it is actually used to monitor the targets, to forward information or kept idle, leading to different battery consumption ratios. We propose a column generation algorithm that embeds a highly efficient genetic metaheuristic for the subproblem. Moreover, to optimally solve the subproblem, we introduce a new formulation with fewer integer variables than a previous one proposed in the literature. Finally, we propose a stopping criterion to interrupt the optimal resolution of the subproblem as soon as a favorable solution is found. The results of our computational tests show that our algorithm consistently outperforms previous approaches in the literature, and also improves the best results known to date on some benchmark instances.     

Price coordination in distribution channels: A dynamic perspective

In this study, we investigate two important questions related to dynamic pricing in distribution channels: (i) Are coordinated pricing decisions efficient in a context where prices have carry-over effects on demand? (ii) Should firms practice a skimming or a penetration strategy if they choose to coordinate or to decentralize their activities? To answer these questions, we consider a differential game that takes place in a bilateral monopoly where the past retail prices paid by consumers contribute to the building of a reference price. The latter is used by consumers as a benchmark to evaluate the value of the product, and by firms to decide whether to adopt a skimming or a penetration strategy.     

Stochastic integration,trace and the skeleton of wiener functionals

It is shown that the notion of trace induced by a given complete orthonormal system relates the Skorohod integral with a corresponding Ogawa‐type integral evaluated with respect to the same orthonormal systems. Similarly the multiple Wiener‐Ito integral is shown to be related to a multiple Ogawa‐type integral induced by a complete orthonormal system via the Hu‐Meyer formula with suitably defined multiple traces. The notion of skeleton of a Wiener functional relative to a given orthonormal system is defined and yields what seems to be a “natural” extension of Wiener functionals to the Cameron Martin space and the Wiener processes with a different scale.     

Hopscotch method: The numerical solution of the Frank-Kamenetskii partial differential equation

Numerical solutions to the Frank-Kamenetskii partial differential equation modelling a thermal explosion in a cylindrical vessel are obtained using the hopscotch scheme. We observe that a nonlinear source term in the equation leads to numerical difficulty and hence adjust the scheme to accommodate such a term. Numerical solutions obtained via MATLAB, MATHEMATICA and the Crank-Nicolson implicit scheme are employed as a means of comparison. To gain insight into the accuracy of the hopscotch scheme the solution is compared to a power series solution obtained via the Lie group method. The numerical solution is also observed to converge to a well-known steady state solution. A linear stability analysis is performed to validate the stability of the results obtained.     

On the properties of orthorecursive expansions with respect to subspaces

In a Hilbert space, for orthorecursive expansions with respect to closed subspaces, we establish a criterion for expansions of elements of a certain finite-dimensional subspace with respect to a finite sequence of subspaces to coincide with the expanded elements. This implies a criterion for an element to be equal to its orthorecursive expansion with respect to a finite sequence of subspaces. We also obtain a number of results related to the best approximations of elements by partial sums of their orthorecursive expansions with respect to a sequence of finite-dimensional subspaces.     

Remarks on the asymptotic behavior of scalar auxiliary variable (SAV) schemes for gradient-like flows

We introduce a time semi-discretization of a damped wave equation by a SAV scheme with second order accuracy. The energy dissipation law is shown to hold without any restriction on the time step. We prove that any sequence generated by the scheme converges to a steady state (up to a subsequence). We notice that the steady state equation associated to the SAV scheme is a modified version of the steady state equation associated to the damped wave equation. We show that a similar result holds for a SAV fully discrete version of the Cahn-Hilliard equation and we compare numerically the two steady state equations.     

Perturbation singulière d'un problème de frottement sec non monotone

In this Note we deal with a singularly perturbed system constituted by a differential inclusion which has a unique solution for each value of the perturbation parameter. The associated degenerated problem, that corresponds to a dynamic dry friction problem, has many solutions. We show that perturbed problem solutions converge to a particular solution of the degenerated problem when the perturbation parameter goes to zero. The singular perturbation approach allows an analysis of a criterion used to select a solution of the degenerated problem, and suggests a method to study more elaborated dry friction problems.