软弱围岩段连拱隧道施工安全及衬砌结构分析

该文以深圳某公路隧道为工程背景,采用有限元程序对该连拱隧道的施工过程进行了数值模拟,得到了隧道围岩的变形规律、应力分布特征,以及围岩位移随时间变化的规律。采用荷载-结构法对隧道二次衬砌内力和截面配筋进行了验算。验算结果表明:设计时可通过增大局部截面厚度和增加钢筋来提高衬砌结构强度,从而最大程度地保证隧道施工的安全进行。     

软弱围岩隧道安全快速施工技术研究

软弱围岩的力学特征及其变形规律是实现软弱围岩隧道安全快速施工的理论基础。强度低、变形大、变形时间长、变形速度快是软弱围岩的基本特征,因此在软弱围岩隧道施工过程中,必须根据围岩应力调整的特征及其变形规律,合理选择开挖分部和开挖进尺,切实做好超前支护,加强施工管理,按照"预支护、快挖、快支、快封闭"的施工原则,实现软弱围岩隧道安全快速施工。     

新碧鸡关隧道进口大断面软弱围岩爆破技术

昆明铁路枢纽改造工程中的新碧鸡关隧道为大断面软弱围岩隧道,采用分部开挖和光面爆破结合技术,进行了爆破参数、炮眼布置、装药结构优化设计,取得了较好的爆破效果。该方法施工简单、安全经济,对同类隧道工程施工具有一定的借鉴意义。     

超大断面隧道软弱破碎围岩台阶法施工过程力学效应规律研究

超大断面软弱围岩隧道施工过程中,采用台阶法施工方案容易引起大面积塌方,但是可以有效缩短施工工期,从安全性的角度出发,台阶法施工特别是作为台阶法核心问题的台阶高度选择值得进一步分析。依托兰渝铁路两水隧道,采用三维数值仿真手段,分别建立台阶高度取H/3,H/2,2H/3和最大宽度处模型,模拟了铁路隧道在极软弱围岩中采用台阶法施工选择不同台阶高度的施工过程,对比不同台阶高度下隧道的拱顶沉降、水平收敛和掌子面挤出变形,揭示了台阶法施工过程中围岩力学效应的演化规律,并最终得出最优台阶高度,为工程施工提供参考。     

山区高速公路桥隧相连技术的研究与应用

通过研究山区高速公路隧道洞口桥隧相连的有关技术及其在实际工程中的合理选择与应用,分析其优缺点,并总结经验,对类似条件下桥梁与隧道的建设具有一定的指导意义。     

基于多模式弱分类器的AdaBoost-Bagging车辆检测算法

针对现有车辆检测算法在实际复杂道路情况下对车辆有效检测率不高的问题, 提出了融合多模式弱分类器, 并以AdaBoost-Bagging集成为强分类器的车辆检测算法。结合判别式模型善于利用较多的特征形成较好决策边界和生成式模型善于利用较少的特征排除大量负样本的优点, 以Haar特征训练判别式弱分类器, 以HOG特征训练生成式弱分类器, 以AdaBoost算法为桥梁, 采用泛化能力强的Bagging学习器集成算法得到AdaBoost-Bagging强分类器, 利用Caltech1999数据库和实际道路图像对检测算法进行了验证。验证结果表明: 相比于单模式弱分类器, AdaBoostBagging强分类器在分类能力和处理时间上均具有优越性, 表现为较高的检测率与较低的误检率, 分别为95.7%、0.000 27%, 每帧图像的检测时间较少, 为25ms; 与传统级联AdaBoost分类器相比, AdaBoost-Bagging强分类器虽然增加了12%的检测时间和30%的训练时间, 但检测率提升了1.8%, 误检率降低了0.000 06%;本文算法的检测性能显著优于基于Haar特征的AdaBoost分类器算法、基于HOG特征的SVM分类器算法、基于HOG特征的DPM分类器算法, 具有较佳的车辆检测效果。     

基于拉依达准则的舰载设备抗冲击薄弱环节判定

舰载设备的抗冲击能力对提高舰船战斗力和生命力有十分重要的意义。通过对冲击载荷作用下舰载设备的动态响应进行统计分析,发现其结构响应的频率特性与对数正态分布十分符合。成功将拉依达准则应用于舰载设备抗冲击薄弱环节的判定。通过与频率计算法进行对比分析,验证了应用拉依达准则对舰载设备抗冲击薄弱环节进行判定的可行性,同时也发现了频率计算法的不足之处。作为算例,分别应用频率计算法和拉依达准则对其抗冲击薄弱环节进行判定。计算结果表明,拉依达准则判定法的计算结果更加准确而全面。     

Dynamic activity-travel assignment in multi-state supernetworks

The integration of activity-based modeling and dynamic traffic assignment for travel demand analysis has recently attracted ever-increasing attention. However, related studies have limitations either on the integration structure or the number of choice facets being captured. This paper proposes a formulation of dynamic activity-travel assignment (DATA) in the framework of multi-state supernetworks, in which any path through a personalized supernetwork represents a particular activity-travel pattern (ATP) at a high level of spatial and temporal detail. DATA is formulated as a discrete-time dynamic user equilibrium (DUE) problem, which is reformulated as an equivalent variational inequality (VI) problem. A generalized dynamic link disutility function is established with the accommodation of different characteristics of the links in the supernetworks. Flow constraints and non-uniqueness of equilibria are also investigated. In the proposed formulation, the choices of departure time, route, mode, activity sequence, activity and parking location are all unified into one time-dependent ATP choice. As a result, the interdependences among all these choice facets can be readily captured. A solution algorithm based on the route-swapping mechanism is adopted to find the user equilibrium. A numerical example with simulated scenarios is provided to demonstrate the advantages of the proposed approach.     

Application of Lagrangian relaxation approach to α-reliable path finding in stochastic networks with correlated link travel times

This study investigates the important problem of determining a reliable path in a stochastic network with correlated link travel times. First, the distribution of path travel time is quantified by using trip records from GPS probe vehicles. Second, the spatial correlation of link travel time is explicitly considered by using a correlation coefficient matrix, which is incorporated into the α-reliable path problem by Cholesky decomposition. Third, the Lagrangian relaxation based framework is used to handle the α-reliable path problem, by which the intractable problem with a non-linear and non-additive structure can be decomposed into several easy-to-solve problems. Finally, the path-finding performance of this approach is tested on a real-world network. The results show that 15 iterations of calculation can yield a small relative gap between upper and lower bounds of the optimal solution and the average running time is about 5 s for most OD settings. The applicability of α-reliable path finding is validated by a case study.     

卫星通信在数据链系统中的应用研究及启示

在电子信息技术高速发展的今天,数据链正逐步向高速率、大容量等方向延伸拓展,引入覆盖面广、通信质量优的卫星通信手段解决数据链受距离限制的问题已成为一种趋势。本文对传统战术数据链系统结构和卫星通信在国外数据链系统中的应用进行研究,分析引入卫星通信手段后国外战术数据链在体系结构等方面做出的适应性改进及其对我国后续发展卫星数据链的启示。