首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   19篇
  国内免费   1篇
  完全免费   8篇
  数学   28篇
  2019年   4篇
  2018年   1篇
  2017年   1篇
  2014年   1篇
  2013年   3篇
  2012年   2篇
  2011年   2篇
  2010年   1篇
  2009年   2篇
  2007年   1篇
  2005年   2篇
  2004年   1篇
  2003年   3篇
  2002年   1篇
  1994年   1篇
  1993年   1篇
  1991年   1篇
排序方式: 共有28条查询结果,搜索用时 46 毫秒
1.
Multipliers and Cyclic Vectors in Bloch Type Spaces   总被引:6,自引:0,他引:6  
In this paper we study the coefficient multipliers, pointwise multipliers and cyclic vectors in the Bloch type spaces B α and little Bloch type spaces for 0 < α < ∞. We give several full characterizations of the coefficient multipliers (B α ,B β ) and for 0 < α, β < ∞ and pointwise multipliers M(B α ,B β ) and for 1 ≠ α, β ∈ (0,∞). We also obtain some properties of cyclic vectors for Bloch type spaces. Dedicated to Professor Yu Zan HE on the occasion of his 65th birthday  相似文献
2.
带有阻尼项的广义对称正则长波方程的指数吸引子   总被引:2,自引:0,他引:2  
考虑了带有阻尼项的广义对称正则长波方程的整体快变动力学· 证明了与该方程有关的非线性半群的挤压性质和指数吸引子的存在性· 对指数吸引子的分形维数的上界也进行了估计·  相似文献
3.
非线性拟抛物型积分微分方程的初边值问题和初值问题   总被引:1,自引:0,他引:1  
本文研究非线性拟抛物积分微分方程的初边值问题和初值问题。运用Galerkin方程结合能量估计证明了问题的整体强解的生存性、唯一性和稳定性,最后在一定条件下讨论了初边值问题整体解的不存在性和爆破问题。  相似文献
4.
非线性Sobolev Galpern方程的近似惯性流形   总被引:1,自引:0,他引:1       下载免费PDF全文
近似惯性流形概念与耗散偏微分方程的长时间行为研究有关, 该文对非线性Sobolev Galpern方程构造了两个近似惯性流形. 证明了非平滑近似惯性流形Σ和平滑近似惯性流形Σ_0=P_mH对整体吸引子有相同的逼近阶数.  相似文献
5.
该文考虑了带有耗散项的广义对称正则长波方程解的长时间性态.证明了周期初值问题整体吸引子的存在性,用关于时间的一致先验估计获得整体吸引子的Hausdorff和分形维数的上界估计.  相似文献
6.
随机多目标规划区间交互过程及其应用   总被引:1,自引:0,他引:1  
针对随机多目标规划问题中目标函数含有连续型随机变量的情形,设计一种基于概率有效性意义下的区间交互过程,将概率有效性与多目标问题理想点进行有机结合,有效辅助决策者寻求愿意承受的风险水平,并进行决策,简化了随机多目标优化问题。最后通过实例说明该交互过程的作用。  相似文献
7.
图模式挖掘中的子图同构算法   总被引:1,自引:0,他引:1  
图模式挖掘问题在Web挖掘、生物信息学、社会关系等众多领域有广泛的应用,它涉及到子图的搜索以及子图的同构问题.这两个问题都具有相当高的计算复杂度,现有的子图同构问题大多采用最小编码算法,但对无标签图特别是对无标签无向图,该算法效率较底,从而子图的同构成为图模式挖掘问题的一个瓶颈.针对无标签图,以代数理论为基础,分别利用度序列和特征值构造了两种子图同构算法,用于对有向图和无向图的同构判别.最后对2个真实生物网络进行了仿真实验,结果表明,算法的效率优于现有算法.  相似文献
8.
Recent literatures have suggested that multiobjective evolutionary algorithms (MOEAs) can serve as a more exploratory and effective tool in solving multiobjective optimization problems (MOPs) than traditional optimizers. In order to contain a good approximation of Pareto optimal set with wide diversity associated with the inherent characters and variability of MOPs, this paper proposes a new evolutionary approach—(μ, λ) multiobjective evolution strategy ((μ, λ)-MOES). Following the highlight of how to balance proximity and diversity of individuals in exploration and exploitation stages respectively, some cooperative techniques are devised. Firstly, a novel combinatorial exploration operator that develops strong points from Gaussian mutation of proximity exploration and from Cauchy mutation of diversity preservation is elaborately designed. Additionally, we employ a complete nondominance selection so as to ensure maximal pressure for proximity exploitation while a fitness assignment determined by dominance and population diversity information is simultaneous used to ensure maximal diversity preservation. Moreover, a dynamic external archive is introduced to store elitist individuals as well as relatively better individuals and exchange information with the current population when performing archive increase scheme and archive decrease scheme. By graphical presentation and examination of selected performance metrics on three prominent benchmark test functions, (μ, λ)-MOES is found to outperform SPEA-II to some extent in terms of finding a near-optimal, well-extended and uniformly diversified Pareto optimal front.  相似文献
9.
Recently, a Bayesian receiver for blind detection in fading channels has been proposed by Chen, Wang and Liu (200,IEEE Trans. Inform. Theory,46, 2079–2094), based on the sequential Monte Carlo methodology. That work is built on a parametric modelling of the fading process in the form of a state-space model, and assumes the knowledge of the second-order statistics of the fading channel. In this paper, we develop a nonparametric approach to the problem of blind detection in fading channels, without assuming any knowledge of the channel statistics. The basic idea is to decompose the fading process using a wavelet basis, and to use the sequential Monte Carlo technique to track both the wavelet coefficients and the transmitted symbols. Moreover, the algorithm is adaptive to time varying speed/smoothness in the fading process and the uncertainty on the number of wavelet coefficients (shrinkage order) needed. Simulation results are provided to demonstrate the excellent performance of the proposed blind adaptive receivers. This work was supported in part by the U.S. National Science Foundation (NSF) under grants CCR-9875314, CCR-9980599, DMS-9982846, DMS-0073651 and DMS-0073601.  相似文献
10.
本文讨论一类齐性辛流形上的几何量子化理论。对于特殊的可量子化的经典观察量,其量子化给出了紧半单Lie群的最高权为非奇异的所有不可约表示。  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号