关于“L—Fuzzy群同态与同构及其性质”一文的注记

文（１）给出了Ｌ－Ｆｕｚｚｙ群间的同态映射，满同态映射以及Ｌ－Ｆｕｚｚｙ群的Ｌ－正规子群等概念。本文指出以上三种定义的不合理性，并给出它们的合理性定义。     

幂群所诱导的L—Fuzzy幂群

本文在幂群［１］的基础上，提出了幂群所诱导的Ｌ－Ｆｕｚｚｙ幂群、Ｌ－Ｆｕｚｚｙ幂群的λ－截、次幂群等一系列概念，并给出了幂群与其诱导的Ｌ－Ｆｕｚｚｙ幂群、λ截集群间的次同态、同态等关系。     

幂群所诱导的L－Fuzzy幂群

本文在幂群［１］的基础上，提出了幂群所诱导的Ｌ－Ｆｕｚｚｙ幂群、Ｌ－Ｆｕｚｚｙ幂群的λ－截、次幂群等—系列概念，并给出了幂群与其诱导的Ｌ－Ｆｕｚｚｙ幂群、λ截集群间的次同态、同态等关系。     

L-Fuzzy闭包算子的扩张原理

Ｆｕｚｚｙ闭包算子的扩张原理揭示了Ｆｕｚｚｙ闭包算子与经典闭包算子之间的密切关系,是利用传统学科已有结论研究Ｆｕｚｚｙ数学相关理论的有效工具。本文讨论了当Ｌ为有限分配格时,Ｌ－Ｆｕｚｚｙ闭包算子与闭包系统的扩张问题,并给出一种具体的由经典闭包算子生成Ｌ－Ｆｕｚｚｙ闭包算子的方法及其部分性质。     

L—Fuzzy拓扑空间的正则

本文给出一种在Ｌ－Ｆｕｚｚｙ拓扑空间中的正则，记作Ｎ－正则，且证明了它不仅强于文献「１」中所提出的正则，而且还具有一系列好的性质，最后我们给出一个定理说明了Ｎ－正则与良紧性之间的关系。     

L—Fuzzy拓扑空间中的可数F紧性与几乎可数F紧性

本文在Ｌ－ｕｚｚｙ拓扑空间中引入可数Ｆ紧性与几乎可数Ｆ紧性的概念，并讨论了它们的性质及其相互关系。     

LF弱半连续序同态

本文给出了ＬＦ半连续序同态的新特征定理；引入了ＬＦ弱半连续序同态的概念并给出了特征定理；引入了ＬＦｒｅｔｒａｃｔｉｏｎ和ＬＦＵｒｙｓｏｈｎ空间的概念，讨论了它们同ＬＦ弱半连续序同态的联系。本文的结果是已有工作的改进或扩充。     

L—fts中的导集和导算子

本文首先讨论了Ｌ－ｆｔｓ中ＬＦ集的聚点的分布；其次讨论了ＬＦ集的导集的一些性质，并给出了一般的Ｌ－ｆｔｓ中类似于杨忠道定理的结果；本文最后引进了导算子的概念，并用其刻划一般的Ｌ－ｆｔｓ。     

L—Fuzzy群的同志和同构

本文研究了Ｌ—Ｆｕｚｚｙ群的同态和同构，给出了它们的一些性质，并把群论中的同态定理和同构定理推广到Ｌ—Ｆｕｚｚｙ群上     

Fuzzy子格与Fuzzy同态

每个代数结构一般都可引入相应的Ｆｕｚｚｙ子结构，为了进一步研究Ｆｕｚｚｙ子和以及Ｆｕｚｚｙ同态的各种性质，本文引入了亚格的概念，并建立了Ｆｕｚｚｙ子格与亚格的对应关系（定理１．７）；给出了Ｆｕｚｚｙ同态（同构）的分解定理（定理２．５和推论２．７）；最后讨论了同余关系商格的Ｆｕｚｚｙ子格问题，证明了在自然映射下，任一保序映射可以引导出商格中应的Ｆｕｚｚｙ子格，并由此引出了φ－Ｆｕｚｚｙ商子格的概念。     

Counting dissections into integral squares

A squared rectangle is a rectangle dissected into squares. Similarly a rectangled rectangle is a rectangle dissected into rectangles. The classic paper ‘The dissection of rectangles into squares’ of Brooks, Smith, Stone and Tutte described a beautiful connection between squared rectangles and harmonic functions. In this paper we count dissections of a rectangle into a set of integral squares or a set of integral rectangles. Here, some squares and rectangles may have the same size. We introduce a method involving a recurrence relation of large sized matrices to enumerate squared and rectangled rectangles of a given sized rectangle and propose the asymptotic behavior of their growth rates.     

On arithmetic Macaulayfication of Noetherian rings

The Rees algebra is the homogeneous coordinate ring of a blowing-up. The present paper gives a necessary and sufficient condition for a Noetherian local ring to have a Cohen-Macaulay Rees algebra: A Noetherian local ring has a Cohen-Macaulay Rees algebra if and only if it is unmixed and all the formal fibers of it are Cohen-Macaulay. As a consequence of it, we characterize a homomorphic image of a Cohen-Macaulay local ring. For non-local rings, this paper gives only a sufficient condition. By using it, however, we obtain the affirmative answer to Sharp's conjecture. That is, a Noetherian ring having a dualizing complex is a homomorphic image of a finite-dimensional Gorenstein ring.

     

Scalarization of Henig Proper Efficient Points in a Normed Space

In a general normed space equipped with the order induced by a closed convex cone with a base, using a family of continuous monotone Minkowski functionals and a family of continuous norms, we obtain scalar characterizations of Henig proper efficient points of a general set and a bounded set, respectively. Moreover, we give a scalar characterization of a superefficient point of a set in a normed space equipped with the order induced by a closed convex cone with a bounded base.     

管状曲面在曲线论中的应用

研究了围绕曲线的管状曲面上的曲率线,渐近线与测地线,给出它们的方程,揭示了这些曲线与Bertrand曲线或Mannheim曲线之间的关系,采用新的方法给出一条曲线是Bertrand曲线或Mannheim曲线的充要条件的另一种证明以及Mannheim侣线的曲率与挠率之间的关系．     

DC programming techniques for solving a class of nonlinear bilevel programs

We propose a method for finding a global solution of a class of nonlinear bilevel programs, in which the objective function in the first level is a DC function, and the second level consists of finding a Karush-Kuhn-Tucker point of a quadratic programming problem. This method is a combination of the local algorithm DCA in DC programming with a branch and bound scheme well known in discrete and global optimization. Computational results on a class of quadratic bilevel programs are reported.     

A structure theorem for abelian quasi-ordered groups

We introduce a notion of compatible quasi-ordered groups which unifies valued and ordered abelian groups. It was proved by S.M. Fakhruddin that a compatible quasi-order on a field is always either an order or a valuation. We show here that the group case is more complicated than the field case and describe the general structure of a compatible quasi-ordered abelian group. We then define a notion of Hahn product of compatible quasi-ordered groups and generalize Hahn's embedding theorem to quasi-ordered groups. We also develop a notion of quasi-order-minimality and establish a connection with C-minimality, thus answering a question of F. Delon. Finally, we use compatible quasi-ordered groups to give an example of a C-minimal group which is neither an ordered nor a valued group.     

On parse trees and Myhill-Nerode-type tools for handling graphs of bounded rank-width

Rank-width is a structural graph measure introduced by Oum and Seymour and aimed at better handling of graphs of bounded clique-width. We propose a formal mathematical framework and tools for easy design of dynamic algorithms running directly on a rank-decomposition of a graph (on contrary to the usual approach which translates a rank-decomposition into a clique-width expression, with a possible exponential jump in the parameter). The main advantage of this framework is a fine control over the runtime dependency on the rank-width parameter. Our new approach is linked to a work of Courcelle and Kanté [7] who first proposed algebraic expressions with a so-called bilinear graph product as a better way of handling rank-decompositions, and to a parallel recent research of Bui-Xuan, Telle and Vatshelle.     

Noncommutative spectral decomposition with quasideterminant

We develop a noncommutative analogue of the spectral decomposition with the quasideterminant defined by I. Gelfand and V. Retakh. In this theory, by introducing a noncommutative Lagrange interpolating polynomial and combining a noncommutative Cayley-Hamilton's theorem and an identity given by a Vandermonde-like quasideterminant, we can systematically calculate a function of a matrix even if it has noncommutative entries. As examples, the noncommutative spectral decomposition and the exponential matrices of a quaternionic matrix and of a matrix with entries being harmonic oscillators are given.     

On farthest points of sets

For a convex closed bounded set in a Banach space, we study the existence and uniqueness problem for a point of this set that is the farthest point from a given point in space. In terms of the existence and uniqueness of the farthest point, as well as the Lipschitzian dependence of this point on a point in space, we obtain necessary and su.cient conditions for the strong convexity of a set in several infinite-dimensional spaces, in particular, in a Hilbert space. A set representable as the intersection of closed balls of a fixed radius is called a strongly convex set. We show that the condition “for each point in space that is sufficiently far from a set, there exists a unique farthest point of the set” is a criterion for the strong convexity of a set in a finite-dimensional normed space, where the norm ball is a strongly convex set and a generating set.     

A tabu search heuristic for the dynamic transportation of patients between care units

The problem studied in this paper stems from a real application to the transportation of patients in the Hospital Complex of Tours (France). The ambulance central station of the Hospital Complex has to plan the transportation demands between care units which require a vehicle. Some demands are known in advance and the others arise dynamically. Each demand requires a specific type of vehicle and a vehicle can transport only one person at a time. The demands can be subcontracted to a private company which implies high cost. Moreover, transportations are subject to particular constraints, among them priority of urgent demands, disinfection of a vehicle after the transportation of a patient with contagious disease and respect of the type of vehicle needed. These characteristics involve a distinction between the vehicles and the crews during the modeling phase. We propose a modeling for solving this difficult problem and a tabu search algorithm inspired by Gendreau et al. (1999). This method supports an adaptive memory and a tabu search procedure. Computational experiments on a real-life instance and on randomly generated instances show that the method can provide high-quality solutions for this dynamic problem with a short computation time.