Fourier-Feynman transform, convolution and first variation

We examine several interesting relationships and expressions involving Fourier-Feynman transform, convolution product and first variation for functionals in the Fresnel class F(B) of an abstract Wiener space B. We also prove a translation theorem and Parseval's identity for the analytic Feynman integral. This revised version was published online in June 2006 with corrections to the Cover Date.     

3-正则图的分割问题是NP-完全问题

证明了3-正则图的最小平分问题和最小α-分割问题都是NP-完全问题.     

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

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

Universal elementary constituents of potential transformations shifting waves (qualitative theory)

It is shown that the potential perturbation that shifts a chosen standing wave in space is a block of potential barrier and well for every wave bump between neighbouring knots. The algorithms shifting the range of the primary localization of a chosen bound state in a potential well of finite width are as well applicable to the scattering functions if states of the continuous spectrum are considered as bound states normalized to unity but distributed on an infinite interval with vanishing density. The potential perturbations of the same type on the half-axis concentrate the scattering wave at the origin, thus creating a bound state embedded into the continuous spectrum (zero width resonance).     

一种探测二维电磁目标的新方法

电磁目标的探测对通信而言有着十分重要的意义。本文描述一种收敛迅速、结果准确、抗强随机噪声的探测二维电磁目标的新方法。首先从体等效原理出发得到一个积分方程组，此方程组可求解散射问题。随后，对此方程组求变分，变形后得到散射场变化与介电参数变化之间关系的矩阵方程，即反演方程。文中列举了几个例子，通过数值实验结果证明本法收敛速度快、反演精度高、适应复杂目标的能力强，能抗强随机噪声干扰     

集值Lebesgue—Stieltjes积分

本文首先刻划了B(R_ )上的集值测度,其次建立了(R_ B(R_ ))上的集值Lebesgue-Stieltjes积分.最后,进—步建立了集值随机Lebesgue-Stietjes积分的理论.     

单模光纤最小群速度色散波长附近的调制不稳定性

利用修正的非线性Ｓｃｈｒｏｄｉｎｇｅｒ方程研究了单模光纤最小群速度色散波长附近的调制不稳定性，发现了一个新的由光纤四色散导致的调制不稳定性区域，该区域的调制范围与初始入射脉冲的功率和四阶色散有关。     

输入——输出迭代算法中松弛因子的确定

本文利用变分的手段提示了输入—输出迭代算法中松弛因子的取值规律。     

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

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

Extreme behavior of bivariate elliptical distributions

This paper exploits a stochastic representation of bivariate elliptical distributions in order to obtain asymptotic results which are determined by the tail behavior of the generator. Under certain specified assumptions, we present the limiting distribution of componentwise maxima, the limiting upper copula, and a bivariate version of the classical peaks over threshold result.