The establishment of edge-based loop algebra theory of kinematic chains and its applications

Based on the edge-based array representation of loops in the topological graphs of kinematic chains, this paper first proposes three arithmetic operations of loops. Then the concept of the independent loop set as well as its determination rules is introduced, and a new structure decomposition algorithm of kinematic chains is presented. Based on the algorithm, an automatic and efficient method for rigid sub-chain detection and driving pair selection of kinematic chains is proposed. Finally, an index is proposed to assess computation complexity of kinematic analysis with respect to different driving pair selections.     

A two-level strategy for segmenting center of interest from pictures

Segmenting center of interests (COIs) from pictures is an important but highly challenging problem for researchers in computer vision and image processing. The capability of understanding the meanings of pictures by computers can lead to breakthroughs in a wide range of applications including Web image search and online picture-sharing communities. In this paper, a two-level strategy is presented, which consists of a rough segmentation stage and a fine segmentation stage. In the first level, a picture is partitioned into four regions by using a block clustering method based on color and texture features, and the COI within the picture is distinguished from the background according to the principles of photographic composition. This stage aims to determine the approximate region of the target. In the second level, a novel active contour model is established based on shape information and vector method, where the image energy is defined by a hue gradient and the external energy is generated from either a triangular inner force or a supplementary force. This stage tries to extract the boundary of the target accurately. Experimental results on photos downloaded from the Internet show the feasibility and effectiveness of the proposed method.     

A passive tree-based backbone construction scheme for MANETs

Backbone-based broadcast schemes are effective in alleviating the broadcast storm problem in mobile ad hoc networks (MANETs). However, periodically hello packets used to maintain a backbone usually lead to extra control overhead. In this paper, passive tree-based backbone construction scheme (PTBCS) is proposed as a backbone construction scheme for MANETs. Different from other schemes, each node in PTBCS determines its role by intercepting packet transmissions in the air during a special waiting period. Hence, its most remarkable advantage is that there are no periodical packet transmissions specially for backbone construction. The property that the nodes selected by PTBCS make up a connected dominating set (CDS) of the network is proven with several ideal assumptions. Simulation results show that PTBCS is effective when compared with some other typical backbone construction schemes.     

The research on mechanism of color management system based on iCAM color appearance model

Since color recording and color representing abilities of various media are very different, color information is often lost or misrepresented in the process of image transmission and reproduction. A Color Management System (CMS) based on iCAM color appearance model is presented in this paper. It can be used either in computer operation system software or application software for obtaining color consistency across different software applications, imaging devices, imaging media and viewing conditions.     

有向无环图最小度生成树问题的一种近似算法

计算具有较小度的生成树是算法与复杂性研究的一个基本问题,同时在网络设计等领域具有重要应用.给定具有n个顶点的有向无环图G=(V,E)和根顶点r∈ V,最小度生成树问题欲求一棵以r为根的生成树T,使得在G的所有以r为根的生成树中T的最大度最小.给出该问题的一种迭代的多项式时间近似算法.该算法所求树的度不超过△*+1,其中△*为某一最优树的度.算法的时间复杂度为O(n2logn),其中n为顶点数目.算法没有运用过多的枚举,其实际运行时间要快得多.     

基于网络状态参数估计的主动队列管理PI改进算法

作为一种重要的主动队列管理手段,PI控制器算法通过积分嚣的引入有效地消除了队列长度控制的稳态误差,在提高网络吞吐的同时缩短了排队时延.但是PI控制器不能根据网络状态变化而自动调整控制参数,故当网络流量变化时PI控制器的收敛速度很慢.基于TCP-AQM系统模型,对经过中间节点的活动连接数、平均往返时间和前向链路容量等3个参数进行估计.通过计算击中概率的倒数,估计出活动流数;通过计算单位时间的数据包数,估计出网络容量;通过往返时延、活动流数、网络容量以及丢包概率在稳态时的关系式,估算出平均往返时延.在此基础上,提出了对网络状态变化自适应调整控制参数改进的快速收敛PI算法——FCPI算法.仿真结果表明,该算法有效提高了算法的收敛速度,并且鲁棒性好,易于实现,适用于未来高速网络的路由器.     

基于遗传算法的直线光流刚体运动重建

建立一种新的基于直线光流场从单目图像序列恢复刚体运动和结构的模型,推导出直线光流场与刚体的运动参数之间的关系,用2个二阶线性微分方程表达这种关系,并提出一种求解刚体运动参数的遗传算法,只需要获得图像平面的2条直线光流即可求解刚体的旋转参数,并用合成图像测试了该算法的有效性。     

基于动态逻辑许可证的PDF版权管理系统

电子文档版权管理是数字版权管理的重要研究领域,提出一种PDF电子文档版权保护方案,该方案的权限管理基于一种具有强大表达力、灵活性和开放权限管理能力的动态逻辑许可证,具有详细的文档权限控制方法,并通过内容级的PDF文档加密方法增强文档的安全性。对系统模型、实现结构和方法进行说明,并与相关方法进行对比和应用示例。     

一种基于组策略的过滤式特征选择算法

MRMR算法具有快速、高效等优势,在处理高维数据方面较为流行。基于此,提出一种基于组策略的MRMR改进算法（MRMRE）,该算法不仅考虑单个特征属性的相关性与冗余性,同时针对特征组间的相互关系进行研究。算法以MRMR算法为框架,以CCA作为度量基准,选择SVMs作为基分类器,使其特征选择效果提升。在UCI机器学习数据库中图像与基因序列数据集上的大量实验表明：与MRMR算法相比,所提出的算法其特征选择结果具有更高的结果稳定性与分类精度。     

Wireless channel extraction analyzing based on graph theory

Wireless channels comprise various signal characteristics that correspond to different features. This research applies digital signal processing to first excavate and categorize various features found in the channel data. Then, borrowing from graph theory, fast clustering analysis and decision tree modeling are introduced to identify unique “fingerprint” characteristics. Finally, two scenarios were tested using artificial neural networks to identify and verify their applicability in different geographical locations.