发布求助
文献互助 智能选刊 最新文献

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

筛选
英文 中文
Parallel similarity search based on the dimensions value cardinalities of image descriptor vectors 基于图像描述子向量维值基数的并行相似性搜索
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695857
Dimitrios Rafailidis, Y. Manolopoulos
{"title":"Parallel similarity search based on the dimensions value cardinalities of image descriptor vectors","authors":"Dimitrios Rafailidis, Y. Manolopoulos","doi":"10.1145/2695664.2695857","DOIUrl":"https://doi.org/10.1145/2695664.2695857","url":null,"abstract":"In this paper, we propose a parallel similarity search strategy based on the dimensions value cardinalities, an inherit characteristic of image descriptor vectors. Our strategy has low preprocessing requirements by dividing the computational cost of the preprocessing steps into several machines and locating the descriptors with similar dimensions value cardinalities logically close. Additionally, an efficient parallel query processing algorithm is proposed, where the dimensions of image descriptors are prioritized in the searching strategy, assuming that dimensions of high value cardinalities have more discriminative power than the dimensions of low ones. In our experiments with publicly available datasets of 80 million and 1 billion images, we show that the proposed method outperforms state-of-the-art parallel similarity search strategies, in terms of preprocessing cost, search time and accuracy. Finally, we made our source code publicly available.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"133 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":"116173768","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}
引用次数: 0
A service-oriented architecture for billing resources in IaaS cloud platforms IaaS云平台中用于计费资源的面向服务的体系结构
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2719244
Nayane Ponte Viana, Fernando A. M. Trinta, Ricardo Viana, Rossana Andrade, V. Garcia, R. Assad
{"title":"A service-oriented architecture for billing resources in IaaS cloud platforms","authors":"Nayane Ponte Viana, Fernando A. M. Trinta, Ricardo Viana, Rossana Andrade, V. Garcia, R. Assad","doi":"10.1145/2695664.2719244","DOIUrl":"https://doi.org/10.1145/2695664.2719244","url":null,"abstract":"Cloud Computing is a recent paradigm where different IT resources, such as applications or hardware, are quickly provisioned to customers through a pay per use model. Many research studies have already been conducted concerning billing services for cloud computing, but they lack on flexibility to establish how resources are defined and monitored. In fact, current solutions seem also very dependent on specific cloud infrastructures. This paper proposes an architecture for billing cloud services decoupled from specific providers, named as aCCountS. This service is complemented by a Domain Specific Language that allows the specification of flexible pricing policies. Such policies aims at supporting cloud billing requirements collected from our literature survey, allowing pricing schemes that meet different customer profiles. Based on this architecture, a prototype has been implemented and tested to validate our proposal in two different cloud infrastructures. Experiments confirmed that (i) the architecture hasn't dependencies of specific IaaS provider and (ii) the charging procedures are done correctly.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"16 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":"115168239","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}
引用次数: 0
Deep learning in partially-labeled data streams 部分标记数据流中的深度学习
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695871
Jesse Read, F. Pérez-Cruz, A. Bifet
{"title":"Deep learning in partially-labeled data streams","authors":"Jesse Read, F. Pérez-Cruz, A. Bifet","doi":"10.1145/2695664.2695871","DOIUrl":"https://doi.org/10.1145/2695664.2695871","url":null,"abstract":"Of the considerable research on data streams, relatively little deals with classification where only some of the instances in the stream are labeled. Most state-of-the-art data-stream algorithms do not have an effective way of dealing with unlabeled instances from the same domain. In this paper we explore deep learning techniques that provide important advantages such as the ability to learn incrementally in constant memory, and from unlabeled examples. We develop two deep learning methods and explore empirically via a series of empirical evaluations the application to several data streams scenarios based on real data. We find that our methods can offer competitive accuracy as compared with existing popular data-stream learners.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"119 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":"123253076","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}
引用次数: 29
Towards fast profiling of storage devices regarding access sequentiality 关于存取顺序的存储设备快速剖析
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695701
F. Boito, Rodrigo Kassick, P. Navaux, Y. Denneulin
{"title":"Towards fast profiling of storage devices regarding access sequentiality","authors":"F. Boito, Rodrigo Kassick, P. Navaux, Y. Denneulin","doi":"10.1145/2695664.2695701","DOIUrl":"https://doi.org/10.1145/2695664.2695701","url":null,"abstract":"This work presents a tool for storage device profiling named SeRRa. Our tool obtains the sequential to random throughput ratio for reads and writes of different sizes. Several optimizations aim at adapting applications' access patterns in order to generate contiguous accesses for improved performance when accessing storage devices like hard disks. However, when considering other storage options like RAID arrays and SSDs, the access time ratio between contiguous and non-contiguous accesses may not compensate for these optimizations' cost. In this scenario, the information provided by our tool could be used to dynamically decide if optimizations are beneficial for performance, an important task to provide I/O throughput. In order to provide this information efficiently, SeRRa employs benchmarks to obtain the values for a subset of the parameter space and estimates the remaining values through a linear model. Extensive test campaigns with our tool on nine storage devices have shown median errors of approximately 5% (up to 55%) while taking only 1/168 of the originally needed time.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"19 28-29 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":"123574581","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
Constructive extensibility of trustworthy component-based systems 可信赖的基于组件的系统的建设性可扩展性
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695916
José Dihego, A. Sampaio, M. Oliveira
{"title":"Constructive extensibility of trustworthy component-based systems","authors":"José Dihego, A. Sampaio, M. Oliveira","doi":"10.1145/2695664.2695916","DOIUrl":"https://doi.org/10.1145/2695664.2695916","url":null,"abstract":"In this paper we propose inheritance relations for a CSP-based component model (BRIC), which supports a constructive design based on composition rules that preserves desired properties such as deadlock freedom. We enhance this component model with support for extensibility via inheritance. The proposed relations allow extension of functionality, whilst preserving service conformance, which we define by means of a substitutability test. We also establish an algebraic connection between component extensibility and refinement. We illustrate our results by presenting a case study that consists of a bank system incrementally improved by inheritance.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"45 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":"121708135","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}
引用次数: 4
An anonymous ID-based remote mutual authentication with key agreement protocol on ECC using smart cards 一种基于智能卡ECC的基于匿名身份和密钥协议的远程相互认证方法
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695666
R. Goutham, Gil-Je Lee, K. Yoo
{"title":"An anonymous ID-based remote mutual authentication with key agreement protocol on ECC using smart cards","authors":"R. Goutham, Gil-Je Lee, K. Yoo","doi":"10.1145/2695664.2695666","DOIUrl":"https://doi.org/10.1145/2695664.2695666","url":null,"abstract":"In recent times, Debiao et al. proposed an ID-based user authentication with key agreement protocol on elliptic curve cryptography (ECC). Conversely, our analysis shows that their scheme contains various security limitations such as many logged-in users' problem, privileged insider attack, impersonation attack and so on. In this paper, we propose an anonymous ID-based remote mutual authentication with key agreement protocol on ECC using smart cards. The proposed scheme affords important security features such as identity protection, anonymity and secure session-key while remain the merits of Debiao's scheme. Our scheme guards the original identity of user by making it anonymous using pseudo random number generators, in order to free it from re-registration problem and smart-card-stolen attacks. The proposed scheme is also a two-factor authentication scheme, and makes the authentication procedure more secure by asking the user to provide two-means of identification. It also provides identity updating feature as depicted in further subsections.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"98 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":"122806555","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
Parameterization of fail-operational architectural patterns 故障操作体系结构模式的参数化
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2696035
D. O. D. Penha, Gereon Weiss
{"title":"Parameterization of fail-operational architectural patterns","authors":"D. O. D. Penha, Gereon Weiss","doi":"10.1145/2695664.2696035","DOIUrl":"https://doi.org/10.1145/2695664.2696035","url":null,"abstract":"In today's cyber physical systems, adaptability concepts can be used to fulfill fail-operational requirements while enabling optimized resource utilization. However, the applicability of such concepts highly depends on the support for the engineering during system development. We propose an approach to cope with the challenges of fail-operational behavior of CPS in which engineers are supported by design concepts for realizing safety, reliability, and adaptability requirements through the use of architectural patterns. The approach allows expressing concepts for fail-operational behavior at the software architecture level. By our approach, the effort for developing adaptive CPS can be kept low by utilizing fail-operational architectural patterns for general and reoccurring safety-relevant mechanisms. This is demonstrated by an application to an automotive case system.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"29 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":"123970196","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}
引用次数: 1
Multi-stage seed selection for viral marketing 病毒式营销的多阶段种子选择
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695964
A. Mochalova, A. Nanopoulos
{"title":"Multi-stage seed selection for viral marketing","authors":"A. Mochalova, A. Nanopoulos","doi":"10.1145/2695664.2695964","DOIUrl":"https://doi.org/10.1145/2695664.2695964","url":null,"abstract":"In this paper, a multi-stage seed selection approach is proposed, that performs seed selection in several stages to optimize viral marketing in online social network. In each stage, seeds are selected among the central nodes that have not yet been activated. Thus, the proposed approach exploits the information that is acquired during the previous stages in order to improve its performance in the forthcoming stages. Experimental results using data from a real-world social network show that the proposed approach brings significant improvement in performance (up to 30% compared to the single-stage approach).","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"33 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":"125139986","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}
引用次数: 1
Dynamic decision-making based on NFR for managing software variability and configuration selection 基于NFR的动态决策管理软件可变性和配置选择
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695875
A. Almeida, N. Bencomo, T. Batista, Everton Cavalcante, F. Dantas
{"title":"Dynamic decision-making based on NFR for managing software variability and configuration selection","authors":"A. Almeida, N. Bencomo, T. Batista, Everton Cavalcante, F. Dantas","doi":"10.1145/2695664.2695875","DOIUrl":"https://doi.org/10.1145/2695664.2695875","url":null,"abstract":"Due to dynamic variability, identifying the specific conditions under which non-functional requirements (NFRs) are satisfied may be only possible at runtime. Therefore, it is necessary to consider the dynamic treatment of relevant information during the requirements specifications. The associated data can be gathered by monitoring the execution of the application and its underlying environment to support reasoning about how the current application configuration is fulfilling the established requirements. This paper presents a dynamic decision-making infrastructure to support both NFRs representation and monitoring, and to reason about the degree of satisfaction of NFRs during runtime. The infrastructure is composed of: (i) an extended feature model aligned with a domain-specific language for representing NFRs to be monitored at runtime; (ii) a monitoring infrastructure to continuously assess NFRs at runtime; and (iii) a flexible decision-making process to select the best available configuration based on the satisfaction degree of the NRFs. The evaluation of the approach has shown that it is able to choose application configurations that well fit user NFRs based on runtime information. The evaluation also revealed that the proposed infrastructure provided consistent indicators regarding the best application configurations that fit user NFRs. Finally, a benefit of our approach is that it allows us to quantify the level of satisfaction with respect to NFRs specification.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"26 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":"126457407","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
A framework to formally verify conformance of a software process to a software method 正式验证软件过程与软件方法的一致性的框架
Proceedings of the 30th Annual ACM Symposium on Applied Computing Pub Date : 2015-04-13 DOI: 10.1145/2695664.2695789
D. Khelladi, Reda Bendraou, S. Baarir, Yoann Laurent, M. Gervais
{"title":"A framework to formally verify conformance of a software process to a software method","authors":"D. Khelladi, Reda Bendraou, S. Baarir, Yoann Laurent, M. Gervais","doi":"10.1145/2695664.2695789","DOIUrl":"https://doi.org/10.1145/2695664.2695789","url":null,"abstract":"The increasing complexity of development projects requires methodological frameworks to support development processes. A method comes with a set of best practices that are enforced and instantiated into processes to drive the realization steps of the development project. However, those best practices come in the form of text in guides and books, or they are in the developer's mind. Thus, during an instantiation of a method, there is no guaranty to enforce its best practices into the process, which could impact negatively the criteria: cost, time, and quality. To cope with this issue, we propose a library of best practices to be checked for four popular methods: Unified Process, Extreme Programming, Scrum and Kanban. On top of this library we have built up a template-based constraint language and implemented it to express additional constraints on processes that are modeled with UML Activity Diagrams (AD). To apply formal verification, we leverage on a formalization based on fUML semantics. The evaluation showed the feasibility of our approach which covers all the aspects of the process, i.e. time, resource, control-flow, and data-flow.","PeriodicalId":206481,"journal":{"name":"Proceedings of the 30th Annual ACM Symposium on Applied Computing","volume":"56 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":"126540541","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}
引用次数: 9
首页 上一页
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整，为了账户安全，请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
请完成安全验证×
相关产品
×
本文献相关产品
联系我们：info@booksci.cn Book学术提供免费学术资源搜索服务，方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号：604180095
Book学术官方微信