D.C.隶属函数模糊集及其应用(Ⅱ)--D.C.隶属函数模糊集的万能逼近性

本文是D．C．隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D．C．隶属函数模糊集，建立了D．C．隶属函数模糊集对模糊集的万有逼近性。探讨了D．C．隶属函数模糊集与模糊数之间的关系，给出了用D．C．隶属函数模糊集逼近模糊数的e-Cellina逼近形式，得到模糊数与D．C．函数之间的一个对应算子，指出了用模糊数表示D．C．函数的问题。     

I—ring which Satisfies A.D.C.C on Principal Left Ideals

Derndtl0n1AringRiscalledI-ring,ifasasemigroupRisgeneratedbyitsidemPOtentelements.Defhotl0n2AringRissaidtosatisfyalm0stdescending(0rascending)chaincondi-tionsonleftideals,ifforeverydescending(ascending)chainofleftideals0fR,I,nI2n...nI.Xi..-(I,GI2G...GI'g..-),thereexistsaPOsitiveintegerpsuchthatRPI=Ii(IiGR-'I,)foralli,whereR-'I,={ueRlR'u=IP}.By[5JitisknownthatAringRsatisfiesA.D.C.C(OTA.A.C,C)onleftidealsifandonlyifforeverydescending(0rascending)chalnOfleftidealsofR,I,nI2n-..n…     

D.C.隶属函数模糊集及其应用(II)——D.C.隶属函数模糊集的万能逼近性

本文是D.C.隶属函数模糊集及其应用系列研究的第二部分。指出在实际问题中普遍选用的三角形、半三角形、梯形、半梯形、高斯型、柯西型、S形、Z形、π形隶属函数模糊集等均为D.C.隶属函数模糊集,建立了D.C.隶属函数模糊集对模糊集的万有逼近性。探讨了D.C.隶属函数模糊集与模糊数之间的关系,给出了用D.C.隶属函数模糊集逼近模糊数的-εC e llina逼近形式,得到模糊数与D.C.函数之间的一个对应算子,指出了用模糊数表示D.C.函数的问题。     

ON THE CONJECTURE OF A.LINS, W.DE MELO AND C.C.PUGH

We have proved that Lienard equation with F(x) = -F(-x) has at most n limit cycles. Under the condition, an affirmative answer to A.Lins, W.de Melo and C.C.Pugh's conjecture is given.     

Noetherian Skew Group Rings of F.C Groups

Let R *θG be the skew group ring with a F.C group G and the group homom-rphismθfrom G to Aut(R), the group of automorphisms of the ring R. In this paper,the necessary and sufficient condition such that R*θG will be Noetherian is given, which generalizes the results of I.G. connel.     

局部C半群与抽象Cauchy问题

在本文中，我们讨论由算子A生成的局部C半群对应的Cauchy问题，将初值x的取值范围从CD（A）推广到（λ-A）~(-1)C（E）．     

D.C.隶属函数模糊集及其应用(I)--D.C.隶属函数模糊集基本概念与性质

本文是D.C.隶属函数模糊集及其应用系列研究的第一部分.建立了D.C.隶属函数模糊集的基本概念.探讨了D.C.隶属函数模糊集的基本性质和D.C.隶属函数模糊集对一些常见的重要t模、余模和伪补的封闭性.并以此建立了丰富的模糊数学应用模型.     

On A. Lino, W. Demelo and C. C. Pugh''''s Conjecture (Part 1)

For Lienard's equation or its equivalent system (?)=y-F(x),(?)=-x,(F(x)=integral from n=0 to x (f(ξ)dξ)). (*) there were quite a few papers studied (*) to have some limit cycles. Although there were few papers studied (*) to have at most m limit cycles, but good results were given already. A. Lino, W. Demelo and C. C. Pugh conjectured following fact: when f(x)=sum from N (a_ix~i) (N=2n+1,2n+2),system (*) has at most n limit cycles.     

The uv-Decomposition on a Class of D.C. Functions and Optimality Conditions

In this paper,the UV-theory and P-differential calculus are employed to study second-order ex-pansion of a class of D.C.functions and minimization problems.Under certain conditions,some properties ofthe U-Lagrangian,the second-order expansion of this class of functions along some trajectories are formulated.Some first and second order optimality conditions for the class of D.C.optimization problems are given.     

与TA族相联系的C.Neumann系统

在位势与特征函数之间的约束下,TA族对应的特征值问题被非线性化为一个以为Hamiltonian函数的Liouville完全可积的C.Neumann系统(TQ~(N-1),dpAdq|TQ~(N-1)H|TQ~(N-1)),并且给出了TA族的对合解.     

A sharp inequality for the tail probabilities of sums of i.i.d. r.v.’s with dominatedly varying tails

Let F be a distribution function supported on (-∞, ∞) with a finite mean μ. In this note weshow that if its tail F = 1 - F is dominatedly varying, then for any γ＞ max{μ, 0}, there exist C(γ) ＞ 0 and D(γ) ＞ 0 such thatC(γ)nF(x) ≤ Fn*(x) ≤ D(γ)nF(x),for all n ≥ 1 and all x ≥γn. This inequality sharpens a classical inequality for the subexponential distributioncase.     

OPTIMIZATION AND DUALITY OF CONE-D.C. PROGRAMMING

ＯＰＴＩＭＩＺＡＴＩＯＮＡＮＤＤＵＡＬＩＴＹＯＦＣＯＮＥ－Ｄ．Ｃ．ＰＲＯＧＲＡＭＭＩＮＧ￥ＹＩＮＺＨＩＷＥＮ；ＬＩＹＵＡＮＸＩ（ＤｅｐａｒｔｍｅｎｔｏｆＳｔａｔｉｓｔｉｃｓａｎｄＯｐｅｒａｔｉｏｎｓＲｅｓｅａｒｃｈ，ＦｕｄａｎＵｎｉｖｅｒｓｉｔｙ，Ｓ...     

C1 Solutions of the Iterative Equation G(x, f(x), ..., fn(x)) =F(x)

In this paper we consider the iterative equation G(x,f(x),...,f n(x)) = F(x) on R,and give the existence of C 1 solutions near the fixed point of F,which generalize some results on the leading coefficient problem from the form of the polynomial-like iterative equations to the general form.     

迭代函数方程$G(x,f(x),\ldots,f^n(x))=F(x)$的$C^1$解

In this paper we consider the iterative equation G(x,f(x),...,f n(x)) = F(x) on R,and give the existence of C 1 solutions near the fixed point of F,which generalize some results on the leading coefficient problem from the form of the polynomial-like iterative equations to the general form.     

关于完全C＊置换子群

设H≤G,称H为G的完全C＊置换子群,如果对G的任意素数幂阶子群K,恒有x∈（H,K〉,使得HKx=KxH．本文利用素数幂阶子群的完全C＊置换性给出了一个群属于给定群系的的若干充要条件．     

关于C.Fefferman定理与全纯映射的边界扩充

C．Fefferman定理证明了光滑有界强拟凸域之间的双全纯映射可以光滑延拓到边界，这个结果已经被推广到各种情形．其中Bell和Catlin以及Diederich和Fornaess独立地将其推广到拟凸域的逆紧全纯映射．本文较全面地综述了C．Fefferman定理的推广情况以及Bergman投射的边界正则性问题，同时对如何去掉Bell和Catlin以及Diederich和Fornaess定理条件中的拟凸性给出一个新观察，提出一个解决方向并且说明在具体情况下这个新观察确实是可以提供答案的．     

基于最优D.C.分解的单二次约束非凸二次规划精确算法

本文提出一种基于最优D.C.分解的单二次约束非凸二次规划精确算法.本文首先对非凸二次日标函数进行D.C.分解,然后对D.C.分解中凹的部分进行线性下逼近得到一个凸二次松弛问题.本文证明了最优D.C.分解可通过求解一个半定规划问题得到,而原问题的最优解可以通过计算最优凸二次松弛问题的满足某种互补条件的解得到.最后,本文报告了初步数值计算结果.     

由一道高考题想到的

（2010年全国Ⅰ）已知抛物线C：y2=4x的焦点为F,过点K（-1,0）的直线Z与C相交于A、B两点,点A关于x轴的对称点为D．（1）证明：点F在直线BD上;（2）（略）．     

一道高考题几何证法及推广

2010年全国第21题： 已知抛物线C：y^2=4x的焦点为F,过点K（-1,0）的直线l与C相交于A、B两点,点A关于x轴的对称点为D．（I）证明：点F在直线BD上;（Ⅱ）略．     

两个半光滑函数之和的非光滑方程组解法

对两个半光滑函数之和F（x）=F1（x）＋F2（x），其中F1，F2均为半光滑函数，给出了求解F（x）=0的一种广义牛顿法．算法在每一迭代点处分别计算中一个元素，而不需计算中元素．