助手标题  
全文文献 工具书 数字 学术定义 翻译助手 学术趋势 更多
查询帮助
意见反馈
   布尔和 的翻译结果: 查询用时:0.777秒
图标索引 在分类学科中查询
所有学科
数学
计算机软件及计算机应用
更多类别查询

图标索引 历史查询
 

布尔和
相关语句
  boolean sum
     Multi-Knot Boolean Sum Interpolating Surface Interactive Design of Aircraft Configuration
     多结点布尔和插值曲面交互飞机外形设计
短句来源
     Boolean Sum Operation Based on Sticker Model
     基于sticker模型的布尔和运算
短句来源
     In this paper,a Boolean Sum algorithm is presented for constructing C1 rational interpolation function over an arbitrary triangles. The algorithm is simple to construct and easy to calculate,and its approximate order is 0(h9). Its algebraic precision set includes all polynomials of degree≤3.Finally, a numerical example is given.
     本文描述了任意三角域上C1有理插值的一种布尔和方法.这种方法构造简单,计算方便,逼近精度为O(h9),代数精度集为{xi,yj,0≤i+j≤3}.最后给出了一个数值例子.
短句来源
     By takins Boolean sum of projective operator and Taylor operator as interpolating operator, A method forconstructing Cn interpolating functions of arbitrary trinnghs is presented. The method is easy to construct , and its the orderof approximation is O(h3n+3)
     用投影算子和泰勒算子的布尔和作插值算子,给出了任意三角域上的一种Cn插值方法.这种方法构造简单,逼近精度阶为O(3n+3).
短句来源
     In this paper,basic theory of the sticker model was introduced,then we gave the information representative method of Boolean matrix and realized Boolean sum operation based on sticker model. The proposed method demonstrated the massive parallelism of DNA computing.
     介绍粘贴模型的数据表示方法; 给出了利用粘贴模型表示布尔矩阵,实现了布尔和运算,充分反映了DNA计算的巨大并行性。
短句来源
  boolean sums
     Approximation Theorems of Continous Functions by the Iterated Boolean Sums of Kantorovich Operators
     用Kantorovich算子的迭代布尔和逼近连续函数
短句来源
     APPROXIMATION QUALITIES FOR THE ITERATED BOOLEAN SUMS OF BERNSTEIN-KANTOROVICH OPERATORS
     Bernstein-Kantorovich算子的迭代布尔和的逼近性质
短句来源
     In this paper,we give iterated Boolean Sums of Kantorovich operators at first,then the direct,inversetheorems and the charaterization of approximation order.
     构造了一类Kantorovich算子的迭代布尔和 ,然后给出了用它逼近连续函数时的正定理、逆定理和非饱和逼近阶的特征刻划 .
短句来源
     In this paper, by modulus of smoothness and qualities of polynomial of best approximation, we discuss the approximation qualities by the iterated Boolean sums of Bernstein-Kantorovich operators,for functions which are defined in the space L_p[0,1]. Also we give the direct theorem, weak inverse inequality and equivalent theorem.
     本文利用光滑模及最佳逼近多项式的性质,研究了Bernstein-Kantorovich算子的迭代布尔和对Lp[0,1]中的函数的逼近性质,得到了逼近正定理,弱逆不等式及等价定理.
短句来源
  boole sum
     In this paper, the fundamental theory of coons interpolation is studied, and the general method to construct coons interpolation surface presented. At the same time, the Boole sum approximation and its error estimates are also discussed.
     文章研究了康斯插值的基本理论,给出了构造康斯插值曲面的一般方法,对布尔和逼近与误差估计也作了探讨;
短句来源
  “布尔和”译为未确定词的双语例句
     Clustering Algorithm for Boolean and Categorical Data
     聚类布尔和分类数据
短句来源
     It was extended to C~(N-1) situation through Hermite interpolation primary function. In this process, the compatibility condition was proposed. Namely is the mix-partial derivative of the function to be possible to exchange in the vertex.
     介绍了边边格式:从C~0情况入手,构造布尔和算子,通过运用[0,1]区间上的Hermite插值基函数推广到C~(N-1)的情况,在此过程中提出了相容性条件即被插函数在角点处混合偏导数可交换。
短句来源
     Thirdly, we introduce the application of the general theory about the parametric blending interpolation on triangles.
     再次,对三角形参数域上超限插值的一般理论的应用作出详尽介绍,这里首先将该理论应用到多项式布尔和超限插值,即用多项式混合函数代替有理权函数。
短句来源
     In an arbitrary, two approximation ways is presented.
     在任意三角形上还构造了布尔和逼近。
短句来源
     A new clustering algorithm CAC is presented. Compared with the existing clustering algorithms, CAC can cluster Boolean and categorical data efficiently. The experimental results show that CAC achieves a much better performance than those traditional algorithms.
     提出了一种判别布尔和分类属性相似度的准则 ,并在此基础上提出了一种新的聚类的算法CAC ,该算法克服了传统聚类算法不适合聚类布尔和分类属性数据的缺点 ,实验表明CAC算法比传统的聚类算法有更好的聚类效果
短句来源
更多       
查询“布尔和”译词为用户自定义的双语例句

    我想查看译文中含有:的双语例句
例句
为了更好的帮助您理解掌握查询词或其译词在地道英语中的实际用法,我们为您准备了出自英文原文的大量英语例句,供您参考。
  boolean sum
In this paper, the convergence rate for iterates of both q-Bernstein polynomials and their Boolean sum are estimated.
      
Discrete Jackson-type Operators via a Boolean Sum Approach
      
In the present paper we consider Jackson-type operators obtained via a Boolean sum, as studied by Cao, Gonska et al.
      
Explicit error estimates are given for the iterated Boolean sum of a sequence of simultaneous approximants; the rate of convergence is shown to be improved for smooth functions.
      
We give DeVore-Gopengauz-type inequalities for Boolean sum modifications of convolution-type operators which are based upon arbitrary positive trigonometric kernels.
      
更多          
  boolean sums
For measurable functions f of two real variables there are considered the Boolean sums
      
Neciporuk, Lamagna/Savage and Tarjan determined the monotone network complexity of a set of Boolean sums if any two sums have at most one variable in common.
      
We use our general results to explicitly construct a set of n Boolean sums over n variables whose monotone complexity is of order n5/3.
      
A new lower bound on the monotone network complexity of Boolean sums
      
Neciporuk [3], Lamagna/Savage [1] and Tarjan [6] determined the monotone network complexity of a set of Boolean sums if each two sums have at most one variable in common.
      
更多          


A new method of rational Boolean sum interpolation on an arbitrary triangle is developed in this paper. The structure of the interpolation function is simple. In case of C' interpolation, the polynomial precise set includes all polynomials of degree five or less. The approximate errors of the interpolation function are also estimated in this paper.

本文提出了一个在三角形域上的有理布尔和插值的新方法,此方法的特点是所构造的插值函数结构简单,多项式准确集较高。时于C'类插值,插值函数的多项式准确集包括所有五次或小于五次的多项式。对于插值函数本文还给出了误差估计。

A new kind of modelling tool,multi-knot-based Boolean sum surface,has

在多结点样条的基础上,作者在[6] 中,运用满足各种特殊要求插值算子的布尔和理论,研究并构造了三十余种用于计算机图像仪交互设计系统的布尔和与张量积曲面的插值与逼近格式。这些曲面可以有效地用于飞机各部件的外形设计。本文是其中的部分内容,所构造的曲面插值格式已经用于研制中的二种型号飞机的外形设计。结果表明,多结点曲面在人机交互中较之常用的插值曲面有优越之处,特别是布尔和曲面此张量积曲面具有更强的适用性。

In this paper the rational convex combination of two operator is constructed in standard tringle.In an arbitrary, two approximation ways is presented.One is Boolean sum approximation, the other is convex combination approximation,We still make discretization for two methods in an arbitrary triangle. Finally, a example is given.

本文构造了标准三角形上两个算子的有理凸组合逼近并推广到任意三角形上。在任意三角形上还构造了布尔和逼近。进而,还作了误差估计和离散化处理,最后给出了一个例子。

 
<< 更多相关文摘    
图标索引 相关查询

 


 
CNKI小工具
在英文学术搜索中查有关布尔和的内容
在知识搜索中查有关布尔和的内容
在数字搜索中查有关布尔和的内容
在概念知识元中查有关布尔和的内容
在学术趋势中查有关布尔和的内容
 
 

CNKI主页设CNKI翻译助手为主页 | 收藏CNKI翻译助手 | 广告服务 | 英文学术搜索
版权图标  2008 CNKI-中国知网
京ICP证040431号 互联网出版许可证 新出网证(京)字008号
北京市公安局海淀分局 备案号:110 1081725
版权图标 2008中国知网(cnki) 中国学术期刊(光盘版)电子杂志社