排序方式: 共有13条查询结果,搜索用时 15 毫秒
1.
2.
3.
4.
5.
本文对改进后的Dawson方法作了简单的描述,并且给出了船舶在开阔无限水深的海域、限制航道、凹型海底以及其他水下结构物存在的海域中航行时的计算例子。结果显示了改进后的Dawson方法以及计算程序的有效性,是一种可以用来预报不同工程问题中船舶兴波和船舶水动力的简单而实用的方法。 相似文献
6.
7.
谢军 《大连铁道学院学报》1992,(4)
本文采用迭代方法研制出了相界区特征谱的荧光修正程序,用该程序对均匀合金组成的Fe—Ni进行了检验,结果表明,经三次迭代就可消除荧光误差,相对误差为0.0061,本程序收敛速度快,适合于相界区的电子探针定量分析。 相似文献
8.
9.
A multi-objective approach for Dynamic Airspace Sectorization using agent based and geometric models
Jiangjun Tang Sameer AlamChris Lokan Hussein A. Abbass 《Transportation Research Part C: Emerging Technologies》2012,21(1):89-121
A key limitation when accommodating the continuing air traffic growth is the fixed airspace structure including sector boundaries. The geometry of sectors has stayed relatively constant despite the fact that route structures and demand have changed dramatically over the past decade. Dynamic Airspace Sectorization is a concept where the airspace is redesigned dynamically to accommodate changing traffic demands. Various methods have been proposed to dynamically partition the airspace to accommodate the traffic growth while satisfying other sector constraints and efficiency metrics. However, these approaches suffer from several operational drawbacks, and their computational complexity increases fast as the airspace size and traffic volume increase. In this paper, we evaluate and identify the gaps in existing 3D sectorization methods, and propose an improved Agent Based Model (iABM) to address these gaps. We also propose three additional models using KD-Tree, Bisection and Voronoi Diagrams in 3D, to partition the airspace to satisfy the convexity constraint and reduce computational cost. We then augment these methods with a multi-objective optimization approach that uses four objectives: minimizing the variance of controller workload across the sectors, maximizing the average sector flight time, and minimizing the distance between sector boundaries and the traffic flow crossing points. Experimental results show that iABM has the best performance on workload balancing, but it is restrictive when it comes to the convexity constraint. Bisection- and Voronoi Diagram-based models perform worse than iABM on workload balancing but better on average sector flight time, and they can satisfy the convexity constraint. The KD-tree-based model has a lower computational cost, but with a poor performance on the given objectives. 相似文献
10.