首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   32篇
  国内免费   2篇
  完全免费   9篇
  数学   43篇
  2020年   1篇
  2019年   1篇
  2018年   5篇
  2016年   3篇
  2015年   3篇
  2014年   2篇
  2013年   5篇
  2012年   9篇
  2011年   6篇
  2010年   2篇
  2009年   5篇
  2008年   1篇
排序方式: 共有43条查询结果,搜索用时 97 毫秒
1.
This work investigates the chaos anti-synchronization between two different dimensional chaotic systems with fully unknown parameters via added-order. Based on the Lyapunov stability theory, the adaptive controllers with corresponding parameter update laws are designed such that the two different chaotic systems with different dimensions can be synchronized asymptotically. Finally, two illustrative numerical simulations are given to demonstrate the effectiveness of the proposed scheme.  相似文献
2.
系数为梯形模糊数的模糊回归分析的最小二乘法   总被引:1,自引:0,他引:1  
由于模糊数往往可以用梯形模糊数来逼近,因此对梯形模糊数的模糊回归模型的研究就有一定的实用价值.采用最小二乘的方法,针对输入为精确数、输出和回归系数都是梯形模糊数的模糊线性回归模型,讨论了该模型回归系数的最小二乘估计及误差项的估计,实例说明了提出的参数估计的拟合度比较好.  相似文献
3.
4.
Denote by D(G)=(di,j)n×nD(G)=(di,j)n×n the distance matrix of a connected graph G with n   vertices, where dijdij is equal to the distance between vertices vivi and vjvj in G  . The least eigenvalue of D(G)D(G) is called the least distance eigenvalue of G  , denoted by λnλn. In this paper, we determine all the graphs with λn∈[−2.383,0]λn[2.383,0].  相似文献
5.
Let D(G)=(di,j)n×n denote the distance matrix of a connected graph G with order n, where dij is equal to the distance between vi and vj in G. The largest eigenvalue of D(G) is called the distance spectral radius of graph G, denoted by ?(G). In this paper, some graft transformations that decrease or increase ?(G) are given. With them, for the graphs with both order n and k pendant vertices, the extremal graphs with the minimum distance spectral radius are completely characterized; the extremal graph with the maximum distance spectral radius is shown to be a dumbbell graph (obtained by attaching some pendant edges to each pendant vertex of a path respectively) when 2≤kn−2; for k=1,2,3,n−1, the extremal graphs with the maximum distance spectral radius are completely characterized.  相似文献
6.
In this paper, we investigate the problem of impulsive consensus of multi-agent systems, where each agent can be modeled as an identical nonlinear oscillator. Firstly, an impulsive control protocol is designed for directed networks with switching topologies based on the local information of agents. Then sufficient conditions are given to guarantee the consensus of the networked nonlinear oscillators. How to select the discrete instants and impulsive constants is also discussed. Numerical simulations show the effectiveness of our theoretical results.  相似文献
7.
In statistical planning of experiments, super-simple designs are the ones providing samples with maximum intersection as small as possible. Super- simple group divisible designs are useful in constructing other types of super- simple designs which can be applied to codes and designs. In this article, the existence of a super-simple (5, 4)-GDD of group type gU is investigated and it is shown that such a design exists if and only if u ≥ 5, g(u - 2) ≥ 12, and u(u - 1)g^2≡ 0 (mod 5) with some possible exceptions.  相似文献
8.
单圈偶图是边数等于顶点数的简单连通偶图.Δ(G)表示图G的最大度.文中给出了最大度为Δ(≥n+1/2)的n阶单圈偶图的谱半径的上界,并刻画了达到该上界的图.文中还证明了当Δ(G)≥[(2n+1)/3]+1时,n(≥8)阶单圈偶图G的谱半径随着最大度的递增而严格递增,并在此基础上给出了谱半径排在前17位的n(≥16)阶单圈偶图.  相似文献
9.
在经典命题逻辑系统中,给出了D-г逻辑度量空间中理论的D-条件发散度和公式到理论的D-条件距离的真度表达式,推出了它们的若干性质;并利用这些性质研究了D-г逻辑度量空间中近似推理的相关问题.  相似文献
10.
利用赋值集的随机化方法,在n值Lukasiewicz命题逻辑系统中引入公式的随机真度,证明了随机真度的MP规则、HS规则及交推理规则;同时引入公式间的随机相似度和随机伪距离,建立了随机逻辑度量空间,推导出随机相似度的若干性质,证明了随机逻辑度量空间中逻辑运算的连续性;并在随机逻辑度量空间中提出了三种不同类型的近似推理模式,证明了三种近似推理模式的等价性.  相似文献
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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