基于C/S模式的分布式雷达情报传输系统的设计

针对目前雷达情报传输网中只能单向传输点迹和航迹情报,不能实现情报共享的问题,提出了基于C/S模式的分布式雷达情报传输系统的方案,用来实现多种情报的传输和共享,并对系统协议的选取和网络数据加密进行了分析.     

模糊综合评价法在山区小桥涵抗水灾能力评价中的应用

运用已有野外现场调查与室内模型试验资料,研究了山区小桥涵抗水灾能力评价指标及评价方法.分析了导致山区公路小桥涵水毁的因素,提出了小桥涵抗水灾的评价指标,并运用模糊数学的方法建立了山区公路小桥涵的致灾因子与其抗水灾能力的关系,提出了评定山区公路小桥涵抗水灾能力的评价指标和综合评价方法.     

我国汽车产业安全问题及其对策研究

论述了我国汽车产业安全特征，对影响我国汽车产业安全的关键因素进行梳理和分析，提出了我国汽车产业安全的量化分析模型，并着重在政策层面提出建议。     

德育量化管理系统的设计和开发

介绍了基于VB．NET环境下实现三层系统架构的德育量化管理系统。分别阐述了系统需求分析、系统主要功能、VB．NET环境下的系统解决方案、实现的关键技术等方面．经过实践验证，本系统方案是可行和有效的．     

天津集中台列车运行阶段计划自动调整

针对列车调度指挥系统在开通天津集中台的过程中，出现的列车运行阶段计划调整方案不能满足调度指挥要求的问题，研究天津集中台列车运行阶段计划自动调整方案。天津集中台管辖车站多，车站间环状相连，连接方向多，列车走行径路有300多条。为此，建立以列车优先级别、列车追踪间隔时间、列车区间运行时分、列车起停车附加时分、车站股道接车能力、旅客列车最早发车时间和列车固定停站时间为约束条件，以列车加权晚点总时间最小为目标函数的调整模型。采用动态规化算法进行求解，设计相应的算法步骤，并以天津集中台天津（临时）至下直通场间的车站为例进行验证。计算结果表明：采用上述模型和求解算法进行列车阶段计划调整，能够快速给出列车运行阶段计划的调整方案。该方法在天津集中台已经得到了应用。     

白云山隧道渗漏水整治技术

宜万铁路白云山隧道采用丙凝灌浆法和无管孔腔法相结合治理渗漏水，一次处理成功，保证了后期隧道的运营安全及使用寿命。此文总结了该施工工艺的施工要点和注意事项，对同类工程具有借鉴意义。     

长三角港口资源整合模式

分析国外区域港口资源整合模式,得出区域港口资源整合模式的对应规律,进而对长三角港口目前整合模式进行剖析,认为上海港、苏州港、宁波-舟山港都在朝着政府主导紧密型资源整合模式推进,指出长三角港口资源整合应跳出区划限制、实现一体化发展,并给出实施政府主导联盟型港口一体化模式的初步构想.     

基于ANSYS的钢筋混凝土构件裂缝宽度计算方法

以大型通用有限元计算软件ANSYS为平台,建立了荷载作用下钢筋混凝土构件裂缝宽度的一种计算方法。采用ANSYS中的Solid 65单元模拟混凝土,Link 8单元模拟钢筋,三维非线性弹簧单元Combine 39模拟钢筋-混凝土界面的粘结滑移关系,将Houde提出的钢筋-混凝土间的粘结滑移本构模型引入ANSYS中以确定Combine 39弹簧单元的荷载-位移关系式。此外,在现有混凝土裂缝宽度计算方法的基础上,推导出适用于有限元分析的裂缝宽度计算公式,并应用ANSYS软件提供的二次开发工具——参数化编程语言(APDL)编制程序,在ANSYS后处理中实现混凝土构件裂缝宽度的计算功能。算例分析表明,与现有方法相比,该方法能更准确地计算各级荷载作用下钢筋混凝土构件的裂缝宽度。     

Transforaminal lumbar interbody fusion for traumatic lumbar spondylolisthesis

To evaluate the clinical outcome, effectiveness and safety of the surgical management of traumatic lumbar spondylolisthesis with transforaminal lumbar interbody fusion (TLIF) with short segmental instrumentation fixation. A retrospective review of a consecutive series of 24 patients with traumatic lumbar spondylolisthesis treated with TLIF procedure was carried out. Intraoperative spinal cord monitoring was used to confirm the peripheral neural function intact during the reduction of the spondylolisthesis. Preoperative clinical and radiographic evaluation of all cases were originally collected prospectively. Data regarding blood loss, operative time, duration of hospital stay, radiographic fusion, instrumentation failure and clinical result were collected and observed at regular follow-up periods. All patients were engaged in high-energy accidents in the lower back and 16 patients had concomitant injuries. The mean operative time was 124 min, mean blood loss was 350 mL, and mean hospital stay was 6.5 days. There were no complications such as incision infection, cerebrospinal fluide (CSF) leakage and nerve root injury and so on. All patients demonstrated a solid lumbar interbody fusion within 4 months, and no evidence of spondylolisthesis correction loss, instrumentation failure and loosing. They all were completely asymptomatic, with normal neurologic findings, and had resumed their previous level of physical activities on the final follow-up. Meticulous clinical examination and careful imaging assessment could assist an early diagonosis in cases of traumatic lumbar spondylolisthesis. Performing open reduction and the TLIF procedure as soon as possible could restore segmental stability and painless function. The TLIF procedure was a safe, effective technique to treat traumatic lumbar spondylolisthesis.     

Access control policies without inside queues: Their properties and public policy implications

An access control policy that eliminates all queues beyond the entry points to a network has obvious benefits, which include smooth travel and predictable travel times inside the network. Yet it has never been proven, to the best of our knowledge, whether excluding inside queues yields sub-optimal network performance or, in other words, allowing inside queues can actually further reduce the system travel cost. Moreover, it is not clear whether an optimal control policy derived from efficiency considerations can also be a fair policy to all road users. This paper provide answers to these questions in the context of a monocentric network. By analyzing the structure of the access control problem considering all feasible policies (with/without inside queues), we show that the minimal system cost realizable by access control can be obtained without directly solving a non-convex optimization program, and can indeed always be achieved by a control policy excluding all of the inside queues. These optimal policies are defined by a polyhedral set and a Finite Generation Algorithm can be applied to derive the analytical form of this set. The optimal policies are not unique in general, thus making it possible to achieve both minimal system cost and fairness simultaneously.