Xiongnan Jin, Sejin Chun, Jooik Jung, Kyong-Ho Lee
The Internet of Things (IoT) is a paradigm where real-world entities can be connected to the Internet and provide services with the help of attached devices. With the development of IoT technologies, the number of devices deployed around the world as well as their services are increasing rapidly. Thus, selecting an appropriate service which satisfies a user's requirements from such many services becomes a time consuming challenge. Therefore, to address this issue we propose a Physical Service Model (PSM) to describe heterogeneous IoT physical services. PSM contains three core concepts (Device, Resource and Service) and specifies their relationships. Based on PSM, we define four quality of service (QoS) attributes and rate candidate services according to user requirements. In order to dynamically aggregate individual QoS ratings and select physical services, we propose a Physical Service Selection (PSS) method which takes a user preference and an absolute dominance relationship among physical services into account. Finally, experiments are conducted to evaluate the performance of the proposed method.
{"title":"IoT Service Selection Based on Physical Service Model and Absolute Dominance Relationship","authors":"Xiongnan Jin, Sejin Chun, Jooik Jung, Kyong-Ho Lee","doi":"10.1109/SOCA.2014.24","DOIUrl":"https://doi.org/10.1109/SOCA.2014.24","url":null,"abstract":"The Internet of Things (IoT) is a paradigm where real-world entities can be connected to the Internet and provide services with the help of attached devices. With the development of IoT technologies, the number of devices deployed around the world as well as their services are increasing rapidly. Thus, selecting an appropriate service which satisfies a user's requirements from such many services becomes a time consuming challenge. Therefore, to address this issue we propose a Physical Service Model (PSM) to describe heterogeneous IoT physical services. PSM contains three core concepts (Device, Resource and Service) and specifies their relationships. Based on PSM, we define four quality of service (QoS) attributes and rate candidate services according to user requirements. In order to dynamically aggregate individual QoS ratings and select physical services, we propose a Physical Service Selection (PSS) method which takes a user preference and an absolute dominance relationship among physical services into account. Finally, experiments are conducted to evaluate the performance of the proposed method.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"4 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127531746","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}
The selection of the best fitting process engine for a specific project requires the evaluation of engines according to various requirements. We focus on the non-functional requirement robustness, which is critical in production environments but hard to determine. Thus, we propose an evaluation framework to reveal important robustness criteria of process engines. In this work, we focus on message robustness, i.e., The ability to handle the receipt of invalid messages appropriately. In a case study comprising five open source BPEL engines, we determine message robustness by injecting faults into robustly designed processes as a reply to a previously sent request from an external virtual service and assert their behavior. The results show that the degree of message robustness significantly differs, hence, robustly designed processes do not necessarily lead to robust runtime behavior, the selected engines still play a major role.
{"title":"Towards a Robustness Evaluation Framework for BPEL Engines","authors":"Simon Harrer, G. Wirtz, F. Nizamic, A. Lazovik","doi":"10.1109/SOCA.2014.40","DOIUrl":"https://doi.org/10.1109/SOCA.2014.40","url":null,"abstract":"The selection of the best fitting process engine for a specific project requires the evaluation of engines according to various requirements. We focus on the non-functional requirement robustness, which is critical in production environments but hard to determine. Thus, we propose an evaluation framework to reveal important robustness criteria of process engines. In this work, we focus on message robustness, i.e., The ability to handle the receipt of invalid messages appropriately. In a case study comprising five open source BPEL engines, we determine message robustness by injecting faults into robustly designed processes as a reply to a previously sent request from an external virtual service and assert their behavior. The results show that the degree of message robustness significantly differs, hence, robustly designed processes do not necessarily lead to robust runtime behavior, the selected engines still play a major role.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131354733","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}
Verification of distributed business processes typically relies on Petri-net-based process models, which allow for a natural modeling and analysis of aspects like parallelism and message exchange. Unfortunately, such a process model is seldom complete and precise today, mainly because the available techniques for its derivation neglect process data in favor of a feasible verification. In this paper, we present an approach for deriving more precise process models in terms of a transforming process-to-Petri-net compiler, which takes as input a business process and generates as output a Petri net model for the process which can subsequently be used for verification. However, in contrast to a conventional compiler, its objective is not to result in efficient runtime code but rather to produce a most-precise though still effectively verifiable Petri-net-based process model.
{"title":"Compiling More Precise Petri Net Models for an Improved Verification of Service Implementations","authors":"Thomas S. Heinze, W. Amme, Simon Moser","doi":"10.1109/SOCA.2014.8","DOIUrl":"https://doi.org/10.1109/SOCA.2014.8","url":null,"abstract":"Verification of distributed business processes typically relies on Petri-net-based process models, which allow for a natural modeling and analysis of aspects like parallelism and message exchange. Unfortunately, such a process model is seldom complete and precise today, mainly because the available techniques for its derivation neglect process data in favor of a feasible verification. In this paper, we present an approach for deriving more precise process models in terms of a transforming process-to-Petri-net compiler, which takes as input a business process and generates as output a Petri net model for the process which can subsequently be used for verification. However, in contrast to a conventional compiler, its objective is not to result in efficient runtime code but rather to produce a most-precise though still effectively verifiable Petri-net-based process model.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"30 6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121273826","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}
An auction-based pricing mechanism has been presented to be applied for the problems that can be modeled as a variant of reserve price biddings on combinatorial auctions. In there, the combinatorial auction is extended to cover a multi-unit scenario, which allows placing bids for indistinguishable items to cover the case, for example, to assign an allocation of electricity power usage for services, considering electricity generation costs on the power suppliers. Although such a mechanism could be naively applied to various purposed such as dynamic electricity auctions, it was difficult to be applied for large-scale auction problems due to its computational intractability and theoretical limitations. In this paper, a preliminary analysis for an extended pricing mechanism is presented. The mechanism employs an approximate allocation and pricing algorithm that is capable to handle multi-unit auctions with reserve price biddings, guaranteeing the reserve price condition. The presented preliminary analysis shows the approach efficiently produces approximation allocations that are also necessary in its pricing process and it behaves as an approximation of VCG (Vickrey-Clarke-Groves) mechanism satisfying budget balance condition and bidders' individual rationality without having single-minded bidders assumption.
{"title":"Applying Large-Scale Multi-unit Combinatorial Auctions with Reserve-Price Biddings for Resource Allocations -- A Preliminary Analysis","authors":"Naoki Fukuta","doi":"10.1109/SOCA.2014.42","DOIUrl":"https://doi.org/10.1109/SOCA.2014.42","url":null,"abstract":"An auction-based pricing mechanism has been presented to be applied for the problems that can be modeled as a variant of reserve price biddings on combinatorial auctions. In there, the combinatorial auction is extended to cover a multi-unit scenario, which allows placing bids for indistinguishable items to cover the case, for example, to assign an allocation of electricity power usage for services, considering electricity generation costs on the power suppliers. Although such a mechanism could be naively applied to various purposed such as dynamic electricity auctions, it was difficult to be applied for large-scale auction problems due to its computational intractability and theoretical limitations. In this paper, a preliminary analysis for an extended pricing mechanism is presented. The mechanism employs an approximate allocation and pricing algorithm that is capable to handle multi-unit auctions with reserve price biddings, guaranteeing the reserve price condition. The presented preliminary analysis shows the approach efficiently produces approximation allocations that are also necessary in its pricing process and it behaves as an approximation of VCG (Vickrey-Clarke-Groves) mechanism satisfying budget balance condition and bidders' individual rationality without having single-minded bidders assumption.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"18 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116631852","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}
Dominik Riemer, Ljiljana Stojanović, N. Stojanović
In the era of big data processing there is an emerging need for methodologies supporting the management of data-intensive application scenarios. Complex Event Processing is an integral part of many fast data application as an underlying technology for event correlation and pattern detection. Increased volume of event streams as well as the demand for more complex real-time analytics require for execution of processing pipelines among heterogeneous event processing engines. In this paper, we propose a semantic model for the management of fast data streams using the concept of Semantic Event Processing Pipelines (SEPP). We provide methodology, architecture and language for semantic discovery and binding of real-time processing services from arbitrary stream processing engines. Our approach aims to improve reusability of real-time processing services by providing high-level interfaces to stream processing implementations. By these means this work paves the way for an easier development and management of real-time big data applications.
{"title":"SEPP: Semantics-Based Management of Fast Data Streams","authors":"Dominik Riemer, Ljiljana Stojanović, N. Stojanović","doi":"10.1109/SOCA.2014.52","DOIUrl":"https://doi.org/10.1109/SOCA.2014.52","url":null,"abstract":"In the era of big data processing there is an emerging need for methodologies supporting the management of data-intensive application scenarios. Complex Event Processing is an integral part of many fast data application as an underlying technology for event correlation and pattern detection. Increased volume of event streams as well as the demand for more complex real-time analytics require for execution of processing pipelines among heterogeneous event processing engines. In this paper, we propose a semantic model for the management of fast data streams using the concept of Semantic Event Processing Pipelines (SEPP). We provide methodology, architecture and language for semantic discovery and binding of real-time processing services from arbitrary stream processing engines. Our approach aims to improve reusability of real-time processing services by providing high-level interfaces to stream processing implementations. By these means this work paves the way for an easier development and management of real-time big data applications.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"411 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123423605","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}
The paper discusses the concept of value of integration in two apparently distant research domains, database and service domains. In the area of virtual database integration, we address the problem of increased utility in an organization resulting from adopting data integration architectures, so to be able to querying an integrated database schema instead a set of local schemas. In the area of service design, we investigate the increased utility resulting from the reuse enabled in a set of production lines from the integration of their local service repositories, that are conceptual representations of services along with is-a and part-of relationships expressed among them. We define a concept of utility and value in a general fashion, and subsequently adapt utility and value to the two analyzed domains. The paper is concluded with real life case studies.
{"title":"Value of Integration in Database and Service Domains","authors":"C. Batini, M. Castelli, M. Comerio, G. Viscusi","doi":"10.1109/SOCA.2014.46","DOIUrl":"https://doi.org/10.1109/SOCA.2014.46","url":null,"abstract":"The paper discusses the concept of value of integration in two apparently distant research domains, database and service domains. In the area of virtual database integration, we address the problem of increased utility in an organization resulting from adopting data integration architectures, so to be able to querying an integrated database schema instead a set of local schemas. In the area of service design, we investigate the increased utility resulting from the reuse enabled in a set of production lines from the integration of their local service repositories, that are conceptual representations of services along with is-a and part-of relationships expressed among them. We define a concept of utility and value in a general fashion, and subsequently adapt utility and value to the two analyzed domains. The paper is concluded with real life case studies.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"114 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121435010","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}
Francis Palma, Le An, Foutse Khomh, Naouel Moha, Yann-Gaël Guéhéneuc
Like any other software systems, service-based systems (SBSs) evolve frequently to accommodate new user requirements. This evolution may degrade their design and implementation and may cause the introduction of common bad practice solutions -- antipatterns -- in opposition to patterns which are good solutions to common recurring design problems. We believe that the degradation of the design of SBSs does not only affect the clients of the SBSs but also the maintenance and evolution of the SBSs themselves. This paper presents the results of an empirical study that aimed to quantify the impact of service patterns and antipatterns on the maintenance and evolution of SBSs. We measure the maintenance effort of a service implementation in terms of the number of changes and the size of changes (i.e., Code churns) performed by developers to maintain and evolve the service, two effort metrics that have been widely used in software engineering studies. Using data collected from the evolutionary history of the SBS FraSCAti, we investigate if (1) services involved in patterns require less maintenance effort, (2) services detected as antipatterns require more maintenance effort than other services, and (3) if some particular service antipatterns are more change-prone than others. Results show that (1) services involved in patterns require less maintenance effort, but not at statistically significant level, (2) services detected as antipatterns require significantly more maintenance effort than non-antipattern services, and (3) services detected as God Component, Multi Service, and Service Chain antipatterns are more change-prone (i.e., Require more maintenance effort) than the services involved in other antipatterns. We also analysed the relation between object-oriented code smells and service patterns/antipatterns and found a significant difference in the proportion of code smells contained in the implementations of service patterns and antipatterns.
{"title":"Investigating the Change-Proneness of Service Patterns and Antipatterns","authors":"Francis Palma, Le An, Foutse Khomh, Naouel Moha, Yann-Gaël Guéhéneuc","doi":"10.1109/SOCA.2014.43","DOIUrl":"https://doi.org/10.1109/SOCA.2014.43","url":null,"abstract":"Like any other software systems, service-based systems (SBSs) evolve frequently to accommodate new user requirements. This evolution may degrade their design and implementation and may cause the introduction of common bad practice solutions -- antipatterns -- in opposition to patterns which are good solutions to common recurring design problems. We believe that the degradation of the design of SBSs does not only affect the clients of the SBSs but also the maintenance and evolution of the SBSs themselves. This paper presents the results of an empirical study that aimed to quantify the impact of service patterns and antipatterns on the maintenance and evolution of SBSs. We measure the maintenance effort of a service implementation in terms of the number of changes and the size of changes (i.e., Code churns) performed by developers to maintain and evolve the service, two effort metrics that have been widely used in software engineering studies. Using data collected from the evolutionary history of the SBS FraSCAti, we investigate if (1) services involved in patterns require less maintenance effort, (2) services detected as antipatterns require more maintenance effort than other services, and (3) if some particular service antipatterns are more change-prone than others. Results show that (1) services involved in patterns require less maintenance effort, but not at statistically significant level, (2) services detected as antipatterns require significantly more maintenance effort than non-antipattern services, and (3) services detected as God Component, Multi Service, and Service Chain antipatterns are more change-prone (i.e., Require more maintenance effort) than the services involved in other antipatterns. We also analysed the relation between object-oriented code smells and service patterns/antipatterns and found a significant difference in the proportion of code smells contained in the implementations of service patterns and antipatterns.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"26 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129592021","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}
IP trace back is considered to be one of the promising countermeasures against Distributed Denial of Service (DDoS) attacks. IP trace back protocols must be effective as well as simple enough to be efficiently executed. However, there is almost no such an IP trace back protocol. In this paper, we consider an IP trace back protocol proposed by Muthuprasanna and Manimaran [1] (STE scheme for short) and shall propose a new, efficient, and adaptive IP trace back scheme, which is partly based on STE. Simply speaking, our scheme is efficient since it adaptively changes marking probabilities decrease the number of marking bits. In this paper, we conduct theoretical and numerical analyses of our scheme in detail and show that our scheme is more efficient than STE in terms of marking bit length and the number of packets for attack path recovery. The result is also supported by simulations experiments.
{"title":"An Efficient and Adaptive IP Traceback Scheme","authors":"Kayoko Iwamoto, Masakazu Soshi, T. Satoh","doi":"10.1109/SOCA.2014.19","DOIUrl":"https://doi.org/10.1109/SOCA.2014.19","url":null,"abstract":"IP trace back is considered to be one of the promising countermeasures against Distributed Denial of Service (DDoS) attacks. IP trace back protocols must be effective as well as simple enough to be efficiently executed. However, there is almost no such an IP trace back protocol. In this paper, we consider an IP trace back protocol proposed by Muthuprasanna and Manimaran [1] (STE scheme for short) and shall propose a new, efficient, and adaptive IP trace back scheme, which is partly based on STE. Simply speaking, our scheme is efficient since it adaptively changes marking probabilities decrease the number of marking bits. In this paper, we conduct theoretical and numerical analyses of our scheme in detail and show that our scheme is more efficient than STE in terms of marking bit length and the number of packets for attack path recovery. The result is also supported by simulations experiments.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129222820","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}
Evaluation of post-stroke hemiplegic patients is an important aspect of rehabilitation, especially for assessing improvement of a patient's condition from a treatment. It is also commonly used to evaluate stroke patients during theraputic clinical trials [1]. The Fugl-Meyer Assessment is one of the most widely recognized and utilized measures of body function impairment for post-stroke patients [2]. We propose a method for automating the upper-limb portion of the Fugl-Meyer Assessment by gathering data from sensors monitoring the patient. Features are extracted from the data and processed by a Support Vector Machine (SVM). The output from the SVM returns a value that can be used to score a patient's upper limb functionality. This system will enable automatic and inexpensive stroke patient evaluation that can save up to 30 minutes per patient for a doctor, providing a huge time-saving service for doctors and stroke researchers.
{"title":"Automating Stroke Patient Evaluation Using Sensor Data and SVM","authors":"P. Otten, S. Son, Jonghyun Kim","doi":"10.1109/SOCA.2014.29","DOIUrl":"https://doi.org/10.1109/SOCA.2014.29","url":null,"abstract":"Evaluation of post-stroke hemiplegic patients is an important aspect of rehabilitation, especially for assessing improvement of a patient's condition from a treatment. It is also commonly used to evaluate stroke patients during theraputic clinical trials [1]. The Fugl-Meyer Assessment is one of the most widely recognized and utilized measures of body function impairment for post-stroke patients [2]. We propose a method for automating the upper-limb portion of the Fugl-Meyer Assessment by gathering data from sensors monitoring the patient. Features are extracted from the data and processed by a Support Vector Machine (SVM). The output from the SVM returns a value that can be used to score a patient's upper limb functionality. This system will enable automatic and inexpensive stroke patient evaluation that can save up to 30 minutes per patient for a doctor, providing a huge time-saving service for doctors and stroke researchers.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127458997","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}
In the northern city of Oulu, Finland, we have been pursuing a visible change to the local society by building a functional prototype of what we call an open ubiquitous city. Today the ubiquitous city offers various permanent services as well as short-term research probes for its dwellers to use. In this article we first describe the still fermenting vision behind much of the service development in Oulu. Second, we introduce three new technological concepts that we are currently investigating in the smart city context: situated kiosks for community engagement, sound-based resource discovery mechanism, and a complete, functional 3D-model of the pivotal downtown areas of Oulu. Finally, we discuss some of the future research directions and implications of the introduced technological additions. We hope the ideas shared in this article can help the research community in designing and creating better services for the future cities.
{"title":"Situated Engagement and Virtual Services in a Smart City","authors":"S. Hosio, Jorge Gonçalves, Hannu Kukka","doi":"10.1109/SOCA.2014.31","DOIUrl":"https://doi.org/10.1109/SOCA.2014.31","url":null,"abstract":"In the northern city of Oulu, Finland, we have been pursuing a visible change to the local society by building a functional prototype of what we call an open ubiquitous city. Today the ubiquitous city offers various permanent services as well as short-term research probes for its dwellers to use. In this article we first describe the still fermenting vision behind much of the service development in Oulu. Second, we introduce three new technological concepts that we are currently investigating in the smart city context: situated kiosks for community engagement, sound-based resource discovery mechanism, and a complete, functional 3D-model of the pivotal downtown areas of Oulu. Finally, we discuss some of the future research directions and implications of the introduced technological additions. We hope the ideas shared in this article can help the research community in designing and creating better services for the future cities.","PeriodicalId":138805,"journal":{"name":"2014 IEEE 7th International Conference on Service-Oriented Computing and Applications","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2014-11-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114663619","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：