多元分布下单边备择假设的两步检验

x~2检验是熟知的拟合优度检验.它适用于任意的备择假设,尤其是适用于一般的备择假设"H_0不真"的情况.但是,当备择假设是一个单边假设时,x~2检验没有用到单边假设所提供的信息.因此,一个充分利用单边备择假设信息的检验是有可能优于传统的x~2检验的.本文就是利用单边备择假设的信息给出了一个两步检验,并通过一个例子,详细介绍了两步检验法的实施,说明了其应用.     

单边算子交换子的加权有界性

利用单边权的外推法,本文得到了由单边算子与Lipschitz函数生成的交换子的加权有界性质,而且给出了判定两类单边极大算子交换子有界性的充分必要条件.     

单边Triebel-Lizorkin空间及其应用

引进了一类单边Tiebel-Lizorkin空间.在单边的意义下,利用权的外推法,得到了由CalderónZygmund奇异积分算子与Lipschjtz函数生成的交换子从加权Lebesgue空间到加权Triebel-Lizorkin 空间的有界性质.同时研究了单边分数次积分算子交换子的有关性质.     

两类单边算子的半连续性研究

本文研究了单边Hardy-Littlewood极小算子的上半连续性及单边Hardy-Littlewood极大算子的下半连续性问题.利用半连续性的相关性质和新型集合测度估计等获得了单边Hardy-Littlewood极小算子m~+f(x)在R~n上的上半连续性和单边Hardy-Littlewood极大算子M~+f(x)在R~n上的下半连续性,推广了Hardy-Littlewood极大算子的半连续性成果.     

财经类专业“数理统计”教学中值得注意的几个问题

针对相关系数的本质含义和相关性的概念与分类、相关关系与因果关系的区别、回归分析中应注意的问题、单边检验的原假设选择等财经类专业学生在使用时易弄错的一些数理统计概念性问题,进行了分析和讨论.     

分组数据参数的单边估计与检验

设ｘ_０＜ｘ_１＜…＜ｘ_ｋ－１＜ｘ_ｋ是分布函数Ｆ（ｘ－θ）支撑集上的分点．令ｎ_ｉ表示落入区间（ｘ_ｉ－１,ｘ_ｉ）的观测值个数,并称其为分组数据．本文讨论了θ在θ≥θ０下的最大似然估计存在且唯一的条件及其渐近性质;给出了利用分组数据求最大似然估计的方法．最后;讨论了θ的单边检验问题．     

单边奇异积分交换子的加权变差不等式

本文主要研究了单边Calder\''{o}n-Zygmund奇异积分交换子的加权变差不等式,即建立了单边Calder\''{o}n-Zygmund奇异积分与Lipschitz函数生成的交换子的加权变差不等式, 同时,利用权的外推法得到了该交换子在Triebel-Lizorkin空间上的加权变差不等式.     

单边算子的多线性交换子在Triebel-Lizorkin空间上的加权有界性

该文在单边意义下采用权的外推法研究了Calderón-Zygmund奇异积分算子,离散面积函数,Weyl分数次积分与Lipschitz函数生成的多线性交换子从加权Lebesgue空间到加权Triebel-Lizorkin空间上的有界性.     

单边挠对

由Beligiannis和Marmaridis引入的单边三角范畴(即左或右三角范畴)是三角范畴的自然推广. 挠理论在范畴的结构方面, 特别在导出范畴或更一般的三角范畴的研究中有着非常重要的作用. 本文引入单边三角范畴中的单边挠对概念, 讨论了这样一种单边挠理论与预三角范畴、稳定范畴以及三角范畴中相应概念的关系, 最后通过Abel范畴上的有界导出范畴D^b (A)给出例子表明存在非平凡单边挠对.     

正则环上矩阵分解

利用幂等矩阵和单边可逆阵,给出了正则环上具有群逆的矩阵结构,并证明了具有奇数特征的单边单位正则环上的矩阵都可分解为两个单边可逆矩阵和形式。     

服务管理差距与服务质量差距之间关系模型的研究

在服务质量差距分析模型的基础上,基于服务管理差距和服务质量差距测评体系,运用结构方程建模方法,建立了企业内部服务管理差距与顾客感知服务质量差距之间的关系路径图和关系模型,定量研究了四个服务管理差距对服务质量差距的影响关系、服务管理差距测评指标对相应的四个服务管理差距的影响关系,为顾客感知服务质量差距的测量和评价提供了技术和方法.结合某外语培训学校服务管理实际进行了案例研究,为企业服务质量的诊断和改进提供了科学依据.     

Operators Which Do Not Have the Single Valued Extension Property

In this paper we shall consider the relationships between a local version of the single valued extension property of a bounded operator T  L(X) on a Banach space X and some quantities associated with T which play an important role in Fredholm theory. In particular, we shall consider some conditions for which T does not have the single valued extension property at a point λ_o  C.     

Single machine batch scheduling to minimize the weighted number of late jobs

The single machine batch scheduling problem to minimize the weighted number of late jobs is studied. In this problem,n jobs have to be processed on a single machine. Each job has a processing time, a due date and a weight. Jobs may be combined to form batches containing contiguously scheduled jobs. For each batch, a constant set-up time is needed before the first job of this batch is processed. The completion time of each job in the batch coincides with the completion time of the last job in this batch. A job is late if it is completed after its due date. A schedule specifies the sequence of jobs and the size of each batch, i.e. the number of jobs it contains. The objective is to find a schedule which minimizes the weighted number of late jobs. This problem isNP-hard even if all due dates are equal. For the general case, we present a dynamic programming algorithm which solves the problem with equal weights inO(n ³) time. We formulate a certain scaled problem and show that our dynamic programming algorithm applied to this scaled problem provides a fully polynomial approximation scheme for the original problem. Each algorithm of this scheme has a time requirement ofO(n ³/ +n ³ logn). A side result is anO(n logn) algorithm for the problem of minimizing the maximum weight of late jobs.Supported by INTAS Project 93-257.     

Lifting,superadditivity, mixed integer rounding and single node flow sets revisited

In this survey we attempt to give a unified presentation of a variety of results on the lifting of valid inequalities, as well as a standard procedure combining mixed integer rounding with lifting for the development of strong valid inequalities for knapsack and single node flow sets. Our hope is that the latter can be used in practice to generate cutting planes for mixed integer programs. The survey contains essentially two parts. In the first we present lifting in a very general way, emphasizing superadditive lifting which allows one to lift simultaneously different sets of variables. In the second, our procedure for generating strong valid inequalities consists of reduction to a knapsack set with a single continuous variable, construction of a mixed integer rounding inequality, and superadditive lifting. It is applied to several generalizations of the 0-1 single node flow set.Received: December 2002, Revised: April 2003, AMS classification: 90C11, 90C27Laurence A. Wolsey: Corresponding author: CORE, Voie du Roman Pays 34, 1348 Louvain-la-Neuve, Belgium. The first author is supported by the FNRS as a research fellow. This paper presents research results of the Belgian Program on Interuniversity Poles of Attraction initiated by the Belgian State, Prime Ministers Office, Science Policy Programming. The scientific responsibility is assumed by the authors.Laurence A. Wolsey: This research was also supported by the European Commission GROWTH Programme, Research Project LISCOS, Large Scale Integrated Supply Chain Optimization Software Based on Branch-and-Cut and Constraint Programming Methods, Contract No. GRDI-1999-10056, and the project TMR-DONET nr. ERB FMRX-CT98-0202.     

并列双方柱绕流的大涡模拟及频谱分析

应用二阶全展开ETG有限元离散格式与大涡模拟相结合的方法,对间距比为1.5情况下的并列双方柱绕流进行了数值模拟．由王小华、何钟怡提出的二阶全展开ETG有限元方法通过对N-S方程中的时变项进行Taylor展开,从而把时间导数用空间导数来代替,其作用相当于引入了人工粘性．计算得到了不同时刻的流线图,给出了两方柱的阻力系数、升力系数以及两对称点上流向速度随时间的变化历程,并采用谱分析的方法研究了对称边界条件下并列双方柱绕流的频谱对称性问题．为了消除初始条件的影响,在所取样本中去除了计算中初始段的数据,分别分析了阻力系数、升力系数以及两对称点上流向速度的频谱．结果表明:对称边界条件下,双方柱绕流运动参量的时域过程虽然是不对称的,但频域过程却是对称的．     

Priority queues with semi-exhaustive service

This paper studies a new type of multi-class priority queues with semi-exhaustive service and server vacations, which operates as follows: A single server continues serving messages in queuen until the number of messages decreases toone less than that found upon the server's last arrival at queuen, where 1nN. In succession, messages of the highest class present in the system, if any, will be served according to this semi-exhaustive service. Applying the delay cycle analysis and introducing a super-message composed of messages served in a busy period, we derive explicitly the Laplace-Stieltjes transforms (LSTs) and the first two moments of the message waiting time distributions for each class in the M/G/1-type priority queues with multiple and single vacations. We also derive a conversion relationship between the LSTs for waiting times in the multiple and single vacation models.     

Fluctuation limits of the single point catalytic super-stable processes

We prove a fluctuating limit theorem of a sequence of super-stable processes overR with a single point catalyst.The weak convergence of the processes on the space of Schwartz distributions is established.The limiting process is an Ornstein–Uhlenbeck type process solving a Langevin type equation driven by a one-dimensional stable process.     

Differential equations with almost periodic or conditionally periodic coefficients: Recurrence and reducibility

Recurrence of an individual trajectory of a linear nonautonomous differential equation on a compact Lie group for the case of an almost periodic or conditionally periodic dependence of the right-hand side on time is proved. The relation between recurrence and reducibility is examined.Translated fromMatematicheskie Zametki, Vol. 64, No. 2, pp. 229–237, August, 1998.This research was supported by the Russian Foundation for Basic Research under grants No. 96-01-00378 and No. 96-15-96072.     

二元稳定网络的算法及模型

通过建立JW(Jackson-Wolinsky)规则之下二元稳定网络的等价条件, 给出其完整算法. 引入边支付后, 证明了增连接情形具有边支付的二元稳定网络集合是二元稳定网络集合与具有边支付的二元稳定网络集合的交集. 考察两个特定的网络模型, 系统分析了它们的二元稳定性.