P-可测函数的构造性质

可测函数的构造性质是定义它关于测度μ的积分的理论基础.为了在P-测度空间上定义P-积分,借鉴可测函数的构造性质,引入了P-示性函数、P-简单函数、P-初等函数以及P-可测函数的概念,在此基础上系统地研究了P-实可测函数、有界P-实可测函数和非负P-可测函数与P-简单函数序列及P-初等函数序列的收敛关系;找出了P-实可测的充分必要条件;证明了实P-可测函数正部和负部都是非负P-实可测函数,最终得出任何P-实可测函数均可以表示为二非负P-可测函数之差,为定义P-积分提供了理论依据.     

P-可测空间及其可测函数

经典集合理论认为集合就是具有一定属性的对象所构成的整体,当一个普通集合的属性发生改变时,由此生成的新的集合称为P-集合.在测度空间上研究P-集合时所生成的新的空间称为P-测度空间.由于任何测度空间均可转化为概率空间,首先利用随机数的产生研究了随机P-集合的产生.然后借助P-可测空间提出了内P-可测映射、内P-可测函数和外P-可测映射、外P-可测函数及P-可测,给出了其有关性质.     

KMP算法的一种新的简化算法

通过对字符串模式匹配算法BF与KMP的分析,提出了一种简化KMP算法的方法,构造了一种新的计算next函数的方法,简化后的算法比KMP更清晰直观.经过复杂性分析和上机实验,得出当模式串的长度不大时,简化算法是一种高效的模式匹配算法.     

基于代数等价路径的一致P-函数非线性互补问题的可行内点算法

对一致P-函数非线性互补问题，提出了一种新的基于代数等价路径的可行内点算法，并讨论了计算复杂性．该算法可以在任一内部可行点启动，并且全局收敛；当初始点靠近中心路径时，此算法便成为中心路径跟踪算法，特别对于单调线性互补问题，总迭代次数为O（√nL），其中L是问题的输入长度。     

内P-显性信息规律显性-隐性特征与显性信息规律发现

函数P-集合(function packet sets)是把函数概念引入到P-集合内(packet sets),改进P-集合得到的,函数P-集合具有动态特性,规律(函数)特性。函数P-集合是由函数内P-集合SF(function internal packet set SF)与函数外P-集合SF(function outer packet set SF)构成的函数集合对;或者,(SF,SF)是函数P-集合.利用函数内P-集合与生物遗传学中的"显性","隐性"概念交叉,渗透,给出内P-显性信息规律的显性-隐性特征,给出内P-显性信息规律的显性-隐性定理,给出内P-显性信息规律发现准则;利用这些结果,给出内P-显性信息规律发现的应用.     

基于M-模糊化P-闭集族刻画M-模糊化拟阵

在已有M-模糊化拟阵的研究基础上,引入了M-模糊化秩函数及M-模糊化P-闭包算子的定义,研究了M-模糊化P-闭包算子的性质,并定义了M-模糊化P-闭集族及研究了它的基本性质,同时借助于M-模糊化拟阵的层拟阵结构,得到M-模糊化拟阵可由M-模糊化P-闭集族等价刻画这一结论.     

求解高维复合体函数的智能优化算法

由于粒子群算法在处理高维复杂函数时存在容易陷入局部最优的问题,提出了多种群子空间学习粒子群算法(SLPSO),采用多种群进化模式,在粒子更新公式中加入了全局最优粒子,加快了粒子收敛速度,同时在种群之间采用了交叉学习的方法,大大提高了算法的全局搜索能力.另外,还增加了一种子空间学习方法,充分地利用粒子的历史经验,有效地避免了陷入局部最优的问题.通过在高维基准测试函数的仿真实验表明,SLPSO算法的测试结果都明显优于其他两种算法,随着函数维数增加,SLPSO算法测试结果的下降幅度明显低于其他两种算法.在6个极其复杂的复合函数的测试中,SLPSO算法有2个测试函数结果非常接近理论值,其他4个也明显优于其他三种算法.     

函数内P-集合的副集及其区间生成规律

基于函数P-集合(S~F,S~F)的动态性、规律性,提出函数内P-集合的副集,给出函数内P-集合副集的区间生成结构、区间生成规律,给出内P-规律ω~F的区间拆分规律及其拆分度量,解决了函数内P-集合S~F状态规律受游弋于S~F边缘的元素(函数内P-集合的副集中的函数)的干扰,而呈现出来的动态规律(区间拆分规律)以及动态变化程度(拆分度量)的刻画等问题.最后以实例分析函数内P-集合副集及其区间生成规律在风险投资中的应用.     

内P-推理与系统故障判断恢复

P-集合(packet set)是由内P-集合XF(internal packet set)与外P-集合XF(outer packet set)构成的集合对(XF,XF),利用P-集合得到P-推理(packet reasoning),P-推理是由内P-推理(internal packet reasoning)与外P-推理(outer packet reasoning)共同构成的.P-推理是一个动态推理,具有智能特征;把内P-推理应用于系统故障判断-恢复中,给出了内P-故障信息判定定理、最小粒度定理、粒度链定理、属性补充-信息删除定理、系统故障元判定定理,内P-推理信息辨识定理及推论,同时给出了系统故障内P-推理算法与它的N-S图,最后给出应用实例.     

一种新型的蝙蝠算法

针对基本的蝙蝠算法在搜索后期易陷入局部最优及寻优性能差等缺陷.提出一种新型的蝙蝠算法(IBA),重新定义了蝙蝠算法的速度迭代公式,将函数适应度值引入速度迭代公式中丰富了种群的多样性,提高了算法的全局及局部搜索性能,通过10个经典的函数及3个非线性方程组的测试,仿真结果表明,改进后的算法提高了解的精度和解的数量.并与其他算法相比,IBA算法具有一定的优越.     

Radial symmetry and partially overdetermined problems in a convex cone

We obtain the radial symmetry of the solution to a partially overdetermined boundary value problem in a convex cone in space forms by using the maximum principle for a suitable subharmonic function P and integral identities. In dimension 2, we prove Serrin-type results for partially overdetermined problems outside a convex cone. Furthermore, we obtain a Rellich identity for an eigenvalue problem with mixed boundary conditions in a cone.     

Infeasible-interior-point algorithm for a class of nonmonotone complementarity problems and its computational complexity

This paper presents an infeasible-interior-point algorithm for a class of nonmonotone complementarity problems, and analyses its convergence and computational complexity. The results indicate that the proposed algorithm is a polynomial-time one.     

一致P-函数非线性互补问题的宽邻域不可行内点算法及其计算复杂性

1引言与记号单调线性互补问题和线性规划问题的原始-对偶路径跟踪算法,1989年的文献[1、2]分别首先提出。以后又出现了一些改进的算法。早期的原始-对偶路径跟踪算法及其改进算法的迭代点列大都是在包含中心路径C的一个2-范数的窄邻域里,这种可行内点算法通常理论上具有最好的迭代复杂性O(n~(1/2)L),但是由于窄邻域极大地限制了迭代步长,实     

The global linear convergence of an infeasible non-interior path-following algorithm for complementarity problems with uniform P-functions

We propose an infeasible non-interior path-following method for nonlinear complementarity problems with uniform P-functions. This method is based on the smoothing techniques introduced by Kanzow. A key to our analysis is the introduction of a new notion of neighborhood for the central path which is suitable for infeasible non-interior path-following methods. By restricting the iterates in the neighborhood of the central path, we provide a systematic procedure to update the smoothing parameter and establish the global linear convergence of this method. Some preliminary computational results are reported. Received: March 13, 1997 / Accepted: December 17, 1999?Published online February 23, 2000     

Almost Alternating Diagrams and Fibered Links in S3

Let R be a Seifert surface obtained by applying Seifert's algorithmto a connected diagram D for a link L. In this paper, lettingD be almost alternating, we give a practical algorithm to determinewhether L is a fibered link and R is a fiber surface. We furthershow that L is a fibered link and R is a fiber surface for Lif and only if R is a Hopf plumbing, that is, a successive plumbingof a finite number of Hopf bands. It has been known for sometime that this is true if D is alternating, and we show thatit is not always true if D is 2-almost alternating. In the appendix,we partially answer C. Adams's open question concerning almostalternating diagrams. 2000 Mathematical Subject Classification:57M25.     

Mathematical models of innovation diffusion with stage structure

Mathematical models with stage structures are proposed to describe the process of awareness, evaluation and decision-making. First, a system of ordinary differential equations is presented that incorporates the awareness stage and the decision-making stage. If the adoption rate is bilinear and imitations are dominant, we find a threshold above which innovation diffusion is successful. Further, if the adoption rate has a higher nonlinearity, it is shown that there exist bistable equilibria and a region such that an innovation diffusion is successful inside and is unsuccessful outside. Secondly, a model with a time delay is proposed that includes an evaluation stage of a product. It is proved that the system exhibits stability switches. The bifurcation direction of equilibria is also discussed.     

极大子因子

若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的极大子因子．     

关于凸子集和（绝对）收缩核

讨论了线性度量空间中凸子集在什么情况下为该空间的收缩核，以及在什么情况下为绝对收缩核。     

On JB-Rings

A ring R is a QB-ring provided that aR bR=R with a,b∈R implies that there exists a y∈R such that a by∈R_q~(-1).It is said that a ring R is a JB-ring provided that R/J(R)is a QB-ring,where J(R)is the Jacobson radical of R.In this paper,various necessary and sufficient conditions,under which a ring is a JB-ring,are established.It is proved that JB-rings can be characterized by pseudo-similarity.Furthermore,the author proves that R is a JB-ring iff so is R/J(R)~2.