CORC

在结果中检索

CORC

浏览/检索结果: 共7条，第1-7条 帮助

限定条件                
已选(0)清除 条数/页：   排序方式：
Accelerating temporal action proposal generation via high performance computing 期刊论文
Frontiers of Computer Science, 2022, 卷号: 16, 期号: 4, 页码: 10
作者:  T. Wang;  S. Y. Lei;  Y. Y. Jiang;  C. Chang;  H. Snoussi
收藏  |  浏览/下载：10/0  |  提交时间：2022/06/13
Efficient optimization approach for fast GPU computation of Zernike moments 期刊论文
Journal of Parallel and Distributed Computing, 2018, 卷号: 111, 页码: 104-114
作者:  Xuan, Y. B.;  Li, D. Y.;  Han, W.
收藏  |  浏览/下载：2/0  |  提交时间：2019/09/17
Study of V/Q non-linearity in scientific CMOS sensor 期刊论文
International Journal of Grid and Distributed Computing, 2016, 卷号: 9, 期号: 6
作者:  Li, J.-L.;  Y.-F. Guo and T.-J. Lan
收藏  |  浏览/下载：11/0  |  提交时间：2017/09/11
Improvement of a universal algorithm for uniformization of chaotic pseudo-random sequences 期刊论文
Tien Tzu Hsueh Pao/Acta Electronica Sinica, 2015, 卷号: 43, 期号: 4, 页码: 753-759
作者:  Li, P.-Y.;  J.-X. Shi;  J.-L. Guo;  X. Chen and H.-J. Yang
收藏  |  浏览/下载：11/0  |  提交时间：2016/08/24
Micro-scale modelling challenges in electric field assisted capillarity 会议论文
12th International Symposium on Distributed Computing and Applications to Business, Engineering and Science, DCABES 2013, September 2, 2013 - September 4, 2013, London, United kingdom, September 2, 2013 - September 4, 2013
Tonry C. E. H.; Patel M. K.; Bailey C.; Desmuliez M. P. Y.; Yu W.
收藏  |  浏览/下载：9/0  |  提交时间：2014/05/15
An efficient discrete particle swarm algorithm for task assignment problems (EI CONFERENCE) 会议论文
2009 IEEE International Conference on Granular Computing, GRC 2009, August 17, 2009 - August 19, 2009, Nanchang, China
Yang Q.; Zhang C.; Wang C.
收藏  |  浏览/下载：12/0  |  提交时间：2013/03/25
Task Assignment Problems (TAPs) in distributed computer system are general NP-hard and usually modeled as integer programming discrete problems. Many algorithms are proposed to resolve those problems. Discrete particle swarm algorithm (DPS) is a newly developed method to solve constraint satisfaction problem (CSP) which has advantage on search capacity and can find more solutions. We proposed an improved DPS to solve TAP in this paper. DPS has a special operator namely coefficient multiplying speed  which is designed for CSP but does not exist in other discrete problems. Thus we redefined a coefficient multiplying speed operator with probability selection. We analyzed the speed and position updating formula then we derived a refined position updating formula. Several experiments are carried out to test our DPS. Experimental results show that our algorithm has more efficient search capacity  higher success rate  less running time and more robust.  
Alliance-oriented security architecture and technologies in collaborative e-commerce system (EI CONFERENCE) 会议论文
20th IASTED International Conference on Parallel and Distributed Computing and Systems, PDCS 2008, November 16, 2008 - November 18, 2008, Orlando, FL, United states
Si H.; Fang Z.; Yin Y.; Zhao H.
收藏  |  浏览/下载：19/0  |  提交时间：2013/03/25
Collaborative commerce and design environment is characterized by of its numerous users  massive resources and dynamic change. In order to solve security problems coming from multi-domain  heterogeneity and dynamics  the security architecture for collaborative commerce and design environment was constructed throuth adoptting Internet Protocol Security(IPSec)  Secure Socket Layer(SSL)  Simple Object Access Protocol Security(SOAPSec). The enabling technologies including IPSec-based Virtual Private Net(VPN)  secure e-commence and cooperation framework  digital authentication and encryption of data were discussed in detail. The architecture and the enabling technologies provided the security mechanism amongst the partners to realize business collaboration  design collaboration in network business pattern.  

©版权所有 ©2017 CSpace - Powered by CSpace