极限密度法在公路网规划中的应用研究

提出了公路极限密度的概念,给出了极限密度法模型,介绍了公路极限密度法在公路网规划中的应用,并进行了理想地区公路密度极限值(K)的探讨。     

铁路网络列车运行调整的优化模型 及其分支定价算法

研究了铁路网络中列车可变更运行线路下的列车运行调整问题,目标是使得所有 列车偏离终到时间之和最小化.首先引入流平衡约束建立基于列车到发时刻的网络流模型,采 用商业软件GUROBI求解.同时构建了基于列车时空路径的整数规划模型,并给出了分支定 价算法,采用伪费用分支和最佳优先搜索策略加快算法的收敛.最后设计算例进行验证,通过 与GUROBI对比说明本文算法是有效的.当列车数为20 列时,求解时间减少91.6%,得到的最 终可行解距离最优解的间隔为9.72%.验证了本文分支策略较最为分数分支策略更优,列车运 行调整可变更线路相比于只能按原始线路行驶平均可降低目标函数值37.4%.     

成都常见地质条件下盾构掘进技术探讨

成都地区地质条件复杂,盾构施工难度大。根据成都的工程地质特点,对盾构施工中的重难点进行了分析,并提出了相应的处理措施。     

Decomposing and Cluster Refinement Design Method for Application-Specific Network-on-Chips

Along with higher and higher integration of intellectual properties (IPs) on a single chip, traditional bus-based system-on-chips (SoC) meets several design difficulties (such as low scalability, high power consumption, packet latency and clock tree problem). As a promising solution, network-on-chips (NoC) has been proposed and widely studied. In this work, a novel algorithm for NoC topology synthesis, which is decomposing and cluster refinement (DCR) algorithm, has been proposed to minimize the total power consumption of application-specific NoC. This algorithm is composed of two stages: decomposing with cluster generation, and cluster refinement. For partitioning and cluster generation, an initial low-power solution for NoC topology is generated. For cluster refinement, the clustering is optimized by performing floorplan to further reduce power consumption. Meanwhile, a good tradeoff between power consumption and CPU time can be achieved. Experimental results show that the proposed method outperforms the existing work.     

浅谈公路建设项目的社会评价

社会评价已经成为与财务评价、国民经济评价、环境影响评价相并列的一种独立的投资项目评价方法，随着社会发展观从“以经济增长为中心”到“以人为中心”，项目社会评价与经济评价、环境评价一样被社会越来越重视。社会评价的核心目的，是要在项目投资活动中关注各种社会问题，在追求投资项目财务、经济和环境效益的同时，关注各种社会发展目标的实现，减少项目投资可能引起的社会矛盾和风险。     

应用激光捕获显微切割技术制备肺癌蛋白质组学研究样品

目的探讨应用激光捕获显微切割(laser capture microdissection,LCM)技术获取高同质性肺癌组织细胞及正常对照肺泡上皮细胞的方法及可行性。方法将新鲜肺癌组织标本及其配对正常组织常规制备8μm冰冻切片,采用改良的HE方法染色;应用LCM技术大宗切割肺鳞癌、腺癌及正常对照肺泡上皮细胞;选择性获取同质肺癌细胞和配对正常细胞。结果通过LCM技术可以准确、快速地分离癌细胞、间质及其他坏死组织,得到同质性不低于95%的肿瘤细胞和正常细胞。按照Duration 15.5 s的激光脉冲频率和平均8 000 shots条件,既可保证每个帽子的细胞收集数量,也能够有效地缩短实验时间,提高实验可控性,从而使操作过程标准化。结论应用LCM技术可以成功获取同质肺癌细胞和正常细胞。其所需标本量少、组织同质性高、操作过程稳定、可控性好,是肺癌分子生物学及蛋白质组学研究有价值的样品制备方法。     

非对称布索斜塔斜拉桥的静力平衡特征分析

以一非对称布索斜拉桥作为工程背景,分析恒载作用下结构的整体平衡和局部平衡的条件,论述了影响整体平衡与局部平衡的因素以及静力平衡下的结构特性,并通过改变影响桥梁受力和变形的一些参数来探讨最合理参数的选择条件。     

基于沥青路面结构层使用性能的养护罩面方案评价分析

动态模量(AMPT)一般用来评价沥青混合料的材料性能,常作为沥青混合料设计、沥青路面设计和评价分析的参数。选取青银高速公路不同罩面结构层、不同罩面材料、不同罩面时间的代表路段钻芯取样,进行室内AMPT试验,并对动态模量指标和流动度指标进行分析,旨在通过检测在役期路面沥青结构层的动态模量来评价其使用寿命,为养护罩面的时机提供数据支持。     

关于公路工程施工的安全问题

近几年公路建设中频频发生安全事故,一旦造成事故,给国家、社会和个人将带来重大损失。因而分析公路工程施工中存在的安全隐患成因以及对施工安全管理的原则显得非常重要。本文针对事故隐患的成因进行探究,并对施工安全管理提出一些建议。     

Delay Restoration of Single-Track Railway Rescheduling

On the basis of analysis of the principle of delay restoration in a disturbed schedule, a heuristic algorithm for rescheduling trains is developed by restoring the total delay of the disturbed schedule. A discrete event topologic model is derived from the original undisturbed train diagram and a back propagation analysis method is used to label the maximum buffer time of each point in the model. In order to analyze the principle of delay restoration, the concept of critical delay is developed from the labeled maximum buffer time. The critical delay is the critical point of successful delay restoration. All the disturbed trains are classified into the strong-delayed trains and the weak-delayed trains by the criterion of the critical delay. Only the latter, in which actual delay is less than its critical delay, can be adjusted to a normal running state during time horizon considered. The heuristic algorithm is used to restore all the disturbed trains according to their critical details. The cores of the algorithm are the iterative repair technique and two repair methods for the two kinds of trains. The algorithm searches iteratively the space of possible conflicts caused by disturbed trains using an earfiest-delay-first heuristics and always attempts to repair the earliest constraint violation. The algorithm adjusts the weak-delayed trains directly back to the normal running state using the buffer time of the original train diagram. For the strong-delayed trains,the algorithm uses an utility function with some weighted attributes to determine the dynamic priority of the trains, and resolves the conflict according to the calculated dynamic priority. In the end, the experimental results show that the algorithm produces ＂good enough＂ schedules effectively and efficiently in disturbed situations.