Modelling concurrency with comtraces and generalized comtraces

Comtraces (combined traces) are extensions of Mazurkiewicz traces that can model the “not later than” relationship. In this paper, we first introduce the novel notion of generalized comtraces, extensions of comtraces that can additionally model the “non-simultaneously” relationship. Then we study some basic algebraic properties and canonical representations of comtraces and generalized comtraces. Finally we analyze the relationship between generalized comtraces and generalized stratified order structures. The major technical contribution of this paper is a proof showing that generalized comtraces can be represented by generalized stratified order structures.     

A new homotopy perturbation method for solving systems of partial differential equations

In this paper, a new homotopy perturbation method (NHPM) is introduced for obtaining solutions of systems of non-linear partial differential equations. Theoretical considerations are discussed. To illustrate the capability and reliability of the method three examples are provided. Comparison of the results of applying NHPM with those of applying HPM reveal the effectiveness and convenience of the new technique.     

Proofs of randomized algorithms in Coq

Randomized algorithms are widely used for finding efficiently approximated solutions to complex problems, for instance primality testing and for obtaining good average behavior. Proving properties of such algorithms requires subtle reasoning both on algorithmic and probabilistic aspects of programs. Thus, providing tools for the mechanization of reasoning is an important issue. This paper presents a new method for proving properties of randomized algorithms in a proof assistant based on higher-order logic. It is based on the monadic interpretation of randomized programs as probabilistic distributions (Giry, Ramsey and Pfeffer). It does not require the definition of an operational semantics for the language nor the development of a complex formalization of measure theory. Instead it uses functional and algebraic properties of unit interval. Using this model, we show the validity of general rules for estimating the probability for a randomized algorithm to satisfy specified properties. This approach addresses only discrete distributions and gives rules for analyzing general recursive functions.We apply this theory to the formal proof of a program implementing a Bernoulli distribution from a coin flip and to the (partial) termination of several programs. All the theories and results presented in this paper have been fully formalized and proved in the Coq proof assistant.     

Partial 3D Shape Retrieval by Reeb Pattern Unfolding

This paper presents a novel approach for fast and efficient partial shape retrieval on a collection of 3D shapes. Each shape is represented by a Reeb graph associated with geometrical signatures. Partial similarity between two shapes is evaluated by computing a variant of their maximum common sub-graph.
By investigating Reeb graph theory, we take advantage of its intrinsic properties at two levels. First, we show that the segmentation of a shape by a Reeb graph provides charts with disk or annulus topology only. This topology control enables the computation of concise and efficient sub-part geometrical signatures based on parameterisation techniques. Secondly, we introduce the notion of Reeb pattern on a Reeb graph along with its structural signature. We show this information discards Reeb graph structural distortion and still depicts the topology of the related sub-parts. The number of combinations to evaluate in the matching process is then dramatically reduced by only considering the combinations of topology equivalent Reeb patterns.
The proposed framework is invariant against rigid transformations and robust against non-rigid transformations and surface noise. It queries the collection in interactive time (from 4 to 30 seconds for the largest queries). It outperforms the competing methods of the SHREC 2007 contest in term of NDCG vector and provides, respectively, a gain of 14.1% and 40.9% on the approaches by Biasotti et al. [ BMSF06 ] and Cornea et al. [ CDS*05 ].
As an application, we present an intelligent modelling-by-example system which enables a novice user to rapidly create new 3D shapes by composing shapes of a collection having similar sub-parts.     

基于近红外与高光谱技术的小麦种子多指标检测方法

采集47份小麦样本的高光谱图像,提取感兴趣区内的平均光谱,结合反映小麦品质的水分、蛋白质和湿面筋三个指标基础数据,通过OPUS软件搜寻最佳的光谱预处理和波段组合,分别建立了三个指标的偏最小二乘法(PLS)定量分析模型.同时与采用近红外(.NIR)光谱技术建立的三个指标的近红外模型进行比较,发现高光谱模型的各性能指标均明显优于近红外模型.结果表明:当被测样品为颗粒状且内部化学成分分布不均匀时,近红外模型的准确性和稳定性会受其测量条件的限制,而高光谱采样面积大,获取信息更全面,展现出强大的分析检测潜质,为小麦品质评价提供了新方法.     

基于近似偏最小一乘的闭环系统辨识新方法

本文基于近似最小一乘准则和主成分分析,针对反馈通道模型阶次低于前向通道模型阶次且反馈通道不存在噪声的闭环系统,进行了近似偏最小一乘递推辨识算法的推导.为解决最小一乘准则函数不可微的问题,本文算法用确定性可导函数近似代替残差绝对值.近似偏最小一乘辨识算法可以克服基于最小二乘准则的辨识算法在受到满足(SαS)分布的尖峰噪声干扰时残差平方项过大的缺点,具有目标函数可导,计算简单的优点.同时,通过主成分分析去除数据向量各元素之间的线性相关,可以得出模型参数的唯一解.仿真实验表明,本文算法可以对反馈通道模型阶次低于前向通道模型阶次的闭环系统进行直接辨识,抑制了尖峰噪声对辨识结果的影响,具有优良的稳健性,可以更好地应用于闭环系统辨识.     

State transformation-based dynamic visual servoing for an unmanned aerial vehicle

In this paper, we propose a visual servoing control for a quadrotor unmanned aerial vehicle (UAV) which is based on a state transformation technique. The UAV is equipped with a single downwards facing camera, and the motion control objective is the regulation of relative displacement and yaw to a stationary visual target located on the ground. The state transformation is defined by a system of partial differential equations (PDEs) which eliminate roll and pitch rate dependence in the transformed image feature kinematics. A method for computing the general solutions of these PDEs is given, and we show a particular solution reduces to an established virtual camera approach. We treat point and line cases and introduce image moment features defined in the virtual camera image plane. Robustness of the control design is improved by accounting for attitude measurement bias, and uncertainty in thrust gain, mass, and image feature depth. The asymptotic stability of the closed-loop is proven. The method is based on a simple proportional-integral-derivative (PID) structure which can be readily implemented on-board. Experimental results show improved performance relative to previous work.     

半监督FSVM在羽绒菱节识别中的应用

目前,我国对羽绒种类的识别主要由人工借助于显微镜完成,这种方法存在许多不足。提出将半监督FSVM算法引入到羽绒识别中,用半监督学习方法以少量的训练样本为基础,扩大训练样本集的规模,同时利用FSVM的特性减少半监督学习所带来的误差;利用半监督FSVM对经过处理的羽绒二值化图像中的菱节进行识别。该方法提高了菱节识别的准确率。     

一种图像放大的偏微分方程综合模型

针对传统图像放大处理过程中基于线性插值方法通常导致边缘模糊问题,分析了各向同性扩散模型和各向异性扩散模型在图像处理中的优缺点,提出了一种线性扩散和P-M方程自适应结合的图像放大综合模型。该模型对图像非平滑区域采用各向异性扩散模型处理,而平滑区域则采用各向同性扩散模型处理。实验结果表明,该综合模型在保持图像边缘锐度的同时提高了图像的清晰度,能够有效提高放大图像的主观视觉质量和客观SNR及PSNR。