Wavelength reservation scheme with switch fabric status in distributed mesh optical networks

A new wavelength reservation scheme is proposed to mitigate the connection setup time and minimize the reconfiguration times of optical cross-connects (OXCs) for WDM optical networks in this study. In this scheme, we consider the reconfiguration information of switch fabrics in the signaling protocol, which is designated as the signaling with switch fabric status (SWFS). Distributed reservation algorithms will reserve the wavelength with minimum of reconfiguration times of OXCs along the route. Simulation results indicate that the proposed schemes with switch fabrics status have shorter setup time, lower switching ratio as well as better blocking performance than those of the traditional classic schemes. Moreover, the proposed schemes with SWFS significantly reduce the number of switch fabrics that need to be reconfigured. Foundation item: the National Natural Science Foundation of China (Nos. 60632010 and 60572029) and the National High Technology Research and Development Program (863) of China (No. 2006AA01Z251)     

Synchronization research of a modified time-delayed multi-agent network model

The synchronization of time-delayed multi-agent networks with connected and directed topology is studied. Based on the correlative work about the agent synchronization, a modified model is presented, in which each communication receiver is distributed a delay τ. In addition, a proportional term k is introduced to modulate the delay range and to guarantee the synchronization of each agent. Two new parameters mentioned above are only correlative to the network topology, and a theorem about their connections is derived by both frequency domain method and geometric method. Finally, the theoretical result is illustrated by numerical simulations. Foundation item: the National Natural Science Foundation of China (No. 70571017) and the Research Foundation from Provincial Education Department of Zhejiang of China (No. 20070928)     

A bintree energy approach for colour image segmentation using adaptive channel selection

A new hierarchical approach called bintree energy segmentation was presented for color image segmentation. The image features are extracted by adaptive clustering on multi-channel data at each level and used as the criteria to dynamically select the best chromatic channel, where the segmentation is carried out. In this approach, an extended direct energy computation method based on the Chan-Vese model was proposed to segment the selected channel, and the segmentation outputs are then fused with other channels into new images, from which a new channel with better features is selected for the second round segmentation. This procedure is repeated until the preset condition is met. Finally, a binary segmentation tree is formed, in which each leaf represents a class of objects with a distinctive color. To facilitate the data organization, image background is employed in segmentation and channels fusion. The bintree energy segmentation exploits color information involved in all channels data and tries to optimize the global segmentation result by choosing the ＂best＂ channel for segmentation at each level. The experiments show that the method is effective in speed, accuracy and flexibility.     

Code-aided interference suppression in direct sequence spread spectrum systems with eigenvector sign spreading code

For direct sequence spread spectrum (DSSS) communication systems suffering interference, it is known that code-aided interference suppression technique outperforms all of the previous linear or nonlinear methods. In this paper, we proposed an improved code-aided technique which can improve the system performance greatly by using the eigenvector sign (EVS) spreading sequence which depends on the statistical characteristics of the interference and the thermal noise. Foundation item: the National Natural Science Foundation of China (No. 60772100)     

A rate-distortion based quantization level adjustment algorithm in block-based video compression

In this paper, a rate-distortion based quantization level adjustment (RDQLA) algorithm is presented. Based on the rate-distortion criterion, the quantization level adjustment algorithm effectively improves coding efficiency by adaptively optimizing quantization levels of the signals near the boundaries of quantization cells and adjusting quantization levels per block. In addition, it has no overhead and is fully compatible with the existing compression standards. The proposed algorithm can be applied in any block based image and video coding method. In particular, the algorithm has been verified on the platform of H.264. Experimental results show that the proposed algorithm improves objective and subjective performances substantially. It is shown that the proposed algorithm has a gain of several dB comparing with the newest H.264 standard for high bit rates. Foundation item: the Special Foundation of Outstanding Young Teacher of Shanghai     

导航电子地图中道路网增量信息的多尺度探测

针对常用增量信息提取方法中根据经验阈值确定新旧目标匹配的不足,提出一种导航电子地图中道路网增量信息的多尺度探测方法.该方法用最大类间方差法自适应地确定几何匹配阈值来探测增量信息,完善了基于道路网眼密度的增量变化目标渐进式选取算法,实现了增量信息在较小比例尺下的缩编提取.增量信息探测实验研究结果表明:基于自适应匹配阈值的新旧版本对应路网目标匹配准确率达到了90%,优于传统的经验阈值匹配精度;改进的增量变化目标渐进式选取算法可以满足路网增量更新的结构选取需求.      

求解旅行商问题的一种新方法

目前关于旅行商问题的启发式算法主要分为两类:环路构造算法和环路改进算法.通过对两类近似算法的深入研究,提出了一种新的方法――简化模型法来求解旅行商问题.该方法通过排序和选择操作得到原网络图的简化模型,对简化模型中的路径进行重构得到旅行商问题的解.通过测试TSPLIB中的实例,表明用简化模型法求解旅行商问题解的质量高、收敛快,时耗小,该算法是实用的.     

空车配货VRP问题的路径匹配算法

针对现有VRP（Vehicle routing problem）问题的精确解法和启发式算法应用于空车配货信息检索时的局限,引入图的概念,提出了一个基于交通路网的路径匹配算法,给出了算法复杂度分析。该算法利用交通路网中各结点之间的距离关系,检索给定起讫点间及起讫点与各自邻近结点群之间存在的配货信息,同时规划出收益费用比最优的行驶路径,并能根据配货行驶路径的特点对检索出的所信息进行分析、评价和优选,以方便空车配货组织。最后用一个仿真实例验证算法的有效性。     

���ڵͲ���Ƶ�ʸ��������г̳�����Ϣʵʱ�ɼ�����

智能运输系统(ITS)是当前解决交通问题的最佳途径之一,而动态交通信息的发布与预测是ITS的关键所在。然而由于在各种外部因素下,道路交通状态呈现出随机变化的特性使得动态交通信息的发布与预测成为一大难点。结合某城市的实际情况,本文建立了在定位误差、采样间隔、车辆类型、道路类型等因素影响下的行程车速估计模型,并用实测数据对模型进行精度验证。结合出租车车辆的特殊信息,改进了低采样频率浮动车技术的估计算法,建立了空车数据处理模型;针对城市复杂和相似路段问题,提出了基于距离、方向角、连通性、历史数据以及车流方向等约束条件下的地图匹配算法;针对低采样频率浮动车数据,提出了考虑交叉口影响下的行程车速估计算法,通过实测数据评估了算法的性能;最后,针对不同检测技术的特征,提出了数据融合算法。     

Sequential similarity detection algorithm based on image edge feature

Abstract： This paper proposes a new sequential similarity detection algorithm （SSDA）, which can overcome matching error caused by grayscale distortion; meanwhile, time consumption is much less than that of regular algorithms based on image feature. The algorithm adopts Sobel operator to deal with subgraph and template image, and regards the region which has maximum relevance as final result. In order to solve time-consuming problem existing in original algorithm, a coarse-to-fine matching method is put forward. Besides, the location correlation keeps updating and remains the minimum value in the whole scanning process, which can significantly decrease time consumption. Experiments show that the algorithm proposed in this article can not only overcome gray distortion, but also ensure accuracy. Time consumption is at least one time orders of magnitude shorter than that of primal algorithm.     

Model-based gait representation via spatial point reconstruction

This paper proposed a novel model-based feature representation method to characterize human walking properties for individual recognition by gait. First, a new spatial point reconstruction approach is proposed to recover the coordinates of 3D points from 2D images by the related coordinate conversion factor (CCF). The images are captured by a monocular camera. Second, the human body is represented by a connected three-stick model. Then the parameters of the body model are recovered by the method of projective geometry using the related CCF. Finally, the gait feature composed of those parameters is defined, and it is proved by experiments that those features can partially avoid the influence of viewing angles between the optical axis of the camera and walking direction of the subject. Foundation item: the National Natural Science Foundation of China (No. 60675024)     

Joint distortion model for progressive image transmission using error correcting arithmetic codes

A novel joint source channel distortion model was proposed, which can essentially estimate the average distortion in progressive image transmission. To improve the precision of the model, the redundancy generated by a forbidden symbol in the arithmetic codes is used to distinguish the quantization distortion and the channel distortion, all the coefficients from the first error one to the end of the sequence are set to be a value within the variance range of the coefficients instead of zero, then the error propagation coming from the entropy coding can be essentially estimated, which is disregarded in the most conventional joint source channel coding （JSCC） systems. The precision of the model in terms of average peak-signal-to-noise has been improved about 0.5 dB compared to classical works. An efficient unequal error protection system based on the model is developed, and can be used in the wireless communication systems.     

Codes From Strongly Regular （α,β）-reguli

Strongly regular (α, β)-reguli are a class of incidence structures with given conditions which were introduced by Hamilton and Mathon. We introduce two classes of codes constructed from strongly regular (α, β)-reguli within PG(k − 1, q). The codes are related with two-weight codes intimately. Foundation item: the Scientific Research Start-up Foundation of Qingdao University of Science and Technology in China (No. 0022327)     

Robust stability of neutral systems: A discretized Lyapunov functional method

This paper focuses on the robust stability for time-delay systems of neutral type. A new complete Lyapunov-Krasovskii function (LKF) is developed. Based on this function and discretization, stability conditions in terms of linear matrix inequalities are obtained. A class of time-varying uncertainty of system matrices can be studied by the method. Foundation item: the National High Technology Research and Development Program (863) of China (No. 2006AA05Z148)     

Surface reconstruction of scanned human body using radial basis functions and adaptive partition of unity

It is important to reconstruct a continuous surface representation of the point cloud scanned from a human body. In this paper a new implicit surface method is proposed to reconstruct the human body surface from the points based on the combination of radial basis functions (RBFs) and adaptive partition of unity (PoU). The whole 3D domain of the scanned human body is firstly subdivided into a set of overlapping subdomains based on the improved octrees. The smooth local surfaces are then computed in the subdomains based on RBFs. And finally the global human body surface is reconstructed by blending the local surfaces with the adaptive PoU functions. This method is robust for the surface reconstruction of the scanned human body even with large or non-uniform point cloud which has a sharp density variation. Foundation item: the National Natural Science Foundation of China (No. 50575139) and the Shanghai Special Fund of Informatization (No. 088)     

基于拓扑判断的海量GPS数据延时地图匹配算法

由于浮动车数据采集中存在GPS数据周期过长、拓扑关联性较差、数据量大的特点,传统的车载端地图匹配算法难以直接应用,针对车辆无法初次匹配的情况,设计了一种可根据路网拓扑关联性进行判断的延时地图匹配算法.实际数据验证表明,该算法在保证数据完整性和有效性的基础上,可以实时、准确地进行地图匹配,尤其是车辆位于复杂交叉口及高架桥附近区域时车辆真实行驶道路的确定.      

Filling the gap between voters and cryptography in e-voting

Cryptography is an important tool in the design and implementation of e-voting schemes since it can provide verifiability, which is not provided in the traditional voting. But in the real life, most voters can neither understand the profound theory of cryptography nor perform the complicated cryptographic computation. An e-voting system is presented in this paper to leverage the use of cryptography. It combines the advantages of voting scheme of Moran-Naor and voting scheme based on homomorphic encryption. It makes use of the cryptographic technique, but it hides the details of cryptographic computation from voters. Compared with voting scheme of Moran-Naor, the new system has three advantages: the ballots can be recovered when the voting machine breaks down, the costly cut-and-choose zero-knowledge proofs for shuffling votes made by the voting machine are avoided and the partial tally result in each voting machine can be kept secret. Foundation item: the National Natural Science Foundation of China (No. 60673076) and the National High Technology Research and Development Program (863) of China (No. 2008AA01Z403)     

发动机匹配优化算法的研究

依据优化标定方法,设计了基于发动机排放控制的优化方案,并建立了以发动机经济性为目标,排放性作为约束的优化数学模型．对适用于该数学模型的信赖域法、模式搜索算法、遗传算法等优化算法进行了论证．针对实际发动机排放优化问题对各种算法的优劣进行了比较,并在此基础上提出了组合算法的思想．优化结果表明,组合算法全局搜索性和优化结果良好,且计算时间、计算量等较单一优化算法时均有显著改善．     

基于Greedy方法的动态配流模型与近似算法

为研究寻优能力强、求解效率高且可及时调整的动态配流智能化编制方法,构建了基于Greedy算法的多阶段决策模型.以编组顺序为准依次划分阶段,提出了根据各阶段Δti（将最晚编组时刻和最早解体时刻之差与解体标准作业时间作求余运算所得之值）动态划分解体区间的方法;在解体区间内,以当前阶段待编列车的车流需求为匹配目标,设计了5种依据不同规则与策略的最优解体列车选择算法;将各阶段决策变量依次组成序列,得到最终的解体顺序.选取不同策略或改变参数,进行了8组对比实验,结果表明:简单规则和策略无法保证解的质量,匹配度选择算法的优劣取决于解体区间数量与解体列车选择策略;在基于R_PPCD2（根据当前阶段车流资源与后续阶段所需车流的去向匹配度选择解体列车的策略）的算法中,适当调整解体时间、编组作业时间、出发车作业时间等参数,可以在2 s内寻找到该NP难问题的一个高质量近似解.