Pub Date : 2016-01-01DOI: 10.1186/s13639-016-0052-8
Xiang Zhou
{"title":"Distributed crowd filtering mechanism based on heterogeneous network delay and data packet loss constraint","authors":"Xiang Zhou","doi":"10.1186/s13639-016-0052-8","DOIUrl":"https://doi.org/10.1186/s13639-016-0052-8","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13639-016-0052-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713225","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 : 2016-01-01DOI: 10.1186/s13639-016-0058-2
Hai-yan Wu, Wei-ping Li, Jin Wang
{"title":"Network overhead crowd management mechanism of virtual mobile Internet","authors":"Hai-yan Wu, Wei-ping Li, Jin Wang","doi":"10.1186/s13639-016-0058-2","DOIUrl":"https://doi.org/10.1186/s13639-016-0058-2","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13639-016-0058-2","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713408","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 : 2016-01-01DOI: 10.1186/S13639-016-0062-6
Yang Zhang
{"title":"Optimization strategy of mobile data transmission based on optimal crowd feedback","authors":"Yang Zhang","doi":"10.1186/S13639-016-0062-6","DOIUrl":"https://doi.org/10.1186/S13639-016-0062-6","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2016-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/S13639-016-0062-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713025","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-12-26DOI: 10.1186/s13639-015-0021-7
Chunhua Dong, Li Wang, Kunming Zhao
{"title":"Embedded mobile crowd service systems based on opportunistic geological grid and dynamical segmentation","authors":"Chunhua Dong, Li Wang, Kunming Zhao","doi":"10.1186/s13639-015-0021-7","DOIUrl":"https://doi.org/10.1186/s13639-015-0021-7","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13639-015-0021-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713018","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-12-17DOI: 10.1186/s13639-016-0041-y
Matthias Altmann, Peter Schlegl, Klaus Volbert
{"title":"A low-power wireless system for energy consumption analysis at mains sockets","authors":"Matthias Altmann, Peter Schlegl, Klaus Volbert","doi":"10.1186/s13639-016-0041-y","DOIUrl":"https://doi.org/10.1186/s13639-016-0041-y","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-12-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13639-016-0041-y","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713178","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}
Since human beings have limited perceptual abilities, in many digital signal processing (DSP) applications, e.g., image and video processing, the outputs do not need to be computed accurately. Instead, their computation can be approximated so that the area, delay, and/or power dissipation of the design can be reduced. This paper presents an approximation algorithm, called aura, for the multiplierless design of the constant matrix vector multiplication (CMVM) which is a ubiquitous operation in DSP systems. aura aims to tune the constants such that the resulting matrix leads to a CMVM design which requires the fewest adders/subtractors, satisfying the given error constraints. This paper also introduces its modified version, called aura-dc, which can reduce the delay of the CMVM operation with a small increase in the number of adders/subtractors. Experimental results show that the proposed algorithms yield significant reductions in the number of adders/subtractors with respect to the original realizations without violating the error constraints, and consequently lead to CMVM designs with less area, delay, and power dissipation. Moreover, they can generate alternative CMVM designs under different error constraints, enabling a designer to choose the one that fits best in an application.
{"title":"A novel method for the approximation of multiplierless constant matrix vector multiplication","authors":"L. Aksoy, P. Flores, J. Monteiro","doi":"10.1109/EUC.2015.27","DOIUrl":"https://doi.org/10.1109/EUC.2015.27","url":null,"abstract":"Since human beings have limited perceptual abilities, in many digital signal processing (DSP) applications, e.g., image and video processing, the outputs do not need to be computed accurately. Instead, their computation can be approximated so that the area, delay, and/or power dissipation of the design can be reduced. This paper presents an approximation algorithm, called aura, for the multiplierless design of the constant matrix vector multiplication (CMVM) which is a ubiquitous operation in DSP systems. aura aims to tune the constants such that the resulting matrix leads to a CMVM design which requires the fewest adders/subtractors, satisfying the given error constraints. This paper also introduces its modified version, called aura-dc, which can reduce the delay of the CMVM operation with a small increase in the number of adders/subtractors. Experimental results show that the proposed algorithms yield significant reductions in the number of adders/subtractors with respect to the original realizations without violating the error constraints, and consequently lead to CMVM designs with less area, delay, and power dissipation. Moreover, they can generate alternative CMVM designs under different error constraints, enabling a designer to choose the one that fits best in an application.","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/EUC.2015.27","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62281712","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}
Cláudio Maia, P. Yomsi, Luís Nogueira, L. M. Pinho
This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks using work-stealing, 2015) where we address the semi-partitioned scheduling of real-time fork-join tasks on multicore platforms. The proposed approach consists of two phases: an offline phase where we adopt a multi-frame task model to perform the task-to-core mapping so as to improve the schedulability and the performance of the system and an online phase where we use the work-stealing algorithm to exploit tasks’ parallelism among cores with the aim of improving the system responsiveness. The objective of this work is twofold: (1) to provide an alternative scheduling technique that takes advantage of the semi-partitioned properties to accommodate fork-join tasks that cannot be scheduled in any pure partitioned environment and (2) to reduce the migration overheads which has been shown to be a traditional major source of non-determinism for global scheduling approaches. In this paper, we consider different allocation heuristics and we evaluate the behavior of two of them when they are integrated within our approach. The simulation results show an improvement up to 15% of the proposed heuristic over the state-of-the-art in terms of the average response time per task set.
{"title":"Real-time semi-partitioned scheduling of fork-join tasks using work-stealing","authors":"Cláudio Maia, P. Yomsi, Luís Nogueira, L. M. Pinho","doi":"10.1109/EUC.2015.30","DOIUrl":"https://doi.org/10.1109/EUC.2015.30","url":null,"abstract":"This paper extends the work presented in Maia et al. (Semi-partitioned scheduling of fork-join tasks using work-stealing, 2015) where we address the semi-partitioned scheduling of real-time fork-join tasks on multicore platforms. The proposed approach consists of two phases: an offline phase where we adopt a multi-frame task model to perform the task-to-core mapping so as to improve the schedulability and the performance of the system and an online phase where we use the work-stealing algorithm to exploit tasks’ parallelism among cores with the aim of improving the system responsiveness. The objective of this work is twofold: (1) to provide an alternative scheduling technique that takes advantage of the semi-partitioned properties to accommodate fork-join tasks that cannot be scheduled in any pure partitioned environment and (2) to reduce the migration overheads which has been shown to be a traditional major source of non-determinism for global scheduling approaches. In this paper, we consider different allocation heuristics and we evaluate the behavior of two of them when they are integrated within our approach. The simulation results show an improvement up to 15% of the proposed heuristic over the state-of-the-art in terms of the average response time per task set.","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1109/EUC.2015.30","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"62281276","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-09-29DOI: 10.1186/S13639-015-0020-8
K. S. Luckow, C. Pasareanu, Bent Thomsen
{"title":"Symbolic execution and timed automata model checking for timing analysis of Java real-time systems","authors":"K. S. Luckow, C. Pasareanu, Bent Thomsen","doi":"10.1186/S13639-015-0020-8","DOIUrl":"https://doi.org/10.1186/S13639-015-0020-8","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/S13639-015-0020-8","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65713005","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-01-21DOI: 10.1186/s13639-014-0019-6
J. Diguet, N. Bergmann, Jean-Christophe Morgère
{"title":"Dedicated object processor for mobile augmented reality - sailor assistance case study","authors":"J. Diguet, N. Bergmann, Jean-Christophe Morgère","doi":"10.1186/s13639-014-0019-6","DOIUrl":"https://doi.org/10.1186/s13639-014-0019-6","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2015-01-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/s13639-014-0019-6","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65712947","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 : 2014-07-03DOI: 10.1186/S13639-014-0018-7
C. Kerdvibulvech
{"title":"A methodology for hand and finger motion analysis using adaptive probabilistic models","authors":"C. Kerdvibulvech","doi":"10.1186/S13639-014-0018-7","DOIUrl":"https://doi.org/10.1186/S13639-014-0018-7","url":null,"abstract":"","PeriodicalId":35478,"journal":{"name":"Eurasip Journal on Embedded Systems","volume":null,"pages":null},"PeriodicalIF":0.0,"publicationDate":"2014-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://sci-hub-pdf.com/10.1186/S13639-014-0018-7","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"65712919","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
扫码关注我们
求助内容：
应助结果提醒方式：