圆柱壳波动振动响应分析

采用Flugge的壳体理论,计算出有阻尼圆柱壳的固有频率并且推导出波动振动响应的模态解,得到了波动共振转速的计算公式。为了提高计算精度,采用高斯迭代法解计算固有频率的超越函数方程;计算了悬臂圆柱壳的固有频率及共波动响应,绘制了振型图,并与NASA试验值作了对比。     

Convergence rates to the discrete travelling wave for relaxation schemes

This paper is concerned with the asymptotic convergence of numerical solutions toward discrete travelling waves for a class of relaxation numerical schemes, approximating the scalar conservation law. It is shown that if the initial perturbations possess some algebraic decay in space, then the numerical solutions converge to the discrete travelling wave at a corresponding algebraic rate in time, provided the sums of the initial perturbations for the -component equal zero. A polynomially weighted norm on the perturbation of the discrete travelling wave and a technical energy method are applied to obtain the asymptotic convergence rate.

     

NP完全问题多项式时间算法研究

本文从代数及组合两个方面论证了NP完全问题存在多项式时间算法 .以往利用线性规划 (LP)技术来分析NP完全问题中的TSP问题 ,因其存在子环游问题 ,从而使问题得不到有效解决 .文中发展一分层网络 ,在求解TSP问题时 ,存在另一类(不完全 )子环游问题 .但两模型允许解集的交集避免了两类子环游基本可行解 ,从而使TSP问题可利用LP技术多项式时间内得以解决 ,同时给出了求哈密尔顿回路的多项式标记证明方法 ,开创了NPC问题研究的新局面 .     

不确定运行时间环境下的车辆调度问题及启发式算法

考虑到物流公司或者配送中心车辆实际运行过程中时间的不确定性,提出了配送服务线路包含时间窗口、车辆容量约束的随机规划模型,以最小化车辆运行成本同时尽可能降低所服务顾客的不满意度.同时,又稍作改进给出了平均-风险模型,由于VRP问题是NP难的,给出了一种基于禁忌搜索的启发式算法,并以北京市13个点的为例,给出求解结果.     

220 GHz均匀永磁聚焦行波管电子光学系统的设计与实验研究

电子光学系统是行波管的核心部件之一,在太赫兹频段,电子束通道很小,导致高电流密度电子束的传输非常困难。基于220 GHz折叠波导行波管慢波结构设计所需束流参数,根据理论分析和电磁仿真软件,设计了一款采用均匀永磁聚焦对电子束进行约束的电子光学系统。仿真结果显示,当电子束通道直径0.3 mm、长度31 mm时,在阴阳极压差20 kV的条件下阴极发射电流141 mA,电子流通率100%。根据设计结果封接了流通管,实验结果显示,当阴阳极压差20 kV时,阴极发射电流138.5 mA,收集极电流125.5 mA,电子流通率91%。     

Solitary wave and chaotic behavior of traveling wave solutions for the coupled Schr$\ddot{o}$dinger-KdV equations

This paper deals with the coupled Schr$\ddot{o}$dinger-KdV equations by making use of the method of dynamical systems. We obtain some exact explicit parametric representations of the solitary wave and periodic wave solutions in the given parameter regions, and study chaotic behavior of travelling wave solutions.     

Monotone wave-fronts in a structured population model with distributed maturation delay

^** Email: s.gourley{at}surrey.ac.uk We analyse a stage-structured reaction–diffusion modelfor a single species on an infinite 1D domain. Recognising thatnot all individuals may take the same amount of time to mature,the maturation delay is incorporated via a probability distributionfunction, leading to a distributed delay system. The systemis non-local in space, because individuals may have moved whileimmature. A detailed investigation of travelling front solutionsconnecting the extinction state with the positive equilibriumis carried out, focussing attention on the minimum speed andthe qualitative form of the profile, which appears always tobe monotone. A rigorous proof of existence is provided for aspecial, but realistic, choice of the probability distributionfunction representing the maturation delay. Numerical simulationsof the initial value problem are also presented.     

Non-Linear Binding and the Diffusion–Migration Test

In this paper we investigate the non-linear binding effects upon the diffusion–migration test. For the diffusion test we derive the conditions required for the non-linear binding isotherm to produce an actual penetration front. When more than two ion species are present we show that the diffusion coefficient associated with a particular ion cannot be extracted from the diffusion test on account of multi-species electrical effects. In the migration test where an external electrical field is applied to the sample, we give the conditions required for the propagation of a stable travelling wave. In addition new explicit expressions of the time-lag are obtained for both tests, allowing the determination of the properties of the unknown binding isotherm whatever its physical nature. Throughout the paper the results and the method are illustrated by the diffusion of the Cl^– ion within cement-based materials, using experimental data extracted from literature. The theoretical predictions compare well to these experimental data.     

Approximation Algorithms for Pick-and-Place Robots

In this paper we study the problem of finding placement tours for pick-and-place robots, also known as the printed circuit board assembly problem with m positions on a board, n bins containing m components and n locations for the bins. In the standard model where the working time of the robot is proportional to the distances travelled, the general problem appears as a combination of the travelling salesman problem and the matching problem, and for m=n we have an Euclidean, bipartite travelling salesman problem. We give a polynomial-time algorithm which achieves an approximation guarantee of 3+. An important special instance of the problem is the case of a fixed assignment of bins to bin-locations. This appears as a special case of a bipartite TSP satisfying the quadrangle inequality and given some fixed matching arcs. We obtain a 1.8 factor approximation with the stacker crane algorithm of Frederikson, Hecht and Kim. For the general bipartite case we also show a 2.0 factor approximation algorithm which is based on a new insertion technique for bipartite TSPs with quadrangle inequality. Implementations and experiments on real-world as well as random point configurations conclude this paper.     

Constant rate production of geothermal fluid from a two-phase vertical column II: Examples

The theory of the preceeding paper is applied to some representative numerical examples. Good agreement is achieved between the analytical approximations and the numerical results.Nomenclature B withdrawal from bottom of block - T withdrawal from top of block - M withdrawal from middle of block - P piecewise-linear relative permeabilities - C Corey relative permeabilities