两类带有确定潜伏期的SEIS传染病模型的分析

通过研究两类带有确定潜伏期的SEIS传染病模型,发现对种群的常数输入和指数输入会使疾病的传播过程产生本质的差异．对于带有常数输入的情形,找到了地方病平衡点存在及局部渐近稳定的阈值,证明了地方病平衡点存在时一定局部渐近稳定,并且疾病一致持续存在．对于带有指数输入的情形,发现地方病平衡点当潜伏期充分小时是局部渐近稳定的,当潜伏期充分大时是不稳定的．     

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

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

Detection of multivariate outliers with location slippage or scale inflation in left orthogonally invariant or elliptically contoured distributions

This paper is concerned with two kinds of multiple outlier problems in multivariate regression. One is a multiple location-slippage problem and the other is a multiple scale-inflation problem. A multi-decision rule is proposed. Its optimality is shown for the first problem in a class of left orthogonally invariant distributions and is also shown for the second problem in a class of elliptically contoured distributions. Thus the decision rule is robust against departures from normality. Further the null robustness of the decision statistic which the rule is based on is pointed out in each problem.     

POINTED REPRESENTATIONS OFINFINITE DIMENSIONAL LIE ALGEBRAS

ＰＯＩＮＴＥＤＲＥＰＲＥＳＥＮＴＡＴＩＯＮＳＯＦＩＮＦＩＮＩＴＥＤＩＭＥＮＳＩＯＮＡＬＬＩＥＡＬＧＥＢＲＡＳ￥ＸＵＸＩＡＮＧＡｂｓｔｒａｃｔ：ＡｃｏｎｔｒａｖａｒｉｅｄｂｉｌｉｎｅａｒｐａｉｒｉｎｇＸｏｎｅｖｅｒｙＭ（ρ）×Ｍ（ρθ）ｉｓｄｅｔｅｒｍ...     

Strongly Regular Rings and SF-rings

in this paper, new characteristic properties of strongly regular rings are' given.Relations between certain generalizations of duo rings are also considered. The followingconditions are shown to be equivalent: (1) R is a strongly regular ring; (2) R is a left SFring such that every product of two independent closed left ideals of R is zero; (3) R is aright SF-ring such that every product of two independent closed left ideals of R is zero; (4)R is a left SF-ring whose every special left annihilator is a quasi-ideal; (5) R is a right SFring whose every special left annihilator is a quasi-ideal; (6) R is a left SF-ring whose everymaximal left ideal is a quasi-ideal; (7) R is a right SF-ring whose every maximal left ideal isa quasi-ideal; (8) R is a left SF-ring such that the set N(R) of all nilpotent elements of R isa quasi-ideal; (9) R is a right SF-ring such that N(R) is a quasi-ideal.     

Chaotic synchronization with filter based on wavelet transformation

A kind of chaotic synchronization method is presented in the paper. In the transmitter, part signals are transformed by wavelet and the detail information is removed. In the receiver, the component with low frequency is reconstructed and discrete feedback is used, we show that synchronization of two identical structure chaotic systems is attained. The effect of feedback on chaotic synchronization is discussed. Using the synchronous method, the transmitting signal is transported in compressible way, system resource is saved, the component with high frequency is filtered and the effect of disturbance on synchronization is reduced. The synchronization method is illustrated by numerical simulation experiment.     

Logic optimality for multi-objective optimization

Pareto dominance is one of the most basic concepts in multi-objective optimization. However, it is inefficient when the number of objectives is large because in this case it leads to an unmanageable number of Pareto solutions. In order to solve this problem, a new concept of logic dominance is defined by considering the number of improved objectives and the quantity of improvement simultaneously, where probabilistic logic is applied to measure the quantity of improvement. Based on logic dominance, the corresponding logic nondominated solution is defined as a feasible solution which is not dominated by other ones based on this new relationship, and it is proved that each logic nondominated solution is also a Pareto solution. Essentially, logic dominance is an extension of Pareto dominance. Since there are already several extensions for Pareto dominance, some comparisons are given in terms of numerical examples, which indicates that logic dominance is more efficient. As an application of logic dominance, a house choice problem with five objectives is considered.     

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

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

弱空间式Locale

空间式locale范畴SLoc是locale范畴Loc的余反射满子范畴,但对locale乘积不封闭．本文引入弱空间式locale,证明弱空间式locale范畴WSloc为范畴Loc的余反射满子范畴,且对locale秉积封闭．还证明了一个locale A是空间式的当且仅当它的枝映射localeN(A)是弱空间式的;一个空问式locale的每一个子locale都是空间式的当且仅当它的每一个子locale是弱空间式的．最后,证明了弱空间式性在定向函子下保持不变．     

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.     

极大子因子

若N是一个Ⅱ1型因子,G是一个有限群且在N上有一个真外作用α,则当G的阶是素数对,N是Ⅱ1型因子M=N(?)αG的极大子因子．另一方面,假设 N(?) M是Ⅱ1型因子的一个包含,M(?)M1是N(?)M的基本构造,[M:N]= p∈N是素数,N’∩ M=CI,N’∩M1是交换的,N,(?)M深度为2,则N是M的极大子因子．     

Milnor方图中的w-凝聚性

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

完备格中的成分理论

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

On the unimodality of independence polynomials of very well-covered graphs

The independence polynomial $i(G,x)$ of a graph $G$ is the generating function of the numbers of independent sets of each size. A graph of order $n$ is very well-covered if every maximal independent set has size $n∕2$. Levit and Mandrescu conjectured that the independence polynomial of every very well-covered graph is unimodal (that is, the sequence of coefficients is nondecreasing, then nonincreasing). In this article we show that every graph is embeddable as an induced subgraph of a very well-covered graph whose independence polynomial is unimodal, by considering the location of the roots of such polynomials.     

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

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

基于自助法和核密度估计的膳食暴露评估模型

针对现阶段我国食品卫生安全保障体系的不完善,建立了基于自助法和核密度估计的膳食暴露评估模型.首先给出一种食物摄入量的抽样调查方案,并按污染物含量对特征人群进行模糊区间分类,建立特征人群每人每天食物摄入量的截尾正态分布模型.然后通过自助法重复抽样,弥补偶然抽查数据数量上的不足,提出了用对数正态分布核密度来估计污染物分布,并对模型进行了检验.在此基础上,建立了污染物摄入量模型,利用Gauss-Legendre求积公式求出其99.999%的右分位点,并且采用模糊匹配技术解决了数据不配套问题.最后对模型进行了讨论,给出了一种思路.     

最小填充问题的可分解性

起源于稀疏矩阵计算和其它应用领域的图G的最小填充问题是在图G中寻求一个内含边数最小的边集F使得G F是弦图.这里最小值|F|称为图G的填充数,表示为f(G).作为NP-困难问题,该问题的降维性质已被研究,其中包括它的可分解性.基本的可分解定理是:如果图G的一个点割集S是一个团,则G经由S是可分解的.作为推广,如果S是一个"近似"团(即只有极少数边丢失的团),则G经由S是可分解的.本文首先给出基本分解定理的另外一个推广:如果S是G的一个极小点割集且G-S含有至少|S|个分支,则G经由S是可分解的;其次,给出了这个新推广定理的一些应用.     

Strong conjugation actions induced by flags of exact Borel subalgebras

Let A be a quasi-hereditary algebra with a strong exact Borel subalgebra. It is proved that for any standard semisimple subalgebra T there exists an exact Borel subalgebra B of A such that T is a maximal semisimple subalgebra of B. It is shown that the maximal length of flags of exact Borel subalgebras of A is the difference of the radium and the rank of Grothendic group of A plus 2. The number of conjugation-classes of exact Borel subalgebras is 1 if and only if A is basic; the number is 2 if and only if A is semisimple. For all other cases, this number is 0 or no less than 3. Furthermore, it is shown that all the exact Borel subalgebras are idempotent-conjugate to each other, that is, for any exact Borel subalgebras B and C of A, there exists an idempotent e of A, and an invertible element u of A, such that eBe = u^-1eCeu.     

Polynomial-time algorithms for regular set-covering and threshold synthesis

A set-covering problem is called regular if a cover always remains a cover when any column in it is replaced by an earlier column. From the input of the problem - the coefficient matrix of the set-covering inequalities - it is possible to check in polynomial time whether the problem is regular or can be made regular by permuting the columns. If it is, then all the minimal covers are generated in polynomial time, and one of them is an optimal solution. The algorithm also yields an explicit bound for the number of minimal covers. These results can be used to check in polynomial time whether a given set-covering problem is equivalent to some knapsack problem without additional variables, or equivalently to recognize positive threshold functions in polynomial time. However, the problem of recognizing when an arbitrary Boolean function is threshold is NP-complete. It is also shown that the list of maximal non-covers is essentially the most compact input possible, even if it is known in advance that the problem is regular.     

On amenability of two-generator groups

A discrete group G is amenable if there exists a finitely additive probability measure on G which is invariant under left translations and is defined on all subsets of G. It is proved that if the group is generated by two elements and is amenable then there are words being relators whose most of the consecutive pairs of the letters belong to a certain four-element set of pairs. This fact is applied to reproving non-amenability of a braid group. The same group provides an example showing that such type of condition is not su?cient for amenabilty.