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

2013 32nd International Conference of the Chilean Computer Science Society (SCCC)最新文献

筛选
英文 中文
Implementing HOTs that Generate Transformations with Two Input Models 实现使用两个输入模型生成转换的hot
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.12
Luis Silvestre, M. Bastarrica, S. Ochoa
{"title":"Implementing HOTs that Generate Transformations with Two Input Models","authors":"Luis Silvestre, M. Bastarrica, S. Ochoa","doi":"10.1109/SCCC.2013.12","DOIUrl":"https://doi.org/10.1109/SCCC.2013.12","url":null,"abstract":"Model-driven Engineering (MDE) is a paradigm that promotes the use of models and automatic model transformations to handle complex software developments. Model transformations promise to reduce the effort for manipulating models. However, building transformations themselves is not easy. Higher-order Transformations (HOTs) are a means for automatically building model transformations. Building HOTs is in itself a complex task mainly because there are no standard languages for implementing them, and there are not many HOTs available in the literature to learn from. This situation is even worse when more sophisticated HOTs are required with two input models. We consider a real application to generate transformations for tailoring software process, because the generated transformation needs to have two input models: the organizational process and the project context model. In this paper, we show three different techniques for implementing this HOT and discuss their benefits and limitations.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"23 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"114568819","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
Information Retrieval Based on a Query Document Using Maximal Frequent Sequences 基于最大频繁序列的查询文档信息检索
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.13
Ricardo Merlo-Galeazzi, J. A. Carrasco-Ochoa, J. Martínez-Trinidad, J. A. Olvera-López
{"title":"Information Retrieval Based on a Query Document Using Maximal Frequent Sequences","authors":"Ricardo Merlo-Galeazzi, J. A. Carrasco-Ochoa, J. Martínez-Trinidad, J. A. Olvera-López","doi":"10.1109/SCCC.2013.13","DOIUrl":"https://doi.org/10.1109/SCCC.2013.13","url":null,"abstract":"Information Retrieval (IR) methods are commonly based on words, these methods allow the user to formulate a query through keywords. However, there are situations where the user has only one example document and based on this example it is needed to recover the most similar documents in a collection. This paper proposes an IR method that receives as input a query document and retrieves the k most similar documents to the query document using a representation based on Maximal Frequent Sequences (MFSs). Our method is tested and compared against the IR model based on bag of words, the experimental results show that the proposed method obtains good performance in contrast to the results obtained by the IR model based on bag of words.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"123 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122030997","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
OVMMSOM: A Variation of MMSOM and VMSOM as a Clusterization Technique OVMMSOM:一种基于MMSOM和VMSOM的聚类技术
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.31
Franco Sanchez Huertas, R. E. Patiño-Escarcina, Yván J. Túpac Valdivia
{"title":"OVMMSOM: A Variation of MMSOM and VMSOM as a Clusterization Technique","authors":"Franco Sanchez Huertas, R. E. Patiño-Escarcina, Yván J. Túpac Valdivia","doi":"10.1109/SCCC.2013.31","DOIUrl":"https://doi.org/10.1109/SCCC.2013.31","url":null,"abstract":"In this paper the Optimized Vector and Marginal Median Self-Organizing Map (OVMMSOM) was proposed as a new method of train Self-Organizing Maps (SOM). This variant is based on order statistics, Marginal Median SOM (MMSOM) and Vector Median SOM (VMSOM). This training model combines MMSOM and VMSOM defining their particular importance through a l participation index. To demonstrate the effectiveness of the proposal, images from the COIL100 data set was clusterized and the Compose Density between and within clusters (CDbw) validity index was used. The performed experiments show that the proposed model outperforms standard SOM network trained in batch and even results from MMSOM and VMSOM by separately.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"20 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122248477","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
Toward a more Generalized Quantum-Inspired Evolutionary Algorithm for Combinatorial Optimization Problems 面向组合优化问题的更广义的量子启发进化算法
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.30
Julio Manuel Alegria Reymer, Yván J. Túpac Valdivia
{"title":"Toward a more Generalized Quantum-Inspired Evolutionary Algorithm for Combinatorial Optimization Problems","authors":"Julio Manuel Alegria Reymer, Yván J. Túpac Valdivia","doi":"10.1109/SCCC.2013.30","DOIUrl":"https://doi.org/10.1109/SCCC.2013.30","url":null,"abstract":"In this paper, a generalization of the original Quantum-Inspired Evolutionary Algorithm (QIEA): the Generalized Quantum-Inspired Evolutionary Algorithm (GQIEA) is proposed. Like QIEA, GQIEA is also based on the quantum computing principle of superposition of states, but extending it not only to be used for binary values {0, 1}, but for any finite set of values {1, n}. GQIEA, as any other quantum inspired evolutionary algorithm, defines an own quantum individual, an evaluation function and population operators. As in QIEA, GQIEA also defines a generalized Q-gate operator, which is a variation operator to drive the individuals toward better solutions. To demonstrate its effectiveness and applicability, the proposal will be applied to the Knapsack Problem (KP), a classic combinatorial optimization problem. Results show that GQIEA has a good performance even with a small population.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"15 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"121229513","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 Conceptual Framework to Develop Mobile Recommender Systems of Points of Interest 开发兴趣点移动推荐系统的概念框架
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.17
Gonzalo Rojas, Claudio Uribe
{"title":"A Conceptual Framework to Develop Mobile Recommender Systems of Points of Interest","authors":"Gonzalo Rojas, Claudio Uribe","doi":"10.1109/SCCC.2013.17","DOIUrl":"https://doi.org/10.1109/SCCC.2013.17","url":null,"abstract":"Recommendation technologies are being increasingly adopted by mobile applications. Multiple algorithms and strategies are proposed to recommend the best points of interest to users of handheld devices. Unfortunately, developers of these systems receive little support to deal with the challenging integration of such approaches into a software development process. In this work, we introduce a conceptual framework to develop mobile recommender systems of geographic points of interest, from a model-driven perspective. This framework is composed of three phases that help developers specify the structural, behavioral and navigational aspects of a recommender system from a high abstraction level. In this way, our proposal supports the implementation of collaborative filtering algorithms and their combination with content-based and location-based constraints, based on multiple preference actions usually performed in the evaluation of geographic locations. A case study is introduced to illustrate this proposal.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"374 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"122926091","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}
引用次数: 8
Modeling Agreement in Social Groups Using Conceptual Agreement Theory 基于概念协议理论的社会群体协议建模
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.9
Sergio E. Chaigneau, E. Canessa
{"title":"Modeling Agreement in Social Groups Using Conceptual Agreement Theory","authors":"Sergio E. Chaigneau, E. Canessa","doi":"10.1109/SCCC.2013.9","DOIUrl":"https://doi.org/10.1109/SCCC.2013.9","url":null,"abstract":"Many social phenomena can be viewed as processes in which individuals in social groups develop agreement (e.g., public opinion, the spreading of rumor, the formation of social and linguistic conventions). This study presents an Agent Based Model (ABM) based on Conceptual Agreement Theory (CAT), which models social agreement as a simplified communicational event in which an Observer (O) and Actor (A) exchange ideas about a concept C, and where O uses that information to infer whether A's conceptual state is the same as its own (i.e., to infer agreement). Agreement may be true (when O infers that A is thinking C and this is in fact the case, event a1) or illusory (when O infers that A is thinking C and this is not the case, event a2). In CAT, concepts that afford a1 or a2 become more salient in the minds of members of social groups. Results from the ABM show that, as our conceptual analyses suggested would be the case, the simulated social system selects concepts according to their usefulness to agents in promoting agreement among them. Furthermore, the ABM exhibits more complex dynamics where similar minded agents cluster and are able to retain useful concepts even when a different group of agents discards them.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"415 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"115925158","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 Descriptor for Handwritten Strokes Off-Line Analysis: A Preliminary Study 手写笔划离线分析描述符的初步研究
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.19
V. Aubin, M. Mora
{"title":"A Descriptor for Handwritten Strokes Off-Line Analysis: A Preliminary Study","authors":"V. Aubin, M. Mora","doi":"10.1109/SCCC.2013.19","DOIUrl":"https://doi.org/10.1109/SCCC.2013.19","url":null,"abstract":"This paper presents preliminary results of the study of a new descriptor for identity verification based on handwriting strokes. The descriptor is obtained from the relationship between the line that joins the darkest points of the image and the line of the skeleton of the stroke. It was discovered that the relative distance between the line of the minimum gray level values in relation to the skeleton is not only characteristic of the author but it also varies from one person to another. The promising results of this study lead to the belief that it is feasible to develop a method of identity verification based on the descriptor presented.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"8 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"130110611","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
Tape Mbo'e (TME): A Service-Oriented Method 磁带管理(TME):面向服务的方法
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.28
Ilse Grau, L. Cernuzzi, Adolfo Villafiorita
{"title":"Tape Mbo'e (TME): A Service-Oriented Method","authors":"Ilse Grau, L. Cernuzzi, Adolfo Villafiorita","doi":"10.1109/SCCC.2013.28","DOIUrl":"https://doi.org/10.1109/SCCC.2013.28","url":null,"abstract":"In many developing countries, legacy systems of government are normally isolate affecting the quality of services provided to citizens. This situation affects the data trustfulness, and transparency. For this reason, various governments have been striving interoperate their legacy systems using service oriented paradigm. To achieve this ambitious goal many aspects have to be considered such as the economy conditions that have an influence on the decision of adopting software development method. The method has to produce fast deliveries, maintains the costs low, and considers from the beginning aspects related to long-term sustainability of the IT solutions. Trying to comply with such requirements, Tape Mbo'e Process (TME) has been proposed. TME focuses on building, and maintaining sustainable services-based applications. TME has been used in five case studies, which embraced both academia and public organizations in Paraguay. It is important to remark that it was the first application of this type of evaluation in the public sector in Paraguay. The initial results of the different case studies indicate the feasibility and simplicity of TME when it is applied in this context.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"27 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126573979","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
Wind Speed Forecast under a Distributed Learning Approach 分布式学习方法下的风速预报
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.24
H. Allende-Cid, H. Allende, R. Monge, C. Moraga
{"title":"Wind Speed Forecast under a Distributed Learning Approach","authors":"H. Allende-Cid, H. Allende, R. Monge, C. Moraga","doi":"10.1109/SCCC.2013.24","DOIUrl":"https://doi.org/10.1109/SCCC.2013.24","url":null,"abstract":"In this paper we apply a distributed learning approach to improve the perfomance of wind speed forecast. We use data obtained from 54 different weather stations in the U. S. and without sharing data between sites, we share model information between them, to improve the performance over local models trained with only local data. We show that sharing the information of the distributed models, improves the forecast we could obtain by only using locally trained models.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"129664531","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
Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes 搜索节点交叉缓存的成本感知策略分析
2013 32nd International Conference of the Chilean Computer Science Society (SCCC) Pub Date : 2013-11-01 DOI: 10.1109/SCCC.2013.23
E. Feuerstein, Gabriel Tolosa
{"title":"Analysis of Cost-Aware Policies for Intersection Caching in Search Nodes","authors":"E. Feuerstein, Gabriel Tolosa","doi":"10.1109/SCCC.2013.23","DOIUrl":"https://doi.org/10.1109/SCCC.2013.23","url":null,"abstract":"We propose static, dynamic and hybrid cost-awarepolicies for intersection caching and we introduce three different strategies to solve a query computing list intersections. We run experiments over a simulation framework using real data for both document collection and text queries. We observe that: a) cost-aware policies outperform cost-oblivious policies, b) static policies are better than dynamic policies (as in posting list caching), c) hybrid policies outperform the previous ones achieving up to 29% of cost savings and d) computing strategies that try to maximize cache usage have a better performance than the a-priori most efficient ones.","PeriodicalId":182181,"journal":{"name":"2013 32nd International Conference of the Chilean Computer Science Society (SCCC)","volume":"49 1","pages":"0"},"PeriodicalIF":0.0,"publicationDate":"2013-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"126098614","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
首页 上一页 下一页 尾页
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学术官方微信