发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Building a cloud-based MOG game server 构建基于云的MOG游戏服务器
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567335
Kanwara Chanthaphram, Watcharachai Buranapinyo, Orachun Udomkasemsub, T. Achalakul
{"title":"Building a cloud-based MOG game server","authors":"Kanwara Chanthaphram, Watcharachai Buranapinyo, Orachun Udomkasemsub, T. Achalakul","doi":"10.1109/JCSSE.2013.6567335","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567335","url":null,"abstract":"To help SMEs game service provider in supporting a large-scale of multi-players online games (MOGs), a distributed game server deployed in multiple zones has been widely used. Because of the demand of MOGs is dynamically changing over time, game system in some zones may experience the server overloads. Existing load balancing algorithm has been implemented to solve this problem by transferring the workload to under-loaded servers. However, in some cases, the service can still be interrupted due to the limitation in the total numbers of servers. To address this problem, we design and implement a connection scheduling method for an elastic game server system with a load balancing capability. A public cloud will be used for deployment in combination with a private cloud. The experimental server allows the continuity in supporting an increased number of clients. Our experimental results show that our distributed server system is able to reduce the response time of game playing experience with a high level of client satisfaction.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"28 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":"122166251","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
Image authentication and recovery using wavelet-based multipurpose watermarking 基于小波的多用途水印图像认证与恢复
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567315
Lung-Jen Wang, Ming-Yuan Syue
{"title":"Image authentication and recovery using wavelet-based multipurpose watermarking","authors":"Lung-Jen Wang, Ming-Yuan Syue","doi":"10.1109/JCSSE.2013.6567315","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567315","url":null,"abstract":"In this paper, a multipurpose image watermarking method based on the wavelet transform is proposed for content authentication and recovery of the tampered regions. In the proposed method, the original image is first divided into nonoverlapping blocks and each block is transformed into the wavelet domain. The image features are subsequently extracted from the lowest-frequency coefficients of each block as the first embedded watermark. Next, the whole image is decomposed into the two-level wavelet transform and the orientation adjustment is calculated based on the wavelet coefficients in the middle-frequency subbands for image authentication. In addition, a logo watermark is embedded into the given middle-frequency subbands. Therefore, the copyright and feature of the image can be held on after two different watermarks are embedded. Experimental results show that the proposed method is efficiency for accurate detection of tampered regions and recovery of estimated image.","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":"128046070","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
A Thai word pronunciation simulator based on DFT analysis and GA search 基于DFT分析和遗传算法搜索的泰语单词发音模拟器
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567309
Chenbo Liu, Anilkumar Kothalil Gopalakrishnan
{"title":"A Thai word pronunciation simulator based on DFT analysis and GA search","authors":"Chenbo Liu, Anilkumar Kothalil Gopalakrishnan","doi":"10.1109/JCSSE.2013.6567309","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567309","url":null,"abstract":"This paper aims to present and discuss the concept of a Thai word pronunciation simulator based on DFT (Discrete Fourier Transform) analysis and GA (Genetic Algorithm) search. By DFT analysis, the simulator converts the sound of a Thai word from a foreign leaner into its frames to get sound segments. The GA search on the sound segments generates a highest similarity sound value with a standard Thai sound. The GA search is supported by a library of original Thai word sounds. Once the simulator generates a real pronunciation of the leaner's word, it will store the sound data to train the user. The simulations presented in this paper indicate that the proposed approach is one of the most effective strategies of structuring a language trainer.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"54 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":"114578316","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
Enhancing modified cuckoo search by using Mantegna Lévy flights and chaotic sequences 利用Mantegna l<s:1>飞行和混沌序列增强改进布谷鸟搜索
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567319
Patchara Nasa-Ngium, K. Sunat, S. Chiewchanwattana
{"title":"Enhancing modified cuckoo search by using Mantegna Lévy flights and chaotic sequences","authors":"Patchara Nasa-Ngium, K. Sunat, S. Chiewchanwattana","doi":"10.1109/JCSSE.2013.6567319","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567319","url":null,"abstract":"In this paper, we present an improvement of the modified cuckoo search (MCS) method. We focus on a new nest generation from the top nest group. This group of nests assists a better local search. We use Tent map chaotic sequences to replace the constant parameter, inverse golden ratio of MCS. This process aims to find a better solution in case of multi-modal problems. The Cauchy Lévy distribution is replaced by Mantegna Lévy distribution generation. This process assists in finding a better solution in case of uni-modal problems. To construct a more suitable with wider optimization problems and good convergence property, these two concepts are combined together as Improved MCS with Chaotic Sequences algorithm (ICMCS). The proposed algorithm is verified using nineteen constrained optimization problems. The performance of the proposed algorithm is compared with the original MCS algorithms. The optimal solutions obtained in this study are more superior to MCS.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"17 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":"129537841","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}
引用次数: 24
Aspect-aware bytecode combinators for a dynamic AOP system with invokedynamic 带有invokedynamic的动态AOP系统的方面感知字节码组合器
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567353
Santi Nopnipa, Chanwit Kaewkasi
{"title":"Aspect-aware bytecode combinators for a dynamic AOP system with invokedynamic","authors":"Santi Nopnipa, Chanwit Kaewkasi","doi":"10.1109/JCSSE.2013.6567353","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567353","url":null,"abstract":"This paper presents a weaving implementation named Aspect-Aware Bytecode Combinators (AABC) to help optimization of the dynamic AOP using invokedynamic, which has been included in the JVM since Java 7. The main contribution of this paper is to demonstrate how a dynamic AOP system could be developed with invokedynamic. This paper discusses 4 common kinds of advice, which are supported by AABC. They are before, after, around and after-return advice. This paper argues that filterArguments and filterReturnValue natively supported by the JVM are not suitable to use as the weaving mechanism as they have incorrect semantic to implement AOP advice. It is also found that they have some performance overheads to serve as the weaving mechanism. Thus, this paper presents a new set of bytecode combinators, named AABC, which are carefully designed to match the semantic of the pointcut-advice model of AspectJ. The experimental results showed that performance of AABC in the before advice experiment is faster than the standard bytecode combinators. In addition, the paper demonstrated that the around advice can be successfully implemented using MethodHandle supported in Java 7.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"19 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":"114268728","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}
引用次数: 3
Application of Node Based Coincidence algorithm for flow shop scheduling problems 基于节点的符合算法在流水车间调度问题中的应用
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567318
Ornrumpha Srimongkolkul, P. Chongstitvatana
{"title":"Application of Node Based Coincidence algorithm for flow shop scheduling problems","authors":"Ornrumpha Srimongkolkul, P. Chongstitvatana","doi":"10.1109/JCSSE.2013.6567318","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567318","url":null,"abstract":"This work proposes an algorithm called Node Based Coincidence algorithm (NB-COIN) focusing on total flowtime minimization in the permutation flowshop scheduling problems. Many algorithms have been proved to be effective for this problem. However, in the real situation, cost of computation becomes an important factor. NB-COIN produces reasonable solutions using a lot less computation power than other algorithms in consideration. Compared to a number of wellknown algorithms, the results show that NB-COIN is an effective algorithm which generates less than 1.7% different from recently best known solutions from Taillard's benchmark instances.","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":"122560993","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
Switch adjusting on hierarchical shuffle-exchange networks for all-to-all personalized exchange 在分层洗牌交换网络上进行开关调整，以实现所有到所有的个性化交换
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567331
Parichat Narksith, J. Werapun
{"title":"Switch adjusting on hierarchical shuffle-exchange networks for all-to-all personalized exchange","authors":"Parichat Narksith, J. Werapun","doi":"10.1109/JCSSE.2013.6567331","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567331","url":null,"abstract":"The original all-to-all personalized exchange algorithms were introduced for static interconnection networks (i.e., hypercube, mesh, and torus). Later, the all-to-all personalized exchange methods were extended for dynamic interconnection networks or MINs (Multistage Interconnection Networks i.e., omega (or shuffle exchange), flip, cube, and baseline) with N = 2n (= 4, 8, 16, 32, ...). Recently, the generalized all-to-all personalized exchange algorithm was designed for shuffle-exchange networks with even N (= 4, 6, 8, 10, ...). However, for a hierarchical shuffle-exchange network, those existing algorithms cannot be directly applied. This paper introduces such a hierarchical MIN along with switch-adjusting function, operated by shift logic in O(1), for applying all-to-all personalized exchange and other parallel point-to-point permutations successfully. Finally, correctness of our switch adjusting on hierarchical shuffle-exchange networks is verified for all-to-all personalized exchange permutations.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"17 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":"123940206","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
Parallel additive implementation for modified FIRS 改进FIRS的并行加法实现
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567332
Phoonlarp Mekraksakit, Thanisorn Thanapongsapak, Chawin Wongchindakhun, A. Surarerks
{"title":"Parallel additive implementation for modified FIRS","authors":"Phoonlarp Mekraksakit, Thanisorn Thanapongsapak, Chawin Wongchindakhun, A. Surarerks","doi":"10.1109/JCSSE.2013.6567332","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567332","url":null,"abstract":"Many non-standard radix number representation systems have been proposed in order to speed up the computational time. The most famous system is the signed-digit number representation system of Avizienis. This is a redundancy system (i.e., at least one number can have more than one representation.) Redundancy property can be realized as a fast computation by using the parallel process. In this work, we consider a flexible interval representation system (FIRS) which can represent an interval as one sequence of digits. This paper proposes a solution for parallel additive operation together with the proof of correctness. Our work also includes a study of implementation in practical.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"34 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":"124559099","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
Conversion from an arbitrary curve into a Bézier curve with the least degree using constrained economization of Chebyshev polynomials 利用切比雪夫多项式的约束节约，将任意曲线转化为最小次的bsamzier曲线
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567350
Rattikarn Jaroensawad, N. Dejdumrong
{"title":"Conversion from an arbitrary curve into a Bézier curve with the least degree using constrained economization of Chebyshev polynomials","authors":"Rattikarn Jaroensawad, N. Dejdumrong","doi":"10.1109/JCSSE.2013.6567350","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567350","url":null,"abstract":"In this paper, we present a new method used for the transformation of a set of discrete points into an analogous Bézier curve. Two algorithms for degree reduction of Bézier curves are then introduced using constrained economization of Chebyshev polynomials with an acceptable error value.","PeriodicalId":199516,"journal":{"name":"The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"13 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":"123965688","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
AC-Stream: Associative classification over data streams using multiple class association rules AC-Stream:使用多个类关联规则对数据流进行关联分类
The 2013 10th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2013-05-29 DOI: 10.1109/JCSSE.2013.6567349
Bordin Saengthongloun, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai
{"title":"AC-Stream: Associative classification over data streams using multiple class association rules","authors":"Bordin Saengthongloun, Thanapat Kangkachit, T. Rakthanmanon, Kitsana Waiyamai","doi":"10.1109/JCSSE.2013.6567349","DOIUrl":"https://doi.org/10.1109/JCSSE.2013.6567349","url":null,"abstract":"Data stream classification is one of the most interesting problems in the data mining community. Recently, the idea of associative classification was introduced to handle data streams. However, single rule classification over data streams like AC-DS implicitly has two flaws. Firstly, it tends to produce a large bias on simple rules. Secondly, it is not appropriate for data streams that are slowly changed from time to time. To overcome this problem, we propose an algorithm, namely AC-Stream, for classifying a data stream using multiple rules. AC-Stream is able to find k-rules for predicting unseen data. An interval estimated Hoeffding-bound is used as a gain to approximate the best number of rules, k. Compared to AC-DS and other traditional associative classifiers on large number of TICI datasets, ACStream is more effective in terms of average accuracy and F1 measurement.","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":"130193061","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}
引用次数: 3
首页 上一页 下一页 尾页
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学术官方微信