Proceedings of the 30th Annual ACM Symposium on Applied Computing最新文献

Semi-supervised clustering using multi-assistant-prototypes to represent each cluster 使用多辅助原型来表示每个聚类的半监督聚类

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695738

Walter J. Silva, M. Barioni, S. D. Amo, H. Razente

{"title":"Semi-supervised clustering using multi-assistant-prototypes to represent each cluster","authors":"Walter J. Silva, M. Barioni, S. D. Amo, H. Razente","doi":"10.1145/2695664.2695738","DOIUrl":"https://doi.org/10.1145/2695664.2695738","url":null,"abstract":"The incorporation of semi-supervision in the cluster detection process has proved especially useful when one wants to get a high consistency between the data partitioning and the knowledge the user has about the data domain. In recent years, several strategies for semi-supervised clustering have been proposed. The approaches adopted by these strategies aim at guiding the process of cluster detection by using constraints: to interfere with the allocation of elements to the most appropriate cluster at each iteration of the algorithm; or to modify the objective function employed. This paper proposes a novel approach for incorporating semi-supervision in the well-known k-means algorithm. This semi-supervised clustering method employs constraint information in the definition of multiple assistant representatives for the centroids used at each iteration of k-means. A refinement process is designed to reduce the number of assistant representatives considered for each centroid without losing the clustering quality. The experimental results with eight synthetic datasets show the potential of the proposed approach for dealing with complex data structures composed by clusters of different shapes.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"277 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"124459336","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}

引用次数: 2

A multi-DAG model for real-time parallel applications with conditional execution 具有条件执行的实时并行应用程序的多dag模型

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695808

J. Fonseca, Vincent Nélis, Gurulingesh Raravi, L. M. Pinho

{"title":"A multi-DAG model for real-time parallel applications with conditional execution","authors":"J. Fonseca, Vincent Nélis, Gurulingesh Raravi, L. M. Pinho","doi":"10.1145/2695664.2695808","DOIUrl":"https://doi.org/10.1145/2695664.2695808","url":null,"abstract":"Owing to the current trends for higher performance and the ever growing availability of multiprocessors in the embedded computing (EC) domain, there is nowadays a strong push towards the parallelization of modern embedded applications. Several real-time task models have recently been proposed to capture different forms of parallelism. However, they do not deal explicitly with control flow information as they assume that all the threads of a parallel task must execute every time the task is activated. In contrast, in this paper, we present a multi-DAG model where each task is characterized by a set of execution flows, each of which represents a different execution path throughout the task code and is modeled as a DAG of sub-tasks. We propose a two-step solution that computes a single synchronous DAG of servers for a task modeled by a multi-DAG and show that these servers are able to supply every execution flow of that task with the required cpu-budget so that the task can execute entirely, irrespective of the execution flow taken at run-time, while satisfying its precedence constraints. As a result, each task can be modeled by its single DAG of servers, which facilitates in leveraging the existing single-DAG schedulability analyses techniques for analyzing the schedulability of parallel tasks with multiple execution flows.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"159 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123096347","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}

引用次数: 46

A multi-scale modeling approach for software architecture deployment 软件架构部署的多尺度建模方法

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695721

Amal Gassara, I. Rodriguez, M. Jmaiel

引用次数: 1

An approach to the MOGAS initialization problem using an algorithm based on path relinking 一种基于路径重链接的MOGAS初始化方法

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695897

T. N. Silva, J. Maia, L. Rocha

引用次数: 0

EASy-DSBuilder: automated assessment of tree data structures in computer science teaching EASy-DSBuilder:计算机科学教学中树形数据结构的自动评估

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695769

Claus A. Usener

引用次数: 1

Symmetry reduced state classes for time petri nets 时间petri网的对称简化状态类

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695803

Pierre-Alain Bourdil, B. Berthomieu, Silvano Dal-Zilio, F. Vernadat

引用次数: 2

SSD caching to overcome small write problem of disk-based RAID in enterprise environments SSD缓存克服企业环境中基于磁盘的RAID的小写问题

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695886

Eunjae Lee, Y. Oh, Donghee Lee

{"title":"SSD caching to overcome small write problem of disk-based RAID in enterprise environments","authors":"Eunjae Lee, Y. Oh, Donghee Lee","doi":"10.1145/2695664.2695886","DOIUrl":"https://doi.org/10.1145/2695664.2695886","url":null,"abstract":"Disk-based RAID still prevails in enterprise environments due to its cost-effectiveness, reliability, and maintainability. However, it suffers from parity update overhead, which is generally called small write problem that deteriorates performance significantly for small write requests. Targeting the parity update overhead, our design choice is employing Flash-based SSD cache upon disk-based RAID storage server. Particularly, we use single SSD, which can be purchased in consumer markets, as the caching device. By the way, an SSD has non-negligible failure rate and, thus, reliability may be compromised without appropriate measures to protect data from failure. To insure reliability upon failures while eliminating parity update overhead, we devise an SSD cache management scheme that we refer to as LeavO cache. The LeavO cache keeps not only new data but also old data in SSD cache to postpone parity updates in RAID storage until the old data are discarded for space recycling. By doing so, upon failures, lost data can be recovered with the old data and old parity or new data in the SSD cache. We implement the LeavO cache in a real Linux system and measure the performance of storage server with and without LeavO cache. Also, through mathematical analyses, we compare reliability of the LeavO cache with conventional RAID-0 and -5 configurations. Experimental results and mathematical analyses show that the LeavO cache effectively eliminates much of parity update overhead while providing reliability and maintainability comparable to conventional RAID configurations.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"67 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2015-04-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"125828891","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}

引用次数: 7

Session details: Volume II: Software development, system software and security: Multimedia and visualization track 会议详情:第二卷:软件开发、系统软件和安全:多媒体和可视化专题

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/3251692

M. G. Pimentel, T. Itoh, R. Goularte

引用次数: 0

Mapping the potential change impact in object-oriented software 映射面向对象软件中潜在的变更影响

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2696043

Mívian M. Ferreira, K. Ferreira, H. T. Marques-Neto

引用次数: 2

ORCAS: optimized robots configuration and scheduling system ORCAS:优化的机器人配置和调度系统

Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2696024

Marin Lujak, Alberto Fernández

引用次数: 4