转移法色交换

将图Ｇ的着色由一种变为中一种，通常用Ｋｅｍｐｅ法以交换。但是，对于某些情况，用此法无效。针对这个问题，本文提出了一种转移法色交换，它适用于平面图着色，方法直观，清晰且有效。     

Stability analysis for multi-agent systems using the incidence matrix: Quantized communication and formation control

The spectral properties of the incidence matrix of the communication graph are exploited to provide solutions to two multi-agent control problems. In particular, we consider the problem of state agreement with quantized communication and the problem of distance-based formation control. In both cases, stabilizing control laws are provided when the communication graph is a tree. It is shown how the relation between tree graphs and the null space of the corresponding incidence matrix encode fundamental properties for these two multi-agent control problems.     

Antimagic labeling and canonical decomposition of graphs

An antimagic labeling of a connected graph with m edges is an injective assignment of labels from {1,…,m} to the edges such that the sums of incident labels are distinct at distinct vertices. Hartsfield and Ringel conjectured that every connected graph other than K₂ has an antimagic labeling. We prove this for the classes of split graphs and graphs decomposable under the canonical decomposition introduced by Tyshkevich. As a consequence, we provide a sufficient condition on graph degree sequences to guarantee an antimagic labeling.     

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.     

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.     

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.     

Dynamics of Flexible Multibody Systems Using Virtual Work and Linear Graph Theory

By combining linear graph theory with the principle of virtualwork, a dynamic formulation is obtained that extends graph-theoreticmodelling methods to the analysis of flexible multibody systems. Thesystem is represented by a linear graph, in which nodes representreference frames on rigid and flexible bodies, and edges representcomponents that connect these frames. By selecting a spanning tree forthe graph, the analyst can choose the set of coordinates appearing inthe final system of equations. This set can include absolute, joint, orelastic coordinates, or some combination thereof. If desired, allnon-working constraint forces and torques can be automaticallyeliminated from the dynamic equations by exploiting the properties ofvirtual work. The formulation has been implemented in a computerprogram, DynaFlex, that generates the equations of motion in symbolicform. Three examples are presented to demonstrate the application of theformulation, and to validate the symbolic computer implementation.     

学生成绩评定方法研究

分别用x2拟合检验法、直方图和Q-Q分布图从直观和理论两方面出发验证学生成绩是否呈正态分布,通过图象与应用概率统计知识有机结合,运用数学软件对数据进行处理,达到验证研究的目的。     

A novel intelligent verification platform based on a structured analysis model

An intelligent verification platform based on a structured analysis model is presented.Using an abstract model mechanism with specific signal interfaces for user callback,the unified structured analysis data,shared by the electronic system level design,functional verification,and performance evaluation,enables efficient management review,auto-generation of code,and modeling in the transaction level.We introduce the class tree,flow parameter diagram,structured flow chart,and event-driven finite state machine as structured analysis models.As a sand table to carry maps from different perspectives and levels via an engine,this highly reusable platform provides the mapping topology to search for unintended consequences and the graph theory for comprehensive coverage and smart test cases.Experimental results show that the engine generates efficient test sequences,with a sharp increase in coverage for the same vector count compared with a random test.     

伪三色LED图文显示屏的设计及实现

介绍由８０３１单片机控制的伪三色ＬＥＤ图文显示屏的构成,硬件结构和抗干扰措施。