首页 | 本学科首页   官方微博 | 高级检索  
文章检索
  按 检索   检索词:      
出版年份:   被引次数:   他引次数: 提示:输入*表示无穷大
  收费全文   4篇
  完全免费   1篇
  自动化技术   5篇
  2017年   1篇
  2016年   1篇
  2008年   1篇
  2003年   1篇
  1996年   1篇
排序方式: 共有5条查询结果,搜索用时 140 毫秒
1
1.
数据手套系统中实时数据采集和图像显示的实现   总被引:1,自引:0,他引:1  
:针对虚拟现实系统数据流量大、实时要求强的特点,文章应用基于高速串口、Windows多媒体定时器和OpenGL技术的方法来实现数据手套的快速数据传输和实时图像显示,实际应用中取得了令人满意的视觉输出效果,为虚拟现实系统提供了形象生动的人机交互接口。考虑到虚拟现实技术的进一步发展,文章还介绍了一种解决更高速数据采集和实时显示任务的方案。  相似文献
2.
We propose a simple algorithm which is based on edge-coloring of system graphs for termination detection of loosely synchronous computations. The proposed algorithm is fully symmetric in that all processors run syntactically identical code and can detect global termination at the same time. Under the 1-port communication model, the algorithm is optimal in terms of termination delay, the difference between the time when a global termination occurs and the time it is detected, in a number of structures-chain, ring of even number of nodes, k-ary n-cube and k-ary n-mesh of low degree, where k is even; and near-optimal for other cases. The optimality analysis is based on results from a related problem, periodic gossiping in edge-colored graphs. This algorithm has been applied to some practical cases in which the overhead due to its execution is found to be insignificant  相似文献
3.
Power control problems for wireless communication networks are investigated in direct-sequence codedivision multiple-access (DS/CDMA) channels. It is shown that the underlying problem can be formulated as a constrained optimization problem in a stochastic framework. For effective solutions to this optimization problem in real time, recursive algorithms of stochastic approximation type are developed that can solve the problem with unknown system components. Under broad conditions, convergence of the algorithms is established by using weak convergence methods.  相似文献
4.
In this paper, we propose a simulation model to study real‐world replication workflows for cloud storage systems. With this model, we present three new methods to maximize the storage space usage during replica creation, and two novel QoS aware greedy algorithms for replica placement optimization. By using a simulation method, our algorithms are evaluated, through a comparison with the existing placement algorithms, to show that (i) a more evenly distributed replicas for a data set can be achieved by using round‐robin methods in replica creation phase and (ii) the two proposed greedy algorithms, named GS_QoS and GS_QoS_C1, not only have more economical results than those from Chen et al., but also guarantee the QoS for clients. Copyright © 2016 John Wiley & Sons, Ltd.  相似文献
5.
1
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号