A characterization of projective-planar signed graphs

A signed graph has a plus or minus sign on each edge. A simple cycle is positive or negative depending on whether it contains an even or odd number of negative edges, respectively. We consider embeddings of a signed graph in the projective plane for which a simple cycle is essential if and only if it is negative. We characterize those signed graphs that have such a projective-planar embedding. Our characterization is in terms of a related signed graph formed by considering the theta subgraphs in the given graph.     

Equisingular Deformations of Sandwiched Singularities

We relate the equisingular deformation theory of plane curve singularities and sandwiched surface singularities. We show the existence of a smooth map between the two corresponding deformation functors and study the kernel of this map. In particular we show that the map is an isomorphism when a certain invariant is large enough.     

Adaptive remeshing for ductile fracture prediction in metal formingRemaillage adaptatif pour la prévision de la rupture ductile en mise en forme

The analysis of mechanical structures using the Finite Element Method in the framework of large elastoplastic strain, needs frequent remeshing of the deformed domain during computation. Indeed, the remeshing is due to the large geometrical distortion of finite elements and the adaptation to the physical behavior of the solution. This paper gives the necessary steps to remesh a mechanical structure during large elastoplastic deformations with damage. An important part of this process is constituted by geometrical and physical error estimates. The proposed method is integrated in a computational environment using the ABAQUS/Explicit solver and the BL2D-V2 adaptive mesher. To cite this article: H. Borouchaki et al., C. R. Mecanique 330 (2002) 709–716.     

松纵坑切梢小蠹虫害的仿真模型与生态防治的优化策略

根据松纵坑切梢小蠹的主要生物学特征,通过分析抚育间伐持续控制松纵坑切梢小蠹虫害的机理,应用复杂适应系统(CA S)理论,建立了模拟松纵坑切梢小蠹虫害的一种动态演化数学模型,并讨论了模型的收敛性.然后选用昆明小哨林场为背景,进行了各种抚育间伐决策的仿真,从中优选抚育间伐决策.结果表明:模拟优化方案与实际调查统计分析结果一致:均为弱度间伐与中弱度间伐控制蠹害效果最好.最后通过森林积材量与虫害程度之间的优化,给出了抚育间伐的优化策略.     

Discontinuous travelling wave solutions for certain hyperbolic systems

In an earlier paper on a malignant cell invasion model (Marchantet al., SIAM J. Appl. Math, 60, 2000) we introduced a novelform of discontinuous travelling wave solution. These solutionscould be studied easily by combining behaviour within a phaseplane with the Rankine–Hugoniot shock conditions, whichdescribe properties (such as the ratio of the jump discontinuitiesto the speed of propagation) that solutions may possess. Theseresults were new for several reasons. The shock conditions relateto hyperbolic equations (which the model is) but were appliedin a travelling wave ordinary differential equation phase planeusing techniques that usually apply to parabolic reaction–diffusionsystems. In addition the solutions possess singular behaviournear several points in the phase plane but in spite of thisthere exists a robust and stable family of physically interestingsolutions. In this paper we discuss two previously studied models, oneof detonation theory and one of angiogenesis. We show that eachof these models also possesses a family of discontinuous travellingwave solutions which was not previously discovered. Of particularinterest is the solution which has a blunt interface at thefront of the invading profile. In all three models it is thissolution that is seen to stably evolve from physically relevantinitial data, and for physically relevant parameter values. This work confirms the robustness of these novel travellingwave solutions and their applicability to a wider range of mathematicalmodelling situations.     

Counting unrooted maps on the plane

A planar map is a 2-cell embedding of a connected planar graph, loops and parallel edges allowed, on the sphere. A plane map is a planar map with a distinguished outside (“infinite”) face. An unrooted map is an equivalence class of maps under orientation-preserving homeomorphism, and a rooted map is a map with a distinguished oriented edge. Previously we obtained formulae for the number of unrooted planar n-edge maps of various classes, including all maps, non-separable maps, eulerian maps and loopless maps. In this article, using the same technique we obtain closed formulae for counting unrooted plane maps of all these classes and their duals. The corresponding formulae for rooted maps are known to be all sum-free; the formulae that we obtain for unrooted maps contain only a sum over the divisors of n. We count also unrooted two-vertex plane maps.     

Simplest optimal cutting patterns for equal rectangles

This paper presents branch-and-bound algorithms that can guarantee the simplest optimal cutting patterns of equal rectangles. An existing linear algorithm determines the global upper bound exactly. The branching process ends when a branch of a lower bound equal to the global upper bound is found.     

Interior point cutting plane method for optimal power flow

In this paper, an interior point cutting plane method (IPCPM)is applied to solve optimal power flow (OPF) problems. Comparedwith the simplex cutting plane method (SCPM), the IPCPM is simpler,and efficient because of its polynomial-time characteristic.Issues in implementing IPCPM for OPF problems are addressed,including (1) how to generate cutting planes without using thesimplex tableau, (2) how to identify the basis variables inIPCPM, and (3) how to generate mixed integer cutting planes.The calculation speed of the proposed algorithm is further enhancedby utilizing the sparsity features of the OPF formulation. Numericalsimulations on IEEE 14-300-bus test systems have shown thatthe proposed method is effective.     

地面附近的高空核爆电磁脉冲环境

 主要研究在高空核爆的双指数类型电磁脉冲平面波入射时，地面附近的电磁脉冲环境。计算给出了在不同入射波状态，不同地表介质电气特性和距地面不同高度等条件下的电磁脉冲环境参数，归纳了一些规律性认识。结果显示：地面附近的电场会随距地面高度的不同而发生显著的变化，对于水平场分量，其反射场总是试图抵消入射场，而对于垂直场分量，其反射场叠加在入射场上，使得地面附近的垂直场强幅值一般大于入射波场强幅值；当入射波仰角增大时，合成电场波形的脉冲宽度会变宽；地表介质的电气特性参数不同也会对地面附近电场的波形和幅值造成一定的影响。     

On covering bridged plane triangulations with balls

We show that every plane graph of diameter 2r in which all inner faces are triangles and all inner vertices have degree larger than 5 can be covered with two balls of radius r. © 2003 Wiley Periodicals, Inc. J Graph Theory 44: 65–80, 2003