Programa Clei 2010 v2

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 1
Lunes 18 de octubre
Sala 1
REA TEMTICA: INGENIERA DEL
SOFTWARE I (Lunes 18/10, 14:4016:20 hz)
1.1.1 Acompanhamento de Projetos de
Desenvolvimento de Software atravs de EVM e
ES (95)
Jefferson F. Neves (Centro Universitrio Unilasalle Av. Victor Barreto, 2288, Canoas, RS, Brasil jefferson.neves @gmail.com), Alessandra Dahmer,
Abraham L. R. de Sousa, Daltro J. Nunes
This paper presents a study on monitoring and control of
software development projects using quantitative
techniques. The study presents an evaluation over the
combined use of Earned Value Management (EVM) and
Earned Schedule (ES) techniques. The evaluation was
performed using simulated data, and later, with a data set
from real projects. The limitations and potential of the
techniques are also discussed. We believe that evaluation
results can contribute to advancing the researches of
quantitative management of software development
projects.
1.1.2. DevMeter: una Herramienta que mide la

Contribucin de los Desarrolladores (358)
Yury Nio, Jairo Aponte (Departamento de Ingeniera
de Sistemas e Industrial, Universidad Nacional de
Colombia - {yyninor, jhpontem}@unal.edu.co)
Como parte de los avances logrados en la construccin de
sistemas de software, se han desarrollado herramientas
que facilitan el seguimiento a las actividades realizadas
en los procesos de elaboracin. Los datos contenidos en
estas herramientas, que incluyen a los sistemas de control
de versiones y a los sistemas de seguimiento de defectos,
han sido usados por los investigadores para estudiar y
proponer soluciones a problemas asociados a la
determinacin de la contribucin de los desarrolladores
involucrados en un proyecto. Este documento presenta un
conjunto de mtricas para evaluar la contribucin de esos
desarrolladores en proyectos orientados a objetos,
describe el diseo e implementacin de una herramienta
de software que obtiene el resultado de esas mtricas y
expone los resultados de un caso de aplicacin.
1.1.3. Enfoque gil en el Modelo CMMI de

Adquisiciones (199)
Marcelo
Hernndez,
Marcello
Visconti
(Departamento de Informtica, Universidad Federico
Santa Mara, Valparaso, Chile - {mhernand,
visconti}@inf.utfsm.cl)
Las empresas necesitan de productos que estn alineados

con los objetivos organizacionales, para ello el proceso
de adquisicin debe proveer una adecuada comunicacin
entre adquiriente y proveedor, lo que debe traducirse en
el cumplimiento de los requerimientos establecidos.
Antecedentes indican la existencia de un problema en la
adquisicin de productos y servicios de Tecnologa de la
Informacin, los que fracasan antes de los dos aos y
cerca de la mitad antes de los cinco, las razones estn
relacionadas con la mala gestin, inadecuada
recopilacin de necesidades, definicin pobre de
requerimientos y falta de adecuada comunicacin entre
adquirientes y proveedores. Este trabajo presenta una
propuesta en la lnea de contribuir a solucionar lo
anterior, complementando el modelo CMMI ACQ con los
mtodos giles en el rea de proceso Desarrollo de
Requerimientos de Adquisicin. Los resultados indican
que los objetivos especficos del rea de proceso se ven
beneficiados con el complemento.
1.1.4. Exavar: Anlisis de Variabilidad de

Productos de Software (196)
Nicolas Bortolotti (INGAR-CIDISI, Universidad
Tecnolgica Nacional, CONICET - Avellaneda 3657,
Santa Fe, Argentina - nbortolotti@santafeconicet.gov.ar), Silvio Gonnet, Horacio Leone
Se observa una tendencia mundial en las organizaciones
productoras de software hacia el desarrollo y evolucin
de familias de productos en lugar de la creacin de un
producto de software para un cliente especfico. Sin
embargo, los productos de software existentes
generalmente carecen de una arquitectura documentada
que reflejen la arquitectura realmente implementada, esta
problemtica impide la realizacin de un anlisis
enfocado al reuso y variabilidad de los productos. Para
brindar soporte al proceso de anlisis de los artefactos
existentes y la definicin de puntos de variacin y sus
variantes, el presente trabajo propone emplear tcnicas de
reconstruccin arquitectnicas basadas en ingenieria
reversa de software y analizar las dependencias entre los
elementos de software, siguiendo una perspectiva topdown, desde la presentacin del producto.

SOFTWARE II (Lunes 18/10, 16:4018:20 hs)
1.1.5. Ingeniera de Software: Roca slida o
evanescencia? (41)
Manuel Imaz (BlendMind,
imaz@mac.com)
Madrid,
Espaa
Un reciente artculo del Communications del ACM se

pregunta si la Ingeniera de Software es realmente una
Ingeniera. Desde sus inicios, hace 40 aos, ste es un
interrogante que ha ido sucedindose a intervalos, pero lo
que sorprende es que en un lapso tan dilatado que
http://www.clei2010.org.py/

empieza a finales de los 60 no se haya afianzado de
manera evidente una disciplina que an hoy se cuestiona.
Es el momento, entonces, de plantear la cuestin de la
pertinencia de la denominacin de Ingeniera de Software
y, en ese caso, cules son las vinculaciones con otras
disciplinas tales como Computacin (Computing
Science) e Informtica. Ciertos avances en la
conceptualizacin de esta ltima puede ayudarnos a
perfilar mejor lo que entendemos por Ingeniera de
Software.
1.1.6. Requisitos de Comportamiento Social para

Sistemas Multi-Agente (58)
Lorena Rodriguez (Departamento de Sistemas de
Informacin y Computacin, Universidad Politcnica
de Valencia, Camino de Vera s/n 46022, Valencia,
Espaa - lrodriguez@dsic.upv.es), David Blanes,
Emilio Insfran, Luca Cernuzzi
En los ltimos aos se han propuesto diversas
metodologas para guiar el proceso de desarrollo de
Sistemas Multi-Agente (SMA). La mayora de estas
metodologas se centran en las fases de diseo e
implementacin y no proporcionan mecanismos
adecuados para la captura, definicin y especificacin de
requisitos. Adems, los SMA habitualmente requieren de
caractersticas especiales de comportamiento social (ej.,
pro-actividad, adaptabilidad, colaboracin, etc.) que
deberan ser tratadas desde las primeras fases del proceso
de desarrollo. El objetivo de este trabajo es discutir y
proponer una aproximacin preliminar para la definicin
y especificacin de estos requisitos de comportamiento
social para SMA. Esta aproximacin est siendo
desarrollada como parte de un mtodo genrico de
modelado de requisitos para SMA y permitir disponer
de un marco bien definido para tratar de forma explcita
con distintos tipos de requisitos de comportamiento
social desde las primeras fases del proceso de desarrollo.
1.1.7. Principios y criterios para evaluar y

comparar Sistemas de Gestin de Reglas de
Negocio (BRMS) (63)
Mara Jess Fandes Gmez, Bernhard Hitpass,
Hernn Astudillo (Departamento de Informtica,
Universidad Tcnica Federico Santa Mara,
Santiago,
Chile
{mariajesus.faundes,
bernhard.hitpass, hernan.astudillo} @usm.cl)
Los Sistemas de Gestin de Reglas de Negocio (BRMS)
se han convertido en tecnologa clave, al permitir realizar
una gestin explcita de las Reglas de Negocio de manera
independiente de las aplicaciones que las utilizan.
Desafortunadamente, es difcil evaluar y comparar las
casi 30 plataformas BRMS mainstream en existencia ya
que sus proveedores slo entregan informacin
comercial. Este artculo presenta un esquema para
diferenciar, evaluar y comparar BRMS, basado en cuatro
principios propuestos por von Halle en el Business Rules
Approach. Para ellos se proponen siete criterios de

adecuacin a dichos principios. La factibilidad y
usabilidad del enfoque fueron validados en un estudio de
caso con ILOG JRules y Blaze Advisor que permiti
identificar y comparar sucintamente cmo ellos abordan
y soportan las Reglas de Negocio. Una evaluacin final
permite sugerir que el enfoque propuesto es tambin
aplicable a otros BRMS.
1.1.8 Anlise dos Critrios de Segurana do

COBIT baseado no Modelo SSE-CMM (152)
Rosana Wagner, Lisandra Manzoni Fontoura, Josiane
Kroll (Programa de Ps-Graduao em Informtica
(PPGI) - Universidade Federal de Santa Maria
(UFSM) - {rosanawagner, lisandramf, josi.unc}
@gmail.com)
Este artigo descreve uma avaliao do Control Objetives
for Information and related Technology (COBIT),
baseada nas prticas base do System Security
Engineering Capability Maturity Model (SSE-CMM).
Para cada prtica base (PB) identificada em cada rea de
processo (PA) das prticas base de segurana (PA01 a
PA11), o COBIT foi avaliado para determinar se ele
satisfaz a BP ou no. Para cada PA, o percentual de PB
suportado foi calculado, e os resultados foram tabulados.
O artigo inclui uma breve descrio de como cada PA foi
contemplada, destacando pontos fortes do COBIT em
relao a seu suporte ao SSE-CMM.
Sala 2
REA TEMTICA: SISTEMAS
DISTRIBUIDOS, CONCURRENTES Y
UBICUOS (Lunes 18/10, 14:40-16:20 hs)
1.2.1. An Eco-Inspired Approach for Pervasive
Service Ecosystems (255)
Cynthia Villalba, Franco Zambonelli (Dipartimento
di Scienze e Metodi dell'Ingegneria, Universit di
Modena e Reggio Emilia, Via Allegri 13, 42100
Reggio
Emilia,
Italy
{cynthia.villalba,
franco.zambonelli} @unimore.it)
This paper presents an innovative, flexible and open
architecture inspired in ecological systems. This
architecture attempts to face the increasing need of
infrastructures that could give the appropriate support to
the emergent properties of self-organization, selfadaptability and long-lasting evolvability, in pervasive
computing scenarios. In this context, our eco-inspired
approach models and deploys pervasive services as
autonomous individuals (i.e agents), spatially-situated in
an ecosystem of other services, data sources, and
pervasive devices. All these individuals locally act,
interact and evolve around a set of ecological niches and
according to a limited set of laws of nature. In particular,

we detail the main concepts and features of our approach,
we describe and model its components, and then, we
propose a feasible way implement the ecological niches.
1.2.2. Um Mecanismo para Sensibilidade ao

Contexto com Suporte Semntico na
Computao Ubqua (237)
Luthiano Venecian (Universidade Catlica de Pelotas
- venecian@ucpel.tche.br), Joo Ladislau Lopes, Iara
Augustin, Adenauer Yamin, Claudio Geyer
A diversidade de dispositivos e informaes em um
Ambiente Ubquo, introduz diferentes desafos para
interoperabilidade entre as partes envolvidas. Ao se
construir e executar aplicaes ubquas sensveis ao
contexto, surgem demandas que devem ser providas,
envolvendo desde a aquisio de informaes
contextuais, representao, e seu processamento. Na
perspectiva de atender estas demandas da computao
ubqua, foi concebido o EXEHDA-SS, para ser
responvel pelo tratamento das informaes contextuais,
realizando tarefas de manipulao e deduo sobre o
contexto, utilizando ontologias para a representao e
processamento semntico das informaes contextuais.
1.2.3. Um Modelo de Matching Semntico

Direcionado Descoberta de Recursos na
UBICOMP (238)
Renato Dilli, Adenauer Yamin, Luiz Palazzo
(PPGINF, Universidade Catlica de Pelotas dilli@ucpel.tche.br)
Este artigo prope um modelo para descoberta de
recursos direcionado computao ubqua com
tecnologias de processamento semntico agregadas sua
arquitetura. O EXEHDA-SD contribui com aumento da
expressividade na representao e consulta por recursos
no ambiente ubquo. O mecanismo considera a
dinamicidade em que os recursos entram e saem do
ambiente e persegue aspectos como escalabilidade e
preferncias do usurio. O processador semntico e os
demais componentes da arquitetura do mecanismo so
descritos enquanto contribuies centrais do trabalho.
1.2.4. Servios Baseados em Localizao e

Publish-Subscribe para Pecuria de Preciso
(359)
Mrcio Aparecido Inacio da Silva, Marcelo Augusto

Santos Turine, Hana Karina Salles Rubinsztejn
(Faculdade de Computao, Universidade Federal de
Mato Grosso do Sul, Mato Grosso do Sul, Brasil {mapsiva, mturine, hanaksr}@gmail.com)
A abordagem de sistemas sensveis ao contexto com
integrao de Servios Baseados em Localizao e
Publish-Subscribe vem surgindo como uma oportunidade
para atender as necessidades de acesso a ambientes
computacionais, em qualquer lugar e a qualquer
momento, de forma relevante ao usurio. No entanto, a
construo desses sistemas enfrenta dificuldades pela

falta de suporte da Engenharia de Software. O objetivo
deste trabalho apresentar a arquitetura do componente
Orion no contexto de integrao com a plataforma eSAPI bovis, auxiliando o processo de rastreabilidade
bovina no Brasil.
REA TEMTICA: SEGURIDAD Y

CRIPTOGRAFA (Lunes 18/10, 16:40-18:20 hs)
1.2.5. Uma arquitetura P2P Baseada em Chaves
Pblicas para Identificao, Autenticidade de
Contedos e Reputao (68)
Neander Brisola (Pontificia Universidade Catlica
do Paran / Programa de Ps-Graduao em
Informtica - neander@ppgia.pucpr.br), Altair
Santin, Lau Lung, Heverson Ribeiro
No uso clssico de P2P, e.g. file sharing, no existe
qualquer preocupao com identificao persistente de
peers, reputao de contedos e peers, e autenticidade de
contedos. As propostas da literatura procuram adaptar
tcnicas da arquitetura cliente-servidor a P2P. Este
trabalho prope o uso de chaves pblicas na identificao
permanente de peers, mas preservando o anonimato. No
trabalho tambm se aplica assinatura digital para prover
autenticidade a contedos P2P e para garantir o norepdio na transferncia de contedo. Para prover
credibilidade para contedos no-certificado e chaves
pblicas, um mecanismo de reputao aplicado. Um
prottipo foi desenvolvido para apresentar os benefcios
da proposta.
1.2.6. Um Servio de Gerenciamento Seguro de

Contedos P2P compartilhados em MANets (74)
Marcelo Vithoft, Altair Santin, Carlos Maziero,
Heverson Borba (Programa de Ps-Graduao em
Informtica - Pontifcia Universidade Catlica do
Paran - Curitiba, PR, Brasil - {vithoft, santin,
maziero, heverson}@ppgia.pucpr.br)
Uma rede Ad hoc mvel (MANet) a interconexo
flexvel de dispositivos mveis. A Rede Peer-to-peer
(P2P) uma infraestrutura auto-organizada e que no
necessita de servidor para estabelecer conexes fim-afim. As constantes desconexes e reconexes das redes
P2P e a instabilidade das interconexes de MANet
oferecem importantes desafios P2P sobre MANet
(PoM). Um peer consumidor em PoM desperdia seus
escassos recursos gerenciando a comunicao com o peer
provedor do contedo. Nossa proposta visa reduzir o
controle do peer consumidor sobre a comunicao para
evitar o consumo desnecessrio de recursos. Um
provedor virtual de contedo (VCP) usado para esse
fim e um prottipo foi implementado para mostrar a
viabilidade da proposta.

1.2.7. Autenticao, Distribuio de Chaves e
Armazenamento Seguro em Redes de Sensores
Sem Fio (83)
Juliano F. Kazienko, Clio V. N. Albuquerque
(Instituto de Computao Universidade Federal
Fluminense (UFF), Rua Passo da Ptria, 156,
Niteri, RJ, Brasil - {kazienko, celio}@ic.uff.br)
The security in Wireless Sensor Networks (WSNs) is
commonly bootstrapped by cryptographic key
distribution among nodes. In this scenario, one of the
greatest research challenges is to ensure secure keys
storage by sensors due to their constrained resources and
major exposure to tampering attempts. The main
contribution of this work is to propose and analyze a
mechanism for secure symmetric key distribution solving
the stored key exposure problem. Additionally, an
authentication protocol and a tampering attempt alarm for
sensors are designed. Hence, this approach aims to
increase the systems security against the tampering and
compromising of sensor nodes.
1.2.8. Off-line Signature Verification: A Circular

Grid-Based Feature Extraction Approach (181)
Marianela Parodi (Laboratory for System Dynamics
and Signal Processing, FCEIA, Universidad Nacional
de Rosario, CIFASIS, CONICET - Riobamba 245 Bis,
2000 Rosario, Argentina - parodi@cifasisconicet.gov.ar), Juan C. Gmez
A new technique for feature extraction based on a
circular grid is proposed in this paper for off-line
signature verification. Graphometric features for this new
grid geometry are defined by adapting similar features
available for rectangular grids. A Support Vector Machine
(SVM) based classifier scheme is used for classification
tasks and a comparison between the rectangular and the
circular grid approaches for feature extraction is
performed. Experimental results show improvements in
the verification performance with respect to the case of
using rectangular grid based features, especially in the
discrimination of simple and skilled forgeries.
Sala 3
REA TEMTICA: INTELIGENCIA
ARTIFICIAL Y SISTEMAS
INTELIGENTES I (Lunes 18/10, 14:40-16:20)
1.3.1. Uma Abordagem para a Identificao de
Causas de Problemas utilizando Grounded
Theory (94)
Natlia Chaves Lessa Schots (COPPE/UFRJ
Universidade Federal do Rio de Janeiro, Caixa
Postal 68511 CEP 21945-970 Rio de Janeiro,
Brasil - natalia@cos.ufrj.br), Ana Regina Rocha,

Gleison Santos
During software development it is common to observe
occurrence of defects and problems. Causal Analysis
aims to identify and correct the root cause of those
defects and problems in order to prevent their repetition.
It is important that the activity related to the root cause
identification is executed correctly so the Causal Analysis
may be considered effective. This paper presents an
approach to the identification of root causes based on
methods to maximize the quality of collected information
and to minimize the subjectivity during the collection and
the analysis of these data. To achieve these goals, we
used Grounded Theory concepts and defined a process to
support the approach.
1.3.2. Sistemas Clasificadores en el Problema de

Reconocimiento de Patrones (147)
Jose Aguilar (CEMISID, Departamento de
Computacin, EISULA, Universidad de Los Andes aguilar@ula.ve)
El objetivo de este trabajo es proponer un Mecanismo de
Aprendizaje de Patrones (MAP) en los Sistemas
Clasificadores (SCs) que les permite realizar los autoajustes necesarios en los patrones en el proceso de
reconocimiento. En este trabajo son considerados tanto
los SC tradicionales, como su extensin, los Sistemas
Clasificadores Difusos (SCDs). Para implementar dicho
mecanismo utilizamos dos paradigmas de la
Computacin Evolutiva (CE): los Programas Evolutivos
(PES) y la Programacin Gentica (PG). Nuestra
propuesta fue probada en un sistema de supervisin de un
tanque y para la clasificacin de Lirios.
1.3.3. Razonamiento Multimodal en Sistemas

Expertos de Diagnstico Mdico (197)
Mariana Maceiras, Ernesto Ocampo Edye
(Departamento de Informtica y Ciencias de la
Computacin, Universidad Catlica del Uruguay,
Montevideo, Uruguay - {mmaceira, eocampo}
@ucu.edu.uy)
El diagnstico mdico es un proceso de alta complejidad,
caracterizado por una gran incertidumbre. Mltiples
alternativas de sistemas expertos dedicados al
diagnstico mdico han surgido como un apoyo a este
proceso. Este documento presenta un enfoque para el
diseo y construccin de Sistemas Expertos de
Diagnstico Mdico (SEDM). La principal premisa que
gua el enfoque presentado es modelar el proceso interno
que lleva adelante el experto mdico de la forma ms
precisa posible. Se plantea que la mejor forma de
desarrollar un sistema siguiendo este enfoque es
mediante la integracin y combinacin de metodologas
y/o tcnicas inteligentes. El razonamiento multimodal es
clave para el desarrollo de sistemas en base al enfoque
propuesto. Se presenta un SEDM de Meningitis Aguda

Supurada que ilustra una aplicacin del enfoque
planteado.
results obtained by
classification method.
1.3.4. Sistemas de Recomendacin Multicriterio

utilizando Ordenamiento de Criterios (293)
1.3.6. Evolucin de Reglas de Clasificacin

Binaria utilizando Programacin Gentica
Lineal: Una Aplicacin al Descarte de Ganado
Guido Acosta Galeano, Walter Amarilla Duarte,

Christian von Lcken (Universidad Nacional de
Asuncin, Facultad Politcnica, San Lorenzo,
Paraguay
{gdanielacosta,
w.amarilla,
vonlucken}@pol.una.py)
Este trabajo presenta un nuevo modelo de Sistema de
Recomendacin Multicriterio que, adems de considerar
los puntajes asignados por los usuarios a diferentes
caractersticas de un artculo, utiliza el puntaje asignado
para establecer un ordenamiento de criterios a fin de
introducir informacin adicional para identificar con
mayor precisin usuarios similares. Con el fin de analizar
el comportamiento de la propuesta se realiz una
comparacin experimental entre el Sistema de
Recomendacin presentado, un sistema que utiliza un
nico puntaje global y un sistema que slo considera la
puntuacin de mltiples criterios para un problema de
recomendacin de pelculas. Las pruebas han demostrado
que, para el caso analizado, la propuesta presentada
produce recomendaciones ms precisas.
REA TEMTICA: INTELIGENCIA

ARTIFICIAL Y SISTEMAS
INTELIGENTES II (Lunes 18/10, 16:40-18:20 hs)
1.3.5. Mtodos multirrtulo independentes de
algoritmo: um estudo de caso (370)
Everton Alvares Cherman, Maria Carolina Monard,
Jean Metz (Universidade de So Paulo - Instituto de
Cincias Matemticas e de Computao, ICMC
Laboratrio de Inteligncia Computacional LABIC,
Caixa Postal 668, 13560-970, So Carlos, SP, Brasil
- {fecherman, mcmonard, metzzg}@icmc.usp.br)
Traditional classification algorithms consider learning
problems that contain only one label, i.e. each example is
associated with one single nominal target variable
characterizing its property. However, an increasing
number of practical applications involve data with
multiple target variables, called multi-label data. To learn
from this sort of data multi-label classification algorithms
should be used. The task of learning from multi-label
data can be addressed by methods that transform the
multi-label classification problem into several singlelabel classification problems. In this work two well
known methods based on this approach are used as well
as a third method we propose to overcome some
deficiencies of one of them, on a case study using textual
data related to medical findings, which were structured
using the bag-of-words approach. The experimental study
using these three methods, shows an improvement on the
our
proposed
multi-label
(226)
Martn Abente, Javier Martnez, Benjamn Barn

(Universidad Catlica Nuestra Seora de la
Asuncin,
Asuncin,
Paraguay
{martin.abente.lahaye, martinez.javier}@gmail.com bbaran@pol.una.py)
Este trabajo describe una propuesta basada en
Programacin Gentica Lineal para resolver problemas
Clasificacin Binaria. Los modelos predictivos pueden
ser construidos a partir de reglas de clasificacin. Estas
reglas de clasificacin son codificadas como individuos
de la Programacin Gentica Lineal. La generacin de
estos individuos es asistida por mecanismos basados en
el uso de Gramticas. Estos mecanismos permiten la
generacin exclusiva de reglas de clasificacin
semnticamente coherentes, acotando el espacio de
bsqueda y haciendo un uso ms eficiente de los recursos
computacionales. Resultados experimentales demuestran
que los modelos predictivos obtenidos mediante la
Programacin Gentica Lineal asistida por Gramticas,
son mejores que aquellos modelos obtenidos mediante
otras tcnicas modernas comnmente utilizadas, para el
problema de descarte de ganado.
1.3.7. Modelagem de Bacias Hidrogrficas com

Redes Neurais Artifciais e Algoritmos Genticos
(295)
Felippe Alex Scheidt (Departamento de Computao,

Universidade Estadual de Londrina, PR, Brasil felippescheidt@gmail.com), Maria Angelica de
Oliveira Camargo Brunetto, Glaucio Roloff
Este trabalho apresenta uma metodologia para
modelagem de bacias hidrogrficas utilizando redes
neurais artificiais (RNA) acopladas a um algoritmo
gentico (AG) para a modelagem do processo de
transformao
chuva-vazo
num
intervalo
de
discretizao dirio. Esta modelagem foi aplicada em
uma bacia hidrogrfica do rio Piquiri localizada no
estado do Paran, Brasil. Os resultados dessa modelagem
foram comparados a um modelo autorregressivo de
mdia mvel e demonstraram que as RNAs so mais
adequadas para a modelagem da relao chuva-vazo do
que os modelos autorregressivos.
1.3.8. Impacto de Recursos Lxicos Manuales y

Automticos en la WSD (386)
Javier Tejada Crcamo (School of Computer Science,
San Pablo Catholic University, Arequipa, Per jawitejada@hotmail.com), Hiram Calvo, Alexander
Gelbukh, Jos Villegas

En Tejada [Tejada, J., Gelbukh A., Calvo, H. "An
Innovative Two-Stage WSD Unsupervised Method".
SEPLN Journal 40, March 2008], se propuso un mtodo
no supervisado para la resolucin de la ambigedad de
sentidos de palabras, el cual super los resultados
obtenidos por el mejor mtodo no supervisado existente
propuesto por Mc.Carthy [McCarthy, D. and R. Navigli "
The English Lexical Substitution Task", Springer, 2009].
En Tejada se utiliza el contexto del vocablo ambiguo para
seleccionar un conjunto de trminos que se usan en
contextos similares. Cada miembro emite un voto por un
sentido del vocablo ambiguo, de tal manera que el
sentido con mayor nmero de votos es el elegido. Los
miembros de este conjunto se obtienen de un Modelo de
Espacio de Palabras construido por un mtodo no
supervisado. El trabajo que se presenta, experimenta con
diferentes conjuntos de vocablos relacionados
semnticamente obtenidos de recursos creados manual y
automticamente, con el propsito de determinar la
calidad semntica que proveen los recursos manuales y
los creados por una computadora.
Martes 19 de octubre
Sala 1
SOFTWARE III (Martes 19/10, 14:40-16:20hs)
2.1.1. Priorizao de Classes para Testes
Unitrios Utilizando o Analytical Hierarchy
Process (259)
Rafael
Baldiati
Parizi
(Campus
Alegrete,
Universidade Federal do Pampa, Unipampa parizi.computacao @gmail.com), Vanessa Gindri
Viera, Eduardo Kessler Piveta
This article describes how to perform a prioritization of
classes to unit tests in order to optimize the stage of
software testing. Through analysis of the criteria
evaluated by the AHP, can be expressed as the relative
importance of one criterion over another, within the set of
defined criteria, and generated a ranking of classes of
software testing efforts are focused on more important
classes of software that is in the process of development.
2.1.2. Generacin Automtica de Casos de

Prueba Unitaria Orientados a Objetos a Partir
de Diagramas de Clase UML, Restricciones y
Secuencias de Llamada a Mtodos (240)
Jorge Augusto Bendahan Gertopan (Universidad
Autnoma de Asuncin, Asuncin Paraguay jorge.bendahan@gmail.com), Luis Gilberto Salinas
Caete
The presented proposal intends to facilitate the task of

unit testing to the software developer or quality assurance
specialist through automated test case generation. This
proposal uses UML class diagrams stored in the XMI
format, method call sequences, and constraints in the
form of pre and post conditions as the input information.
In order to generate the test cases, we use equivalent
partitioning and limit value analysis techniques. A
functional prototype has been implemented based on the
presented proposal. We observe that with this proposal it
is possible to obtain a set of test cases that can achieve
sentence coverage close to 70%. We present examples of
supplied specifications and obtained test cases.
2.1.3. Diretrizes para Avaliao e

Aperfeioamento de Perfis UML para Sistemas
Orientados a Aspectos (150)
Thiago Gottardi (Departamento de Computao da
Universidade Federal de So Carlos - UFSCar,
Rodovia Washington Lus, Km 245, CEP 13.565-905,
So
Carlos,
So
Paulo,
Brasil
thiago_gottardi@dc.ufscar.br), Ricardo Argenton
Ramos, Rosngela A.D. Penteado, Oscar Lopez
Pastor, Valter Vieira de Camargo
Vrias propostas de perfis para a modelagem de sistemas
orientados a aspectos foram propostas na literatura,
entretanto muitas dessas propostas ainda possuem
deficincias quanto a sua aderncia aos conceitos bsicos
desse paradigma. Neste artigo, o perfil UML proposto
por Evermann analisado, alguns problemas so
mencionados e possveis sugestes de melhorias so
feitas. O objetivo fornecer um embasamento terico
para que outros pesquisadores possam tambm conduzir
anlises em outras abordagens de modelagem/perfis.
Como resultados principais do estudo conduzido podemse citar a obteno de um perfil UML mais aderente aos
conceitos do paradigma orientado a aspectos e uma
iniciativa para a elaborao de um conjunto de diretrizes
para avaliao de tais perfis.
2.1.4. Modeling Aspect-oriented Software

Systems Using UML: A Systematic Mapping (366)
Milena Guessi (Dept. of Computer Systems,
University of So Paulo - USP, PO Box 668, 13560970,
So
Carlos,
SP,
Brazil
milena@grad.icmc.usp.br), Lucas Bueno Ruas de
Oliveira, Elisa Yumi Nakagawa
Aspect-Oriented Programming (AOP) has arisen,
intending to contribute to the development of reusable,
maintainable, and evolvable software systems. Aspects
have been also explored in the early life cycle phases,
aiming at contributing to more adequate development of
aspectoriented software systems. In this perspective, a
diversity of extensions of the UML has been proposed to
represent these systems, considering its relevance and
dissemination as language to model software systems.

However, there is a lack of a complete panorama that
identify all these extensions. Thus, this paper intends to
present an overview about which are possibly all
extensions of the UML to represent aspect-oriented
software systems. For this, we have used systematic
mapping, a technique proposed by Evidence-Based
Software Engineering (EBSE). Achieved results show a
diversity of work; however, there is not a consensus
about which are the more adequate or more used
extensions. Based on this overview, interesting and
important perspectives for future research can also be
found.
distributed in its two components: OWL and Datalog

subsystems. However, a portion of the hybrid ontology
knowledge base may be represented in both. We denote
this portion as Knowledge Base Intersection (KBI). We
studied different KBI representations in the two
subsystems, and their relationship to query performance.
A query benchmark was defined to support landslide
hazard areas detection. Combinations of three factors
were studied: KBI representation, query-answering
strategy (pre-compilation or dynamic) and dataset size.
The results show that KBI representation a
ects query execution time, specially when knowledge
base size increases.
REA TEMTICA: ONTOLOGAS
2.1.7. Using Topic Ontologies and Semantic

Similarity Data to Evaluate Topical Search (286)
(Martes
19/10, 16:40-18:20 hs)
2.1.5. An Agent-based Ontology Evolution

Strategy for Ontology-driven Knowledge
Management Systems (170)
Carlos M. Toledo (Institute of Development and
Design, National Council of Scientific and
Technological Research, Avellaneda 3657, Santa Fe,
Argentina
fcmtoledo@santafe-conicet.gov.ar),
Mariel A. Ale, Omar Chiotti, Mara Rosa Galli
Domain ontologies are used in Ontology-driven
Knowledge Management Approaches with the aim of
capturing knowledge, providing a compromised
understanding of a domain, and allowing integration
between different formats of information sources.
Because the domain knowledge changes and grows over
time, enabling such evolution by means of the extension
of the domain ontology, it is necessary to maintain the
whole semantics of organizational documents. In this
paper, we propose an Agent-based Strategy to extend the
domain ontology by adding new concepts during the
annotated process of a document. Moreover, with the
objective of trying out the proposed strategy, we
developed a flexible framework to experiment with
Ontology-driven Knowledge Management Approaches
and Agent-based Ontology Evolution Strategies. Using
the developed framework, the proposed strategy and a
document
semantic
annotation
algorithm
are
implemented, tested and experimental results are
evaluated.
2.1.6. Integrating OWL Ontologies and Rules: A

Case Study on Landslide Detection (155)
Rosa Aguilar (Fundacin Instituto de Ingeniera,
Caracas, Venezuela - rosaa@fii.org), Edna Ruckhaus
This work is focused on a subset of the geospatial
domain that concerns landslide detection, which was
represented as a hybrid OWL-log ontology. OWL-log is
an implementation of the AL-log hybrid knowledge
representation system where the Description Logics
component is extended to the Web Ontology Language
OWL DL. Knowledge in hybrid OWL-log ontologies is
Ana G. Maguitman (Depto de Ciencias e Ingeniera

de la Computacin - Universidad Nacional del Sur,
Baha Blanca, Argentina - agm@cs.uns.edu.ar),
Roco L. Cecchini, Carlos M. Lorenzetti, Filippo
Menczer
Improvement in information retrieval systems is largely
dependent on the ability to evaluate them. In order to
assess the effectiveness of a retrieval system, test
collections are needed. In traditional approaches users or
hired evaluators provide manual assessments of
relevance. However this does not scale with the
complexity and heterogeneity of available digital
information. This paper proposes to use topic ontologies
and semantic similarity data to alleviate the efforts
needed by human assessors to evaluate the rapidly
expanding set of competing information retrieval
methods. After providing experimental evidence
supporting the validity of our approach we illustrate its
application with an example in which the proposed
evaluation procedure is used to assess the effectiveness of
topical retrieval systems.
2.1.8. OntoGhobi: Meta Buscador Semntico que

Incorpora una Ontologa de Dominio General
(WordNet) y Perfil de Usuario (142)
Hugo Ordoez (Universidad Mariana Sector
Maridiaz, Edificio Mara Inmaculada, Oficina 301hordonez@umariana.edu.co), Carlos Cobos
La recuperacin de informacin en internet se ha
convertido en una de las reas de investigacin ms
importantes del mundo, debido entre otras cosas: al
crecimiento acelerado de las fuentes de informacin, a la
necesidad de contar con informacin ms relevante a los
requerimientos de cada usuario, a la exploracin de
menores tiempos de bsqueda y a la escasez de usar la
semntica de los trminos implicados en las consultas. En
este artculo se presenta las descripcin de un meta
buscador (usa los recursos indexados por Google, Yahoo!
y Bing) web semntico llamado OntoGhobi, que
incorpora una ontologa de dominio general (WordNet) y

el manejo del perfil de usuario para mejorar la relevancia
de los documentos recuperados. Se describe a nivel
general los componentes del meta buscador, algunas
interfaces de usuario y los resultados de una evaluacin.
La evaluacin contempla la precisin del sistema y
resultados de pruebas con usuarios.
Sala 2
REA TEMTICA: REDES Y
COMUNICACIN DE DATOS I (Martes 19/10,
14:40-16:20 hs)
2.2.1. Aprovisionamento de QoE e Handover

Transparente em Redes Heterogneas baseados
em um Sistema de Lgica Nebulosa
Evolucionria (70)
Diego dos Passos Silva, Jos Jalton Ferreira Jnior,
Madson Bruno Silva Coelho, Kelvin Lopes Dias
(Universidade Federal do Par, Caixa Postal 479
66.075-110 Belm Par Brasil - {dps, jjj, mbsc,
kld}@ufpa.br)
This article proposes architecture for the next generation
networks to provide QoE and seamless handover for
video applications. The proposal considers frameworks
used for traffic engineering (MPLS/RSVP-TE) and
mobility management at the network layer (MIPv6), as
well as, it adopts the new standard IEEE 802.21 (MIH Media Independent Handover) to assist the
heterogeneous networks integration. In addition, it uses a
vertical handover decision policy based on fuzzy system
and its optimization by a genetic algorithm for scenarios
that integrate the WiMAX and Wi-Fi access technologies.
The proposal is evaluated via simulation using the ns-2
(Network Simulator) and the performance results are
shown through the QoS (throughput) and QoE (PSNR,
SSIM and MSU VQM) metrics that demonstrated the
effectiveness of the architecture to support seamless
handover.
2.2.2. Clustering Dinmico para Tiempo de

Encendido Mnimo en Redes Inalmbricas de
Sensores (CLUDITEM). Anlisis de las fases de
envo de datos (127)
Rosa Corti (rcorti@fceia.unr.edu.ar), Estela D'Agostino,
Enrique Esteban Giandomenico, Roberto Martinez,
Javier Belmonte
Las redes inalmbricas de sensores son una herramienta
muy promisoria para supervisin ambiental. En los
ltimos aos se han desarrollado numerosos algoritmos
de encaminamiento especficos para estas redes. En este
trabajo se analizan las fases de envo de datos de
CLUDITEM, un algoritmo de encaminamiento
jerrquico basado en clusters, para medicin peridica de
variables del ambiente. El objetivo del trabajo fue definir
parmetros ligados a la transmisin de mediciones hacia
la estacin base, evaluando el impacto de distintos

esquemas TDMA sobre la prdida de mensajes. Para
lograrlo se integr CLUDITEM en un protocolo de
comunicaciones con las capas inferiores del estndar
802.15.4, y se simul su funcionamiento aplicando los
diferentes esquemas estudiados, eligiendo los que
arrojaron mejores resultados considerando los
requerimientos de las aplicaciones de inters.
2.2.3. AJR-TFRC: Um Mecanismo para Controle

de Congestionamento para Redes Ad-hoc de
Mltiplos Saltos (351)
Thiago Antnio Sidnio Coqueiro, Kelvin Lopes Dias
(Universidade Federal do Par (UFPA), Caixa Postal
479, Belm, Par, Brasil - {tchagu, kld}@ufpa.br)
The TFRC uses a congestion control mechanism based
on rate, in order to better adjust its rate of sending
packets depending on the level of congestion on the
network. However, it does not have the capacity to
differentiate packet losses caused by congestion from
packet loss caused by error wireless channels in multihop ad-hoc networks. This article proposes a scheme
called AJR-TFRC (Adaptive Jitter Ratio Based TFRC),
which provides to differentiate these losses with adaptive
thresholds, configured via adaptive exponential
smoothing called Trigg & Leach and also using the jitter
ratio to predict dropped packets on the network. The
proposal was simulated in NS-2 and obtained significant
results of the effectiveness of the proposal, through the
metric of average goodput and quality of experience
(QoE) for video applications.
2.2.4. Desenvolvimento de equipamento remoto

de entrada e sada com suporte ao protocolo
HART encapsulado sobre PROFIBUS para
gerenciamento de ativos em plantas
industriais (166)
Joo C. Netto (Instituto de Informtica
Universidade Federal do Rio Grande do Sul, Caixa
Postal 15.064 91.501-970 Porto Alegre, RS,
Brasil - netto@inf.ufrgs.br), Srgio L. Cechin, Taisy
S. Weber, Rafael Lima
There is currently a great demand for improvements in
the plant asset management process in order to optimize
industrial plant resources while minimizing maintenance
and energy consumption costs. The large availability of
digital fieldbuses and smart devices has enabled efficient
online management of these resources. PROFIBUS and
HART are two widely used but incompatible fieldbuses.
This paper presents the development of a
hardware/software solution that allows interoperation
between these heterogeneous fieldbuses. Our solution is
based
on
Hart-over-Profibus
protocol.
The
implementation, which includes both hardware and
software components, is discussed. Our solution was
designed specially to be integrated in asset management

environments using FDT/DTM framework. The resulting
product is now in the production line of a Brazilian
company.
REA TEMTICA: REDES Y

COMUNICACIN DE DATOS II (Martes
19/10, 16:40-18:20 hs)
2.2.5. Reconfiguracin de Trfico Dinmico en

Redes pticas WDM: Un enfoque basado en
Algoritmos de Colonia de Hormigas (335)
Enrique Dvalos, Benjamn Barn, Diego Pinto
(Universidad Nacional de Asuncin, Paraguay {edavalos, bbaran, dpinto}@pol.una.py)
La necesidad de minimizar la utilizacin de los recursos
asignados dinmicamente en las redes pticas con
multiplexado por divisin de longitud de onda
(Wavelength Division Multiplexing, WDM) es un
problema crtico en Redes pticas, e implica la
reconfiguracin del trfico existente. Sin embargo, una
alta reconfiguracin resulta en una pobre calidad de
servicio al generarse disrupciones en el trfico actual.
Estas disrupciones ocasionan prdidas de datos que en
ciertos escenarios no son aceptables. Este trabajo
propone un esquema de Optimizacin basado en
Algoritmos de Colonia de Hormigas Multi-objetivo
(Multi-objective Ant Colony Optimization, MOACO),
para tratar el problema de reconfiguracin del trfico
dinmico. Estos algoritmos minimizan simultneamente
la cantidad de enlaces utilizados y el nmero de
disrupciones, para un conjunto de caminos pticos
existentes y un conjunto de nuevas demandas. Los
resultados experimentales muestran la viabilidad del
enfoque propuesto al ser comparados con una
implementacin basada en programacin lineal entera.
2.2.6. Asignacin ptima de Lightpath bajo

requerimientos de QoS en sistemas distribuidos
heterogneos (345)
Endrigo Rivas, Norihiko Isawa, Carlos Nez
(Investigacin Informtica, Universidad Nacional de
Itapa,
Campus
Universitario
Encarnacin,
Paraguay - endrigo.rivas@gmail.com, {norihiko,
cnunez}@uni.edu.py)
Los Algoritmos Genticos (Genetic Algorithms - GA)
son una rama de la Inteligencia Artificial que simula el
proceso de evolucin natural, utilizando mtodos de
optimizacin con variables aleatorias. En la vida real,
suelen existir problemas de gran complejidad que
necesitan satisfacer de manera simultnea mltiples
objetivos, los cuales pueden ser contradictorios. Con sta
problemtica en mente se estudia un caso concreto
utilizando como punto de partida la investigacin
realizada en [NUEZ C. , BARAN B. y PINTO D.
Asignacin ptima de Lightpath bajo requerimientos de
QoS: Un enfoque Multiobjetivos basado en MOEAs

2007.], donde se propone una solucin basada en
Algoritmos Evolutivos MultiObjetivos (MultiObjective
Evolutionary Algorihtms MOEAs), especficamente el
SPEA, para la Asignacin ptima de Lightpaths con
requerimientos de QoS en redes WDM con capacidad de
recuperacin. ste trabajo logra mejorar la calidad de los
resultados y los tiempos de procesamiento distribuyendo
el cmputo sobre una red heterognea y dedicada.
Resultados experimentales demuestran los logros
obtenidos.
2.2.7. Impacto dos Trfegos Multimdias em um

N de Rede Usando o Escalonador DRR (389)
Tatiana Pazeto (tpazeto@gmail.com), Renato Silva,
Shusaburo Motoyama
Como o nmero de aplicaes multimdias est surgindo
vertiginosamente na Internet, importante analisar um
escalonador de trfego que permita a equidade entre os
diversos trfegos. Neste sentido, embora o escalonador
FIFO seja o mais difundido e estar presente na maioria
dos equipamentos de interconexo, ele atende os pacotes
por ordem de chegada, no possibilitando definir outro
critrio para o atendimento dos pacotes. Assim, uma
alternativa analisar o comportamento dos trfegos
usando o escalonador Deficit Round Robin (DRR), pois o
mesmo permite a distribuio de quotas para os
diferentes trfegos, possibilitando atender aos requisitos
de Qualidade de Servio (QoS) das aplicaes. Desta
forma, o trabalho proposto visa analisar como os trfegos
multimdias podem impactar a rede atual, que transporta
basicamente o trfego de dados, comparando com outros
cinco cenrios, os quais apresentam um crescimento nos
trfegos de voz e vdeo, usando o escalonador DRR. Para
isso, uma plataforma de simulao foi desenvolvida em
C++, a qual contempla o escalonador DRR, um buffer e
diferentes tipos de fontes de trfego. Os cenrios
simulados permitiram verificar o comportamento do n
da rede em relao ao tempo de atraso de sistema que
um parmetro importante na definio da qualidade de
servio para os usurios. Atravs dos resultados obtidos,
pode-se perceber que usando o escalonador DRR, h
possibilidade de um nmero maior de usurios no
sistema, quando comparado com o escalonador FIFO,
sem que a QoS seja degradada.
2.2.8. Uma Arquitetura com Suporte a Mdulos

Dinmicos para WebLab no Domnio de Redes
de Computadores (163)
Daniel Vieira de Souza, Paulo Eduardo Nogueira,
Paulo Rodolfo da Silva Leite Coelho, Lus Fernando
Faina (Faculdade de Computao Universidade
Federal de Uberlndia (UFU) - Caixa Postal 593
38400-902 Uberlndia MG)
This work presents an architecture that supports dynamic
modules of remote access laboratories (WebLab) in the

field of computer networks. The architecture follows the
paradigm of Service Oriented Computing (SOC). The
experiments are available as modules, following the
Open Services Gateway initiative (OSGi) specifications.
The services of each experiment module are published as
Web services following the Representational State
Transfer (REST) principles. Functional requirements for
WebLabs general-purposes as well as for the domain of
computer networks are covered in this proposal. The
validation of the architecture is given by means of
experiments of configuration of Virtual Local Area
Network (VLAN).
the user profile submodel is used to include the variables

that support learning for students with LDs is also
described. Four phases are considered in the design of
this user model: 1) taking an existing user model as a
starting point, 2) analyzing and identifying different types
of LDs, 3) including variables related to LDs, and 4)
creating mechanisms for the detection of LDs using an
LMS. Some adaptation processes in an LMS are
proposed to personalize the learning of students with
LDs.
2.3.3. Group-Ing: Herramienta para la

Generacin de Grupos de Trabajos Educativos
(91)
Sala 3
REA TEMTICA: INFORMTICA Y
EDUCACIN (Martes 19/10, 14:40-16:20 hs)
2.3.1. O Poder da Tecnologia de Workflow e dos
Mapas Conceituais no Processo de Ensino e
Aprendizagem da UML (269)
Simone Sawasaki Tanaka (Universidade Estadual de
Londrina (UEL) Caixa Postal 6001, 86.051-990,
Londrina, PR, Brasil - simone.tanaka@unifil.br),
Rodolfo Miranda de Barros, Sergio Akio Tanaka, Ana
Paula Ezequiel
This paper presents the study of the implementation of a
workflow for teaching and learning of modeling
diagrams using UML. For this study, use will be the
features and benefits of concept maps to assist in
understanding the development of the diagram, which
can be used both in classroom teaching and in distance
education. The main contributions of this work was the
implementation of workflow to aid in the teachinglearning models of UML, the definition of the concept
map representing traceability modeling diagrams.
2.3.2. Including Students Learning Difficulties in

the User Model of a Learning Management
System (276)
Carolina Meja, Ramn Fabregat, Jose L. Marzo
(Institute of Informatics and Applications, University
of
Girona,
17070
Girona,
Spain
carolina@eia.udg.edu,
{ramon.fabregat,
joseluis.marzo}@udg.edu)
An approach of including the characteristics of students
with learning difficulties (LDs) in the context of a
Learning Management System (LMS) is introduced in
this paper. In order to detect LDs in students and store the
information of the students characteristics with LDs,
different detection instruments are analyzed and a user
model is defined respectively. The user model is made up
of four submodels: 1) user profiles, 2) learning
preferences, 3) interactions, and 4) work context. How
Maria Paula Arias-Bez, Luis GuillermoTorresRibero,

Angela
Carrillo-Ramos
(Pontificia
Universidad Javeriana, Bogot, Colombia - {arias.m,
luis-torres, acarrillo}@javeriana.edu.co)
A workgroup is defined as a group of people with skills
that complement each other, common objectives end
shared responsibilities. Such groups are efficient as long
as they are rightly conformed from the first time for it
greatly determines the cohesion and motivation of its
participants. This article presents a tool design that will
allow the creation of workgroups, focused on educational
groups, considering each persons profile, the context of
the users and the characteristics in which a group is
needed to make a particular educational work. A
collaborative group is then generated in an educational
environment with users forming the group, their roles,
assigned activities and effective interactions achieving
the main purpose of the created group.
2.3.4. Ferramenta Construtivista de Apoio ao

Aprendizado de Gentica: Sistema Gene (403)
Henrique da Mota Silveira, Marcos Augusto
Francisco Borges (Universidade Estadual de
Campinas UNICAMP, Rua Paschoal Marmo, 1888,
CEP: 13484-370, Jardim Nova Itlia, Limeira, SP,
Brasil
henriquedamota@gmail.com,
marcosborges@ft.unicamp.br)
The first version of the Gene system was completed in
1999 with the objective to support the learning of
genetics concepts. The system demonstrated capacity to
assist its users, however it was not used very often,
amongst other reasons, for not motivating and attracting
most users, and also requiring installation. This project
contemplates an update of the Gene system exploring
more modern technologies, learning dynamics and
researching ways to make it more appealing. The
interactivity proposed by the Community is one of the
ways of game evolution, where the user starts in a
primary state and develops according to relationships
with other users. The Gene system enables it's free use
over the Internet.
REA TEMTICA: TEORA DE LA

COMPUTACIN, MODELOS
FORMALES Y COMPILADORES (Martes
19/10, 16:40-18:20 hs)
2.3.5. Sample Algorithms in Multi-start

Heuristics for the Switch Allocation Problem
(176)
Alexander J. Benavides, Marcus Ritt, Luciana S.

Buriol (Instituto de Informtica, Universidade
Federal do Rio Grande do Sul - UFRGS,
{ajbenavides, mrpritt, buriol}@inf.ufrgs.br)
We study the problem of allocating switches in electrical
distribution networks to improve their reliability. We
present a sample construction algorithm and a sample
local search for this problem. We compare these
approaches with other construction and local search
strategies within heuristics that combine them. We
present and analyze experimental results, showing that
sample approaches are inexpensive and find solutions of
good quality.
2.3.6. A linear algorithm for maximum matchings

is hexagonal systems (221)
Maikel Arcia (Universidad de las Ciencias
Informticas, La Habana, Cuba), Mario E. Estrada
the approach. We improve the results already known for

some of those instances.
2.3.8. Complexidade Computacional de

Problemas de Estatstica Descritiva com
Entradas Intervalares (383)
Aline Loreto (Universidade Federal de PelotasUFPel, Departamento de Informtica, 96010-900,
Pelotas/RS, Brasil - aline.loreto@ufpel.edu.br),
Marclia Campos, Laira Toscani
This work have main aim to analyze the computational
complexity of descriptive statistical measures problems
using intervals as input values. To investigation of
complexity we introduce definitions intervals to
descriptive statistical and, interval representation of real
values, such that guarante the quality of the
approximation in the result intervals calculated using
interval extension. There are already approaches to
calculate values of dispersion, variance, covariance and
correlation using intervals, but the interval computation
of dispersion measures gives always overestimated
intervals, with wide amplitude, as result. Moreover, if
better solutions are needed, by using the image
representation, calculating such measures turns out to be
an NP-Hard problems. By means of the analysis the
computational complexity we conclude that all defined
measures problems are in the P class of complexity.
The problem of computing matchings in graphs has been

wide studied; in the particular case of the chemical
graphs theory, matchings are interesting due to their
strong connections with physical and chemical properties
of the molecules which such graphs represent. For the
class of benzenoid system, the MHS algorithm is known
to determine if a hexagonal system has a Kekulean
structure and in that case, to compute a perfect matching.
In this paper an extension of MHS algorithm is proposed,
allowing to determine Kekulean structures, but also to
find a maximum matching in a wide class of graphs, the
so called generalized hexagonal systems, and keeping the
linear time.
Mircoles 20 de
octubre
2.3.7. Heursticas para o Problema da Mochila

2D No-Guilhotinada Ilimitada (261)
3.1.1. Supporting Scientific Inclusion: Novel

Approaches for the Representation and
Assessment of Scientific Knowledge Objects (290)
Thiago A. de Queiroz, Flvio K. Miyazawa (Instituto

de Computao, IC, UNICAMP, 13084-971,
Campinas-SP, Brasil. {tqueiroz, fkm}@ic.unicamp.br)
This paper investigate the Unbounded Two-Dimensional
Knapsack problem restricted to non-guillotine cuts. We
consider the oriented case and also the case where
orthogonal rotations are allowed. Both cases are
computationally hard. For the 2D Knapsack problem, we
present an algorithm that uses the concept of reduced
raster points, (first order) non-guillotine cuts and Lapproach strategy. Computational tests on instances
adapted from the literature support the applicability of
Sala 1
REA TEMTICA: DESARROLLO DE
APLICACIONES WEB Y WEB
SEMNTICA I (Mircoles 20/10, 14:40-16:20 hs)
Ronald Chenu-Abente, Juan Jose Jara, Fausto

Giunchiglia, Fabio Casati, Maurizio Marchese (Dipartimento
di
Ingegneria
e
Scienza
dell'Informazione Universit degli Studi di Trento Via Sommarive, 14 I-38123 POVO - {chenu, jara,
fausto, casati, marchese}@disi.unitn.it)
Developing countries face several challenges while
trying to keep up and contribute to global scientific and
technological advances. These problems persist despite
the emergence of several new web-based communication
opportunities that could potentially be used to bridge this
knowledge gap. This paper introduces a conceptual and

infrastructural platform (named LiquidPub platform) to
address these problems and opportunities. We specially
focus on the representation of content as Scientific
Knowledge Objects (SKOs) and on a Resource
Evaluation system (ResEval) for assessing the value of
research, while also exploring the potential impact that
the proposed concepts, methodologies and tools offer for
both developing countries and the scientific community
at large.
3.1.2. A Scientific Resource Space Management

System (260)
Cristhian Parra (University of Trento. Dipartimento
di Ingegneria e Scienza dellInformazione - Via
Sommarive
14,
38100
Trento,
Italy
parra@disi.unitn.it), Marcos Baez, Florian Daniel,
Fabio Casati, Maurizio Marchese, Luca Cernuzzi
As the web continues to change the way we produce and
disseminate scientific knowledge, traditional digital
libraries are confronted with the challenge of
transcending their boundaries to remain compatible with
a world where the whole Web in itself is the source of
scientific knowledge. This paper discusses a resourceoriented approach for the management and interaction of
scientific services as a way to face this challenge. Our
approach consists in building a general-purpose,
extensible layer for accessing any resource that has a URI
and is accessible on the Web, along with appropriate
extensions specific to the scientific domain. We name the
class of systems that have this functionality Scientific
Resource Space Management Systems (sRSMS), since
they are the resource analogous to data space
management systems known in literature.
3.1.3. ORINOCO Framework: Publicacin,

Composicin y Ejecucin de Servicios Web en
Ambientes Grid (317)
Keysis Kiss (Universidad Central de Venezuela,
Facultad de Ciencias,Escuela de Computacin Apartado
1010,
Caracas,
Venezuela
{kkiss}@gmail.com), Eduardo Blanco, Yudith
Cardinale
La gran cantidad de servicios existentes en plataformas
Grid y la necesidad de satisfacer requerimientos
complejos, suponen la integracin de distintas
organizaciones para compartir dichos servicios. Esta
integracin implica procesos de registro de servicios,
usando lenguajes para la descripcin semntica de
funcionalidades, y de procesos de descubrimiento,
composicin y ejecucin semi-automticos. Este artculo
presenta Orinoco Framework, una infraestructura para
ambientes Grid que integra las facilidades de
publicacin, descubrimiento, composicin y ejecucin de
Servicios Web (SWs). Orinoco permite transformar
aplicaciones JAVA en SWs, generando las descripciones
semnticas correspondientes. Tambin asiste a los
usuarios resolviendo requerimientos que impliquen la

coordinacin de diversos servicios. Ante un
requerimiento, Orinoco genera un plan de ejecucin que
al ser evaluado dar respuesta al requerimiento. Se
demuestran las funcionalidades de Orinoco con un caso
de estudio y se presentan resultados de rendimiento sobre
gLite, un middleware de Grid.
3.1.4. Component Reuse in Synchronous

Collaborative Web 2.0 Applications (246)
Tiago C. Gaspar, Antonio F. do Prado, Cesar A. C.
Teixeira (Universidade Federal de Sao Carlos, Sao
Carlos - SP, Brazil)
The concepts and technologies that define Web 2.0 has
revolutionized and extended collaboration assisted by
computational systems. Recent developments in new
technologies makes it possible to represent, in a Web
environment, elements that are common to face-to face
collaborations. The Web environment is formed by
synchronous collaborative multimedia applications with
rich interfaces using the Web as platform. The authors'
experience in projects on the synchronous collaborative
application's domain has allowed the identification of a
complex and broad domain with many commonalities.
This paper presents a software component reuse approach
for synchronous collaborative Web 2.0 application's
development. It describes the construction of such
components as well as an approach to reuse software by
taking advantage of a shared architecture and
components library to aid domain's developers.
REA TEMTICA: DESARROLLO

DE APLICACIONES WEB Y WEB
SEMNTICA II (Mircoles 20/10, 16:40-18:20 hs)
3.1.5. Una Propuesta MDA para las Perspectivas
Navegacional y de Usuarios (216)
Magal Gonzlez (DEI - Universidad Catlica
Nuestra Seora de la Asuncin Asuncin
Paraguay
mgonzalez@uca.edu.py),
Jorge
Casariego, Juan Jos Bareiro, Luca Cernuzzi, Oscar
Pastor
El presente estudio se enfoca a un anlisis de las
perspectivas navegacional y de usuarios en Aplicaciones
Web, resaltando algunos de sus respectivos puntos
crticos para el modelado. A partir de esto, se realiza una
propuesta notacional y su definicin formal centrada en
un Metamodelo general que consta de tres Metamodelos
especficos: el del rbol de Navegacin, el de Nodos, y
el de Roles. Los Metamodelos han sido implementados
en una herramienta especfica de MDA (AndroMDA)
mediante el desarrollo de un cartucho que considera
como plataforma destino aplicaciones en PHP. Tanto el
Metamodelo general, como el cartucho para AndroMDA
han sido analizados por medio de una Prueba de

Concepto, culminando con una serie de resultados
interesantes en cuanto a la aplicacin del enfoque MDA,
as como tambin las contribuciones del metamodelo
propuesto en relacin a otras propuestas metodolgicas
existentes.
3.1.6. Enfoque MDA para Servicios: un Tipo

Especfico de Comportamiento (220)
Rodrigo Villalba Otto (Universidad Catlica
Nuestra Seora de la Asuncin - Campus
Universitario,
Asuncin,
Paraguay
rodris.jvo@gmail.com), Magal Gonzlez, Luca
Cernuzzi, Oscar Pastor
El comportamiento corresponde a una dimensin crtica y
compleja en el proceso de desarrollo de una aplicacin.
En el marco MDA (Model Driven Architecture), existen
propuestas de modelos para abarcar dicha dimensin, sin
embargo, estudios recientes demuestran que se hace de
manera imprecisa o incompleta. Este trabajo analiza el
comportamiento desde el punto de vista del modelado,
identifica tipos de comportamiento y propone una
clasificacin segn su etapa de desarrollo y/o nivel de
definicin. A partir de ello se define un tipo especfico de
comportamiento (Servicio), y una propuesta notacional
para su modelado. Finalmente se presenta el metamodelo
de la propuesta con MOF, se definen las reglas de
transformacin con una herramienta MDA (AndroMDA),
y se realiza la validacin con una prueba de concepto.
3.1.7. Ingeniera de Requisitos Web Orientada a

Aspectos con Transformacin de Modelos (393)
Martn Villalba, Juan Eduardo Durn (Facultad de
Matemtica, Astronoma y Fsica - Universidad
Nacional de Crdoba - Medina Allende S/N - 5010
Crdoba
Argentina
{villalba,
duran}@famaf.unc.edu.ar)
Los analistas usualmente describen requisitos usando
notaciones de modelado que involucran conceptos
tcnicos que los clientes/usuarios suelen no conocer y
que son tiles y necesarios para las fases de desarrollo
posteriores a la ingeniera de requisitos. El expresar
requisitos con notaciones legibles para los clientes (NLC)
i.e. que usan conceptos que son conocidos por ellos
les permite comprenderlos fcilmente sin necesidad de
entrenamiento, validarlos, y colaborar en su
mantenimiento. La minera de elementos respetando
conceptos tcnicos a partir de modelos NLC es necesaria,
porque dichos elementos dirigen el desarrollo de software
en etapas posteriores a la ingeniera de requisitos. Una
forma de describir cmo afectan los requisitos no
funcionales (RNF) al sistema, es creando escenarios que
involucran RNFs; sin embargo, esto es costoso en tiempo
por lo cual es productivo definir en una sola oracin
cmo una cualidad no funcional (CNF) afecta
globalmente al sistema, plasmndose as lo que de otra
manera involucrara muchos escenarios. Actualmente
existe falta de NLC apropiados para describir en detalle
cmo afectan globalmente las CNF al sistema; solo hay

algunas notaciones poco detalladas para ello, que solo
permiten generar modelos de requisitos orientados a
aspectos (OA) muy poco detallados. Por eso proponemos
para el dominio de sistemas de informacin web una
NLC que permite expresar cmo CNFs afectan
globalmente a la parte funcional del sistema. Adems
definimos una transformacin de modelos usando ATL
para mapear esos modelos NCU a dos notaciones
conocidas de requisitos OA.
3.1.8. Definio de metamodelos para Web

incorporando boas prticas de acessibilidade e
usabilidade (367)
Thiago Jabur Bittar (USP, ICMC, Caixa Postal 668,
So Carlos, Brasil - {jabur}@icmc.usp.br), David
Fernandes Neto, Luanna Lopes Lobato, Daniel
Lucrdio, Renata Pontin de Mattos Fortes
A wide range of good development practices have been
researched and disseminated aiming to get quality and as
a mechanism to share expertise regarding to Web
applications development. Mechanisms to track such
practices also have been created and in this paper,
guidelines are described. However, despite the track
mechanisms and the disclosure of good practices,
currently the panorama is that the majority of developed
web applications present usability and accessibility
drawbacks. Thus, this work focuses on the development
and research of an approach that allows incorporating
good practices in Web development using the ModelDriven Development (MDD) approach. A proof of
concept is detailed in different abstraction levels to
demonstrate how MDD could support modeling
techniques and codegeneration, aiming to facilitate the
adoption of good practices in Web projects, regarding to
improve accessibility and usability.
Sala 2
REA TEMTICA: SISTEMAS
OPERATIVOS Y DE TIEMPO REAL
(Mircoles 20/10, 14:40-16:20 hs)
3.2.1. Otimizao do Desempenho de um Sistema

de Arquivos FUSE-Linux Baseado na Poltica
Write-Once Read-Many (178)
Tiago Falco (Centro de Informtica - Universidade
Federal de Pernambuco (UFPE)- Recife - Brasil tlf@cin.ufpe.br), Ermeson Andrade, Rubens Matos,
Rodolfo Ferraz, Paulo Maciel, Stephen Worth, Paul
Malenfant
Home users need to store their information quickly,
cheaply and safely. However, nowadays there is a risk
associated with loss of such information by accidental

deletions. This paper depicts a WORM (Write-Once
Read-Many) file system called WFS, which has been
implemented adopting the FUSE infrastructure. This
system provides some WORM features, i.e. files and
directories cannot be renamed or removed. A
performance evaluation was also carried out. 2k factorial
experiment techniques were used, aiming to reduce the
performance loss in comparison to Ext3. Thus, WFS
introduced low overhead in file operations.
3.2.2. Linux Kernel extensions to minimize

effects of Software Aging (326)
Ariel Sabiguero, Andres Aguirre, Fabricio Gonzlez,
Daniel Pedraja, Agustn Van Rompaey (Instituto de
Computacin, Facultad de Ingeniera, Universidad
de la Repblica - J. Herrera y Reissig 565,
Montevideo,
Uruguay
{asabigue,aaguirre}
@fing.edu.uy
{fabgonz,danigpc,fenix.uy}
@gmail.com)
State of the art software rejuvenation techniques tackles
different levels of transient system errors in a coarsegrained manner: full system or full process
reinitialization. Our team implemented a prototype that
addresses a finer-grained approach. The implemented
prototype aims at the detection and correction of
corruption in read only memory frames of a GNU/Linux
system. This work describes the class of soft errors
addressed, error correction approach and its application
to system reliability and availability. To evaluate the
solution implemented by the prototype we performed
extensive studies on different applications under
simulated load. A fault injector was used to generate and
simulate errors on the system. Implications to
performance and enhanced availability are presented too,
showing the applicability of the technique is adequate
under general conditions.
3.2.3. Web Cache Performance Correlation with

Content Characterization Parameters in Content
Aggregation Systems (111)
Carlos Guerrero, Carlos Juiz, Ramon Puigjaner
(Departament de Matematiques i Informatica,
Universitat de les Illes Balears, Crta. - Valldemossa
km 7.5, Illes Balears, SPAIN - {carlos.guerrero, cjuiz,
putxi}@uib.es)
Applications based on Web 2.0, particularly content
aggregation applications, have limitations in the use of
traditional cache solutions. Contents, in new web
applications, have higher updating and personalizing
rates than in Web 1.0 systems. These higher rates
generate more frequent invalidations in web cache. This
reduces the performance of the cache system. One
solution to this problem is caching independent
fragments of the page instead of the whole page. This
paper discusses how the proportion among
characterization parameters of the content elements
influence the cache system performance of the groups

created from combination of these contents.
3.2.4. Real-Time Scheduling with Shared

Resources Revisited (195)
David Donari, Leo Ordinez, Rodrigo Santos, Javier
Orozco (Dep. Ing. Elctrica - Inst. Inv. Ing. Elctrica
Universidad Nacional del Sur - CONICET)
Resource sharing is one of the limiting factors when
dealing with realtime scheduling. In particular,
synchronizing tasks and sharing resources usually impose
priority inversions and the possibility of introducing
deadlocks among the tasks involved. Contention policies
usually bound the blocking-time that higher priority tasks
may suffer, by introducing an strict order in the access to
the shared resources. The way in which they do this
determines the maximum time each task would have to
wait for a resource. In some cases, a resource constitutes
a limiting factor for the schedulability and replicating it
may facilitate the scheduling. In this paper, a replicating
scheme is introduced for detecting and replicating the
appropriate resource so the system can become feasible
within a cost constraint.
REA TEMTICA: ARQUITECTURA DE

COMPUTADORAS I (Mircoles 20/10, 16:40-18:20
hs)
3.2.5. Algoritmo gentico hbrido para la

estimacin de medida geomtrica de
entralazamiento de estados cunticos de n-qubits
(72)
Andr Fonseca de Oliveira (Facultad de Ingeniera

Bernard-Wand Polak, Universidad ORT Uruguay fonseca@ort.edu.uy), Efrain Buksman, Jess GarcaLpez
El entrelazamiento es un fenmeno de gran importancia
en la computacin cuntica. En los ltimos aos han sido
realizados varios esfuerzos en la definicin y clculo de
medidas del entrelazamiento de estados cunticos.
Aunque en algunos casos este clculo puede ser realizado
algebraicamente en forma directa, en la gran mayora de
estados cunticos entrelazados es necesaria realizar una
optimizacin no lineal. Este trabajo propone un algoritmo
hbrido utilizando combinacin de resultados algebraicos,
meta-heursticas (algoritmos genticos) y bsquedas
locales para el clculo de la medida de entrelazamiento
geomtrico cuntico de estados puros. Para finalizar, se
muestra la utilizacin del algoritmo en algunos casos de
inters.
3.2.6. Simulacin del Protocolo de Comunicacin

Cuntico BB84 en un Ambiente Distribuido (164)
Luis Cceres Alvarez (Acadmico del Departamento
de Computacin. Escuela Universitaria de Ingeniera
Industrial, Informtica y de Sistemas. Universidad de

Tarapac. 18 de Septiembre 2222. Arica, Chile. lcaceres@uta.cl), Miguel Pinto Bernab, Hector
Ossandn Daz
El propsito de la presente investigacin consisti en la
realizacin de una aplicacin de criptografa cuntica que
lograra simular el protocolo BB84. Por ello fue necesario
estudiar sobre la criptografa cuntica, realizando un
breve estudio bibliogrfico, para luego estudiar los
diversos protocolos de comunicacin cuntica y as
seleccionar el protocolo a simular. Con esta informacin
se dio pas a la definicin de los requerimientos de la
aplicacin. Desarrollando un modelo que permita suplir
los requerimientos que dan origen a la definicin de la
arquitectura de software y la plataforma de programacin
a utilizar en la etapa de desarrollo. El modelo de la
aplicacin se realiza mediante UML, lo cual permite
abordar la aplicacin desde diferentes puntos de vista. La
implementacin de la aplicacin permite validar el
modelo y las posteriores pruebas evalan la aplicacin
creada.
3.2.7. A New Clustering Strategy for Continuous

Data Datasets Using Hypercubes (115)
Waldo Hasperu, Laura Lanzarini (III-LIDI. Facultad
de Informtica UNLP. Argentina.- {whasperue,
laural}@lidi.info.unlp.edu.ar)
Self-organizing networks (SOM) and their ability to
preserve input data topology are very useful as tools to
solve clustering issues. The greatest disadvantage of this
type of architectures is the inability to easily explain the
results obtained, as well as the detection of possible
clusters over the network architecture. In this paper, a
new technique that works on the result of a trained SOM
and uses a hypercube expansion and contraction
technique to detect the different clusters that can be
found in the dataset under study, is presented. The
AVGSOM dynamic neural network is used for data
training, but any other similar architecture can be used.
Finally, with the obtained hypercubes and the detected
clusters, an IF-THEN-type rule is generated for each
cluster in order to describe the data it contains in a
manner that a person can understand. The technique
presented in this paper is an efficient solution to
problems whose data have continuous attributes, as
demonstrated by the results obtained in the analysis of a
weather database. The comparison with the results
obtained using standard databases show that this
technique is better than other clustering techniques.
3.2.8. Program Code Compression (248)

Eric Stotzer(Texas Instruments - {estotzer}@ti.com),
Ernst Leiss
Code size is a primary concern in the embedded
computing community. Minimizing physical memory
requirements reduces total system cost and improves
performance and power efficiency. VLIW processors rely
on the compiler to statically encode the ILP in the

program before its execution, and because of this, code
size is larger relative to other processors. In this paper we
describe the co-design of compiler optimizations and
processor architecture features that have progressively
reduced code size across two generations of a VLIW
processor.
Sala 3
REA TEMTICA: MODELADO Y
OPTIMIZACIN DE SISTEMAS I (Mircoles
20/10, 14:40-16:20 hs)
3.3.1. Application of New Elastic Net Algorithm

using phase Transition for the Detection of Gene
Expression (4)
Marcos Lvano (Escuela Ingeniera Informtica,
Universidad Catlica de Temuco - Av. Manuel Montt
56,
Casilla
15-D,
Temuco
Chile
mlevano@inf.uct.cl), Hans Nowak
The mechanical statistics interpretation of the elastic net
algorithm with the corresponding free energy gives a tool
for data clustering in a n-dimensional space. This
deterministic annealing method shows a series of phase
transitions at different temperatures, where the system,
initially represented by one cluster, splits into fuzzy sub
clusters. We show in this contribution that for a given
number of nodes of the elastic chain one nodes a typical
phase transition, where fuzzy clusters for every node,
represented by their centroids, are practically the same
as the nearest neighbor clusters for this node, which
correspond to a Voronoi tesselation with well defined
members in every cluster. This equivalence defines for a
given number of nodes the minimal cluster size to be
found and may be used as a stopping criterion for the
annealing process. We apply the algorithm to the genome
of the bacteria Escheria Coli, with expression levels.
3.3.2. Modelacin de yacimientos laterticos en

un cluster de estaciones de trabajo (23)
Dannier Trinchet, Asnay Guirola, Moiss Mayet,
Jorge Guln (Universidad de las Ciencias
Informticas Carr. San Antonio de los Baos, km 2
1/2, Ciudad de La Habana, Cuba. Telfono
(+53)(7)837 2726 - {trinchet,aguirola, mmayets,
gulinj}@uci.cu)
La modelacin de yacimientos laterticos representa una
fase importante dentro del proceso de exploracin y
explotacin del nquel, lograr una adecuada exactitud y
representatividad durante este proceso es vital. Existen
diferentes enfoques para enfrentar este problema, los
cuales se ven afectados por la complejidad de la
composicin qumica y mineralgica inherente a estos

tipos de yacimientos, que determina un alto costo
computacional para la obtencin de modelos que
describan eficazmente esta realidad. En el presente
trabajo se propone un algoritmo paralelo escalable,
ptimo en cuanto a Ganancia de Velocidad y Eficiencia,
para la obtencin de uno de estos modelos matemticos.
Se presentan adems, los resultados obtenidos en una
implementacin distribuida sobre un cluster de estaciones
de trabajo, los que muestran la posibilidad que ofrecen
entornos de este tipo no solo para lograr buena
Productividad sino adems altas Prestaciones.
3.3.3. New Resolution Strategies for Multi-scale

Reaction Waves: Optimal Time Operator
Splitting and Space Adaptive Multiresolution
(291)
Stphane Descombes (Laboratoire J. A. Dieudonn UMR CNRS 6621, Universit de Nice - Sophia
Antipolis, Parc Valrose, 06108 Nice Cedex 02,
France), Max Duarte, Thierry Dumont, Frdrique
Laurent, Violaine Louvet, Marc Massot, and Christian
Tenaud
We tackle the numerical simulation of reaction-diffusion
equations modeling multi-scale reaction waves. This type
of problems induces peculiar difficulties and potentially
large stiffness which stem from the broad spectrum of
temporal scales in the nonlinear chemical source term as
well as from the presence of large spatial gradients in the
reactive fronts, spatially very localized. In this paper, we
introduce new resolution strategies based on time
operator splitting and space adaptive multiresolution in
the context of very localized and very stiff reaction
fronts. The computational efficiency is then evaluated
through the numerical simulation of configurations which
were so far out of reach of standard methods in the field
of nonlinear chemical dynamics for spiral waves and
scroll waves as an illustration.
3.3.4. Ajuste Robusto del Compensador Esttico

de Reactivos Usando Metaheurstica MultiObjetivo (131)
Domingo Milciades Maldonado Gonzalez, Enrique
Ramon Chaparro Viveros (Facultad Politcnica,
Universidad
Nacional
del
Este
(FPUNE),
{domimaldo, enriquerchv}@fpune.edu.py)
El problema de Ajuste Robusto del Compensador
Esttico de Reactivos (CER), en los Sistemas Elctricos
de Potencia (SEP), tiene los siguientes objetivos: a)
minimizacin de la inversin financiera para adquisicin
del CER (directamente proporcional a su capacidad
medida en MVAr), b) el perfil de tensin para diferentes
escenarios de operacin, y c) la minimizacin de la
prdida de potencia activa. Los parmetros del CER que
sern optimizados son: la tensin de referencia del
regulador correspondiente, y los lmites de potencia
reactiva inyectados en la red. Se utiliza un Algoritmo
Gentico (AG) adaptado para Problemas de

Optimizacin Multi-Objetivo. Para dicha adaptacin se
utilizan dos metodologas: a) suma ponderada de
objetivos, y b) Reglas de Dominancia de Pareto. Con la
finalidad de acelerar la convergencia del mtodo
propuesto, una solucin es definida de manera
determinstica a travs de la ecuacin matricial de
sensibilidad del Flujo de Potencia. Para validacin del
mtodo son considerados dos SEP.
REA TEMTICA: MODELADO Y

OPTIMIZACIN DE SISTEMAS I (Mircoles
20/10, 16:40-18:20 hs)
3.3.5. Um Algoritmo Branch-and-Cut para o

Problema de Empacotamento em Faixa
Bidimensional sujeito Restrio de Ordem e a
Estabilidade dos Objetos (375)
Fabrcio L. S. da Silva, Thiago A. de Queiroz, Flvio
K. Miyazawa (Instituto de Computao, IC,
UNICAMP, 13084-971, Campinas-SP, Brasil {fabricio.silva} @students.ic.unicamp.br, {tqueiroz
,fkm} @ic.unicamp.br)
Neste trabalho lidamos com o problema de
Empacotamento em Faixa Bidimensional considerando o
caso em que os itens devem ser dispostos de forma a
manter o empacotamento estvel e satisfazer uma ordem
de descarregamento imposta. Consideramos o caso em
que a orientao dos itens fixa. Definimos uma
metodologia para analisar a estabilidade do
empacotamento observando as condies de equilbrio
esttico para corpos rgidos. Ento, formulamos um
programa linear inteiro para o problema de
Empacotamento em Faixa sujeito a tais restries. A
resoluo da formulao inteira ocorre atravs de uma
estratgia do tipo branch-and-cut usando a ferramenta
XPress- Optimizer. As restries de estabilidade foram
inseridas como planos de corte, de maneira a remover
empacotamentos que no so estveis. Em nossos
experimentos computacionais, vemos que o modelo
proposto adequado para lidar com instncias de
pequeno at mdio porte, dentro de um tempo
computacional razovel.
3.3.6. Algoritmos evolutivos multiobjetivos

paralelos para planificacin en entornos
heterogneos (20)
Sergio Nesmachnow (Centro de Clculo, Facultad de
Ingeniera, Universidad de la Repblica, Herrera y
Reissig 565, Montevideo, Uruguay)
Este trabajo presenta la aplicacin de algoritmos
evolutivos multiobjetivos paralelos para resolver el
problema de planificacin de tareas en entornos de
cmputo heterogneos, considerando los objetivos de
minimizacin de las mtricas makespan y flowtime. Los

mtodos propuestos son capaces de alcanzar
eficientemente resultados de buena calidad para un
conjunto de instancias estndar del problema. Los
algoritmos evolutivos multiobjetivos paralelos superaron
a los resultados obtenidos por otras tcnicas evolutivas
previamente aplicadas al problema.
3.3.7 A Supervised Adaptive Hybrid Constraint

Solver (230)
Eric Monfroy (Universidad Tcnica Federico Santa
Mara,
Valparaso,
Chile
eric.monfroy
@inf.utfsm.cl), Carlos Castro, Broderick Crawford,
Christian Figueroa
In [C. Castro, E. Monfroy, C. Figueroa, and R. Meneses.
"An approach for dynamic split strategies in constraint
solving". Springer, 2005] a framework for adaptive
enumeration strategies and meta-backtracks for a
propagation-based constraint solver has been studied. We
extend here this framework in order to trigger some
functions of a solver, or of an hybrid solver to respond to
some observations of the solving process. We can also
simply design adaptive hybridization strategies by just
changing some few rules of our framework. We
experiment this framework on an hybrid BB+propagation
solver in which propagation can be triggered w.r.t. some
observations of the solving process. The results show that
some phases of propagation are beneficial to the BB
algorithm, but also that propagation is too costly to be
executed at each node of the search tree. The
hybridization strategies are thus crucial in order to "tune"
when to perform or not propagation.
3.3.8. Voice recognition based on probabilistic

SOM (279)
Cesar Estrebou, Laura Lanzarini, Waldo Hasperu
(Institute of Research in Computer Science LIDI,
Faculty of Computer Science, National University of
La Plata, La Plata, Buenos Aires, Argentina)
Voice signal processing with the purpose of recognizing
the person speaking is a very interesting problem in the
area of security that can be solved based on biometric
techniques. This paper presents a new method, ProbSOM, to obtain a model that allows recognizing speakers
based on their voice, independently of the text used. The
model is built from adapted dynamic self-organizing
maps to suitably represent the Cepstral coefficients of the
corresponding audio signals. Speakers are recognized by
means of a probabilistic system. Testing was done both
with synthetic and real voices. The results obtained have
been better than those obtained with other existing
methods.
Jueves 21 de octubre
Sala 1
REA TEMTICA: USABILIDAD Y

COLABORACIN (Jueves 21/10, 14:40-16:20 hs)
4.1.1. AgilUs: Construccin gil de la Usabilidad
(234)
Alecia Eleonora Acosta (Centro de Ingeniera de

Software y Sistemas (ISYS), Escuela de Computacin
-Facultad de Ciencias - Universidad Central de
Venezuela,
Venezuela
eleonora.acosta
@ciens.ucv.ve)
En la actualidad, el desarrollo de aplicaciones tiles,
usables y agradables a los usuarios constituye uno de los
grandes retos de la Ingeniera de Software y la
Interaccin Humano Computador, y conlleva a grandes
beneficios tales como el incremento de la productividad,
la satisfaccin y la reduccin de costos de entrenamiento
y soporte del software. En este trabajo se propone un
mtodo de desarrollo gil que permite la construccin de
la usabilidad desde las primeras etapas del ciclo de vida
del software, y se presenta uno de los casos de estudio
que ha permitido validar este mtodo, a travs de las
evaluaciones de usabilidad realizadas durante el ciclo de
vida del software. Las tcnicas de evaluacin de
usabilidad propuestas en el mtodo no son costosas ni
requieren de infraestructura tecnolgica compleja.
4.1.2. Guidelines to Model-Based Usability

Evaluation (119)
Tiago Silva da Silva, Milene Selbach Silveira
(PPGCC Faculdade de Informtica PUCRS, Av.
Ipiranga, 6681, Prdio 32, Sala 507, Porto Alegre,
Rs, Brasil - {tiago.silva, milene.silveira}@pucrs.br)
Usability evaluation is usually performed at the final
phases of the software development process, when there
is at least a system prototype functional or not. Doing
this evaluation earlier at the design phase can
decrease the costs to repair eventual problems. For this
kind of evaluation, artifacts as usage scenarios,
interaction and task models from Human-Computer
Interaction area are used. And as methods, formal and
automatic usability evaluation ones are usually used.
Considering that, this kind of artifacts and methods are
not widely used, this paper focuses on the proposal of an
informal evaluation method to be used with widely
known diagrams: guideline review applied to UML
diagrams. The method could be considered an easy and
inexpensive alternative to be used by the evelopment
team during the design process of interactive systems.
4.1.3. Evaluacin de Usabilidad para

Aplicaciones Web (59)
Adrian Fernandez, Emilio Insfran, Silvia Abraho
(Grupo Investigacin ISSI, Departamento de Sistemas
Informticos y Computacin, Universidad Politcnica
de Valencia, Camino de Vera, s/n, 46022, Valencia,

Spain
{afernandez,
sabrahao}@dsic.upv.es)
einsfran,
darocha}@cos.ufrj.br), Ahilton Barreto, Ana Regina

Rocha, Gleison Santos, Leonardo Murta
La mayora de los mtodos de evaluacin de usabilidad

para aplicaciones Web presentan varias limitaciones: un
concepto de usabilidad muy restringido, evaluaciones
realizadas slo en etapas finales del desarrollo Web y
carencia de guas de cmo integrar adecuadamente la
usabilidad en el proceso de desarrollo Web. Este artculo
presenta el uso de un proceso de evaluacin de usabilidad
integrado en distintas etapas del desarrollo Web dirigido
por modelos (DWDM). Este proceso de evaluacin se
basa en un modelo de usabilidad Web que descompone el
concepto de usabilidad en subcaractersticas y atributos
medibles, a los cuales se asocian mtricas con el fin de
cuantificarlos y poder detectar problemas de usabilidad al
ser aplicados a modelos independientes de plataforma,
modelos especficos de plataforma, o a la aplicacin Web
final.
The lack of adequate processes may cause the failure of

software projects that involve software acquisition. A
study based on systematic literature review identified
several scenarios that difficult the definition of software
acquisition processes in organizations that acquire
software. Based on this review findings, we defined a
software process line (SPL), based on process
components reuse, that allows the definition of different
acquisition processes based on the original SPL. This
paper presents an approach to the definition of
acquisition processes through the definition of a SPL.
This way we intend to easy the process definition and
minimize problems related to software acquisition. The
approach and the tool used to define the SPL are also
presented. We expect that this approach will support
organizations to execute software acquisition more
efficiently.
4.1.4. Engenharia e Gesto do Conhecimento:

estudo e proposta inicial de um modelo para o
trabalho colaborativo (22)
Sandro Rautenberg (Universidade
Centro-Oeste, DECOMP, R. Salvatore
85015-430
Guarapuava-PR,
srautenberg@unicentro.br), Andrea
Jos Leomar Todesco
Estadual do
Renna n. 875,
Brasil
Valria Steil,
Knowledge Engineering and Knowledge Management

are complementary and interdisciplinary areas, whose a
convergence has increased in recent years. An
exploratory research reveals multiple meanings to some
concepts used by these areas, which difficult the
communication among knowledge engineers and
knowledge managers. To deal with the polysemy, its
discussed the development of an ontology as a
knowledge model for the convergence of these concepts,
considering two dimensions: Knowledge Engineering
Computational Agents and Knowledge Management
Instruments. As result, we identified the importance of
further research, noting that the development of the
model contributes to: communication and collaborative
work among knowledge engineers and knowledge
managers, development of knowledge management
applications; and formalization of a resource to publicate,
share, refer and apply interdisciplinary knowledge.
REA TEMTICA: SISTEMAS DE

INFORMACIN (Jueves 21/10, 16:40-18:20 hs)
4.1.5. Definio de Processos de Aquisio de
Software para Reutilizao (62)
Elaine Nunes (COPPE/UFRJ - Universidade Federal
do Rio de Janeiro, Caixa Postal 68511 CEP 21945970, Rio de Janeiro, Brazil - {elainenunes, ahilton,
4.1.6. The ANEMONA + JANUS approach for

engineering Manufacturing Enterprise IS (27)
Adriana Giret (Departamento de Sistemas
Informaticos y Computacion, Universidad Politecnica
de Valencia - agiret@dsic.upv.es)
Open Manufacturing approaches are becoming more and
more the appropriate tool and technology to meet the
high expectations of the customers of manufacturing
enterprises, who, in todays economy, demand absolutely
the best service, price, delivery time and product quality.
Nowadays, Internet technologies have changed the way
companies have conducted businesses and IS to operate
their enterprise as well as manage customer relationship.
Collaborative manufacturing environments demonstrate
considerable potential in responding to this need. In this
work we present a Multi-agent System approach, which
integrates specific features of Intelligent Manufacturing
Systems with Service Oriented Multi-agent technology,
and a robust and complete software development method,
for engineering Manufacturing Enterprise IS.
4.1.7. Un lenguaje de Transformacin especfico

para Modelos de Proceso del Negocio (24)
Roxana Giandini, Gabriela Prez, Claudia Pons
(LIFIA, Facultad de Informtica, Universidad
Nacional de La Plata, Buenos Aires, Argentina giandini,gperez,cpons}@lifia.info.unlp.edu.ar)
En el desarrollo dirigido por modelos (MDD), los
lenguajes de modelado juegan un rol central. Abarcan
desde los ms genricos como UML hasta los llamados
lenguajes especficos del dominio (DSL). En el dominio
de los procesos de negocio, el lenguaje estndar de
modelado BPMN se ha tornado popular y tal como
sucede en otras reas, el diseo de un modelo BPMN
necesita ser mejorado a travs de tcnicas de
refactorizacin. En MDD, la refactorizacin de modelos

es vista como una forma particular de transformaciones
de modelos. As como BPMN es un DSL para construir
modelos de proceso, sera deseable tambin contar con
un lenguaje de transformaciones especfico del dominio
(DSTL), en lugar de utilizar un lenguaje genrico para
transformaciones
como QVT para especificar
refactorizacin de modelos de proceso. En este trabajo
proponemos un DSTL para expresar transformaciones de
modelos especificados en BPMN que asista al
desarrollador proveyendo construcciones especficas para
refactorizacin de modelos de proceso.
4.1.8. Uso de tcnicas de parsing para la

implementacin de protocolos de aplicacin (247)
Guillermo Filevich, Leonardo Val (Universidad
Catlica del Uruguay, Facultad de Ingeniera,
Departamento de Informtica y Ciencias de la
Computacin, 11600 Montevideo, Uruguay {gfilevix, lval}@ucu.edu.uy)
Protocol implementation for the application layer is a key
point in the development of distributed systems or any
other application that interacts with a network. Such
implementation is usually done manually by the
programmers requiring a lot of effort and time, and often
resulting in bugs and errors. Having a specific tool that,
given a protocol specification, is able of automatically
generate the code will simplify the process of developing
this kind of software. The use of this tool will allow
generating better applications in less time. In this
document we are bringing forth a proposal, in the
Programming Languages area, with the objective of
evaluating the use of parsing techniques for the
implementation
of
application
protocols.
The
investigation is intended to develop a system capable of
automatic generation of a complete application-layer
protocol implementation.
Sala 2
REA TEMTICA: ARQUITECTURA DE
COMPUTADORAS II (Jueves 21/10, 14:40-15:30hs)
4.2.1. Estudio de estrategias hbridas de cmputo
CPU-GPU para acelerar algoritmos genticos (30)
Martn Pedemonte, Pablo Ezzatti, Jose Blengio,
Nicolas Soca (Centro de ClculoInstituto de la
Computacin, Universidad de la Repblica, 11.300
Montevideo,
Uruguay,
{mpedemon,
pezzatti}@fing.edu.uy)
Debido a su gran capacidad para encontrar buenas
soluciones en tiempos de ejecucin razonables las
metaheursticas son ampliamente utilizadas para la
resolucin de problemas de optimizacin. Dentro de las
metaheursticas se destacan los Algoritmos Genticos
(GAs). Sin embargo, resolver problemas con instancias

de gran tamao puede ser difcil incluso para este tipo de
estrategias. Por esta razn, la paralelizacin de
metaheursticas es una alternativa interesante para
disminuir los tiempos de ejecucin de estos algoritmos.
En los ltimos aos, las GPUs han sufrido una evolucin
explosiva.
transformndose
en
verdaderos
multiprocesadores de memoria compartida. En base a
esto, las GPUs se presentan como una plataforma
poderosa para implementar algoritmos paralelos. En este
artculo, se presenta un estudio preliminar de
paralelizacin de un algoritmo gentico incluyendo
estrategias hbridas de cmputo CPU-GPU. La propuesta
presentada se basa en el esquema de paralelismo de GAs
maestro-esclavo. Se presentan los resultados obtenidos
utilizando una GPU de bajo rango (NVidia 9800 GTX),
alcanzando valores de speedup de 9X.
4.2.2. Uso de GPUs para acelerar el clculo de la

matriz inversa (43)
Pablo Ezzatti (Centro de ClculoInstituto de la
Computacin, Universidad de la Repblica, 11.300
Montevideo, Uruguay - pezzatti@fing.edu.uy),
Enrique S. Quintana-Ort, Alfredo Remn
La inversin de matrices es una etapa crucial para
diferentes mtodos para la resolucin de problemas en
diversas reas del conocimiento. Debido a esto, y al alto
costo computacional (orden n3) es un operador de intensa
aplicacin de estrategias de computacin de alto
desempeo. En los ltimos aos las GPUs han sufrido
una evolucin explosiva, pasando de ser dispositivos
diseados para una nica funcin especfica para
presentarse como verdaderos multiprocesadores de
memoria compartida. En este contexto, en el trabajo se
presenta el estudio del uso de GPUs para acelerar la
inversin de matrices. En particular se estudian los
mtodos para la inversin de matrices basados en la
factorizacin LU y en la eliminacin de Gauss-Jordan. Se
trabaja sobre una computadora con procesador DualCore
de 2.5 GHz, 2 GB de memoria RAM y con una tarjeta
NVIDIA 9800 GTX+ consiguiendo valores speedup del
orden de 4X.
REA TEMTICA: COMPUTACIN

GRFICA Y VISUAL I (Jueves 21/10, 15:30-16:20
hs)
4.2.3. Consistent Adaptive Remeshing of

Multiple Disk-Like Surfaces (2)
We present a novel method for computing the consistent
adaptive remeshing of multiple disk-like surfaces with
hard constraints. The quality of the remeshing is assured
by minimizing the curvature error metric on all surfaces
simultaneously. In order to generate meshes of relatively
low triangle count, we adaptively optimize several redgreen subdivision surfaces. The proposed method is very

simple and easier to implement than most consistent
remeshing methods. It is also useful for many
applications such as mesh registration, compression and
morphing, multiresolution rendering and texture transfer.
We demonstrate the mesh morphing application between
disk-like meshes with feature-point correspondences
specified by the user.
4.2.4. Segmentacin de nematodos en imgenes

digitales usando redes neuronales artificiales (251)
Olman Gmez (Maestra en Ciencias de la
Computacin, Instituto Tecnolgico de Costa Rica ogs01hn@gmail.com), Pablo Alvarado
Nematodes are microscopic organisms, some of which
are harmful parasites to plants and animals. Their
automatic detection and identification becomes relevant
in the fields of plague control, where biological research
seeks to reduce costs and losses related to them. An
essential step to achieve this task is the image
segmentation, that aims to find regions assignable to the
background or to the nematodes. This work proposes a
two-staged segmentation process. In the first imagebased
stage a comparison of the PCNN, LEGION, CWAGM
and Mean- Shift segmentation algorithms was performed
by means of approximation of the Pareto front in a multidimensional fitness space. On the second level, MLP,
RBF and kNN classifiers were evaluated in their
performance classifying the IFLT and LBP texture
descriptors computed for the regions found on the first
stage. A precision of 83% was achieved using the
CWAGM algorithm in the first level and LBP classified
with and MLP on the second stage.
REA TEMTICA: COMPUTACIN

GRFICA Y VISUAL II (Jueves 21/10, 16:40-18:20
hs)
4.2.5. Validacin de Informacin

Georeferenciada por medio de Realidad
Aumentada (281)
Daniel
Wilches
Maradey
(d.wilches52
@uniandes.edu.co),Pablo Alejandro Figueroa Forero
En este artculo presentamos una aplicacin de realidad
aumentada y GIS para iPhone que permite comparar la
informacin topogrfica almacenada en una base de datos
y la informacin real vista a travs de la cmara del
dispositivo. Esta es una herramienta que puede ser
utilizada para contrastar la informacin de lo que debera
estar construido en un sector de la ciudad contra lo que
realmente est construido. La aplicacin presentada
consiste de un servidor y un cliente. Un servidor de
objetos X3D georeferenciados que transforma y entrega
la informacin en los formatos adecuados, y un cliente
que consume la informacin entregada por el servidor.
Presentamos las decisiones de diseo que se tomaron,
basados en las capacidades y restricciones propias del

iPhone, y un prototipo inicial de la aplicacin.
4.2.6. Force Directed and Hierarchical

Concentric Layouts for Distributed Systems
Visualization (297)
Gustavo A. Guevara S. (Universidad Nacional de
Colombia, Bogot, Cundinamarca, Colombia gaguevaras@unal.edu.co), Jason LaPorte, Carlos A.
Varela
Effective visualization is critical to developing,
analyzing, and optimizing distributed systems. We have
developed OverView, a tool for online/offline distributed
systems visualization, that enables modular layout
mechanisms, so that different distributed system highlevel programming abstractions such as actors or
processes can be visualized in intuitive ways. OverView
uses by default a hierarchical concentric layout that
distinguishes entities from containers allowing migration
patterns triggered by adaptive middleware to be
visualized. In this paper, we develop a force-directed
layout strategy that connects entities according to their
communication patterns in order to directly exhibit the
application communication topologies. In force-directed
visualization, entities locations are encoded with
different colors to illustrate load balancing. We compare
these layouts using quantitative metrics including
communication to entity ratio, applied on common
distributed application topologies. We conclude that
modular visualization is necessary to effectively visualize
distributed systems since no visualization layout is best
for all applications.
4.2.7. Visualizador Molecular Colaborativo e

Imersivo (374)
Moacyr Francischetti Corra (Universidade Federal
de So Carlos, So Carlos, SP, Brasil moacyr@spacnet.com.br), Julio Zukerman Schpector,
Luis Carlos Trevelin, Marcelo de Paiva Guimares
Este artigo apresenta os pontos principais tratados no
desenvolvimento de um visualizador molecular imersivo
com capacidade de colaborao entre grupos de pesquisa
dispersos geograficamente. So detalhados a infraestrutura de software que suporta o sistema, a plataforma
JAMP, a integrao dessa plataforma ao sistema e o
visualizador desenvolvido.
4.2.8. Determination of Orange Maturity Level

Using Probabilistic and IBL Techniques (270)
Guillermo Sampallo, Marcelo Karanik, Sergio
Gramajo, Arturo Gonzlez Thomas, Leandro Varone
(Artificial Intelligence Research Group, National
Technological University, Resistencia (Chaco),
Argentina - sampallo@arnet.com.ar, {marcelo,
sergio,
gthomas}@frre.utn.edu.ar,
varoneleandro@gmail.com)

Several characteristics, such as quality, color, texture, etc.
should be considered to determine the price of vegetables
and fruits. Generally, they are classified manually and
usually some errors in the product categorization occur
due to the subjectivity of persons with limited skills and
long hours work. Computer vision systems can be used
to help in classification tasks. These systems capture the
image of the product and detect its relevant
characteristics that define which class is the most
appropriate. Therefore, these systems need some type of
intelligence in order to work correctly. Artificial
intelligence techniques provide several methods that can
be implemented. In this article image descriptors with
Nave Bayes and K-Nearest Neighbor algorithms are
used to classify orange images taking into account their
level of maturity.
Alencar Machado, Giovani Librelotto, Iara Augustin

(Programa de Ps-Graduao em Informtica,
Universidade Federal de Santa Maria alencar.ufsm@gmail.com,
{august,
librelotto}@inf.ufsm.br)
This article presents a solution used to context treatment
of a information system about clinical environment. It
summarizes the ClinicSpace architecture and describes
how it is structured to collect the context data in a
physical environment and to contextualize the need
information to run a clinical task (pervasive applications
that assist the clinician to carry out their activities). It
indicates a way to solve the existing problem in contextaware systems: how to define what is relevant to the
context in the pervasive application.
5.1.4. Deteccin de huevos helmintos mediante

plantillas dinmicas (392)
Viernes 22 de octubre
Sala 1
REA TEMTICA: SOCIEDAD
ELECTRNICA I (Viernes 22/10, 14:40-16:20 hs)
5.1.1. Elecciones Transparentes: Solucionando el
Fraude Electoral con Baja Tecnologa y
Matemticas Especiales (225)
Juan Camilo Corena (investigacion
@juancamilocorena.com), Rafael Garca
Presentamos en este artculo un anlisis de seguridad del
sistema de escrutinio de votos en Colombia, los
resultados de la investigacin muestran que la
construccin del sistema no permite detectar tipos de
fraude comunes y tambin que el nivel de seguridad
puede ser incrementado significativamente con los
medios existentes aplicando herramientas criptogrficas y
del anlisis de algoritmos.
5.1.2. A Conceptual Approach to Secure Elections

Based on Patterns (282)
Eduardo B. Fernandez (Dept. of Computer Science
and Eng., Florida Atlantic University, Boca Raton,
FL, USA, ed@cse.fau.edu), David L. La Red, Jos I.
Pelez
The analysis patterns describe the structure and
management of an election. The patterns describe voter
registration, ballot structure, election day management,
voting process, and the complete election.
5.1.3. Cincia do Contexto para Tarefas Clnicas

em um Sistema de Sade Pervasivo (36)
Juan Chuctaya (Universidad Nacional de San

Agustn, Per - juanherbert@gmail.com), Jess P.
Mena-Chalco, Csar A. Beltrn-Castan
La deteccin de micro-organismos es un problema
abierto, donde diferentes tcnicas deben ser utilizadas
dependiendo del dominio de imgenes en el que se
trabaje. El problema que nuestro grupo viene atacando es
el referido a la deteccin de huevos de helmintos en
micrografas adquiridas a partir de muestras biolgicas.
Una caracterstica de estas muestras es la referida a la
presencia de impurezas y/o artefactos que impiden una
fcil discriminacin de los objetos de inters. Para ello,
en el presente trabajo se describe un modelo de deteccin
de huevos de helmintos humanos usando plantillas
dinmicas, el cual est compuesto de dos fases: (1) la
localizacin de candidatos, usando tcnicas como
regiones salientes combinado con operaciones
morfolgicas, y (2) la deteccin de objetos de inters,
basado en informacin geomtrica. Los experimentos
realizados sobre una base de datos de 435 imgenes, de
cuatro especies de helmintos, muestra una buena
precisin en la deteccin de regiones ovoides,
considerando la informacin geomtrica de los parsitos.
El procedimiento es rpido, el cual permite agilizar el
proceso de deteccin y posterior etapa de diferenciacin
de especies.
REA TEMTICA: SOCIEDAD

ELECTRNICA II (Viernes 22/10, 16:40-18:20 hs)
5.1.5. Web 2.0, Redes Sociales en Lnea y
Comercio Electrnico como Estrategias para
Promover las Ventas de las Empresas: Un
Anlisis fundamentado en la Literatura (185)
Francisco J. Mata, Ariella Quesada (Programa de
Investigacin y Extensin en Tecnologa de
Informacin y Desarrollo, Posgrado en Gestin de la

Tecnologa de Informacin y Comunicacin, Escuela
de Informtica, Universidad Nacional, Heredia,
Costa Rica {fmata, aques}@una.ac.cr)
El espectacular desarrollo de la Web 2.0, particularmente
a travs de las redes sociales en lnea, ha despertado
mucho inters. Por esta razn, las empresas han decidido
experimentar con estos tipos de tecnologas en apoyo a
sus actividades comerciales. Sin embargo, para sacar
verdadero provecho de las herramientas y sitios Web 2.0,
es necesario conocer el alcance y posible aplicacin de
los mismos para promover las ventas en las empresas.
Esto tambin requiere poner a la Web 2.0 en clara
perspectiva con el comercio electrnico, el cual est
intrnsecamente ligado a este propsito. Se presenta en
este artculo un anlisis fundamentado en la literatura con
el fin de aclarar qu es la Web 2.0 y cmo la misma
puede promover las ventas de las empresas. En particular
se discute el papel que pueden tener las redes sociales en
lnea para ello, y se comparan las mismas con el
comercio electrnico. De este anlisis, se puede concluir
que actualmente las redes sociales en lnea persiguen un
objetivo muy diferente a la promocin de ventas por
parte de las empresas, aunque pueden ser utilizadas como
un complemento del comercio electrnico para lograr
este propsito. Adems, se presentan recomendaciones
principalmente para pequeas y medianas empresas
(PyMEs) exportadoras con el fin de explotar las
bondades de la Web 2.0 en beneficio de sus actividades
comerciales medulares, principalmente con el propsito
de promover sus ventas, y particularmente de aumentar
sus exportaciones.
5.1.6. JCollab: Uma ferramenta para produo e

distribuio de Telejornais no contexto da Web
2.0 (303)
Jorge Andrade Mangueira (Departamento de
Informtica, Centro de Cincias Exatas e da
Natureza, Universidade Federal da Paraba, Joo
Pessoa - Paraba, 58.059-900 - jorge@lavid.ufpb.br),
Felipe Soares de Oliveira, Kellyanne Carvalho Alves,
lvaro F. de Castro Medeiros, Guido Lemos de Sousa
Filho
In recent years, witnessed a shift in consumption of
information by Internet users. Nowadays, with the
growing mass of news portals, blogs and production
services and multimedia content collaboration, has an
increased chance of information channels. New
communication tools, as well as new features of
collaboration services, has contributed to an
improvement of the construction of information
collaboratively and with it, idealizing new models, such
as Web 2.0. We provide the modules already
implemented and tested the tool and distributed
collaborative multimedia (JCollab) for the development
of Television news through a production process defined
from the real possibility of environmental journalism in
the context of Web 2.0.
5.1.7. Utilizando Scratch en el Desarrollo de

Exhibiciones para un Museo Interactivo (298)
Jorge Eduardo Ibarra Esquer (Facultad de
Ingeniera, campus Mexicali, Universidad Autnoma
de Baja California Blvd. Benito Jurez s/n, Col.
Insurgentes Este, Mexicali, Baja California, Mxico. jorge.ibarra@uabc.edu.mx), Gabriel A. Lpez
Morteo, Brenda L. Flores Rios, Ulises Castro
Pealoza
Se describe una experiencia de implementacin de una
exhibicin basada en computadoras para un museo de
ciencias interactivo. sta consiste en un juego orientado
al uso razonado de la energa elctrica, al cual se
incorporan conceptos de generacin de energa por
medios alternativos. Para el desarrollo se utiliz el
lenguaje de programacin Scratch y se sigue una
metodologa similar a la propuesta en el estndar ISO
13407. Se discuten las acciones emprendidas y las
decisiones tomadas en cuanto al uso de ciertas
caractersticas del lenguaje de programacin y su
ambiente de ejecucin, tanto para el diseo e
implementacin de la aplicacin, como para el momento
de hacerla disponible a los visitantes del museo.
5.1.8. Estudo e Aplicao de Mapas AutoOrganizveis na Identificao e Delimitao de

Regies de Influncia das Cidades Brasileiras
(368)
Joo Carlos Santiago Filho (Departamento de

Sistemas e Computao Instituto Militar de
Engenharia (IME) P. General Tibrcio, 80 Praia
Vermelha, Rio de Janeiro, RJ Brasil jcanistrum@gmail.com), Ricardo Choren, Marcello
G. Teixeira
The study of complex networks such as urban and social
offers subsidies for understanding the spatial organization
of society and strategic planning activities of companies
and governments. In this paper we propose a
methodology that combines and extends the concept of
dominant association between cities with well known
properties of projection and vector quantization of selforganizing maps, or SOM, and shows promising results.
Promising results were obtained on the capture and
detection of hierarchical urban networks.
Sala 2
REA TEMTICA: BASES DE DATOS,
DATA WAREHOUSES Y MINERA DE
DATOS (Viernes 22/10, 14:40-16:20 hs)
5.2.1. Testando Aplicaes de Banco de Dados
com Anlise de Instncias de Dados Alternativas
(33)

Joo Carlos Garcia rias, Maria Cludia Figueiredo
Pereira Emer , Silvia Regina Vergilio (Departamento
de Informtica, Universidade Federal do Paran
(UFPR), CP: 19081, CEP: 81531-970, Curitiba
PR, Brasil. - {joaoc, mciemer, silvia}@inf.ufpr.br)
To ensure the quality and reliability of the data
manipulated by a software application, an approach,
called Alternative Data Instance Analysis (ADIA) was
proposed. This approach includes a metamodel, which
allows the test of different kind of data schemas. The
alternative data instances are generated by modifying a
provided original instance and, are used to reveal faults
that are possibily present in the schema under test. When
such possible faults are present in the schemas, failures
can occur in the application, since the faulty schema
permit that the application manipulates invalid or
incorrect data. Considering this fact, this work proposes
the use of ADIA to test of database applications in
different contexts. A validation experiment was
conducted with three real relational database
applications. The results show the applicability of the
approach and its ability to reveal faults, which are not
only associated to the tested schemas, but are also related
to the software application.
5.2.2. Inference Control in Statistical Databases:

An Improved Randomization Approach (121)
Jose Luis Garcia, Jeff Wilder, Ernst L. Leiss
(Department of Computer Science University of
Houston)
The problem of randomizing a statistical database is
important if one must to guarantee the privacy of the
information. We describe a new randomizing algorithm
that creates randomized statistical databases with
desirable properties. The randomization consists of
selecting a random element from a users query to be
removed before the result of that query is computed and
returned. Then we discuss the results of a simulation that
demonstrates the security of the resulting statistical
database. We show that queries from such randomized
databases remain statistically significant and that such a
database cannot be compromised regardless of the size or
number of queries posed. Given the relative simplicity
and equivalent effectiveness of this algorithm compared
to those established previously, we believe it to be a
better choice for database randomization.
5.2.3. Uma Arquitetura de Referncia Baseada

em Papis para Frameworks Transversais de
Persistncia: Uma Anlise Cuantitativa (346)
Rogrio Lazanha (Faculdade de Tecnologia de
Ourinhos (FATEC) Avenida Vitalina Marcusso, 1400 CEP 19.900-000 Ourinhos So Paulo - Brasil rolazanha@tdkom.com.br), Andr Luiz de Oliveira,
Rosngela Ap. D. Penteado, Valter Vieira de
Camargo
This paper presents a reference architecture for

developing or restructuring persistence Crosscutting
Frameworks (CF). The aim is that this architecture can be
used as reference to identify the main existing
subconcerns in persistence CFs, restructure existing CFs
and design new ones. The procedure used for elaborating
the architecture was submit an existing CF to a cyclical
process of evolutive maintenances where two versions
had been developed. To evaluate the proposal
architecture a set of metrics was used (separation of
concerns, coupling, cohesion and size) comparing the
first version of the CF with the last version. The results
had shown that the final version of the CF presented
better indices of separation of concerns, cohesion, size
and coupling.
5.2.4. Identificao de Emoes em Notcias

Curtas (219)
Barbara Martinazzo, Emerson Cabrera Paraiso
(Pontifcia Universidade Catlica do Paran PUCPR
Programa de Ps-Graduao em
Informtica CEP: 80.215-901, Curitiba, Paran,
Brasil - {b.martinazzo, paraiso}@ppgia.pucpr.br)
The automatic detection of emotions in texts has
presented significant results in several and different
situations. In this paper, we present an approach to
identify automatically emotions in short texts (basically,
news headlines and a brief description of it) written in
Portuguese. In the work presented here, we process each
text before the avatar reads it, in order to find the
emotions presented on it and to prepare the avatar to
behave according to the emotions found. Each text is
processed using an algorithm based on the Latent
Semantic Analysis theory.
REA TEMTICA: LENGUAJES,

MODELOS Y AMBIENTES DE
PROGRAMACIN (Viernes 22/10, 16:40-18:20 hs)
5.2.5. SeeIT 3D: un plugin de Eclipse para
visualizar y comprender cdigo fuente (354)
David Montao Ramrez , Jairo H. Aponte Melo
(Departamento de Ingeniera de Sistemas e Industrial
Universidad Nacional de Colombia - {dmontanor,
jhapontem}@unal.edu.co)
ste artculo presenta una herramienta de visualizacin
tridimensional de software llamada SeeIT 3D (Software
visualization Eclipse Integrated Tool 3D) que pretende
convertirse en un instrumento para los desarrolladores y
personas involucradas en el proceso de crear, entender y
mantener un sistema de software. El resultado es un
plugin de Eclipse que permite el anlisis bsico de cdigo
fuente y muestra los resultados al usuario nal en un
mundo tridimensional basado en la metfora de sv3D.
5.2.6. TIRT: Implementao e Avaliao (268)


Rodrigo Hbner, Anderson Faustino da Silva
(Universidade Estadual de Maring Departamento de
Informtica Avenida Colombo, 5790 - Bloco C56
Maring - Paran - Brasil)
This paper describes the parallel programming model
TIRT, which the main idea is to be a simple model and
deal effectively with issues of synchronization and
provide scalability. The results obtained during the
experimental evaluation showed that the model is
lightweight and it provides good results for programs that
require synchronization mechanisms.
5.2.7. Smart Sort, new stable sorting algorithm

(38)
Daniel Sampedro (Departamento de Tcnicas de

Programacin Fac. 9, Universidad de las Ciencias
Informticas (UCI). Carretera a San Antonio de los
Baos, km 2 , Boyeros, La Habana, Cuba. dsampedro@uci.cu)
Este trabajo presenta un nuevo algoritmo de
ordenamiento que basa parte de su funcionamiento en las
operaciones de mezcla de listas ordenadas, el cual no
solo mantiene la estabilidad, sino que adems disminuye
considerablemente el tiempo de ejecucin y la
complejidad temporal de otros algoritmos muy conocidos
tales como el Merge Sort. El procedimiento presentado,
saca provecho del orden inicial de los datos entregados
mediante la aplicacin de un patrn que garantizar la
agrupacin de todos los elementos en intervalos
ordenados, que posteriormente sern fusionados
recursivamente hasta lograr el propsito final. El tiempo
de ejecucin guardar una relacin inversamenteproporcional con la cantidad de elementos que se
encuentren inicialmente ordenados. El anlisis, la
implementacin y las pruebas que se realizaron de este
algoritmo, arrojaron resultados promisorios, que lo
ubican como una valiosa propuesta para la industria del
software.
5.2.8. Reavaliando a Lacuna do Desempenho

entre as Linguagens Java, C e C++ (287)
Juliano Henrique Foleiss, Anderson Faustino da
Silva
(Universidade Estadual
de
Maring
Departamento de Informtica Maring - Paran Brasil)
Ten years ago the performance gap between Java and C
reached 69,96% for scientific applications. Much work
has been done to boost Java performance since then.
Thus, this work aims to reevaluate that gap, and also to
evaluate the impact of the Java environments on the
underlying hardware. The reevaluation shows that Java
performance is now competitive with C and C++ being
on average only 22,22% slower, and in some cases it
even beats the other two. This shows that the language
implementation is what really dictates performance, not
the language specification.

Programa Clei 2010 v2

Transféré par

Informations du document

Copyright

Formats disponibles

Partager ce document

Partager ou intégrer le document

Options de partage

Avez-vous trouvé ce document utile ?

Ce contenu est-il inapproprié ?

Droits d'auteur :

Formats disponibles

Programa Clei 2010 v2

Transféré par

Droits d'auteur :

Formats disponibles

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 1

1.1.2. DevMeter: una Herramienta que mide la

1.1.3. Enfoque gil en el Modelo CMMI de

Las empresas necesitan de productos que estn alineados

1.1.4. Exavar: Anlisis de Variabilidad de

REA TEMTICA: INGENIERA DEL

Un reciente artculo del Communications del ACM se

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 2

1.1.6. Requisitos de Comportamiento Social para

1.1.7. Principios y criterios para evaluar y

Approach. Para ellos se proponen siete criterios de

1.1.8 Anlise dos Critrios de Segurana do

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 3

1.2.2. Um Mecanismo para Sensibilidade ao

1.2.3. Um Modelo de Matching Semntico

1.2.4. Servios Baseados em Localizao e

Mrcio Aparecido Inacio da Silva, Marcelo Augusto

construo desses sistemas enfrenta dificuldades pela

REA TEMTICA: SEGURIDAD Y

1.2.6. Um Servio de Gerenciamento Seguro de

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 4

1.2.8. Off-line Signature Verification: A Circular

Brasil - natalia@cos.ufrj.br), Ana Regina Rocha,

1.3.2. Sistemas Clasificadores en el Problema de

1.3.3. Razonamiento Multimodal en Sistemas

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 5

1.3.4. Sistemas de Recomendacin Multicriterio

1.3.6. Evolucin de Reglas de Clasificacin

Guido Acosta Galeano, Walter Amarilla Duarte,

REA TEMTICA: INTELIGENCIA

Martn Abente, Javier Martnez, Benjamn Barn

1.3.7. Modelagem de Bacias Hidrogrficas com

Felippe Alex Scheidt (Departamento de Computao,

1.3.8. Impacto de Recursos Lxicos Manuales y

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 6

2.1.2. Generacin Automtica de Casos de

The presented proposal intends to facilitate the task of

2.1.3. Diretrizes para Avaliao e

2.1.4. Modeling Aspect-oriented Software

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 7

distributed in its two components: OWL and Datalog

REA TEMTICA: ONTOLOGAS

2.1.7. Using Topic Ontologies and Semantic

19/10, 16:40-18:20 hs)

2.1.5. An Agent-based Ontology Evolution

2.1.6. Integrating OWL Ontologies and Rules: A

Ana G. Maguitman (Depto de Ciencias e Ingeniera

2.1.8. OntoGhobi: Meta Buscador Semntico que

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 8

2.2.1. Aprovisionamento de QoE e Handover

2.2.2. Clustering Dinmico para Tiempo de

la estacin base, evaluando el impacto de distintos

2.2.3. AJR-TFRC: Um Mecanismo para Controle

2.2.4. Desenvolvimento de equipamento remoto

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 9

REA TEMTICA: REDES Y

2.2.5. Reconfiguracin de Trfico Dinmico en

2.2.6. Asignacin ptima de Lightpath bajo

QoS: Un enfoque Multiobjetivos basado en MOEAs

2.2.7. Impacto dos Trfegos Multimdias em um

2.2.8. Uma Arquitetura com Suporte a Mdulos

Programa de la Conferencia Latinoamericana de Informtica - CLEI 2010 10

the user profile submodel is used to include the variables

2.3.3. Group-Ing: Herramienta para la