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.     

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 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.     

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.     

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.     

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.     

年龄点t0之后的NBU性的非参数检验方法

NBU＊t0寿命分布中新元件的寿命随机地大于旧的年龄不小于t0的元件的剩余寿命,这为更广泛地模拟元件的老化和劣化现象提供了丰富的内容。本文首先对那些t0年龄点之后剩余寿命随机等于新元件寿命的元件的结构加以刻画,然后建立了一个非参数检验方法以区分这种随机等价性和t0年龄点后的严格的NBU性,并给出了针对一个NBU＊t0但非NBU的寿命分布的例子的数值模拟结果。     

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.     

Method of successive projections for finding a common point of sets in metric spaces

Many problems in applied mathematics can be abstracted into finding a common point of a finite collection of sets. If all the sets are closed and convex in a Hilbert space, the method of successive projections (MOSP) has been shown to converge to a solution point, i.e., a point in the intersection of the sets. These assumptions are however not suitable for a broad class of problems. In this paper, we generalize the MOSP to collections of approximately compact sets in metric spaces. We first define a sequence of successive projections (SOSP) in such a context and then proceed to establish conditions for the convergence of a SOSP to a solution point. Finally, we demonstrate an application of the method to digital signal restoration.     

A class of Iteration functions for improving,simultaneously, approximations to the zeros of a polynomial

Approximations to all the zeros of a polynomial may be used to find a better approximation to one of the zeros. Using this fact, we present a simple approach to the derivation of a class of Iteration Functions for simultaneously improving approximations to zeros of a polynomial. Convergence properties are studied and computational results are included.     

Analytical existence of solutions to a system of nonlinear equations with application

We study the existence of analytical solutions to a system of nonlinear equations under constraints linked to the analysis of a road safety measure without computing second derivatives. We formally demonstrate this existence of solutions by applying a matrix inversion principle through Schur complement to a subsystem of equations derived from the main system. The analytical results thus obtained are used to construct a simple iterative procedure to look for optimal solutions as well as an initial solution adapted to data of each case study. We illustrate our results with simulated accident data obtained from the setting-up of a road safety measure. The numerical solutions thus obtained are then compared to those given through a classic Newton-Raphson type approach directly applied to the main system.     

A priori orienteering with time windows and stochastic wait times at customers

In the pharmaceutical industry, sales representatives visit doctors to inform them of their products and encourage them to become an active prescriber. On a daily basis, pharmaceutical sales representatives must decide which doctors to visit and the order to visit them. This situation motivates a problem we more generally refer to as a stochastic orienteering problem with time windows (SOPTW), in which a time window is associated with each customer and an uncertain wait time at a customer results from a queue of competing sales representatives. We develop a priori routes with the objective of maximizing expected sales. We operationalize the sales representative’s execution of the a priori route with relevant recourse actions and derive an analytical formula to compute the expected sales from an a priori tour. We tailor a variable neighborhood search heuristic to solve the problem. We demonstrate the value of modeling uncertainty by comparing the solutions to our model to solutions of a deterministic version using expected values of the associated random variables. We also compute an empirical upper bound on our solutions by solving deterministic instances corresponding to perfect information.     

Transverse curves and chain curvature in the Heisenberg group

A chain is the intersection of a complex totally geodesic subspace in complex hyperbolic 2-space with the boundary. The boundary admits a canonical contact structure, and chains are distiguished curves transverse to this structure. The space of chains is analyzed both as a quotient of the contact bundle, and as a subset of ℂP². The space of chains admits a canonical, indefinite Hermitian metric, and curves in the space of chains with null tangent vectors are shown to correspond to a path of chains tangent to a curve in the boundary transverse to the contact structure. A family of local differential chain curvature operators are introduced which exactly characterize when a transverse curve is a chain. In particular, operators that are invariant under the stabilizer of a point in the interior of complex hyperbolic space, or a point on the boundary, are developed in detail. Finally, these chain curvature operators are used to prove a generalization of Louiville's theorem: a sufficiently smooth mapping from the boundary of complex hyperbolic 2-space to itself which preserves chains must be the restriction of a global automorphism.     

On nonlinear cross-diffusion systems: an optimal transport approach

We study a nonlinear, degenerate cross-diffusion model which involves two densities with two different drift velocities. A general framework is introduced based on its gradient flow structure in Wasserstein space to derive a notion of discrete-time solutions. Its continuum limit, due to the possible mixing of the densities, only solves a weaker version of the original system. In one space dimension, we find a stable initial configuration which allows the densities to be segregated. This leads to the evolution of a stable interface between the two densities, and to a stronger convergence result to the continuum limit. In particular derivation of a standard weak solution to the system is available. We also study the incompressible limit of the system, which addresses transport under a height constraint on the total density. In one space dimension we show that the problem leads to a two-phase Hele-Shaw type flow.     

Kato Space for Dirichlet Forms

We study the space of Kato measures relative to a Dirichlet form and we prove that a local solution of a problem relative to a Kato measure is locally continuous. Moreover if the measure of an intrinsic ball is equivalent to a power of the radius we prove also that the density of the form relative to a local solution is locally a Kato measure.     

A decision model for supplier selection in the presence of dual-role factors

Best suppliers help manufacturers to gain and sustain a competitive advantage by improving product quality, reducing cost, shortening lead-time and so on. The crucial role played by suppliers in a supply chain renders the selection of a supplier or suppliers a significant work that attracts the attention of both researchers and practitioners. In the literature, data envelopment analysis (DEA) as a nonparametric technique is often applied to conduct a performance analysis. Little attention, however, has been paid to dual-role factors in the supplier selection process. This paper proposes a novel two-step approach to select suppliers in the presence of dual-role factors. As a combination of DEA and two-person zero-sum game theory, our work considers the strategic behaviour of the external environment and is able to handle the supplier selection in a competitive environment. Moreover, the proposed model circumvents the requirement to specify the status of a dual-role factor ahead of an evaluation and is easy to solve. Finally, the applicability of the procedure is illustrated by an application to a data set of 18 suppliers.     

An ergodic measure on a locally convex topological vector space

The aim of this paper is to give a way to construct a probability measure with nice ergodic properties on a locally convex topological vector space. We have two motivations; one is to give a generalization of a Gaussian measure and the other is to give an example of a probability measure with a rich kernel space.     

Spectra of Toeplitz Operators and Compositions of Muckenhoupt Weights with Blaschke Products

We discuss the optimality of a sufficient condition from [12] for a point to belong to the essential spectrum of a Toeplitz operator with a bounded measurable coefficient. Our approach is based on a new sufficient condition for a composition of a Muckenhoupt weight with a Blaschke product to belong to the same Muckenhoupt class. The first author was partially supported by CONACYT project U46936-F, Mexico.