On the geometry of the Batalin–Vilkovisky formalism

In this work it is proved that the geometry of the well-known quantization scheme of general gauge theories, the so-called Batalin–Vilkovisky formalism, is the odd Riemannian geometry. Translated from Izvestiya Vysshikh Uchebnykh Zavedenii, Fizika, No. 11, pp. 28–31, November, 2008.     

联系数中差异度系数i的专家估测法及应用

在联系数中差异度系数i已有取值方法的基础上,给出了差异度系数i的专家估测取值方法、加权统计取值方法和频数统计取值方法以及它们在实际中的应用.     

An exact DSatur-based algorithm for the Equitable Coloring Problem

This paper describes an exact algorithm for the Equitable Coloring Problem, based on the well known DSatur algorithm for the classic Coloring Problem with new pruning rules specifically derived from the equity constraint. Computational experiences show that our algorithm is competitive with those known in literature.     

A general approach to fuzzy concepts

The paper proposes a flexible way to build concepts within fuzzy logic and set theory. The framework is general enough to capture some important particular cases, with their own independent interpretations, like “antitone” or “isotone” concepts constructed from fuzzy binary relations, but also to allow the two universes (of objects and attributes) to be equipped each with its own truth structure. Perhaps the most important feature of our approach is that we do not commit ourselves to any kind of logical connector, covering thus the case of a possibly non‐commutative conjunction too. (© 2004 WILEY‐VCH Verlag GmbH & Co. KGaA, Weinheim)     

On trees with a maximum proper partial 0-1 coloring containing a maximum matching

I prove that in a tree in which the distance between any two endpoints is even, there is a maximum proper partial 0-1 coloring such that the edges colored by 0 form a maximum matching.     

On star and caterpillar arboricity

We give new bounds on the star arboricity and the caterpillar arboricity of planar graphs with given girth. One of them answers an open problem of Gyárfás and West: there exist planar graphs with track number 4. We also provide new NP-complete problems.     

Graph Coloring with Adaptive Evolutionary Algorithms

This paper presents the results of an experimental investigation on solving graph coloring problems with Evolutionary Algorithms (EAs). After testing different algorithm variants we conclude that the best option is an asexual EA using order-based representation and an adaptation mechanism that periodically changes the fitness function during the evolution. This adaptive EA is general, using no domain specific knowledge, except, of course, from the decoder (fitness function). We compare this adaptive EA to a powerful traditional graph coloring technique DSatur and the Grouping Genetic Algorithm (GGA) on a wide range of problem instances with different size, topology and edge density. The results show that the adaptive EA is superior to the Grouping (GA) and outperforms DSatur on the hardest problem instances. Furthermore, it scales up better with the problem size than the other two algorithms and indicates a linear computational complexity.     

关于多重联图的均匀全染色

对一个正常的全染色满足各种颜色所染元素数(点或边)相差不超过1时,称为均匀全染色,其所用最少染色数称为均匀全色数．本文证明了关于多重联图的若干情况下的均匀全色数定理,得到了若干特殊多重联图的均匀全色数．     

基于模糊语言评估和联系数的多属性群决策方法

对方案的属性评估信息以模糊语言形式给出的多属性群决策问题,采用集对分析理论进行处理,提出了一种基于模糊语言评估和联系数的多属性群决策方法,实例应用表明了该方法的有效性和实用性.