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

2009 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献

筛选
英文 中文
Virtual Scent: Finding Locations of Interest in Ambient Intelligence Environments 虚拟气味:在环境智能环境中寻找感兴趣的位置
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.41
Hiroshi Sato, Takeru Inoue, Hideaki Iwamoto, N. Takahashi
{"title":"Virtual Scent: Finding Locations of Interest in Ambient Intelligence Environments","authors":"Hiroshi Sato, Takeru Inoue, Hideaki Iwamoto, N. Takahashi","doi":"10.1109/PDCAT.2009.41","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.41","url":null,"abstract":"In this paper, we propose a novel method to map locations of interest by utilizing the \"scent\" model. Location-aware services are being actively developed as they are a key component in realizing the Ambient Intelligence (AmI) world. Our proposal provides the basics needed to create location-aware services including navigation and notification. Users' interests are loosely shared by mirroring the diffusion of a real scent, and the users can \"sniff out\" the locations that match their interests. Since our model is based on a simple physical phenomenon, data processing is tractable and its user interface is intuitive. Moreover, user privacy is protected by the random \"wind\" effect without reducing map accuracy. We conduct thorough outdoor experiments in Kanagawa Prefecture, Japan, to demonstrate our model; twelve subjects were given mobile phones with GPS devices. The results show that the \"scent\" model provides an intriguing map with which to locate points of interest, and that the developed applications are promising.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"310 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122115122","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}
引用次数: 4
A Hierarchical Architecture for Real-Time Search in Peer-to-Peer Networks 点对点网络中实时搜索的层次结构
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.44
T. Qin, Q. Cao, Q. Wei, S. Fujita
{"title":"A Hierarchical Architecture for Real-Time Search in Peer-to-Peer Networks","authors":"T. Qin, Q. Cao, Q. Wei, S. Fujita","doi":"10.1109/PDCAT.2009.44","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.44","url":null,"abstract":"In this paper, we propose a hierarchical architecture to realize a real-time file search in P2P systems. The proposed architecture consists of three layers. Index of files held by the peers in the bottom layer is stored at the peers in the middle layer, and the correlation of peers in the two bottom layers is controlled by the peers in the top layer using the notion of tags. With such notion of tags, we can realize a quick upload of the file indexes and a quick forwarding of a given query requesting a shared file to a relevant peer. We implemented a prototype of the proposed system. The result of preliminary experiments conducted using the prototype system indicates that an upload of a file index and a query forwarding to a relevant peer take few second and 100 ms, respectively.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130821418","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
Node-Pancyclicity of Faulty Twisted Cubes 故障扭曲立方体的节点泛环性
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.28
Ming-Chien Yang
{"title":"Node-Pancyclicity of Faulty Twisted Cubes","authors":"Ming-Chien Yang","doi":"10.1109/PDCAT.2009.28","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.28","url":null,"abstract":"A graph G is pancyclic if, for every 4 ≤ l ≤ |V (G)|, G has a cycle of length l. A graph G is edge-pancyclic if, for an arbitrary edge e of G and every 4 ≤ l ≤ |V(G)|, G has a cycle of length l containing e. A graph G is node-pancyclic if, for an arbitrary node u of G and every 4 ≤ l ≤ |V (G)|, G has a cycle of length l containing u. The twisted cube is an important variant of the hypercube. Recently, Fan et al. proved that the n-dimensional twisted cube TQn is edge-pancyclic for every n ≥ 3. They also asked if TQn is edge-pancyclic with (n−3) faults for n ≥ 3. We find that TQn is not edge-pancyclic with only one faulty edge for any n ≥ 3. Then we prove that TQn is node-pancyclic with (langle n/2rangle − 1) faulty edges for every n ≥ 3. The result is optimal in the sense that with langle n/2rangle faulty edges, the faulty TQn is not node-pancyclic for any n ≥ 3.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"33 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"131164410","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
CASanDRA: A Framework to Provide Context Acquisition Services ANd Reasoning Algorithms for Ambient Intelligence Applications CASanDRA:为环境智能应用提供上下文获取服务和推理算法的框架
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.51
A. Bernardos, P. Tarrío, J. Casar
{"title":"CASanDRA: A Framework to Provide Context Acquisition Services ANd Reasoning Algorithms for Ambient Intelligence Applications","authors":"A. Bernardos, P. Tarrío, J. Casar","doi":"10.1109/PDCAT.2009.51","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.51","url":null,"abstract":"The development of ambient intelligence (AmI) applications usually implies dealing with complex sensor access and context reasoning tasks, which may significantly slow down the application development cycle when vertically assumed. To face this issue, we present CASanDRA, a middleware which provides easily consumable context information about a given user and his environment, retrieving and fusing data from personal mobile devices and external sensors. The framework is built following a layered service oriented approach. The output data from every CASanDRA’s layer are fully accessible through semantic interfaces; this allows AmI applications to retrieve raw context features, aggregated context data and complex ‘ images of context’, depending on their information needs. Moreover, different query modes -subscription, event-based, continuous and on-demand- are available. The current ‘mobile-assisted’ version of CASanDRA is composed by a CASanDRA Server, developed on an applications container and hosting the system intelligence, and CASanDRA Lite, a mobile client bundling a set of sensor level acquisition services. How an AmI application may be effortlessly built on CASanDRA is described in the paper through the design of an ‘ Ambient Home Care Monitor’.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"13 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128720380","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}
引用次数: 19
Broadcasting Multiple Messages Using Cycle-Rooted Trees 使用循环根树广播多个消息
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.43
Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, S. Osawa, Y. Shibata
{"title":"Broadcasting Multiple Messages Using Cycle-Rooted Trees","authors":"Hiroaki Irino, Yuuki Tanaka, Hiroyuki Kawai, S. Osawa, Y. Shibata","doi":"10.1109/PDCAT.2009.43","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.43","url":null,"abstract":"In information dissemination problem on interconnection networks, problems of broadcasting and gossiping have been widely studied. In this paper, we study the other problem, called multi-source broadcasting, defined as follows: there are some (but not all) vertices each of which has the unique item of information and needs to disseminate to every other vertex. This problem is located at an intermediate position between broadcasting and gossiping. We analyze the multi-source broadcasting problem on the cycle-rooted tree and the de Bruijn digraph as an interconnection network.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129266490","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
Heuristic Certificates via Approximations 通过近似的启发式证书
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.15
S. Dolev, Marina Sadetsky
{"title":"Heuristic Certificates via Approximations","authors":"S. Dolev, Marina Sadetsky","doi":"10.1109/PDCAT.2009.15","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.15","url":null,"abstract":"This paper suggests a new framework in which the quality of a (not necessarily optimal) heuristic solution is certified by an approximation algorithm. Namely, the result of a heuristic solution is accompanied by a scale obtained from an approximation algorithm. The creation of a scale is efficient whereas solutions obtained from an approximation algorithm usually involve long calculation when compared to a heuristic approach. On the other hand, a result obtained by heuristics without a scale might not be useful. We investigate criteria for choosing an approximation scheme for producing a scale. To obtain a scale in practice, we examine approximations not only by their asymptotic behavior, but also examine relations as a function of the input size of a given problem. We examine, as case studies only, heuristic and approximation algorithms for the SINGLE KNAPSACK, MAX 3-SAT, and MAXIMUM BOUNDED 3-DIMENSIONAL MATCHING (MB3DM) NP-hard problems. We obtain certificates for the heuristic runs by using fitting approximations. Within the scope of distributed computing one may execute two distributed Algorithms, one that is based on approximation and another on heuristics. The approximation result is used to certify the heuristic result and stop (the possibly exponential time) heuristic search. Thus, the reliability of the obtained solution can be estimated and certificated.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"110 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125771269","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}
引用次数: 2
A Coordination Language for Programming Embedded Multi-Core Systems 嵌入式多核系统编程的协调语言
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.38
T. Schüle
{"title":"A Coordination Language for Programming Embedded Multi-Core Systems","authors":"T. Schüle","doi":"10.1109/PDCAT.2009.38","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.38","url":null,"abstract":"We propose an implicitly parallel language for the coordination of sequential processes and present a translation scheme to dataflow process networks. Our language is well-suited for programming embedded systems and allows to benefit from the computational power offered by modern multi-core processors. Moreover, it facilitates the reuse of legacy code and can deal with side effects that may arise between functions written in the guest language by taking into account dependencies due to shared resources.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125894378","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}
引用次数: 4
A Dynamic User Management in Networked Consumer Electronics via Authentication Proxies 基于认证代理的网络消费电子产品动态用户管理
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.79
Kazuma Kadowaki, S. Fujita
{"title":"A Dynamic User Management in Networked Consumer Electronics via Authentication Proxies","authors":"Kazuma Kadowaki, S. Fujita","doi":"10.1109/PDCAT.2009.79","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.79","url":null,"abstract":"In this paper, we propose a user management system for networked consumer electronics (nCE). The proposed system extends Tokunaga's hybrid P2P system in such a way that the inquiries concerned with client peers submitted by service-provider peers are handled by several authentication proxies instead of a centralized management peer, although client peers still have to register themselves to the centralized server. A prototype of the proposed system is implemented using JXTA framework, and is evaluated via experiments. The result of experiments indicates that the proposed system certainly reduces both the load of the centralized server and the time required for the authentication process.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127115733","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}
引用次数: 4
On the Influence of Thread Allocation for Irregular Codes in NUMA Systems NUMA系统中不规则码的线程分配影响
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1109/PDCAT.2009.42
J. Lorenzo, F. F. Rivera, Peter Tuma, J. C. Pichel
{"title":"On the Influence of Thread Allocation for Irregular Codes in NUMA Systems","authors":"J. Lorenzo, F. F. Rivera, Peter Tuma, J. C. Pichel","doi":"10.1109/PDCAT.2009.42","DOIUrl":"https://doi.org/10.1109/PDCAT.2009.42","url":null,"abstract":"This work presents a study undertaken to characterise the FINISTERRAE supercomputer, one of the biggest NUMA systems in Europe. The main objective was to determine the performance effect of bus contention and cache coherency as well as the suitability of porting strategies regarding irregular codes in such a complex architecture. Results show that: (1) cores which share a socket can be considered as independent processors in this context; (2) for big data sizes, the effect of sharing a bus degrades the final performance but masks the cache coherency effects; (3) the NUMA factor (remote to local memory latency ratio) is an important factor on irregular codes and (4) the default kernel allocation policy is not optimal in this system. These results allow us to understand the behaviour of thread-to-core mappings and memory allocation policies.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130860189","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
Reliable Communication on Emulated Channels Resilient to Transient Faults 抗瞬态故障仿真信道的可靠通信
2009 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2009-12-08 DOI: 10.1142/S0129054111008581
Yukiko Yamauchi, Doina Bein, T. Masuzawa
{"title":"Reliable Communication on Emulated Channels Resilient to Transient Faults","authors":"Yukiko Yamauchi, Doina Bein, T. Masuzawa","doi":"10.1142/S0129054111008581","DOIUrl":"https://doi.org/10.1142/S0129054111008581","url":null,"abstract":"Topology embedding enables us to execute a protocol designed for a specific (virtual) topology on another(real) topology by embedding the virtual topology on the real topology. In this paper, we propose a self-stabilizing emulation technique that provides reliable communication on a virtual topology in the presence of transient faults. The proposed protocol improves the execution slowdown of previous protocols and provides adaptive message delivery delay on the emulated channels, which is a new type of adaptability against transient faults.","PeriodicalId":312929,"journal":{"name":"2009 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"42 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-12-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116458641","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
首页 上一页 下一页 尾页
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学术文献互助群
群 号：481959085
Book学术官方微信