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.     

Systems of quasi-variational inequalities related to the switching problem

We prove the existence of weak solution for a system of quasi-variational inequalities related to a switching problem with dynamic driven by operator associated with a semi-Dirichlet form and with measure data. We give a stochastic representation of solutions in terms of solutions of a system of reflected BSDEs with oblique reflection. As a by-product, we prove the existence of an optimal strategy in the switching problem and show regularity of the payoff function.     

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.     

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

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

Cohomology,extensions and automorphisms of skew braces

The second cohomology group of a left skew brace with coefficients in a trivial left brace with non-trivial actions is defined, its connection with extensions of a left skew brace by a trivial brace is established and a Wells' like exact sequence relating the second cohomology group with inducible automorphisms of an extension of left skew braces is constructed.     

多元整系数多项式因式分解的一种理论和算法

本文将ｔ（ｔ是大于２的整数）元整系数多项式看成为系数为ｔ－２元整系数多项式的二元多项式，建立了多元整系数多项式因式分解的一种新理论，进而得到了分解多元整系数多项式的一个有力的算法。     

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.     

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.     

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.     

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.     

On bipartite zero-divisor graphs

A (finite or infinite) complete bipartite graph together with some end vertices all adjacent to a common vertex is called a complete bipartite graph with a horn. For any bipartite graph G, we show that G is the graph of a commutative semigroup with 0 if and only if it is one of the following graphs: star graph, two-star graph, complete bipartite graph, complete bipartite graph with a horn. We also prove that a zero-divisor graph is bipartite if and only if it contains no triangles. In addition, we give all corresponding zero-divisor semigroups of a class of complete bipartite graphs with a horn and determine which complete r-partite graphs with a horn have a corresponding semigroup for r≥3.     

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.     

Coexistence in host–pathogen systems

Lanchier and Neuhauser have initiated the study of host–symbiont systems but have concentrated on the case in which the birth rates for unassociated hosts are equal. Here we allow the birth rates to be different and identify cases in which a host with a specialist pathogen can coexist with a second species. Our calculations suggest that it is possible for two hosts with specialist pathogens to coexist but it is not possible for a host with a specialist mutualist to coexist with a second species.     

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.     

On the construction of prefix-free and fix-free codes with specified codeword compositions

We investigate the construction of prefix-free and fix-free codes with specified codeword compositions. We present a polynomial time algorithm which constructs a fix-free code with the same codeword compositions as a given code for a special class of codes called distinct codes. We consider the construction of optimal fix-free codes which minimize the average codeword cost for general letter costs with uniform distribution of the codewords and present an approximation algorithm to find a near optimal fix-free code with a given constant cost.     

Homogenization and propagation of chaos to a nonlinear diffusion with sticky reflection

Summary We study a process reflecting in a domain. The process follows Wentzell non-sticky boundary conditions while being adsorbed at the boundary at a certain rate with respect to local time and desorbed at a rate with respect to natural time. We show that when the rates go to infinity with a converging ratio, the process converges to a process with sticky reflection having the limit ratio as the sojourn coefficient. We then study a mean-field interacting system of such particles. We show propagation of chaos to a nonlinear diffusion with sticky reflection when we perform this homogenization simultaneously as the number of particles goes to infinity.     

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.     

Optimal admission control in queues with abandonments

We consider a multi-sever Markovian queueing system with abandonments where admitted customers pay a reward either at the time of arrival or service completion. There is a cost associated with abandonments and a holding cost associated with customers in the system. We prove that the policy that maximizes the long-run average reward is of threshold type and completely characterize the optimal thresholds. We conclude with a comparison of various characteristics of the two variants of the model.     

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.

     

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.