Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.77
Takuya Yamaguchi, Yong Jin, N. Yamai, K. Okayama, Koki Okamoto, Motonori Nakamura
Recently, the Internet is widely used as a social basis and is not only providing many kinds of services but also offering these at high speed with high reliability. As one method for such a demand, multihoming technique, by which the inside network is connected with two or more ISPs (Internet Service Providers) and can use them properly according to network condition, attracts attention. In IPv6 site multihoming environment, multiple IP addresses are usually assigned to each host in the site. However, when a packet is sent from an inside node to outside, the packet has to go through a proper site-exit router in order to avoid ingress filtering. Therefore, especially, when communicating on the outbound connection initiated on an inside node, it is impossible to select a proper site-exit router since the source IP address is selected before initiating a connection. To solve this problem, we propose a route selection method for outbound connections. This method introduces a middleware into each inside node to establish a connection via each site-exit router simultaneously and then uses the first established connection. This middleware also introduces a kind of Network Address Translation (NAT) function to avoid ingress filtering. According to simulation experiments, we confirmed that the proposed method can select proper routes.
{"title":"An Optimal Route Selection Mechanism for Outbound Connection on IPv6 Site Multihoming Environment","authors":"Takuya Yamaguchi, Yong Jin, N. Yamai, K. Okayama, Koki Okamoto, Motonori Nakamura","doi":"10.1109/COMPSACW.2013.77","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.77","url":null,"abstract":"Recently, the Internet is widely used as a social basis and is not only providing many kinds of services but also offering these at high speed with high reliability. As one method for such a demand, multihoming technique, by which the inside network is connected with two or more ISPs (Internet Service Providers) and can use them properly according to network condition, attracts attention. In IPv6 site multihoming environment, multiple IP addresses are usually assigned to each host in the site. However, when a packet is sent from an inside node to outside, the packet has to go through a proper site-exit router in order to avoid ingress filtering. Therefore, especially, when communicating on the outbound connection initiated on an inside node, it is impossible to select a proper site-exit router since the source IP address is selected before initiating a connection. To solve this problem, we propose a route selection method for outbound connections. This method introduces a middleware into each inside node to establish a connection via each site-exit router simultaneously and then uses the first established connection. This middleware also introduces a kind of Network Address Translation (NAT) function to avoid ingress filtering. According to simulation experiments, we confirmed that the proposed method can select proper routes.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"104 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114944334","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.97
Tianhui Yang, K. Kaji, Nobuo Kawaguchi
In human activity sensing areas, we focus on elevator recognition using accelerometer. In this paper, our main challenge is to create an elevator acceleration recognition algorithm. In order to put this algorithm into real world use, This algorithm should be robust enough that can ignore the differences of the elevators, devices and subjects. To realize this aim, we build a crowdsourcing system which consists of an android application and a server. Android users can use this application to calculate elevator's moving distance. They can also upload elevators' accelerometer signals to the server, so we can get elevator acceleration data from all over the world. after publishing the system, we use the data we collected to build an elevator acceleration database. By using this database, we build a robust elevator recognition algorithm. we also use the features of elevators to distinguish them.
{"title":"Elevator Acceleration Sensing: Design and Estimation Recognition Algorithm Using Crowdsourcing","authors":"Tianhui Yang, K. Kaji, Nobuo Kawaguchi","doi":"10.1109/COMPSACW.2013.97","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.97","url":null,"abstract":"In human activity sensing areas, we focus on elevator recognition using accelerometer. In this paper, our main challenge is to create an elevator acceleration recognition algorithm. In order to put this algorithm into real world use, This algorithm should be robust enough that can ignore the differences of the elevators, devices and subjects. To realize this aim, we build a crowdsourcing system which consists of an android application and a server. Android users can use this application to calculate elevator's moving distance. They can also upload elevators' accelerometer signals to the server, so we can get elevator acceleration data from all over the world. after publishing the system, we use the data we collected to build an elevator acceleration database. By using this database, we build a robust elevator recognition algorithm. we also use the features of elevators to distinguish them.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116296365","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.107
V. Nguyen, Thomas Begin, I. G. Lassous
IP networks may face issues to support the offered workload due to the increasing number of Internet users, the steady influx of new Internet applications, which require stringent QoS, and applications needing big data transmission. QoS routing can be viewed as an attractive approach to tackle this issue. However, most of the QoS routing solutions are not evaluated in a realistic framework. In this paper we propose a networking evaluation of multi-constrained routing to assess the potential benefit of QoS routing protocol. To do this, we converted a multi-constrained routing algorithm into a protocol, and implemented it in the simulator NS2. Our results indicate that if the monitoring tool of a network can not sustain frequent link-state announcements, the benefits coming from implementing a QoS routing are quite low. On the other hand, if the network is equipped with an adequate measurement tool, then QoS routing can be worth implementing, and the routing based only the available bandwidth at each link arises as the best option (no need to consider the end-to-end delay constraint, nor the loss rate constraint).
{"title":"Multi-constrained Routing Algorithm: A Networking Evaluation","authors":"V. Nguyen, Thomas Begin, I. G. Lassous","doi":"10.1109/COMPSACW.2013.107","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.107","url":null,"abstract":"IP networks may face issues to support the offered workload due to the increasing number of Internet users, the steady influx of new Internet applications, which require stringent QoS, and applications needing big data transmission. QoS routing can be viewed as an attractive approach to tackle this issue. However, most of the QoS routing solutions are not evaluated in a realistic framework. In this paper we propose a networking evaluation of multi-constrained routing to assess the potential benefit of QoS routing protocol. To do this, we converted a multi-constrained routing algorithm into a protocol, and implemented it in the simulator NS2. Our results indicate that if the monitoring tool of a network can not sustain frequent link-state announcements, the benefits coming from implementing a QoS routing are quite low. On the other hand, if the network is equipped with an adequate measurement tool, then QoS routing can be worth implementing, and the routing based only the available bandwidth at each link arises as the best option (no need to consider the end-to-end delay constraint, nor the loss rate constraint).","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122096015","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.37
Xuan Zhang, Tong Li, Zhongwen Xie, Fei Dai, Jinzhuo Liu
The growing demand for higher trustworthiness of software poses an unprecedented challenge to the software industry. Software is the outcome of the software process. Software trustworthiness is highly dependent on the software process. To combine the trustworthiness in the software process, we propose a formal method for trustworthy software process composition. In this method, trustworthy processes are specified by the trustworthiness requirements and compose into software process. The composite process satisfies both functional and non-functional requirements for the trustworthy software.
{"title":"A Petri Net Based Model for Trustworthy Software Process Composition","authors":"Xuan Zhang, Tong Li, Zhongwen Xie, Fei Dai, Jinzhuo Liu","doi":"10.1109/COMPSACW.2013.37","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.37","url":null,"abstract":"The growing demand for higher trustworthiness of software poses an unprecedented challenge to the software industry. Software is the outcome of the software process. Software trustworthiness is highly dependent on the software process. To combine the trustworthiness in the software process, we propose a formal method for trustworthy software process composition. In this method, trustworthy processes are specified by the trustworthiness requirements and compose into software process. The composite process satisfies both functional and non-functional requirements for the trustworthy software.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"37 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124460072","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.83
A. Mooij, J. Hooman, R. Albers
Domain-Specific Languages (DSLs) receive attention as the possible next abstraction step in programming. Despite the benefits of using DSLs, in the industry there is also some reluctance against their introduction in product development. We address a number of issues that are important to gain industrial confidence for the introduction of DSLs. These include the available tools, the quality of generated code, and the incorporation in the industrial workflow. Our observations are based on an industrial study project at Philips Healthcare, especially concerning the development of a DSL for collision prevention. We also relate our experiences to the literature.
{"title":"Gaining Industrial Confidence for the Introduction of Domain-Specific Languages","authors":"A. Mooij, J. Hooman, R. Albers","doi":"10.1109/COMPSACW.2013.83","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.83","url":null,"abstract":"Domain-Specific Languages (DSLs) receive attention as the possible next abstraction step in programming. Despite the benefits of using DSLs, in the industry there is also some reluctance against their introduction in product development. We address a number of issues that are important to gain industrial confidence for the introduction of DSLs. These include the available tools, the quality of generated code, and the incorporation in the industrial workflow. Our observations are based on an industrial study project at Philips Healthcare, especially concerning the development of a DSL for collision prevention. We also relate our experiences to the literature.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"32 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124478354","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.75
A. Fujihara, H. Miwa
In recent years studies on disaster evacuation guidance effective against situations of large-scale urban disasters have been undertaken. Recently we have proposed the disaster evacuation guidance using opportunistic communication where evacuees collect disaster information of the locations of impassable and congested roads in their smartphones by themselves and share it with each other opportunistically by short-range wireless communication between nearby smartphones in order to not only navigate crowds of evacuees to refuges, but also rapidly aggregate the disaster information in real time. The proposed guidance was valid in evacuation scenarios under the condition that the mobile communication is disabled by disaster. We numerically showed by simulating a simple mathematical model that the guidance effectively shortened evacuation time of the evacuees. Since the crowds of evacuees simultaneously rush to refuge areas in the evacuation, on the other hand, the emergence of congestion by evacuees is inevitable and the evacuation time could be seriously delayed by the congestion. In this paper we investigate effects of the use of congestion information on the evacuation time by switching a detour evacuation route around congested roads. We introduce three simple algorithms to divert the route and numerically compare their performances using a new stochastic congestion model. In consequence we find that the use of congestion information has less impact on the evacuation time than that of the information of impassable roads, and also that slower route switching decision coming around congested roads is worse in the performance because evacuees tend to be sandwiched between some congested areas and are forced to go back and forth in vain by repeated evacuation route changes.
{"title":"On the Use of Congestion Information for Rerouting in the Disaster Evacuation Guidance Using Opportunistic Communication","authors":"A. Fujihara, H. Miwa","doi":"10.1109/COMPSACW.2013.75","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.75","url":null,"abstract":"In recent years studies on disaster evacuation guidance effective against situations of large-scale urban disasters have been undertaken. Recently we have proposed the disaster evacuation guidance using opportunistic communication where evacuees collect disaster information of the locations of impassable and congested roads in their smartphones by themselves and share it with each other opportunistically by short-range wireless communication between nearby smartphones in order to not only navigate crowds of evacuees to refuges, but also rapidly aggregate the disaster information in real time. The proposed guidance was valid in evacuation scenarios under the condition that the mobile communication is disabled by disaster. We numerically showed by simulating a simple mathematical model that the guidance effectively shortened evacuation time of the evacuees. Since the crowds of evacuees simultaneously rush to refuge areas in the evacuation, on the other hand, the emergence of congestion by evacuees is inevitable and the evacuation time could be seriously delayed by the congestion. In this paper we investigate effects of the use of congestion information on the evacuation time by switching a detour evacuation route around congested roads. We introduce three simple algorithms to divert the route and numerically compare their performances using a new stochastic congestion model. In consequence we find that the use of congestion information has less impact on the evacuation time than that of the information of impassable roads, and also that slower route switching decision coming around congested roads is worse in the performance because evacuees tend to be sandwiched between some congested areas and are forced to go back and forth in vain by repeated evacuation route changes.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"452 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125783830","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.121
I. Gushchina, W. Fengler, Jirka Ciemala, Detlef Streitferdt
The paper presents a certifiable development process applicable to hardware and software development for information processing in the measurement domain, especially the dynamic weighing technology. Thereby it is based on the developments of prototypes for new and predecessor systems and product stages. Particular attention is paid to the possibility of calibration.
{"title":"Certifiable Development Process for Information Processing in the Measurement Domain on the Base of 3W-Models","authors":"I. Gushchina, W. Fengler, Jirka Ciemala, Detlef Streitferdt","doi":"10.1109/COMPSACW.2013.121","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.121","url":null,"abstract":"The paper presents a certifiable development process applicable to hardware and software development for information processing in the measurement domain, especially the dynamic weighing technology. Thereby it is based on the developments of prototypes for new and predecessor systems and product stages. Particular attention is paid to the possibility of calibration.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"55 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124629674","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.36
Shin-Shung Chen, Tzong-Yih Kuo, Yu-Wen Chen
We present a new security software based on the NDIS filter drivers at Windows desktop computer, which focuses on filtering and dropping packets according to the snort rules released by security communities (such as Snort or Emerging Threats). TWIDS is an application designed based on the middleware of the Windows® OS, it can identify the application process that transfer packets. TWIDS can process a large number of malicious IP address in the database that it can check and drop packets effectively and improve the network security on Windows® desktop computer by using Snort related protective resources. Thus, it provides a security solution that can help to reduce the investments for network gateway and can be used by common users who used for eliminating the botnet and malware traffic. TWIDS is shared in the downloads section of the Openfoundry.org website, and it will against the spread of botnets and malware.
{"title":"Security Software Based on Windows NDIS Filter Drivers","authors":"Shin-Shung Chen, Tzong-Yih Kuo, Yu-Wen Chen","doi":"10.1109/COMPSACW.2013.36","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.36","url":null,"abstract":"We present a new security software based on the NDIS filter drivers at Windows desktop computer, which focuses on filtering and dropping packets according to the snort rules released by security communities (such as Snort or Emerging Threats). TWIDS is an application designed based on the middleware of the Windows® OS, it can identify the application process that transfer packets. TWIDS can process a large number of malicious IP address in the database that it can check and drop packets effectively and improve the network security on Windows® desktop computer by using Snort related protective resources. Thus, it provides a security solution that can help to reduce the investments for network gateway and can be used by common users who used for eliminating the botnet and malware traffic. TWIDS is shared in the downloads section of the Openfoundry.org website, and it will against the spread of botnets and malware.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128651248","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.131
Gaetana Sapienza, T. Seceleanu, I. Crnkovic
Many types of embedded systems applications are implemented as a combination of software and hardware. For such systems the mapping of the application units into hardware and software, i.e. the partitioning process, is a key phase of the design. Although there exist techniques for partitioning, the entire process, in particular in relation to different application requirements and project constraints, is not properly supported. This leads to several unplanned iterations, redesigns and interruptions due to uncontrolled dependencies between hardware and software parts. In order to overcome these problems, we provide a design process that enables the partitioning based on a multiple criteria decision analysis in a late design phase. We illustrate the proposed approach and provide a proof-of concept on an industrial case study to validate the approach applicability.
{"title":"Partitioning Decision Process for Embedded Hardware and Software Deployment","authors":"Gaetana Sapienza, T. Seceleanu, I. Crnkovic","doi":"10.1109/COMPSACW.2013.131","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.131","url":null,"abstract":"Many types of embedded systems applications are implemented as a combination of software and hardware. For such systems the mapping of the application units into hardware and software, i.e. the partitioning process, is a key phase of the design. Although there exist techniques for partitioning, the entire process, in particular in relation to different application requirements and project constraints, is not properly supported. This leads to several unplanned iterations, redesigns and interruptions due to uncontrolled dependencies between hardware and software parts. In order to overcome these problems, we provide a design process that enables the partitioning based on a multiple criteria decision analysis in a late design phase. We illustrate the proposed approach and provide a proof-of concept on an industrial case study to validate the approach applicability.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"47 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120903991","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}
Pub Date : 2013-07-22DOI: 10.1109/COMPSACW.2013.43
Asanga Nimalasena, V. Getov
Context-aware computing has been attracting growing attention in recent years. Generally, there are several ways for a context-aware system to select a course of action for a particular context change. One way is for the system developers to encompass all possible context changes in the domain knowledge. Then, the system matches a context change to that in the domain knowledge and chooses the corresponding action. Other methods include system inferences and adaptive learning whereby the system executes one action and evaluates the outcome and self-adapts/self-learns based on that. However, there are situations where a system encounters unknown contexts. In such cases, instead of one action being implemented and evaluated, multiple actions could be implemented concurrently. This parallel evaluation of actions could quicken the evolution time taken to select the best action suited to unknown context compared to the iterative approach. This paper proposes a framework for context-aware systems that finds the best action for unknown context through multi-action evaluation and self-adaptation. In a case study, we show how our multi-action evaluation system can be implemented for a hypothetical hotelier who uses the name-your-own-price mechanism to sell his perishable inventory.
{"title":"System Evolution for Unknown Context through Multi-action Evaluation","authors":"Asanga Nimalasena, V. Getov","doi":"10.1109/COMPSACW.2013.43","DOIUrl":"https://doi.org/10.1109/COMPSACW.2013.43","url":null,"abstract":"Context-aware computing has been attracting growing attention in recent years. Generally, there are several ways for a context-aware system to select a course of action for a particular context change. One way is for the system developers to encompass all possible context changes in the domain knowledge. Then, the system matches a context change to that in the domain knowledge and chooses the corresponding action. Other methods include system inferences and adaptive learning whereby the system executes one action and evaluates the outcome and self-adapts/self-learns based on that. However, there are situations where a system encounters unknown contexts. In such cases, instead of one action being implemented and evaluated, multiple actions could be implemented concurrently. This parallel evaluation of actions could quicken the evolution time taken to select the best action suited to unknown context compared to the iterative approach. This paper proposes a framework for context-aware systems that finds the best action for unknown context through multi-action evaluation and self-adaptation. In a case study, we show how our multi-action evaluation system can be implemented for a hypothetical hotelier who uses the name-your-own-price mechanism to sell his perishable inventory.","PeriodicalId":152957,"journal":{"name":"2013 IEEE 37th Annual Computer Software and Applications Conference Workshops","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-07-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123746261","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
扫码关注我们
求助内容：
应助结果提醒方式：