L-拓扑空间的半S_β-紧性

在L-拓扑空间中引入半Sβ-紧性,这种紧性是针对任意L-模糊子集定义的,它是Sβ-紧性的推广。研究半Sβ-紧性的性质,如一个半Sβ-紧集与一个半闭集的交仍为半Sβ-紧的;半Sβ-紧性在不定映射下保持不变;由分明拓扑空间(X,τ)拓扑生成的L-拓扑空间(LX,ωL(τ))是半Sβ-紧的当且仅当(X,τ)是半紧的。此外,还给出了半Sβ-紧性的网式刻画。     

L-拓扑空间的半N_β-紧性

在L-拓扑空间中利用半开βa-覆盖引入了半Nβ-紧性。讨论了半Nβ-紧性的性质,如一个半Nβ-紧集与一个半闭集的交仍为半Nβ-紧的;半Nβ-紧性在不定映射下保持不变;由分明拓扑空间(X,τ)拓扑生成的L-拓扑空间(LX,ωL(τ))是半Nβ-紧的当且仅当(X,τ)是半紧的。此外,还讨论半Nβ-紧性与半紧性的关系。     

L-拓扑空间中的半拟紧性

在L-拓扑空间中借助于半拟开L-集合和它们的不等式给出了半拟紧性的一个新定义,这里L是完备的DeMorgan代数。它也能够借助于半拟闭L-集和它们的不等式刻画。当L是完全分配的DeMorgan代数时,它的许多刻画被给出了。     

L-拓扑空间的单点超F紧化

给出L-拓扑空间的单点超F紧化的一种具体作法,以及局部超F紧性的定义,并证明了:(1)局部超F紧性是L-好推广;(2)一个L-拓扑空间是局部超F紧T2空间当且仅当其单点超F紧化空间是超F紧T2空间;(3)单点超F紧化在同胚意义下是唯一的。     

L-拓扑空间的弱局部强F紧性及单点强F紧化

以R.Lowen的强F紧性为基础,定义了L-拓扑空间的弱局部强F紧性及单点强F紧化,推广了有关弱局部紧拓扑空间和拓扑空间的单点紧化的若干结果,证明了L-拓扑空间的弱局部强F紧性是拓扑空间的弱局部紧性的L-推广。     

L-拓扑空间的局部Fuzzy紧性

定义了L-拓扑空间的局部Fuzzy紧性, 证明了这种局部Fuzzy紧性是L-好的推广, 是闭可遗传的, 在连续的、开的、满的L值Zadeh型函数下保持不变.     

向量优化中有效点的存在性

分别在有pre-order的无线性结构的集合和拓扑空间中，给出了有效点的存在性。作为应用，讨论了向量优化问题中解的存在性。最后给出了紧、弱紧、锥紧、锥半紧、上序紧、下序紧、上序半紧、准上序半紧和准下序半紧等之间的关系。     

L-拓扑空间中一类新的SR-紧性

利用强半开L-集和它们的不等式在L-拓扑空间引入了一种新的SR-紧性,这里L是完备的DeMorgan代数。这种新的SR-紧性不依赖于格L的具体结构。当L是完全分配的DeMorgan代数时,给出了它的许多刻画。     

L-拓扑空间的局部β-紧性

定义了L-拓扑空间的局部β-紧性,证明了这种局部β-紧性是L-好的推广,是β-闭遗传的,在Mβ-连续的、开的、满的L值Zadeh型函数下保持不变.     

L-拓扑空间的局部Nβ-紧性

本文在文献[4]的基础上,研究了L-拓扑空间的局部Nβ-紧性.借助于完全Nβ-紧集和强邻域,定义了L-拓扑空间的局部Nβ-紧性,证明了它是闭可遗传的、有限可乘的、且在连续开满的L值Zadeh型函数下保持不变,说明了它是一种L-好的推广性质.     

Asplund空间中方向上导数和序列法紧性质分析法则

研究了广义微分结构中的集合方向Mordukhovich法锥、集值映射的方向上导数,以及集合和集值映射的方向序列法紧性的分析法则. 基于集合方向Mordukhovich法锥的交集法则,在方向内半紧性假设下,建立了集合的方向Mordukhovich法锥、集值映射的方向上导数的分析法则.此外,借助Asplund乘积空间中集合的方向序列法紧性的交集法则, 在方向内半紧性和相应的规范条件下,建立了集合和集值映射的(部分)方向序列法紧性的加法、逆像、复合等法则.     

New Order Relations in Set Optimization

In this paper we study a set optimization problem (SOP), i.e. we minimize a set-valued objective map F, which takes values on a real linear space Y equipped with a pre-order induced by a convex cone K. We introduce new order relations on the power set P(Y)\mathcal{P}(Y) of Y (or on a subset of it), which are more suitable from a practical point of view than the often used minimizers in set optimization. Next, we propose a simple two-steps unifying approach to studying (SOP) w.r.t. various order relations. Firstly, we extend in a unified scheme some basic concepts of vector optimization, which are defined on the space Y up to an arbitrary nonempty pre-ordered set (Q,\preccurlyeq)(\mathcal{Q},\preccurlyeq) without any topological or linear structure. Namely, we define the following concepts w.r.t. the pre-order \preccurlyeq\preccurlyeq: minimal elements, semicompactness, completeness, domination property of a subset of Q\mathcal{Q}, and semicontinuity of a set-valued map with values in Q\mathcal{Q} in a topological setting. Secondly, we establish existence results for optimal solutions of (SOP), when F takes values on (Q,\preccurlyeq)(\mathcal{Q},\preccurlyeq) from which one can easily derive similar results for the case, when F takes values on P(Y)\mathcal{P}(Y) equipped with various order relations.     

Local elimination algorithms for solving sparse discrete problems

The class of local elimination algorithms is considered that make it possible to obtain global information about solutions of a problem using local information. The general structure of local elimination algorithms is described that use neighborhoods of elements and the structural graph describing the problem structure; an elimination algorithm is also described. This class of algorithms includes local decomposition algorithms for discrete optimization problems, nonserial dynamic programming algorithms, bucket elimination algorithms, and tree decomposition algorithms. It is shown that local elimination algorithms can be used for solving optimization problems.     

布朗运动和次分数布朗运动混合的局部时

本文研究了布朗运动和次分数布朗运动混合的局部时问题.利用白噪声分析方法和次分数布朗运动的另一种表示形式,证明了该局部时是一个Hida广义泛函.进一步,借助于S-变换给出了该局部时的混沌表示.最后获得了该局部时的正则性条件.推广了布朗运动局部时的一些结果.     

地方总教育投资分配的博弈分析

本文采用博弈论研究地方总教育投资分配的模型 ,该模型包含两个地方政府和一个中央政府 ,并分别为地方政府提供决策 .首先 ,描述了基本模型 ,分别给出了地方政府的效用函数 ;接着分析了地方政府同时行动时的总教育投资分配 ,然后分析了地方政府顺序行动时的总教育投资分配 ;最后给出了最优解的算法并举例说明地方政府怎样去做决策     

Entropy in the category of perfect complexes with cohomology of finite length

Local and category-theoretical entropies associated with an endomorphism of finite length (i.e., with zero-dimensional closed fiber) of a commutative Noetherian local ring are compared. Local entropy is shown to be less than or equal to category-theoretical entropy. The two entropies are shown to be equal when the ring is regular, and also for the Frobenius endomorphism of a complete local ring of positive characteristic.Furthermore, given a flat morphism of Cohen–Macaulay local rings endowed with compatible endomorphisms of finite length, it is shown that local entropy is “additive”. Finally, over a ring that is a homomorphic image of a regular local ring, a formula for local entropy in terms of an asymptotic partial Euler characteristic is given.     

Relative local control and the block source algebras

The local control of pointed groups is generalized to the concept of relative local control, and it is proved that there exists a lifting for a covering of a block source algebra if the relative local control holds. As an application, a result is proved on the source algebras of blocks, whose defect groups are direct products of a normal subgroup and a subgroup that gives a relative local control. Project supported by the National Natural Science Foundation of China.     

可换环上上三角矩阵代数的局部若当导子和局部若当自同构

Let R be a commutative ring with identity, Tn （R） the R-algebra of all upper triangular n by n matrices over R. In this paper, it is proved that every local Jordan derivation of Tn （R） is an inner derivation and that every local Jordan automorphism of Tn（R） is a Jordan automorphism. As applications, we show that local derivations and local automorphisms of Tn （R） are inner.     

A Constraint Programming Framework for Local Search Methods

We propose in this paper a novel integration of local search algorithms within a constraint programming framework for combinatorial optimization problems, in an attempt to gain both the efficiency of local search methods and the flexibility of constraint programming while maintaining a clear separation between the constraints of the problem and the actual search procedure. Each neighborhood exploration is performed by branch-and-bound search, whose potential pruning capabilities open the door to more elaborate local moves, which could lead to even better approximate results. Two illustrations of this framework are provided, including computational results for the traveling salesman problem with time windows. These results indicate that it is one order of magnitude faster than the customary constraint programming approach to local search and that it is competitive with a specialized local search algorithm.