By downloading a free software program from www . worldcommunitygrid . org, participants can contribute their unused processing power during idle computing time worldcommunitygrid.org)下载免费软件,将电脑闲置时的未用尽处理能力献出作公益用途。
By downloading a free software program from www . worldcommunitygrid . org, participants can contribute their unused processing power during idle computing time worldcommunitygrid.org)下载免费软件,将电脑闲置时的未用尽处理能力献出作公益用途。
In order to make the long computing can be expediently applied to engineering, the computing time have to be decreased and the efficiency must be increased 为了使冗长的求解过程达到工程上可以接受的程度,以利于实际应用,必须缩短计算时间提高计算效率。
Compared with the results of model experiment, the present method could not only save a large amount of computing time but also give reasonable results 通过与模型试验结果进行比较,该方法不但可以节省单桩和群桩变形分析时间,而且计算结果与实测结果也比较相近。
Basing on the static aeroelasticity, the jig-shape and the attack angle design have been studied . generally, much computing time is needed in unsteady flow computation 利用现有条件自主开发出适合定常、非定常流场计算和气动弹性研究的分布式并行计算机系统。
In computing time and partitioning results this hybrid genetic algorithm's superiority was appeared compared with results derived by k-l algorithm and genetic algorithm 与k-l算法及传统遗传算法得出的结果比较,该混合式遗传算法在计算时间和划分结果上显示出其优越性。
Meanwhile, to elevate the efficiency of computation, a new method has been developed to reduce computing time by changing sample rate used during the system simulation 同时,针对cdma系统速率高的特点,提出了在不同仿真阶段采用不同的采样率的对策,取得了明显降低仿真运算量的效果。
The results demonstrated that the response surface method in structural optimization of impacting energy absorption was feasible, and had merits of high computing efficiency and short computing time 研究结果表明响应面法应用于碰撞吸能的结构优化问题上是可行的,具有提高计算效率,节省计算机叶间等优点。
Then for the computing time of the traditional pca-based face recognition algorithm is very large, we use wavelet transform to reduce the dimension of images, and decrease computation complex 针对传统pca(主分量分析)方法运算量大的特点,本文通过小波变换对输入图像进行降维处理,降低了后续算法的复杂度。
Theoretical analysis and numerical experiments show that this algorithm is faster than the divide-and-conquer of k . y . li . about 10 %-20 % computing time is lessen when the problem's scale is large enough 理论分析和数值实验均证明该算法比k.y.li算法快,在矩阵规模较大时,计算时间约可以减少10-20。