排序方式: 共有20条查询结果,搜索用时 15 毫秒
1.
2.
为了解决传统资源发现机制不能很好地适应网格资源环境的问题,在有效组建网格资源虚拟组织的基础上,提出了资源虚拟组织中联系结点的选取原则和选取算法,通过该算法从具有相同资源类型的联系结点中选出管理结点.联系结点和管理结点之间采用类似二部图的方式进行连接,构成基于动态自组织覆盖架构的网格资源发现模型.从资源发现能力、资源发现效率和系统可扩展性等方面对该模型进行了综合评价,结果显示该模型适合网格资源的特征,在大规模网格系统中能够有效提高资源发现性能,仿真实验验证了该模型的有效性. 相似文献
3.
The feature space extracted from vibration signals with various faults is often nonlinear and of high dimension.Currently,nonlinear dimensionality reduction methods are available for extracting low-dimensional embeddings,such as manifold learning.However,these methods are all based on manual intervention,which have some shortages in stability,and suppressing the disturbance noise.To extract features automatically,a manifold learning method with self-organization mapping is introduced for the first time.Under the non-uniform sample distribution reconstructed by the phase space,the expectation maximization(EM) iteration algorithm is used to divide the local neighborhoods adaptively without manual intervention.After that,the local tangent space alignment(LTSA) algorithm is adopted to compress the high-dimensional phase space into a more truthful low-dimensional representation.Finally,the signal is reconstructed by the kernel regression.Several typical states include the Lorenz system,engine fault with piston pin defect,and bearing fault with outer-race defect are analyzed.Compared with the LTSA and continuous wavelet transform,the results show that the background noise can be fully restrained and the entire periodic repetition of impact components is well separated and identified.A new way to automatically and precisely extract the impulsive components from mechanical signals is proposed. 相似文献
4.
5.
6.
广域网中分布自组织Cache系统的研究 总被引:1,自引:0,他引:1
陈君 《北京邮电大学学报》1999,22(4):45-49
将Cache技术与主动网络结合,提出了一种新颖的具有有限半径的分布自组织Cache系统,首次提出了相邻Cache树的概念及其生成算法,分析了相邻Cache树增加的最大最小存储代价,对内存分配和响应时延之间的关系进行了理论计算,证明了内存分配的最佳平衡点的存在性,并给出了一般的求解方法。 相似文献
7.
8.
9.
10.