ONOFF
划词翻译
导航
建议反馈
词典App

computing time中文是什么意思

  • 计算时间
  • 运算时间

"查查词典"手机版

千万人都在用的超大词汇词典翻译APP

  • 例句与用法
  • This part firstly studies the relation between spectral transmission of the optical system and the thickness of medium . then a linear search algorithm base on analysing of the shape of curve is discussed . the simulation results show that the fitting error and the computing time of the algorithm satisfy the practical measuring requirements
    本论文首先讨论了光谱透过率与各向异性介质厚度之间的数学关系,然后在分析曲线形态基础上进行全值匹配,模拟表明,该算法可以实现曲线完全拟合,拟合时间均在1秒以内,完全符合实际测量要求。
  • First , the basic theory of the competitiveness is analyzed , evaluating indexes which conclude relative and absolute indexes basic on the last literatures are set up . second , because the data are too many and computing time is too long , the competitiveness of science and technology of 30 areas are clustered using fuzzy clustering model , the areas of the whole nation are clustered several kinds and we can draw some conclusions of same kind . evaluating the competitiveness using single model can produce white noise , so combinational models which concluding neural network , fuzzy theory and genetic algorithm are brought forward to evaluate the competitiveness of areas which are in the same kind with fujian province in the test
    本文首先分析科技竞争力的基本理论,并根据以往研究科技竞争力文献,建立包含绝对指标和相对指标的评价科技竞争力评价指标体系,其次,针对评价福建省科技竞争力在全国范围内的排名情况数据较多,计算时间较长的具体情况,利用模糊神经网络模型对全国30个省市自治区科技竞争力水平进行聚类分析,将科技竞争力水平接近的地区聚为一类,得出科技竞争力水平相近地区情况,而后,针对已有文献科技竞争力评价只是利用单一模型可能产生噪声,影响评价结果,并且主观性较强的缺点,本文将神经网络、模糊数学、遗传算法等智能算法组合,利用组合评价模型对福建省和与福建省同在一类的其它地区的科技竞争力水平进行横向、纵向评价,得出福建省在全国范围内的科技竞争力水平排名。
  • Fractal coding has been proved useful for image compression . it is also proved effective for content - based image retrieval . in the paper , we present a block - constrained fractal coding scheme and a matching strategy for content - based image retrieval . in this coding scheme , an image is partitioned into non - overlap blocks of a size close to that of a query iconic image . fractal codes are generated for each block independently . in the similarity measure of fractal codes , an improved nona - tree decomposition scheme is adopted to avoid matching the fractal codes globally in order to reduce computational complexity . our experimental results show that our coding scheme and the matching strategy we adopted is useful for image retrieval , and is compared favorably with other two methods tested in terms of storage usage and computing time
    分形编码在图像压缩方面取得了很好的效果,同时,分形编码也能够用于基于内容的图像检索.本文提出了一种基于块限制的分形编码算法和匹配策略,并将它们用于图像检索.在我们编码算法中,图像会被预先分成互相不重叠的子图像块,然后对这些子图像进行独立地分形编码,从而获得整幅图像的分形码.该编码算法能够在很大程度上减少编码时间.在进行图像间相似性的匹配时,我们采用改进的基于九叉树的分配策略,从而避免全局地进行分形码的匹配,减少了计算量.实验结果说明,我们的编码算法和匹配策略能够比较有效地应用于基于内容的图像检索,在计算时间和存储时间上都优于实验中其它两种方法
  • The fuzzy hyperbolic model , a new approach for modeling of nonlinear system , is subsequently discussed for its validity . based on selecting the initial weights of neural network according to the priority of each input , the parameters can be identified by using bp neural network , which is good for reducing the randomness of initial weights and computing time . by combining self - study ability of neural network with knowledge - expression of fuzzy set theory , fuzzy neural network with self - correction of membership function is lastly constructed to make the approximation of some nonlinear functions
    同其它神经网络模型相比此模型权系数的初始值可以根据各个输入变量在模型辩识中的重要性进行选择,减少了初始权值设定的随机性,从而缩短了模型辩识时间最后利用神经网络所具有的自学习能力结合模糊控制较强的知识表达能力,构造具有自动调整模糊隶属度函数的模糊神经网络,并利用它实现非线性函数的逼近。
  • The author ' s work gives new way , which is beneficial to real time interaction and can efficiently reduce computing time as well as data storage amount . these algorithms can find good use in numerical machining , robotics , form - position tolerance and computer graphics . ( 3 ) degree reduction for nurbs curves and surfaces by applying the theory of the best uniform approximation of chebyshev polynomials and the explicit matrix representation of nurbs curves , this thesis centers on the research of the explicit nearly best approximation of multi - degree reduction of nurbs curves
    以上关于等距曲线的几何逼近与代数逼近的算法改革了当前国际图形界只能对基曲线沿法矢方向平移定距离的点作近似逼近的固定模式,创造了利于交互操作,能有效地减少计算量及数据存储量的新方法,可在数控加工、浙江大学硕士学位论文机器人、形位公差学、计算机图形学中获得很好的应用( 3 ) nurbs曲线曲面降阶应用nurbs曲线的显式矩阵表示及chebyshev多项式逼近理论,以实现nurbs曲线显式一次性降多阶的近似最佳逼近为目标进行了研究
  • Detecting feature lines from featured objects is well studied in this paper . random sample theory is used in line detection , thereby , the disadvantages brought by traditional hough transform , for instance , large computing load , long computing time , large occupied memory , and low precision are eliminated
    文中重点研究了检测特征标志物上特征直线的技术,创新地将随机采样理论运用于直线检测中,改变了以往hough变换检测直线所存在的运算时间长、占用内存空间大、精度不高等缺点。
  • Abstract : by introducing chaos state to genetic algorithm , this paper proposed a novel optimization algorithm named chaos genetic algorithm . its major measures are chaos initialization and chaos carrier wave of best fitness in population both based on the ergodicity , stochastic property and regularity of chaos . simulation results of typical complex function optimization show that chaos genetic algorithm improves the convergence and reduces the computing time greatly
    文摘:将混沌融入遗传算法提出了混沌遗传算法,该方法利用混沌运动的随机性、遍历性、对初始条件的敏感性特性进行群体的混沌初始化和最优个体的混沌变尺度载波寻优.典型复杂函数优化的仿真结果表明该方法较遗传算法具有更快的收敛速度和更小的计算量,是复杂函数优化的有效手段
  • 4 ) three - dimensional nonlinear analysis of the bottom outlet of the xiao wan arch dam is presented using sub - model techniques . the structural characteristics and failure mechanism of the bottom outlet , under loading of concrete deadweight , hydraulic pressure , internal water pressure and temperature are studied . it is shown that the meshing of the structure becomes easy and the computing time is reduced by using sub - modeling method
    4 )对小湾拱坝的1 ~ #底孔进行了三维非线性分析,研究了孔口在坝体自重、库水压力、孔内水压力和库水温度影响等作用下的孔口应力分布、混凝土开裂、裂缝发展规律以及配筋对孔口开裂和裂缝扩展的影响。
  • 更多例句:  1  2  3  4  5
  • 其他语种释义
  • 推荐英语阅读
computing time的中文翻译,computing time是什么意思,怎么用汉语翻译computing time,computing time的中文意思,computing time的中文computing time in Chinesecomputing time的中文computing time怎么读,发音,例句,用法和解释由查查在线词典提供,版权所有违者必究。
Last modified time:Fri, 15 Aug 2025 00:29:56 GMT

说出您的建议或使用心得