工程施工中运输网络优化方案

施工工地运输方案的优化设计可以归结为 :按施工期要求设计运输线路或验证已有线路通行能力 ,计算总线路中影响提高流量的关键路段 ,取得最小费用最大流 .本文运用图论理论这一数学工具把实际问题抽象为有向网络 ,进而建立数学模型 .此方法理论上严密 ,解题步聚直观清晰 ,对水利、公路、水路、铁路等其它运输系统有普遍意义 .     

非线性控制系统的最小实现

对于那些由代数微分方程描述的具有输入输出关系的非线性控制系统，本文采用两种方法讨论了其最小实现问题：一种方法是直接计算系统的特征列；另一种方法则采用了本原元定理．两种方法给出的最小实现所需的状态变量最小数目是相等的．文中的大量代数与微分运算则可利用数学机械化来完成     

层次分析中广义最小偏差法的性质

广义最小偏差法（GLDM）是层次分析中一种重要的排序方法．本文讨论了广义最小偏差法的性质和灵敏度分析问题．     

数字散斑干涉技术在振动分析中的应用

首次将相移技术应用于频闪数字散斑干涉计量中,对物体的振动进行了定量分析.实验证明,这种方法有广泛的实用价值.另外,介绍了一套自动分析系统,讨论了各参数对测量结果的影响.     

A NUMERICALLY STABLE BLOCK MODIFIED GRAM-SCHMIDT ALGORITHM FOR SOLVING STIFF WEIGHTED LEAST SQUARES PROBLEMS

Recently, Wei in proved that perturbed stiff weighted pseudoinverses and stiff weighted least squares problems are stable, if and only if the original and perturbed coefficient matrices A and A^- satisfy several row rank preservation conditions. According to these conditions, in this paper we show that in general, ordinary modified Gram-Schmidt with column pivoting is not numerically stable for solving the stiff weighted least squares problem. We then propose a row block modified Gram-Schmidt algorithm with column pivoting, and show that with appropriately chosen tolerance, this algorithm can correctly determine the numerical ranks of these row partitioned sub-matrices, and the computed QR factor R^- contains small roundoff error which is row stable. Several numerical experiments are also provided to compare the results of the ordinary Modified Gram-Schmidt algorithm with column pivoting and the row block Modified Gram-Schmidt algorithm with column pivoting.     

浙江中部夏熟作物田主要杂草生态相似性的数量分析

应用七级目测法对浙江中部地区27个夏熟作物田样点的杂草进行了优势等级调查，将所得数据转换成重要值，以杂草在27个样点中的重要值为运算指标，应用主成分分析法和图论聚类中的最小生成树法，对24种杂草的生态学相似性进行了比较，指出了长期使用单一的除草剂导致农田杂草种群迅速更迭的原因：杂草对除草剂的敏感性差异及不同杂草间的生态学特性的差异。     

运输网络中最小饱和流的求解

运输网络中常常由于流量的不可控易发生堵塞现象.网络发生堵塞时的饱和流值达不到最大流值.最小饱和流是运输网络,尤其是紧急疏散网络设计中很重要的一个参数.通过建立网络的割集矩阵来确定网络的堵塞截面,基于此提出了求解最小饱和流的线性规划模型及算法.举例分析表明,利用该算法计算网络最小饱和流更加简便、更加实用.     

Hilbert Space of Probability Density Functions Based on Aitchison Geometry

The set of probability functions is a convex subset of L1 and it does not have a linear space structure when using ordinary sum and multiplication by real constants. Moreover, difficulties arise when dealing with distances between densities. The crucial point is that usual distances are not invariant under relevant transformations of densities. To overcome these limitations, Aitchison＇s ideas on compositional data analysis are used, generalizing perturbation and power transformation, as well as the Aitchison inner product, to operations on probability density functions with support on a finite interval. With these operations at hand, it is shown that the set of bounded probability density functions on finite intervals is a pre-Hilbert space. A Hilbert space of densities, whose logarithm is square-integrable, is obtained as the natural completion of the pre-Hilbert space.     

椭圆强非局域空间光孤子

对傍轴椭圆高斯光束在具有椭圆对称响应特性的强非局域非线性介质中的演化规律进行研究，得到了光束各参量演化的精确解析解，分析了单向空间光孤子和强非局域椭圆空间光孤子的形成条件，发现了椭圆光孤子的相移与介质响应函数的椭圆率有关. 关键词： 椭圆对称强非局域响应介质 椭圆强非局域空间光孤子 相移