2013 International Conference on Parallel and Distributed Computing, Applications and Technologies最新文献_第4页

Amazing of Using ISG on Implementing a Web-Based System 使用ISG实现基于web的系统的惊人之处

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.14

Ling-Hua Chang, Sanjiv Behl, Tung-Ho Shieh

引用次数: 4

An Ad-Hoc Method with Genetic Algorithm for Printed Circuit Board Assembly Optimization on the Sequential Pick-and-Place Machine 基于遗传算法的顺序拾取机印刷电路板装配优化的自组织方法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.27

Gang Peng, Kehan Zeng

引用次数: 1

A Game Theory-Based Approach to Service Rating 基于博弈论的服务评级方法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.33

Xinfeng Ye, J. Zheng, B. Khoussainov

引用次数: 1

A Scalable and Fault Tolerant Architecture to Provide Deaf Accessibility as a Service 一种可扩展和容错的体系结构，将聋人可访问性作为服务提供

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.62

E. Falcão, T. Araújo, Alexandre Duarte

{"title":"A Scalable and Fault Tolerant Architecture to Provide Deaf Accessibility as a Service","authors":"E. Falcão, T. Araújo, Alexandre Duarte","doi":"10.1109/PDCAT.2013.62","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.62","url":null,"abstract":"Deaf people face serious difficulties to access information. The fact is that they communicate naturally through sign languages, whereas, to most of them, the spoken languages are considered only a second language. When designed, Information and Communication Technologies (ICTs) rarely take into account the barriers that deaf people face. It is common that application developers do not hire sign languages interpreters to provide an accessible version of their app/site to deaf people. Currently, there are tools for automatic translation from sign languages to spoken languages, but, unfortunately, they are not available to third parties. To reduce these problems, it would be interesting if any automatic translation tool/service could be publicly available. This is the main goal of this work: use a preconceived machine translation from Portuguese Language to Brazilian Sign Language (LIBRAS) (named VLIBRAS) and provide Deaf Accessibility as a Service (DAaaS) publicly. The idea is to abstract inherent problems in the translation process between the Portuguese Language and LIBRAS by providing a service that performs the automatic translation of multimedia content to LIBRAS. VLIBRAS was primarily deployed as a centralized system, and this conventional architecture has some disadvantages when compared to distributed architectures. In this paper we propose two distributed architectures in order to provide a scalable service and achieve fault tolerance. For conception and availability of this service, it will be used the cloud computing paradigm to incorporate the following additional benefits: transparency, high availability, and efficient use of resources.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"47 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128479260","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

Real Time Delta Extraction Based on Triggers to Support Data Warehousing 基于触发器的实时增量提取支持数据仓库

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.52

C. R. Valêncio, Matheus Henrique Marioto, G. F. D. Zafalon, J. M. Machado, J. C. Momente

引用次数: 16

Connectivity of Wireless Ad Hoc Networks: Impacts of Antenna Models 无线自组织网络的连通性:天线模型的影响

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.53

Qiu Wang, Hongning Dai, Qinglin Zhao

引用次数: 5

Dynamics of a Localized Reputation-Based Network Protocol 基于声誉的本地化网络协议的动力学

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.30

George Karakostas, Raminder Kharaud, Anastasios Viglas

{"title":"Dynamics of a Localized Reputation-Based Network Protocol","authors":"George Karakostas, Raminder Kharaud, Anastasios Viglas","doi":"10.1109/PDCAT.2013.30","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.30","url":null,"abstract":"We consider a type of game theoretic dynamics in a network model where all nodes act selfishly and will forward packets only if it is to their benefit. The model we present assumes that each node receives utility from successfully sending its own flow to its destination(s) and from receiving flow, while it pays a cost (e.g., battery energy) for its transmissions. Each node has to decide whether to relay flow as an intermediate node from other sources, as relaying incurs only costs. To induce nodes into acting as intermediaries, the model implements a reputation-based mechanism which punishes non-cooperative nodes by cutting off links to them, a decision that is made in a very local fashion. In our setting, the nodes know only the state of the network in their local neighborhood, and can only decide on the amount of the flow on their outgoing edges, unlike the previously considered models where users have full knowledge of the network and can also decide the routing of flow originating from them. Given the opportunistic nature of the nodes and their very limited knowledge of the network, our simulations show the rather surprising fact that a non-negligible amount of non-trivial flow (flow over at least two hops) is successfully transmitted.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"44 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133184768","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

An Adaptive Image Enhancement Algorithm Based on Zone System 基于区域系统的自适应图像增强算法

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.57

S. Tai, Chia-Ying Chang, Han-Ru Fan

{"title":"An Adaptive Image Enhancement Algorithm Based on Zone System","authors":"S. Tai, Chia-Ying Chang, Han-Ru Fan","doi":"10.1109/PDCAT.2013.57","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.57","url":null,"abstract":"The main objective of image enhancement is to improve the visual quality of digital images that are captured under extremely low or non-uniform lighting conditions. We present an adaptive image enhancement algorithm based on Zone System. This study reveals hidden image details and increases the contrast of an image with low dynamic range. It is comprised two processes: adaptive luminance enhancement and adaptive contrast enhancement. The adaptive luminance enhancement algorithm is a global intensity transform function based on Zone System information. This process not only increases the luminance of darker pixels but also compresses the dynamic range of the image. The adaptive contrast enhancement adjusts the intensity of each pixel based on the discontinuities of the local luminance. It also improves the contrast of local region and reveals the details of image clearly. The proposed algorithm has good performance on enhancing contrast, preserving more detail of characteristics and sharpening edges of objects in experimental results. The performance with our proposed was better evaluation and comparison than other algorithms in the subjective and objective evaluation.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"58 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116238058","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

Optimization of the HEFT Algorithm for a CPU-GPU Environment CPU-GPU环境下HEFT算法的优化

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.40

K. Shetti, Suhaib A. Fahmy, T. Bretschneider

{"title":"Optimization of the HEFT Algorithm for a CPU-GPU Environment","authors":"K. Shetti, Suhaib A. Fahmy, T. Bretschneider","doi":"10.1109/PDCAT.2013.40","DOIUrl":"https://doi.org/10.1109/PDCAT.2013.40","url":null,"abstract":"Scheduling applications efficiently on a network of computing systems is crucial for high performance. This problem is known to be NP-Hard and is further complicated when applied to a CPU-GPU heterogeneous environment. Heuristic algorithms like Heterogeneous Earliest Finish Time (HEFT) have shown to produce good results for other heterogeneous environments like Grids and Clusters. In this paper, we propose a novel optimization of this algorithm that takes advantage of dissimilar execution times of the processors in the chosen environment. We optimize both the task ranking as well as the processor selection steps of the HEFT algorithm. By balancing the locally optimal result with the globally optimal result, we show that performance can be improved significantly without any change in the complexity of the algorithm (as compared to HEFT). Using randomly generated Directed A cyclic Graphs (DAGs), the new algorithm HEFT-NC (No-Cross) is compared with HEFT both in terms of speedup and schedule length. We show that the HEFT-NC outperforms HEFT algorithm and is consistent across different graph shapes and task sizes.","PeriodicalId":187974,"journal":{"name":"2013 International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"29 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-12-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126839817","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}

引用次数: 22

VDBSCAN+: Performance Optimization Based on GPU Parallelism VDBSCAN+:基于GPU并行的性能优化

2013 International Conference on Parallel and Distributed Computing, Applications and Technologies Pub Date : 2013-12-16 DOI: 10.1109/PDCAT.2013.11

C. R. Valêncio, Guilherme Prióli Daniel, C. D. Medeiros, A. Cansian, L. Baida, Fernando Ferrari

引用次数: 1