Pub Date : 2015-02-11DOI: 10.5220/0005323702240229
A. Chandra, J. Blumenstein, T. Mikulášek, Josef Vychodil, Martin Pospísil, R. Maršálek, A. Prokeš, T. Zemen, C. Mecklenbräuker
A comparison of two variants of CLEAN, a time-domain serial subtractive deconvolution algorithm, is presented. Appropriate statistical metrics for assessing the relative merit of the deconvolution technique are identified in the context of intra vehicle ultra wide band transmission, and the better variant was selected based on its performance over a standard IEEE channel simulation testbed. The chosen method is then applied to extract important channel characteristics for a real-world channel sounding experiment performed inside a passenger car.
{"title":"CLEAN algorithms for intra-vehicular time-domain UWB channel sounding","authors":"A. Chandra, J. Blumenstein, T. Mikulášek, Josef Vychodil, Martin Pospísil, R. Maršálek, A. Prokeš, T. Zemen, C. Mecklenbräuker","doi":"10.5220/0005323702240229","DOIUrl":"https://doi.org/10.5220/0005323702240229","url":null,"abstract":"A comparison of two variants of CLEAN, a time-domain serial subtractive deconvolution algorithm, is presented. Appropriate statistical metrics for assessing the relative merit of the deconvolution technique are identified in the context of intra vehicle ultra wide band transmission, and the better variant was selected based on its performance over a standard IEEE channel simulation testbed. The chosen method is then applied to extract important channel characteristics for a real-world channel sounding experiment performed inside a passenger car.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122369575","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 : 2015-02-11DOI: 10.5220/0005330201740179
K. Hammoudi, N. Ajam, Mohamed Kasraoui, F. Dornaika, Karan Radhakrishnan, Karthik Bandi, Qing Cai, Sai Liu
In this paper, we propose a design for novel and experimental cloud computing systems. The proposed system aims at enhancing computational, communicational and annalistic capabilities of road navigation services by merging several independent technologies, namely vision-based embedded navigation systems, prominent Cloud Computing Systems (CCSs) and Vehicular Ad-hoc NETwork (VANET). This work presents our initial investigations by describing the design of a global generic system. The designed system has been experimented with various scenarios of video-based road services. Moreover, the associated architecture has been implemented on a small-scale simulator of an in-vehicle embedded system. The implemented architecture has been experimented in the case of a simulated road service to aid the police agency. The goal of this service is to recognize and track searched individuals and vehicles in a real-time monitoring system remotely connected to moving cars. The presented work demonstrates the potential of our system for efficiently enhancing and diversifying real-time video services in road environments.
{"title":"Design, implementation and simulation of an experimental processing architecture for enhancing real-time video services by combining VANET, cloud computing system and onboard navigation system","authors":"K. Hammoudi, N. Ajam, Mohamed Kasraoui, F. Dornaika, Karan Radhakrishnan, Karthik Bandi, Qing Cai, Sai Liu","doi":"10.5220/0005330201740179","DOIUrl":"https://doi.org/10.5220/0005330201740179","url":null,"abstract":"In this paper, we propose a design for novel and experimental cloud computing systems. The proposed system aims at enhancing computational, communicational and annalistic capabilities of road navigation services by merging several independent technologies, namely vision-based embedded navigation systems, prominent Cloud Computing Systems (CCSs) and Vehicular Ad-hoc NETwork (VANET). This work presents our initial investigations by describing the design of a global generic system. The designed system has been experimented with various scenarios of video-based road services. Moreover, the associated architecture has been implemented on a small-scale simulator of an in-vehicle embedded system. The implemented architecture has been experimented in the case of a simulated road service to aid the police agency. The goal of this service is to recognize and track searched individuals and vehicles in a real-time monitoring system remotely connected to moving cars. The presented work demonstrates the potential of our system for efficiently enhancing and diversifying real-time video services in road environments.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"2016 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127375976","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 : 2015-02-11DOI: 10.5220/0005243302090216
S. Elsayed, M. Elsabrouty
Efficient video acquisition and coding techniques have received increasing attention due to the wide spread of multimedia telecommunication. Compressed Sensing (CS) is an emerging technology, which enables acquiring video in a compressed manner. CS proves to be very powerful for energy constrained devices that benefit from processing at lower sampling rates. In this paper, a framework for compressed video sensing (CVS) that relies on an efficient fixed perceptual weighting strategy is adopted for acquisition and recovery. The proposed compressed sensing strategy focuses the measurements on the most perceptually pronounced coefficients. Three weighting schemes are developed and compared with standard CS. Simulation results demonstrate that the proposed framework provides a significant improvement in its three different setups over standard CS in terms of both standard and perceptual objective quality assessment metrics.
{"title":"Perceptually weighted compressed sensing for video acquisition","authors":"S. Elsayed, M. Elsabrouty","doi":"10.5220/0005243302090216","DOIUrl":"https://doi.org/10.5220/0005243302090216","url":null,"abstract":"Efficient video acquisition and coding techniques have received increasing attention due to the wide spread of multimedia telecommunication. Compressed Sensing (CS) is an emerging technology, which enables acquiring video in a compressed manner. CS proves to be very powerful for energy constrained devices that benefit from processing at lower sampling rates. In this paper, a framework for compressed video sensing (CVS) that relies on an efficient fixed perceptual weighting strategy is adopted for acquisition and recovery. The proposed compressed sensing strategy focuses the measurements on the most perceptually pronounced coefficients. Three weighting schemes are developed and compared with standard CS. Simulation results demonstrate that the proposed framework provides a significant improvement in its three different setups over standard CS in terms of both standard and perceptual objective quality assessment metrics.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"30 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114876217","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 : 2015-02-11DOI: 10.5220/0005341103580362
Hussein El Ghor, M. Chetto
The effectiveness of a real-time scheduling algorithm depends on both its ability to schedule feasible task sets and its runtime overhead. In this paper, we investigate overheads incurred by a scheduler dedicated to embedded systems that are powered by renewable energy. We specifically focus on the overhead cost of an EDF-based scheduler known as ED-H. We analyze the number of tasks factor that can possibly affect the resulting performance of ED-H. The simulation experiments demonstrate that the implementation costs of ED-H remain acceptable so as to make it a practicable scheduler.
{"title":"Overhead considerations in real-time energy harvesting systems","authors":"Hussein El Ghor, M. Chetto","doi":"10.5220/0005341103580362","DOIUrl":"https://doi.org/10.5220/0005341103580362","url":null,"abstract":"The effectiveness of a real-time scheduling algorithm depends on both its ability to schedule feasible task sets and its runtime overhead. In this paper, we investigate overheads incurred by a scheduler dedicated to embedded systems that are powered by renewable energy. We specifically focus on the overhead cost of an EDF-based scheduler known as ED-H. We analyze the number of tasks factor that can possibly affect the resulting performance of ED-H. The simulation experiments demonstrate that the implementation costs of ED-H remain acceptable so as to make it a practicable scheduler.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122087697","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 : 2015-02-11DOI: 10.5220/0005244601240131
Raja Oueslati, O. Mosbahi, M. Khalgui, S. Ahmed
The paper deals with the modeling and verification of B based Distributed Reconfigurable Control Systems (DRCS). A distributed multi-agent architecture is developed, where for each system is affected a Reconfiguration Agent to apply a local automatic reconfiguration, and a Coordination Agent is proposed to harmonize between systems when any local reconfiguration is applied in a system. We apply the Distributed Reconfigurable B "DR-B" formalism to define all possible behaviors, to determine reconfiguration functions for each system and to execute the appropriate ones to respond to reconfiguration requests and to switch between the specific distributed configuration at run-time to cope with the coherence of running systems. We verify a DRCS by using the B method. The goal is to guarantee the consistency and the correctness of the abstract specification level. Further more, to avoid combinatorial explosion problem in DRCS, we apply the "Check R-B" tool, to reduce redundant checking of different behaviors sharing similar operations. All the contributions of this work are applied to two benchmark production systems FESTO and EnAS.
{"title":"Modeling and verification of B-based distributed reconfigurable control systems","authors":"Raja Oueslati, O. Mosbahi, M. Khalgui, S. Ahmed","doi":"10.5220/0005244601240131","DOIUrl":"https://doi.org/10.5220/0005244601240131","url":null,"abstract":"The paper deals with the modeling and verification of B based Distributed Reconfigurable Control Systems (DRCS). A distributed multi-agent architecture is developed, where for each system is affected a Reconfiguration Agent to apply a local automatic reconfiguration, and a Coordination Agent is proposed to harmonize between systems when any local reconfiguration is applied in a system. We apply the Distributed Reconfigurable B \"DR-B\" formalism to define all possible behaviors, to determine reconfiguration functions for each system and to execute the appropriate ones to respond to reconfiguration requests and to switch between the specific distributed configuration at run-time to cope with the coherence of running systems. We verify a DRCS by using the B method. The goal is to guarantee the consistency and the correctness of the abstract specification level. Further more, to avoid combinatorial explosion problem in DRCS, we apply the \"Check R-B\" tool, to reduce redundant checking of different behaviors sharing similar operations. All the contributions of this work are applied to two benchmark production systems FESTO and EnAS.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127824421","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 : 2015-02-11DOI: 10.5220/0005234202390246
Fouad Khenfri, K. Chaaban, M. Chetto
This paper describes a novel algorithm that permits to automate the process to map runnables to tasks in any AUTOSAR architecture. This enables to boost system performance by reducing the number of tasks to be implemented and while preserving system schedulability. Our algorithm uses some properties related to the activation offset for mapping runnables with distinct periods to the same task. We consider periodic, independent and fixed-priority tasks running on a single processor. The results of an experimental study are reported. First, they show that our algorithm reduces significantly the number of tasks with distinct periods while preserving system schedulability. And second, the system schedulability bound is increased by 34% compared to the typical periodic solution and the average response time of tasks is reduced by 30% related to ohers solutions.
{"title":"A novel heuristic algorithm for mapping AUTOSAR runnables to tasks","authors":"Fouad Khenfri, K. Chaaban, M. Chetto","doi":"10.5220/0005234202390246","DOIUrl":"https://doi.org/10.5220/0005234202390246","url":null,"abstract":"This paper describes a novel algorithm that permits to automate the process to map runnables to tasks in any AUTOSAR architecture. This enables to boost system performance by reducing the number of tasks to be implemented and while preserving system schedulability. Our algorithm uses some properties related to the activation offset for mapping runnables with distinct periods to the same task. We consider periodic, independent and fixed-priority tasks running on a single processor. The results of an experimental study are reported. First, they show that our algorithm reduces significantly the number of tasks with distinct periods while preserving system schedulability. And second, the system schedulability bound is increased by 34% compared to the typical periodic solution and the average response time of tasks is reduced by 30% related to ohers solutions.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129368737","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 : 2015-02-11DOI: 10.5220/0005324401540159
M. Shoaib, S. Bosch, Özlem Durmaz Incel, H. Scholten, P. Havinga
Many context-aware applications based on activity recognition are currently using mobile phones. Most of this work is done in an offline way. However, there is a shift towards an online approach in recent studies, where activity recognition systems are implemented on mobile phones. Unfortunately, most of these studies lack proper reproducibility, resource consumption analysis, validation, position-independence, and personalization. Moreover, they are hard to compare in various aspects due to different experimental setups. In this paper, we present a short overview of the current research on online activity recognition using mobile phones, and highlight their limitations. We discuss these studies in terms of various aspects, such as their experimental setups, position-independence, resource consumption analysis, performance evaluation, and validation. Based on this analysis, we define a roadmap towards a better comparative research on online activity recognition using mobile phones.
{"title":"Defining a roadmap towards comparative research in online activity recognition on mobile phones","authors":"M. Shoaib, S. Bosch, Özlem Durmaz Incel, H. Scholten, P. Havinga","doi":"10.5220/0005324401540159","DOIUrl":"https://doi.org/10.5220/0005324401540159","url":null,"abstract":"Many context-aware applications based on activity recognition are currently using mobile phones. Most of this work is done in an offline way. However, there is a shift towards an online approach in recent studies, where activity recognition systems are implemented on mobile phones. Unfortunately, most of these studies lack proper reproducibility, resource consumption analysis, validation, position-independence, and personalization. Moreover, they are hard to compare in various aspects due to different experimental setups. In this paper, we present a short overview of the current research on online activity recognition using mobile phones, and highlight their limitations. We discuss these studies in terms of various aspects, such as their experimental setups, position-independence, resource consumption analysis, performance evaluation, and validation. Based on this analysis, we define a roadmap towards a better comparative research on online activity recognition using mobile phones.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121966356","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 : 2015-02-11DOI: 10.5220/0005230400980103
Osama Mabrouk Khaled, H. Hosny, M. Shalan
An efficient development strategy for pervasive computing requires that the smart object manufacturers design their devices with profound facilities that can be accessible for developers. In our in-progress research, we present a high level design for smart object essential handlers. This design establishes rules and regulations for the development of pervasive computing in general and promotes for quality in pervasive systems in particular.
{"title":"On the road to a reference architecture for pervasive computing","authors":"Osama Mabrouk Khaled, H. Hosny, M. Shalan","doi":"10.5220/0005230400980103","DOIUrl":"https://doi.org/10.5220/0005230400980103","url":null,"abstract":"An efficient development strategy for pervasive computing requires that the smart object manufacturers design their devices with profound facilities that can be accessible for developers. In our in-progress research, we present a high level design for smart object essential handlers. This design establishes rules and regulations for the development of pervasive computing in general and promotes for quality in pervasive systems in particular.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114459399","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 : 2015-02-11DOI: 10.5220/0005229900830089
B. Gâteau, J. Rykowski
In this paper a new approach to complex comfort management is presented, aiming in automatic treatment of different comfort parameters by means of Internet-of-Things devices and multi-agent system. The paper presents a new model of e-comfort, based on common treatment of all the parameters as identified across the Maslow's hierarchy of needs. Next, a new architecture of e-comfort management is discussed, based on two layers: low-level layer of IoT devices, representing at-the-place possibilities of the system, and upper layer of software agents, formulating and negotiating the needs and expectations of human users.
{"title":"Personal e-comfort modelling and management based on multi-agent system and Internet of Things network","authors":"B. Gâteau, J. Rykowski","doi":"10.5220/0005229900830089","DOIUrl":"https://doi.org/10.5220/0005229900830089","url":null,"abstract":"In this paper a new approach to complex comfort management is presented, aiming in automatic treatment of different comfort parameters by means of Internet-of-Things devices and multi-agent system. The paper presents a new model of e-comfort, based on common treatment of all the parameters as identified across the Maslow's hierarchy of needs. Next, a new architecture of e-comfort management is discussed, based on two layers: low-level layer of IoT devices, representing at-the-place possibilities of the system, and upper layer of software agents, formulating and negotiating the needs and expectations of human users.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131783646","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 : 2015-02-11DOI: 10.5220/0005238702750280
Adam Górski, M. Ogorzałek
In this work, a genetic programming methodology for co-synthesis of multiprocessor systems is presented. Genotype is a tree which nodes include system construction procedures. Thus the design methodology is evolving. Next generations are obtained using genetic operators: mutation, reproduction and crossover. Unlike other algorithms in presented methodology number of individuals obtained by mutation operator is not const. Therefore number of individuals in each population is increasing. The size of final generation is found by the algorithm.
{"title":"GP-based methodology for HW/SW co-synthesis of multiprocessor embedded systems with increasing number of individuals obtained by mutation","authors":"Adam Górski, M. Ogorzałek","doi":"10.5220/0005238702750280","DOIUrl":"https://doi.org/10.5220/0005238702750280","url":null,"abstract":"In this work, a genetic programming methodology for co-synthesis of multiprocessor systems is presented. Genotype is a tree which nodes include system construction procedures. Thus the design methodology is evolving. Next generations are obtained using genetic operators: mutation, reproduction and crossover. Unlike other algorithms in presented methodology number of individuals obtained by mutation operator is not const. Therefore number of individuals in each population is increasing. The size of final generation is found by the algorithm.","PeriodicalId":345016,"journal":{"name":"2015 International Conference on Pervasive and Embedded Computing and Communication Systems (PECCS)","volume":"112 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-02-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124812775","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
扫码关注我们
求助内容：
应助结果提醒方式：