The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)最新文献

筛选
英文 中文
Reliability enhancement of computer software 提高计算机软件的可靠性
Shrija Garnaik, T. Gayen, Samaresh Mishra
{"title":"Reliability enhancement of computer software","authors":"Shrija Garnaik, T. Gayen, Samaresh Mishra","doi":"10.1109/JCSSE.2013.6567354","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567354","url":null,"abstract":"Reliability is always important in all systems but sometimes it is more important than other quality attributes, especially in mission critical systems where the severity of consequence resulting from failure is very high. Hence, it is important to develop comprehensive techniques for developing reliable software. But, it is found that there exist no suitable model to enhance the reliability of software for diverse operating environment and also it is difficult to develop a fully reliable software for all applications. Considering these aspects this paper proposes an effective approach to enhance the reliability of software by minimizing the operational errors (like overflow etc.) caused during the execution of any program.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"102 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124149696","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
Solving Sudoku puzzles with node based Coincidence algorithm 用基于节点的巧合算法求解数独
Kiatsopon Waiyapara, Warin Wattanapornprom, P. Chongstitvatana
{"title":"Solving Sudoku puzzles with node based Coincidence algorithm","authors":"Kiatsopon Waiyapara, Warin Wattanapornprom, P. Chongstitvatana","doi":"10.1109/JCSSE.2013.6567311","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567311","url":null,"abstract":"In Evolutionary computation, Sudoku puzzles are categorized as hard combinatorial problems. It is almost impossible to solve these puzzles using only native operations of genetic algorithms. This article presents an application of Coincidence algorithm, which is an Estimation of distribution algorithms in the class of evolutionary computation that can outperform traditional algorithms on several combinatorial problems. It makes use of both positive and negative knowledge for solving problems. The proposed method is compared with the current best known method. It significantly outperforms problem-specific GA to solve easy, medium, and hard level of Sudoku puzzles.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116940968","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 the parallel simulation of magnetic targeting of nanoparticles in capillaries 纳米颗粒在毛细血管中的磁性靶向平行模拟
C. Chantrapornchai, B. Dolwithayakul
{"title":"On the parallel simulation of magnetic targeting of nanoparticles in capillaries","authors":"C. Chantrapornchai, B. Dolwithayakul","doi":"10.1109/JCSSE.2013.6567339","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567339","url":null,"abstract":"We develop a parallel algorithm, by using CUDA, for calculating the concentration of multifunctional magnetic nanoparticles in capillaries under the influences of magnetic force, blood flow and diffusion process. The task of computing particle, concentration on the considered plane is distributed to computational threads. The continuity equation describing the time rate of change of the multifunctional particle concentration in each small element on the considered plane is solved via the explicit finite different method. The simulation results show the distributions of particle concentration on the focused plane in the blood vessel which are useful visualization for the biomedical researchers. The performance of parallel computing is also examined.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130978278","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
Effects of enrollment templates count on iris recognition performance using reliable bits 注册模板计数对使用可靠位的虹膜识别性能的影响
Sheikh Ziauddin, Sajida Kalsoom
{"title":"Effects of enrollment templates count on iris recognition performance using reliable bits","authors":"Sheikh Ziauddin, Sajida Kalsoom","doi":"10.1109/JCSSE.2013.6567314","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567314","url":null,"abstract":"Biometric authentication is among the most convenient, reliable and secure techniques for human identification and recognition. In general, iris-based biometric systems provide very good results in terms of recognition accuracy but, as the noise in input images increases, the performance of these systems starts to fall down. Using multiple templates at enrollment time can be very effective for improving recognition accuracy in noisy iris image datasets. In this paper, we introduce techniques to generate a more reliable final template from multiple enrollment templates. Our experiments with CASIA 1, CASIA 3 and BATH iris image datasets show that recognition performance is significantly improved using the proposed techniques.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122356832","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}
引用次数: 1
Monomial forms of two generalized ball curves and their proofs 两个广义球曲线的单项式形式及其证明
Dilokvith Savetseranee, N. Dejdumrong
{"title":"Monomial forms of two generalized ball curves and their proofs","authors":"Dilokvith Savetseranee, N. Dejdumrong","doi":"10.1109/JCSSE.2013.6567351","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567351","url":null,"abstract":"There are several methods used to construct curves in CAGD, e.g., the de Casteljau's algorithm, Wang algorithm, Said-Ball algorithm. However, they are represented in the forms that are not suitable for performing geometric modeling. A proposed approach for evaluating Said-Ball and Wang-Ball curves by using monomial form was introduced by Aphirukmatakun and Dejdumrong in 2009. The authors did not provide any proofs for their propositions. Thus, this paper shows the proofs for the conversions from Said-Ball polynomials into its monomial form as well as that of the Wang-Ball polynomials.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"202 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129338664","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}
引用次数: 4
Performance comparison of the diskless technology 无磁盘技术性能比较
Kulthida Phanpikhor, Suchart Khummanee, P. Songram, C. Jareanpon
{"title":"Performance comparison of the diskless technology","authors":"Kulthida Phanpikhor, Suchart Khummanee, P. Songram, C. Jareanpon","doi":"10.1109/JCSSE.2013.6567327","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567327","url":null,"abstract":"Currently, the traditional disk-full technology will be replaced by the diskless technology because of its advantage such as controlling from the Central Control System, managing large number of computer systems, reducing the redundancy of computer system, reducing the energy consumption and costs. However, the disadvantage of diskless technology is slow speed when lot of client machines boot to ready state. This research is proposed with the architectural and structural design of the diskless technology on Ethernet topology and tested the efficiency algorithm with the boot up time. From the result, we found that the link aggregation structural connections shows the high performance in term of the minimum average of times.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115627039","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}
引用次数: 1
Evolutionary training of a q-Gaussian radial basis functional-link nets for function approximation 用于函数逼近的q-高斯径向基函数链网络的进化训练
Nipotepat Muangkote, K. Sunat, S. Chiewchanwattana
{"title":"Evolutionary training of a q-Gaussian radial basis functional-link nets for function approximation","authors":"Nipotepat Muangkote, K. Sunat, S. Chiewchanwattana","doi":"10.1109/JCSSE.2013.6567320","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567320","url":null,"abstract":"In this paper, radial basis functional-link nets (RBFLNs) based on a q-Gaussian function is proposed. In order to enhance the generalization performance of a modified radial basis function neural network and enhance the performance of the new network, the evolutionary algorithm named real-coded chemical reaction optimization (RCCRO), is presented for training the new network. A developed RCCRO, has been shown to perform well in many optimization problems. A RCCRO is employed to select the non-extensive entropic index q and the other parameters of the network. The experimental results of the function approximation show that the proposed approach can improve the performance of RBFLNs.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128073137","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
CE-Stream : Evaluation-based technique for stream clustering with constraints CE-Stream:基于评估的约束流聚类技术
Tossaporn Sirampuj, Thanapat Kangkachit, Kitsana Waiyamai
{"title":"CE-Stream : Evaluation-based technique for stream clustering with constraints","authors":"Tossaporn Sirampuj, Thanapat Kangkachit, Kitsana Waiyamai","doi":"10.1109/JCSSE.2013.6567348","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567348","url":null,"abstract":"Large number of stream clustering techniques have been proposed in recent years. However, these techniques still lack of using background knowledge which are available from domain expert. In this paper, CE-Stream, an incremental method for stream clustering by using background knowledge as constraints is proposed. Instance-level constraint operators are introduced to support evolving characteristics of dynamic constraints i.e. constraint activation, fading and outdating. Constraint operators seamlessly integrate into E-Stream to check active and update constraints and prioritize constraints. Likewise, CE-Stream reduces an excessive splitting during clustering process. Compared to E-Stream, experimental results show that CE-Stream give better clustering performance in terms of both cluster quality and execution-time.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"73 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122798040","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
Ripple algorithm: An LTE load balance mechanism with distributed and heuristic approach Ripple算法:一种采用分布式和启发式方法的LTE负载平衡机制
Withawat Tangtrongpairoj, Aphirak Jansang, A. Phonphoem
{"title":"Ripple algorithm: An LTE load balance mechanism with distributed and heuristic approach","authors":"Withawat Tangtrongpairoj, Aphirak Jansang, A. Phonphoem","doi":"10.1109/JCSSE.2013.6567329","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567329","url":null,"abstract":"The Long Term Evolution (LTE) has been proposed for supporting higher bandwidth applications and large amount of users by installing many base stations known as eNodeBs. However, in an area, users may associate with some particular eNodeBs which may cause the unbalanced load distribution. In this paper, a heuristic load balance algorithm called Ripple Algorithm has been proposed. The algorithm is designed as a distributed algorithm without global knowledge assumption. The results show that the algorithm can perform well in many testing scenarios with low complexity.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"31 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131525360","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}
引用次数: 1
Scaling HPC Clusters with volunteer computing for data intensive applications 通过志愿者计算扩展HPC集群,用于数据密集型应用
E. Kijsipongse, S. U-ruekolan
{"title":"Scaling HPC Clusters with volunteer computing for data intensive applications","authors":"E. Kijsipongse, S. U-ruekolan","doi":"10.1109/JCSSE.2013.6567334","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567334","url":null,"abstract":"Due to the computational demand of data intensive applications, parallel computer hardware such as the HPC Cluster system is required to execute such the applications. However, building large HPC Clusters for this sole purpose is not always feasible or even not cost-effective since the purchasing, operational and maintenance cost of' the dedicated systems is too high but they are not fully utilized in most of the time. In this regard, Volunteer Computing can address this problem as it provides a large amount of computing resources at no cost. We develop a system that expands the computing capability of HPC Clusters by using the additional computing power donated by volunteer users who would like to give the computing resources of their unused desktop computers to help execute jobs in the HPC Clusters. The proposed system can combine the native Cluster compute nodes and a set of' non-dedicated compute nodes contributed by volunteers. The experiments demonstrate that the volunteer resources, such as CPU time, disk storage and GPU, can be seamlessly integrated into the HPC Clusters allowing the systems to dynamically scale up/down regarding to the amount of resources in Volunteer Computing.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-05-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121349979","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
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信