线性脉冲时滞微分方程解的稳定性

通过对一类n阶线性脉冲时滞微分方程零解稳定性的讨论，建立了零解稳定性的比较结果，给出了零解一致稳定、渐近稳定与指数稳定的充分条件．所得结论推广了相关结果。     

焊接结构疲劳强度预测的局部法研究

以焊缝附近局部半圆区域的平均应力为控制参数,得到焊接结构疲劳切口系数的计算理论,在考虑材料、结构几何形式、残余应力等因素对疲劳强度影响的基础上,建立了对称循环和非对称循环时焊接结构有效应力集中系数预测的局部法模型.通过对几类错位板接头的有限元计算分析,得到这些焊接结构焊缝附近局部区域的应力场,进而预测它们的疲劳强度,并将预测结果与疲劳试验进行了比较,获得了令人满意的结果.用局部法预估焊接结构的疲劳强度,能大量减少疲劳实验,节省经费开支,对工程应用有参考价值     

二阶非线性中立型时滞差分方程的正解存在性和振动性

研究了一类二阶非线性中立型时滞差分方程△^2（x（n）＋^m∑i=1Pi（n）x（n-ki））＋q（n）f（x（n-σ））=0的最终正解的存在性，并得出了其解振动的充分条件.     

基于控制历史的延迟系统模糊控制及其仿真

通过对传统模糊控制器的改进，提出一种新型的适合于变延迟系统的控制方法。在对控制对象动态特性的研究的基础上，将控制历史引入控制器的决策过程，设计出了一种基于控制历史的延迟系统模糊控制器。与传统的模糊控制器相比，该模糊控制器用历史的控制信息代替偏差变化率作为模糊控制的决策依据，能够及时地反映出被控制量的变动趋势。仿真结果表明，所提出的控制方法可以明显地改善对延迟对象的控制效果，并具有较强的适应性。     

Stability of discrete Hopfield neural networks with delay

1.INTRODUCTION DiscreteHopfieldneuralnetwork(DHNN)isoneof thefamousneuralnetworkswithawiderangeofap plications,suchascontentaddressablememory,pat ternrecognition,andcombinatorialoptimiza tion[1～5].ThestabilityofDHNNmeansthatevery trajectorymustconvergetowardsanequilibrium point,oralimitcycle.Becausethestabilityof DHNNisthefoundationofthenetwork’sapplica tionsandisthemostbasicandimportantproblem,thestabilityanalysisoftheDHNNhasattractedcon siderableinterest.Manyresearchershavefocu…     

A Theoretical Approach for Estimating Fracture Toughness of Ductile Metals

Fracture toughness is very important when applying Damage Tolerance Design and Assessment Techniques. The traditional testing approach for obtaining fracture toughness values is costly and time consuming. In order to estimate the fracture toughness of ductile metals, the fracture mechanics theory, materials plastic deformation theory and materials constructive relationships are employed here. A series of formulae and a theoretical approach are presented to calculate fracture toughness values of different materials in the plane stress and plane strain conditions. Compared with test results, evaluated values have a good agreement.     

Packet Queueing Delay in Resilient Packet Ring Network Nodes

The packet queueing delay is one of the most important performance measures of a data network and is also a significant factor to be considered in the scheduling buffer design for a network node. This paper presents a traffic queueing model for resilient packet ring (RPR) networks and a method for quantitatively analyzing queueing delays in RPR nodes. The method was used to calculate the average queueing delays of different priority traffic for different transit queue modes. The simulations show that, in the transmit direction, lower priority traffic is delayed more than higher priority traffic, and that Class-A traffic is delayed more in a single-queue ring than in a dual-queue ring. In the transit direction, the secondary transit buffer in the dual-queue ring contributes more to the traffic delay than the primary transit buffer in the single-queue ring, which in turn causes more delay than the primary transit buffer in the dual-queue ring.     

Ionospheric eclipse factor method (IEFM) for determining the ionospheric delay using GPS data

By establishing the ionospheric eclipse factor (IEF) λ of the ionospheric pierce point (IPP) and its ionospheric influence factor (IFF) λ, and combining λ, λ with t of IPP, a new method of modeling high-precision ionospheric delay using GPS data-ionospheric eclipse factor method (IEFM)-is presented in this paper. The IEFM can effectively select the proper ionospheric models to model the total electron content (TEC) with different changes corresponding to annual, seasonal and diurnal variations. Initial experimental results show that the correction precision of ionospheric delay modeled by the IEFM seems to be close to that of using L3 GPS observations to directly correct the corresponding ionospheric delay.     

交通控制子区划分方法研究

交通控制子区划分主要将相邻的众多交叉口划分为若干个交通子区进行干线协调控制,可有效缓解交通拥堵现象,但现有方法划分出的交通子区无法满足实际协调控制的准确性与鲁棒性。为解决这一难题,结合当前流行的划分技术,考虑4个影响因素:信号交叉口间距、交通流量、周期、通行能力,建立模糊C均值聚类划分方法,再通过实例,借助Vissim仿真软件,验证方法的适用性与可行性。Vissim仿真结果表明:与传统协调控制方法相比,方法可使系统车均延误时间减少27%,协调相位行车时间减少20%。     

立即可解网络编码应用于无线网络重传中的时延分析

立即可解网络编码(instantly decodable network coding,IDNC)分为狭义立即可解网络编码(strict IDNC,S-IDNC)和广义立即可解网络编码(generalized IDNC,G-IDNC).分析了S-IDNC和G-IDNC的特点,并对这2种思想应用于重传的时延性能做了对比分析.以最小化解码时延为目标提出基于S-IDNC和基于G-IDNC权重顶点搜索算法,实验对比分析了所提算法和已有典型算法性能,验证了所提算法的有效性,并归纳了S-IDNC和G-IDNC的时延特征差异.实验结果表明,基于S-IDNC的重传算法使得信宿节点的时延大小分布较为聚集,而基于G-IDNC的重传算法时延大小分布更为分散,G-IDNC时延均值优于S-IDNC,而S-IDNC系统完成时延优于G-IDNC.