您要查找的是不是:
- 关于Taylor级数的收?a问题 ON THE CONVERGENCE PROBLEM OF TAYLOR SERIES
- Taylor级数的正规增长 THE REGULAR GROWTH OF TAYLOR SERIES
- 收敛关系的成果,得到一维对称随机Taylor级数的收敛边界几乎必然是自然边界。 convergence of symmetric random series,this paper makes a conclusion that the boundary of convergence of general symmetric random analytic Taylor series is a natural boundary.
- Taylor级数 Taylor series
- 双随机Taylor级数 bi - random Taylor series
- 此付款方式能让您针对特定的托运货件,要求已答应付款的收件人付费。 This payment method allows you to bill the charges for a specified shipment to a consignee who has agreed to pay the charges.
- 收汇 collect
- 在安全标签中指定的策略模块要求您将这份邮件对所有的收件人进行加密。 The policy module specified in the security label requires that you encrypt this message to all recipients.
- 无穷级Taylor级数 Infinite order Taylor series
- 增生过盛在一个器官或组织中细胞数的不正常增加,引起扩大 An abnormal increase in the number of cells in an organ or a tissue with consequent enlargement.
- 这里的收讯不是很好,需要比较长的时间才能收到你传的影像。说吧!你要我怎么做? The reception is not very good, it took a long time to receive the images. So, what do you want from me?
- 关于亲和数的一个问题 One Problem about Amicable Number
- 关于平方补数的k次均值 On the k-th power mean value of square complements
- 可微调的底线过线架,可针对底线的收放与松紧,做更精细的调整。 The flexible thread take-up eyelet holder, to offer the looper thread tension and release more details adjustment.
- 关于图的符号控制数的下界 ON THE LOWER BOUNDS OF SIGNED DOMINATION NUMBER OF A GRAPH
- 有否根据各种优惠计划的需要而制定清晰的收受利益守则和程序? Does the company have a clear Code on Acceptance of Advantages and procedures to cater for different incentive schemes?
- 采用Taylor级数一阶展开近似计算性能参数的均值和均方差,通过可靠性指数计算满足约束条件成功的概率。 The mean value and mean square deviation of the performance parameter were approximately calculated by first-order Taylor series expansion,and the probability which meet constraint conditions can be obtained by reliability index calculation.
- 韩日世界杯的收视份额是达到45%,当数据出来时,错过机会的只有遗憾! The rating share of Korea-Japan World Cup reached 45%25, when this number comes out, for those missing the chance, only to regret!
- 关于图的强符号控制数的下界 On Lower Bounds of the Strong Signed Domination of a Graph
- 关于无k次幂因子数的上界估计 On the up bound estimation of the k-power free numbers