弱辫子T-范畴（英文）

Recently Turaev generalized the notion of a tensor category to that of a crossed group category.In[5]the authors constructed the representation category Rep(H) of a T-coalgebra H.In[2]the authors introduced the notions of a weak tensor category to characterize a weak bialgebra and a weak Hopf algebra.This paper is based on these ideas to naturally introduce the notions of a weak T-category and a weak braided T-category which are not under the usual way and prove that the categories of representations of a weak T-coalgebra and a weak braided T-coalgebra are a weak T-category and a weak braided T-category respectively.Furthermore we also discuss some properties of weak T-category.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．     

Formulation of the problem of sonic boom by a maneuvering aerofoil as a one-parameter family of Cauchy problems

For the structure of a sonic boom produced by a simple aerofoil at a large distance from its source we take a physical model which consists of a leading shock (LS), a trailing shock (TS) and a one-parameter family of nonlinear wavefronts in between the two shocks. Then we develop a mathematical model and show that according to this model the LS is governed by a hyperbolic system of equations in conservation form and the system of equations governing the TS has a pair of complex eigenvalues. Similarly, we show that a nonlinear wavefront originating from a point on the front part of the aerofoil is governed by a hyperbolic system of conservation laws and that originating from a point on the rear part is governed by a system of conservation laws, which is elliptic. Consequently, we expect the geometry of the TS to be kink-free and topologically different from the geometry of the LS. In the last section we point out an evidence of kinks on the LS and kink-free TS from the numerical solution of the Euler’s equations by Inoue, Sakai and Nishida [5].     

A Priori and A Posteriori: A Bootstrapping Relationship

The distinction between a priori and a posteriori knowledge has been the subject of an enormous amount of discussion, but the literature is biased against recognizing the intimate relationship between these forms of knowledge. For instance, it seems to be almost impossible to find a sample of pure a priori or a posteriori knowledge. In this paper, it will be suggested that distinguishing between a priori and a posteriori is more problematic than is often suggested, and that a priori and a posteriori resources are in fact used in parallel. We will define this relationship between a priori and a posteriori knowledge as the bootstrapping relationship. As we will see, this relationship gives us reasons to seek for an altogether novel definition of a priori and a posteriori knowledge. Specifically, we will have to analyse the relationship between a priori knowledge and a priori reasoning, and it will be suggested that the latter serves as a more promising starting point for the analysis of aprioricity. We will also analyse a number of examples from the natural sciences and consider the role of a priori reasoning in these examples. The focus of this paper is the analysis of the concepts of a priori and a posteriori knowledge rather than the epistemic domain of a posteriori and a priori justification.     

Weak Convergence Theorems for Nonexpansive Mappings and Monotone Mappings

In this paper, we introduce an iteration process of finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of a variational inequality problem for an inverse strongly-monotone mapping, and then obtain a weak convergence theorem. Using this result, we obtain a weak convergence theorem for a pair of a nonexpansive mapping and a strictly pseudocontractive mapping. Further, we consider the problem of finding a common element of the set of fixed points of a nonexpansive mapping and the set of zeros of an inverse strongly-monotone mapping.     

Linear equations of the Sobolev type with integral delay operator

We establish sufficient conditions of the local and global solvability of initial value problems for a class of linear operator-differential equations of the first order in a Banach space. Equations are assumed to have a degenerate operator at the derivative and an integral delay operator. We apply methods of the theory of degenerate semigroups of operators and the contraction mapping theorem. As examples illustrating the general results we consider the evolution equation for a free surface of a filtered liquid with a delay and a linearized quasistationary system of equations for a phase field with a delay.     

Subgradient Projectors: Extensions,Theory, and Characterizations

Subgradient projectors play an important role in optimization and for solving convex feasibility problems. For every locally Lipschitz function, we can define a subgradient projector via generalized subgradients even if the function is not convex. The paper consists of three parts. In the first part, we study basic properties of subgradient projectors and give characterizations when a subgradient projector is a cutter, a local cutter, or a quasi-nonexpansive mapping. We present global and local convergence analyses of subgradent projectors. Many examples are provided to illustrate the theory. In the second part, we investigate the relationship between the subgradient projector of a prox-regular function and the subgradient projector of its Moreau envelope. We also characterize when a mapping is the subgradient projector of a convex function. In the third part, we focus on linearity properties of subgradient projectors. We show that, under appropriate conditions, a linear operator is a subgradient projector of a convex function if and only if it is a convex combination of the identity operator and a projection operator onto a subspace. In general, neither a convex combination nor a composition of subgradient projectors of convex functions is a subgradient projector of a convex function.     

Skew category, Galois covering and smash product of a -category

In this paper we consider categories over a commutative ring provided either with a free action or with a grading of a not necessarily finite group. We define the smash product category and the skew category and we show that these constructions agree with the usual ones for algebras. In the case of the smash product for an infinite group our construction specialized for a ring agrees with M. Beattie's construction of a ring with local units. We recover in a categorical generalized setting the Duality Theorems of M. Cohen and S. Montgomery (1984), and we provide a unification with the results on coverings of quivers and relations by E. Green (1983). We obtain a confirmation in a quiver and relations-free categorical setting that both constructions are mutual inverses, namely the quotient of a free action category and the smash product of a graded category. Finally we describe functorial relations between the representation theories of a category and of a Galois cover of it.

     

Multi-server queueing system with a generalized phase-type service time distribution as a model of call center with a call-back option

A multi-server queueing system with a Markovian arrival process and finite and infinite buffers to model a call center with a call-back option is investigated. If all servers are busy during the customer arrival epoch, the customer may leave the system forever or move to the buffer (such a customer is referred to as a real customer), or, alternatively, request for call-back (such a customer is referred to as a virtual customer). During a waiting period, a real customer can be impatient and may leave the system without service or request for call-back (becomes a virtual customer). The service time of a customer and the dial time to a virtual customer for a server have a phase-type distribution. To simplify the investigation of the system we introduce the notion of a generalized phase-type service time distribution. We determine the stationary distribution of the system states and derive the Laplace–Stieltjes transforms of the sojourn and waiting time distributions for real and virtual customers. Some key performance measures are calculated and numerical results are presented.     

非扩张映射的不动点与变分包含问题的公共解

In this paper, we introduce an iterative scheme for finding a common element of the set of fixed points of a nonexpansive mapping and the set of solutions of the variational inclusion for an inverse-strongly monotone mapping and a maximal monotone mapping in a real Hilbert space. Then we show that the sequence converges strongly to a common element of two sets. Using the result, we consider the problem of finding a common fixed point of a nonexpansive mapping and a strictly pseudocontractive mapping in a real Hilbert space.     

Continuous conjugation of special nonisentropic one-dimensional gas motions

The exact partially invariant solution of equations of motion of a compressible fluid describing the collapse of particles to a point and an instantaneous source from the point in a one-dimensional nonisentropic motion is cut off by the characteristics and glued into a continuous solution of a one-dimensional submodel in a finite domain. The possibility of a continuous periodic nonisentropic motion of a compressible fluid in a bounded domain under the action of a piston is shown.     

Characterizations of g-frames and g-Riesz bases in Hilbert spaces

In this paper, we introduce the pre-frame operator Q for the g-frame in a complex Hilbert space, which will play a key role in studying g-frames and g-Riesz bases etc. Using the pre-frame operator Q, we give some necessary and sufficient conditions for a g-Bessel sequence, a g-frame, and a g-Riesz basis in a complex Hilbert space, which have properties similar to those of the Bessel sequence, frame, and Riesz basis respectively. We also obtain the relation between a g-frame and a g-Riesz basis, and the relation of bounds between a g-frame and a g-Riesz basis. Lastly, we consider the stability of a g-frame or a g-Riesz basis for a Hilbert space under perturbation.     

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rank-decomposition of a graph (on contrary to the usual approach which translates a rank-decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kanté [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle.     

Diads and their Application to Topoi

It is well known that the category of coalgebras for a finite-limit preserving comonad on a topos is again a topos, and the category of algebras for a finite-limit preserving monad is a topos if the monad is idempotent, but not in general. A generalisation of this result (Paré et al., Bull Aus Math Soc 39(3):421–431, 1989) is that the full subcategory of fixed points for any idempotent finite-limit preserving endofunctor is again a topos (and indeed a subquotient in the category of topoi and geometric morphisms). Here, we present a common generalisation of all the above results, based on a notion which we call a diad, which is a common generalisation of a monad and a comonad. Many of the constructions that can be applied to monads and comonads can be extended to all diads. In particular, the category of algebras or coalgebras can be generalised to a category of dialgebras for a diad. The generalisation we present here is that the category of dialgebras for a finite-limit preserving left diad (for example, the diad corresponding to a comonad, or any idempotent endofunctor) on a topos is again a topos.     

A Chart for Evaluating Product Research and Development Projects

A method of evaluating research and development projects is described. The method is based on the use of an evaluation chart. The main purpose of the chart is to calculate a project score which is a measure of a selected evaluation criterion. A method of constructing a chart is illustrated using a project index as the evaluation criterion. The chart contains a list of twelve questions, the answers to which are assumed to be the main determinants of the variables in the formula of the index. Each question is followed by a set of answers from which a choice is to be made, and underneath each answer is a numerical score. The numerical scores are logarithmic functions of the answers to which they relate, and when added together give a project score which is a logarithmic function of the index. Various methods of using the chart, and a suggested evaluation procedure, are also described.     

Mean-variance optimization problems for an accumulation phase in a defined benefit plan

In this paper we deal with contribution rate and asset allocation strategies in a pre-retirement accumulation phase. We consider a single cohort of workers and investigate a retirement plan of a defined benefit type in which an accumulated fund is converted into a life annuity. Due to the random evolution of a mortality intensity, the future price of an annuity, and as a result, the liability of the fund, is uncertain. A manager has control over a contribution rate and an investment strategy and is concerned with covering the random claim. We consider two mean-variance optimization problems, which are quadratic control problems with an additional constraint on the expected value of the terminal surplus of the fund. This functional objectives can be related to the well-established financial theory of claim hedging. The financial market consists of a risk-free asset with a constant force of interest and a risky asset whose price is driven by a Lévy noise, whereas the evolution of a mortality intensity is described by a stochastic differential equation driven by a Brownian motion. Techniques from the stochastic control theory are applied in order to find optimal strategies.     

A tabu search heuristic for the dynamic transportation of patients between care units

The problem studied in this paper stems from a real application to the transportation of patients in the Hospital Complex of Tours (France). The ambulance central station of the Hospital Complex has to plan the transportation demands between care units which require a vehicle. Some demands are known in advance and the others arise dynamically. Each demand requires a specific type of vehicle and a vehicle can transport only one person at a time. The demands can be subcontracted to a private company which implies high cost. Moreover, transportations are subject to particular constraints, among them priority of urgent demands, disinfection of a vehicle after the transportation of a patient with contagious disease and respect of the type of vehicle needed. These characteristics involve a distinction between the vehicles and the crews during the modeling phase. We propose a modeling for solving this difficult problem and a tabu search algorithm inspired by Gendreau et al. (1999). This method supports an adaptive memory and a tabu search procedure. Computational experiments on a real-life instance and on randomly generated instances show that the method can provide high-quality solutions for this dynamic problem with a short computation time.     

Halpern- and Mann-Type Algorithms for Fixed Points and Inclusion Problems on Hadamard Manifolds

In this article, we consider an inclusion problem which is defined by means of a sum of a single-valued vector field and a set-valued vector field defined on a Hadamard manifold. We propose Halpern-type and Mann-type algorithms for finding a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. Some particular cases of our problem and algorithm are also discussed. We study the convergence of the proposed algorithm to a common point of the set of fixed points of a nonexpansive mapping and the set of solutions of the inclusion problem defined on a Hadamard manifold. As applications of our results and algorithms, we derive the solution methods and their convergence results for the optimization problems, variational inequality problems and equilibrium problems in the setting of Hadamard manifolds.     

Fredholm’s boundary-value problems for differential systems with a single delay

Conditions are derived for the existence of solutions of linear Fredholm’s boundary-value problems for systems of ordinary differential equations with constant coefficients and a single delay. Utilizing a delayed matrix exponential and a method of pseudo-inverse by Moore-Penrose matrices led to an explicit and analytical form of a criterion for the existence of solutions in a relevant space and, moreover, to the construction of a family of linearly independent solutions of such problems in a general case with the number of boundary conditions (defined by a linear vector functional) not coinciding with the number of unknowns of a differential system with a single delay.