2013 IEEE Ninth World Congress on Services最新文献_第4页

Efficient Formal Verification in Banking Processes 银行流程中有效的正式验证

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.79

A. Santone, Valentina Intilangelo, Domenico Raucci

{"title":"Efficient Formal Verification in Banking Processes","authors":"A. Santone, Valentina Intilangelo, Domenico Raucci","doi":"10.1109/SERVICES.2013.79","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.79","url":null,"abstract":"Model checking is a very useful method to verify concurrent and distributed systems which is traditionally applied to computer system design. We examine the applicability of model checking to validation of Business Processes that are mapped through the systems of Workflow Management. The use of model checking in business domain is affected by the state explosion problem, which says that the state space grows exponentially in the number of concurrent processes. In this paper we consider a property-based methodology developed to combat the state explosion problem. Our focus is two fold; firstly we show how model checking can be applied in the context of business modelling and analysis and secondly we evaluate and test the methodology using as a case study a real-world banking workflow of a loan origination process. Our investigations suggest that the business community, especially in the banking field, can benefit from this efficient methodology developed in formal methods since it can detect errors that were missed by traditional verification techniques, and being cost-efficient, it can be adopted as a standard quality assurance procedure. We show and discuss the experimental results obtained.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117348733","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

Exploring Cloud Computing for Large-Scale Scientific Applications 探索大规模科学应用的云计算

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.13

Guang Lin, Binh Han, Jian Yin, I. Gorton

{"title":"Exploring Cloud Computing for Large-Scale Scientific Applications","authors":"Guang Lin, Binh Han, Jian Yin, I. Gorton","doi":"10.1109/SERVICES.2013.13","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.13","url":null,"abstract":"This paper explores cloud computing for large-scale data intensive scientific applications. Cloud computing is attractive because it provides hardware and software resources on-demand, which relieves the burden of acquiring and maintaining a huge amount of resources that may be used only once by a scientific application. However, unlike typical commercial applications that often just requires a moderate amount of ordinary resources, large-scale scientific applications often need to process enormous amount of data in the terabyte or even petabyte range and require special high performance hardware with low latency connections to complete computation in a reasonable amount of time. To address these challenges, we build an infrastructure that can dynamically select high performance computing hardware across institutions and dynamically adapt the computation to the selected resources to achieve high performance. We have also demonstrated the effectiveness of our infrastructure by building a system biology application and an uncertainty quantification application for carbon sequestration, which can efficiently utilize data and computation resources across several institutions.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130191416","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}

引用次数: 10

A Workflow Framework for Big Data Analytics: Event Recognition in a Building 大数据分析的工作流程框架:建筑物中的事件识别

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.29

Changbing Chen, Xia Yang, Z. Bong, Sivadon Chaisiri, Bu-Sung Lee

{"title":"A Workflow Framework for Big Data Analytics: Event Recognition in a Building","authors":"Changbing Chen, Xia Yang, Z. Bong, Sivadon Chaisiri, Bu-Sung Lee","doi":"10.1109/SERVICES.2013.29","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.29","url":null,"abstract":"This paper studies event recognition in a building based on the patterns of power consumption. It is a big challenge to identify what kinds of events happened in a building without additional devices such as camera and motion sensors, etc. Instead, we learn when and how the events happened from the historical record of power consumption and apply the lesson into the design of an event recognition system (ERS). The ERS will find out abnormal power usage to avoid wasting power, which leads to the energy savings in a building. The ERS involves big data analytics with a large size of dataset collected in a real time. Such a data intensive system is usually viewed as a workflow. A workflow management is a significant task of the system requiring data analysis in terms of the system scalability to maintain high throughput or fast speed analysis. We propose a workflow framework that allows users to perform remote and parallel workflow execution, whose tasks are efficiently scheduled and distributed in cloud computing environment. We run the ERS as a target system for the proposed framework with power consumption data (whose size is approximately 20GB or more) collected from each of over 240 rooms in a building at Dept. of Engineering, Tokyo University in 2011. We show that the proposed framework accelerates the speed of data analysis by providing scaling infrastructure and parallel processing feature utilizing cloud computing technologies. We also share our experience and results on the big data analytics and discuss how the studies contribute to achieve Green Campus.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"12 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130322030","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

Data Integrity Evaluation in Cloud Database-as-a-Service 云数据库即服务中的数据完整性评估

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.40

Puya Ghazizadeh, R. Mukkamala, S. Olariu

引用次数: 25

Is Your Cloud-Hosted Database Truly Elastic? 你的云托管数据库真的有弹性吗?

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.69

S. Sakr, Anna Liu

{"title":"Is Your Cloud-Hosted Database Truly Elastic?","authors":"S. Sakr, Anna Liu","doi":"10.1109/SERVICES.2013.69","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.69","url":null,"abstract":"Elasticity has been recognized as one of the most appealing features for users of cloud services. It represents the ability to dynamically and rapidly scale up or down the allocated computing resources on demand. In practice, it is difficult to understand the elasticity requirements of a given application and workload, and to assess if the elasticity provided by a cloud service will meet these requirements. In this experience paper, we take the position that a deep understanding of the capabilities of cloud-hosted database services is a crucial requirement for cloud users in order to bring forward the vision of deploying data-intensive applications on cloud platforms. We argue that it is important that cloud users become able to paint a comprehensive picture of the relationship between the capabilities of the different type of cloud database services, the application characteristics and workloads, and the geographical distribution of the application clients and the underlying database replicas. We discuss the current elasticity capabilities of the different categories of cloud database services and identify some of the main challenges for deploying a truly elastic database tier on cloud environments. Finally, we propose a benchmarking mechanism that can evaluate the elasticity capabilities of cloud database services in different application scenarios and workloads.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127443413","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

An Energy-Efficient Online Parallel Scheduling Algorithm for Cloud Data Centers 一种高效节能的云数据中心在线并行调度算法

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.57

Wenhong Tian, Ruini Xue, Jun Cao, Qin Xiong, Yunjun Hu

{"title":"An Energy-Efficient Online Parallel Scheduling Algorithm for Cloud Data Centers","authors":"Wenhong Tian, Ruini Xue, Jun Cao, Qin Xiong, Yunjun Hu","doi":"10.1109/SERVICES.2013.57","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.57","url":null,"abstract":"This paper considers online energy-efficient scheduling of real-time virtual machines (VMs) for Cloud data centers. Each request is associated with a starttime, a end-time, a processing time and demand for a Physical Machine (PM) capacity. The goal is to schedule all of the requests non-preemptively in their start-timeend- time windows, subjecting to PM capacity constraints, such that total busy time of all used PMs is minimized (called MinTBT-ON for abbreviation). This problem is a fundamental scheduling problem for parallel jobs allocation on mutliple machines, it has important applications in power-aware scheduling in cloud computing, optical network design and customer service systems and other related areas. Offline scheduling to minimize busy time is NP-hard already in the special case where all jobs have the same processing time and can be scheduled in a fixed time interval. One best-known result for MinTBT-ON problem is a g-competitive algorithm for general instances using First-Fit algorithm for unit-size jobs, where g is the total capacity of a PM. In this paper, a B-competitive algorithm, GRID is proposed and proved for general case, where B is a natural number and 1 <; B <; g. More results are obtained and applied to Cloud computing to improve energy-efficiency.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"2005 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125816577","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

EC2BargainHunter: It's Easy to Hunt for Cost Savings on Amazon EC2! EC2BargainHunter:很容易在亚马逊EC2上寻找成本节省!

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.52

K. Rajaraman, Le Duy Ngan, Yuzhang Feng, Anitha Veeramani, Joel Koo Chong En, C. C. Keong, F. S. Tsai, A. Andrzejak

引用次数: 2

Towards a Goal Driven Task Personalization Specification Framework 迈向目标驱动的任务个性化规范框架

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.75

George Chatzikonstantinou, Michael Athanasopoulos, K. Kontogiannis

{"title":"Towards a Goal Driven Task Personalization Specification Framework","authors":"George Chatzikonstantinou, Michael Athanasopoulos, K. Kontogiannis","doi":"10.1109/SERVICES.2013.75","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.75","url":null,"abstract":"Since its inception, Service Orientation allowed for distributed clients to invoke remote operations utilizing standardized protocols, programming paradigms and architectures. Furthermore, the problem of compiling complex service compositions, based on contextual information and user preferences, has been also extensively investigated by the research community. However, these techniques are mostly used within a single, or within coupled service domains that utilize predefined orchestration and composition service flows. In this paper, we propose an approach whereby service providers can specify complex service tasks as collections of goal model templates that can be instantiated and customized by the invoking clients. A reasoning process evaluates whether instantiated goals can be fulfilled based on the clients selections and consequently generates service flows that are compliant to the goal model and to the clients preferences. The major difference from existing context aware service computing frameworks is the introduction of a reasoning process that allows for the evaluation of various and possibly synergetic client goals and the on-time initiation and enactment of goal compliant service compositions. A proof of concept prototype has been implemented utilizing SOA technologies for service invocation and flow control.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116019798","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

QoS Auditing for Evaluation of SLA in Cloud-based Distributed Services 面向云分布式服务SLA评估的QoS审计

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.74

K. Ravindran

引用次数: 9

Storing, Indexing and Querying Large Provenance Data Sets as RDF Graphs in Apache HBase 在Apache HBase中以RDF图的形式存储、索引和查询大型数据源集

2013 IEEE Ninth World Congress on Services Pub Date : 2013-06-28 DOI: 10.1109/SERVICES.2013.32

Artem Chebotko, John Abraham, P. Brazier, Anthony Piazza, A. Kashlev, Shiyong Lu

{"title":"Storing, Indexing and Querying Large Provenance Data Sets as RDF Graphs in Apache HBase","authors":"Artem Chebotko, John Abraham, P. Brazier, Anthony Piazza, A. Kashlev, Shiyong Lu","doi":"10.1109/SERVICES.2013.32","DOIUrl":"https://doi.org/10.1109/SERVICES.2013.32","url":null,"abstract":"Provenance, which records the history of an in-silico experiment, has been identified as an important requirement for scientific workflows to support scientific discovery reproducibility, result interpretation, and problem diagnosis. Large provenance datasets are composed of many smaller provenance graphs, each of which corresponds to a single workflow execution. In this work, we explore and address the challenge of efficient and scalable storage and querying of large collections of provenance graphs serialized as RDF graphs in an Apache HBase database. Specifically, we propose: (i) novel storage and indexing techniques for RDF data in HBase that are better suited for provenance datasets rather than generic RDF graphs and (ii) novel SPARQL query evaluation algorithms that solely rely on indices to compute expensive join operations, make use of numeric values that represent triple positions rather than actual triples, and eliminate the need for intermediate data transfers over a network. The empirical evaluation of our algorithms using provenance datasets and queries of the University of Texas Provenance Benchmark confirms that our approach is efficient and scalable.","PeriodicalId":169370,"journal":{"name":"2013 IEEE Ninth World Congress on Services","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114781535","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}

引用次数: 22