共查询到20条相似文献,搜索用时 93 毫秒
1.
王宜洁 《纯粹数学与应用数学》2009,25(4):822-827
研究了一类具有时滞和反馈控制的非线性单种群离散模型的持久性,获得了该系统持久的充分条件,并通过例子表明结果的可行性,所得结果推广了已有文献的相关结果. 相似文献
2.
本文对一类奇异两点边值问题采用了对称的Galerkin方法.通过利用Green函数,对线性问题得到了拟最优的最大范数误差估计并将这一结果推广到了非线性问题.本文最后列举了一些数值试验结果,这些结果很好地验证了理论结果. 相似文献
3.
考虑了拟正则调和映射和开的平面调和映射的Bloch常数, 得到了较好的结果,
所得结果推广了陈怀惠等及Grigoryan的结果. 相似文献
所得结果推广了陈怀惠等及Grigoryan的结果. 相似文献
4.
Halburd和Korhonen指出研究复域差分的值分布问题对进一步研究复域差分与差分方程具有十分重要的意义.本文得到了关于有限级亚纯函数的差分多项式的亏量为一些结果,其中部分结果可视为微分多项式相应结果的差分模拟.同时,我们在一定条件下给出了经典的Valiron-Mohon'ko定理的一个差分模拟结果,并且作为本文中的一个重要工具出现.这些结果推广了前人已有结果. 相似文献
5.
高阶线性微分方程的解及其解的导数的不动点 总被引:2,自引:0,他引:2
研究了复域齐次和非齐次线性微分方程的解及其解的导数的不动点与超级问题,得到了整函数系数的齐次和非齐次线性微分方程的解及其解的导数的不动点的两个结果,所得结果推广了一些相关结果. 相似文献
6.
该文研究了NOD序列加权和的强收敛速度, 获得了一些新的完全收敛性的结果. 该文的结果推广了陈瑞林$^{[1]}$在NA情形时的结果,部分推广了Stout$^{[2]}$在独立同分布情形时的结果. 相似文献
7.
行为NA的随机变量阵列的完全收敛性 总被引:1,自引:1,他引:0
本文研究了行为NA的随机变量阵列的完全收敛性.利用陈平炎等[4]研究的结果,得到了行为NA的随机变量阵列完全收敛的系列充分条件,这些结果推广和改进了Kuczmaszewska[3]相应的结果. 相似文献
8.
《数学的实践与认识》2017,(20)
模糊数是群决策中常用的决策结果表达形式.研究了模糊群决策结果的可信性评估问题.认为群决策结果的可信性与模糊群决策结果的模糊度和一致度存在强相关,因此,模糊群决策结果可信性评估主要就是对群决策结果的模糊度和一致度的计算,创新提出了基于群隶属函数的模糊度和一致度的计算方法,并给出了基于模糊度和一致度的专家模糊数决策结果综合评价值的计算方法,最后,在此基础上求得专家模糊评估结果的可信度和群决策结果的可信度. 相似文献
9.
10.
11.
SymmetryReductionsoftheCombinedKdV-mKdVEquationZhangJiefang(张解放);XuXuejun(许学军);ChengDesheng(程德声)(DepartmentofPhysics,Zhejiang... 相似文献
12.
Gabriella Arena Raul Serapioni 《Calculus of Variations and Partial Differential Equations》2009,35(4):517-536
We characterize intrinsic regular submanifolds in the Heisenberg group as intrinsic differentiable graphs.
G. Arena is supported by MIUR (Italy), by INDAM and by University of Trento.
R. Serapioni is supported by MIUR (Italy), by GALA project of the Sixth Framework Programme of European Community and by University
of Trento. 相似文献
13.
本篇论文主要讨论带干扰的E rlang(2)过程,首先通过指数分布的可加性来推得生存概率所满足的积分微分方程,进而得到破产概率(由干扰引起和由索赔引起)所满足的积分微分方程,最后得到破产概率的拉氏变换所满足的方程. 相似文献
14.
Heiner Müller-Merbach 《European Journal of Operational Research》1984,17(3):313-316
The author suggested to distinguish between the ‘engineering approach’ and the ‘mathematical approach’ in connection with the design of heuristics. Stainton and Papoulias extended the scope by suggesting the ‘relational approach’. Based upon this extension, a five facets frame is presented here which is suggested to precede and accompany the ‘technical’ design of the heuristic. The facets are: coverage by participation, experience by doing, abstraction by structuring, extension by comparison, exploration by creativity. 相似文献
15.
Agarwal Pankaj K. Aronov Boris Pach János Pollack Richard Sharir Micha 《Combinatorica》1997,17(1):1-9
A graph is calledquasi-planar if it can be drawn in the plane so that no three of its edges are pairwise crossing. It is shown that the maximum number of edges of a quasi-planar graph withn vertices isO(n).Work on this paper by Pankaj K. Agarwal, Boris Aronov and Micha Sharir has been supported by a grant from the U.S.-Israeli Binational Science Foundation. Work on this paper by Pankaj K. Agarwal has also been supported by NSF Grant CCR-93-01259, by an Army Research Office MURI grant DAAH04-96-1-0013, by an NYI award, and by matching funds from Xerox Corporation. Work on this paper by Boris Aronov has also been supported by NSF Grant CCR-92-11541 and by a Sloan Research Fellowship. Work on this paper by János Pach, Richard Pollack, and Micha Sharir has been supported by NSF Grants CCR-91-22103 and CCR-94-24398. Work by János Pach was also supported by Grant OTKA-4269 and by a CUNY Research Award. Work by Richard Pollack was also supported by NSF Grants CCR-94-02640 and DMS-94-00293. Work by Micha Sharir was also supported by NSF Grant CCR-93-11127, by a Max-Planck Research Award, and by grants from the Israel Science Fund administered by the Israeli Academy of Sciences, and the G.I.F., the German-Israeli Foundation for Scientific Research and Development. Part of the work on this paper was done during the participation of the first four authors in the Special Semester on Computational and Combinatorial Geometry organized by the Mathematical Research Institute of Tel Aviv University, Spring 1995. 相似文献
16.
17.
We describe a cutting plane algorithm for solving combinatorial optimization problems. The primal projective standard-form variant of Karmarkar's algorithm for linear programming is applied to the duals of a sequence of linear programming relaxations of the combinatorial optimization problem.Computational facilities provided by the Cornell Computational Optimization Project supported by NSF Grant DMS-8706133 and by the Cornell National Supercomputer Facility. The Cornell National Supercomputer Facility is a resource of the Center for Theory and Simulation in Science and Engineering at Cornell Unversity, which is funded in part by the National Science Foundation, New York State, and the IBM Corporation. The research of both authors was partially supported by the U.S. Army Research Office through the Mathematical Sciences Institute of Cornell University.Research partially supported by ONR Grant N00014-90-J-1714.Research partially supported by NSF Grant ECS-8602534 and by ONR Contract N00014-87-K-0212. 相似文献
18.
We continue our study on arithmetical Fourier series by considering two Fourier series which are related to Diophantine analysis. The first one was studied by Hardy and Littlewood in connection with the classification of numbers and the second one was studied by Hartman and Wintner by Lebesgue integration theory. 相似文献
19.
20.
This paper concerns the open problem of Lovász and Saks regarding the relationship between the communication complexity of a boolean function and the rank of the associated matrix. We first give an example exhibiting the largest gap known. We then prove two related theorems.A preliminary version of this paper appeared in [10].This work was supported by USA-Israel BSF grant 92-00043 and by a Wolfeson research award administered by the Israeli Academy of Sciences.This work was supported by USA-Israel BSF grant 92-00106 and by a Wolfeson research award administered by the Israeli Academy of Sciences. 相似文献