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

Comparing images with distance functions based on attribute interaction 基于属性交互的距离函数图像比较

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

J. C. Felipe, P. M. A. Marques, André G. R. Balan, C. Traina, A. Traina

引用次数: 2

Editorial message: special track on handheld computing 编辑信息:关于手持计算的特别曲目

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

Q. Mahmoud, Z. Maamar

引用次数: 0

Using Dijkstra's algorithm to incrementally find the k-Nearest Neighbors in spatial network databases 利用Dijkstra算法在空间网络数据库中逐步找到k个最近邻

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

Victor Teixeira de Almeida, R. H. Güting

引用次数: 26

Inner approximation of distance constraints with existential quantification of parameters 参数存在量化的距离约束内逼近

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

Carlos Grandón, A. Goldsztejn

引用次数: 2

Domotic house gateway 家庭大门

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

Paolo Pellegrino, Dario Bonino, Fulvio Corno

引用次数: 39

Policy-driven reflective enforcement of security policies 策略驱动的安全策略的反射执行

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

I. Welch, Fan Lu

引用次数: 5

Towards low-perturbation anonymity preserving pattern discovery 低摄动匿名保持模式发现

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

M. Atzori, F. Bonchi, F. Giannotti, D. Pedreschi

{"title":"Towards low-perturbation anonymity preserving pattern discovery","authors":"M. Atzori, F. Bonchi, F. Giannotti, D. Pedreschi","doi":"10.1145/1141277.1141412","DOIUrl":"https://doi.org/10.1145/1141277.1141412","url":null,"abstract":"It is generally believed that data mining results do not violate the anonymity of the individuals recorded in the source database. In fact, data mining models and patterns, in order to ensure a required statistical significance, represent a large number of individuals and thus conceal individual identities: this is the case of the minimum support threshold in association rule mining. We have recently shown [3], that the above belief is ill-founded: by shifting the concept of k-anonymity [8] from data to patterns, we have formally characterized the notion of a threat to anonymity in the context of frequent itemsets mining, and provided a methodology to efficiently and effectively identify such threats that might arise from the disclosure of a set of frequent itemsets. In our previous paper [2] we have introduced a first, naïve strategy (named suppressive) to sanitize such threats. In this paper we develop a novel sanitization strategy, named additive, which outperforms the previous one in terms of the introduced distortion and has the interesting feature of maintaining the original set of frequent itemsets unchanged, while modifying only the corresponding support values.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"8 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":"114450084","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}

引用次数: 8

Real coded clonal selection algorithm for unconstrained global optimization using a hybrid inversely proportional hypermutation operator 基于混合反比超突变算子的无约束全局优化实数编码克隆选择算法

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

V. Cutello, Giuseppe Nicosia, M. Pavone

引用次数: 75

Method overloading and overriding cause encapsulation flaw: an experiment on assembly of heterogeneous components 方法重载和重写导致封装缺陷:一个异构组件组装实验

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

A. Beugnard

引用次数: 7

On the transitive closure representation and adjustable compression 关于传递闭包表示和可调压缩

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

Yangjun Chen, D. Cooke

{"title":"On the transitive closure representation and adjustable compression","authors":"Yangjun Chen, D. Cooke","doi":"10.1145/1141277.1141385","DOIUrl":"https://doi.org/10.1145/1141277.1141385","url":null,"abstract":"A composite object represented as a directed graph (digraph for short) is an important data structure that requires efficient support in CAD/CAM, CASE, office systems, software management, web databases, and document databases. It is cumbersome to handle such objects in relational database systems when they involve ancestor-descendant relationships (or say, recursive relationships). In this paper, we present a new encoding method to label a digraph, which reduces the footprints of all previous strategies. This method is based on a tree labeling method and the concept of branchings that are used in graph theory for finding the shortest connection networks. A branching is a subgraph of a given digraph that is in fact a forest, but covers all the nodes of the graph. On the one hand, the proposed encoding scheme achieves the smallest space requirements among all previously published strategies for recognizing recursive relationships. On the other hand, it leads to a new algorithm for computing transitive closures for DAGs (directed acyclic graph) in O(e·b) time and O(n·b) space, where n represents the number of the nodes of a DAG, e the numbers of the edges, and b the DAG's breadth. The method can also be extended to graphs containing cycles. Especially, based on this encoding method, a multi-level compression is developed, by means of which the space for the representation of a transitive closure can be reduced to O((b/dk)·n), where k is the number of compression levels and d is the average outdegree of the nodes.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"19 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":"122047349","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}

引用次数: 5