英语人>网络例句>A.N. 相关的网络例句
A.N.相关的网络例句
与 A.N. 相关的网络例句 [注:此内容来源于网络,仅供参考]

The result is generalized to a sequence of Banach spaces.

由此得出:Banach空间X上n次积分C-半群序列S强收敛于Banach空间X上n次积分C-半群S的充分条件是其生成元序列A强收敛于A,并将这一结论推广到一般的Banach空间序列上。

The representation of sequences is very helpful for the research of their linear complexity,so this paper we first research trace representation of periodic sequences,and the trace representation of a New Generalized Cyclotomic Sequence of order two of length pq is given,then for 2~mp~n period binary sequences,where p is an odd prime and 2 is a primitive root modulo p~2,we present a relation-ship between the linear complexity and the minimum value k for which the k-error linear complexity is strictly less than the linear complexity and have the upper bound and lower bound of the value k, finally we discuss the k-error linear complexity of legendre sequences,also have the upper bound and lower bound of the value k,and discusses the situation where the linear complexity drop again for some Legendre sequences.

序列的表达形式对于其线性复杂度的研究是十分有帮助的,本文我们首先研究的是周期序列的迹表示,给出了2阶pq长度的扩展分圆序列的迹表示,然后讨论了周期为2~mp~n(m≥2)序列的线性复杂度与使得线性复杂度变小的最小的k值的关系,给出了k值的上界和下界,这里p为奇素数,2是模p~2的本原根,并通过例子讨论了其线性复杂度的稳定性,最后对Legendre序列k-错线性复杂度进行了分析,也给出了k值的上界和下界,并对某些Legendre序列讨论了线性复杂度再次下降的情况。

Finally, the author proves the sharp bound for the indices of convergence of n*n reducible Boolean matrices with f〓≥2 the writer lets f〓 be the greatest common divisor of the distinct lengths of the elementary cycles of the associated digraph D (A for a reducible Boolean matrix A , and characterizes the matrices with the largest index.

最后,设f〓为可约布尔矩阵A的伴随有向图D的所有圈长的最大公约数,当f〓≥2时,我们得到了可约布尔矩阵幂敛指数的一个上界和达到最大幂敛指数的矩阵的完全刻划。

First of all,we have given some of the basic concepts of differential equations, described the constant coefficient linear ordinary differential equation solution, for a class of second-order variable coefficient linear ordinary differential equation initial value problem, an approximate solution, the method is first unknown function of a definition for N sub-interval, and then in between each district within a constant coefficient ordinary differential equations similar to the replacement, the solution has been the problem as similar to the original analytical solution, and then gives a detailed second-order change order coefficient of linear homogeneous ordinary differential equation solution examples, the examples of the approximate method proposed in this paper is valid.

首先给出了微分方程的一些基本概念,讲述了常系数线性常微分方程的解法,针对一类二阶变系数线性常微分方程初值问题,提出了一个近似解法,本方法是先对未知函数的一个定义区间作N等分,然后在每一个小区间内用一个常系数常微分方程近似替换,所得到的解作为原问题的近似解析解,随后详细给出了一个求二阶变系数齐次线性常微分方程的解的实例,该实例说明本文提出的近似方法是有效的。

For k≥3, we show the infimum of α is 0 and adduce the G(superscript 1,s subscript k+1) graph is which causes α=0; using the foregone conclusion we characterize the G(superscript 1,s subscript k+1) graph which has a k-role assignment.

本文证明了k≥3时,a的下确界为0,并证明了当图G(上标 1,s 下标 k+1)图且a(s+1)≠0(mod k+1)(a=2,3,4)时,α达到下确界;最后还刻画了能够(n-1)-角色分配的G(上标 1,s 下标 n)图。

This b a n c a n cert a inly be seen a t work in religious contexts.

这项禁令绝对可以在宗教背景下的工作中。

For k≥1, an isometry φ between codes over Zsubscript P(superscript k+1 and codes over Z(subscript P^2) is introduced and used to give a generalization of the Gray map φ: Z(superscript n subscript 4)→F(superscript 2n subscript 2). Furthermore, by means of this isometry, the concept of negacyclic codes is extended to codes over the ring Zsubscript P(superscript k+1. A characterization of these codes in terms of their images under φ is given. It is also shown that the generalized Gray map image of the 1-P(superscript k-cyclic code is a distance-invariant quasi-cyclic code.

文章引入了Z下标 P(上标 k+1码和Z(下标 P^2)码之间的等距同构φ(k≥1);利用φ把Gray映射φ:Z(上标 n 下标 4)→F(上标 2n 下标 2)推广为φ:;而且利用φ,负循环码概念被推广到Z下标 P(上标 k+1码,得到了1-P(上标 k-循环码;依据等距同构φ,给出了这些码的表示;也证明了1-P(上标 k-循环码在推广的Gray映射下的像是距离不变的准循环码。

Consider singular growth curve model as follows : Y = ABC + E , where A , C are all known matrices, B is an unknown matrix of regression coefficients , Y is a matrix of observations and E =(1,(2),... is matrix of random errors .

考虑奇异增长曲线模型:Y=ABC+E,其中A、C均为已知矩阵,B是未知回归系数阵,Y为观测资料阵,E=ε_((1)…ε_(n′为随机误差阵,假定Eε_(iε_(i′=∑,i=1,2…n,Eε_(iε_(j′=0,i≠j,这里∑≥0。

Consider singular growth curve model as follows : Y = ABC + E , where A , C are all known matrices, B is an unknown matrix of regression coefficients , Y is a matrix of observations and E =(1,(2),...

中文摘要:考虑奇异增长曲线模型:Y=ABC+E,其中A、C均为已知矩阵,B是未知回归系数阵,Y为观测资料阵,E=ε_((1)…ε_(n′为随机误差阵,假定Eε_(iε_(i′=∑,i=1,2…n,Eε_(iε_(j′=0,i≠j,这里∑≥0。

Firstly, we study the normality of a family of meromorphic functions concerning differential polynomial and shared values and prove the following Theorem 23.5 Let F be a family of m...

证明了 定理 2.3.5设F为Δ上亚纯函数,k、n、q∈N,P=ω~q+α_(q-1)ω~(q-1)+…+α_1ω是多项式,并且设Hf,f~1,…,f~(k是不含常数项的多项式,a、b为两个判别的有穷复数,并且b≠0,c是非零有穷复数。

第66/100页 首页 < ... 62 63 64 65 66 67 68 69 70 ... > 尾页
相关中文对照歌词
A.N.T.S.
C.A.N.C.E.R
B.A.N. (The Love Song)
A.N.G.E.L.
G-A-N-G-S-T-E-R
W-O-M-A-N
S.A.N.T.A.N.A.
S.C.A.N.D.A.L.
S.A.N.T.A.N.A.
Keep It G.A.N.G.S.T.A.
推荐网络例句

With Death guitarist Schuldiner adopting vocal duties, the band made a major impact on the scene.

随着死亡的吉他手Schuldiner接受主唱的职务,乐队在现实中树立了重要的影响。

But he could still end up breakfasting on Swiss-government issue muesli because all six are accused of nicking around 45 million pounds they should have paid to FIFA.

不过他最后仍有可能沦为瑞士政府&议事餐桌&上的一道早餐,因为这所有六个人都被指控把本应支付给国际足联的大约4500万英镑骗了个精光。

Closes the eye, the deep breathing, all no longer are the dreams as if......

关闭眼睛,深呼吸,一切不再是梦想,犹如。。。。。。