2017 IEEE International Conference on Web Services (ICWS)最新文献_第4页

Gig Services Recommendation Method for Fuzzy Requirement Description 基于模糊需求描述的Gig业务推荐方法

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.73

Zhiying Tu, Xiaofei Xu, Qian Zhang, Hanming Zhang, Zhongjie Wang

{"title":"Gig Services Recommendation Method for Fuzzy Requirement Description","authors":"Zhiying Tu, Xiaofei Xu, Qian Zhang, Hanming Zhang, Zhongjie Wang","doi":"10.1109/ICWS.2017.73","DOIUrl":"https://doi.org/10.1109/ICWS.2017.73","url":null,"abstract":"In recent years, freelancer economy has been a new normalcy. In the supply-driven freelancer marketplace, people sell their capabilities or labor as service on the internet platform to help others with some particular micro-tasks. As this kind of human service ecosystem is at the fast growth stage, it is inundated with a variety of services whose quality is uneven. Quite often, when facing these services, customers hesitate to make the decision. The root causes of this hesitation are: (1) customers do not know these services well, even the explicit service category and description are provided, (2) customers do not know their own demands well. Most of the time, customers only have a general/fuzzy goal, but have no sense of the requirements in detail. Therefore, this study aims at proposing a human services recommendation method for fuzzy customer requirement. The experimental data of this study is collected from Fiverr.com, which is one prominent supply-driven human services marketplace. By analyzing the transaction data, any details of services, freelancers, customers, and their relations will be extracted to construct a supply-demand relation graph. In this study, customer's fuzzy requirement description will be transferred into a query subgraph, which is the input of an evolved subgraph matching algorithm. This algorithm will help to retrieve the recommendable services (combinations). In addition, a guided Q&A approach is designed to complement customer's fuzzy requirement, so that subgraph matching algorithm can retrieve better results.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126030115","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

An Online Data-Oriented Authentication Based on Merkle Tree with Improved Reliability 一种基于Merkle树的在线数据认证方法

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.102

Dongyoung Koo, Young-joo Shin, J. Yun, Junbeom Hur

引用次数: 19

Efficient Caching for Peer-to-Peer Service Discovery in Internet of Things 物联网中点对点服务发现的高效缓存

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.33

Hessam Moeini, I. Yen, F. Bastani

{"title":"Efficient Caching for Peer-to-Peer Service Discovery in Internet of Things","authors":"Hessam Moeini, I. Yen, F. Bastani","doi":"10.1109/ICWS.2017.33","DOIUrl":"https://doi.org/10.1109/ICWS.2017.33","url":null,"abstract":"Internet of Things (IoT) interconnects billions of smart sensors, devices, actuators, as well as people, over a distributed environment to work together towards a better and smarter physical world. However, technologies are still under development to allow us to most effectively make use of the ubiquitous \"smart things\" to accomplish the desired goals in various human activities. Service discovery is one of these technologies that can help identify the desired IoT devices for the given task. In this paper, we design an efficient peer-to-peer (p2p) service discovery algorithm in an IoT network with a mix of static and mobile IoT nodes. Our algorithm is based on unstructured p2p routing with routing information caching (RIC). Due to the limited memory on IoT nodes, we bound the cache size to fit the IoT nodes and maximize the usefulness of their RIC content. First, we build an ontology of IoT device capabilities and design a hierarchical Bloom-filter based Indexing (HBFI) to index the capabilities in the ontology. HBFI is flexible in incorporating new capabilities and offers much more space efficient representation of the routing information. Also, the cache replacement scheme of RIC considers the reference time of the entries (as conventional), the mobility of the IoT nodes, and the inclusiveness of the capability concept. Experimental evaluations show that with the same memory size constraint, our scheme can provide more effective routing information and minimize the service discovery time compared to centralized, supernode based, DHT based, flooding based, and other information caching based solutions.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128681672","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}

引用次数: 13

Detecting Refactorings among Multiple Web Service Releases: A Heuristic-Based Approach 在多个Web服务版本中检测重构:一种基于启发式的方法

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.121

M. Kessentini, Hanzhang Wang

引用次数: 4

Correctness Verification for Service-Based Business Processes 基于服务的业务流程的正确性验证

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.90

Pengbo Xiu, Weiliang Zhao, Jian Yang

{"title":"Correctness Verification for Service-Based Business Processes","authors":"Pengbo Xiu, Weiliang Zhao, Jian Yang","doi":"10.1109/ICWS.2017.90","DOIUrl":"https://doi.org/10.1109/ICWS.2017.90","url":null,"abstract":"To keep up with the trend of globalization and informatization, an increasing number of enterprises decide to run their business process in a service-based manner with the help of Web Service technology. In order to manage such service-based business process (SBP), it is vital that the dependencies among the internal process and the exposed external services are correctly developed and maintained. SBP is dynamic by nature, therefore it is necessary to develop a practical and robust method to verify the correctness of SBP. In an SBP, complex dependencies exist not only between internal process and involved services but also within their components (activities, data, operations, etc.). The complex dependencies make the correctness verification for SBP a challenging task. In this work, we develop a correctness verification approach to handle this task. A Petri net based model is proposed with a hierarchical structure to cover the characteristics of SBPs. This model can support the control flow patterns that are necessary for SBPs. A set of correctness properties for SBP are identified which any SBP developers shall consider, and the respective verification methods are developed.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130328452","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

SaaS for Automated Job Performance Appraisals Using Service Technologies and Big Data Analytics 使用服务技术和大数据分析的自动化工作绩效评估SaaS

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.47

I. Yen, F. Bastani, Yongtao Huang, Yuqun Zhang, Xin Yao

引用次数: 5

Oblivious Multi-Keyword Search for Secure Cloud Storage Service 安全云存储服务的遗忘多关键字搜索

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.42

Rui Zhang, Rui Xue, Ling Liu, Lijuan Zheng

{"title":"Oblivious Multi-Keyword Search for Secure Cloud Storage Service","authors":"Rui Zhang, Rui Xue, Ling Liu, Lijuan Zheng","doi":"10.1109/ICWS.2017.42","DOIUrl":"https://doi.org/10.1109/ICWS.2017.42","url":null,"abstract":"Outsource encrypted data has attracted attentions from industry and academics for storing sensitive data in third party clouds. Many cloud applications need privacy preserving multiple keywords search services over encrypted data with dual capabilities. On one hand, they need to keep the query keywords and associated search operations private such that data hosting service providers cannot trace and infer sensitive data stored in the third party data hosting servers. On the other hand, they need to support multiple keywords search to significantly improve the search efficiency. However, current keyword search protocols for encrypted data are not practical with poor privacy and low efficiency. In this paper, we propose a new oblivious multiple keywords search (OMKS) service, which provides privacy for both users and cloud storage service provider and supports efficient multiple keywords search. Compared to previous oblivious keyword search (OKS) protocols, our protocols maintain strong privacy, i.e., database security and query privacy, and effectively support disjunctive and conjunctive keywords search. The analysis and experiments show that OMKS protocols significantly reduce the storage and communication overhead. Moreover, the computation overhead of conjunctive search is not increased with the number of query keywords such that it can performs highly efficient conjunctive keywords search.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129289566","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

Improving Web Services Design Quality Using Heuristic Search and Machine Learning 利用启发式搜索和机器学习提高Web服务设计质量

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.63

M. Kessentini, Hanzhang Wang, Josselin Dea, Ali Ouni

{"title":"Improving Web Services Design Quality Using Heuristic Search and Machine Learning","authors":"M. Kessentini, Hanzhang Wang, Josselin Dea, Ali Ouni","doi":"10.1109/ICWS.2017.63","DOIUrl":"https://doi.org/10.1109/ICWS.2017.63","url":null,"abstract":"Web services evolve over time to fix bugs or update and add new features. However, the design of the Web service's interface may become more complex when aggregating many unrelated operations in terms of context and functionalities. A possible solution is to refactor the Web services interface into different modules that help the user quickly identifying relevant operations. The most challenging issue when refactoring a Web services interface is the high number of possible modularization solutions. The evaluation of these solutions is subjective and difficult to quantify. This paper introduces the use of a neural network-based evaluation function for the problem of Web services interface modularization. The users evaluate manually the suggested modularization solutions by a Genetic Algorithm (GA) for a number of iterations then an Artificial Neural Network (ANN) uses these training examples to evaluate the proposed Web services design changes for the remaining iterations. We evaluated the efficiency of our approach using a benchmark of 82 Web services from different domains and compared the performance of our technique with several existing Web services modularization studies in terms of generating well-designed Web services interface for users.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116306516","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

Selling Reserved Instances through Pay-as-You-Go Model in Cloud Computing 在云计算中通过现收现付模式销售保留实例

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.25

Shuo Zhang, Dong Yuan, Li Pan, Shijun Liu, Li-zhen Cui, Xiangxu Meng

引用次数: 9

xFilter: A Temporal Locality Accelerator for Intrusion Detection System Services xFilter:入侵检测系统服务的时间局部性加速器

2017 IEEE International Conference on Web Services (ICWS) Pub Date : 2017-06-01 DOI: 10.1109/ICWS.2017.74

Chao Wang, Jinhong Zhou, Lei Gong, Xi Li, Aili Wang, Xuehai Zhou

{"title":"xFilter: A Temporal Locality Accelerator for Intrusion Detection System Services","authors":"Chao Wang, Jinhong Zhou, Lei Gong, Xi Li, Aili Wang, Xuehai Zhou","doi":"10.1109/ICWS.2017.74","DOIUrl":"https://doi.org/10.1109/ICWS.2017.74","url":null,"abstract":"The Intrusion Detection Systems (IDS) is becoming important and quite timing/space consuming due to the increasing volume of explosive data flood. During the past decades, there have been plenty of studies proposing software mechanisms to exploit the temporal locality in the IDS systems. However, it requires considerable memory blocks to store the redundancy table, therefore, the performance as well as the memory utilization is still worth pursuing. To tackle the above weakness, in this paper, we present xFilter, which explores the temporal locality to capture the redundancy, and propose a novel architecture to store and operate the redundancy table on FPGA. To demonstrate the performance of the xFilter structure, we designed a high efficient accelerator for Aho-Corasick (AC) algorithm used in Snort to detect the attack strings. To show the performance of xFilter, we implement a hardware prototype using Xilinx Zynq FPGA platform. Experimental results show that the xFilter accelerator can achieve 5.1x speedup against software implementation with insignificant hardware cost. Furthermore, the proposed hardware redundancy table mechanism can achieve 1.6x speedup against the traditional hardware accelerator.","PeriodicalId":235426,"journal":{"name":"2017 IEEE International Conference on Web Services (ICWS)","volume":"43 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2017-06-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134235222","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