2013 International Conference on Parallel and Distributed Systems最新文献_第6页

Trust-Based Multi-objective Optimization for Node-to-Task Assignment in Coalition Networks 基于信任的联盟网络节点任务分配多目标优化

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.59

Jin-Hee Cho, I. Chen, Yating Wang, Kevin S. Chan

{"title":"Trust-Based Multi-objective Optimization for Node-to-Task Assignment in Coalition Networks","authors":"Jin-Hee Cho, I. Chen, Yating Wang, Kevin S. Chan","doi":"10.1109/ICPADS.2013.59","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.59","url":null,"abstract":"A temporary coalition is often formed to pursue a common goal based on the collaboration of multiple partners who may have their own objectives. The coalition network must attain multiple objectives, under resource constraints and time deadlines. We propose a task assignment algorithm for a scenario where tasks are dynamic, with different arrival times and deadlines. We propose a heuristic coalition formation technique that uses multiple dimensions of trust (i.e., integrity, competence, social connectedness, and reciprocity) to assess trust of each entity. The proposed scheme enables task leaders to make critical assignment decisions based on assessed trustworthiness of entities. We consider three different objectives, namely, maximizing resilience and resource utilization while minimizing delay to task completion. We devise a ranking-based heuristic with linear runtime complexity to select members based on risk derived from trust assessment of nodes. We validate the performance of our proposed scheme by comparing our scheme with a non-trust-based baseline scheme as well as a global optimal solution implemented with the Integer Linear Programming technique.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"341 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115887640","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}

引用次数: 11

Development of Efficient Role-Based Sensor Network Applications with Excel Spreadsheets 基于Excel电子表格的高效角色传感器网络应用开发

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.58

Christopher Boelmann, Torben Weis

{"title":"Development of Efficient Role-Based Sensor Network Applications with Excel Spreadsheets","authors":"Christopher Boelmann, Torben Weis","doi":"10.1109/ICPADS.2013.58","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.58","url":null,"abstract":"Natural scientists use large scale sensor networks for gathering and analyzing environmental data. However, the implementation work requires expert programmers. The problem is complicated by limited battery lifetime, processing power and memory capacity of the nodes, because this requires a low-level programming language. Since scientists are used to analyzing data with spreadsheets, researchers have studied the possibility of applying spreadsheet-based programming to sensor networks. The approaches so far either require a central server to execute the spreadsheet, or they execute a spreadsheet run-time on each node. The first approach causes higher communication cost since all data has to be routed to the central server and the second one causes computational overhead, because evaluating a spreadsheet is slower than executing handcrafted NesC-code. Hence, we present a spreadsheet driven tool-chain that can create efficient NesC-code and allows for simulation in the spreadsheet itself. The nodes have to recompute the spreadsheet formulas upon new data. However, we can avoid a large fraction of this recomputation by applying several optimization strategies during code generation. In our example scenario, sensor nodes compute the variance across a series of sensor readings. We can show that the optimizations save 65% CPU cycles and the code size decreases by 12% when compared to non-optimized execution of the spreadsheet. Thus, our approach can deliver an easy way of developing sensor network programs while yielding very efficient code.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"5 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128200624","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

Tag Co-occurrence Relationship Prediction in Heterogeneous Information Networks 异构信息网络中标签共现关系预测

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.95

Jinpeng Chen, H. Gao, Zhenyu Wu, Deyi Li

{"title":"Tag Co-occurrence Relationship Prediction in Heterogeneous Information Networks","authors":"Jinpeng Chen, H. Gao, Zhenyu Wu, Deyi Li","doi":"10.1109/ICPADS.2013.95","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.95","url":null,"abstract":"In this work, we address a novel problem about tag co-occurrence relationship prediction across heterogeneous networks. Although tag co-occurrence has recently become a hot research topic, many studies mainly focus on how to produce the personalized recommendation leveraging the tag co-occurrence relationship and most of them are considered in a homogeneous network. So far, few studies pay attention to how to predict tag co-occurrence relationship across heterogeneous networks. In order to solve the aforementioned problem, we propose a novel two-step prediction approach. First, weight path-based topological features are systematically extracted from the network. Then, a supervised model is used to learn the best weights associated with different topological features in deciding the co-occurrence relationships. Experiments are performed on real-world dataset, the Flickr network, with comprehensive measurements. Experimental results demonstrate that weight path-based heterogeneous topological features have substantial advantages over commonly used link prediction approaches in predicting co-occurrence relations in information networks.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"6 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114735453","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}

引用次数: 12

Subpopulation Diversity Based Accepting Immigrant in Distributed Evolutionary Algorithms 基于亚种群多样性的分布式进化算法接纳移民

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.66

Chengjun Li, Jian Wang, Xianbin Yan, Guangdao Hu

引用次数: 1

Towards Model Checking of Simulation Models for Embedded System Development 对嵌入式系统开发仿真模型进行模型检查

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.81

Hae Young Lee

引用次数: 3

Overhead Reduction for Duplicate Address Detection in VANET 减少VANET中重复地址检测的开销

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.104

Kuan-Lan Tseng, Tsan-Pin Wang

引用次数: 2

Further Improvement on GPU-Based Parallel Implementation of WRF 5-Layer Thermal Diffusion Scheme 基于gpu并行实现WRF 5层热扩散方案的进一步改进

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.126

Melin Huang, Bormin Huang, Jarno Mielikäinen, Hung-Lung Huang, M. Goldberg, A. Mehta

{"title":"Further Improvement on GPU-Based Parallel Implementation of WRF 5-Layer Thermal Diffusion Scheme","authors":"Melin Huang, Bormin Huang, Jarno Mielikäinen, Hung-Lung Huang, M. Goldberg, A. Mehta","doi":"10.1109/ICPADS.2013.126","DOIUrl":"https://doi.org/10.1109/ICPADS.2013.126","url":null,"abstract":"The Weather Research and Forecasting (WRF) model has been widely employed for weather prediction and atmospheric simulation with dual purposes in forecasting and research. Land-surface models (LSMs) are parts of the WRF model, which is used to provide information of heat and moisture fluxes over land and sea-ice points. The 5-layer thermal diffusion simulation is an LSM based on the MM5 soil temperature model with an energy budget made up of sensible, latent, and radiative heat fluxes. Owing to the feature of no interactions among horizontal grid points, the LSMs are very favorable for massively parallel processing. The study presented in this article demonstrates the parallel computing efforts on the WRF 5-layer thermal diffusion scheme using Graphics Processing Unit (GPU). Since this scheme is only one intermediate module of the entire WRF model, the involvement of the I/O transfer does not occur in the intermediate process. By employing one NVIDIA GTX 680 GPU in the case without I/O transfer, our optimization efforts on the GPU-based 5-layer thermal diffusion scheme can reach a speedup as high as 247.5x with respect to one CPU core, whereas the speedup for one CPU socket with respect to one CPU core is only 3.1x. We can even boost the speedup to 332x with respect to one CPU core when three GPUs are applied.","PeriodicalId":160979,"journal":{"name":"2013 International Conference on Parallel and Distributed Systems","volume":"69 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121690118","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}

引用次数: 7

Ontology-Based TV Program Contents Retrieval and Recommendation 基于本体的电视节目内容检索与推荐

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.97

Jungmin Kim, Hyunsook Chung

引用次数: 2

SNN Input Parameters: How Are They Related? SNN输入参数:它们是如何关联的?

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.89

Guilherme Moreira, M. Y. Santos, J. Pires

引用次数: 13

A Distributed Approach to Constructing k-Hop Connected Dominating Set in Ad Hoc Networks 一种构造Ad Hoc网络中k-Hop连接支配集的分布式方法

2013 International Conference on Parallel and Distributed Systems Pub Date : 2013-12-15 DOI: 10.1109/ICPADS.2013.57

Jiahong Wang, Yuhiro Yonamine, Eiichiro Kodama, T. Takata

引用次数: 7