转移法色交换

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

A novel method of suppressing the inrush current of transformers by using a series‐connected voltage‐source PWM converter

This paper proposes a novel method of suppressing the inrush current of transformers. A small‐rated voltage‐source PWM converter is connected in series to the transformers through a matching transformer. As the connected PWM converter serves as a resistor for the source current, no inrush phenomena occurs. The required rating of the PWM converter, which serves as the damping resistor for the inrush phenomena, is 1/400 that of the main transformers in single‐phase circuits. In three‐phase circuits, it is 1/900. The basic principle of the proposed method is discussed. Digital computer simulation is implemented to confirm the validity and excellent practicability of the proposed method using the PSCAD/EMTDC. A prototype experimental model is constructed and tested. The experimental results demonstrate that the proposed method can perfectly suppress the inrush phenomena. © 2006 Wiley Periodicals, Inc. Electr Eng Jpn, 157(4): 56–65, 2006; Published online in Wiley InterScience ( www.interscience.wiley.com ). DOI 10.1002/eej.20174     

Connecting parameters optimization on unsymmetrical twin-tower structure linked by sky-bridge

Based on a simplified 3-DOF model of twin-tower structure linked by a sky-bridge, the frequency response functions, the displacement power spectral density （PSD） functions, and the time-averaged total vibration energy were derived, by assuming the white noise as the earthquake excitation. The effects of connecting parameters, such as linking stiffness ratio and linking damping ratio, on the structural vibration responses were then studied, and the optimal connecting parameters were obtained to minimize the vibration energy of either the independent monomer tower or the integral structure. The influences of sky-bridge elevation position on the optimal connecting parameters were also discussed. Finally, the distribution characteristics of the top displacement PSD and the structural responses, excited by El Centro, Taft and artificial waves, were compared in both frequency and time domain. It is found that the connecting parameters at either end of connection interactively affect the responses of the towers. The optimal connecting parameters can greatly improve the damping connections on their seismic reduction effectiveness, but are unable to reduce the seismic responses of the towers to the best extent simultaneously. It is also indicated that the optimal connecting parameters derived from the simplified 3-DOF model are applicable for two multi-story structures linked by a sky-bridge with dampers. The seismic reduction effectiveness obtained varies from 0.3 to 1.0 with different sky-bridge mass ratio. The displacement responses of the example structures are reduced by approximately 22% with sky-bridge connections.     

REMARKS ON JOHN DISKS

Let D■R2 be a Jordan domain,D*=R2\D,the exterior of D.In this article,the authors obtained the following results:(1)If D is a John disk,then D is an outer linearly locally connected domain;(2)If D* is a John disk,then D is an inner linearly locally connected domain;(3)A homeomorphism f:R 2 →R 2 is a quasiconformal mapping if and only if f(D)is a John disk for any John disk D■R 2 ;and(4)If D is a bounded quasidisk,then D is a John disk,and there exists an unbounded quasidisk which is not a John disk.     

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.