共查询到20条相似文献，搜索用时 426 毫秒
1.
对2^2n的棋盘格的顶点标号进行了研究,在马克杰的《优美图》一书中已经解决了2^0的棋盘格的顶点标号,且说明了这种图是优美的。此处解决了对一般的n（n=1,2…）,2^2n的棋盘格的顶点标号,其一般表达式为：
θ（x2k^（l））=k k=0,1,…,2^（n-1）
θ（x2（k-l）^（l）=2^（2^n＋2）-k＋1 k=1,2,…,2^k
θx2k^（2）=θ（x（2k-2n-2）^（l）＋2^n＋1 k=2^（k-1）＋1,2^（n-1）＋2,…,2^k
θx2（k-l）^（2）=θ（2k-1-2^k^（l）-2^n k=2k-1＋1,2＋,…,2^n
θx2（k＋1）^（2）=θ（x（k＋1）-1 k=22n＋1＋2＋T（2^n＋1）,…,2^n＋2
θ（xk）=θ（xk-2%（n＋1-2）＋（-1）^k（2^n＋1＋1） ＋T（2^n＋1）（T=0,1,…,2^n-2-2）
并且对它的优美性进行了证明 相似文献
2.
以b1,b2…,bn,…表示数列a1,1,a1,2,…,a1,m1,a2,1,a2,2,…,a2,m2,…,ai,1,ai,2,…,ai,mi,…,给出了n∑i=1bi与n∑i=1mi∑k=1ai,k的一个关系.给出了几个应用实例. 相似文献
3.
研究如下形式的非散度椭圆方程Lu=n∑i,j=1aij(x)(ε)2u/(ε)xi(ε)xj+n∑i=1bj(x)(ε)u/(ε)xi+c(x)u=h(x)解的二阶导数的高阶可积性,其中系数aij(x)有界且具有小BMO范数,bi(x),c(x)∈Ln(Ω),Ω为Rn(n≥3)中的有界光滑域. 相似文献
4.
设X1,…,X q是Carnot群G=(Rn,o)(q相似文献
5.
6.
7.
图G是k树当且仅当G是一个顶点数为k+1的完全图,或者在图G中能找到度为k的点v,使得与v相邻的k个点构成的点集为团,且Gv也是一个k树。设G是一个顶点数为n的k树,其中n=pk+p+1,p≥2。本文构造了一类新的图包含G作为子图。 相似文献
8.
The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition(V1,V2,…,Vk) of V(G)such that,for each i(1≤i≤k),G[Vi] is 1-regular.In this paper,we study the induced matching partition number of product graphs.We provide a lower bound and an upper bound for the induced matching partition number of product graphs,and exact results are given for some special product graphs. 相似文献
9.
De Bruijn-Good图的范畴 总被引：1，自引：0，他引：1
本文主要是利用范畴和函子的基本概念讨论de Bruijn-Good图的性质。参考文献[1]中的关于de Bruijn-Good图自同构的结果,是它的主要定理的一个简单推论。令n是一个不小于1的整数。对于集合M(可以是无限的),n级de Bruijn-Good图G_(n,M)是一个有向图,它的顶点集合是M~n, M~n={(α_1,α_2,…,α_n)|α_(?)εM,i=1,2,…,n},弧的集合是A, A={(α_1,α_2,…,α_n)→(α_2,α_3…,α_n,α_(n+1))|α(?)εM,i=1,2,…,n+1}任何两个集合M和M′之间的一个映象σ,都可诱导出n级de Bruijn-Good图G_(n,M)到 相似文献
10.
对文[1]、文[2]的结论：设x_1＞0(i=1,2…,n),且(?)x_1=1,n≥3,则(?)(1/x_1)-x_1)≥(n-1/n)~n。应用凹函数方法,对条件加以展开拓展,进而得出命题1,命题2两个更一般的结论。 相似文献
11.
The induced matching partition number of graph G is the minimum integer k such that there exists a k-partition (V1,V2,…Vk) of V(G) such that,for each i(1≤i≤k),G[Vi]is 1-regular.In this paper,we study the induced matching partition number of product graphs. We provide a lower bound and an upper bound for the induced matching partition number of product graphs, and exact results are given for some special product graphs. 相似文献
12.
探讨了索赔过程为多险种的风险模型,以及重尾随机变量分布函数f为OR类精确大偏差问题。假设一个保险公司有k种类型的险种．第i个险种的索赔过程记为｜xy,j≥1｜,i=1,…,k,在他人研究的基础上得出多险种风险模型s（k;n1,…,nk）=k∑i=1 ni∑j=1xy的精细大偏差． 相似文献
13.
《中国科学院研究生院学报》1999,(2)
１ Ｉｎｔｒｏｄｕｃｔｉｏｎ ＡｇｒａｐｈＧｉｓａｎｏｒｄｅｒｅｄｐａｉｒｏｆｄｉｓｊｏｉｎｔｓｅｔｓ（Ｖ,Ｅ）ｓｕｃｈｔｈａｔＥｉｓａｓｕｂｓｅｔｏｆｔｈｅｓｅｔｏｆｕｎｏｒｄｅｒｅｄｐａｉｒｓｏｆＶ,ｗｈｅｒｅｔｈｅｓｅｔｓＶａｎｄＥａｒｅｆｉｎｉｔｅ．ＴｈｅｓｅｔＶｉｓｃａｌｌｅｄｔｈｅｓｅｔｏｆｖｅｒｔｉｃｅｓａｎｄＥｉｓｃａｌｌｅｄｔｈｅｓｅｔｏｆｅｄｇｅｓ．ＴｈｅｙａｒｅｕｓｕａｌｌｙｄｅｎｏｔｅｄｂｙＶ（Ｇ）ａｎｄＥ（Ｇ）,ｒｅｓｐｅｃｔｉｖｅｌｙ．Ａｎｅｄｇｅ｛ｘ,ｙ｝ｉｓｓａ… 相似文献
14.
M. Sobral 《Journal of The Franklin Institute》1975,300(3):209-212
Given the linear system = Ax - bu, y = cTx, it is shown that, for a certain non-quadratic cost functional, the optimal control is given by uopt(x) = h(cTx), where the function h(y) must satisfy the conditions ky2?h(y)y>0 for y≠0, h(0) = 0 and existence of h-1 everywhere. The linear system considered must satisfy the Popov condition 1/k + (1 +?ωβ) G(?ω)>0 for all ω, G(s) being the y(s)/u(s) transfer function. 相似文献
15.
16.
《Information processing & management》2023,60(2):103242
Among existing knowledge graph based question answering (KGQA) methods, relation supervision methods require labeled intermediate relations for stepwise reasoning. To avoid this enormous cost of labeling on large-scale knowledge graphs, weak supervision methods, which use only the answer entity to evaluate rewards as supervision, have been introduced. However, lacking intermediate supervision raises the issue of sparse rewards, which may result in two types of incorrect reasoning path: (1) incorrectly reasoned relations, even when the final answer entity may be correct; (2) correctly reasoned relations in a wrong order, which leads to an incorrect answer entity. To address these issues, this paper considers the multi-hop KGQA task as a Markov decision process, and proposes a model based on Reward Integration and Policy Evaluation (RIPE). In this model, an integrated reward function is designed to evaluate the reasoning process by leveraging both terminal and instant rewards. The intermediate supervision for each single reasoning hop is constructed with regard to both the fitness of the taken action and the evaluation of the unreasoned information remained in the updated question embeddings. In addition, to lead the agent to the answer entity along the correct reasoning path, an evaluation network is designed to evaluate the taken action in each hop. Extensive ablation studies and comparative experiments are conducted on four KGQA benchmark datasets. The results demonstrate that the proposed model outperforms the state-of-the-art approaches in terms of answering accuracy. 相似文献
17.
Suppose we have a group of n people, each possessing an item of information not known to any of the others and that during each unit of time each person can send all of the information he knows to at most other people. Further suppose that each of at most k other people can send all of the information they know to him. Determine the length of time required, f(n, k), so that all n people know all of the information. We show f(n, k) = ?logk+1n?.We define g(n, k) analogously except that no person may both send and receive information during a unit time period. We show ?logk+1n?≤g(n, k)≤2?logk+1n? in general and further show that the upper bound can be significantly improvea in the cases k = 1 or 2. We conjecture g(n, k) = bk logk+1n+0(1) for a function bk we determine. 相似文献
18.
李林初 《中国科学院研究生院学报》1988,26(5):371-377
本文分析了池杉Taxodium ascendens 的核型，全由中部和近中部着丝点染色体组成，
核型公式为K(2n)=22=20m+2sm，属“1A”类型。它的特点是10号染色体具“长着
丝点区域”结构。池杉染色体的相对长度组成为2n=2L+8M2+12M1。通过与落羽杉
的“1A”和墨西哥落羽杉的“2A”核型进行比较，似见它们的进化水平以落羽杉、池杉，墨西
哥落羽杉之序递增。 落羽杉属植物的核型公式均为K(2n)=22= 20m+2sm。 本文还就
核型、生态环境和地理分布(包括化石)资料讨论了落羽杉属的次生遗传歧异中心和可能的演
化式样。 相似文献
19.
A system of differential equations A(d/dt) x = Bx+f, along with the initial condition x(0) = k, is considered where A and B are m x n matrices. Generalized inverses of the matrix A are used to derive algebraic conditions for the existence and uniqueness of a solution. An example is presented to illustrate application of the results to circuit theory. 相似文献
20.
研究了如下的拟线性椭圆型方程:△pu+uq+λup*-1=0,u∈W1o,p(Ω), (1λ)其中,Ω2是RN中具有光滑边界的有界区域,△pu=div( |▽u|p-2▽u),N≥3,2≤p＜N,0＜q＜1,p*=NP/N-P.设λ*(Ω,p,q)是拟线性椭圆型方程(1λ)可解的参数集的上确界.运用变分方法,在不要求具有对称性质的一般区域Ω上得到了λ*(Ω,p,q)的一个可以精确计算的下界. 相似文献