{"title":"Scheduling DAGs for Fixed-point DSP Processors by Using Worm Partitions","authors":"Jinpyo Hong, J. Ramanujam","doi":"10.1109/ICESS.2008.89","DOIUrl":"https://doi.org/10.1109/ICESS.2008.89","url":null,"abstract":"This paper concerns a code generation for directed acyclic graphs (DAGs). The set of edges that connect consecutively scheduled operations along with the nodes that correspond to the consecutively scheduled operations constitutes a worm. We propose an algorithm to construct a partitioning of a DAG into a collection of worms. This is done by finding the longest worm at the moment and maintaining the legality of worm partitioning. We characterize a legality of worm partitioning by introducing a simple set notation and proving its property. Based on that notation and its property, we prove that our algorithm correctly works. We also show that our algorithm works even in a DAG which contains interleaved sharing. Experimental results on several DAGS show that our technique generates worm partitioning of DAGs with small cardinality.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"19 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133764576","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}
{"title":"Depth-Expurgation Based Dynamic Trust Evaluation Algorithm for Ad Hoc Networks","authors":"Zhiping Jia, Zhiwei Qin, Xinshun Xu, Ruihua Zhang","doi":"10.1109/ICESS.2008.22","DOIUrl":"https://doi.org/10.1109/ICESS.2008.22","url":null,"abstract":"Due to the wireless nature of ad hoc networks, two nodes out of mutual communication range need intermediate nodes cooperative to implement applications, such as resources discovery and packets forwarding. Trust evaluation between two peers directly affects the security and performance of networks. In this paper, a novel trust evaluation model is proposed for ad hoc networks. In this model, based on the theories of directed acyclic graph and the notion of social control, several rules are introduced to weight recommendation paths. A trust evaluation algorithm (DEA) is also proposed. During trust evaluation process, the depth of directed graph for an ad hoc network decreases step by step. Simulations show that the proposed algorithm can improve the accuracy of evaluation and effectively mitigate malicious nodes' denigration attacks.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115963436","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}
{"title":"Reliable Networked Reconfiguration of FPGAs with HW/SW Co-design Architecture","authors":"Peng Li, Jizhong Han, Jin He","doi":"10.1109/ICESS.2008.19","DOIUrl":"https://doi.org/10.1109/ICESS.2008.19","url":null,"abstract":"Many FPGAs are served as network devices today. The ability of networked reconfiguration of such devices can enable the control and upgrading of them from a long distance. Previous researches on networked reconfiguration focused on hardware implementation of network protocols, neglecting there configuration integrity and security. This paper analyzed potential threats to reconfiguration integrity and bitstream security in network circumstances, and then addressed our hardware/software co-design solution and implementation. The proposed networked reconfiguration system made use of reliable network protocol and encryption algorithms, so it was not only easy to be implemented and operated but also secure and robust.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"21 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132511385","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}
K. Takata, Jianhua Ma, B. Apduhan, Runhe Huang, Qun Jin
{"title":"Modeling and Analyzing Individual's Daily Activities using Lifelog","authors":"K. Takata, Jianhua Ma, B. Apduhan, Runhe Huang, Qun Jin","doi":"10.1109/ICESS.2008.75","DOIUrl":"https://doi.org/10.1109/ICESS.2008.75","url":null,"abstract":"Lifelog is a data set composed of one or more media forms that record the same individualpsilas daily activities. One of the main challenging issues is how to extract meaningful information from the huge and complex lifelog data which is continuously captured and accumulated from multiple sensors. This study is focused on the activity models and analysis techniques to process lifelog data in order: to find what events/states are interesting or important, to summarize the useful records in some structured and semantic ways for efficient retrievals and presentations of past life experiences, and to use these experiences to further improve the individualpsilas quality of life. We propose an integrated technique to process the lifelog data using the correlations between different kinds of captured data from multiple sensors, instead of dealing with them separately. To use and test the proposed models and the analysis techniques, several prototype systems have been implemented and applied to some domain-specific lifelog data; such as in improving a grouppsilas collaborative efforts in revising a software, in managing kidpsilas outdoor safety care, in providing a runnerpsilas workout assistance, and in structuring lifelog image generation, respectively.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"122 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126052400","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}
Wensheng Tang, Wangqiu Kuang, Bibo Wang, Jian Yang
{"title":"E3NP: An Energy-Efficient, Expeditious Network Reprogramming Mechanism in Wireless Sensor Network","authors":"Wensheng Tang, Wangqiu Kuang, Bibo Wang, Jian Yang","doi":"10.1109/ICESS.2008.74","DOIUrl":"https://doi.org/10.1109/ICESS.2008.74","url":null,"abstract":"Reprogramming is a crucial and challenging problem in wireless sensor network. The need to reprogram may be traceable to changing system requirements, fixing bugs, or reassigning task. Whereas, it is impractical to collect all the sensor nodes once they are deployed. Many network reprogramming approaches have been proposed in the recent years. Unluckily, these approaches have not been optimized for energy. In this paper, we present E3NP, energy-efficient expeditious network reprogramming mechanism. There are two main contributions add to E3NP such as (1) resident and incremental reprogramming to reduce the size of binary code to be disseminated;(2) hierarchical full indexing with sliding window to reduce external storage operation cost in recording packets loss and loss packets recovered by overhearing in multi-hops delivery. Accordingly, our mechanism is energy-efficient and timesaving.","PeriodicalId":278372,"journal":{"name":"2008 International Conference on Embedded Software and Systems","volume":"37 3 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2008-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126056304","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}