轮轨接触应力的有限元分析

利用ANSYS有限元分析软件对轮轨接触进行了弹性静力分析,模拟了轮轨真实的几何形状和边界条件,分别研究了轴重、轮径、横移量对接触应力的影响,并对各种参数的变化规律进行了分析,得出了轮轨间接触应力的分布规律。     

A Note on Shor’s Quantum Algorithm

Introduction Factoring integers is generally thought to behard on a classical computer. But it is now heldthat prime factorization can be accomplished inpolynomial time on a quantum computer. This re-markable work is due to Shor[1]. For a given num-ber n, he gave a quantum computer algorithm forfinding the order r of an element x (mod n) insteadof giving a quantum computer algorithm for factor-ing n directly. The indirect algorithm is feasiblebecause factorization can be reduced to finding th…     

小波神经网络应用于电子政务信息系统安全风险评估

针对电子政务信息系统风险评估的复杂性和不确定性,作者提出了小波神经网络评估方法,建立了小波神经网络评估模型,最后采用Matlab7.1工具进行了仿真实验,并分别从网络的收敛速度、训练精度和训练效果上与BP神经网络算法作了对比。结果证实该方法有效克服了传统方法中人为分配权重带来的主观性,使评价结果更科学,更合理。     

Network Decomposition and Maximum Independent Set Part Ⅱ：Application Research

According to the researches on theoretic basis in part I of the paper，the spanning tree algorithms solving the maximum independent set both in even network and in odd network have been developed in this part，part Ⅱ of the paper．The algorithms trans form first the general network into the pair sets network，and then decompose the pair sets network into a series of pair subsets by use of the characteristic of maximum flow passing through the pair sets network．As for the even network，the algorithm requires only one time of trans formation and decomposition，the maximum independent set can be gained without any iteration processes，and the time complexity of the algorithm is within the bound of O(｜V｜^3)．However，as for the odd network，the algorithm consists of two stages．In the first stage，the general odd network is transformed and decomposed into the pseudo-negative envelope graphs and generalized reverse pseudo-negative envelope graphs alternately distributed at first；then the algorithm turns to the second stage，searching for the negative envelope graphs within the pseudo-negative envelope graphs only．Each time as a negative envelope graphhas been found．renew the pair sets network by iteration at once．and then tum back to the first stage．So both stages form a circulation process up to the optimum．Two available methods，the adjusting search and the picking-off search are specially developed to deal with the problems resulted from the odd network．Both of them link up with each other harmoniously and are embedded together in the algorithm．Analysis and study indicate that the time complexity of this algorithm is within the bound of O(｜V｜^5)．     

��������������������������� �滮ģ�ͼ��ⷨ�о�

合理规划区域性物流配送中心，对于提高物流配送服务水平，降低物流配送成本具有重要意义.实际物流配送系统中，需求点的物流配送需求是随机变量.因此，传统的把配送需求假定为已知常数的规划模型，不能反映需求量的随机性对区域性物流配送中心规划的影响.本文研究当物流需求量为随机变量时，区域性配送中心的随机规划模型和解法.由于引入了随机变量，所建立的规划模型更加符合实际;在模型求解过程中,则利用了确定性等价及过滤条件把模型简化成了多个简单的线性规划子问题,简化了模型求解，从而使之更易于在区域性物流配送中心的规划中得到运用.     

���ڡ�������������̾�·�㷨

最短径路是网络优化中的一个经典问题，Dijkstra算法被公认为是一种十分有效的最短径路的搜索求解算法．本在研究网络一般结构特点的基础上，发现传统Dijkstra算法在每次迭代过程中都需要搜索所有节点的这一缺陷，通过向搜索节点中引入“度”的信息，提出了基于“度搜索”的改进算法，并根据网络的特点，给出了有向网络和无向网络两种情况下存在“度”差异的算法设计方法；算法的整体结构与Dijkstra保持了一致性，没有算法结构的突变，因而通过修改原有Dijkstra程序和重新设计“度搜索”程序都十分容易实现．该算法提高了最短径路的搜索效率，特别是对稀疏网络，算法效率更为明显，其复杂度小于O(｜V｜^2)．     

IMPROVED GENETIC ALGORITHM TO OPTIMAL PORTFOLIO WITH RISK CONTROL

1IntroductionAlog-optimalinvestimentportfoliowithoutriskconstraintshasbeenintroducedandsystem-aticallystudiedinChapter15ofCoverandl'homas[11.Themodelcanbediscribedasfol-.lows:Astockmarketisrepresentedasavectorofstocksx=(X,,X,,..',X.)',X,>o,i=1,2,.-',m,wheremisthenumberofstocksandthepricerelativeXirepresentstheratiooftheclos-ingpriceofthecurrentbusinessdaytotheprevi-ousday.LetF(x),x=(x,,x2,..',x-)'eR"bethejointdistributionofvectorX.Aportfoliob=(b,,bs,..',b,)',b,>o,i=l,2,..',m,Zb,=1istheall…     

Non-steady state modelling of wheel-rail contact problem for the dynamic simulation of railway vehicles

This paper deals with the solution of the non-steady state wheel-rail contact problem. Firstly, the existing models are analysed and it is concluded that none of them have the computational efficiency and/or accuracy characteristics required to be used in a railway simulation programme. Following this, a new solution is proposed to the problem that allows obtaining sufficiently accurate results with a relatively low computational cost. During the development of the proposed method it has been assumed that only one type of creepage is variable with respect to the time. Further work is necessary to extend it to more general cases.     

History of wheel/rail contact mechanics: from Redtenbacher to Kalker

The history of wheel/rail contact mechanics is an integrated part of contact mechanics. Problems of wheel/rail contact (damage phenomena and influence of contact mechanics on vehicle dynamics, especially on vehicle stability) have been investigated since the middle of the 19th Century. In 1855, Redtenbacher was the first to consider head checking. Stability investigations started with Boedecker (1887) and were continued by Carter (1916); however, they were not recognized at that time. Stability analysis was only considered to be an integrated step in vehicle design in about 1955 when stability problems started to occur in practice. The scientific foundations of our present investigations are based on Heinrich Hertz, Frederick William Carter and Hans Fromm. The key contributors to research in the last fifty years in the field of wheel/rail contact mechanics are Joost Kalker and Ken Johnson.     

电控高压泵凸轮机构从动部异常磨损分析及试验研究

针对高压、高转速工况下高压泵滚轮工作表面出现异常磨损的现象,利用ANSYS软件对不同偏心轮转角下的偏心轮与滚轮进行了三维弹塑性摩擦接触有限元分析,在此基础上提出了解决方案。试验结果表明方案可行。这对提高高压泵的工作可靠性具有重要的意义。为同类问题的解决提供了一条有效途径。