C. R. Valêncio, Fernando Tochio Ichiba, C. D. Medeiros, Rogéria Cristiane Gratão de Souza
{"title":"Spatial Clustering Applied to Health Area","authors":"C. R. Valêncio, Fernando Tochio Ichiba, C. D. Medeiros, Rogéria Cristiane Gratão de Souza","doi":"10.1109/PDCAT.2011.76","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.76","url":null,"abstract":"The significant volume of work accidents in the cities causes an expressive loss to society. The development of Spatial Data Mining technologies presents a new perspective for the extraction of knowledge from the correlation between conventional and spatial attributes. One of the most important techniques of the Spatial Data Mining is the Spatial Clustering, which clusters similar spatial objects to find a distribution of patterns, taking into account the geographical position of the objects. Applying this technique to the health area, will provide information that can contribute towards the planning of more adequate strategies for the prevention of work accidents. The original contribution of this work is to present an application of tools developed for Spatial Clustering which supply a set of graphic resources that have helped to discover knowledge and support for management in the work accidents area.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"166 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116113275","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":"Secure E-Commerce Based on Distributed Processing","authors":"Kun Peng","doi":"10.1109/PDCAT.2011.74","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.74","url":null,"abstract":"A new secret-sharing-based e-auction scheme is proposed. Distributed bid opening is employed to protect bid privacy. It can achieve all the desired properties for sealed-bid auctions at a reasonable cost. Moreover, attacks existing in the current secret-sharing-based sealed-bid e-auction schemes are prevented in the new scheme. In addition, it does not need any trust assumption.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"21 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130043718","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}
Ana Maria, Rivalino Matias, Autran Macêdo, P. Maciel, Lucio Borges de Araujo
{"title":"Performance Analysis of Control Charts Techniques Applied to IP Traffic Forecasts","authors":"Ana Maria, Rivalino Matias, Autran Macêdo, P. Maciel, Lucio Borges de Araujo","doi":"10.1109/PDCAT.2011.65","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.65","url":null,"abstract":"Research advances in network traffic forecasting are continually emerging in the literature. Although the progress in this field, the quality control of traffic forecasts is commonly neglected in previous works. In this paper we analyze the performance of CuSum, Shewhart, and EWMA control charts applied to the residuals of forecasting models fitted to selected traffic samples obtained from real IP networks. Based on numerical and graphical analyses, we verify that CuSum and Shewhart control charts perform worse than EWMA, since they report false alarms for several forecasting processes considered under control. Differently, the EWMA control chart shows efficacy to monitor the different types of studied forecast residuals. Finally, we present a sensitive analysis of the EWMA model with respect to the lambda parameter in order to evaluate its flexibility on different traffic scenarios.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"40 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129637538","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":"Translating Synchronous Systems to Data-Flow Process Networks","authors":"D. Baudisch, J. Brandt, K. Schneider","doi":"10.1109/PDCAT.2011.82","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.82","url":null,"abstract":"The synchronous model of computation (MoC) has been successfully used for the design of embedded systems having a local control like hardware circuits and single-threaded software, while its application to distributed parallel embedded systems is still a challenge. In contrast, other MoCs such as data-flow process networks (DPNs) directly match with these architectures. In this paper, we therefore present a translation of synchronous systems to data-flow process networks, thereby bridging the gap between synchronous and asynchronous MoCs. We use the resulting DPNs to generate CAL code for the Open DF package, which offers important features for embedded system design.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"69 11 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129763755","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":"A Fairness Spatial TDMA Scheduling Algorithm for Wireless Sensor Network","authors":"Zhiqi Wang, Fengqi Yu, Liqiang Tao, Zusheng Zhang","doi":"10.1109/PDCAT.2011.3","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.3","url":null,"abstract":"Wireless sensor networks (WSNs) consist of a large number of wireless sensor nodes that organize themselves into multi-hop radio networks. With different link quality, different distance to the sink, etc., nodes in a network are not treated equally, especially in the network with high traffic. In this paper, we propose a fairness spatial reuse time division multiple access (TDMA) scheduling algorithm (FSTS). This algorithm, combining several heuristic algorithms, can assign network resources to the nodes to lead to similar end-to-end delivery rate. Meanwhile, considering required data rate, FSTS can achieve the maximum transmission capacity of the network. The simulation results show that the FSTS can significantly reduce the difference in the end-to-end delivery rate.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"183 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121411561","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}
C. R. Valêncio, L. R. Costa, Juliano Augusto Carreira, M. L. Tronco
{"title":"Optimization of Query Results in Peer-to-Peer Database Supported by Semantics","authors":"C. R. Valêncio, L. R. Costa, Juliano Augusto Carreira, M. L. Tronco","doi":"10.1109/PDCAT.2011.59","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.59","url":null,"abstract":"The development of new technologies that use peer-to-peer networks grows every day, with the object to supply the need of sharing information, resources and services of databases around the world. Among them are the peer-to-peer databases that take advantage of peer-to-peer networks to manage distributed knowledge bases, allowing the sharing of information semantically related but syntactically heterogeneous. However, it is a challenge to ensure the efficient search for information without compromising the autonomy of each node and network flexibility, given the structural characteristics of these networks. On the other hand, some studies propose the use of ontology semantics by assigning standardized categorization of information. The main original contribution of this work is the approach of this problem with a proposal for optimization of queries supported by the Ant Colony algorithm and classification though ontologies. The results show that this strategy enables the semantic support to the searches in peer-to-peer databases, aiming to expand the results without compromising network performance.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"117 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124146560","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":"P2P DHT Based on a Contracted Star Graph","authors":"S. Fujita","doi":"10.1109/PDCAT.2011.63","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.63","url":null,"abstract":"In this paper, we propose a new network topology for P2P DHT (Distributed Hash Table) which provides a scalable lookup service for the peers participating in Peer-to-Peer (P2P) networks. The proposed topology is a contracted graph of the star graph, and realizes a short diameter with a small degree compared with conventional hyper cubic DHTs such as Chord and Kademlia.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"25 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117079996","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}
T. Ferreira, Rivalino Matias, Autran Macêdo, Lucio Borges de Araujo
{"title":"An Experimental Study on Memory Allocators in Multicore and Multithreaded Applications","authors":"T. Ferreira, Rivalino Matias, Autran Macêdo, Lucio Borges de Araujo","doi":"10.1109/PDCAT.2011.18","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.18","url":null,"abstract":"Memory allocations are one of the most omnipresent operations in computer programs. The performance of memory allocation operations is a very important aspect to be considered in software design, however it is frequently neglected. This paper presents an experimental comparative study of seven largely adopted memory allocators. Unlike other related works, we assess the selected memory allocators using real-world multithreaded applications. We consider the applications' response time, memory consumption, and memory fragmentation, in order to compare the performance of the investigated memory allocators running on a multicore machine. All test results are evaluated with respect to their statistical significance throughout the ANOVA method.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"7 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"117081942","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":"Leakage Aware Scheduling for Maximum Temperature Minimization","authors":"Jinming Yue, Tiefei Zhang, Licheng Yu, Tianzhou Chen","doi":"10.1109/PDCAT.2011.49","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.49","url":null,"abstract":"As power consumption continues to increase dramatically in real-time systems, the thermal management has become a prominent issue. Taking leakage current into account, this paper focuses on the maximum temperature minimization for the processor executing a set of real-time tasks with a common deadline. We prove that, for a specific interval, constant-speed schedule applying the lowest constant speed will be superior to any other schedule using higher constant speed in maximum temperature minimization. By dividing the interval into two subintervals, we develop a step-down scheduling algorithm, providing each subinterval a unique processor speed to further reduce the maximum temperature. Compared with the optimal constant-speed schedule, the proposed algorithm significantly reduces the maximum temperature by up to 12%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"133973304","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":"Biprominer: Automatic Mining of Binary Protocol Features","authors":"Yipeng Wang, Xingjian Li, Jiao Meng, Yong Zhao, Zhibin Zhang, Li Guo","doi":"10.1109/PDCAT.2011.25","DOIUrl":"https://doi.org/10.1109/PDCAT.2011.25","url":null,"abstract":"Application-level protocol specifications are helpful for network security management, including intrusion detection and intrusion prevention which rely on monitoring technologies such as deep packet inspection. Moreover, detailed knowledge of protocol specifications is also an effective way of detecting malicious code. However, current methods for obtaining unknown and proprietary protocol message formats (i.e., no publicly available protocol specification), especially binary protocols, highly rely on manual operations, such as reverse engineering which is time-consuming and laborious. In this paper, we propose Biprominer, a tool that can automatically extract binary protocol message formats of an application from its real-world network trace. In addition, we present a transition probability model for a better description of the protocol. The chief feature of Biprominer is that it does not need to have any priori knowledge of protocol formats, because Biprominer is based on the statistical nature of the protocol format. We evaluate the efficacy of Biprominer over three binary protocols, with an average precision more than 99% and a recall better than 96.7%.","PeriodicalId":137617,"journal":{"name":"2011 12th International Conference on Parallel and Distributed Computing, Applications and Technologies","volume":"78 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123568127","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}