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

2011 30th International Conference of the Chilean Computer Science Society最新文献

筛选
英文 中文
From Virtual Organizations to Self-Organizing Web Service Compositions 从虚拟组织到自组织Web服务组合
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.24
Romina Torres, Denise Rivera, H. Astudillo
{"title":"From Virtual Organizations to Self-Organizing Web Service Compositions","authors":"Romina Torres, Denise Rivera, H. Astudillo","doi":"10.1109/SCCC.2011.24","DOIUrl":"https://doi.org/10.1109/SCCC.2011.24","url":null,"abstract":"Due to the ever increasing proliferation of functional-equivalent web services, the task of finding a proper Web service composition in order to satisfy a set of requirements has become quite challenging. This problem has been typically addressed from the consumer's point of view, assigning the responsibility of discovering the needed services and modeling them as passive entities that wait to be discovered, selected and composed with others. We tackle the service composition problem to satisfy requirements completely from the services' point of view. We propose to wrap services as active software agents, constantly seeking to be selected by consumers and able to formate virtual organizations between them to bid and acquire more complex contracts. We present a Web tool and a simulation component to evaluate our approach with different experiments that characterize the feasibility of the approach in a large market.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"51 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"123565691","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
Relevance Feedback through the Generation of Trees for Image Retrieval Based on Multitexton Histogram 基于多文本直方图的树生成相关反馈图像检索
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.1
Yuber Velazco-Paredes, Roxana Flores-Quispe, R. E. Patiño-Escarcina, C. B. Castañón
{"title":"Relevance Feedback through the Generation of Trees for Image Retrieval Based on Multitexton Histogram","authors":"Yuber Velazco-Paredes, Roxana Flores-Quispe, R. E. Patiño-Escarcina, C. B. Castañón","doi":"10.1109/SCCC.2011.1","DOIUrl":"https://doi.org/10.1109/SCCC.2011.1","url":null,"abstract":"The Content-based image retrieval (CBIR) systems and their application in different areas of development, are current research topics, however the semantic gap between low-level image features and high-level semantic concepts handled by the user, is one of the main problems in the image retrieval. On the other hand, the relevance feedback has been used on many CBIR systems such as an effective solution to reduce the semantic gap. For that reason this paper proposes a method of relevance feedback based on the generation of trees and Histogram Multitexton descriptor. This method has been compared with the conventional RF algorithms \"Query vector modification\", and show significant improvements in terms of effectiveness in the image retrieval. Also the dimensionality of the Histogram Multitexton descriptor has been tested and with the first 64 dimensions increase its effectiveness which permit to reduce the computational processing time.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121209329","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}
引用次数: 19
An Ontology-Matching Based Proposal to Detect Potential Redundancies on Enterprise Architectures 一种基于本体匹配的企业架构冗余检测方法
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.16
C. Castellanos, D. Correal, Francisco Alexander Murcia Bermúdez
{"title":"An Ontology-Matching Based Proposal to Detect Potential Redundancies on Enterprise Architectures","authors":"C. Castellanos, D. Correal, Francisco Alexander Murcia Bermúdez","doi":"10.1109/SCCC.2011.16","DOIUrl":"https://doi.org/10.1109/SCCC.2011.16","url":null,"abstract":"Our work presents an approach to automatic detection of potentially redundant elements within an Enterprise Architecture (EA). Unintended or unidentified redundancies can affect the data quality, duplicating efforts which may lead to inconsistencies. Evaluating and identifying manually redundant elements in large information systems (IS) is a tedious, error-prone and time-consuming task. Untimely, incomplete or inaccurate analysis, could affect the dynamics and organizational flexibility that promotes an EA. Our proposal is a MDA (Model-Driven Architecture) and Ontology-Alignment based. The main idea is to perform a transformation from an EA model towards ontology in OWL format (Ontology Web Language) and exploit ontology matching tools to infer correspondences between concepts. Our objective is to support analysis and making decisions of architect with an integral view which describes EAs data and processes, and its inner relationships.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"54 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114689910","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
Zernike's Feature Descriptors for Iris Recognition with SVM 基于支持向量机的虹膜识别Zernike特征描述符
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.36
Juan Reyes-Lopez, Sergio Campos, H. Allende, Rodrigo F. Salas
{"title":"Zernike's Feature Descriptors for Iris Recognition with SVM","authors":"Juan Reyes-Lopez, Sergio Campos, H. Allende, Rodrigo F. Salas","doi":"10.1109/SCCC.2011.36","DOIUrl":"https://doi.org/10.1109/SCCC.2011.36","url":null,"abstract":"Valuable information of the iris is intrinsically located in its natural texture, therefore preserve and extract the most relevant features for biometric recognition is of paramount importance. The iris pattern is subject to translation, scaling and rotation, consequently the variations produced by these artifacts must be minimized. The main contribution of this work consists on performing a comparison between the descriptive power of the Zernike and pseudo Zernike polynomials for the identification of iris images using a Support Vector Machine (SVM) as a classifier. Experiments with the iris data set obtained from the Bath University repository show that our proposal yields high levels of accuracy.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"53 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130547294","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}
引用次数: 12
Recommending APIs for Mashup Completion Using Association Rules Mined from Real Usage Data 使用从实际使用数据中挖掘的关联规则为Mashup完成推荐api
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.12
B. Tapia, Romina Torres, H. Astudillo, Pablo Ortega
{"title":"Recommending APIs for Mashup Completion Using Association Rules Mined from Real Usage Data","authors":"B. Tapia, Romina Torres, H. Astudillo, Pablo Ortega","doi":"10.1109/SCCC.2011.12","DOIUrl":"https://doi.org/10.1109/SCCC.2011.12","url":null,"abstract":"Mashups are becoming the de facto approach to build customer-oriented Web applications, by combining several Web APIs into a single lightweight, rich, customized Web front-end. To help mashup builders to choose among a plethora of available APIs to assemble in their mashups, some existing recommendation techniques rank candidate APIs using popularity (a social measure) or keyword-based measures (whether semantic or unverified tags). This article proposes to use information on co-usage of APIs in previous mash ups to suggest likely candidate APIs, and introduces a global measure which improves on earlier local co-API measures. The gCAR (global Co-utilization API Ranking) is calculated using association rules inferred from historical API usage data. The MashupRECO tool combines gCAR and a keywordbased measure, to avoid the \"cold-start\" problem for new or unused APIs. Evaluation of MashupRECO versus the keyword search of the well-known ProgrammableWeb catalog show that the tool reduces the search time for comparable degree of completeness.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"75 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"134371662","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}
引用次数: 10
Approximations on Minimum Weight Pseudo-triangulation Problem Using Ant Colony Optimization Metaheuristic 用蚁群优化元启发式逼近最小权值伪三角问题
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.31
Edilma Olinda Gagliardi, Maria Gisela Dorzán, G. Leguizamón, Gregorio Hernández-Peñalver
{"title":"Approximations on Minimum Weight Pseudo-triangulation Problem Using Ant Colony Optimization Metaheuristic","authors":"Edilma Olinda Gagliardi, Maria Gisela Dorzán, G. Leguizamón, Gregorio Hernández-Peñalver","doi":"10.1109/SCCC.2011.31","DOIUrl":"https://doi.org/10.1109/SCCC.2011.31","url":null,"abstract":"In this work, we consider the Minimum Weight Pseudo-Triangulation (MWPT) problem of a given set of $n$ points in the plane. Globally optimal pseudo-triangulations with respect to the $weight$, as optimization criteria, are difficult to be found by deterministic methods, since no polynomial algorithm is known. We show how the Ant Colony Optimization (ACO) metaheuristic can be used to find high quality pseudo-triangulations of minimum weight. We present the experimental and statistical study based on our own set of instances since no reference to benchmarks for these problems were found in the literature. Throughout the experimental evaluation, we appraise the ACO metaheuristic performance for MWPT problem.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"25 11","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114113841","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
Register Allocation with Graph Coloring by Ant Colony Optimization 基于蚁群优化的图着色寄存器分配
2011 30th International Conference of the Chilean Computer Science Society Pub Date : 2011-11-09 DOI: 10.1109/SCCC.2011.32
C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva
{"title":"Register Allocation with Graph Coloring by Ant Colony Optimization","authors":"C. N. Lintzmayer, Mauro Henrique Mulati, A. F. Silva","doi":"10.1109/SCCC.2011.32","DOIUrl":"https://doi.org/10.1109/SCCC.2011.32","url":null,"abstract":"The goal of register allocation is to allocate an unbounded number of program values to a finite number of machine registers. In this paper, we describe a new algorithm for intraprocedural register allocation called CA-RT-RA, an algorithm that extends a classic graph coloring register allocator to use our graph coloring algorithm Color Ant-RT. The experiments demonstrated that our algorithm is able to minimize the amount of spills, thereby improving the quality of the generated code. CA-RT-RA is interesting in applications where compile time is not a concern, but the code quality.","PeriodicalId":173639,"journal":{"name":"2011 30th International Conference of the Chilean Computer Science Society","volume":"1 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2011-11-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121739707","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
首页 上一页
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学术官方微信