完备格上的上拓扑和区间拓扑

对完备格 Ｌ;记ｖ（Ｌ）为 Ｌ上的上拓扑之闭集格本文证明了完备格 Ｌ为 Ｆ－分配格当且仅当映射ｓｕｐ：ｖ（Ｌ）→Ｌ为满完备格同态;若Ｌ为Ｆ－分配的Ｂｏｏｌｅ格,则Ｌ同构于某幂集格、对Ｔ１格 Ｌ,证明了下述各条件等价。（１） Ｌ同构于某幂集格;（２） Ｌ上的区间拓扑是 Ｈａｕｓｄｏｒｆｆ的;（３）是有限分离的;（４） Ｌ是连续的对马空间（Ｘ,Ｏ（Ｘ））,进一步证明了 Ｏ（Ｘ）上的区间拓扑不可能为 Ｈａｕｓｄｏｒｆｆ的,除非（Ｘ, Ｏ（Ｘ））是离散空间．     

L-预拓扑空间中的近似L-开集及相关的连通性和范畴性质

研究L-预拓扑空间中L-开集的一些近似形式(其中L是有逆合对应的C-格):θ-L-开集,δ-L-开集,α-L-开集以及β-L-开集。证明了(1)当L的最大元1是并既约元时L-预拓扑空间的连通性、θ-连通性、δ-连通性和α-连通性是等价的;(2)θLTop是LTopsθ、LTop以及LTopθ的反射满子范畴,δLTop是LTopsδ和LTopδ的反射满子范畴;(3)当格L为幂集格时αLTop是LTopsα和LTopα的余反射满子范畴;θLPTop是LPTopsθ、LPTop以及LPTopθ的反射满子范畴,δLPTop是LPTopsδ和LPTopδ的反射满子范畴。     

拓扑分子格的分离公理

在[1]中我们建立了拓扑分子格的理论,它既是古典的点集拓扑学的推广,又是晚近发展起来的Fuzzy拓扑学的推广,对于某些Fuzzy格L(如L是线性序集或L是分子格等),它也是L—Fuzzy拓扑学的推广。因此,凡在拓扑分子格中得到的结果自然都是上述各种拓扑学中相应定理的一般化形式。在本文中我们将讨论拓扑分子格的分离公理。 我们熟知点集拓扑学中的分离公理有多种不同的等价形式。以正则性为例,设X是拓扑空间,X叫正则的,当且仅当对每个点a∈X以及a的每个开邻域U,a有开邻域V满足条件V~-U。这一分离公理又可表述为:设a∈X,F是X中不包含a的闭集,则有开集P     

Z-拟连续domain上的Scott拓扑和Lawson拓扑

对一般子集系统Z,引入了Z-拟连续domain的概念,证明了Z-完备偏序集P是Z-拟连续的当且仅当P上的Z-Scott拓扑σ_z(P)在集包含序下是超连续格;Z-拟连续domain P上的Z-Scott拓扑σ_z(P)是Sober的当且仅当σ_z(P)具有Rudin性质,P赋予Z-Lawson拓扑λ_z(P)是pospace;且若P上的Z-Lawson开上集是Z-Scott开的,Z-Lawson开下集是下拓扑开的,则(P,λ_z(P))为严格完全正则序空间。     

线性空间中具有集到集映射的向量极值问题的Lagrange乘子定理

本文在没有任何拓扑结构的条件下，即在非常一般的线性空间中，首先利用Ｍｏｒｒｉｓ序列定义了集到集凸映射的概念，其次证明了集到集映射的Ｆａｒｋａｓ－Ｍｉｎｋｏｗｓｋｉ定理，然后讨论了具有集到集映射的向量极值问题的Ｌａｇｒａｎｇｅ乘子定理。     

关于Scott拓扑存在开滤子拓扑基的分配备格

本文利用引入的ＫＳ性质,刻划了那些其Ｓｃｏｔｔ拓扑可由开滤子生成的分配备格,该结果也是对［１］中一公开问题的一种解答．本文的刻划定理对于判定分配备格的Ｓｃｏｔｔ拓扑是否与Ｓｃｏｔｔ开滤子拓扑一致具有较强的可操作性,应用该刻划定理给出大量非连续格,其Ｓｃｏｔｔ拓扑具有开滤子基．     

Z-拟连续domain上的Scott拓扑和Lawson拓扑

对一般子集系统Z,引入了Z-拟连续domain的概念,证明了Z-完备偏序集P是Z-拟连续的当且仅当P上的Z-Scott拓扑σZ(P)在集包含序下是超连续格;Z-拟连续domain P上的Z-Scott拓扑σZ(P)是Sober的当且仅当σZ(P)具有Rudin性质,P贼予Z-Lawson拓扑λZ(P)是pospace,且若P上的Z-Lawson开上集是Z-Scott开的,Z-Lawson开下集是下拓扑开的,则(P,λZ(P))为严格完全正则序空间.     

完备格中的成分理论

在完备格中引入了元素的成分概念．基于此,引入了元素的宽度的概念．在分配格的情形证明了元素的成分集对有限并运算封闭且有某种遗传性．证明了元素的有限宽度的成分之集是定向集．称没有非平凡成分的元素为颗粒．称每个非零元素都可表示为其颗粒成分之并的完备格为颗粒表示格．证明了拓扑空间是局部连通的充要条件是其开集格为颗粒表示格．     

Domain函数空间上的Isbell拓扑和Scott拓扑的一致性

本文主要讨论了Domain函数空间上Isbell拓扑和Scott拓扑的一致性.利用Domain函数空间给出了一个例子: Scott拓扑有开滤子基的非连续的DCPO.     

开广义序同态的刻划及拓扑分子格的特征与权

王国俊先生于〔１〕中借助闭元成功地引入了开广义序同态的概念。本文给出了开广义序同态的一个刻划并对其是否增加拓扑分子格的权与特征等问题进行了研究，得到了积拓扑分子格的特征与权与因子拓扑分子格的特征与权间的关系，从而部分回答了ＬＦ拓扑中关于特征的两个公开问题。     

CONTINUOUS L-DOMAINS

61.IntroductionConiinuousDCPOisoneofthemostimportantstructuresin-domaintheory.Unfor-tunatelythecategoryofcolltinuousDCPOandtheScottcontinuousfunctionsfailstobeCartesianclosed,soitisaverysignificantproblemtofinditsmakimalCartesianclosedfullsubcategories.ThecategoryofL-domain'swasdiscoveredbyA.JungwhilesolvingtheproblemoffindingmtalmalCartesianclosedcategoriesofalgebraicDCPO's[1l,andrecentworksbyA.JungandG.Gund.r[2]showsthatthecategoryofL-domain'sisaninterestingcategoryOntheotherhand,i…     

平面凸集存在最小凸生成集的充要条件

本文在平面上解决了StevenRLay在 [1 ]中提出的开放性问题“什么样的凸集存在唯一的最小凸生成子集” ,给出并证明了“平面上的凸集存在唯一的最小凸生成子集”的一个充要条件 .同时证明了En 中的开集一定不存在最小凸生成集 .     

An answer to the Jun-Shim-Lele’s open problem on the fuzzy filters

In this note, a negative answer to the open problem of Jun, Shim and Lele on fuzzy filters of BCI-algebras is given, a necessary and sufficient condition, under which the open problem has a positive answer, is provided. Furthermore, we give two properties of fuzzy filters of BCI-algebras which generalize some results of Jun, Shim and Lele.     

Minor summation formula and a proof of Stanley’s open problem

In the open problem session of the FPSAC’03, R.P. Stanley gave an open problem about a certain sum of the Schur functions. The purpose of this paper is to give a proof of this open problem. The proof consists of three steps. At the first step we express the sum by a Pfaffian as an application of our minor summation formula (Ishikawa and Wakayama in Linear Multilinear Algebra 39:285–305, 1995). In the second step we prove a Pfaffian analogue of a Cauchy type identity which generalizes Sundquist’s Pfaffian identities (J. Algebr. Comb. 5:135–148, 1996). Then we give a proof of Stanley’s open problem in Sect. 4. At the end of this paper we present certain corollaries obtained from this identity involving the Big Schur functions and some polynomials arising from the Macdonald polynomials, which generalize Stanley’s open problem.      

鲁棒动态设施选址问题的近似算法

设施选址问题是组合优化中重要问题之一。动态设施选址问题是传统设施选址问题的推广,其中度量空间中设施的开设费用和顾客的需求均随着时间的变化而变化。更多地,经典设施选址问题假设所有的顾客都需要被服务。在这个模型假设下,所有的顾客都需要服务。但事实上,有时为服务距离较远的顾客,需要单独开设设施,导致了资源的浪费。因此,在模型设置中,可以允许一些固定数目的顾客不被服务 (带异常点的设施选址问题),此外也可以通过支付一些顾客的惩罚费用以达到不服务的目的 (带惩罚的设施选址问题)。本文将综合以上两种鲁棒设置考虑同时带有异常点和惩罚的动态设施选址问题,通过原始-对偶框架得到近似比为3的近似算法。     

Routing open shop and flow shop scheduling problems

We consider a generalization of the classical open shop and flow shop scheduling problems where the jobs are located at the vertices of an undirected graph and the machines, initially located at the same vertex, have to travel along the graph to process the jobs. The objective is to minimize the makespan. In the tour-version the makespan means the time by which each machine has processed all jobs and returned to the initial location. While in the path-version the makespan represents the maximum completion time of the jobs. We present improved approximation algorithms for various cases of the open shop problem on a general graph, and the tour-version of the two-machine flow shop problem on a tree. Also, we prove that both versions of the latter problem are NP-hard, which answers an open question posed in the literature.     

Dirichlet problem for the Stokes equations outside open curves on the plane

The Dirichlet problem for the Stokes equations outside open curves on the plane is studied. The existence and uniqueness of a solution is proved. An integral representation for the solution is obtained in the form of potentials whose densities are determined from a uniquely solvable system of Fredholm integral equations of the second kind. The singularities of derivatives of the velocities at the endpoints of the open curves are analyzed. A closed-form solution of the problem is constructed for the case in which the open curves are straight line segments.     

Solution of the Neumann problem for the Laplace equation

For fairly general open sets it is shown that we can express a solution of the Neumann problem for the Laplace equation in the form of a single layer potential of a signed measure which is given by a concrete series. If the open set is simply connected and bounded then the solution of the Dirichlet problem is the double layer potential with a density given by a similar series.     

An Ant Colony Optimization Algorithm for Shop Scheduling Problems

We deal with the application of ant colony optimization to group shop scheduling, which is a general shop scheduling problem that includes, among others, the open shop scheduling problem and the job shop scheduling problem as special cases. The contributions of this paper are twofold. First, we propose a neighborhood structure for this problem by extending the well-known neighborhood structure derived by Nowicki and Smutnicki for the job shop scheduling problem. Then, we develop an ant colony optimization approach, which uses a strong non-delay guidance for constructing solutions and which employs black-box local search procedures to improve the constructed solutions. We compare this algorithm to an adaptation of the tabu search by Nowicki and Smutnicki to group shop scheduling. Despite its general nature, our algorithm works particularly well when applied to open shop scheduling instances, where it improves the best known solutions for 15 of the 28 tested instances. Moreover, our algorithm is the first competitive ant colony optimization approach for job shop scheduling instances.