All‐hexahedral element meshing: automatic elimination of self‐intersecting dual lines

There has been some degree of success in all‐hexahedral meshing. Standard methods start with the object geometry defined by means of an all‐quadrilateral mesh, followed by the use of the combinatorial dual to the mesh in order to define the internal connectivities among elements. For all of the known methods using the dual concept, it is necessary to first prevent or eliminate self‐intersecting (SI) dual lines of the given quadrilateral mesh. The relevant features of SI lines are studied, giving a method to remove them, which avoids deforming the original geometry. Some examples of resulting meshes are shown where the current meshing method has been successfully applied. Copyright © 2002 John Wiley & Sons, Ltd.     

基于NN的无信号混合交通交叉口自行车冲突避让行为建模仿真

在我国城市无信号交叉口,自行车与混合交通流的其他车辆(如机动车、自行车、行人)的冲突避让行为,难以通过传统数学方法建立准确的仿真模型.本文在以往交叉口自行车微观模型基础上,采用冲突车辆与自行车的相对位置矢量、相对速度矢量以及期望速度与实际速度相对矢量作为输入,自行车二维空间加速度矢量作为双输出的神经网络建立数学模型.利用实地采集自行车-机动车冲突、自行车-自行车冲突和自行车-行人冲突样本数据,进行神经网络训练和仿真验证,并对骑车者性别、冲突车辆类型和冲突速度进行了模型灵敏度分析.结果表明,模型能较好地反映无信号交叉口自行车与其他车辆及障碍物的冲突避让行为.     

Jacobi交上的配对计算

目前已知的配对计算都是在椭圆曲线的平面模型下实现的,比如Weierstrass型曲线、Ed-wards曲线和Jacobi四次曲线。本文第一次讨论空间曲线上配对的具体计算。密码学中所关心的空间曲线主要是三维空间中的二次曲面的交,它与Edwards曲线、Jacobi四次型都有极其紧密的联系,因而研究二次曲面交上的算术与配对将促进我们对Edwards曲线、Jacobi四次曲线上的相关特性的理解。为了讨论的简洁,我们将主要分析Jacobi交,但我们的结果基本上可以类推到其他的二次曲面交上去。我们分析了Jacobi交上的几何特性,构造了Jacobi交上的有效可计算同态,并在此基础上给出了Jacobi交上配对的具体计算。     

基于时间窗的随机时变交通网络信号相位协调

交通网络是随机时变网络,用周期性时间窗模拟各路口信号灯控制,建立交通网络中路口相位差协调控制模型。时间窗的设定使只有规定行驶方向的车辆可以通行路口,其他车辆不可通行。为得到车辆在路口前等待状况,定义时间窗函数,该函数采用协调交通网络路口信号相位差的方法求得随机时变网络的最短期望路径。结合改进的SDOT算法和穷举法及遗传算法设计一种混合算法。对一个四路口小型交通网络进行了仿真研究,结果验证了求解算法的有效性。     

细分曲面求交交线计算方法的研究

主要针对三角网格的细分曲面求交提出了一种有效的交线计算的方法,该方法适用于任意三角网格的细分曲面中.在利用AABB和二部图进行初始控制网格相交性检测后,利用该方法快速有效地求出细分曲面的交线.     

大规模等值线图的任意简单多边形窗口裁剪算法

针对大规模等值线图裁剪算法面临的两个主要问题,如何减少线段求交次数和判别保留部分的起止点,提出一种针对大规模等值线图的任意多边形裁剪算法.该算法首先使用等网格分割方法,在等值线线段与裁剪多边形边之间建立网格索引,减少线段求交次数;同时,在网格数据结构基础上,采用局部射线法,很好地解决了判断交点在裁剪多边形内外时间复杂度过大的问题,使得算法可以快速判断出需要保留(剔除)的等值线部分.本文算法的优点是能够在求出交点的基础上快速获得需要保留(剔除)部分的起止点;同时,算法中裁剪多边形可以是包含任意多个洞的任意简单多边形,克服传统算法中对裁剪多边形的特定约束条件.本文算法易于实现且高效.     

多路口模糊控制及其仿真研究

提出了一种基于模糊逻辑的城市交通面控制器,并将ARIMA短时交通流量预测与模糊控制器相结合,使路口交通信号周期适应交通流量的动态需求.进行了相关仿真,结果表明,该方法优于传统定时控制.     

Exploring stop-go decision zones at rural high-speed intersections with flashing green signal and insufficient yellow time in China

The objective of this study is to empirically analyze and model the stop-go decision behavior of drivers at rural high-speed intersections in China, where a flashing green signal of 3 s followed by a yellow signal of 3 s is commonly applied to end a green phase. 1, 186 high-resolution vehicle trajectories were collected at four typical high-speed intersection approaches in Shanghai and used for the identification of actual stop-go decision zones and the modeling of stop-go decision behavior. Results indicate that the presence of flashing green significantly changed the theoretical decision zones based on the conventional Dilemma Zone theory. The actual stop-go decision zones at the study intersections were thus formulated and identified based on the empirical data. Binary Logistic model and Fuzzy Logic model were then developed to further explore the impacts of flashing green on the stop-go behavior of drivers. It was found that the Fuzzy Logic model could produce comparably good estimation results as compared to the traditional Binary Logistic models. The findings of this study could contribute the development of effective dilemma zone protection strategies, the improvement of stop-go decision model embedded in the microscopic traffic simulation software and the proper design of signal change and clearance intervals at high-speed intersections in China.     

Near-optimal parameterization of the intersection of quadrics: III. Parameterizing singular intersections

We conclude, in this third part, the presentation of an algorithm for computing an exact and proper parameterization of the intersection of two quadrics. The coordinate functions of the parameterizations in projective space are polynomial, whenever it is possible. They are also near-optimal in the sense that the number of distinct square roots appearing in the coefficients of these functions is minimal except in a small number of cases (characterized by the real type of the intersection) where there may be an extra square root.