A Note on a Boundary Value Problem

In this note, we prove that, for Robins boundary value problem, a unique solution exists if f_x(t, x, x), f_x(t, x, x), (t), and (t) are continuous, and f_x -(t), f_x -(t), 4(t) ² + ²(t) ++ 2(t), and 4(t) ² + ²(t) + 2(t).AMS Subject Classification (2000) 34B15     

基于排队论的通信系统中费用优化问题

采用带启动时间的N策略排队,对ATM通信网中虚通道连接中的费用问题进行了量化分析,给出使系统总费用最少的最优策略N*.     

关于一个奇异Dirichlet问题的注记

The Dirichlet problem to a second order differential equation with some singularities is studied. Some existence results are established to the problem which generalize some results recently obtained by D. O‘Regan by eliminating some superfluous constrains to the problem. Also, some new results have been proven which may provide more useful information for the study of the problem.     

生产流水线中的排队问题

本文讨论产品以Poisson过程到达,有K道加工工序,每加工点是有限容量且服务服从指数分布带受阻的排队网络,并给出了平稳条件和在平稳条件下以三节点组合逼近方法得到平均队长．     

A Note on a Two-dimensional Dynamic Programming Problem

A two-dimensional dynamic programming problem is posed. By relaxing some of the restraints on the problem it is reduced to a standard dynamic programming problem. Results are quoted from a particular case study.     

关于Pugh问题的一个注

该文构造了一个4次多项式Abelian方程, 其系数为次数≤3的三角多项式, 此方程有6个孤立的2 ∏-周期解.换句话说,作者构造了一个关于Pugh问题的例子, 其中当n=4时,K(n)=6.这个例子比Smale在文献[1]中提到的Nirenberg例子简单.     

关于离散 Schrodinger谱问题及其方程族的一个注记

对一个离散Schrodinger 谱问题, 给出与其相联系方程族的双 Hamilton 结构.同时构造了该族的一个 Darboux 变换.     

A Multiclass Feedback Queueing Network with a Regular Skorokhod Problem

We consider a four-class two-station network with feedback, with fluid inputs and a head-of-the-line generalized processor sharing discipline at each station. We derive the Skorokhod Problem associated with the network and obtain algebraic sufficient conditions for Lipschitz continuity of the associated Skorokhod Map. This provides the first example of a multiclass network with feedback for which the associated Skorokhod Problem has been proved to be regular. As an elementary application, we show that under the conditions which guarantee Lipschitz continuity the network is stable if and only if the usual load conditions apply.     

关于半线性椭圆共振问题的注记

本文应用Ｍｏｒｓｅ理论和惩罚性技巧研究了一类半线性椭圆方程在无穷远处和在原点处都共振情形下非平凡解的存在性．     

A Note on a Packing Problem in Transitive Tournaments

Let TT_n be a transitive tournament on n vertices. We show that for any directed acyclic graph G of order n and of size not greater than two directed graphs isomorphic to G are arc disjoint subgraphs of TT_n. Moreover, this bound is generally the best possible. The research partially supported by KBN grant 2 P03A 016 18     

A Note on the Application of Dynamic Correction to the Optimization of a Multiperiod Resource Allocation Problem

In this note, Luss's approach to optimization of a multiperiod resource allocation problem is employed to include carry-over effects of the controllable variable on future periods and also to include the carry-over effect from previous periods.     

关于M-R公开问题的注记

在本文中,通过关联ＢＣＫ-代数与立体格公理系统的联系,给出了Ｍ-Ｒ公开问题一个肯定的答复．     

A Note on the Set Covering Problem

A previously published work on a ‘probabilistic’ formulation of the set covering problem is discussed. Attention is drawn to the dependence of the feasible locations of facilities on the way the continuous space of incidents is divided into subregions when using either the above formulation or the standard deterministic formulation of the set covering problem.     

Poisson过程分解问题的一个注记

在研究Poisson过程分解问题时,现有文献的证明往往令人费解,本文主要运用极限理论,给出了一个简明易懂的证明.     

A Note on Permutation Flow Shop Problem

In this paper we present two approximation algorithms for the permutation flow shop problem with makespan objective. The first algorithm has an absolute performance guarantee, the second one is an $O(\sqrt {m{\text{ log }}m} )$ -approximation algorithm. The last result is almost best possible approximation algorithm which can be obtained using the trivial lower bound (maximum of the maximum machine load and the maximum job length) (Potts, Shmoys, and Williamson, 1991).     

A Note on Warszawski's Multi-Commodity Location Problem

This note shows two easily incorporated improvements in computing the lower bounds for Warszawski's branch and bound algorithm for the multi-commodity location problem. The lower bounds become relatively stronger, thereby making the branch and bound algorithm more efficient.     

关于奇异摄动问题的加权差分方法的注记

本文用例子说明义［１，２］中讨论的关于奇异摄动问题的加权差分格式不是一致收敛的，甚至是不相容的。     

A Note on a Problem of M. S. Berger

In this paper, we discuss the problem concerning global and local structure of solutions of an operator equation posed by M. S. Berger. Let f : U (?)E→ F be a C1 map, where E and F are Banach spaces and U is open in E. We show that the solution set of the equation f(x)=y for a fixed generalized regular value y of f is represented as a union of disjoint connected C1 Banach submanifolds of U, each of which has a dimension and its tangent space is given. In particular, a characterization of the isolated solutions of the equation f(x) = y is obtained.