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

On the architectural alignment of ATL and QVT 论ATL与QVT的体系结构一致性

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

F. Jouault, I. Kurtev

{"title":"On the architectural alignment of ATL and QVT","authors":"F. Jouault, I. Kurtev","doi":"10.1145/1141277.1141561","DOIUrl":"https://doi.org/10.1145/1141277.1141561","url":null,"abstract":"Transforming models is a critical activity in Model Driven Engineering (MDE). With the expected adoption of the OMG QVT standard for model transformation language it is anticipated that the experience in applying model transformations in various cases will increase. However, the QVT standard is just one possible approach to solving model transformation problems. In parallel with the QVT activity many research groups and companies have been working on their own model transformation approaches and languages. It is important for software developers to be able to compare and select the most suitable languages and tools for a particular problem. This paper compares the proposed QVT language and the ATLAS Transformation Language (ATL) as a step in the direction of gathering knowledge about the existing model transformation approaches. The focus is on the major language components (sublanguages and their features, execution tools, etc.) and how they are related. Both languages expose a layered architecture for organizing their components. The paper analyzes the layers and compares them according to various categories. Furthermore, motivations for interoperability between the languages and the related tools are given. Possible solutions for interoperability are identified and discussed.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"12 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":"126833435","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}

引用次数: 223

SMART-TV: a fast and scalable nearest neighbor based classifier for data mining SMART-TV:一个快速和可扩展的基于最近邻的数据挖掘分类器

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

T. Abidin, W. Perrizo

{"title":"SMART-TV: a fast and scalable nearest neighbor based classifier for data mining","authors":"T. Abidin, W. Perrizo","doi":"10.1145/1141277.1141403","DOIUrl":"https://doi.org/10.1145/1141277.1141403","url":null,"abstract":"K-nearest neighbors (KNN) is the simplest method for classification. Given a set of objects in a multi-dimensional feature space, the method assigns a category to an unclassified object based on the plurality of category of the k-nearest neighbors. The closeness between objects is determined using a distance measure, e.g. Euclidian distance. Despite its simplicity, KNN also has some drawbacks: 1) it suffers from expensive computational cost in training when the training set contains millions of objects; 2) its classification time is linear to the size of the training set. The larger the training set, the longer it takes to search for the k-nearest neighbors. In this paper, we propose a new algorithm, called SMART-TV (Small Absolute difference of Total Variation), that approximates a set of potential candidates of nearest neighbors by examining the absolute difference of total variation between each data object in the training set and the unclassified object. Then, the k-nearest neighbors are searched from that candidate set. We empirically evaluate the performance of our algorithm on both real and synthetic datasets and find that SMART-TV is fast and scalable. The classification accuracy of SMART-TV is high and comparable to the accuracy of the traditional KNN algorithm.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"31 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":"115272712","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}

引用次数: 36

Handheld devices for cooperative educational activities 合作教育活动手持设备

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

M. Sá, L. Carriço

引用次数: 22

Post-partition reconciliation protocols for maintaining consistency 用于维护一致性的分区后协调协议

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

Mikael Asplund, S. Nadjm-Tehrani

{"title":"Post-partition reconciliation protocols for maintaining consistency","authors":"Mikael Asplund, S. Nadjm-Tehrani","doi":"10.1145/1141277.1141439","DOIUrl":"https://doi.org/10.1145/1141277.1141439","url":null,"abstract":"This paper addresses design exploration for protocols that are employed in systems with availability-consistency tradeoffs. Distributed data is modelled as states of objects replicated across a network, and whose updates require satisfaction of integrity constraints over multiple objects. Upon detection of a partition, such a network will continue to provide delivery of services in parallel partitions; but only for updates with non-critical integrity constraints. Once the degraded mode ends, the parallel network partitions are reconciled to arrive at one partition.Using a formal treatment of the reconciliation process, three algorithms are proposed and studied in terms of their influence on service outage duration. The longer the reconciliation time, the lower is system availability; since the interval in which no services are provided is longer. However, the reconciliation time in turn is affected by the time to construct the post-partition system state. The shorter the construction time the higher is the number of updates that took place in the degraded mode but that will not be taken up in the reconciled partition. This will lead to a longer interval for rejecting/redoing these operations and thereby increase reconciliation time.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"40 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":"121207825","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

An adaptive energy efficient cache invalidation scheme for mobile databases 一种面向移动数据库的自适应节能缓存失效机制

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

A. Madhukar, R. Alhajj

引用次数: 19

Email classification for automated service handling 自动服务处理的电子邮件分类

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

R. Tailby, R. Dean, B. Milner, Dan J. Smith

引用次数: 8

Dynamic instantiation-checking components 动态实例化检查组件

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

Nigamanth Sridhar

引用次数: 5

Contentions-conscious dynamic but deterministic scheduling of computational and communication tasks 具有竞争意识的计算和通信任务的动态但确定的调度

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

Muhammad Farooq, F. Muller, M. Auguin

引用次数: 3

Editorial message: semantic-based resource discovery, retrieval and composition track 编辑消息:基于语义的资源发现、检索和组合跟踪

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

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

引用次数: 0

Adapting software components by structure fragmentation 通过结构碎片化调整软件组件

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

Gautier Bastide, A. Seriai, M. Oussalah

引用次数: 14