排序方式: 共有108条查询结果,搜索用时 48 毫秒
81.
软硬件划分是软硬协同设计中的一个关键问题。针对单处理器嵌入式系统 ,给出了基于遗传算法的解决方案 ,并引入了模拟退火和按概率选择两种技术。结果表明 ,算法有效地解决了软硬件划分问题 ,稳定性好、效率高 ,模拟退火和按概率选择的引入 ,进一步提高了算法效率 ,保证了算法的自适应性及结果的全局最优性。 相似文献
82.
用拼接法划分网格,并运用基于消息传递的并行软件平台PVM分配计算任务,实现了较大规模的三维超声速钝头体底部流场的并行数值模拟。结果表明,底部压强特性与实验符合较好,流场的拓扑结构合理。 相似文献
83.
通过选取合适的离散时间间隔,解决了大密度、弹性常数差界面上时域有限差分(FDTD)算法的不稳定现象。进而采用改进的O(2,4)精度FDTD算法,计算了由空气中二维周期钢管正方阵列组成的晶格常数为103mm的声子晶体的Г Х方向禁带,计算结果与测试结果吻合较好。 相似文献
84.
用有限体积法求解三维完全气体的Navier-Stokes方程,并将通量守恒的分区计算方法和B-L湍流模型修正结合在一起,捕捉到了间断处的分离涡、激波、膨胀波等流场信息 相似文献
85.
86.
现实世界中的图往往在结点和边上包含描述信息,可达性查询是图数据管理和挖掘中的基本操作之一。针对图数据中标签约束的可达性计算问题,提出一种基于递归划分的可达性计算方法 RP-Hop。该算法基于层次划分思想,利用独立集性质,在保持标签和可达性前提下对大规模图进行递归划分,并结合贪婪扩展思想和递归编码,为标签约束的可达性查询提供压缩索引。经过合成和真实数据集上的实验,结果表明,RP-Hop算法不仅降低了索引大小和构建时间,而且提高了查询效率。 相似文献
87.
88.
《防务技术》2014,10(1):76-81
The accurate research on the hydrodynamics of unmanned underwater vehicle (UUV), which moves close to the sea bottom, has a great significance for its maneuverability. The structured grid of the computational models with different distances to the sea bottom and attack angles is generated by Ansys ICEM, and the flow field near the sea bottom is simulated using CFX. The characteristics of the drag, lift, pitching moment influenced by the distance to sea bottom and the attack angle are studied. The result shows that the drag coefficient increases with the decrease of distance, while it increases with the increase of attack angle. There exists attraction force when UUV moves close to the sea bottom, and the attraction force increases with the decrease in distance. The lift coefficient increases with the increase in attack angle. The absolute value of the pitching moment coefficient increases with the decrease in distance and the increase in attack angle. 相似文献
89.
90.
For a given set S of nonnegative integers the partitioning problem asks for a partition of S into two disjoint subsets S1 and S2 such that the sum of elements in S1 is equal to the sum of elements in S2. If additionally two elements (the kernels) r1, r2 ∈ S are given which must not be assigned to the same set Si, we get the partitioning problem with kernels. For these NP‐complete problems the authors present two compound algorithms which consist both of three linear greedylike algorithms running independently. It is shown that the worst‐case performance of the heuristic for the ordinary partitioning problem is 12/11, while the second procedure for partitioning with kernels has a bound of 8/7. © 2000 John Wiley & Sons, Inc. Naval Research Logistics 47: 593–601, 2000 相似文献