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.
{"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}
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.
k近邻(KNN)是最简单的分类方法。该方法在多维特征空间中给定一组对象，根据其k近邻的类别个数为未分类对象分配类别。物体之间的距离是用距离度量来确定的，例如欧几里得距离。尽管简单，但KNN也有一些缺点:1)当训练集包含数百万个对象时，它的训练计算成本昂贵;2)其分类时间与训练集的大小成线性关系。训练集越大，搜索k个最近邻所需的时间就越长。在本文中，我们提出了一种新的算法，称为SMART-TV (Small Absolute difference of Total Variation)，它通过检查训练集中每个数据对象与未分类对象之间的总变化的绝对差来近似一组最近邻的潜在候选对象。然后，从候选集合中搜索k个最近的邻居。我们对算法在真实数据集和合成数据集上的性能进行了实证评估，发现SMART-TV快速且可扩展。SMART-TV的分类精度高，可与传统KNN算法的分类精度相媲美。
{"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}
This paper presents a framework that aims to support several steps of learning activities. Working either on mobile and non-mobile devices, Test-IT, allows users to learn ubiquitously and to proceed with their work at any time and place. It approaches both teaching and learning activities, allowing teachers and students to cooperate using common mobile devices to transfer information between each other.We describe the requirements for using such tool on mobile devices and comment some of the current approaches. The design process and the framework's components, focusing particularly on the user interface and usability issues, are addressed.We also focus on the flexibility provided by Test-IT, allowing users to create specific applications, according to their field or subject of expertise.
{"title":"Handheld devices for cooperative educational activities","authors":"M. Sá, L. Carriço","doi":"10.1145/1141277.1141549","DOIUrl":"https://doi.org/10.1145/1141277.1141549","url":null,"abstract":"This paper presents a framework that aims to support several steps of learning activities. Working either on mobile and non-mobile devices, Test-IT, allows users to learn ubiquitously and to proceed with their work at any time and place. It approaches both teaching and learning activities, allowing teachers and students to cooperate using common mobile devices to transfer information between each other.We describe the requirements for using such tool on mobile devices and comment some of the current approaches. The design process and the framework's components, focusing particularly on the user interface and usability issues, are addressed.We also focus on the flexibility provided by Test-IT, allowing users to create specific applications, according to their field or subject of expertise.","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":"115860150","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}
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.
{"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}
This paper presents Adaptive Energy Efficient Cache Invalidation Scheme (AEECIS) for the wireless mobile environment. The algorithm is adaptive since it changes the data dissemination strategy based on the current conditions. To reduce the bandwidth requirement, the server transmits in one of three modes: slow, fast or super-fast. The mode is selected based on thresholds specified for time and the number of clients requesting updated objects. An efficient implementation of AEECIS is presented and simulations have been carried out to evaluate its caching effectiveness. The results demonstrate that it can substantially improve mobile caching by reducing the communication bandwidth for query processing. Compared to previous IR-based schemes, AEECIS can significantly improve bandwidth consumption and the number of uplink requests.
{"title":"An adaptive energy efficient cache invalidation scheme for mobile databases","authors":"A. Madhukar, R. Alhajj","doi":"10.1145/1141277.1141545","DOIUrl":"https://doi.org/10.1145/1141277.1141545","url":null,"abstract":"This paper presents Adaptive Energy Efficient Cache Invalidation Scheme (AEECIS) for the wireless mobile environment. The algorithm is adaptive since it changes the data dissemination strategy based on the current conditions. To reduce the bandwidth requirement, the server transmits in one of three modes: slow, fast or super-fast. The mode is selected based on thresholds specified for time and the number of clients requesting updated objects. An efficient implementation of AEECIS is presented and simulations have been carried out to evaluate its caching effectiveness. The results demonstrate that it can substantially improve mobile caching by reducing the communication bandwidth for query processing. Compared to previous IR-based schemes, AEECIS can significantly improve bandwidth consumption and the number of uplink requests.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"52 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":"123838213","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}
We describe the experience and lessons learned from developing a range of electronic services for a specialist engineering company. We are using a custom workflow management system as the base for a range of services which are offered via a multi-modal portal, using a language-based approach to extracting information from HTML forms, email, and SMS. We describe the email classification experiments we have carried out and discuss the development of customer services based on automatic email classification.
{"title":"Email classification for automated service handling","authors":"R. Tailby, R. Dean, B. Milner, Dan J. Smith","doi":"10.1145/1141277.1141530","DOIUrl":"https://doi.org/10.1145/1141277.1141530","url":null,"abstract":"We describe the experience and lessons learned from developing a range of electronic services for a specialist engineering company. We are using a custom workflow management system as the base for a range of services which are offered via a multi-modal portal, using a language-based approach to extracting information from HTML forms, email, and SMS. We describe the email classification experiments we have carried out and discuss the development of customer services based on automatic email classification.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"57 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":"122404655","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}
Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parameters are bound. Many languages provide syntactic support for parameterized components; this mode of parameterization can be called static parameterization. In order to be able to support dynamic reconfiguration, the Service Facility pattern has been proposed as an enabling technology for dynamic parameterization. However, static parameterization has the advantage of strong type-checking that dynamic parameterization does not. In this paper, we present DynInstaCheck --- a tool that automatically instruments dynamically bound parameterized components with run-time checking code that ensures type-safe parameter binding. The source instrumentation is done in a non-intrusive way, using aspect-oriented programming.
{"title":"Dynamic instantiation-checking components","authors":"Nigamanth Sridhar","doi":"10.1145/1141277.1141611","DOIUrl":"https://doi.org/10.1145/1141277.1141611","url":null,"abstract":"Parameterization is an effective technique for building flexible, reusable software. When dealing with parameterized components, an important concern is the time at which parameters are bound. Many languages provide syntactic support for parameterized components; this mode of parameterization can be called static parameterization. In order to be able to support dynamic reconfiguration, the Service Facility pattern has been proposed as an enabling technology for dynamic parameterization. However, static parameterization has the advantage of strong type-checking that dynamic parameterization does not. In this paper, we present DynInstaCheck --- a tool that automatically instruments dynamically bound parameterized components with run-time checking code that ensures type-safe parameter binding. The source instrumentation is done in a non-intrusive way, using aspect-oriented programming.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"44 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":"122499086","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}
Real Time Operating Systems (RTOS) for Multiprocessor System-on-Chip (MPSoC) are not well tackling with the scheduling of communication load between the tasks running on different processors. Traditionally communications and computations are considered separately leading to a great complexity in the analysis of the system behavior. We have explicitly scheduled the Inter-Processor Communication (IPC) on the shared medium considering all the parameters affecting its cost i.e. link contention, node contention and synchronization overhead. We have proposed a dynamic but deterministic communication model and have embedded it with the scheduling of the tasks on processors (RTOS kernel services) to get the deterministic behavior of the application.
{"title":"Contentions-conscious dynamic but deterministic scheduling of computational and communication tasks","authors":"Muhammad Farooq, F. Muller, M. Auguin","doi":"10.1145/1141277.1141623","DOIUrl":"https://doi.org/10.1145/1141277.1141623","url":null,"abstract":"Real Time Operating Systems (RTOS) for Multiprocessor System-on-Chip (MPSoC) are not well tackling with the scheduling of communication load between the tasks running on different processors. Traditionally communications and computations are considered separately leading to a great complexity in the analysis of the system behavior. We have explicitly scheduled the Inter-Processor Communication (IPC) on the shared medium considering all the parameters affecting its cost i.e. link contention, node contention and synchronization overhead. We have proposed a dynamic but deterministic communication model and have embedded it with the scheduling of the tasks on processors (RTOS kernel services) to get the deterministic behavior of the application.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"18 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":"122844365","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}
A resource is a broad term comprising goods in electronic commerce, information available in remote sites, services announced through Internet, learning objects, digital images, to mention a few. Whatever their nature, the term "resource" is used in a general sense for whatever might be identified atomically and univocally. Hence, the problem of resource matching and retrieval arises in several scenarios.
{"title":"Editorial message: semantic-based resource discovery, retrieval and composition track","authors":"T. D. Noia, E. Sciascio, F. Donini","doi":"10.1145/1141277.1141670","DOIUrl":"https://doi.org/10.1145/1141277.1141670","url":null,"abstract":"A resource is a broad term comprising goods in electronic commerce, information available in remote sites, services announced through Internet, learning objects, digital images, to mention a few. Whatever their nature, the term \"resource\" is used in a general sense for whatever might be identified atomically and univocally. Hence, the problem of resource matching and retrieval arises in several scenarios.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"1988 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":"131108532","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}
We present in this paper an approach aiming at adapting software components. It focuses on adapting component structures instead of adapting component services. Among the motivations of this kind of adaptation, we note its possible application to permit flexible deployment of software components and flexible loading of component code according to the available resources (CPU, memory). Our adaptation process is based on the analysis and the instrumentation of component codes. It respects the black-box property when it is implemented as a service provided by the component to be adapted. To support this structural adaptation technique, we developed an adaptation process which we have experimented using the Java framework of the Fractal component model.
{"title":"Adapting software components by structure fragmentation","authors":"Gautier Bastide, A. Seriai, M. Oussalah","doi":"10.1145/1141277.1141691","DOIUrl":"https://doi.org/10.1145/1141277.1141691","url":null,"abstract":"We present in this paper an approach aiming at adapting software components. It focuses on adapting component structures instead of adapting component services. Among the motivations of this kind of adaptation, we note its possible application to permit flexible deployment of software components and flexible loading of component code according to the available resources (CPU, memory). Our adaptation process is based on the analysis and the instrumentation of component codes. It respects the black-box property when it is implemented as a service provided by the component to be adapted. To support this structural adaptation technique, we developed an adaptation process which we have experimented using the Java framework of the Fractal component model.","PeriodicalId":269830,"journal":{"name":"Proceedings of the 2006 ACM symposium on Applied computing","volume":"10 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":"127606610","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：