15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)最新文献_第6页

Padding free bank conflict resolution for CUDA-based matrix transpose algorithm 基于cuda的矩阵转置算法的无填充银行冲突解决

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-08-01 DOI: 10.1109/SNPD.2014.6888709

A. Khan, M. Al-Mouhamed, Allam Fatayar, A. Almousa, A. Baqais, M. Assayony

{"title":"Padding free bank conflict resolution for CUDA-based matrix transpose algorithm","authors":"A. Khan, M. Al-Mouhamed, Allam Fatayar, A. Almousa, A. Baqais, M. Assayony","doi":"10.1109/SNPD.2014.6888709","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888709","url":null,"abstract":"Matrix Transposition is an important linear algebra procedure that has deep impact in various computational science and engineering applications. Several factors hinder the expected performance of large matrix transpose on Graphic Processing Units (GPUs). The degradation in performance involves the memory access pattern such as coalesced access in the global memory and bank conflict in the shared memory of streaming multiprocessors within the GPU. In this paper, two matrix transpose algorithms are proposed to alleviate the aforementioned issues of ensuring coalesced access and conflict free bank access. The proposed algorithms have comparable execution times with the NVIDIA SDK bank conflict - free matrix transpose implementation. The main advantage of proposed algorithms is that they eliminate bank conflicts while allocating shared memory exactly equal to the tile size (T × T) of the problem space. However, to the best of our knowledge an extra space of Tx(T +1) needs to be allocated in the published research. We have also applied the proposed transpose algorithm to recursive Gaussian implementation of NVIDIA SDK and achieved about 6% improvement in performance.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131693998","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 6

On simplification of chaotic neural network on incremental learning 增量学习下混沌神经网络的简化

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888706

Toshinori Deguchi, Toshiki Takahashi, N. Ishii

引用次数: 3

Consideration of cross-validation in estimating objective scores of answer statements posted at Q&A sites 在评估问答网站上发布的答案陈述的客观分数时考虑交叉验证

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888719

Yuya Yokoyama, T. Hochin, Hiroki Nomiya

{"title":"Consideration of cross-validation in estimating objective scores of answer statements posted at Q&A sites","authors":"Yuya Yokoyama, T. Hochin, Hiroki Nomiya","doi":"10.1109/SNPD.2014.6888719","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888719","url":null,"abstract":"To eliminate mismatches between the intentions of questioners and respondents of Question and Answer (Q&A) sites, we have clarified that the impression of the statements could be captured by nine factors, and the factor scores could be estimated from the feature values of the statements. Objective scores of the statements could be estimated fairly good, and that those of subjective statements could be estimated well by taking the natural logarithm of the factor scores. This result, however, is likely to estimate inaccurate values due to overfitting to the explanatory variables. This could result from not having considering cross-validation through the attempts. This paper tries to perform multiple regression analysis with the consideration of cross-validation. For statements of Yahoo! Auction, PC and love counseling & human relationships, respective five trials have been attempted. As a result, most of the attempts show good or fairly good estimation accuracy. It is suggested that estimation errors should be reduced.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127013386","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A self-tuned bat algorithm for optimization in radiation therapy treatment planning 放射治疗方案优化的自调谐蝙蝠算法

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888747

G. Kalantzis, Y. Lei

{"title":"A self-tuned bat algorithm for optimization in radiation therapy treatment planning","authors":"G. Kalantzis, Y. Lei","doi":"10.1109/SNPD.2014.6888747","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888747","url":null,"abstract":"The performance of any optimization algorithm largely depends on the setting of its algorithm-dependent parameters. Swarm intelligence algorithms are popular methods in optimization since they have been proved very efficient. One drawback of those methods though, is that the appropriate setting of the algorithm-dependent parameters has a significant impact on the algorithm's performance. The “parameter tuning” of an algorithm in such a way to be able to find the optimal solution by using the minimum number of iterations, quite often is a difficult and time consuming task depending on the optimization problem. Essentially this is a hyper-optimization problem, that is, the optimization of the optimization algorithm. In this paper, a novel self-tuned metaheuristic algorithm is presented for optimization in radiation therapy treatment planning. The proposed Self-Tuned Bat Algorithm (STBA) finds itself the optimal set of algorithm-dependent parameters and therefore minimizes the number of iterations required for the optimization to reach sub-optimal solution. The applicability of the proposed algorithm is demonstrated in the optimization of a prostate case using intensity modulation radiation therapy (IMRT).","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124701549","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 5

Modeling web application for cross-browser compatibility testing 为跨浏览器兼容性测试建模web应用程序

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888745

Xinxin Li, Hong-wei Zeng

引用次数: 6

Design patterns applied for networked first person shooting game programming 设计模式适用于网络第一人称射击游戏编程

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888715

Junfeng Qu, Yong Wei, Yinglei Song

引用次数: 3

VMKit: Improving design and performance of Managed Runtime Environments VMKit:改进托管运行时环境的设计和性能

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888673

B. Folliot

引用次数: 0

Security and privacy protocol for emerging smart RFID applications 新兴智能RFID应用的安全和隐私协议

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888694

M. Sadikin, M. Kyas

{"title":"Security and privacy protocol for emerging smart RFID applications","authors":"M. Sadikin, M. Kyas","doi":"10.1109/SNPD.2014.6888694","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888694","url":null,"abstract":"The raise of smart RFID technology (i.e. sensor integration to RFID system) has introduced various advantages in the context of location awareness applications, reaching from low cost implementation and maintenance, to its flexibility to support large-scale system. Nevertheless, the use of such technology introduces tremendous security and privacy issues (e.g. unauthorized tracking, information leakage, cloning attack, data manipulation, collision attack, replay attack, Denial-of-Service, etc.). On the other hand, the constrained nature of RFID application makes the security enforcement is more complicated. This paper presents IMAKA-Tate: Identity protection, Mutual Authentication and Key Agreement using Tate pairing of Identity-based Encryption method. It is designed to tackle various challenges in the constrained nature of RFID applications by applying a light-weight cryptographic method with advanced-level 128 bit security protection. Indeed, our proposed solution protects the RFID system from various threats, as well as preserves the privacy by early performing encryption including the identity even before the authentication is started.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130537434","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 11

Dynamic artificial immune system and its application to File Transfer Scheduling optimization 动态人工免疫系统及其在文件传输调度优化中的应用

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888674

Milad Dastan Zand, M. Kalantari, S. Golzari

{"title":"Dynamic artificial immune system and its application to File Transfer Scheduling optimization","authors":"Milad Dastan Zand, M. Kalantari, S. Golzari","doi":"10.1109/SNPD.2014.6888674","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888674","url":null,"abstract":"There are different theories and models in natural immune system, so computer science researchers have created various algorithms to simulate processes of immune system, such as immune network based models, negative selection, and clonal selection. In this paper a novel dynamic clonal selection algorithm has been used to solve File Transfer Scheduling optimization problem. In proposed algorithm, the parameters of clonal selection algorithm will be changed over generations with hope of decreasing run-time, and at the same time the performance of the algorithm remains at an acceptable level. Then after some generations a population control strategy handles the size of antibody population. Antibodies have been created such that, the degree of simultaneous sending of files be maximized for a given transfer sequence of files. This causes make-span of schedule be minimized for that sequence. The proposed algorithm has been examined on these problems with different sizes. The results of experiments show that, the rate of reaching to global optimum is acceptable.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"111 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121350150","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Risk assessment quantification in life log service 生命日志服务中的风险评估量化

15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD) Pub Date : 2014-06-01 DOI: 10.1109/SNPD.2014.6888723

S. Tanimoto, Ken Takahashi, Taro Yabuki, Kazuhiko Kato, M. Iwashita, Hiroyuki Sato, Atsushi Kanai

{"title":"Risk assessment quantification in life log service","authors":"S. Tanimoto, Ken Takahashi, Taro Yabuki, Kazuhiko Kato, M. Iwashita, Hiroyuki Sato, Atsushi Kanai","doi":"10.1109/SNPD.2014.6888723","DOIUrl":"https://doi.org/10.1109/SNPD.2014.6888723","url":null,"abstract":"A Life Log Service that handles action records, such as an individual search logs and data on shoppers' browsing and buying habits, have attracted attention with the spread of the Internet. Life Log Service is thought to present various risks to private information, such as personal information. For this reason, countermeasures to these risks need to be investigated. We have already qualitatively analyzed the risks of life log services. To extract the specific risks of using a life log service comprehensively, we used a Risk Breakdown Structure (RBS), which is the typical risk-analysis method. Furthermore, after risks were analyzed, concrete countermeasures were proposed. However, these results need to be quantitatively evaluated from a more practical viewpoint. In this paper, the validity is visualized by performing quantitive risk assessment on the proposed countermeasures for risks in the life log obtained in our previous research. Specifically, the risk value based on a risk formula is computed to a risk factor and its proposed countermeasures. Thereby, the effects of the proposed countermeasures on risks of the life log service found in previous research are evaluated quantitatively, and this will contribute to spreading and promoting the life log service.","PeriodicalId":272932,"journal":{"name":"15th IEEE/ACIS International Conference on Software Engineering, Artificial Intelligence, Networking and Parallel/Distributed Computing (SNPD)","volume":"642 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132893002","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":0,"RegionCategory":"","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 2