两类带有确定潜伏期的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.     

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.     

弱空间式Locale

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

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

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

POINTED REPRESENTATIONS OFINFINITE DIMENSIONAL LIE ALGEBRAS

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

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

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

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.     

完备格中的成分理论

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

连续区间数的中位算子及其灵敏度分析

研究决策信息以区间数形式给出的方案决策问题。考虑到区间数非均匀分布的特点,为避免区间极端值在区间数确定中产生较大误差,本文将中位数概念运用到区间数的确定上,提出OIP(Ordered Interval Point)有序中位算子。取单位区间单调函数(BUM函数)为二分之一所表示的值为权重,将区间数确定为一个实数,并研究算子单调性和有界性的初等运算性质。通过比较OIP算子与COWA算子对态度参数和区间长度的反应灵敏度,获得了在一定条件下OIP算子对态度参数反应更稳健,对区间长度反应更灵敏的结论。最后用算例证明该算子的可行性和有效性。     

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.     

An analysis of a ‘Sunday Supplement’ problem

A problem posed in an influential textbook is analysed in more detail than is given there. The textbook answer to the problem has been represented as counterintuitive, as is probably the case; however, it is here shown that it depends critically on an assumption. If this is relaxed, then a wide variety of possible answers is available. All the same, if the special assumption made is replaced by one of a number of more realistic ones, then the order of magnitude of the approximation given by the author of the textbook is preserved.     

最小填充问题的可分解性

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

网络团购的定价与收益协调策略研究

如何实现团购网站和团购参与商家之间的双赢是我国网络团购目前面临的一大挑战性问题。结合我国网络团购的特点,构建团购网站和商家之间定价与收益分配的博弈模型,针对博弈结果运用纳什谈判模型给出协调策略。最后,通过数值算例分析主要参数的变化对价格与收益的影响。结果表明,敏感市场的规模和团购网站的广告效应越大、商品的单位成本越小、开展网络团购对商家和团购网站越有利。     

Constructing super D-Kaup-Newell hierarchy and its nonlinear integrable coupling with self-consistent sources

How to construct new super integrable equation hierarchy is an important problem. In this paper, a new Lax pair is proposed and the super D-Kaup-Newell hierarchy is generated, then a nonlinear integrable coupling of the super D-Kaup-Newell hierarchy is constructed. The super Hamiltonian structures of coupling equation hierarchy is derived with the aid of the super variational identity. Finally, the self-consistent sources of super integrable coupling hierarchy is established. It is indicated that this method is a straight- forward and efficient way to construct the super integrable equation hierarchy.     

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.     

Traveling waves in a nonlocal dispersal population model with age-structure

This paper is concerned with the traveling waves in a single species population model which is derived by considering the nonlocal dispersal and age-structure. If the birth function is monotone, then the existence of traveling wavefront is reduced to the existence of a pair of super and subsolutions without the requirement of smoothness. It is proved that the traveling wavefront is strictly increasing and unique up to a translation. The asymptotic behavior of traveling wavefronts is also obtained. If the birth function is not monotone, the existence of traveling wave solution is affirmed by introducing two auxiliary nonlocal dispersal equations with quasi-monotonicity.     

Inverse Eigenvalue Problem in Structural Dynamics Design

1 Introduction Structural dynamics design is to design a structure subject to the dynamic characteristics re- quirement, i.e., determine physical and geometrical parameters such that the structure has the given frequencies and (or) mode shapes. This problem often arises in engineering connected with vibration. Recently, Joseph [1], Li et al. [2,3] converted the structural dynamics design to the following inverse eigenvalue problem. GIEP Let x = (x1, , xm)T , and let A(x) and B(x) be real n…     

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.     

覆盖下近似算子的拓扑性质

在不限制U为有限论域的情况下,研究了覆盖下近似算子XL和CL的拓扑性质。证明了覆盖下近似算子XL是内部算子,而且由XL生成的拓扑TXL为包含由覆盖C本身作为子基生成的拓扑TC的最小Alexandrov拓扑。特别地,当U为有限论域时,TXL=TC.然而,覆盖下近似算子CL不是内部算子。当覆盖C为某拓扑的基时,CL是内部算子,且此时由CL生成的拓扑TCL与TC是同一个拓扑。若进一步要求U为有限论域,则TCL=TXL=TC,进而CL=XL.