IEEE Transactions on Services Computing
980 resources related to IEEE Transactions on Services Computing
- Topics related to IEEE Transactions on Services Computing
- IEEE Organizations related to IEEE Transactions on Services Computing
- Conferences related to IEEE Transactions on Services Computing
- Periodicals related to IEEE Transactions on Services Computing
- Most published Xplore authors for IEEE Transactions on Services Computing
The 2020 IEEE International Conference on Systems, Man, and Cybernetics (SMC 2020) will be held in Metro Toronto Convention Centre (MTCC), Toronto, Ontario, Canada. SMC 2020 is the flagship conference of the IEEE Systems, Man, and Cybernetics Society. It provides an international forum for researchers and practitioners to report most recent innovations and developments, summarize state-of-the-art, and exchange ideas and advances in all aspects of systems science and engineering, human machine systems, and cybernetics. Advances in these fields have increasing importance in the creation of intelligent environments involving technologies interacting with humans to provide an enriching experience and thereby improve quality of life. Papers related to the conference theme are solicited, including theories, methodologies, and emerging applications. Contributions to theory and practice, including but not limited to the following technical areas, are invited.
It covers all aspects of service-oriented engineering from architectures, techniques, tools and languages to methodologies. The topics include, but are not limited to, (1) Advanced Models for Service Engineering, (2) Computing Environments and Virtualization, (3) Methods, Languages & Tools for process-based SOC systems, (4) Service-based Cyber-Physical Systems, (5) Intelligent Services for a Smart World, and (6) Social Networking Services. The conference also welcomes industry practice and case study papers, which include, but not limited to, the topics of (1) Enterprise business architecture and solution frameworks, (2) Platforms and tools for system and software engineering, (3) Case studies, experiments and evaluation of service-oriented system, and (4) Innovative service applications and experiences. It will also invite some tutorial papers, which review the state-of-the-art of the research on services engineering as well as the related emerging paradigms and technologies.
The scope of the Congress will cover all aspects of innovative services computing and applications, current and emerging. It involves various systems and networking aspects, such as cloud, edge, and Internet-of-Things (IoT), as well as other research and technologies, such as intelligent computing, learning techniques, blockchain and big data, including quality factors, such as high performance, security, privacy, dependability, trustworthiness, and cost-effectiveness.
The 18th IEEE/ACIS International Conference on Computer and Information Science brings together scientists, engineers, computer users, and students to exchange and share their experiences, new ideas, and research results about all aspects (theory, applications and tools) of computer and information science, and discuss the practical challenges encountered and the solutionsadopted.
Development of robust and high-quality intelligent Internet-scale distributed applications.Extensive research and development in the past few years has pushed SOC technology intostate-of-the-art applications in emerging areas such as Cloud computing, Internet-of-Things(IoT), Machine-to-Machine (M2M) communication, Cyber-Physical Systems (CPSs), Mobile-Edge Computing, Social computing as well as mobile and enterprise systems.
Experimental and theoretical advances in antennas including design and development, and in the propagation of electromagnetic waves including scattering, diffraction and interaction with continuous media; and applications pertinent to antennas and propagation, such as remote sensing, applied optics, and millimeter and submillimeter wave techniques.
Contains articles on the applications and other relevant technology. Electronic applications include analog and digital circuits employing thin films and active devices such as Josephson junctions. Power applications include magnet design as well asmotors, generators, and power transmission
The IEEE Transactions on Automation Sciences and Engineering (T-ASE) publishes fundamental papers on Automation, emphasizing scientific results that advance efficiency, quality, productivity, and reliability. T-ASE encourages interdisciplinary approaches from computer science, control systems, electrical engineering, mathematics, mechanical engineering, operations research, and other fields. We welcome results relevant to industries such as agriculture, biotechnology, healthcare, home automation, maintenance, manufacturing, pharmaceuticals, retail, ...
The Transactions on Biomedical Circuits and Systems addresses areas at the crossroads of Circuits and Systems and Life Sciences. The main emphasis is on microelectronic issues in a wide range of applications found in life sciences, physical sciences and engineering. The primary goal of the journal is to bridge the unique scientific and technical activities of the Circuits and Systems ...
Broad coverage of concepts and methods of the physical and engineering sciences applied in biology and medicine, ranging from formalized mathematical theory through experimental science and technological development to practical clinical applications.
IEEE Transactions on Services Computing, None
In 2016, Peng et al. pointed out in the literature (IEEE Transactions on Services Computing, Vol. 9, No. 6, Nov./Dec. 2016) that Wang's identity-based provable data possessing scheme ID-DPDP(IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) has security vulnerability, and Peng et al. offered the remedy solutions. Unfortunately, we demonstrate that Peng et al.'s method ...
IEEE Transactions on Services Computing, 2016
In 2015, Wang proposed the first identity-based provable data possession scheme named ID-DPDP (IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) to verify outsourced data publicly without the implementation of PKI. Unfortunately, in this letter, we demonstrate that this scheme is insecure in the sense that cloud servers can generate valid proofs without possessing the ...
IEEE Transactions on Services Computing, 2015
Recently, a public auditing protocol for shared data called Panda (IEEE Transactions on Services Computing, doi: 10.1109/TSC.2013.2295611) was proposed to ensure the correctness of the outsourced data. A distinctive feature of Panda is the support of data sharing and user revocation. Unfortunately, in this letter, we show that Panda is insecure in the sense that a cloud server can hide ...
2012 4th International Workshop on Principles of Engineering Service-Oriented Systems (PESOS), 2012
Research in service-oriented computing traditionally struggles with the absence of public cases and data sets for evaluating and comparing research results. This is particularly evident for QoS-aware service-based computing, where public and widely accepted QoS traces would help to strengthen the fair comparison of QoS-aware automated composition and QoS prediction approaches. In this paper, we present one public data set ...
IEEE Transactions on Services Computing, 2008
Service level agreements (SLAs), or contracts, have an important role in Web services. They define the obligations and rights between the provider of a Web service and its client, about the function and the quality of the service (QoS). For composite services like orchestrations, contracts are deduced by a process called QoS contract composition, based on contracts established between the ...
Big Data & the Cloud: The Research Agenda
Big Data & the Cloud: The Road Ahead
Q&A with Dr. Bill Tonti: IEEE Rebooting Computing Podcast, Episode 3
Lew Tucker, IEEE GLOBECOM'13 Keynote Address - Lew Tucker, CTO, Cisco Systems
Fog Tank: Venture Capitalists Take On the Hottest Startups in Fog Computing - Fog World Congress
Risto Miikkilainen - Multiagent Learning Through Neuroevolution
EDOC 2010 - Sylvain Halle - Best Paper Presentation
Robotics History: Narratives and Networks Oral Histories:Ken Goldberg
Brooklyn 5G Summit: Massive MIMO Technology for 5G (6GHz - 100GHz)
IEEE Membership... Why We Joined
David Forney - IEEE Medal of Honor 2016
Welcome to IEEE Publishing Services
On Thermodynamics and the Future of Computing - IEEE Rebooting Computing 2017
Computing Based on Material Training: Application to Binary Classification Problems - IEEE Rebooting Computing 2017
NetSoft 2020 - S4SI 2020 Keynote 1
On-chip Passive Photonic Reservoir Computing with Integrated Optical Readout - IEEE Rebooting Computing 2017
Special Evening Panel Discussion: AI, Cognitive Information Processing, and Rebooting Computing - IEEE Rebooting Computing 2017
"A View from the Cloud" -- IEEE Cloud 2012 Conference
IEEE @ SXSW 2015 - Biometrics & Identity: Beyond Wearable
In 2016, Peng et al. pointed out in the literature (IEEE Transactions on Services Computing, Vol. 9, No. 6, Nov./Dec. 2016) that Wang's identity-based provable data possessing scheme ID-DPDP(IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) has security vulnerability, and Peng et al. offered the remedy solutions. Unfortunately, we demonstrate that Peng et al.'s method also has a security loophole that malicious cloud servers can produce valid proof information without original data.Accordingly, we provide a revised solution to the problem while preserving the security features of the ID-DPDP.
In 2015, Wang proposed the first identity-based provable data possession scheme named ID-DPDP (IEEE Transactions on Services Computing, vol. 8, no. 2, pp. 328-340, Mar./Apr. 2015) to verify outsourced data publicly without the implementation of PKI. Unfortunately, in this letter, we demonstrate that this scheme is insecure in the sense that cloud servers can generate valid proofs without possessing the original data blocks. We also show another security issue in this scheme which leads to some data blocks can never be verified unless all the data blocks are challenged. Meanwhile, we provide solutions to these problems while preserving the security features of the original scheme.
Recently, a public auditing protocol for shared data called Panda (IEEE Transactions on Services Computing, doi: 10.1109/TSC.2013.2295611) was proposed to ensure the correctness of the outsourced data. A distinctive feature of Panda is the support of data sharing and user revocation. Unfortunately, in this letter, we show that Panda is insecure in the sense that a cloud server can hide data loss without being detected. Specifically, we show that even some stored file blocks have been lost, the server is able to generate a valid proof by replacing a pair of lost data block and its signature with another block and signature pair. We also provide a solution to the problem while preserving all the desirable features of the original protocol.
Research in service-oriented computing traditionally struggles with the absence of public cases and data sets for evaluating and comparing research results. This is particularly evident for QoS-aware service-based computing, where public and widely accepted QoS traces would help to strengthen the fair comparison of QoS-aware automated composition and QoS prediction approaches. In this paper, we present one public data set produced for the evaluation of a contribution to the IEEE Transactions on Services Computing journal. We briefly introduce the background story of the use case and describe our monitored data set. We hope that this data set can serve as a basis for evaluation of future research papers from other authors.
Service level agreements (SLAs), or contracts, have an important role in Web services. They define the obligations and rights between the provider of a Web service and its client, about the function and the quality of the service (QoS). For composite services like orchestrations, contracts are deduced by a process called QoS contract composition, based on contracts established between the orchestration and the called Web services. Contracts are typically stated as hard guarantees (e.g., response time always less than 5 msec). Using hard bounds is not realistic, however, and more statistical approaches are needed. In this paper we propose using soft probabilistic contracts instead, which consist of a probability distribution for the considered QoS parameter- in this paper, we focus on timing. We show how to compose such contracts, to yield a global probabilistic contract for the orchestration. Our approach is implemented by the TOrQuE tool. Experiments on TOrQuE show that overly pessimistic contracts can be avoided and significant room for safe overbooking exists. An essential component of SLA management is then the continuous monitoring of the performance of called Web services, to check for violations of the SLA. We propose a statistical technique for run-time monitoring of soft contracts.
Open-access blockchains based on proof-of-work protocols have gained tremendous popularity for their capabilities of providing decentralized tamper-proof ledgers and platforms for data-driven autonomous organization. Nevertheless, the proof-of-work based consensus protocols are vulnerable to cyber-attacks, e.g., doule-spending. In this paper, we propose a novel approach of cyber risk management for blockchain-based service. Particularly, we adopt the cyber-insurance as an economic tool for neutralizing cyber risks in blockchain networks. We consider a blockchain service market, which is composed of the infrastructure provider, blockchain provider, cyber-insurer, and users. The blockchain provider purchases the computing resources from the infrastructure provider to maintain the blockchain consensus, and then offers blockchain services to the users. The blockchain provider strategizes its investment in the infrastructure and the service price charged to the users, in order to improve the security of the blockchain and thus optimize its profit. Meanwhile, the blockchain provider also purchases a cyber-insurance to protect itself from the potential damage of the double-spending attacks. In return, the cyber-insurer adjusts the premium according to the perceived risk level of the blockchain service. Based on the rationality for the market entities, we model the interaction among the blockchain provider, cyber- insuer, and users as a two-level Stackelberg game.
Scheduling workflows in cloud service environment has attracted great enthusiasm, and various approaches have been reported up to now. However, these approaches often ignored the uncertainties in the scheduling environment. Ignoring these uncertain factors often leads to the violation of workflow deadlines and increases service renting costs of executing workflows. This study devotes to improving the performance for cloud service platforms by minimizing uncertainty propagation in scheduling workflow applications that have both uncertain task execution time and data transfer time. To be specific, a novel scheduling architecture is designed to control the count of workflow tasks directly waiting on each service instance (e.g., virtual machine). Based on this architecture, we develop an unceRtainty-aware Online Scheduling Algorithm (ROSA) to schedule dynamic and multiple workflows with deadlines. The proposed ROSA skillfully integrates both the proactive and reactive strategies. Then, on the basis of real-world workflow traces, five groups of simulation experiments are carried out to compare ROSA with five typical algorithms. The comparison results reveal that ROSA performs better than the five compared algorithms with respect to costs (up to 56%), deviation (up to 70%), resource utilization (up to 37%) and fairness (up to 37).
In a context of short-term cooperation, enterprises with complementary skills are dynamically interconnected according to their needs. To deal with requirements in a such cooperation, we present in this paper CoopFlow that aims at providing a useful artifact for preservation of the privacy of workflows partners, pre-established workflows and pre-established workflow management systems. CoopFlow consists of three steps: workflow abstraction and advertisement, workflow matching and interconnection, and workflow cooperation. To preserve the privacy of partners, the first step of the approach includes an abstraction procedure allowing a partial visibility of the partners' workflows. The second step consists of interconnecting existing workflows of partners with complementary skills attributing to a matching procedure that allows checking both behaviors and business semantics of partners' workflows. Finally, the last step of CoopFlow consists of controlling the inter-enterprise workflows cooperation allowing cooperation partners to integrate the existing workflows and to check whenever they can cooperate and change their partners, which frequently leads to support spontaneous, dynamic and short-term cooperation. With this intention, we developed a platform that manages inter-operability by integrating pre- established workflow management systems. The proof of concept is provided by integrating three heterogeneous and open workflow management systems to the CoopFlow platform.
The main research focus of Web services is to achieve the interoperability between distributed and heterogeneous applications. Therefore, flexible composition of Web services to fulfill the given challenging requirements is one of the most important objectives in this research field. However, until now, service composition has been largely an error-prone and tedious process. Furthermore, as the number of available web services increases, finding the right Web services to satisfy the given goal becomes intractable. In this paper, toward these issues, we propose an AI planning-based framework that enables the automatic composition of Web services, and explore the following issues. First, we formulate the Web-service composition problem in terms of AI planning and network optimization problems to investigate its complexity in detail. Second, we analyze publicly available Web service sets using network analysis techniques. Third, we develop a novel Web-service benchmark tool called WSBen. Fourth, we develop a novel AI planning-based heuristic Web- service composition algorithm named WSPR. Finally, we conduct extensive experiments to verify WSPR against state-of-the-art AI planners. It is our hope that both WSPR and WSBen will provide useful insights for researchers to develop Web-service discovery and composition algorithms, and software.
The Web has undergone a tremendous change toward a highly user-centric environment. Millions of users can participate and collaborate for their own interests and benefits. Services computing paradigm together with the proliferation of Web services have created great potential opportunities for the users, also known as service consumers, to produce value-added services by means of service discovery and composition. In this paper, we propose an efficient approach to facilitating the service consumer on discovering Web services. First, we analyze the service discovery requirements from the service consumer's perspective and outline a conceptual model of homogeneous Web service communities. The homogeneous service community contains two types of discovery: the search of similar operations and that of composible operations. Second, we describe a similarity measurement model for Web services by leveraging the metadata from WSDL, and design a graph-based algorithm to support both of the two discovery types. Finally, adopting the popular atom feeds, we design a prototype to facilitate the consumers to discover while subscribing Web services in an easy-of-use manner. With the experimental evaluation and prototype demonstration, our approach not only alleviates the consumers from time-consuming discovery tasks but also lowers their entry barrier in the user-centric Web environment.
No standards are currently tagged "IEEE Transactions on Services Computing"