J. Padgett, K. Djemame, I. Gourlay, Django Armstrong
Service Level Agreements (SLAs) are facilitators for widening the commercial uptake of Grid technology. They provide explicit statements of expectation and obligation between service consumers and providers. However, without the ability to assess the probability that an SLA might fail, commercial uptake will be restricted, since neither party will be willing to agree. Therefore, risk assessment mechanisms are critical to increase confidence in Grid technology usage within the commercial sector. This paper presents an SLA brokering mechanism including risk assessment techniques which evaluate the probability of SLA failure. WS-Agreement and risk metrics are used to facilitate SLA creation between service consumers and providers within a typical Grid resource usage scenario.
{"title":"Risk-Aware SLA Brokering Using WS-Agreement","authors":"J. Padgett, K. Djemame, I. Gourlay, Django Armstrong","doi":"10.1109/WAINA.2009.72","DOIUrl":"https://doi.org/10.1109/WAINA.2009.72","url":null,"abstract":"Service Level Agreements (SLAs) are facilitators for widening the commercial uptake of Grid technology. They provide explicit statements of expectation and obligation between service consumers and providers. However, without the ability to assess the probability that an SLA might fail, commercial uptake will be restricted, since neither party will be willing to agree. Therefore, risk assessment mechanisms are critical to increase confidence in Grid technology usage within the commercial sector. This paper presents an SLA brokering mechanism including risk assessment techniques which evaluate the probability of SLA failure. WS-Agreement and risk metrics are used to facilitate SLA creation between service consumers and providers within a typical Grid resource usage scenario.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124774481","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}
Sensing context information and making it available to the people, involved in coordinating a collaborative task, is a preliminary phase in making a system adaptable to the prevailing situation in pervasive environments. However, the diversity of the sources of context information, the characteristics of pervasive environments, and the nature of collaborative tasks pose a stern challenge to the efficient management of context information by sensing a lot of redundant and conflicting information. Quality of Context parameters can be used to resolve the conflicts in context information. In this paper, we present a context aggregation system that detects and removes the duplicates and conflicts from context information by using the policies based on Quality of Context parameters. This system effectively aggregates the continuously evolving context information and efficiently uses the scare resources in pervasive environments.
{"title":"Quality Aware Context Information Aggregation System for Pervasive Environments","authors":"A. Manzoor, Hong Linh Truong, S. Dustdar","doi":"10.1109/WAINA.2009.144","DOIUrl":"https://doi.org/10.1109/WAINA.2009.144","url":null,"abstract":"Sensing context information and making it available to the people, involved in coordinating a collaborative task, is a preliminary phase in making a system adaptable to the prevailing situation in pervasive environments. However, the diversity of the sources of context information, the characteristics of pervasive environments, and the nature of collaborative tasks pose a stern challenge to the efficient management of context information by sensing a lot of redundant and conflicting information. Quality of Context parameters can be used to resolve the conflicts in context information. In this paper, we present a context aggregation system that detects and removes the duplicates and conflicts from context information by using the policies based on Quality of Context parameters. This system effectively aggregates the continuously evolving context information and efficiently uses the scare resources in pervasive environments.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125666580","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}
Discovering subtle alterations of pairs of images taken from the same scene at different time intervals is called minute change detection problem. To achieve this goal, we have developed a framework that captures and highlights minute changes in digital images that are otherwise hidden to the human eye. Moreover, unnoticeable differences from image pairs that are taken at different time intervals with similar viewing conditions are detected. Although our framework's application areas cover a wide variety of different disciplines, from medicine to security, weather forecasting, urban planning, and monitoring natural disasters, in this study our focus was real-time minute change detection and tracking on biomedical and satellite images. Real-time performance in cases such as medicine is crucial; we enhance this approach by using the extensive computational power of the graphical processing unit (GPU). Our experimental results in detection of subtle changes in light microscopic images of mouse MC3T3-E1 osteoblastic cells grown in culture with the resolution of 2600x2060 and remote sensor images performed by the GPU computations illustrate that our algorithm detects infinitesimal differences on images in real-time.
{"title":"Real-time Minute Change Detection on GPU for Cellular and Remote Sensor Imaging","authors":"S. Kockara, Tansel Halic, Coskun Bayrak","doi":"10.1109/WAINA.2009.202","DOIUrl":"https://doi.org/10.1109/WAINA.2009.202","url":null,"abstract":"Discovering subtle alterations of pairs of images taken from the same scene at different time intervals is called minute change detection problem. To achieve this goal, we have developed a framework that captures and highlights minute changes in digital images that are otherwise hidden to the human eye. Moreover, unnoticeable differences from image pairs that are taken at different time intervals with similar viewing conditions are detected. Although our framework's application areas cover a wide variety of different disciplines, from medicine to security, weather forecasting, urban planning, and monitoring natural disasters, in this study our focus was real-time minute change detection and tracking on biomedical and satellite images. Real-time performance in cases such as medicine is crucial; we enhance this approach by using the extensive computational power of the graphical processing unit (GPU). Our experimental results in detection of subtle changes in light microscopic images of mouse MC3T3-E1 osteoblastic cells grown in culture with the resolution of 2600x2060 and remote sensor images performed by the GPU computations illustrate that our algorithm detects infinitesimal differences on images in real-time.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"81 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130398304","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}
IETF(Internet Engineering Task Force) proposed the Management Mechanism of NEMO (NEtwork MObility) to support network mobility. The mobility management of NEMO is an extension of Mobile IPv6 (MIPv6), and it inherits also all the drawbacks of MIPv6 such as inefficient routing, high handover latency, packet loss rate, and so on.The purpose of method which is based on the public transportations (e.g. Train, MRT, Bus etc.) with fixed path as NEMO application solved the handover latency problem and packet lost problem. We propose a seamless handover Scheme with Pre-registration to solve these problems. The proposed handover scheme can decrease handover latency and packet lost in session for NEMO. The aim is to procure seamless communication when the whole network is movement.KeyWords : NeMo, Pre-registration
{"title":"A Seamless Handover Scheme with Pre-registration in NEMO","authors":"Ying-Hong Wang, Kuo-Feng Huang, H. Ho","doi":"10.1109/WAINA.2009.13","DOIUrl":"https://doi.org/10.1109/WAINA.2009.13","url":null,"abstract":"IETF(Internet Engineering Task Force) proposed the Management Mechanism of NEMO (NEtwork MObility) to support network mobility. The mobility management of NEMO is an extension of Mobile IPv6 (MIPv6), and it inherits also all the drawbacks of MIPv6 such as inefficient routing, high handover latency, packet loss rate, and so on.The purpose of method which is based on the public transportations (e.g. Train, MRT, Bus etc.) with fixed path as NEMO application solved the handover latency problem and packet lost problem. We propose a seamless handover Scheme with Pre-registration to solve these problems. The proposed handover scheme can decrease handover latency and packet lost in session for NEMO. The aim is to procure seamless communication when the whole network is movement.KeyWords : NeMo, Pre-registration","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128839446","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 advent of cluster computing introduced some years ago the need for taking into account the communications that take place on distributed computer architectures when executing applications. In that environment, different communication-aware mapping techniques were proposed for improving the system performance, both for off-chip and for on-chip networks. Some of these proposals are based on heuristic search for finding pseudo-optimal assignments of a given population of tasks and processing elements. However, the technology has allowed a significant increase in the problem size, arising the scalability problem. In this paper, we propose the use of an evolutionary computation framework to implement a genetic algorithm that can significantly improve the scalability of communication-aware task mapping techniques. We have studied different genetic operators and selection mechanisms, choosing those providing the best performance for this particular problem. The performance evaluation results shows that for medium and large domain spaces, the genetic algorithm provides better solutions while requiring lower or similar execution times. These results indicate that the heuristic search based on genetic algorithms can improve the scalability of communication-aware task mapping techniques for both cluster computing and Networks-on-Chip.
{"title":"Improving the Scalability of Communication-Aware Task Mapping Techniques","authors":"Raul Soriano, J. Orduña","doi":"10.1109/WAINA.2009.91","DOIUrl":"https://doi.org/10.1109/WAINA.2009.91","url":null,"abstract":"The advent of cluster computing introduced some years ago the need for taking into account the communications that take place on distributed computer architectures when executing applications. In that environment, different communication-aware mapping techniques were proposed for improving the system performance, both for off-chip and for on-chip networks. Some of these proposals are based on heuristic search for finding pseudo-optimal assignments of a given population of tasks and processing elements. However, the technology has allowed a significant increase in the problem size, arising the scalability problem. In this paper, we propose the use of an evolutionary computation framework to implement a genetic algorithm that can significantly improve the scalability of communication-aware task mapping techniques. We have studied different genetic operators and selection mechanisms, choosing those providing the best performance for this particular problem. The performance evaluation results shows that for medium and large domain spaces, the genetic algorithm provides better solutions while requiring lower or similar execution times. These results indicate that the heuristic search based on genetic algorithms can improve the scalability of communication-aware task mapping techniques for both cluster computing and Networks-on-Chip.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129509837","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 issue of digital identity is at the heart of many contemporary strategic innovations, covering crime, internal and external security, business models etc. The area of MANets (Mobile Ad-hoc Networks) is still in its infancy in the research community, but it plays a vital role surrounded by the growing trend of mobile technology for business, private and governmental uses. The emergent notion of ubiquitous computing makes it possible for mobile devices to communicate and provide services via networks connected in an ad-hoc manner. In this paper we present the current research issues within the field of MANets and highlight some challenges for future studies. The main focus is on the area of identity management (IM), context-awareness and user-centricity for MANets together with its security issues and implications. We conclude with the need of a research into the area of IMMANets.
{"title":"Towards a Context-Aware Identity Management in Mobile Ad Hoc Networks (IMMANets)","authors":"A. Arabo, Q. Shi, M. Merabti","doi":"10.1109/WAINA.2009.32","DOIUrl":"https://doi.org/10.1109/WAINA.2009.32","url":null,"abstract":"The issue of digital identity is at the heart of many contemporary strategic innovations, covering crime, internal and external security, business models etc. The area of MANets (Mobile Ad-hoc Networks) is still in its infancy in the research community, but it plays a vital role surrounded by the growing trend of mobile technology for business, private and governmental uses. The emergent notion of ubiquitous computing makes it possible for mobile devices to communicate and provide services via networks connected in an ad-hoc manner. In this paper we present the current research issues within the field of MANets and highlight some challenges for future studies. The main focus is on the area of identity management (IM), context-awareness and user-centricity for MANets together with its security issues and implications. We conclude with the need of a research into the area of IMMANets.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"278 ","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"120860934","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 emerging heterogeneity of data management, programming models and operating platforms in sensor nodes are making the seamless interoperation of devices a challenge. We consider this problem and leverage on the concepts of semantic web and service-oriented design to propose a model that adds a semantics and service-oriented layer to existing network models. This added layer hides the hardware as well as software implementation details from the application layer and thus allows seamless data management between nodes whose capabilities may even be unknown. The proposed model builds on top of well established standards OWL and OWL-S to encapsulate sensor data and services as hierarchical ontology and provides interfaces for service advertisement and discovery. A case study has been discussed whereby the proposed model is used for service-oriented data management (acquisition, archival, processing).
{"title":"A Service Oriented Model for Semantics-Based Data Management in Wireless Sensor Networks","authors":"M. Iqbal, H. Lim, Wenqiang Wang, Yuxia Yao","doi":"10.1109/WAINA.2009.130","DOIUrl":"https://doi.org/10.1109/WAINA.2009.130","url":null,"abstract":"The emerging heterogeneity of data management, programming models and operating platforms in sensor nodes are making the seamless interoperation of devices a challenge. We consider this problem and leverage on the concepts of semantic web and service-oriented design to propose a model that adds a semantics and service-oriented layer to existing network models. This added layer hides the hardware as well as software implementation details from the application layer and thus allows seamless data management between nodes whose capabilities may even be unknown. The proposed model builds on top of well established standards OWL and OWL-S to encapsulate sensor data and services as hierarchical ontology and provides interfaces for service advertisement and discovery. A case study has been discussed whereby the proposed model is used for service-oriented data management (acquisition, archival, processing).","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121267631","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}
This research aims to provide a tool to doctors in order to help for diagnosis of BRCA1 hereditary breast cancer. Our goal is to determine, if possible, profiles that are responsible for early cancer onset. In order to extract knowledge from the biological information above we will create a relational database that will allow prognosticating cancer apparition. We want to determine different types responsible for different profiles of cancer onset thanks to machine learning programs. The prognostic will rely on polymorphisms of a gene, BRCA1, but on family history as well. The machine learning software(s) will be used as a tool by doctors as a help for diagnosis. This tool will be used in order to determine if these patients are member of a high risk cluster, an early occurring cancer.
{"title":"Machine Learning Applied to BRCA1 Hereditary Breast Cancer Data","authors":"A. Doncescu, Baptiste Tauzain, N. Kabbaj","doi":"10.1109/WAINA.2009.165","DOIUrl":"https://doi.org/10.1109/WAINA.2009.165","url":null,"abstract":"This research aims to provide a tool to doctors in order to help for diagnosis of BRCA1 hereditary breast cancer. Our goal is to determine, if possible, profiles that are responsible for early cancer onset. In order to extract knowledge from the biological information above we will create a relational database that will allow prognosticating cancer apparition. We want to determine different types responsible for different profiles of cancer onset thanks to machine learning programs. The prognostic will rely on polymorphisms of a gene, BRCA1, but on family history as well. The machine learning software(s) will be used as a tool by doctors as a help for diagnosis. This tool will be used in order to determine if these patients are member of a high risk cluster, an early occurring cancer.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121367975","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 this paper, we present security primitives required to achieve privacy in content-based opportunistic networks. We define three privacy models adapted to content-based networking and detail what are the requirements that the security primitives have to achieve in order to fit in each of these models. We also propose an original approach based on multiple layer commutative encryption that features full privacy content-based networking.
{"title":"Privacy in Content-Based Opportunistic Networks","authors":"Abdullatif Shikfa, Melek Önen, R. Molva","doi":"10.1109/WAINA.2009.73","DOIUrl":"https://doi.org/10.1109/WAINA.2009.73","url":null,"abstract":"In this paper, we present security primitives required to achieve privacy in content-based opportunistic networks. We define three privacy models adapted to content-based networking and detail what are the requirements that the security primitives have to achieve in order to fit in each of these models. We also propose an original approach based on multiple layer commutative encryption that features full privacy content-based networking.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131061500","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}
This paper presents the premisses of a new modular framework and a large scale experiment that we will launch for social opportunistic networks. The new framework aims at activating specific protocols depending on the application requirements. The experiment involves several students who will be equipped with PDA. Our goal is to study how the social interaction between users impact the behavior of opportunistic routing algorithms. By presenting this experiment, we are looking for the feedback from the community and to extend our experiment to other universities / campus.
{"title":"Opportunistic Social Network Experiments","authors":"N. Montavont, Safaà Hachana, Lucien Loiseau","doi":"10.1109/WAINA.2009.134","DOIUrl":"https://doi.org/10.1109/WAINA.2009.134","url":null,"abstract":"This paper presents the premisses of a new modular framework and a large scale experiment that we will launch for social opportunistic networks. The new framework aims at activating specific protocols depending on the application requirements. The experiment involves several students who will be equipped with PDA. Our goal is to study how the social interaction between users impact the behavior of opportunistic routing algorithms. By presenting this experiment, we are looking for the feedback from the community and to extend our experiment to other universities / campus.","PeriodicalId":159465,"journal":{"name":"2009 International Conference on Advanced Information Networking and Applications Workshops","volume":"64 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-05-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116981236","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
扫码关注我们
求助内容：
应助结果提醒方式：