理学 >>> 数学 >>> 数学分析 >>> 微分学 积分学 级数论 数学分析其他学科
搜索结果: 16-30 共查到知识库 数学分析相关记录525条 . 查询时间(2.188 秒)
基于量化控制和网络拆分的思想,讨论间歇耦合多重边融合复杂动态网络的量化同步问题。通过对数量化器对同步误差的反馈控制瞬态信号进行量化,并利用稳定性理论和比较定理,给出多重边融合的间歇式复杂动态网络量化同步化准则。所得理论结果进一步应用于由Chua混沌系统为动力节点所构成的多重边复杂动态网络,数值模拟表明了所获结论的有效性。
Aiming at the lack of scientific and reasonable judgment of vehicles delivery scale and insufficient optimization of scheduling decision, based on features of the bike-sharing usage, this paper analys...
研究一类具有时滞的复值微分系统的概周期解,利用实数域上的不动点定理及相关分析技巧,得到关于该系统的概周期解的存在性及唯一性的新结果。
针对具有粘连字符的验证码,提出了一种基于广义霍夫变换的识别算法。首先,对验证码图片和字符模板进行预处理和骨架化,提取字符模板中目标点的局部特征保存到参考表中;然后,对验证码图片进行逐像素比较,并进行投票,通过投票累加器的极大值定位出字符模板的参考点;最后,对相邻字符之间的干扰进行分析处理,从而提高了字符识别的正确率。提取的局部特征具有平移和旋转的不变性,因而可以对验证码图片中出现的字符部分形变、字...
考虑如下的振荡积分算子: 中函数f为定义在Rn上的Schwartz函数,并且满足m,k>0.本文给出算子Tm,k,n从Lp(Rn)(1 ≤ p < ∞)到Lq(Rn)有界的一个充分必要条件.此外,我们还证明了算子Tm,k,n把L1(Rn)映到l0(Rn).
关于Györy-Sárközy-Stewart猜想     最大素因子  Gyö    ry-Sá  rkö    zy-Stewart猜想       2018/2/6
本文在一定条件下证明了, 当$a,~b,~c$ 均为正整数, 并且$a\geq b>c$ 时, 乘积$(ab+1)(ac+1)(bc+1)$ 的最大素因子大于$k\log\log a$,其中$k$ 为一个正常数. 特别地, 当$c
简单介绍了林家翘先生在科学研究特别是应用数学方面的治学经验和学术追求,以及我与他的一些交往.
It is shown that the usual first variational formula for the energy of a harmonic map (or equivariant harmonic map) with respect to the conformal structure on a two dimensional domain extends to case ...
We develop preconditioners for systems arising from finite element discretizations of parabolic problems which are fourth order in space. We consider boundary conditions which yield a natural ...
We present a mixed finite element method for a model of the flow in a Hele-Shaw cell of 2-D fluid droplets surrounded by air driven by surface tension and actuated by an electric &...
A group has finite palindromic width if there exists n such that every element can be expressed as a product of n or fewer palindromic words. We show that if G has finite palindromic width with respec...
We construct a hyperbolic group with a hyperbolic subgroup for which inclusion does not induce a map of the boundaries.
We give examples of CAT(0), biautomatic, free–by–cyclic, one–relator groups which have finite–rank free subgroups of huge (Ackermannian) distortion. This leads to elementary examples of groups whose D...
A spanning tree T in a finite planar connected graph G determines a dual spanning tree T* in the dual graph G* such that T and T* do not intersect. We show that it is not always possible to find T in ...
The dead-end depth of an element g of a group with finite generating set A is the distance from g to the complement of the radius d(1,g) closed ball, in the word metric d. We exhibit a finitely presen...

中国研究生教育排行榜-

正在加载...

中国学术期刊排行榜-

正在加载...

世界大学科研机构排行榜-

正在加载...

中国大学排行榜-

正在加载...

人 物-

正在加载...

课 件-

正在加载...

视听资料-

正在加载...

研招资料 -

正在加载...

知识要闻-

正在加载...

国际动态-

正在加载...

会议中心-

正在加载...

学术指南-

正在加载...

学术站点-

正在加载...