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.     

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.     

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.     

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.     

A note on the allocation of queuing facilities using a minisum criterion

This paper suggests a formulation and a solution procedure for resource allocation problems which consider a central planner, m static queuing facilities providing a homogeneous service at their locations, and a known set of demand points or customers. It is assumed that upon a request for service the customer is routed to a facility by a probabilistic assignment. The objective is to determine how to allocate a limited number of servers to the facilities, and to specify demand rates from customers to facilities in order to minimize a weighted sum of response times. This sum measures the total time lost in the system due to two sources: travel time from customer to facility locations and waiting time for service at the facilities. The setting does not allow for cooperation between the facilities.     

A Banach algebra of generalized functions

An algebraic isomorphism from a convolution algebra of Laplace transformable functions with support on the half-line to a complete discrete normed convolution algebra of sequences is used to construct generalized functions. The extension of this function-to-sequence map to a commutative Banach algebra of generalized functions is shown to be a Banach algebra isomorphism which can be utilized to establish a discrete formulation of a Mikusiński-type operational calculus and to construct algorithms for the numerical solution of half-line convolution equations.     

The existence of monotonic solutions of a nonlinear car-following equation

A leader-follower pair of cars whose motion is subject to a nonlinear car-following equation are travelling with the same positive constant velocity when the leader begins to change his velocity in a monotonic way to a different non-negative value. Conditions are found for the headway between leader and follower to tend monotonically to a positive value. The results are extended to a system of a leader and two followers.     

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.     

Constructing a mathematical definition: the case of the tangent

We analyze the process of constructing a definition within the theoretical framework of Abstraction in Context. Pairs of students were engaged in a task designed to engender a need for a definition of a tangent to a graph at a given point, and lead to constructing a definition following that need. The results of our analysis point to two characteristics of the process of constructing a definition: a. Constructing the concept does not necessarily include constructing its definition; in particular, students were able to use the concept before constructing its definition. b. Students’ language becomes more precise during the constructing process, not only as a characteristic of the process but also as a means of promoting the process.     

A Study on Abnormality in Variational and Optimal Control Problems

In this paper, a variational problem is considered with differential equality constraints over a variable interval. It is stressed that the abnormality is a local character of the admissible set; consequently, a definition of regularity related to the constraints characterizing the admissible set is given. Then, for the local minimum necessary conditions, a compact form equivalent to the well-known Euler equation and transversality condition is given. By exploiting this result and the previous definition of regularity, it is proved that nonregularity is a necessary and sufficient condition for an admissible solution to be an abnormal extremal. Then, a necessary and sufficient condition is given for an abnormal extremal to be weakly abnormal. The analysis of the abnormality is completed by considering the particular case of affine constraints over a fixed interval: in this case, the abnormality turns out to have a global character, so that it is possible to define an abnormal problem or a normal problem. The last section is devoted to the study of an optimal control problem characterized by differential constraints corresponding to the dynamics of a controlled process. The above general results are particularized to this problem, yielding a necessary and sufficient condition for an admissible solution to be an abnormal extremal. From this, a previously known result is recovered concerning the linearized system controllability as a sufficient condition to exclude the abnormality.     

Fundamental groups,inverse schützenberger automata,and monoid presentations

This paper gives decidable conditions for when a finitely generated subgroup of a free group is the fundamental group of a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Also, generalizations are given to specific types of inverse monoids as well as to monoids which are "nearly inverse." This result has applications to computing membership for inverse monoids in a Mal'cev product of the pseudovariety of semilattices with a pseudovariety of groups.

This paper also shows that there is a bijection between strongly connected inverse automata and subgroups of a free group, generated by positive words. Hence, we also obtain that it is decidable whether a finite strongly connected inverse automaton is a Schützenberger automaton corresponding to a monoid presentation of an inverse monoid. Again, we have generalizations to other types of inverse monoids and to "nearly inverse" monoids. We show that it is undecidable whether a finite strongly connected inverse automaton is a Schützenberger automaton of a monoid presentation of anE-unitary inverse monoid.     

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.     

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

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

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.     

Dynamical analysis of a game network

In this paper, our purpose is to establish a direct dynamical relationship between payoffs of players in a game. A network dynamical model is first proposed to describe the direct dynamical relationship. A Markovian chain is also introduced in the given network model to show the mixed strategy property in a game. As a result, a direct dynamical relationship between payoffs of players in a game can be illustrated through a network model with a Markovian chain. In addition, a sufficient condition is addressed to guarantee that the discussed network model has a unique and stable Nash equilibrium. Finally, a numerical example is shown to illustrate the effectiveness of the obtained criterion.     

Convergence conditions for the Brown-Robinson iterative method for bimatrix games

The article considers the convergence of the Brown-Robinson iterative method to find a mixed-strategy equilibrium in a bimatrix game. The known result on convergence to an equilibrium for a zero-sum game is generalized to a wider class of games that are reducible to zero-sum games by a composition of various transformations: addition of a constant to any column of the first-player payoff matrix; addition of a constant to any row in the second-player payoff matrix; multiplication of the payoff matrix by a positive constant α>0. Translated from Prikladnaya Matematika i Informatika, No. 2, pp. 69–83, 1999.