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

2009 International Conference of the Chilean Computer Science Society最新文献

筛选
英文 中文
A Skandium Based Parallelization of DNSSEC 基于Skandium的DNSSEC并行化
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.22
M. Leyton, José M. Piquer
{"title":"A Skandium Based Parallelization of DNSSEC","authors":"M. Leyton, José M. Piquer","doi":"10.1109/SCCC.2009.22","DOIUrl":"https://doi.org/10.1109/SCCC.2009.22","url":null,"abstract":"This paper shows an effective methodology to parallelize DNSSEC using an algorithmic skeleton library: Skandium. DNSSEC is the Domain Name System (DNS) Security Extensions. DNSSEC provides a set of backward compatible extensions to the DNS that secure the domain name resolution process. The application of these extensions to a domain zone introduces new CPU intensive tasks, where parallelism can be applied to reduce the digital signing time. The high-level abstractions offered by algorithmic skeletons provide a simple way for non-parallel programmers to address parallel programming. The objective of this paper is to show how algorithmic skeletons can be used to successfully parallelize a real world problem, DNSSEC, on a multi-core hardware.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"218 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128962894","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
A Certified Access Controller for JME-MIDP 2.0 Enabled Mobile Devices 支持JME-MIDP 2.0移动设备的认证访问控制器
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.10
Ramin Roushani Oskui, Gustavo Betarte, C. Luna
{"title":"A Certified Access Controller for JME-MIDP 2.0 Enabled Mobile Devices","authors":"Ramin Roushani Oskui, Gustavo Betarte, C. Luna","doi":"10.1109/SCCC.2009.10","DOIUrl":"https://doi.org/10.1109/SCCC.2009.10","url":null,"abstract":"Mobile devices, like cell phones and PDAs, allow to store information and to establish connections with external entities. The JME platform, a Java enabled technology, provides the MIDP standard that facilitates applications development and specifies a security model for the controlled access to sensitive resources of the device. This paper describes a high level formal specification of an access controller for JME-MIDP 2.0. This formal definition of the controller has been obtained as an extension of a specification, developed using the Calculus of Inductive Constructions and the proof assistant Coq, of the MIDP 2.0 security model. The paper also discusses the refinement of the specification into an executable model and describes the algorithm which has been proven to be a correct implementation of the specified access controller.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"250-251 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"116185854","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
O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems o型环:点对点系统的容错和负载平衡架构
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.15
P. Melliar-Smith, L. Moser
{"title":"O-Ring: A Fault Tolerance and Load Balancing Architecture for Peer-to-Peer Systems","authors":"P. Melliar-Smith, L. Moser","doi":"10.1109/SCCC.2009.15","DOIUrl":"https://doi.org/10.1109/SCCC.2009.15","url":null,"abstract":"O-Ring is a novel architecture that provides fault tolerance and load balancing for peer-to-peer systems. As the number of peers increases, faults become more frequent and fault tolerance becomes important. As the number of users increases, demand becomes more variable and load balancing becomes necessary. In O-Ring, data items are replicated on successive peers around the ring, with an overlap of data items stored at consecutive peers. Each peer holds data items for which it is directly responsible. It also holds backup copies of data items held by the peer preceding it on the ring and the peer following it on the ring. O-Ring allows peers to adjust their loads dynamically, without the overhead of transferring data items and without delay in request processing.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128869232","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}
引用次数: 6
A Scalable Distributed Algorithm for Optimizing Distribution Power-Grids 配电网优化的可扩展分布式算法
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.9
J. Pezoa, L. García-Santander, A. Carcamo-Gallardo
{"title":"A Scalable Distributed Algorithm for Optimizing Distribution Power-Grids","authors":"J. Pezoa, L. García-Santander, A. Carcamo-Gallardo","doi":"10.1109/SCCC.2009.9","DOIUrl":"https://doi.org/10.1109/SCCC.2009.9","url":null,"abstract":"Utilities are interested in obtaining optimal operational topologies for their distribution power-grids so that they can efficiently employ grid resources, and simultaneously, increase their profits while providing a specified quality-of-service (QoS) to their customers. This paper presents a distributed and scalable algorithm for yielding an optimal power-grid topology that minimizes the (QoS) metric called energy not supplied (ENS) by the distribution grid. The (ENS) is minimized by constructing both local, independent minimum weight spanning trees (MWSTs) and a global yet unique (MWST) for the entire grid. At each step of the distributed algorithm, agents exchange information about their local (MWST) in order to coordinately construct the global (MWST). In addition, the distributed algorithm exploits heuristics to supply extra decision criteria to the agents constructing the (MWST) of the power grid.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"2 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"128246784","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}
引用次数: 3
Adaptive Algorithm for Threshold Path Subset Queries 阈值路径子集查询的自适应算法
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.17
Jérémy Félix Barbay, Aleh Veraskouski
{"title":"Adaptive Algorithm for Threshold Path Subset Queries","authors":"Jérémy Félix Barbay, Aleh Veraskouski","doi":"10.1109/SCCC.2009.17","DOIUrl":"https://doi.org/10.1109/SCCC.2009.17","url":null,"abstract":"In the context of queries to indexed search engines such as Google, Barbay and Kenyon introduced and solved threshold set queries, answered by the set of references associated with at least $t$ keywords out of the $k$ given as input, for some constant parameter $t$. We slightly generalize those results to the easy case where weights are associated to the keywords of the query, and to the more difficult case where weights are associated to the pairs of the relation between keywords and references. In the context of search queries on indexed file systems, Barbay et al. introduced and solved path-subset queries, answered by the minimum set of subtrees which rooted path match all $k$ keywords given as input. We combine both approaches to define and solve weighted threshold path-subset queries, answered by the minimum set of subtrees which rooted path match at least $t$ keywords out of the $k$ given as input, through the definition of a reduction to threshold queries.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"9 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130565955","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 Two-Level Calculus for Composing Hybrid QVT Transformations 组合混合QVT变换的两级演算
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-10 DOI: 10.1109/SCCC.2009.14
C. Pons, R. Giandini, G. Perez, G. Baum
{"title":"A Two-Level Calculus for Composing Hybrid QVT Transformations","authors":"C. Pons, R. Giandini, G. Perez, G. Baum","doi":"10.1109/SCCC.2009.14","DOIUrl":"https://doi.org/10.1109/SCCC.2009.14","url":null,"abstract":"The standard for model transformations QVT offers two dialects: Relations Language and Operational Mappings Language. Each one of these dialects can be used in isolation, resulting in purely declarative transformations or purely imperative transformation respectively; alternatively, both dialects can be combined resulting in a hybrid transformation approach. On the other hand, the availability of compositional approaches to produce complex transformations from smaller units is a major concern in the area of model transformations. Compositional approaches for pure QVT transformations are supported by a number of tools; however no composition technique exists that can consistently manage the hybrid approach. Such partial techniques provide suitable answers to most practical needs; but they do not cover the entire composition spectrum. The aim of this article is to describe a technique for composing model transformations embracing both dimensions - declarative and imperative - so that the hybrid approach can be smoothly supported. Additionally, we report the implementation of a software tool supporting such technique and we sketch its validation.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"22 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115565234","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
A Language for Encoding and Reconstruction of Rewriting Proofs 一种改写证明的编码与重构语言
2009 International Conference of the Chilean Computer Science Society Pub Date : 2009-11-01 DOI: 10.1109/SCCC.2009.8
Jorge F. Salas
{"title":"A Language for Encoding and Reconstruction of Rewriting Proofs","authors":"Jorge F. Salas","doi":"10.1109/SCCC.2009.8","DOIUrl":"https://doi.org/10.1109/SCCC.2009.8","url":null,"abstract":"We present a language for encoding semiautomatic proofs of theorems in the inductive theory generated by a system of equations oriented as rewriting rules. These proofs can be made using a rewriting induction principle with a special notion of cover set. The proofs can include simple or conditional rewriting steps using auxiliary lemmas and case analysis subprooofs. The language allows the encoding of partially finished proofs for their later reconstruction and continuance. The language has been added to the p3f system and the successful experiments performed indicate its viability and usefulness for encoding and reconstruction of rewriting proofs.","PeriodicalId":398661,"journal":{"name":"2009 International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2009-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115814059","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
首页 上一页
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学术文献互助群
群 号：481959085
Book学术官方微信