矩形截面梁中波传播的精确分析

将傅立叶级数方法推广应用于矩形截面梁中波传播的精确分析．不仅试着直接从三维弹性动力学方程出发,导出了矩形截面梁中波传播的一般解析解,而且给出了弹性波在自由矩形截面梁中的传播特性．波传播精确模型的提出,为实现梁波的耦合控制奠定了坚实基础．     

一维非线性周期结构中弹性波传播的辛数学方法

利用辛数学方法分析了质量-弹簧非线性周期结构链中弹性波的传播问题．首先利用能量方法得到频域动力方程,随后通过小量变换将非线性动力方程线性化,得到辛矩阵,进而通过求解辛矩阵的本征值问题来研究波的传播性能．质量-弹簧模型中的弹簧刚度非线性对结构链的传播特性影响很大,研究发现非线性明显改变了周期结构的传播性能,而且不同于线性结构,非线性结构的传播特性与入射波强度有关．数值算例表明随着非线性强度及入射波强度的增大,传播通带宽度逐渐减小,禁带宽度逐渐增大．当入射波强度增大到一定值时,弹性波无法在结构中进行传播．与一般递归方法的比较分析,验证了辛数学方法在非线性周期结构波传播问题中的有效性与优越性．     

横观各向同性含液饱和多孔介质中应力波传播的特征分析

根据广义特征理论,对横观各向同性含液饱和多孔介质中应力波传播特性进行了特征分析．给出了特征曲面的微分方程以及沿次特征线的相容条件,得到了波阵面的解析表达式．详细地讨论了应力波在横观各向同性含液饱和多孔介质中传播时,其速度曲面和波阵面的形状及性质．分析结果亦表明,纯固体中应力波传播的特征方程,是含液饱和多孔介质中应力波特征方程的特例．     

弹塑性杆在刚性块轴向撞击下的动力屈曲

基于能量原理,对弹塑性杆在刚性块轴向撞击下的动力屈曲问题进行了讨论．用特征线法分析了刚性块轴向撞击弹塑性直杆时应力波传播的过程．考虑了弹塑性应力波传播对屈曲的影响,建立了该问题横向扰动方程．用幂级数解法,理论上给出了该问题的级数解．分析解的性质,得到了发生屈曲时的临界条件．通过理论分析和数值计算,得到了临界速度与冲击质量、临界长度及线性强化模量间的关系．     

3-D涡块边界曲面高阶正则性的传播

本文讨论了涡块问题边界曲面高阶正则性的传播，同时解决了［８］中所提出的关于边界曲面Σ０的高阶正则性的传播问题．     

横观各向同性广义热弹性扩散Rayleigh波在自由表面上的传播

基于广义热弹性扩散理论，边界无应力作用、绝热／恒温和化学势边界条件作用下，研究均匀、横观各向同性、热弹性扩散半空间Rayleigh波的传播．采用Green和kndsay（GL）理论，热扩散和热扩散．力学松弛条件采用4个不同的时间常数加以控制．导出了所研究介质中表面波传播的久期方程．为了说明和比较分析结果，用图形示出了各向异性和扩散对相速度、衰减系数的影响．同时，还推导了某些特殊情况下的频率方程．     

海洋波导的可穿透障碍物散射场远场分布的若干性质

研究了海洋波导中可穿透目标时谐声波散射传播远场分布的性质,构造了透射问题解的集合,使得所构造解的集合在边界上的限制在某个Hilbert空间中是稠密的,确定了传播远场分布的集合在某个Hilbert空间中是完备的．这些性质对研究海洋波导中的逆透射问题有重要的应用．     

基于复杂网络的邮件病毒的传播模型

本文以电子邮件病毒为例，通过构建改进的SEIR病毒传播模型，并结合更符合实际的复杂网络与人际关系对病毒的传播特性进行深入研究。从用户的主观与客观等多种角度研究了有效拉制病毒在网络中快速传播的方式．理论分析及仿真实验表明，通过对实际生活中某些参数的控制，能有效遏制邮件病毒在网络中的传播．‘     

小幅度非均匀倾斜水底上的波浪非线性演化

天然沙质海岸上存在着不同形状的床面,波浪在其上面的传播过程是一典型的非线性演化过程．以此为工程背景,利用摄动方法对小幅度非均匀倾斜床面上波浪的非线性传播过程进行了探讨,给出了解析的表达式,并与相关的实验资料进行了比较分析,结果表明,所建立的波浪演化模型能够反映实际情况．     

基于最小参数区间集的不确定结构响应分析

考虑到实际工程问题中普遍存在不确定性,完成了针对工程结构从定量化到传播的完整不确定性分析过程．通过建立包含全部有限样本点的最小区间/超立方体域来描述不确定参数的变化范围;借助于最小区间参数集,开展了不确定结构传播分析的研究工作以确定其最有利/不利响应．此外,进一步就给出的区间分析方法同经典概率方法的相容性进行了分析和探究．采用2个数值算例很好地论证了所述方法的正确性和可行性．     

两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

沪深股市收益的相关性

以概率作为相关度量指标,分整体相关性和尾部相关性对沪深两市收益进行考察。整体相关性采用概率方法中的变化协调形成的相关性作为度量,结果表明沪深两市收益在整体上具有一定的正相关性。对于尾部相关性,先用t分布分别拟事两市收益底分布,然后用蒙特卡洛模拟确定尾部的最优门限,进而求得尾部相关性,结果显示当市场剧烈波动时两市收益具有正的相关性,且比整体相关性强,尤其在暴跌的时候,两市具有很强的正相关性。     

On the density of the minimal subspaces generated by discrete linear Hamiltonian systems

This paper focuses on the density of the minimal subspaces generated by a class of discrete linear Hamiltonian systems. It is shown that the minimal subspace is densely defined if and only if the maximal subspace is an operator; that is, it is single valued. In addition, it is shown that, if the interval on which the systems are defined is bounded from below or above, then the minimal subspace is non-densely defined in any non-trivial case.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

An Improved Branch & Bound Method for the Uncapacitated Competitive Location Problem

In this paper, the problem of locating new facilities in a competitive environment is considered. The problem is formulated as the firm expected profit maximization and a set of nodes is selected in a graph representing the geographical zone. Profit depends on fixed and deterministic location costs and, since customers are independent decision-makers, on the expected market share. The problem is an instance of nonlinear integer programming, because the objective function is concave and submodular. Due to this complexity a branch & bound method is developed for solving small size problems (that is, when the number of nodes is less than 50), while a heuristic is necessary for larger problems. The branch & bound is called data-correcting method, while the approximate solutions are obtained using the heuristic-concentration method.     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

���������˻�����������ͽ�ģ������Ӧ��

At present, in degradation tests, product failure is generally defined as degradation of performance below or above a specified critical value (that is called single point degradation). Although this definition is simple and practical, it is not reasonable enough and degradation failure of the product can not be completely described. In this paper, a single point degradation model is improved, and an interval degeneration model is proposed. We discuss the interval degradation model when the degradation path is liner, and obtain life distribution functions for all kinds of linear interval degradation model. Numerical integration and Monte Carlo simulation methods are used to analyze and compare the life distribution of the interval degradation model and the single point degradation model, and the relationship between the interval degradation and the single point degradation is revealed. Finally, an real data example is analysis to show that interval egradation is more reasonable and effective in practice.     

Compromise solutions and estimation of the noninferior set

A general framework is presented in which the relation of the set of noninferior points and the set of compromise solutions is studied. It is shown that the set of compromise solutions is dense in the set of noninferior points and that each compromise solution is properly noninferior. Also, under convexity of the criteria space, a characterization of the properly noninferior points in terms of the compromise solutions is presented. In this characterization, the compromise solutions depend continuously on the weights. Use of the maximum norm is studied also. It is shown that a subset of these max-norm solutions, obtained by taking certain limits of compromise solutions, is dense and contained in the closure of the set of noninferior points.     

油田注水系统拓扑布局优化的混合遗传算法

以投资最小为目标函数,建立了注水系统拓扑布局优化数学模型.根据模型特点,将优化问题分为两层,分别采用遗传算法和非线性优化方法进行求解.并对遗传算法的操作过程进行了改进,调整了适应函数,改进了交叉和变异操作,结合了模拟退火算法,在操作过程中使约束条件得到满足,减少了不可行解的产生,使遗传算法的优化性能得到了提高.优化算例说明了该方法的有效性.