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

2012 IEEE Ninth International Conference on e-Business Engineering最新文献

筛选
英文 中文
A Fault Detection Method for Wireless Sensor Networks Based on Credible Sensor Nodes Set 基于可信传感器节点集的无线传感器网络故障检测方法
2012 IEEE Ninth International Conference on e-Business Engineering Pub Date : 2012-09-09 DOI: 10.1109/ICEBE.2012.49
Zhaoxing Wang, Q. Wen, Teng Wang, Hua Zhang
{"title":"A Fault Detection Method for Wireless Sensor Networks Based on Credible Sensor Nodes Set","authors":"Zhaoxing Wang, Q. Wen, Teng Wang, Hua Zhang","doi":"10.1109/ICEBE.2012.49","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.49","url":null,"abstract":"In this paper, we present a fault detection scheme based on credible nodes set for wireless sensor networks. While an event occurs, the impact on the nodes around the event source can be described as a distance-related model. And the model can be transformed to a group of linear equations. The coefficients of linear equations are determined by energy value and intrinsic properties of the event source, and they can be worked out through the credible nodes' measured values and location parameters. By using improved hierarchical clustering algorithm, we can determine the credible nodes set through the similarity of nodes' measurements. Then the absolute measurement residuals of all nodes can be calculated by the linear regression algorithm and the measurement residuals will be used for concluding the final status of every node. So we can accomplish the detection. Simulation results show that the fault detection accuracy and the false alarm rate are kept high and low, respectively, even in the case where 40% of the sensor nodes are faulty.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126202929","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
Probabilistic Top-k Dominating Composite Service Selection 概率Top-k支配组合服务选择
2012 IEEE Ninth International Conference on e-Business Engineering Pub Date : 2012-09-01 DOI: 10.1109/ICEBE.2012.11
Chaogang Tang, Shiting Wen, Qing Li, Yan Xiong, An Liu
{"title":"Probabilistic Top-k Dominating Composite Service Selection","authors":"Chaogang Tang, Shiting Wen, Qing Li, Yan Xiong, An Liu","doi":"10.1109/ICEBE.2012.11","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.11","url":null,"abstract":"A few of works have recently focused on relieving service users of the role played in assigning numeric values to QoS criteria as required in traditional service selection scheme. Towards such goals, skyline services for example have been studied recently by a lot of researchers. However, the size of skyline services sometimes is not easily controlled due to intrinsic attributes of services. Besides, some QoS metrics, such as response time, reliability, and etc., usually suffer from network as well as Internet factors (e.g. network unavailability and Internet disconnection), which contributes to the fact that these QoS metrics may fluctuate during run time. Considering this kind of dynamics of QoS metrics, we in this paper propose to obtain probabilistic top-k dominating composite services with uncertain QoS. More important, the number of obtained services can be easily specified by service users, thus avoiding the case that the size of skyline services is sometimes out of control. The experimental results have investigated the feasibility and effectiveness of our approaches.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"167 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116669120","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
A Highly Concurrent Process Virtual Machine Based on Event-driven Process Execution Model 基于事件驱动进程执行模型的高并发进程虚拟机
2012 IEEE Ninth International Conference on e-Business Engineering Pub Date : 2012-09-01 DOI: 10.1109/ICEBE.2012.20
Dongyao Wu, Jun Wei, Chushu Gao, Wensheng Dou
{"title":"A Highly Concurrent Process Virtual Machine Based on Event-driven Process Execution Model","authors":"Dongyao Wu, Jun Wei, Chushu Gao, Wensheng Dou","doi":"10.1109/ICEBE.2012.20","DOIUrl":"https://doi.org/10.1109/ICEBE.2012.20","url":null,"abstract":"Existing orchestration and choreography process engines only serve for dedicate process languages and majority of them show rough performance under even moderate workloads which cause them incapable for practical use. To solve the problems, the Event-driven Process Execution Model (EPEM) is presented as the common process model and the formalization of EPEM is presented to guarantee the correctness and efficiency for process transformation. A Process Virtual Machine - Once PVM is implemented based on EPEM and extended to support execution of WS-BPEL. For evaluation, the performance of Once PVM is compared with existing orchestration engines including Active BPEL, Apache ODE and Oracle BPEL Process Manager. The experimental results indicate that Once PVM shows better scalability than other tested platforms especially under high workloads.","PeriodicalId":166304,"journal":{"name":"2012 IEEE Ninth International Conference on e-Business Engineering","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2012-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131155532","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学术官方微信