模糊向量真值修正模糊化方法

模糊化是将物理空间的实测精确量影射为模糊推理空间上的模糊集合。在模糊控制中，不同的模糊推理方法要求不同的模糊化方法，不同的模糊化方法对模糊控制性能影响很大。本文首先系统地总结了现有的模糊化方法，然后提出了模糊向量真值修正模糊化方法，最后，针对常用的CRI法，完成了不同模糊化方法的一阶惯性时滞定常系统的模糊控制仿真，结果表明，该方法能够提高CRI法的模糊控制性能，消除稳态误差。     

对多等级质量产品（以σ衡量）抽样数n值的计算及分极标准的制定方法

本文利用抽样分布理论，对以σ衡量质量的多等级产品质量检验问题，提出了一个具体的处理方法，该方法给出了计算抽样数的公式，也给出了确定各等级之间距离的计算方法，揭示了抽样置信度、抽样数ｎ、等级距离三者之间的关系。并按本文的方法，提出了对广东商检局出口桑蚕丝原抽样方案的修改意见。     

秦皇岛地区更新世孢粉及重矿组合统计分析及其生态环境意义

本文使用三种有序聚类分析方法研究了秦皇岛地区晚更新世以来的孢粉及重矿组合，并对三种分带方法进行了比较分析。此外，叙述了几种二维聚类分析方法，用以分析表土数据，结果表明，几种方法都在环境分区中获得了满意的效果，但又各有特点。     

线性不适定问题的渐近正则化方法

对线性不适定问题考虑了一类近似求解方法，即渐近正则化方法，当数据精确给定时，考虑了渐近正则化解的收敛性及收敛速度，并给出了一些逆结果。如果右端数据是近似给定的，证明了所叙方法确实为正则化方法，并考虑了偏差原理对它的应用。为了使的工作更加实际可行，还考虑了算子和右端数据同时近似给定的情形，得到了一系列的结果。     

对多等级质量产品（以σ衡量）抽样数n值对计算及分极标准的制定方法

本文利用抽样分布理论，对以σ衡量质量的多等级产品质量检验问题，提出了一个具体的处理方法，该方法给出了计算抽样数的公式，也给出了确定各等级之间距离的计算方法，提示了抽样置信度、抽样数ｎ、等级距离三者之间的关系。并按本文的方法，提出了对广东商检局出口桑蚕丝原抽样方案的修改意见。     

目标规划在大学生学习成绩预测中的应用

大学生学习成绩预测是非常有必要的。文章首先介绍了用最小二乘法进行线性回归预测的方法，并分析了其缺点，即当存在着极端的异常情况时，往往存在着较大的预测误差。其次文章介绍了另一种建立预测方程的方法——目标规划法，并详细分析了模型的建立过程。文章最后举了一实例，将两种方法进行了比较，结果证明，当存在着异常情况时，目标规划是一种较好的预测方法。     

一类求解常微分方程数值解的块方法

本文讨论了一类并行计算常微分方程初值问题的带有高阶导数的块隐式混合单步方法，这种方法可以在Ｋ台处理机上并行进行数值计算，本文对方法的一般性质及收敛性进行了讨论，得知该方法的阶数为２ｌ＋１，并且指出当ｌ＝１，２时，方法是Ａ－稳定的，最后给出了一个数值例子。     

双函数法及一类非线性发展方程的精确行波解

给出一种求解非线性发展方程精确行波解的新方法：双函数法。使用此方法，获得了一类非线性发展方程的许多精确行波解，其中包括孤波解和周期解，推广了文献用其它方法取得的结果，同时还获得了许多新的弧波解和周期解，借助于Mathemat-ica，此方法能部分地在计算机上实现。     

固定样组纵向调查"间歇式"期单元无回答的加权调整

期单元无回答误差是固定样组纵向调查中经常出现的一类抽样误差，如果不对之进行调整，则往往造成估计量的偏差，已经提出的两种加权调整方法不易处理“间歇式”期单元无回答。在本文中，我们提出了纵横加权调整方法，这一方法克服了已有方法的不足，我们所作的模拟研究表明，纵横加权方法降低了估计量的偏差，并在作两调查期指标均值变化分析时，充分利用了两期回答状态的相关信息，提高了变化估计量的准确度。     

周期分岔解的鲁棒控制

根据C-L方法，可以得到非线性动力系统的分岔方程和拓扑分岔图，根据得到的分岔图，结合控制理论，提出了周期解的鲁棒控制方法，该方法将运动模式控制到目标模式，由于该方法对控制器的参数没有严格的控制，所以在设计和制造控制器方面是很方便的，数值研究验证了该方法的有效性。     

Finite Factor Representations of 2-Step Nilpotent Groups and the Orbit Method

In this paper, we describe factor representations of discrete 2-step nilpotent groups with 2-divisible center in the spirit of the orbit method. We show that some standard theorems of the orbit method are valid for these groups. In the case of countable 2-step nilpotent groups we explain how to construct a factor representation starting with an orbit of the “coadjoint representation.” We also prove that every factor representation (more precisely, every trace) can be obtained by this construction, and prove a theorem on the decomposition of a factor representation restricted to a subgroup. Bibliography: 7 titles. __________ Translated from Zapiski Nauchnykh Seminarov POMI, Vol. 307, 2004, pp. 120–140.     

Von Neumann代数中的套子代数

本文主要讨论因子Ｖｏｎ Ｎｅｕｍａｎｎ代数中套子代数上的线性满等距和自伴导子．证明了因子Ｖｏｎ Ｎｅｕｍａｎｎ代数中套子代数上的每个线性满等距是同构乘酉算子或者是反同构乘酉算子；给出了其上自伴导子是内导子的条件并得到有限因子 Ｖｏｎ Ｎｅｕｍａｎｎ代数中套子代数上的每个自伴导子都是内导子．     

Boundary measures of Markov chains

It is known that each Markov chain has associated with it a polytope and a family of Markov measures indexed by the interior points of the polytope. Measure-preserving factor maps between Markov chains must preserve the associated families. In the present paper, we augment this structure by identifying measures corresponding to points on the boundary of the polytope. These measures are also preserved by factor maps. We examine the data they provide and give examples to illustrate the use of this data in ruling out the existence of factor maps between Markov chains. E. Cawley was partially supported by the Modern Analysis joint NSF grant in Berkeley. S. Tuncel was partially supported by NSF Grant DMS-9303240.     

因子分析法在区县经济综合指标评析中的应用

本文运用因子分析法对重庆市2000年各区县经济的综合指标进行评价,通过使用SPSS统计软件计算和分析,提出了以综合因子和第一主因子的得分大小作为经济发展的综合实力的度量,给出了重庆市2000年的各区县经济综合实力的排名次序,并对各主因子的得分情况给出了相应评价。     

Constant factor approximation for ATSP with two edge weights

We give a constant factor approximation algorithm for the Asymmetric Traveling Salesman Problem on shortest path metrics of directed graphs with two different edge weights. For the case of unit edge weights, the first constant factor approximation was given recently by Svensson. This was accomplished by introducing an easier problem called Local-Connectivity ATSP and showing that a good solution to this problem can be used to obtain a constant factor approximation for ATSP. In this paper, we solve Local-Connectivity ATSP for two different edge weights. The solution is based on a flow decomposition theorem for solutions of the Held–Karp relaxation, which may be of independent interest.     

非嵌套网格上的Morley元两水平加性Schwarz方法

1．引言设0是RZ中的有界多边形区域，其边界为Rfl．考虑下面的重调和Dirichlet问题：（1．1）的变分形式为：求。EHI（fi）使得对？／EL‘（m，问题（1．幻的唯一可解性可由冯（m上的M线性型的强制性和连续性以及La。Mlgram定理得出（of［4］）．令人一｛丸）是n的一个三角剖分，并且满足最小角条件，其中h是它的网格参数．设Vh为Money元空间［41．问题（1．2）的有限元离散问题为：求。eVh使得当有限元参数人很小时，这个方程组很大，而且矩阵A的条件数变得非常大，直接求解，存贮量及计算量都很大．如果B可逆，则方程组（1．4）等…     

Central limit theorem and sample complexity of stationary stochastic programs

In this paper we discuss sample complexity of solving stationary stochastic programs by the Sample Average Approximation (SAA) method. We investigate this in the framework of Optimal Control (in discrete time) setting. In particular we derive a Central Limit Theorem type asymptotics for the optimal values of the SAA problems. The main conclusion is that the sample size, required to attain a given relative error of the SAA solution, is not sensitive to the discount factor, even if the discount factor is very close to one. We consider the risk neutral and risk averse settings. The presented numerical experiments confirm the theoretical analysis.     

Classification of Mixtures of Spatial Point Processes via Partial Bayes Factors

Motivated by the problem of minefield detection, we investigate the problem of classifying mixtures of spatial point processes. In particular we are interested in testing the hypothesis that a given dataset was generated by a Poisson process versus a mixture of a Poisson process and a hard-core Strauss process. We propose testing this hypothesis by comparing the evidence for each model by using partial Bayes factors. We use the term partial Bayes factor to describe a Bayes factor, a ratio of integrated likelihoods, based on only part of the available information, namely that information contained in a small number of functionals of the data. We applied our method to both real and simulated data, and considering the difficulty of classifying these point patterns by eye, our approach overall produced good results.     

On the parameterization of the CreditRisk model for estimating credit portfolio risk

The CreditRisk⁺ model is one of the industry standards for estimating the credit default risk for a portfolio of credit loans. The natural parameterization of this model requires the default probability to be apportioned using a number of (non-negative) factor loadings. However, in practice only default correlations are often available but not the factor loadings. In this paper we investigate how to deduce the factor loadings from a given set of default correlations. This is a novel approach and it requires the non-negative factorization of a positive semi-definite matrix which is by no means trivial. We also present a numerical optimization algorithm to achieve this.     

Finiteness of small factor analysis models

We consider factor analysis models with one or two factors. Fixing the number of factors, we prove a finiteness result about the covariance matrix parameter space when the size of the covariance matrix increases. According to this result, there exists a distinguished matrix size starting at which one can determine whether a given covariance matrix belongs to the parameter space by determining whether all principal submatrices of the distinguished size belong to the corresponding parameter space. We show that the distinguished matrix size is four in the model with one factor and six with two factors.