武汉轨道交通2号线岩溶地段隧道工法研究

武汉地铁2号线虎泉站-光谷广场站区间隧道沿线灰岩分布广泛,岩溶发育,采取钻探、物探等综合勘探技术,查明了岩溶分布特性。在区间隧道施工前,进行了溶洞注浆加固处理;并在此基础上,对区间隧道矿山法、盾构法以及明挖法等工法进行了综合比较,提出了适应本地层条件下的矿山法施工方案,达到了预期的效果,可为类似工程的设计和施工提供借鉴。     

A Comparative study on multiobjective reliable and robust optimization for crashworthiness design of vehicle structure

Design optimization without considering uncertainties of system variables and parameters can be problematic in real life. In order to take into account the effect of uncertainties, reliable and robust design schemes have proven effective, but limited studies have been reported to compare their difference in a multiobjective framework. This paper takes a typical vehicle structure subject to offset frontal crashing scenario as an example to compare reliable and robust designs with their deterministic counterpart. The thicknesses of some key components of vehicle frontal structures were selected as design variables, the vehicle weight and energy absorption as the objectives, deceleration and firewall intrusion as the constraints. The deterministic multiobjective optimization problem was first solved by adopting Design of Experimental (DOE), metamodels and Non-dominated Sorting Genetic Algorithm II (NSGA-II). Take into account the uncertainties, a Monte Carlo Simulation (MCS) is adopted to generate random distributions of the objective and constraint functions for each design. For the reliability-based optimization the desired reliabilities of 90 %, 95 % and 99 % are considered, respectively. For the robustness-based optimization, two different formulation strategies are adopted. The optimization showed that the reliable and robust Pareto fronts are shifted away from their deterministic counterpart due to uncertainties. The different Pareto fronts yielded from the deterministic, reliable and robust designs are compared to provide some quantitative insights into how to apply these different design schemes for resolving uncertainty problems. It is shown that, compared with the baseline design, the optimizations enhance the crashworthiness of vehicle, though more conservative solutions could have been generated from the reliable and robust optimizations.     

Adaptive heuristic search algorithm for discrete variables based multi-objective optimization

Although metamodel technique has been successfully used to enhance the efficiency of the multi-objective optimization (MOO) with black-box objective functions, the metamodel could become less accurate or even unavailable when the design variables are discrete. In order to overcome the bottleneck, this work proposes a novel random search algorithm for discrete variables based multi-objective optimization with black-box functions, named as k-mean cluster based heuristic sampling with Utopia-Pareto directing adaptive strategy (KCHS-UPDA). This method constructs a few adaptive sampling sets in the solution space and draws samples according to a heuristic probability model. Several benchmark problems are supplied to test the performance of KCHS-UPDA including closeness, diversity, efficiency and robustness. It is verified that KCHS-UPDA can generally converge to the Pareto frontier with a small quantity of number of function evaluations. Finally, a vehicle frontal member crashworthiness optimization is successfully solved by KCHS-UPDA.     

An adaptive time-based global method for dynamic reanalysis

The popular dynamic reanalysis methods, such as combined approximation (CA) mainly focus on frequency domain. Compared with time domain analysis, the main challenge for reanalysis methods is to calculate the responses in each iteration. Due to this difficulty, popular reanalysis methods are not available for time domain analysis, such as Newmark- $\beta $ and central different method (CDF). Therefore, a novel adaptive time-based global reanalysis (ATGR) algorithm for Newmark- $\beta $ method is suggested. If basis vectors are generated for predicting the response in each time step, computational cost of reanalysis should be significantly increased. To improve the efficiency, an adaptive reanalysis algorithm is suggested. Moreover, in order to enhance the accuracy of the popular combined algorithm (CA) reanalysis, a global strategy is suggested to construct basis vectors. Numerical examples show that accurate approximations are achieved efficiently for time domain problems.     

区域和局部信息结合的双向医学图像配准

提出了一种新的基于区域互信息和局部频率信息结合的双向图像配准测度。首先,以原参考图像为参考,计算出正向变换下图像的区域互信息和Gabor滤波后的得到局部频率 信息;同时,以输入图像为参考图像,计算出逆变换下的逆向互信息和局部频率信息。将正向与逆向变换下的互信息和局部频率信息各自相乘后求和,减去两幅图像对应的配准残 量,得到双向图像配准度量,用于对输入图像进行配准。仿真实验结果在验证分析结果的同时也表明,方法对图像噪声、分辨率等具有较高的鲁棒性,可有效提高配准的精度。     

基于高斯混合模型的阴影消除算法

关于阴影消除是智能监控系统的重要组成部分,且对后续的识别和跟踪有很大的影响。根据改进的高斯混合模型检测出目标,用高斯混合阴影模型来检测阴影,并用高斯平滑滤波处理检测的结果。然后动态选择合适的阈值对图像做二值化处理,进一步对结果进行形态学滤波。经过整个过程的处理,得到了较为完整的轮廓,很好的消除了阴影,提高后续的识别和跟踪的准确性和可靠性。实验表明,算法能较好地消除阴影,且具有较好的实时性和鲁棒性。     

聚众事件的建模与实现

在视频监控领域聚众等异常事件检测有着广泛的应用前景,然而相关研究在国内发展还比较缓慢。在这里给出了基于隐马尔科夫模型的聚众事件的检测方法,其简单过程如下:首先在高斯混合模型检测出目标的基础上,针对聚众事件视频序列的特性,完成了关于帧图像二元组的特征提取;然后,在合理选择初始模型的前提下使用Baum-Welch算法训练聚众事件的隐马尔科夫模型;最后通过实拍的视频序列验证其有效性。     

P2P系统中基于副本链的一致性维护算法

提出一种无结构纯P2P的副本一致性维护算法。利用副本节点发起的第一次更新消息在P2P网络中的广播,由其他收到消息的副本节点给出响应,构建副本链。副本链建立后,更新消息在副本节点间进行传播,不再在网络中洪泛。副本链的维护通过记录首次发起更新的副本节点IP地址完成。仿真试验证明该算法是简单有效的。     

卫星遥感数据分类不确定性的容差粗糙集处理

提出一种基于光谱特征邻域的容差粗糙集分类方法,用来处理卫星遥感数据分类中的不确定性问题。利用北京地区Landsat-5 TM数据进行分类试验,将结果与现有容差粗糙集方法分类结果进行对比和统计。结果表明,该方法具有良好的可理解性和稳定性,能够处理卫星遥感数据分类的不确定性,在具有复杂光谱特征地物分类方面具有发展潜力。     

非结构化P2P中搜索算法的性能分析

资源搜索是P2P应用所面临的最核心问题之一,相关的非结构化P2P系统主要采用了查询消息泛洪和信息索引机制.本文分析了非结构化P2P中几种典型的搜索算法,阐述了其搜索原理和搜索性能 .与其他研究不同,本文通过大量的模拟实验来验证搜索算法的性能;在不同网络规模中,通过对每一种搜索算法的查询成功率、搜索产生消息数和成功查询所用平均跳数进行比较分析,给出了相关结论.