A-调和方程弱解的新的加权积分不等式

研究形如div A(x,u(x))=0的A-调和方程,证明其弱解满足局部Arλ3(λ1,λ2,Ω)-权Caccioppoli型不等式,这可看作A-调和方程相应结果的推广.最后给出上述结果在拟正则映射中的应用.     

(p,λ)-Koszul模和有线性表示的模(英文)

在本文中,主要讨论了(p,λ)-Koszul模范畴(K_λ~P(A))和线性表示模范畴(L(A))两者之间的关系.特别地,我们得到了K_λ~P(A)=L(A)的一些充分必要条件.     

半群中的(λ,μ)-模糊理想(英文)

在半群中给出了(λ,μ)-模糊子半群和各种(λ,μ)-模糊理想的概念,讨讹了它们的一些性质,并给出了各种(λ,μ)-模糊理想的充分必要条件.     

(λ,μ)Vague群

进一步研究Vague群。首先,给出Vague集和Vague群的几个性质;其次,引入(λ,μ)Vague群、(λ,μ)Vague正规群、(λ,μ)Vague正规化子、(λ,μ)Vague中心化子的概念,研究了它们的一些等价条件和在同态条件下像与原像的性质。     

(λ,μ)-模糊子环和理想的进一步讨论

在(λ,μ)-模糊子群的基础上,进一步刻画了(λ,μ)-模糊子环和理想.详细讨论了(λ,μ)-模糊子环和理想的性质,以及它们与截集的关系,给出了相应结论.     

(λ,μ)-商模糊子群及其同构定理

在(λ,μ)-模糊子群与(λ,μ)-模糊正规子群概念的基础上,讨论了(λ,μ)-模糊商群和(λ,μ)-商模糊子群的性质,并且建立了(λ,μ)-商模糊子群的同构定理。     

子流形平均曲率向量场的线性相关性

在空间形式中,均造了子流形的一类泛函,其包含r极小泛函与体积泛函(极小)作为特殊情形,此类泛函的临界点称之为(r+1,λ)-平行子流形.对于(r+1,λ)-平行子流形,给出了代数,微分和变分刻画.更进一步,研究了(r+1,λ)-平行子流形的稳定性,证明了Simons型不存在定理:在一定条件下((r,λ)-函数S_(r,λ)为正),球面中不存在稳定的(r+1,λ)-平行子流形.     

半群中的(λ,μ)-模糊素理想与(λ,μ)-模糊准素理想

利用(λ,μ)-截集,在一个半群中引入了(λ,μ)-模糊素理想、模糊半素理想、模糊准素理想与模糊半准素理想的概念,研究了他们的运算性质,并得到了他们的一些等价条件。     

竖梯的局部替换图的L(d,1,1)-标号

图的L(d,1,1)-标号定义为顶点集V(G)到非负整数集的映射f,且当d(u,v)=1时,均有|f(u)-f(v)|≥d,当d(u,v)=2,3时,均有|f(u)-f(v)|≥1.不妨设0为最小标号,则称图G的所有L(d,1,1)-标号中的最大跨度max{f(v):v∈V(G)}的最小数为图的L(d,1,1)-标号数,记为λ_d(G).基本给出了竖梯的局部替换图的L(d,1,1)-标号数的确切值或界.     

三角代数上的零点(m,n)-弱可导映射

设m和n是任意固定的非零整数且m+n≠0,u是一个|mn(m+n)|-无挠的三角代数,δ是u上的一个线性映射.本文证明了:如果对任意的x,y∈u且xy=yx=0有mδ(xy)+nδ(yx)=mδ(x)y+mxδ(y)+nδ(y)x+nyδ(x),则在u上存在一个导子Φ和一个中心元λ使得对任意的x∈u,有δ(x)=Φ(x)+λx.     

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

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

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

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

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.     

关于拟平坦模的几个注记

本文所有的环均指有单位元的环,模均指酉模。左R-模M称为拟内射的,如果对任意N相似文献   

On property of injectivity for real W*-algebras and JW-algebras

In this paper injective real W*-algebras are investigated. It is shown that injectivity is equivalent to the property of E (extension property). It is proven that a real W*-algebra is injective iff its hermitian part is injective, and it is equivalent to, that the enveloping W*-algebra is also injective. Moreover, it is shown that if the second dual space of a real C*-algebra is injective, then the real C*-algebra is nuclear.     

Milnor方图中的w-凝聚性

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

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.     

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.     

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

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