基于Edie模型的路阻函数关系推导及其拟合分析研究

路阻函数是交通分配中的关键因素。BPR函数作为一个广泛应用的经典模型,由美国公路局提供的推荐参数不能完全符合实际,在分配中并不能与现实情况密切吻合。基于Edie交通流模型,对拥挤和非拥挤情况下路段流量与走行时间之间的关系进行了推导,给出了一个路阻函数相关的表达式。通过与BPR函数的对比,分析了各自的优缺点,在继承BPR函数优点的基础上应用曲线拟合方法得出了一个可以替代BPR函数的关系式。     

极性双原子分子体系碰撞诱导转动传能的量子干涉效应

利用adiabatically corrected sudden近似研究了极性双原子分子体系单一三重混合态碰撞诱导转动传能的量子干涉效应,并计算了CO与HCl碰撞中的能量传递过程中的相干效应．     

水平管道中堆积速度的确定

在借鉴已有成果,特别是许振良教授提出的水平管道固体粒子处于滑、跳移时的速度分布模型理论的基础上,结合底层固体颗粒的起动条件,运用数值逼近方法确定堆积速度的计算公式。最后用相关数据对这些公式进行检验,计算结果与实际测量结果较为符合。     

横倾状态下舰船液舱容量计量修正方法研究

本文介绍了横倾状态下舰船液舱容量计量修正方法的研究。重点阐述了利用三次样条曲线拟合和双圆弧样条函数逼近的液舱容量计量计算和修正方法     

几个C语言函数在译码程序中的应用

本文通过阐述Ｃ语言中几个字符串处理函数在指令译码中的应用,给出了两种通用译码格式,可被任何编译程序所采用。     

非扩张映象的Ishikawa迭代与最佳逼近元

在严格凸Banach空间中研究了非扩张映象T的耦合不动点集F(T)的闭凸性,获得了当F(T)是Hilbert空间中的闭线性子空间时,Ishikawa迭代的极限元与其初始元的最佳逼近元之间的关系.     

Norm approximation method for handling traffic count inconsistencies in path flow estimator

Path flow estimator (PFE) is a one-stage network observer proposed to estimate path flows and hence origin–destination (O–D) flows from traffic counts in a transportation network. Although PFE does not require traffic counts to be collected on all network links when inferring unmeasured traffic conditions, it does require all available counts to be reasonably consistent. This requirement is difficult to fulfill in practice due to errors inherited in data collection and processing. The original PFE model handles this issue by relaxing the requirement of perfect replication of traffic counts through the specification of error bounds. This method enhances the flexibility of PFE by allowing the incorporation of local knowledge, regarding the traffic conditions and the nature of traffic data, into the estimation process. However, specifying appropriate error bounds for all observed links in real networks turns out to be a difficult and time-consuming task. In addition, improper specification of the error bounds could lead to a biased estimation of total travel demand in the network. This paper therefore proposes the norm approximation method capable of internally handling inconsistent traffic counts in PFE. Specifically, three norm approximation criteria are adopted to formulate three L_p-PFE models for estimating consistent path flows and O–D flows that simultaneously minimize the deviation between the estimated and observed link volumes. A partial linearization algorithm embedded with an iterative balancing scheme and a column generation procedure is developed to solve the three L_p-PFE models. In addition, the proposed L_p-PFE models are illustrated with numerical examples and the characteristics of solutions obtained by these models are discussed.     

基于NURBS的船体曲面自适应三角网格剖分

针对面向曲面的三维船体性能计算和真实感图形显示问题,应用NURBS曲线、曲面理论,提出一种新颖的船体NURBS曲面三角形网格自动生成算法,运用四角编码方法和改进的曲面片平坦性检验方法,保证在递归分割船体NURBS曲面时,能够快速有效地分割出四边形网格,在曲面片的高度方向和边界处同时满足给定的精度要求,在此基础上,应用割角剖分算法将一个四边形网格剖分成两个或多个三角形网格。应用结果表明,应用该算法生成的三角形平面片能够较好地逼近船体曲面,避免出现网格间的裂缝,与二叉树、四叉树方法相比,四角编码方法明显节省了时间和空间,提高了算法效率。     

Application of the optimal Latin hypercube design and radial basis function network to collaborative optimization

Improving the efficiency of ship optimization is crucial for modern ship design. Compared with traditional methods, multidisciplinary design optimization (MDO) is a more promising approach. For this reason, Collaborative Optimization (CO) is discussed and analyzed in this paper. As one of the most frequently applied MDO methods, CO promotes autonomy of disciplines while providing a coordinating mechanism guaranteeing progress toward an optimum and maintaining interdisciplinary compatibility. However, there are some difficulties in applying the conventional CO method, such as difficulties in choosing an initial point and tremendous computational requirements. For the purpose of overcoming these problems, optimal Latin hypercube design and Radial basis function network were applied to CO. Optimal Latin hypercube design is a modified Latin Hypercube design. Radial basis function network approximates the optimization model, and is updated during the optimization process to improve accuracy. It is shown by examples that the computing efficiency and robustness of this CO method are higher than with the conventional CO method.