海峡西岸经济区经济发展水平与差距分析——基于与长三角、珠三角的对比

本文从人均GDP和产业结构等角度对海峡西岸经济区（福建）与长三角（上海、江苏、浙江）、珠三角（广东）的经济发展水平做了静态和动态的比较分析,寻找     

纯电动汽车车身材料轻量化应用现状浅谈

纯电动汽车是新能源汽车中的重要一员,在我国备受瞩目与欢迎,应用的范围也非常广泛,大到城市,小到农村都能见到它的身影。车身作为纯电动汽车的重要组成部分,对纯电动汽车的安全性、续驶里程等都有重要影响。近年来,除传统的车身高强度钢材外、铝合金、碳纤维、塑料等强度高、密度小的材料在纯电动汽车车身上应用越来越多,对纯电动汽车轻量化起着越来越重要的作用。     

拖带大型无动力船舶通过内河桥梁水域关键技术分析

通过对大型无动力拖带船队的运动特点,内河桥梁水域通航环境的特点以及大型船队操纵的复杂性进行分析,以拖带5.7万t级无动力海船通过南京长江大桥为例,对大型无动力船拖带船队的拖船配置、拖带方式、起拖时机、拖带演习、拖航期间的安全维护、拖带作业的注意事项和应急预案等关键技术进行分析.     

预制钢筋混凝土桁架拱桥的设计与施工

以一座五跨(5×30m=150m)钢筋混凝土桁架拱桥为工程背景,介绍了预制钢筋混凝土桁架拱桥的设计和施工中需要考虑的一些主要问题。     

Network Decomposition and Maximum Independent Set Part Ⅰ:Theoretic Basis

IntroductionItisofsignificanttheoreticalmeaningtofindthemaximumindependentsetwithinanetwork .Thisisnotonlyrelatedtoclique ,nodecovering ,coloringandmatchingissues ,butalsoassociatedwithmanycombinatorialoptimization problems .In practicalapplications ,find…     

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)．     

网络分解及最大独立集算法研究（Ⅰ）

本文首先分析了一般网络的结构特征，开发出对任意网络进行变换及分解、且不丢失可行解的新方法，继而发现了网络中具有优化迭代功能的特殊子网络；对其进行了较深入的研究，提出并论证了求最大独立集的充要条件：研制出在网络中系统搜索该特殊子网络的新算法。最后，对算法的有效性及可靠性，进行了较全面的分析论证，研究表明，该算法可在时间复杂性O(|V|^5)界内收敛。     

农村客运公共财政保障政策研究

近年来,我国新农村建设步伐加快,"村村通"工程改善了农村的基础条件,使农村居民的出行得到了重大的改善。而交通运输事业必将随着农村经济发展以及基础条件改善而不断的发展。但我国财政对农村客运保障不足,导致农村客运事业发展举步维艰,发展陷入困难。如何破解农村客运市场发展     

交通建设投资项目费用控制探析

当前，我国交通事业发展迅速，但也面临着项目费用高、规划不完善导致资金缺口严重等诸多问题。鉴于此，从交通建设投资所涉及到的相关费用的控制管理入手，分析投资费用控制的主要内容，进而提出控制投资费用、提高投资效率的建议措施。