发布求助
文献互助 智能选刊 最新文献

2007 International Conference on Parallel Processing Workshops (ICPPW 2007)最新文献

筛选
英文 中文
An On-line Instruction/Learning Environment for Supporting Individualized Learning in Java Programming 支持Java编程个性化学习的在线教学/学习环境
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.25
Kuan-Cheng Lin
{"title":"An On-line Instruction/Learning Environment for Supporting Individualized Learning in Java Programming","authors":"Kuan-Cheng Lin","doi":"10.1109/ICPPW.2007.25","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.25","url":null,"abstract":"An online instruction/learning environment developed to support individualized learning in Java programming is presented in this paper. The instruction/learning environment employs an online Java compiler to provide the students an online learning environment for Java anytime and anywhere. Furthermore, the instruction/learning environment provides an active agent to monitor and manage the students learning.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"10 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130914576","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}
引用次数: 0
Design and Evaluation of a Legal Information Flow (LIF) Scheduler in a Role-based Access Control Model 基于角色的访问控制模型中合法信息流调度程序的设计与评价
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.35
T. Enokido, M. Takizawa
{"title":"Design and Evaluation of a Legal Information Flow (LIF) Scheduler in a Role-based Access Control Model","authors":"T. Enokido, M. Takizawa","doi":"10.1109/ICPPW.2007.35","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.35","url":null,"abstract":"The role-based access control model is widely used to keep information systems secure. Here, a subject s is allowed to issue a method op to an object o only if an access right (o, op) is included in the roles granted to the subject s. Even if every access request is authorized in the roles, illegal information flow might occur as well known confinement problem. A legal information flow relation (R<sub>1</sub> les<sup>I</sup> R<sub>2</sub>) among a pair of role families R<sub>1</sub> and R<sub>2</sub> shows that no illegal information flow occur if a transaction T<sub>1</sub> with a role family R<sub>1</sub> is performed prior to another transaction T<sub>2</sub> with R<sub>2</sub>. In addition, a significantly precedent relation R<sub>1</sub> les<sup>s</sup> R<sub>2</sub> implies that a role family R<sub>2</sub> is more significant than R<sub>1</sub>. We discuss a legal information flow (LIF) scheduler to synchronize transactions so as to prevent illegal information flow and how to serialize conflicting methods from multiple transactions in terms of significancy and information flow relation of roles families. We evaluate the LIF scheduler in terms of how much illegal information flow can be prevented.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127629313","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}
引用次数: 0
An Algorithm to Search Minimal Subtree Graphs 一个搜索最小子树图的算法
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.20
Jing Wang, Ying Li, Xinmei Wang
{"title":"An Algorithm to Search Minimal Subtree Graphs","authors":"Jing Wang, Ying Li, Xinmei Wang","doi":"10.1109/ICPPW.2007.20","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.20","url":null,"abstract":"In this paper, we first propose an algorithm to obtain multicast routing graph. The multicast routing algorithm with network coding will consume lesser resource, and is much closer to minimum-cost multicast. A scheme to search minimal subtree graph is presented based on the chosen routing graph. Moreover, upon the minimal subtree graph obtained, we can effectively construct network coding. Then all the network coding problems can be reduced to search the minimal subtree graphs.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"132995419","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}
引用次数: 0
An Enhanced Marketable Quality and Profitability Model for Network Service Pricing: Some Numerical Analysis 网络服务定价的增强型市场质量和盈利模型:一些数值分析
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.23
Valbona Barolli, Heihachiro Fukuda, L. Barolli, M. Takizawa
{"title":"An Enhanced Marketable Quality and Profitability Model for Network Service Pricing: Some Numerical Analysis","authors":"Valbona Barolli, Heihachiro Fukuda, L. Barolli, M. Takizawa","doi":"10.1109/ICPPW.2007.23","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.23","url":null,"abstract":"In this paper, we provide an evaluation model for marketable quality and profitability. We define the marketable quality as a qualitative aspect of profitability. We apply the real values of some leading manufacturing corporations in Japan to our proposed model to analyze its accuracy. From the analysis, we found that theoretical and real standard values of the marketable quality indicator were both 0.6. This shows that the proposed model has a good approximation. From the fair relation of network service providers and consumers, we present the network pricing guidelines for the maximum profitability while enhancing the marketable quality. Also, we enhance our proposed network service pricing model considering network externalities and provide some numerical analysis.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130661264","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}
引用次数: 0
PAS: Prediction-based Adaptive Sleeping for Environment Monitoring in Sensor Networks 基于预测的自适应睡眠传感器网络环境监测
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.66
Zheng Yang, Bin Xu, Jingyao Dai, T. Gu
{"title":"PAS: Prediction-based Adaptive Sleeping for Environment Monitoring in Sensor Networks","authors":"Zheng Yang, Bin Xu, Jingyao Dai, T. Gu","doi":"10.1109/ICPPW.2007.66","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.66","url":null,"abstract":"Energy efficiency has proven to be an important factor dominating the working period of WSN surveillance systems. Intensive studies have been done to provide energy efficient power management mechanisms. In this paper, we present PAS, a Prediction-based Adaptive Sleeping mechanism for environment monitoring sensor networks to conserve energy. PAS focuses on the diffusion stimulus (DS) scenario, which is very common and important in the application of environment monitoring. Different with most of previous works, PAS explores the features of DS spreading process to obtain higher energy efficiency. In PAS, sensors determine their sleeping schedules based on the observed emergency of DS spreading. While sensors near the DS boundary stay awake to accurately capture the possible stimulus arrival, the far away sensors turn into sleeping mode to conserve energy. Simulation experiment shows that PAS largely reduces the energy cost without decreasing system performance.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117133971","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}
引用次数: 3
Network Coding With Interleaving 交错网络编码
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.60
Zheng Huang, Xin Wang, Xueqing Chen, Haibin Kan
{"title":"Network Coding With Interleaving","authors":"Zheng Huang, Xin Wang, Xueqing Chen, Haibin Kan","doi":"10.1109/ICPPW.2007.60","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.60","url":null,"abstract":"Interleaving is a scheme of adapting random error-correcting codes to bursty channels in the classical coding theory Network coding has been first introduced as a new paradigm of improving network throughput by allowing coding of incoming messages at the intermediate nodes. Recently network coding has been implemented in the practical case such as the P2P network. In this paper we investigate to build a connection between interleaving and network coding. This coupling is desirable in the applications such as P2P media streaming where burst-errors could severely reduce the performance (like Mosaic). Analysis shows that it is effective and feasible to implement interleaving at sink and source node without introducing extra delay at the intermediate nodes.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"48 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122531234","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}
引用次数: 5
Memory Efficient and Low Complexity Variable Length Decoding for MPEG-4 Applications 存储器效率和低复杂度可变长度解码的MPEG-4应用
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.52
Tao Sheng, M. Sarem, Jing-li Zhou
{"title":"Memory Efficient and Low Complexity Variable Length Decoding for MPEG-4 Applications","authors":"Tao Sheng, M. Sarem, Jing-li Zhou","doi":"10.1109/ICPPW.2007.52","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.52","url":null,"abstract":"Variable length decoding (VLD) is one of the most computationally expensive parts in a video decoder. Since VLD is an inherent bit-serial operation and is the first stage of the whole decoding task, the overall decoding system performance is determined by its throughput and efficiency. In this paper, a VLD scheme is presented. The proposed VLD tables need less than 6Kbytes memory space, and the decoding procedures are completed by applying numerical properties to codewords identification and symbol indexing. Compared with the direct indexing method, not only the memory space is reduced for symbol information, but also the code efficiency is improved by enabling the compiling code with the near mode. Experimental results show that the proposed solution can improve the VLD speed by 17-43%. This VLD method has been integrated into the developed embedded MPEG-4 video decoder and can perform real-time decoding under eight channels common intermediate format (CIF) frame size.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"38 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131167216","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}
引用次数: 1
RARE: An Energy-Efficient Target Tracking Protocol for Wireless Sensor Networks 一种用于无线传感器网络的节能目标跟踪协议
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.71
Elizabeth Olule, Guojun Wang, M. Guo, M. Dong
{"title":"RARE: An Energy-Efficient Target Tracking Protocol for Wireless Sensor Networks","authors":"Elizabeth Olule, Guojun Wang, M. Guo, M. Dong","doi":"10.1109/ICPPW.2007.71","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.71","url":null,"abstract":"Energy efficiency for target tracking in wireless sensor networks is very important and can be improved by reducing the number of nodes involved in communications. We propose two algorithms, RARE-area and RARE-node to reduce the number of nodes participating in tracking and so increase energy efficiency. The RARE-area algorithm ensures that only nodes that receive a given quality of data participate in tracking and the RARE-node algorithm ensures that any nodes with redundant information do not participate in tracking. Simulation studies show significant energy savings are obtained with implementation of either the RARE-area algorithm alone or both RARE-area and RARE-node algorithms together.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126448059","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}
引用次数: 78
Survivable Embedded Mission-Critical Network Base on Fibre Channel 基于光纤通道的可生存嵌入式关键任务网络
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.78
Yue Wang, Wandong Cai, Qi Duan
{"title":"Survivable Embedded Mission-Critical Network Base on Fibre Channel","authors":"Yue Wang, Wandong Cai, Qi Duan","doi":"10.1109/ICPPW.2007.78","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.78","url":null,"abstract":"Embedded communication networks are playing an increasingly important role in embedded and mission-critical systems. In this paper, a new architecture of FC-based embedded mission-critical network (FEMN) has been proposed firstly, FEMN adopt novel simplified architecture and compact signaling protocol that are different from FC standard. In the second part, paper focus on the topology survivability of embedded mission-critical network, introduce the vertex segment set to describe the amount of work done to destroy the network and how badly the network's damage is. We observe several existing parameters and introduce k-cutset tenacity to measure topology survivability of embedded mission-critical network. At last, we put forward a method to construct graph that could achieve the upper bound of k-cutset tenacity under special case.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"45 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128186465","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}
引用次数: 0
Efficient Scheduler for the Growing VoIP Traffic 高效调度不断增长的VoIP流量
2007 International Conference on Parallel Processing Workshops (ICPPW 2007) Pub Date : 2007-09-10 DOI: 10.1109/ICPPW.2007.38
Shawish Ahmed, Xiaohong Jiang, S. Horiguchi
{"title":"Efficient Scheduler for the Growing VoIP Traffic","authors":"Shawish Ahmed, Xiaohong Jiang, S. Horiguchi","doi":"10.1109/ICPPW.2007.38","DOIUrl":"https://doi.org/10.1109/ICPPW.2007.38","url":null,"abstract":"Voice over Internet protocol service (VoIP) is growing fast during the last few years. Unlike the usual best effort traffic, the voice traffic is delay and delay jitter sensitive. The current scheduling schemes meet the voice traffic delay constraint by assigning its packets with the highest priority. This behavior is acceptable as long as the volume of voice traffic is relatively very small in comparison with other competitor traffic. With the notable increase of voice traffic volume, the current scheduling will not be able to handle the voice packets with the same behavior otherwise a forceful unfair resource sharing, to other traffic, will rise up. In this paper, we introduce a new flexible scheduling architecture which is capable of satisfying the voice traffic delay constraint while providing a fair resource sharing to the rest of the traffic, as verified by both analytical analysis and an extensive experimental simulation study under various traffic workloads.","PeriodicalId":367703,"journal":{"name":"2007 International Conference on Parallel Processing Workshops (ICPPW 2007)","volume":"14 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2007-09-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126057105","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}
引用次数: 6
首页 上一页 下一页 尾页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信