Strong competition model with non-uniform dispersal in a heterogeneous environment

In this study, a strong competition model was considered between two species in a heterogeneous environment. For a system with two different constant diffusion rates for each competitor, the fast diffuser can be selected evolutionally under suitable assumptions if the competing interaction between the species is strong. We also claim that a strongly interacting competition leads to a more evolutionary selection than that with the same population dynamics if a species moves with a certain non-uniform dispersal. Furthermore, species with a certain non-uniform dispersal have a competitive advantage over linear random diffusers. In addition, a species with highly sensitive dispersal response to the environment may survive. These strongly competitive advantages were demonstrated by investigating the stability of semi-trivial solutions of the system with non-uniform dispersal and comparing it to the conditions of the model with constant diffusion.     

Four equivalent lot-sizing models

We study the following lot-sizing models that recently appeared in the literature: a lot-sizing model with a remanufacturing option, a lot-sizing model with production time windows, and a lot-sizing model with cumulative capacities. We show the equivalence of these models with a classical model: the lot-sizing model with inventory bounds.     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

A partial differential equation connected to option pricing with stochastic volatility: Regularity results and discretization

This paper completes a previous work on a Black and Scholes equation with stochastic volatility. This is a degenerate parabolic equation, which gives the price of a European option as a function of the time, of the price of the underlying asset, and of the volatility, when the volatility is a function of a mean reverting Orstein-Uhlenbeck process, possibly correlated with the underlying asset. The analysis involves weighted Sobolev spaces. We give a characterization of the domain of the operator, which permits us to use results from the theory of semigroups. We then study a related model elliptic problem and propose a finite element method with a regular mesh with respect to the intrinsic metric associated with the degenerate operator. For the error estimate, we need to prove an approximation result.

     

Preconditioning the Poincaré-Steklov operator by using Green's function

This paper is concerned with the Poincaré-Steklov operator that is widely used in domain decomposition methods. It is proved that the inverse of the Poincaré-Steklov operator can be expressed explicitly by an integral operator with a kernel being the Green's function restricted to the interface. As an application, for the discrete Poincaré-Steklov operator with respect to either a line (edge) or a star-shaped web associated with a single vertex point, a preconditioner can be constructed by first imbedding the line as the diameter of a disk, or the web as a union of radii of a disk, and then using the Green's function on the disk. The proposed technique can be effectively used in conjunction with various existing domain decomposition techniques, especially with the methods based on vertex spaces (from multi-subdomain decomposition). Some numerical results are reported.

     

Resource allocation in dynamic PERT networks with finite capacity

This article models the resource allocation problem in dynamic PERT networks with finite capacity of concurrent projects (COnstant Number of Projects In Process (CONPIP)), where activity durations are independent random variables with exponential distributions, and the new projects are generated according to a Poisson process. The system is represented as a queuing network with finite concurrent projects, where each activity of a project is performed at a devoted service station with one server located in a node of the network. For modeling dynamic PERT networks with CONPIP, we first convert the network of queues into a stochastic network. Then, by constructing a proper finite-state continuous-time Markov model, a system of differential equations is created to solve and find the completion time distribution for any particular project. Finally, we propose a multi-objective model with three conflict objectives to optimally control the resources allocated to the servers, and apply the goal attainment method to solve a discrete-time approximation of the original multi-objective problem.     

Sparse Linear Algebra and Geophysical Migration: A Review of Direct and Iterative Methods

The pre-stack depth migration of reflection seismic data can be expressed, in the framework of waveform inversion, as a linear least squares problem. Together with the precise definition of this operator, we detail additional main characteristics of the forward model, like its huge size, its sparsity and the composition with convolution. It ends up with a so-called discrete ill-posed problem, whose acceptable solutions have to undergo a regularization procedure. Both direct and iterative methods have been implemented with specific attention to the convolution, and then applied to a given data set: a synthetic 2-dimensional profile of revealing size with some added noise. The efficiency with regard to computational effort and storage requirements is evaluated. The needed regularization of the solution is thoroughly studied in both cases. From the point of the global inverse problem, the extra feature of providing a solution that can be differentiated with respect to a parameter such as background velocity is also discussed.     

N-graphs,Modular Sidon and Sum-Free Sets,and Partition Identities

Using a new graphical representation for partitions, the author obtains a family of partition identities associated with partitions into distinct parts of an arithmetic progression, or, more generally, with partitions into distinct parts of a set that is a finite union of arithmetic progressions associated with a modular sum-free Sidon set. Partition identities are also constructed for sets associated with modular sum-free sets.     

Spreading speeds and traveling waves for abstract monostable evolution systems

This paper is devoted to the development of the theory of spreading speeds and traveling waves for abstract monostable evolution systems with spatial structure. Under appropriate assumptions, we show that the spreading speeds coincide with the minimal wave speeds for monotone traveling waves in the positive and negative directions. Then we use this theory to study the spatial dynamics of a parabolic equation in a periodic cylinder with the Dirichlet boundary condition, a reaction-diffusion model with a quiescent stage, a porous medium equation in a tube, and a lattice system in a periodic habitat.     

拉伸偏心椭圆孔板的应力集中系数表达式

先用半解析半经验的方法推导出拉伸中心椭圆孔有限宽板应力集中系数的显式表达式．将其计算结果和Durelli的光弹性实验结果、Isida公式以及有限元分析结果比较可知,新推导公式的精度较高,且适用范围更广．再用类似的方法推导出拉伸偏心椭圆孔板应力集中系数的显式表达式．经与Isida的公式和有限元分析结果比较可知,该公式适用范围更广、精度更高．当偏心距在一定范围内,误差小于8%．根据应力集中系数与应力强度因子的关系,由已得到的应力集中系数得出拉伸中心裂纹有限宽板和拉伸偏心裂纹板的应力强度因子．经与已有公式以及有限元分析结果比较可知,该应力强度因子表达式也有足够的精度．     

A one‐dimensional computational model for hyperelastic string structures with Coulomb friction

In this paper, we consider a new model for the simulation of textiles with frictional contact between fibers and no bending resistance. In the model, one‐dimensional hyperelasticity and the Capstan equation are combined, and its connection with conventional hyperelasticity and Coulomb friction models is shown. Then, the model is formulated as a problem with the rate‐independent dissipation, and we prove that the problem possesses proper convexity and continuity properties. The article concludes with a numerical algorithm and provides numerical experiments along with a comparison of the results with a real measurement. Copyright © 2016 John Wiley & Sons, Ltd.     

Spectrality of a class of self-affine measures with decomposable digit sets

The self-affine measure associated with an expanding matrix and a finite digit set is uniquely determined by the self-affine identity with equal weight.The spectral and non-spectral problems on the selfaffine measures have some surprising connections with a number of areas in mathematics,and have been received much attention in recent years.In the present paper,we shall determine the spectrality and non-spectrality of a class of self-affine measures with decomposable digit sets.We present a method to deal with such case,and clarify the spectrality and non-spectrality of a class of self-affine measures by applying this method.     

Implicit construction of multiple eigenvalues for trees

We are generally concerned with the possible lists of multiplicities for the eigenvalues of a real symmetric matrix with a given graph. Many restrictions are known, but it is often problematic to construct a matrix with desired multiplicities, even if a matrix with such multiplicities exists. Here, we develop a technique for construction using the implicit function theorem in a certain way. We show that the technique works for a large variety of trees, give examples and determine all possible multiplicities for a large class of trees for which this was not previously known.     

Minimum Path Problems in Normed Spaces: Reflection and Refraction

The paper deals with the existence and characterization of minimum or extremum paths connecting two given points in a vector space, which is divided by a barrier (a curve C if the space is 2-dimensional) into two parts with different norms. The global problem of existence of polygonal paths of shortest length is dealt with in Section 2. An example shows that, for a curve with a point of inflection, such paths may not exist. However, the existence of such paths is proved for a more restricted class of curves (Theorem 2.3). The notion of permissible polygonal paths is introduced, and it is shown that, for a very general class of curves, such paths of shortest length do exist (Theorem 2.2).Sections 3 and 4 deal with the local conditions at the intersection of the extremal path with the curve C. Theorem 4.1 establishes a geometric characterization of the point of intersection, and Eqs. (13) and (15) are formulas for the angles that the segments of the extremal path make with a fixed axis or with the normal to C at the point of intersection. The case where the unit circles of the tax norms are Euclidean circles with different radii leads to the traditional Snell law. Section 6 deals with the law of reflection at the curve C, which in the case of the Euclidean norm asserts the equality of the angles of incidence and reflection. The n-dimensional case, where the curve C is replaced by a hypersurface, is considered briefly in Section 7.     

带两个服务等级的三台机最优在线算法

研究了带服务等级约束的三台平行机在线排序问题.每台机器和每个工件的服务等级为1或者2,工件只能在等级不高于它的机器上加工,即等级为1的工件只能在等级为1的机器上加工,等级为2的工件可在所有机器上加工.每个工件的加工时间为一个单位,目标是极小化所有工件的总完工时间.考虑两种情形:当一台机器等级为1,两台机器等级为2时,给出了竞争比为17/14的最优在线算法;当两台机器等级为1,一台机器等级为2时,给出了竞争比为43/36的最优在线算法.     

Prescribed Mean Curvature Hypersurfaces in Hn+1(-1) with Convex Planar Boundary, I

We study immersed prescribed mean curvature compact hypersurfaces with boundary in Hⁿ⁺¹(-1). When the boundary is a convex planar smooth manifold with all principal curvatures greater than 1, we solve a nonparametric Dirichlet problem and use this, together with a general flux formula, to prove a parametric uniqueness result, in the class of all immersed compact hypersurfaces with the same boundary. We specialize this result to a constant mean curvature, obtaining a characterization of totally umbilic hypersurface caps.     

Global convergence in infeasible-interior-point algorithms

This paper presents a wide class of globally convergent interior-point algorithms for the nonlinear complementarity problem with a continuously differentiable monotone mapping in terms of a unified global convergence theory given by Polak in 1971 for general nonlinear programs. The class of algorithms is characterized as: Move in a Newton direction for approximating a point on the path of centers of the complementarity problem at each iteration. Starting from a strictly positive but infeasible initial point, each algorithm in the class either generates an approximate solution with a given accuracy or provides us with information that the complementarity problem has no solution in a given bounded set. We present three typical examples of our interior-point algorithms, a horn neighborhood model, a constrained potential reduction model with the use of the standard potential function, and a pure potential reduction model with the use of a new potential function.Research supported in part by Grant-in-Aids for Co-Operative Research (03832017) of the Japan Ministry of Education, Science and Culture.Corresponding author.     

The Buneman index via polyhedral split decomposition

The split decomposition of a metric using the so-called isolation index was established by Bandelt and Dress, and it is a theoretical foundation for certain phylogenetic network reconstruction methods. Recently, Hirai gave a geometric interpretation to the split decomposition, and provided an extension of the split decomposition for a distance, i.e., a symmetric nonnegative function with zero diagonal. By Herrmann and Moulton, such a geometric approach was further applied to polyhedral functions, called tight-spans in their style, defined on various vector configurations. This paper addresses the split decomposition with respect to a particular kind of vector configuration, which does not satisfy the assumption imposed by Hirai or Herrmann and Moulton. As a result, we obtain geometrically the Buneman index, which is also used to construct a phylogenetic tree. Moreover, this paper deals with the combinatorial aspect of the polyhedral split decomposition, and gives a combinatorial characterization of the split-decomposability with the aid of the matroid associated with the vector configuration.     

Diophantine m-tuples for linear polynomials

In this paper, we prove that there does not exist a set with more than 26 polynomials with integer coefficients, such that the product of any two of them plus a linear polynomial is a square of a polynomial with integer coefficients. This revised version was published online in June 2006 with corrections to the Cover Date.