分子格上伪补的构造

本文给出了分子格上伪补的构造定理，并证明了当一个非平凡分子格上有伪补，其既约因子上并不一定存在伪补，但其准既约因子上一定存在伪补，且任一分子格上的伪补都可表为其准既约因子上伪补的直积．     

半群的(∈,∈∨q(λ,μ))-模糊n伪理想与Drazin半群的刻画

给出半群的模糊n伪理想,广义模糊n伪理想,(∈,∈∨q(λ,μ))-模糊n伪理想的定义,同时讨论了(∈,∈∨q(λ,μ))-模糊n伪左理想(右理想,理想)和广义模糊n伪左理想(右理想,理想)的等价刻画.还利用半群的广义模糊子系统来刻画Drazin半群的结构.     

伪补MS-代数的同余关系

本文研究了伪补MS-代数的同余关系.利用正则滤子和伪补代数的对偶窄间理论,得到了正则滤子所生成的同余关系的性质以及同余可换的伪补MS-代数类,从而推广了文献[9]的结果.     

伪补MS-代数的滤子同余关系

在伪补MS-代数上引入余核滤子和完全滤子的概念,研究伪补MS-代数的余核滤子和完全滤子的性质,获得了余核滤子和完全滤子生成的同余关系的表达式,证明了具有余核滤子的最小同余关系有同余一致性.     

由KM-模糊伪度量诱导的模糊化粗糙集及其性质

本文首先介绍了由KM-模糊伪度量诱导的模糊等价关系。基于此模糊等价关系，然后，得到了由KM-模糊伪度量诱导的模糊化粗糙集，并研究了其性质。最后，详细探究了KM-模糊伪度量及其诱导的模糊化粗糙集之间的关系，丰富和完善了模糊粗糙集理论的研究内容。     

新序结构下函数列的伪依集值模糊测度收敛

在m维正欧氏空间中引入一种新序结构,并由此序结构在集值模糊测度空间上给出可测函数序列伪依集值模糊测度收敛、(伪)依集值模糊测度几乎处处收敛、PS性和PS'性等概念,进而研究了伪依模糊测度收敛和(伪)几乎处处收敛之间的关系,获得相应的Lebesgue定理和Riesz定理.     

代数结构上的模糊拟伪$b$-度量

研究代数结构上的模糊(拟)伪$b$-度量. 主要结论有: (1)设$G$是一个抽象群, $\tau$是$G$上一个左不变模糊拟伪$b$-度量(伪$b$-度量)诱导的拓扑,如果$(G,\tau)$是右拓扑群,那么$(G,\tau)$是一个仿拓扑群(拓扑群); (2)设$S$是一个半群,如果$\tau$是$S$上一个不变模糊拟伪$b$-度量诱导的拓扑,那么$(S,\tau)$是一个拓扑半群.     

K-拟可加模糊数值积分的伪自连续及结构特征

在K-拟可加模糊测度空间上,针对给出的K-拟可加模糊数值积分,将这种积分整体看成可测空间上取值于模糊数值的集函数,进而研究这种K-拟可加模糊积分的伪上(下)自连续、伪一致上(下)自连续和伪双零渐近可加性等结构特征.     

Ω-模糊可补子半环

给定一个集合Ω,引入了可补半环的Ω-模糊可补子半环的概念,研究了它的一些基本性质。给出了可补半环的Ω-模糊可补子半环的等价刻画,证明了可补半环的Ω-模糊可补子半环的交、同态像与同态原像等也是可补半环的Ω-模糊可补子半环。最后,通过在SΩ上定义运算+,×,-,得到可补半环(SΩ,+,×,-),并研究了与其相关的模糊可补子半环与Ω-模糊可补子半环。     

广义模糊数值Choquet积分的伪自连续及其遗传性

在广义模糊测度空间上,针对已经给出的广义模糊数值Choquet积分,将这种积分整体看成可测空间上取值于模糊数的集函数,研究当模糊测度满足伪自连续、伪一致自连续性时,这种模糊数值Choquet积分所保持的一些遗传性．     

Pure partial planes of order 6 with 25 lines

We construct two pure partial planes of order 6 with 25 lines, which extend the dual of the linear space PG(3,2). One of these is of particular interest since its dual is a pseudo-complement of a triangle in a projective plane of order 6.      

The principal kernels of semifields of continuous positive functions

This work is devoted to the study of kernel lattices of semifields of continuous positive functions defined on some topological space. It is established that they are lattices with a pseudo-complement. New characterizations of the following properties of topological spaces are obtained in terms of kernels, predominantly principal kernels, and semifields of continuous functions: to be an F-space, to be a P-space, basic and extremal disconnectedness, pseudo-compactness, and finiteness.     

On the Lattice of Antichains of Finite Intervals

Motivated by applications to information retrieval, we study the lattice of antichains of finite intervals of a locally finite, totally ordered set. Intervals are ordered by reverse inclusion; the order between antichains is induced by the lower set they generate. We discuss in general properties of such antichain completions; in particular, their connection with Alexandrov completions. We prove the existence of a unique, irredundant ∧-representation by ∧-irreducible elements, which makes it possible to write the relative pseudo-complement in closed form. We also discuss in detail properties of additional interesting operators used in information retrieval. Finally, we give a formula for the rank of an element and for the height of the lattice.     

Weak relative pseudo-complements of closure operators

We define the notion of weak relative pseudo-complement on meet semi-lattices, and we show that it is strictly weaker than relative pseudo-complementation, but stronger than pseudo-complementation. Our main result is that if a complete lattice is meet-continuous, then every closure operator on admits weak relative pseudo-complements with respect to continuous closure operators on .Presented by E. T. Schmidt.     

基于规模的企业竞争力蜘蛛图法评价研究

科学合理的规模结构不仅是实现规模经济的基本条件,而且是提高经济效益、降低交易成本、获得较高的企业竞争力的重要保证.基于规模理论,从生产规模、资本规模、市场规模以及效益规模四大因素入手,提出了一套基于规模的企业竞争力评价指标体系,运用蜘蛛图法建立了基于规模的企业竞争力评价模型,并结合具体的数据分析说明了企业竞争力的大小强弱.此种方法具有直观形象、定量化、可操作性强的特点.     

Borel measures in consonant spaces

A topology on a set X is called consonant if the Scott topology of the lattice is compactly generated; equivalently, if the upper Kuratowski topology and the co-compact topology on closed sets of X coincide. It is proved that every completely regular consonant space is a Prohorov space, and that every first countable regular consonant space is hereditarily Baire. If X is metrizable separable and co-analytic, then X is consonant if and only if X is Polish. Finally, we prove that every pseudocompact topological group which is consonant is compact. Several problems of Dolecki, Greco and Lechicki, of Nogura and Shakmatov, are solved.     

Milnor方图中的w-凝聚性

整环R称为ω-凝聚整环,是指R的每个有限型理想是有限表现型的.本文证明了ω-凝聚整环是v-凝聚整环,且若(RDTF,M)是Milnor方图,则在Ⅰ型情形,R是ω-凝聚整环当且仅当D和T都是ω-整环,且T_M是赋值环;对于Ⅱ-型情形,R是ω-凝聚整环当且仅当D是域,[F:D]<∞,M是R的有限型理想,T是ω-凝聚整环,且R_M是凝聚整环.     

不确定条件下双目标组批生产的交货期设置研究

交货期是调度方法的函数,因而具有不确定性.研究变批量、变批次、变生产能力下,单阶段、双目标有条件相容组批的交货期设置问题,将它转化为订单投放策略和调度模式研究.建立了一个基于目标的双目标订单投放策略数学模型.采用目标序列优先方法进行双目标求解,用两种调度模式求出区间值,进行最优交货期逼近.模式1:松弛掉产品加工约束条件,基于负荷考虑、给出离散生产模式下订单完工率最大的订单排序算法,算法综合考虑了任务紧急程度、可调度性、重要度和流程时间最短四个方面,得到区间的一个端点.模式2是有条件相容的启发式组批调度算法,即通过聚类计算将订单安排问题转化为多队列调度问题,将新来订单的投放转化为某个队列的插单和批量分割问题,不同队列中批的投产顺序由批中优先级最高的订单决定,并在能力约束下进行批量分割计算,得到区间的另一个端点,结合流程可靠性求出区间.实例证明,模式2的交货期设置小,订单完工率和生产率高.     

Banach空间有界线性算子强连续双半群

本文在Ｂａｎａｃｈ空间上研究单参数有界线性算子族－强连续双半群。     

A modified (S − 1, S) inventory system for deteriorating items with Poisson demand and non-zero lead time

An inventory system is considered for continuous decaying items with non-zero lead time and stochastic demand when shortages are allowed and all unsatisfied demands are backlogged. In this research we consider orders as separate packages where replenishment is one-for-one and a modified base stock policy is applied. In this paper, a penalty cost is introduced for stochastic inventory models with decaying items when less than one unit of the product is delivered to the customers. The objective of the warehouse is to maximize his average profit. Since the concavity analysis of the model is extremely complicated, an upper bound is introduced and an algorithm is presented for finding the optimal solution. Finally, a numerical example is presented and sensitivity analysis is carried out for a number of important parameters.