直径为5的树的优美性

本文利用移边定理（引理1）,对星型树进行移边操作,针对不同情况,得到了相应特殊标号点分布的双星型树,再技巧性地移边,最终得到一组具体的优美标号,证明了任一直径为5的树的优美性．     

标签算法在识别移动台运动状态中的应用

准确识别移动台的运动过程是应用无线定位技术获取交通信息的基础。在分析移动台运动特征的基础上,阐述了识别移动台运动过程的原理。通过实际的测试获取了GPS机的时空数据,选择不同的时间间隔,应用标签算法识别GPS机的移动、静止状态,得到了不同的识别结果。试验结果显示,在时间间隔选择得当的情况下,标签算法具有良好的识别结果。     

Solving the Median Shortest Path Problem in the Planning and Design of Urban Transportation Networks Using a Vector Labeling Algorithm

This paper proposes an alternative algorithm to solve the median shortest path problem (MSPP) in the planning and design of urban transportation networks. The proposed vector labeling algorithm is based on the labeling of each node in terms of a multiple and conflicting vector of objectives which deletes cyclic, infeasible and extreme-dominated paths in the criteria space imposing cyclic break (CB), path cost constraint (PCC) and access cost parameter (ACP) respectively. The output of the algorithm is a set of Pareto optimal paths (POP) with an objective vector from predetermined origin to destination nodes. Thus, this paper formulates an algorithm to identify a non-inferior solution set of POP based on a non-dominated set of objective vectors that leaves the ultimate decision to decision-makers. A numerical experiment is conducted using an artificial transportation network in order to validate and compare results. Sensitivity analysis has shown that the proposed algorithm is more efficient and advantageous over existing solutions in terms of computing execution time and memory space used.     

关于圈C4h的(r1,r2,…,r4h)-冠的优美性

给出了圈C4h的(r1,r2,…,r4h)-冠的定义,讨论了圈C4h的(r1,r2,…,r4h)-冠的优美性,用构造性的方法给出了一些特殊的圈C4h的(r1,r2,…,r4h)-冠的优美标号.证明了一些特殊的圈C4h的(r1,r2,…,r4h)-冠是交错图.     

Dynamic programming-based method for extraction of license plate numbers of speeding vehicles on the highway

In the last decade, vehicle identification systems have become a central element in many applications involving traffic law enforcement and security enhancement, such as locating stolen cars, automatic toll management, and access control to secure areas. As a method of vehicle identification, license plate recognition (LPR) systems play an important role and a number of such techniques have been proposed. In this paper, we describe a method for segmenting the main numeric characters on a license plate by introducing dynamic programming (DP) that optimizes the functionality describing the distribution of the intervals between characters, the alignment of the characters, and the threshold difference used to extract the character blobs. The proposed method functions very rapidly by applying the bottom-up approach of the DP algorithm and also robustly by minimizing the use of environment-dependent image features such as color and edges.     

成年大鼠液压冲击脑损伤诱导室下区Nestin和GFAP的表达

目的　应用免疫组织化学和免疫荧光双标技术结合激光共聚焦显微镜 ,观察脑损伤后不同时期室下区巢蛋白(Nestin)和胶质酸性纤维蛋白 (GFAP)的表达及其细胞类型。方法　用动液压冲击法建立动物模型 ,用LeicaQ5 0 0IW图像处理系统及免疫组化和免疫荧光双标法分析和显示不同时期 (1、3、5d ,1、2、3、4、6、8周 )Nestin和GFAP的表达变化。结果　损伤 2 4h后 ,室下区有大量Nestin和GFAP的表达 ,且激光共聚焦显微镜观察到有Nestin阳性突起与GFAP共存现象 ,7d左右达到高峰 ,然后随着时间的推移其表达逐渐下降。正常组和假手术组 ,室下区也可见到Nestin和GFAP的表达 ,但与脑损伤组相比较低 (P <0 .0 5 )。结论　脑损伤可诱导室下区Nestin和GFAP的表达 ,Nestin阳性突起与GFAP共存细胞可能具有干细胞特性 ,与神经元的修复有关。     

Application of a Fast Connected Components Labeling Algorithm in Processing Landmark Images

Extracting geometric data of landmarks from fluoroscopic images plays an important role in camera calibration process of a fluoroscopic-image-based surgical navigation system. Connected components labeling is the essential technique for the extraction. A new fast connected components labeling algorithm was presented. The definition of upward concave set was introduced to explain the algorithm. Feasibility and efficiency of the algorithm were verified with experiments. This algorithm performs well in labeling non-upward concave set connected components and applies to landmarks labeling well. Moreover, the proposed algorithm possesses a desirable characteristic that will facilitate the subsequent processing of fluoroscopic images.