三维图像中边界曲面的抽取与半透明可视化

已有算法在重构及可视化梯度值从高到低变化且包含弱边界的边界曲面时无法分辨弱边界与噪声碎片。针对上述问题,提出边界曲面半透明显示方法。采用半透明显示技术显示边界曲面及附着在其上的小碎片,利用人的智能及知识在观察可视化结果时对小碎片及弱边界进行有效的区分。结果证明,该方法有助于正确理解及完整显示三维图像中梯度值从高到低变化的边界曲面,为进一步的交互式操作去除小碎片提供依据。     

有限长度LDPC码一种速率兼容删余算法

提出一种AWGN信道下有限长度RC-LDPC码的删余算法,该算法对规则及非规则LDPC码均有效。该删余算法基于一系列准则,其中一个重要准则是某个候选删除节点的具有低的近似环外消息度(ACE)的短环的数量。仿真结果表明,ACE对删余码的性能有很大的影响,该算法的性能比已有算法有进一步提高。     

Probability of graphs with large spectral gap by multicanonical Monte Carlo

Graphs with large spectral gap are important in various fields such as biology, sociology and computer science. In designing such graphs, an important question is how the probability of graphs with large spectral gap behaves. A method based on multicanonical Monte Carlo is introduced to quantify the behavior of this probability, which enables us to calculate extreme tails of the distribution. The proposed method is successfully applied to random 3-regular graphs and large deviation probability is estimated.     

Group path covering and distance two labeling of graphs

For a positive integer d, an L(d,1)-labeling f of a graph G is an assignment of integers to the vertices of G such that |f(u)−f(v)|?d if uv∈E(G), and |f(u)−f(v)|?1 if u and u are at distance two. The span of an L(d,1)-labeling f of a graph is the absolute difference between the maximum and minimum integers used by f. The L(d,1)-labeling number of G, denoted by λd,1(G), is the minimum span over all L(d,1)-labelings of G. An L^′(d,1)-labeling of a graph G is an L(d,1)-labeling of G which assigns different labels to different vertices. Denote by the L^′(d,1)-labeling number of G. Georges et al. [Discrete Math. 135 (1994) 103-111] established relationship between the L(2,1)-labeling number of a graph G and the path covering number of Gc, the complement of G. In this paper we first generalize the concept of the path covering of a graph to the t-group path covering. Then we establish the relationship between the L^′(d,1)-labeling number of a graph G and the (d−1)-group path covering number of Gc. Using this result, we prove that and for bipartite graphs G can be computed in polynomial time.     

On the implication problem for cardinality constraints and functional dependencies

In database design, integrity constraints are used to express database semantics. They specify the way by that the elements of a database are associated to each other. The implication problem asks whether a given set of constraints entails further constraints. In this paper, we study the finite implication problem for cardinality constraints. Our main result is a complete characterization of closed sets of cardinality constraints. Similar results are obtained for constraint sets containing cardinality constraints, but also key and functional dependencies. Moreover, we construct Armstrong databases for these constraint sets, which are of special interest for example-based deduction in database design.     

Re-engineering of the design process for concurrent engineering

According to the requirements of concurrent engineering, three interdependency relationships (uncoupled relationship, coupled relationship and decoupled relationship) between design activities are presented in this paper. And the coupled relationship plays an important role in concurrent product design process. To represent the precedence relationships among design activities, a directed graph is used to describe the design process. And the interdependency relationship between activities is illustrated by a Design Structure Matrix which is the transpose of the accessibility matrix of the corresponding graph. Using the DSM, an algorithm of recognizing the coupled activities during the design process is presented. Moreover, an algorithm to figure out the order levels of activities during the design process is proposed. And both algorithms are illustrated with a die design example.     

The model-based human body motion analysis system

In this paper, we propose a model-based method to analyze the human walking motion. This system consists of three phases: the preprocessing phase, the model construction phase, and the motion analysis phase. In the experimental results, we show that our system not only analyzes the motion characteristics of the human body, but also recognizes the motion type of the input image sequences. Finally, the synthesized motion sequences are illustrated for verification. The major contributions of this research are: (1) developing a skeleton-based method to analyze the human motion; (2) using Hidden Markov Model (HMM) and posture patterns to describe the motion type.     

手写体汉字在特征空间的可视化分析

手写体汉字特征一般在几百维以上,在这样的高维空间中,汉字样本是如何分布的?本文从可视化的角度对这一问题进行了探讨。论文首先给出了所选用的汉字特征的定义,然后对一些具有代表性的汉字实例,从K-L变换法、线性投影法和非线性投影法三个方面,对汉字在特征空间的分布问题进行了可视化分析,结果表明,可视化分析可以帮助人们了解汉字在特征空间的分布情况,对改进识别器的性能具有指导意义。     

A new neural network algorithm for planarization problems

To deal with the planarization problem widely used in many applications including routing very-large-scale integration （VLSI） circuits, this paper points out that only when its vertices are arranged in some specific order in a line can a planar graph be embedded on a line without any cross connections or cross edges. Energy function is proposed to meet the need of embedding a graph on a single line and route it correctly. A Hopfield network is designed according to the proposed energy function for such embedding and routing. The advantage of the proposed method is that it not only can detect if a graph is a planar one or not, but also can embed a planar graph or the maximal planar subgraph of a non-planar graph on a single line. In addition, simulated annealing is employed for helping the network to escape from local minima during the running of the Hopfield network. Experiments of the proposed method and its comparison with some existent conventional methods were performed and the results indicate that the proposed method is of great feasibility and effectiveness especially for the planarization problem of large graphs.     

扩展时间事件图的能达性与能控序列

利用图论方法在双子结构中研究扩展时间事件图的某些问题,获得了能达性的一个充分必要条件和基于能达性的标准结构。在此基础上,把监控理论中的能控序列的分量分为本质不同的３类,进而得到能控序列的简化求解方法。