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

2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)最新文献

筛选
英文 中文
Search space reduction of particle swarm optimization for hierarchical similarity measurement model 层次相似性度量模型的粒子群优化搜索空间约简
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841836
Arun Reungsinkonkarn, P. Apirukvorapinit
{"title":"Search space reduction of particle swarm optimization for hierarchical similarity measurement model","authors":"Arun Reungsinkonkarn, P. Apirukvorapinit","doi":"10.1109/JCSSE.2014.6841836","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841836","url":null,"abstract":"Particle Swarm Optimization (PSO) is one of many optimization techniques used to find a solution in many areas not limited to engineering or mathematics. It can discover the solution to a problem of finding input to a program based on the similarity of program's execution. However, identifying such solutions with standard PSO is not very efficient or in a few cases, not possible. There is a high probability that particles are stuck in an area of local maxima. The main reason is due to excessive exploitation steps. In addition, when the new exploration starts, there is no guarantee that particles will no longer be generated from earlier explored areas. This paper presents an algorithm of Search Space Reduction (SSR) applied to PSO for Hierarchical Similarity Measurement (HSM) model of program execution. The algorithm uses a fitness function computed from HSM model. SSR helps to find the solution by eliminating areas where the solution is most likely not to be found. It improves the optimization process by reducing the excessive exploitation step. Moreover, SSR can be applied to all variants of PSO. The experimental results demonstrate that PSO with SSR is the most effective method among all other three techniques used in experiment. SSR increases effectiveness in finding a solution by 73%. For each program under the experiment, SSR algorithm was able to find all solutions with the smallest number of exploitations. Regardless of the program's complexity, PSO with SSR usually manipulates the searching process faster than both versions of PSO without SSR.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122601990","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
SLA guarantee real-time monitoring system with soft deadline constraint SLA保证了软期限约束下的实时监控系统
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841841
Panya Kittipipattanathaworn, N. Nupairoj
{"title":"SLA guarantee real-time monitoring system with soft deadline constraint","authors":"Panya Kittipipattanathaworn, N. Nupairoj","doi":"10.1109/JCSSE.2014.6841841","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841841","url":null,"abstract":"Real time monitoring of data streams can be used for monitoring performance, availability or system anomaly detection which can analyze and correlate events from logs file. However, due to the increasing complexity of modern distributed systems, the size of logs can become very large. Monitoring with timing constraint becomes more important in facilitating the enforcement of conditional guarantees. In general, real-time systems are usually classified into soft and hard which need to comply the term of Service Level Agreements (SLAs). In this paper, we focused on the probabilistic deadline in order to guarantee the achievement of SLA deadline for verification of soft deadlines in real-time system by adopt the Central limit theorem in order to approximate the distributions and calculate the probability of a violation of SLA guarantee which can be used to determine the deadline constraint for the system.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"158 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124495379","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
A personalized recommendation algorithm via biased random walk 一种基于有偏随机漫步的个性化推荐算法
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841883
Dawei Nie, Yan Fu, Junlin Zhou, Zhen Liu, Zi-Ke Zhang, Chuang Liu
{"title":"A personalized recommendation algorithm via biased random walk","authors":"Dawei Nie, Yan Fu, Junlin Zhou, Zhen Liu, Zi-Ke Zhang, Chuang Liu","doi":"10.1109/JCSSE.2014.6841883","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841883","url":null,"abstract":"With the rapid development of Internet, Recommender Systems can help us efficiently find the useful objects in the information era. Generally, the traditional random walk algorithm has high accuracy but low personality and diversity. In this paper, we propose an improved random walk algorithm by depressing the influence of large-degree objects. Experimental results on MovieLens and Netflix data sets show that this algorithm can effectively improve not only the accuracy (improved by 5.5% and 5.9%, respectively) but also the diversity.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133565102","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
Call admission control schemes in cellular networks: A comparative study 蜂窝网络中的呼叫接纳控制方案:比较研究
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841865
Santosh K. Emmadi, T. Venkatesh
{"title":"Call admission control schemes in cellular networks: A comparative study","authors":"Santosh K. Emmadi, T. Venkatesh","doi":"10.1109/JCSSE.2014.6841865","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841865","url":null,"abstract":"Efficient handoff is an important issue in wireless cellular networks in order to provide Quality of Service (QoS) to the users and to support users' mobility. A related important issue in the cellular networks is the call admission control (CAC). The design of the call admission control schemes is especially challenging given the limited resources, and the mobility of users encountered in such networks. The goal of this paper is to do performance evaluation of some of the important CAC schemes that are proposed in the literature using simulations and numerical computation of the theoretical results. The CAC schemes studied include Non-Prioritized Scheme (NPS), Guard Channel Scheme (GCS), Fractional Guard Channel Scheme (FGCS), Guard Channel Scheme with Buffer (GCSB), Two-Level Fractional Guard channel Scheme (TLFGCS), Dynamic Guard Channel Scheme (DGCS) and Adaptive Guard Channel Scheme (AGCS). The performance results obtained from simulation of all these schemes are compared and conclusions are drawn.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127806300","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
A novel 10T SRAM cell with low power dissipation in active and sleep mode for write operation 一种新颖的10T SRAM单元，在主动和休眠模式下具有低功耗，用于写操作
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841868
P. Upadhyay, P. Kundu, R. Kar, D. Mandal, S. Ghoshal
{"title":"A novel 10T SRAM cell with low power dissipation in active and sleep mode for write operation","authors":"P. Upadhyay, P. Kundu, R. Kar, D. Mandal, S. Ghoshal","doi":"10.1109/JCSSE.2014.6841868","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841868","url":null,"abstract":"This paper focuses on the analysis of static and dynamic power dissipations and stability analysis of a proposed 10T SRAM cell. In the proposed structure there are two voltage sources, one connected with the Bit line and the other connected with the Bit bar line for reducing the voltage swing during the switching activity. This reduction in voltage swing causes less dynamic power dissipation during switching activity. Two stack transistors are also connected in the pull-down paths which increase the threshold voltages of the transistors and this cause the reduction in sub-threshold leakage current and static power dissipation. Simulation has been done in 45nm CMOS technology with 0.7 volt power supply in Microwind 3.1 software. Simulation results have been compared to those of other existing 10T SRAM cells.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121186453","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
Power model for virtual machine in cloud computing 云计算中虚拟机的功率模型
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841857
Satit Chinprasertsuk, Sethavidh Gertphol
{"title":"Power model for virtual machine in cloud computing","authors":"Satit Chinprasertsuk, Sethavidh Gertphol","doi":"10.1109/JCSSE.2014.6841857","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841857","url":null,"abstract":"Cloud computing has potentials to reduce energy consumption cost for the providers by intelligently allocating virtual machines to energy efficient servers. This paper proposes a new method to create an energy model that describes a direct relationship between resource utilization in the VM and the energy consumption by the host. With the model it is possible to estimate how much energy a server will consume if it accommodates a specific number of VMs, each with a specific resource utilization. This work also investigated the power consumption of a server when different combinations of VMs with different utilization are running on it. The result shows that the energy consumption varies non-linearly with the number of VMs allocated on that host.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"91 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128935745","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}
引用次数: 7
HC2D barcode reader using embedded camera in Android phone HC2D条码阅读器在Android手机中使用嵌入式摄像头
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841876
Puchong Subpratatsavee, Narongrit Janthong, P. Kuha, Chanchira Chintho
{"title":"HC2D barcode reader using embedded camera in Android phone","authors":"Puchong Subpratatsavee, Narongrit Janthong, P. Kuha, Chanchira Chintho","doi":"10.1109/JCSSE.2014.6841876","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841876","url":null,"abstract":"The HC2D barcode is a highest capacity of 2D barcode while it occupies a small area. The size of the HC2D barcode is suitable for displaying on print media such as paper and poster. But, for reading the HC2D barcode, the bit representation of the barcode is obtained by scanning the image of the barcode with scanner machine only. This paper shows the implementations of image reorganization of HC2D barcodes in mobile phones with android operating system. The mobile phone system used here consists of a camera, mobile application and display device, and the source image is captured by the embedded camera device. The introduced algorithm is based on the code area found by two vertical line, one horizontal line and dash line detection of HC2D barcode. This algorithm is robust for the real-time recognition of the HC2D barcodes and an average recognition rate is 91.33%.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115639178","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}
引用次数: 8
Parallel simulation of nanoparticles transport in high gradient magnetic field 高梯度磁场中纳米颗粒输运的平行模拟
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841871
Kanok Hournkumnuard, C. Chantrapornchai, B. Dolwithayakul, Prach Chaisiri
{"title":"Parallel simulation of nanoparticles transport in high gradient magnetic field","authors":"Kanok Hournkumnuard, C. Chantrapornchai, B. Dolwithayakul, Prach Chaisiri","doi":"10.1109/JCSSE.2014.6841871","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841871","url":null,"abstract":"The transport of weakly magnetic nanoparticles, dispersed in an irrotational flow of inviscid fluid, in the region of high gradient magnetic fieldis simulated by a parallel algorithm developed based on OpenMP. The high gradient magnetic field here is produced by applying the background uniform magnetic field perpendicular to axes of parallel ferromagnetic wires. The direction of incoming fluid flow is perpendicular to both wired axes and the applied magnetic field. According to the features of magnetic field and fluid flow, the particles transport is simulated on a two dimensional domain enclosing a representative wire. The continuity equation describing transport of particles on the domain is solved numerically as an initial and boundary value problem. The simulation result shows the distribution of particle concentration on the domain at various times. The performance results show the consistent speedup when increasing the number of cores upto 20-30% due to the iteration dependency and the domain size.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"181 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115825081","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
Mobile remote sensing platform: An uncertainty calibration analysis 移动遥感平台:不确定度定标分析
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841843
Angel-Iván García-Moreno, José-Joel González-Barbosa, J. Hurtado-Ramos, F. Ornelas-Rodriguez
{"title":"Mobile remote sensing platform: An uncertainty calibration analysis","authors":"Angel-Iván García-Moreno, José-Joel González-Barbosa, J. Hurtado-Ramos, F. Ornelas-Rodriguez","doi":"10.1109/JCSSE.2014.6841843","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841843","url":null,"abstract":"This paper presents a method to estimate the uncertainty in the calibration of two sensors, a laser rangefinder and a multicamera-system. Both sensors were used in urban environment reconstruction tasks. A new calibration pattern, visible to both sensors is proposed. By this means, correspondence between each laser point and its position in the camera image is obtained so that texture and color of each LIDAR point can be known. Besides this allows systematic errors in individual sensors to be minimized, and when multiple sensors are used, it minimizes the systematic contradiction between them to enable reliable multisensor data fusion. A practical methodology is presented to predict the uncertainty analysis inside the calibration process between both sensors. Statistics of the behavior of the camera calibration parameters and the relationship between the camera, LIDAR and the noisy of both sensors were calculated using simulations, an analytical analysis and experiments. Results for the calibration and uncertainty analysis are presented for data collected by the platform integrated with a LIDAR and the panoramic camera.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"234 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122623071","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 simultaneous topology and sizing optimization for plane trusses 平面桁架的拓扑结构和尺寸同步优化
2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE) Pub Date : 2014-05-14 DOI: 10.1109/JCSSE.2014.6841852
Chotiga Choensiridamrong, B. Watjatrakul, A. Prayote
{"title":"A simultaneous topology and sizing optimization for plane trusses","authors":"Chotiga Choensiridamrong, B. Watjatrakul, A. Prayote","doi":"10.1109/JCSSE.2014.6841852","DOIUrl":"https://doi.org/10.1109/JCSSE.2014.6841852","url":null,"abstract":"This paper presents two approaches to determine the optimal plane trusses using the particle swarm optimization. The two-stage optimization and the simultaneous topology-sizing optimization of plane trusses are investigated and compared. The matrix representation of both topology and element size is introduced and integrated into the standard particle swarm algorithm to enable higher flexibility and computational efficiency. The truss weight is to be minimized subjected to stability, stress and deformation constraints. The results show that the simultaneous optimization provided much better solutions with higher expense of computational time.","PeriodicalId":331610,"journal":{"name":"2014 11th International Joint Conference on Computer Science and Software Engineering (JCSSE)","volume":"148 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-05-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116549852","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
首页 上一页 下一页 尾页
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学术官方微信