Morphological Models for the Collapse of Area Features in Digital Map Generalization

Collapse is an essential operation for the manipulation of area features in digital data generalization. This operation can be categorized into two types: complete collapse and partial collapse. The former is composed of another two types: area-to-point and area-to-line collapse. In this paper, a set of algebraic models built upon the operators in mathematical morphology is described for the area-to-line collapse and partial collapse operations. For the area-to-line collapse operation, a modified skeleton algorithm is presented. For the partial collapse operation, a procedure is designed which consists of a set of operations, i.e., the skeletonization, separation of areal and linear parts, simplification of areas and an overlay operation. These models are tested using real map data sets.     

基于立方体染色的排课表模型

根据立方体染色思想,建立排课表模型,引入关联锁原理,将排课表约束条件转化为立方体点线面关系,增强该模型的收敛性,从而更好地解决排课问题。分析结果表明,在教师、课程、学生等信息已知的情况下,该模型可给出教学资源消耗的最小值,达到合理利用教学资源的目的。     

基于矩形NAM和偏微分方程的灰度图像压缩方法

借助矩形NAM图像表示方法和偏微分方程技术,提出一种新的灰度图像压缩方法.该方法在编码端把原始图像逆布局为若干矩形子块,并采用坐标压缩方法存储每个子块的位置、大小.在解码端,采用偏微分方程进行图像修复,有效消除解码图像中的方块效应.该方法的时间复杂度为 ,其中n为灰度图像像素数.实验表明:在保持图像质量的前提下,该方法具有更高的压缩比和更少的块数,具有较高实用价值.     

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)光谱技术建立的三个指标的近红外模型进行比较,发现高光谱模型的各性能指标均明显优于近红外模型.结果表明:当被测样品为颗粒状且内部化学成分分布不均匀时,近红外模型的准确性和稳定性会受其测量条件的限制,而高光谱采样面积大,获取信息更全面,展现出强大的分析检测潜质,为小麦品质评价提供了新方法.