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

EAI Endorsed Transactions on Collaborative Computing最新文献

筛选
英文 中文
Testing Software Using Swarm Intelligence: A Bee Colony Optimization Approach 使用群体智能的测试软件:一种蜂群优化方法
EAI Endorsed Transactions on Collaborative Computing Pub Date : 2016-05-24 DOI: 10.4108/eai.3-12-2015.2262529
O. Ariss, Steve Bou Ghosn, Weifeng Xu
{"title":"Testing Software Using Swarm Intelligence: A Bee Colony Optimization Approach","authors":"O. Ariss, Steve Bou Ghosn, Weifeng Xu","doi":"10.4108/eai.3-12-2015.2262529","DOIUrl":"https://doi.org/10.4108/eai.3-12-2015.2262529","url":null,"abstract":"Software testing is a critical activity in increasing our confidence of a system under test and improving its quality. The key idea for testing a software application is to minimize the number of faults found in the system. Software verification through testing is a crucial step in the application's development life cycle. This process can be regarded as expensive and laborious, and its automation is valuable. We propose a multi-objective search based test generation technique that is based on both functional and structural testing. Our Search Based Software Testing (SBST) technique is based on a bee colony optimization algorithm that integrates adaptive random testing from the functional side and condition/decision and multiple condition coverage from the structural side. The constructive approach that the bee colony algorithm uses for solution generation allows our SBST to address the limitations of previous approaches relying on fully random initial solutions and single objective evaluation. We perform extensive experimental testing to justify the effectiveness of our approach.","PeriodicalId":109199,"journal":{"name":"EAI Endorsed Transactions on Collaborative Computing","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134301781","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
Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings 重访BEECLUST:具有不同光线设置适应性的蜂群机器人的聚合
EAI Endorsed Transactions on Collaborative Computing Pub Date : 2016-05-24 DOI: 10.4108/eai.3-12-2015.2262877
Mostafa Wahby, Alexander Weinhold, Heiko Hamann
{"title":"Revisiting BEECLUST: Aggregation of Swarm Robots with Adaptiveness to Different Light Settings","authors":"Mostafa Wahby, Alexander Weinhold, Heiko Hamann","doi":"10.4108/eai.3-12-2015.2262877","DOIUrl":"https://doi.org/10.4108/eai.3-12-2015.2262877","url":null,"abstract":"Aggregation is a crucial task in swarm robotics to ensure cooperation. We investigate the task of aggregation on an area specified indirectly by certain environmental features, here it is a light distribution. We extend the original BEECLUST algorithm, that implements an aggregation behavior, to an adaptive variant that automatically adapts to any light conditions. We compare these two control algorithms in a number of swarm robot experiments with different light conditions. The improved, adaptive variant is found to be significantly better in the tested setup.","PeriodicalId":109199,"journal":{"name":"EAI Endorsed Transactions on Collaborative Computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-05-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123806584","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
Dynamic State Space Partitioning for Adaptive Simulation Algorithms 动态状态空间划分的自适应仿真算法
EAI Endorsed Transactions on Collaborative Computing Pub Date : 2016-01-04 DOI: 10.4108/eai.14-12-2015.2262710
Tobias Helms, Steffen Mentel, A. Uhrmacher
{"title":"Dynamic State Space Partitioning for Adaptive Simulation Algorithms","authors":"Tobias Helms, Steffen Mentel, A. Uhrmacher","doi":"10.4108/eai.14-12-2015.2262710","DOIUrl":"https://doi.org/10.4108/eai.14-12-2015.2262710","url":null,"abstract":"Adaptive simulation algorithms can automatically change their configuration during runtime to adapt to changing computational demands of a simulation, e.g., triggered by a changing number of model entities or the execution of a rare event. These algorithms can improve the performance of simulations. They can also reduce the configuration effort of the user. By using such algorithms with machine learning techniques, the advantages come with a cost, i.e., the algorithm needs time to learn good adaptation policies and it must be equipped with the ability to observe its environment. An important challenge is to partition the observations to suitable macro states to improve the effectiveness and efficiency of the learning algorithm. Typically, aggregation algorithms, e.g., the adaptive vector quantization algorithm (AVQ), that dynamically partition the state space during runtime are preferred here. In this paper, we integrate the AVQ into an adaptive simulation algorithm.","PeriodicalId":109199,"journal":{"name":"EAI Endorsed Transactions on Collaborative Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2016-01-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124805113","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
Critically loaded k-limited polling systems 临界负载的k限制轮询系统
EAI Endorsed Transactions on Collaborative Computing Pub Date : 2015-05-19 DOI: 10.4108/eai.14-12-2015.2262578
M. Boon, E. Winands
{"title":"Critically loaded k-limited polling systems","authors":"M. Boon, E. Winands","doi":"10.4108/eai.14-12-2015.2262578","DOIUrl":"https://doi.org/10.4108/eai.14-12-2015.2262578","url":null,"abstract":"We consider a two-queue polling model with switch-over times and $k$-limited service (serve at most $k_i$ customers during one visit period to queue $i$) in each queue. The major benefit of the $k$-limited service discipline is that it - besides bounding the cycle time - effectuates prioritization by assigning different service limits to different queues. System performance is studied in the heavy-traffic regime, in which one of the queues becomes critically loaded with the other queue remaining stable. By using a singular-perturbation technique, we rigorously prove heavy-traffic limits for the joint queue-length distribution. Moreover, it is observed that an interchange exists among the first two moments in service and switch-over times such that the HT limits remain unchanged. Not only do the rigorously proven results readily carry over to $N$($geq2$) queue polling systems, but one can also easily relax the distributional assumptions. The results and insights of this note prove their worth in the performance analysis of Wireless Personal Area Networks (WPAN) and mobile networks, where different users compete for access to the shared scarce resources.","PeriodicalId":109199,"journal":{"name":"EAI Endorsed Transactions on Collaborative Computing","volume":"16 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-05-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122275086","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学术文献互助群
群 号：481959085
Book学术官方微信