公交信号优先策略研究

本文介绍了公交优先策略的概念和分类,阐述了绿灯延长、绿灯提前、相位倒转、相位插入、公交通行专用相位等主动优先控制策略的基本原理,并对其进行了适应性和优缺点分析。     

Visual comparability of 3D regular sampling and reconstruction

The Body-Centered Cubic (BCC) and Face-Centered Cubic (FCC) lattices have been analytically shown to be more efficient sampling lattices than the traditional Cartesian Cubic (CC) lattice, but there has been no estimate of their visual comparability. Two perceptual studies (each with N = 12 participants) compared the visual quality of images rendered from BCC and FCC lattices to images rendered from the CC lattice. Images were generated from two signals: the commonly used Marschner-Lobb synthetic function and a computed tomography scan of a fish tail. Observers found that BCC and FCC could produce images of comparable visual quality to CC, using 30-35 percent fewer samples. For the images used in our studies, the L(2) error metric shows high correlation with the judgement of human observers. Using the L(2) metric as a proxy, the results of the experiments appear to extend across a wide range of images and parameter choices.     

Feature Extraction Using Laplacian Maximum Margin Criterion

Feature extraction by Maximum Margin Criterion (MMC) can more efficiently calculate the discriminant vectors than LDA, by avoiding calculation of the inverse within-class scatter matrix. But MMC ignores the local structures of samples. In this paper, we develop a novel criterion to address this issue, namely Laplacian Maximum Margin Criterion (Laplacian MMC). We define the total Laplacian matrix, within-class Laplacian matrix and between-class Laplacian matrix by using the similar weight of samples to capture the scatter information. Laplacian MMC based feature extraction gets the discriminant vectors by maximizing the difference between between-class laplacian matrix and within-class laplacian matrix. Experiments on FERET and AR face databases show that Laplacian MMC works well.     

A clairvoyant site allocation policy based on service demands of jobs in a computational grid

In the present paper we evaluate the performance of three different site allocation policies in a 2-level computational grid with heterogeneous sites. We examine the case where service demands of jobs show high variability, and we consider that schedulers are aware of the service times. A simulation model is used to evaluate performance in terms of the average response time and slowdown, under medium and high load. The impact of the various input parameters on performance is also taken into account. Simulation results show that one policy outperforms the other two that are examined, especially at high load. Furthermore, no performance degradation is observed when estimations are used instead of exact knowledge about job service times.     

Unsteady development of a deformable bubble rising in a quiescent liquid

An accurate finite-volume based numerical method for the simulation of an isothermal two-phase flow, consisting of a rising deformable bubble translating in a quiescent, unbounded liquid, is presented. This direct simulation method is built on a sharp interface concept and developed on an Eulerian, Cartesian fixed-grid with a cut-cell scheme and marker points to track the moving interface. The unsteady Navier–Stokes equations in both liquid and gas phases are solved separately. The mass continuity and momentum flux conditions are explicitly matched at the true surface phase boundary to determine the evolving interface shape and movement of the bubble. The highlights of this method are that it utilizes a combined Eulerian–Lagrangian approach, and is capable of treating the interface as a sharp discontinuity. A fixed underlying grid is used to represent the control volume. The interface, however, is denoted by a separate set of marker particles which move along with the interface. A quadratic curve fitting algorithm with marker points is used to yield smooth and accurate information of the interface curvatures. This numerical scheme can handle a wide range of density and viscosity ratios. The bubble is assumed to be spherical and at rest initially, but deforms as it rises through the liquid pool due to buoyancy. Additionally, the flow is assumed to be axisymmetric and incompressible. The bubble deformation and dynamic motion are characterized by the Reynolds number, the Weber number, the density ratio and the viscosity ratio. The effects of these parameters on the translational bubble dynamics and shape are given and the physical mechanisms are explained and discussed. Results for the shape, velocity profile and various forces acting on the bubble are presented here as a function of time until the bubble reaches terminal velocity. The range of Reynolds numbers investigated is 1 < Re < 100, and that of Weber number is 1 < We < 10.     

IEEE 802.16网状网络中基于队列的带宽分配

IEEE 802.16网状网络中分布式调度的建立时间对时延敏感类业务影响较大。针对该问题,使用基于令牌分发的循环轮转服务机制向邻居节点请求或授予带宽,预测调度控制消息发送间隔内到达的数据包量,据此完成三次握手过程,保证业务流公平带宽分配并减小数据包因为三次握手过程造成的队列缓冲时延。NS2仿真实验验证了该算法的有效性。     

统一潮流控制器逆系统方法控制策略

统一潮流控制器在同步旋转dq坐标系下的数学模型, 反映出统一潮流控制器是一个强耦合的、非线性的系统. 为解决对这个强耦合、非线性系统直接设计控制器的困难, 采用逆系统方法, 将原系统线性化且解耦, 构造出一个伪线性系统. 然后, 运用变结构控制, 针对构造出的这个伪线性系统, 设计该系统的控制策略以实现对统一潮流控制器综合控制. 最后, 通过建立仿真试验模型进行仿真, 仿真的结果验证了文中提出的这种控制策略的可行性和有效性.     

10 kV真空开关智能控制器的研制

提出一种新型的10 kV真空开关智能控制器的设计方法,利用无线收发模块,通过比较各条线路"零序电流的相对量"来准确判断单相接地故障的具体发生位置,提高了智能控制器的智能化运行和控制水平,提高了单相接地故障判断的准确性.     

Mesh Snapping: Robust Interactive Mesh Cutting Using Fast Geodesic Curvature Flow

This paper considers the problem of interactively finding the cutting contour to extract components from a given mesh. Some existing methods support cuts of arbitrary shape but require careful and tedious input from the user. Others need little user input however they are sensitive to user input and need a postprocessing step to smooth the generated jaggy cutting contours. The popular geometric snake can be used to optimize the cutting contour, but it cannot deal with the topology change. In this paper, we propose a geodesic curvature flow based framework to overcome all these problems. Since in many cases the meaningful cutting contour on a 3D mesh is locally shortest in the sense of some weighted curve length, the geodesic curvature flow is an ideal tool for our problem. It evolves the cutting contour to the nearby local minimum. We should mention that the previous numerical scheme, discretized geodesic curvature flow (dGCF) is too slow and has not been applied to mesh segmentation. With a careful observation to dGCF, we devise here a fast computation scheme called fast geodesic curvature flow (FGCF), which only needs to solve a smaller and easier problem. The initial cutting contour is generated by a variant of random walks algorithm, which is very fast and gives reasonable cutting result with little user input. Experiment results on the benchmark mesh segmentation data set show that our proposed framework is robust to user input and capable of producing good results reflecting geometric features and human shape perception.     

Mesh Decomposition with Cross‐Boundary Brushes

We present a new intuitive UI, which we call cross‐boundary brushes, for interactive mesh decomposition. The user roughly draws one or more strokes across a desired cut and our system automatically returns a best cut running through all the strokes. By the different natures of part components (i.e., semantic parts) and patch components (i.e., flatter surface patches) in general models, we design two corresponding brushes: part‐brush and patch‐brush. These two types of brushes share a common user interface, enabling easy switch between them. The part‐brush executes a cut along an isoline of a harmonic field driven by the user‐specified strokes. We show that the inherent smoothness of the harmonic field together with a carefully designed isoline selection scheme lead to segmentation results that are insensitive to noise, pose, tessellation and variation in user's strokes. Our patch‐brush uses a novel facet‐based surface metric that alleviates sensitivity to noise and fine details common in region‐growing algorithms. Extensive experimental results demonstrate that our cutting tools can produce user‐desired segmentations for a wide variety of models even with single strokes. We also show that our tools outperform the state‐of‐art interactive segmentation tools in terms of ease of use and segmentation quality.