Proceedings of the 2006 ACM symposium on Applied computing最新文献_第5页

Impact of peer incentives on the dissemination of polluted content 同伴激励对污染内容传播的影响

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141720

Fabrício Benevenuto, C. Costa, Marisa A. Vasconcelos, Virgílio A. F. Almeida, J. Almeida, M. Mowbray

{"title":"Impact of peer incentives on the dissemination of polluted content","authors":"Fabrício Benevenuto, C. Costa, Marisa A. Vasconcelos, Virgílio A. F. Almeida, J. Almeida, M. Mowbray","doi":"10.1145/1141277.1141720","DOIUrl":"https://doi.org/10.1145/1141277.1141720","url":null,"abstract":"Recent studies have reported a new form of malicious behavior in file-sharing Peer-to-Peer systems: content pollution. The dissemination of polluted content in a P2P system has the detrimental effect of reducing content availability, and ultimately, decreasing the confidence of users in such systems. Two potential strategies for polluting P2P content are decoy insertion, which consists of injecting corrupted copies of a file into the system, and hash corruption, which consists of injecting a corrupted file with the same hash code as a non-corrupted one. Polluted content disseminates through P2P networks because users typically do not delete the corrupted files that they download.This paper investigates the effectiveness of peer incentives to delete corrupted files in reducing the dissemination of polluted content, considering the two aforementioned pollution mechanisms. Our simulation results show that the effectiveness of incentives is highly dependent on the pollution mechanism. We show that for a pollution dissemintation techinique called hash corruption, only effective incentive mechanisms are able to avoid spreading of polluted content.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129422838","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}

引用次数: 28

Towards chemical coordination for grids 走向网格的化学配位

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141381

J. Banâtre, Pascal Fradet, Yann Radenac

引用次数: 8

A chat interface for human-agent interaction in MAST MAST中人机交互的聊天界面

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141302

Marco M. Carvalho, M. Rebeschini, J. Horsley, Niranjan Suri

引用次数: 2

A Bayesian approach for protein classification 蛋白质分类的贝叶斯方法

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141322

L. Merschmann, A. Plastino

引用次数: 5

Assisted verification of elementary functions using Gappa 使用Gappa辅助验证基本函数

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141584

F. D. Dinechin, C. Lauter, G. Melquiond

{"title":"Assisted verification of elementary functions using Gappa","authors":"F. D. Dinechin, C. Lauter, G. Melquiond","doi":"10.1145/1141277.1141584","DOIUrl":"https://doi.org/10.1145/1141277.1141584","url":null,"abstract":"The implementation of a correctly rounded or interval elementary function needs to be proven carefully in the very last details. The proof requires a tight bound on the overall error of the implementation with respect to the mathematical function. Such work is function specific, concerns tens of lines of code for each function, and will usually be broken by the smallest change to the code (e.g. for maintenance or optimization purpose). Therefore, it is very tedious and error-prone if done by hand. This article discusses the use of the Gappa proof assistant in this context. Gappa has two main advantages over previous approaches: Its input format is very close to the actual C code to validate, and it automates error evaluation and propagation using interval arithmetic. Besides, it can be used to incrementally prove complex mathematical properties pertaining to the C code. Yet it does not require any specific knowledge about automatic theorem proving, and thus is accessible to a wider community. Moreover, Gappa may generate a formal proof of the results that can be checked independently by a lower-level proof assistant like Coq, hence providing an even higher confidence in the certification of the numerical code.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"65 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"127285675","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}

引用次数: 84

Conceptual process configurations in enterprise knowledge management systems 企业知识管理系统中的概念流程配置

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141631

Peter Bollen

引用次数: 13

A framework for content-based image retrieval fully exploiting the semantics of annotation 一个充分利用标注语义的基于内容的图像检索框架

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141682

T. D. Noia, E. Sciascio, F. D. Cugno, E. Tinelli, F. Donini

引用次数: 2

GIS, SINKS, FILL, and disappearing wetlands: unintended consequences in algorithm development and use GIS，汇，填充和消失的湿地:算法开发和使用中的意外后果

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141342

D. Jenkins, L. McCauley

{"title":"GIS, SINKS, FILL, and disappearing wetlands: unintended consequences in algorithm development and use","authors":"D. Jenkins, L. McCauley","doi":"10.1145/1141277.1141342","DOIUrl":"https://doi.org/10.1145/1141277.1141342","url":null,"abstract":"Geographic Information Systems (GIS) software has become an important computational tool in several fields. GIS software ranges from command line processors, with maximal control over internal model decisions, to GUI versions with point-and-click access to pre-set modules. Based on the output from this software, some GIS users make important decisions to plan and manage landscapes (e.g., cities, parks, forests) with real consequences for the managed ecosystems. We discuss a programming decision in a GIS algorithm originally used to discern flow direction in hydrological modeling: a first step in mapping streams and rivers. Topographic depressions (\"sinks\") are \"filled\" in the algorithm to map water flow downstream; otherwise, the GIS algorithm cannot solve the flow direction. Unfortunately, sinks are often \"isolated\" wetlands which provide essential habitat for many species not commonly found elsewhere. Thus the algorithmic filling of sinks can make these wetlands \"disappear\" in GIS output and land-use decisions based on this output.This algorithmic detail may have potentially devastating real-world consequences for numerous wetlands because land-use plans made in ignorance cannot adequately conserve these unique habitats and the vital ecosystem services that wetlands provide. These consequences were not anticipated by the programmers who originally implemented the flow direction algorithm and may not be known to GIS users. We offer several strategies to reduce the impact of these consequences for GIS programmers, users, and policy makers who depend on GIS data when making decisions.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130032274","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

Evaluating the intrinsic dimension of evolving data streams 评估不断发展的数据流的内在维度

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141426

Elaine P. M. de Sousa, A. Traina, C. Traina, C. Faloutsos

{"title":"Evaluating the intrinsic dimension of evolving data streams","authors":"Elaine P. M. de Sousa, A. Traina, C. Traina, C. Faloutsos","doi":"10.1145/1141277.1141426","DOIUrl":"https://doi.org/10.1145/1141277.1141426","url":null,"abstract":"Data streams are fundamental in several data processing applications involving large amount of data generated continuously as a sequence of events. Frequently, such events are not stored, so the data is analyzed and queried as they arrive and discarded right away. In many applications these events are represented by a predetermined number of numerical attributes. Thus, without loss of generality, we can consider events as elements from a dimensional domain. A sequence of events in a data stream can be characterized by its intrinsic dimension, which in dimensional datasets is usually lower than the embedding dimensionality. As the intrinsic dimension can be used to improve the performance of algorithms handling dimensional data (specially query optimization) measuring it is relevant to improve data streams processing and analysis as well. Moreover, it can also be useful to forecast data behavior. Hence, we present an algorithm able to measure the intrinsic dimension of a data stream on the fly, following its continuously changing behavior. We also present experimental studies, using both real and synthetic data streams, showing that the results on well-understood datasets closely follow what is expected from the known behavior of the data.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2006-04-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128965412","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}

引用次数: 16

TerraCost: a versatile and scalable approach to computing least-cost-path surfaces for massive grid-based terrains TerraCost:一种通用的、可扩展的方法，用于计算基于大量网格的地形的最小成本路径表面

Proceedings of the 2006 ACM symposium on Applied computing Pub Date : 2006-04-23 DOI: 10.1145/1141277.1141290

Thomas Hazel, Laura Toma, J. Vahrenhold, Rajiv Wickremesinghe

引用次数: 11