publications | Home Page - Dr. Alejandro Zunino

2023

DewMonitor: Dew Computing Monitoring System for Sustainable IoT

Amiya Karmakar, Pritam Ghosh, Matías Hirsch, Partha Sarathi Banerjee, Debashis De, Cristian Mateos, and Alejandro Zunino

In Dew Computing: The Sustainable IoT Perspectives, 2023

Abs Bib DOI

Modern wireless and mobile solutions are frequently referred to as the Internet of Things (IoT) applications. The development of cloud-based systems and technological advancements give rise to the concept of a networked, Internet-based, distributed processing site-based world. This paper explains the dew environment analysis and monitoring to ensure sustainability. This approach also discusses sustainable IoT solutions and provides an overview of the dew server’s organizational and operational structure. We outline the objectives, specifications, and performance of dew servers, another computational layer in the cloud-based architecture for Sustainable IoT solutions. The dew servers are examined rigorously from an operational and performance perspective as systems that, in addition to communicating with higher-level cloud servers, gather, process, and offload streaming data from IoT sensors and devices.
@incollection{Karmakar2024, author = {Karmakar, Amiya and Ghosh, Pritam and Hirsch, Mat{\'i}as and Banerjee, Partha Sarathi and De, Debashis and Mateos, Cristian and Zunino, Alejandro}, editor = {De, Debashis and Roy, Samarjit}, title = {DewMonitor: Dew Computing Monitoring System for Sustainable IoT}, booktitle = {Dew Computing: The Sustainable IoT Perspectives}, year = {2023}, publisher = {Springer Nature Singapore}, address = {Singapore}, pages = {61--78}, isbn = {978-981-99-4590-0}, doi = {10.1007/978-981-99-4590-0_3}, url = {https://doi.org/10.1007/978-981-99-4590-0_3} }
Speeding up Smartphone-Based Dew Computing: In Vivo Experiments Setup Via an Evolutionary Algorithm

Virginia Yannibelli, Matías Hirsch, Juan Toloza, Tim A. Majchrzak, Alejandro Zunino, and Cristian Mateos

Sensors, 2023

Abs Bib DOI

Dew computing aims to minimize the dependency on remote clouds by exploiting nearby nodes for solving non-trivial computational tasks, e.g., AI inferences. Nowadays, smartphones are good candidates for computing nodes; hence, smartphone clusters have been proposed to accomplish this task and load balancing is frequently a subject of research. Using the same real—i.e., in vivo—testbeds to evaluate different load balancing strategies based on energy utilization is challenging and time consuming. In principle, test repetition requires a platform to control battery charging periods between repetitions. Our Motrol hard-soft device has such a capability; however, it lacks a mechanism to assure and reduce the time in which all smartphone batteries reach the level required by the next test. We propose an evolutionary algorithm to execute smartphone battery (dis)charging plans to minimize test preparation time. Charging plans proposed by the algorithm include charging at different speeds, which is achieved by charging at maximum speed while exercising energy hungry components (the CPU and screen). To evaluate the algorithm, we use various charging/discharging battery traces of real smartphones and we compare the time-taken for our method to collectively prepare a set of smartphones versus that of individually (dis)charging all smartphones at maximum speed.
@article{s23031388, author = {Yannibelli, Virginia and Hirsch, Matías and Toloza, Juan and Majchrzak, Tim A. and Zunino, Alejandro and Mateos, Cristian}, title = {Speeding up Smartphone-Based Dew Computing: In Vivo Experiments Setup Via an Evolutionary Algorithm}, journal = {Sensors}, volume = {23}, year = {2023}, number = {3}, article-number = {1388}, url = {https://www.mdpi.com/1424-8220/23/3/1388}, pubmedid = {36772439}, issn = {1424-8220}, doi = {10.3390/s23031388} }

2022

A Simulation Scheduling Module to Improve User Experience in the Simugan Beef-Cattle Farm Simulator

Mauricio Arroqui, Juan Francisco Ferreira, Maximiliano Omar Roselli, Juan Rodriguez Alvarez, Claudio Fabian Machado, Cristian Mateos, and Alejandro Zunino

IEEE Latin America Transactions, 2022

Abs Bib DOI

At the Faculty of Veterinary Sciences of the National University of Central Buenos Aires a client-server Beef-Cattle Farm simulator called Simugan has been developed. Simugan allows users to experiment over a virtual farm in a simple and low cost way compared with real farm conditions. Users can submit single simulation scenarios or multiple simulation scenarios packaged in an experimentation, where each scenario is a complete farm configuration. This is a key feature important in farm research, but with the drawback that some users might experiment long wait times for simulation results because of the amount of simulations the underlying hardware architecture has to process. Consequently, an heuristic scheduler module was added to Simugan producing a more equitative use of computer resources and an improvement of 41% in users flow time, a popular metric to quantify how much time user simulations spend in the back end and hence a way of measuring deviations in users waiting times.
@article{9662185, author = {Arroqui, Mauricio and Ferreira, Juan Francisco and Roselli, Maximiliano Omar and Alvarez, Juan Rodriguez and Machado, Claudio Fabian and Mateos, Cristian and Zunino, Alejandro}, journal = {IEEE Latin America Transactions}, title = {A Simulation Scheduling Module to Improve User Experience in the Simugan Beef-Cattle Farm Simulator}, year = {2022}, volume = {20}, number = {1}, pages = {162-170}, doi = {10.1109/TLA.2022.9662185} }
LiveDewStream: A stream processing platform for running in-lab distributed deep learning inferences on smartphone clusters at the edge

C. Mateos, M. Hirsch, J. Toloza, and A. Zunino

SoftwareX, 2022

Abs Bib DOI

Dew computing, an evolution of Fog computing, aims at fulfilling computing needs, such as deep learning applied to object classification, close to where data is originated and using computing resources that include consumer electronic devices such as smartphones. Simulation tools like DewSim aid the study of resource allocation mechanisms for exploiting clusters of smartphones, however, there is a gap w.r.t software tools that allow to perform similar studies over real Dew computing testbeds. We have developed LiveDewStream, an open source project to model executable tasks derived from data streams to be run on real smartphone clusters. The project offers a key functionality missing in other tools: reproducibility of battery-driven Dew experiments. Our major contribution is to provide the community a common in vivo platform to study best-performing allocation mechanisms under different stream processing scenarios and/or deep learning inference models.
@article{Mateos2022:liveDewStream, author = {Mateos, C. and Hirsch, M. and Toloza, J. and Zunino, A.}, title = {LiveDewStream: A stream processing platform for running in-lab distributed deep learning inferences on smartphone clusters at the edge}, journal = {SoftwareX}, year = {2022}, volume = {}, number = {}, doi = {10.1016/j.softx.2022.101268} }
Motrol: A hardware-software device for batch benchmarking and profiling of in-lab mobile device clusters

J. Toloza, M. Hirsch, C. Mateos, and A. Zunino

HardwareX, 2022

Abs Bib DOI

Motrol is a simple device that satisfies functional requirements necessary for the automatic execution of battery-driven tests and profiling of connected mobile devices. It is specifically a hardware/software platform that allows Dew Computing researchers and developers to automate performance tests on Android-based smartphones. The hardware is based on a NodeMCU Esp8266 microcontroller that runs a firmware for managing the outputs. This software allows enabling/disabling the relays that connect the sockets that power the chargers of up to 4 mobile devices minimizing the need for human intervention. The firmware runs a web server that serves Rest requests from a Rest client with the commands to drive the digital outputs. These digital outputs activate or deactivate the relays to allow current to pass or not to the sockets. Such capability is essential to automate the study of battery behavior on battery-driven devices such as smartphones. Motrol is easy to assemble, knowledge in electronics or programming languages is not necessary, it is constructed with open hardware, and it is cheap, being its total cost ∼USD 30
@article{Toloza2022:motrol, author = {Toloza, J. and Hirsch, M. and Mateos, C. and Zunino, A.}, title = {Motrol: A hardware-software device for batch benchmarking and profiling of in-lab mobile device clusters}, journal = {HardwareX}, year = {2022}, volume = {}, number = {}, doi = {10.1016/j.ohx.2022.e00340} }

2021

Comparacion de la Calidad de Vida en la Argentina en Escala Censal y Departamental a Partir del Diseño de una Aplicacion Web

Juan Celemin, Guillermo Velázquez, Alejandro Zunino, Cristian Mateos, Matias Hirsch, and Juan Manuel Rodríguez

Para Onde!?, 2021

Abs Bib DOI

La geografía permite realizar un estudio empírico de la calidad de vida a partir de la elaboración de índices con su correspondiente representación cartográfica, apoyándose principalmente en Sistemas de Información Geográfica. En este marco, el trabajo propone dos objetivos principales: poner a disposición mapas en línea de un índice de calidad de vida desagregado a la mayor escala espacial disponible (radio censal) en formatos Web y Móvil, desde un enfoque interdisciplinario, y posteriormente realizar una resume el análisis espacial del índice y muestra su diferencia con el mismo índice aplicado a nivel departamental, destacando la importancia del Problema de Unidad Modificable en la interpretación de los resultados.
@article{celemin2021:icv, author = {Celemin, Juan and Velázquez, Guillermo and Zunino, Alejandro and Mateos, Cristian and Hirsch, Matias and Rodríguez, Juan Manuel}, title = {Comparacion de la Calidad de Vida en la Argentina en Escala Censal y Departamental a Partir del Diseño de una Aplicacion Web}, journal = {Para Onde!?}, volume = {15}, number = {1}, year = {2021}, keywords = {Calidad de vida; Aplicación Web; Índice; Problema de la Unidad Espacial Modificable}, issn = {1982-0003}, pages = {135--151}, doi = {10.22456/1982-0003.116466}, url = {https://www.seer.ufrgs.br/paraonde/article/view/116466} }
A Simulation Scheduling Module to Improve User Experience in the Simugan Beef-Cattle Farm Simulator

Mauricio Arroqui, Juan Francisco Ferreira, Maximiliano Omar Roselli, Juan Rodriguez Alvarez, Claudio Fabian Machado, Cristian Mateos, and Alejandro Zunino

IEEE Latin America Transactions, Sep 2021

Abs Bib

At the Faculty of Veterinary Sciences of the National University of Central Buenos Aires a client-server Beef-Cattle Farm simulator called Simugan has been developed. Simugan allows users to experiment over a virtual farm in a simple and low cost way compared with real farm conditions. Users can submit single simulation scenarios or multiple simulation scenarios packaged in an experimentation, where each scenario is a complete farm configuration. This is a key feature important in farm research, but with the drawback that some users might experiment long wait times for simulation results because of the amount of simulations the underlying hardware architecture has to process. Consequently, an heuristic scheduler module was added to Simugan producing a more equitative use of computer resources and an improvement of 41 % in users flow time, a popular metric to quantify how much time user simulations spend in the back end and hence a way of measuring deviations in user’s waiting times
@article{Arroqui2021:simugan, title = {A Simulation Scheduling Module to Improve User Experience in the Simugan Beef-Cattle Farm Simulator}, volume = {100}, url = {https://latamt.ieeer9.org/index.php/transactions/article/view/5351}, number = {XXX}, journal = {IEEE Latin America Transactions}, author = {Arroqui, Mauricio and Ferreira, Juan Francisco and Roselli, Maximiliano Omar and Alvarez, Juan Rodriguez and Machado, Claudio Fabian and Mateos, Cristian and Zunino, Alejandro}, year = {2021}, month = sep }
A Task Execution Scheme for Dew Computing with State-of-the-Art Smartphones

M. Hirsch, C. Mateos, A. Zunino, T. Majchrzak, T-M Grønli, and H. Kaindl

Electronics, Sep 2021

Abs Bib DOI

The computing resources of today’s smartphones are underutilized most of the time. Using these resources could be highly beneficial in edge computing and fog computing contexts, for example, to support urban services for citizens. However, new challenges, especially regarding job scheduling, arise. Smartphones may form ad hoc networks, but individual devices highly differ in computational capabilities and (tolerable) energy usage. We take into account these particularities to validate a task execution scheme that relies on the computing power that clusters of mobile devices could provide. In this paper, we expand the study of several practical heuristics for job scheduling including execution scenarios with state-of-the-art smartphones. With the results of new simulated scenarios, we confirm previous findings and better comprehend the baseline approaches already proposed for the problem. This study also sheds some light on the capabilities of small-sized clusters comprising mid-range and low-end smartphones when the objective is to achieve real-time stream processing using Tensorflow object recognition models as edge jobs. Ultimately, we strive for industry applications to improve task scheduling for dew computing contexts. Heuristics such as ours plus supporting dew middleware could improve citizen participation by allowing a much wider use of dew computing resources, especially in urban contexts in order to help build smart cities
@article{Hirsch2021:dew, title = {A Task Execution Scheme for Dew Computing with State-of-the-Art Smartphones}, journal = {Electronics}, author = {Hirsch, M. and Mateos, C. and Zunino, A. and Majchrzak, T. and Grønli, T-M and Kaindl, H.}, volume = {10}, number = {16}, year = {2021}, issn = {2079-9292}, doi = {https://doi.org/10.3390/electronics10162006}, url = {https://www.mdpi.com/2079-9292/10/16/2006}, keywords = {dew computing; edge computing; smartphone; job scheduling; scheduling heuristics} }
A platform for automating battery-driven batch benchmarking and profiling of Android-based mobile devices

Matías Hirsch, Cristian Mateos, Alejandro Zunino, and Juan Toloza

Simulation Modelling Practice and Theory, Sep 2021

Abs Bib DOI

In-laboratory mobile device data gathering is useful to support fields of study that rely on data derived from mobile devices as elementary research input. Particularly, Dew Computing, a sub-area of mobile distributed computing, aims at scavenging idle computing resources from mobile devices at the edge. To produce repeatable experiments for developed Dew approaches, simulation of relevant mobile device aspects is an acceptable practice, being battery behavior one of such aspects. Our recently-proposed DewSim simulation toolkit uses a trace-based approach to model battery behavior realistically. However, to generically characterize the impact of different device components – e.g., CPU at different usages – on battery behavior, it is necessary to easily capture battery traces, and run benchmarks to quantify computing capabilities. Considering that traces are captured during long charging or discharging cycles, such data gathering duty is tedious and time-consuming and no tool has been proposed yet to automate it. To fill this gap, we propose a platform that leverages common IoT hardware to control battery state of devices subject to pre-configured profiling/benchmarking plans. The platform has a server-side component to manage benchmark/profiling executions using one out of two possible operation modes (exclusive or shared), and an extensible Android application that implements the benchmark and profiling logic to be run on devices. We conclude that the operation modes represent a clear trade-off between benchmark/profile execution time and IoT hardware cost. From validation experiments, we also conclude that using our platform to run a benchmark does not introduce a considerable performance and energy footprint compared to running the same benchmark as a plain Android application.
@article{Hirsch2021:sim, title = {A platform for automating battery-driven batch benchmarking and profiling of Android-based mobile devices}, journal = {Simulation Modelling Practice and Theory}, volume = {109}, pages = {102266}, year = {2021}, issn = {1569-190X}, doi = {https://doi.org/10.1016/j.simpat.2020.102266}, url = {https://www.sciencedirect.com/science/article/pii/S1569190X20301933}, author = {Hirsch, Matías and Mateos, Cristian and Zunino, Alejandro and Toloza, Juan}, keywords = {Mobile devices, Benchmarking, Profiling, Battery traces, DewSim, Dew Computing, Android} }
New Heuristics for Scheduling and Distributing Jobs under Hybrid Dew Computing Environments

P. Sanabria, T.F. Tapia, A. Neyem, J.I. Benedetto, M. Hirsch, C. Mateos, and A. Zunino

Wireless Communications and Mobile Computing, Sep 2021

Abs Bib DOI

Mobile grid computing has been a popular topic for researchers due to mobile and IoT devices’ ubiquity and their evergrowing processing potential. While many scheduling algorithms for harnessing these resources exist in the literature for standard grid computing scenarios, surprisingly, there is little insight into this matter in the context of hybrid-powered computing resources, typically found in Dew and Edge computing environments. This paper proposes new algorithms aware of devices’ power source for scheduling tasks in hybrid environments, i.e., where the battery- and non-battery-powered devices cooperate. We simulated hybrid Dew/Edge environments by extending DewSim, a simulator that models battery-driven devices’ battery behavior using battery traces profiled from real mobile devices. We compared the throughput and job completion achieved by algorithms proposed in this paper using as a baseline a previously developed algorithm that considers computing resources but only from battery-dependent devices called Enhanced Simple Energy-Aware Schedule (E-SEAS). The obtained results in the simulation reveal that our proposed algorithms can obtain up to a 90% increment in overall throughput and around 95% of completed jobs in hybrid environments compared to E-SEAS. Finally, we show that incorporating these characteristics gives more awareness of the type of resources present and can enable the algorithms to manage resources more efficiently in more hybrid environments than other algorithms found in the literature.
@article{Tapia2021, author = {Sanabria, P. and Tapia, T.F. and Neyem, A. and Benedetto, J.I. and Hirsch, M. and Mateos, C. and Zunino, A.}, title = {New Heuristics for Scheduling and Distributing Jobs under Hybrid Dew Computing Environments}, selected = true, journal = {Wireless Communications and Mobile Computing}, year = {2021}, volume = {2021}, doi = {10.1155/2021/8899660}, art_number = {8899660}, url = {https://www.hindawi.com/journals/wcmc/2021/8899660/}, author_keywords = {Dew Computing; Edge Computing; Mobile Devices; Job Scheduling; Scheduling Heuristics}, document_type = {Article} }
A Simulation-based Performance Evaluation of Heuristics for Dew Computing

M. Hirsch, C. Mateos, A. Zunino, T. Majchrzak, T-M Grønli, and H. Kaindl

In Proceedings - Hawaii International Conference on System Sciences, HICSS, Sep 2021

Abs Bib

The evolution of smartphones allows the continuous exploitation of computing resources. This increasingly applies also to distributed environments as exemplified through utilization of network router loads in edge computing and fog computing. Combining cloud computing and mobile smart devices in dew computing contexts enables new techniques for resource utilization, data collection and data processing. However, new challenges regarding job scheduling arise. Smartphones may be used in ad-hoc networks in this context, but their heterogeneity and energy usage must be considered. We propose novel heuristics for performance measuring of distributed computing systems integrated with mobile devices and compare them with previous heuristics in a simulation environment. Our results show an overall improvement in job completion and load balancing metrics compared to previous approaches. They highlight the usefulness of pursuing this research stream for aiming at industrial implementation and evaluation
@inproceedings{Hirsch2020:HICSS, author = {Hirsch, M. and Mateos, C. and Zunino, A. and Majchrzak, T. and Grønli, T-M and Kaindl, H.}, title = {A Simulation-based Performance Evaluation of Heuristics for Dew Computing}, booktitle = {Proceedings - Hawaii International Conference on System Sciences, HICSS}, year = {2021}, url = {http://hdl.handle.net/10125/71489}, author_keywords = {Dew Computing; Edge Computing; Mobile Devices; Job Scheduling; Scheduling Heuristics}, document_type = {Conference Paper} }

2020

Evaluating the performance of three popular web mapping libraries: A case study using Argentina’s life quality index

A. Zunino, G. Velázquez, J.P. Celemín, C. Mateos, M. Hirsch, and J.M. Rodriguez

ISPRS International Journal of Geo-Information, Sep 2020

Abs Bib DOI

Recent Web technologies such as HTML5, JavaScript, and WebGL have enabled powerful and highly dynamicWeb mapping applications executing on standard Web browsers. Despite the complexity for developing such applications has been greatly reduced by Web mapping libraries, developers face many choices to achieve optimal performance and network usage. This scenario is even more complex when considering different representations of geographical data (raster, raw data or vector) and variety of devices (tablets, smartphones, and personal computers). This paper compares the performance and network usage of three popular JavaScript Web mapping libraries for implementing a Web map using different representations for geodata, and executing on different devices. In the experiments, Mapbox GL JS achieved the best overall performance on mid and high end devices for displaying raster or vector maps, while OpenLayers was the best for raster maps on all devices. Vector-based maps are a safe bet for newWeb maps, since performance is on par with raster maps on mid-end smartphones, with significant less network bandwidth requirements. © 2020 by the authors.
@article{Zunino2020, author = {Zunino, A. and Velázquez, G. and Celemín, J.P. and Mateos, C. and Hirsch, M. and Rodriguez, J.M.}, title = {Evaluating the performance of three popular web mapping libraries: A case study using Argentina's life quality index}, selected = true, journal = {ISPRS International Journal of Geo-Information}, year = {2020}, volume = {9}, number = {10}, doi = {10.3390/ijgi9100563}, art_number = {563}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85092369315&doi=10.3390%2fijgi9100563&partnerID=40&md5=92b64cdf566bfd5504da806224b441fc}, affiliation = {ISISTAN-UNCPBA, CONICET, Tandil, Buenos Aires, B7001BBO, Argentina; IGEHCS-UNCPBA, CONICET, Tandil, Buenos Aires, B7001BBO, Argentina}, author_keywords = {Mobile applications; Performance test; Raster; Software development; Tiles; Vector; Web map}, document_type = {Article}, source = {Scopus} }
Discovering web services in social web service repositories using deep variational autoencoders

I. Lizarralde, C. Mateos, A. Zunino, T.A. Majchrzak, and T.-M. Grønli

Information Processing and Management, Sep 2020

Abs Bib DOI

Web Service registries have progressively evolved to social networks-like software repositories. Users cooperate to produce an ever-growing, rich source of Web APIs upon which new value-added Web applications can be built. Such users often interact in order to follow, comment on, consume and compose services published by other users. In this context, Web Service discovery is a core functionality of modern registries as needed Web Services must be discovered before being consumed or composed. Many efforts to provide effective keyword-based service discovery mechanisms are based on Information Retrieval techniques as services are described using structured or unstructured textdocuments that specify the provided functionality. However, traditional techniques suffer from term-mismatch, which means that only the terms that are contained in both user queries and descriptions are exploited to perform service retrieval. Early feature learning techniques such as LSA or LDA tried to solve this problem by finding hidden or latent features in text documents. Recently, alternative feature learning based techniques such as Word Embeddings achieved state of the art results for Web Service discovery. In this paper, we propose to learn features from service descriptions by using Variational Autoencoders, a special kind of autoencoder which restricts the encoded representation to model latent variables. Autoencoders in turn are deep neural networks used for unsupervised learning of efficient codings. We train our autoencoder using a real 17 113-service dataset extracted from the ProgrammableWeb.com API social repository. We measure discovery efficacy by using both Recall and Precision metrics, achieving significant gains compared to both Word Embeddings and classic latent features modelling techniques. Also, performance-oriented experiments show that the proposed approach can be readily exploited in practice. © 2020 Elsevier Ltd
@article{Lizarralde2020, author = {Lizarralde, I. and Mateos, C. and Zunino, A. and Majchrzak, T.A. and Grønli, T.-M.}, title = {Discovering web services in social web service repositories using deep variational autoencoders}, journal = {Information Processing and Management}, year = {2020}, selected = true, volume = {57}, number = {4}, doi = {10.1016/j.ipm.2020.102231}, art_number = {102231}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081050739&doi=10.1016%2fj.ipm.2020.102231&partnerID=40&md5=702723e0087f43da1688ffac33d21964}, affiliation = {ISISTAN – UNICEN – CONICET. Tandil, Buenos Aires, Argentina; University of Agder, Kristiansand, Norway; Kristiania University College, Oslo, Norway}, author_keywords = {Deep neural network; Service discovery; Service-oriented computing; Variational autoencoder; Web Services}, document_type = {Article}, source = {Scopus} }

Sharpening the edge: Towards improved edge computing environment for mobile and IoT applications

C. Mateos, K.-K.R. Choo, and A. Zunino

Future Generation Computer Systems, Sep 2020

Bib DOI

@article{Diaz20201130,
  author = {Mateos, C. and Choo, K.-K.R. and Zunino, A.},
  title = {Sharpening the edge: Towards improved edge computing environment for mobile and IoT applications},
  journal = {Future Generation Computer Systems},
  year = {2020},
  selected = true,
  volume = {107},
  pages = {1130-1133},
  doi = {10.1016/j.future.2019.06.017},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85081951811&doi=10.1016%2fj.future.2019.06.017&partnerID=40&md5=29450115c1617c538c14b0db2d1714c5},
  affiliation = {Department of Computer Science, Faculty of Exact Sciences, UNICEN University, Argentina; Department of Information Systems and Cyber Security, University of Texas at San Antonio, San Antonio, TX  78249-0631, United States; Department of Computer Science, Faculty of Exact Sciences, UNICEN University, Argentina},
  document_type = {Editorial},
  source = {Scopus}
}

DewSim: A trace-driven toolkit for simulating mobile device clusters in Dew computing environments

M. Hirsch, C. Mateos, J.M. Rodriguez, and A. Zunino

Software - Practice and Experience, Sep 2020

Abs Bib DOI

Dew computing is an emerging computing paradigm, which aims at minimizing the dependency over existing internetwork back-haul, ie, being dependent on processing resources offered by remote servers. Smartphones and tablets ubiquity and powerful computing hardware motivated researchers to investigate the way of providing Dew computing services by exploiting the aggregated capabilities of devices in a vicinity, a smart device cluster. Consequently, research on resource management is necessary to learn how to scavenge resources from such a cluster, deal with devices heterogeneity, limitations, and dynamic resource availability. Simulation is commonly practiced for studying resource management in other distributed computing research fields, specially due to the complexity involved in the set up of experiments. However, a free-to-use purpose specific toolkit for studying smart device clusters do not exist or have been documented. Current simulation efforts do not allow researchers to faithfully represent key singularities of such environment, which are energy depletion and nondedicated nature of computing resources. We propose a trace-based toolkit built on modular software artifacts to speed up research in resource management techniques in Dew environments. A trace-driven methodology is adopted to assure practical value of simulated scenarios. The toolkit comprises a device profiler application for Android to capture generic battery and CPU traces from real devices, a profile mixer to create user interaction baseline traces through generic ones, and an extensible engine to simulate the execution of workloads configurable via text files. Verification and validation tests were run to show correctness and reliability of our simulation approach. © 2019 John Wiley & Sons, Ltd.
@article{Hirsch2020688, author = {Hirsch, M. and Mateos, C. and Rodriguez, J.M. and Zunino, A.}, title = {DewSim: A trace-driven toolkit for simulating mobile device clusters in Dew computing environments}, journal = {Software - Practice and Experience}, year = {2020}, selected = true, volume = {50}, number = {5}, pages = {688-718}, doi = {10.1002/spe.2696}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85065026635&doi=10.1002%2fspe.2696&partnerID=40&md5=f3301161166e418d3c725b84bea5f5b9}, affiliation = {Campus Universitario, ISISTAN-UNCPBA-CONICET, Tandil, Argentina}, author_keywords = {android; battery-aware resource management policy; discrete event simulation; edge computing; mobile devices; trace-based}, document_type = {Conference Paper}, source = {Scopus} }
An Analysis of Distributed Programming Models and Frameworks for Large-scale Graph Processing

A. Corbellini, D. Godoy, C. Mateos, S. Schiaffino, and A. Zunino

IETE Journal of Research, Sep 2020

Abs Bib DOI

In recent years, processing and analysing large graphs has become a major need in many research areas. Distributed graph processing programming models and frameworks arised as a natural solution to process linked data of large volumes, such as data originating from social media. These solutions are distributed by design and help developers to perform operations on the graph, sometimes reaching almost real-time performance even on huge graphs. Some of the available graph processing frameworks exploit generic data processing models, like MapReduce, while others were specifically built for graph processing, introducing techniques such as vertex or edge partitioning and graph-oriented programming models. In this work, we analyse the properties of recent and widely popular frameworks–from the perspective of the adopted programming model–designed to process large-scale graphs with the goal of assisting software developers/designers in choosing the most adequate tool. © 2020, © 2020 IETE.
@article{Corbellini2020, author = {Corbellini, A. and Godoy, D. and Mateos, C. and Schiaffino, S. and Zunino, A.}, title = {An Analysis of Distributed Programming Models and Frameworks for Large-scale Graph Processing}, journal = {IETE Journal of Research}, year = {2020}, doi = {10.1080/03772063.2020.1754139}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85084290000&doi=10.1080%2f03772063.2020.1754139&partnerID=40&md5=58268a73a80d90c0b2384788266b5030}, affiliation = {ISISTAN-CONICET, UNICEN, Tandil, Buenos Aires, Argentina}, author_keywords = {Distributed graph-processing frameworks; Large-scale graphs; Programming models}, document_type = {Review}, source = {Scopus} }

2019

A performance comparison of heuristics for scheduling jobs in hybrid mobile topologies

P. Sanabria, T.F. Tapia, J.I. Benedetto, M. Hirsch, C. Mateos, and A. Zunino

In Proceedings - International Conference of the Chilean Computer Science Society, SCCC, Sep 2019

Abs Bib DOI

Hardware improvements of mobile devices have allowed them to be considered as first-class resources at the edge, which has led to the need to propose new techniques and scheduling heuristics to make efficient usage of these devices. Current scheduling heuristics available in the literature do not take into account mobile grid nodes that do not rely on batteries to work, a factor that is of great importance in the advent of mobile-edge computing. In this paper we propose a simple algorithm that incorporates a more advanced awareness of a mobile device’s power supply and we show that incorporating this characteristic can enable these heuristics to manage edge resources in a more efficient way. © 2019 IEEE.

@inproceedings{Sanabria2019,
  author = {Sanabria, P. and Tapia, T.F. and Benedetto, J.I. and Hirsch, M. and Mateos, C. and Zunino, A.},
  title = {A performance comparison of heuristics for scheduling jobs in hybrid mobile topologies},
  booktitle = {Proceedings - International Conference of the Chilean Computer Science Society, SCCC},
  year = {2019},
  volume = {2019-November},
  doi = {10.1109/SCCC49216.2019.8966417},
  art_number = {8966417},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85078881257&doi=10.1109%2fSCCC49216.2019.8966417&partnerID=40&md5=935531032e3c25bc49140c10331195d3},
  affiliation = {Pontificia Universidad Católica, Department of Computer Science, Santiago, Chile; ISISTAN Research Institute, CONICET, UNICEN, Buenos Aires, Argentina},
  author_keywords = {Dew Computing;  Edge Computing;  Mobile Computing;  Scheduling algorithm heuristics},
  document_type = {Conference Paper},
  source = {Scopus}
}

Reducing energy usage in resource-intensive java-based scientific applications via micro-benchmark based code refactorings

M. Longo, A. Rodríguez, C. Mateos, and A. Zunino

Computer Science and Information Systems, Sep 2019

Abs Bib DOI

In-silico research has grown considerably. Today’s scientific code involves long-running computer simulations and hence powerful computing infrastructures are needed. Traditionally, research in high-performance computing has focused on executing code as fast as possible, while energy has been recently recognized as another goal to consider. Yet, energy-driven research has mostly focused on the hardware and middleware layers, but few efforts target the application level, where many energy-aware optimizations are possible. We revisit a catalog of Java primitives commonly used in OO scientific programming, or micro-benchmarks, to identify energy-friendly versions of the same primitive. We then apply the micro-benchmarks to classical scientific application kernels and machine learning algorithms for both single-thread and multi-thread implementations on a server. Energy usage reductions at the micro-benchmark level are substantial, while for applications obtained reductions range from 3.90% to 99.18%. © 2019, ComSIS Consortium. All rights reserved.
@article{Longo2019541, author = {Longo, M. and Rodríguez, A. and Mateos, C. and Zunino, A.}, title = {Reducing energy usage in resource-intensive java-based scientific applications via micro-benchmark based code refactorings}, journal = {Computer Science and Information Systems}, year = {2019}, volume = {16}, number = {2}, pages = {541-561}, doi = {10.2298/CSIS180608009L}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85071275038&doi=10.2298%2fCSIS180608009L&partnerID=40&md5=f3be937816bc4495c4474cb8f7a0f862}, affiliation = {University of Southern California, 1337 1/2 W Adams Blvd, Los Angeles, 90007, United States; ISISTAN-CONICET-UNICEN, Campus Universitario, Tandil, B7001BBO, Argentina}, author_keywords = {Code refactoring; Energy; Java; Micro-benchmarks; Scientific application}, document_type = {Article}, source = {Scopus} }
Exploiting named entity recognition for improving syntactic-based web service discovery

I. Lizarralde, C. Mateos, J.M. Rodriguez, and A. Zunino

Journal of Information Science, Sep 2019

Abs Bib DOI

Web Services have become essential to the software industry as they represent reusable, remotely accessible functionality and data. Since Web Services must be discovered before being consumed, many discovery approaches applying classic Information Retrieval techniques, which store and process textual service descriptions, have arisen. These efforts are affected by term mismatch: a description relevant to a query can be retrieved only if they share many words. We present an approach to improve Web Service discoverability that automatically augments Web Service descriptions and can be used on top of such existing syntactic-based approaches. We exploit Named Entity Recognition to identify entities in descriptions and expand them with information from public text corpora, for example, Wikidata, mitigating term mismatch since it exploits both synonyms and hypernyms. We evaluated our approach together with classical syntactic-based service discovery approaches using a real 1274-service dataset, achieving up to 15.06% better Recall scores, and up to 17% Precision-at-1, 8% Precision-at-2 and 4% Precision-at-3. © The Author(s) 2018.
@article{Lizarralde2019398, author = {Lizarralde, I. and Mateos, C. and Rodriguez, J.M. and Zunino, A.}, title = {Exploiting named entity recognition for improving syntactic-based web service discovery}, journal = {Journal of Information Science}, year = {2019}, volume = {45}, number = {3}, pages = {398-415}, doi = {10.1177/0165551518793321}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85052583707&doi=10.1177%2f0165551518793321&partnerID=40&md5=28aeda9517f017a1fc27c6c4d2285ba3}, affiliation = {ISISTAN-CONICET-UNICEN, Tandil, Argentina}, author_keywords = {Information retrieval; named entity recognition; natural language processing; service-oriented computing; web Services}, document_type = {Article}, source = {Scopus} }
A family of heuristic search algorithms for feature model optimization

L.E. Sánchez, J.A. Diaz-Pace, and A. Zunino

Science of Computer Programming, Sep 2019

Abs Bib DOI

Feature models are a well-known formalism for capturing variability, commonalities and configuration rules of software systems. These models are a compact representation of the set of products in a software product line or configurations of a system at runtime, in terms of features and logical relationships among them. The feature model optimization problem consists of selecting a valid product from the model that satisfies a set of resource or business restrictions and optimizes an objective function commonly related to user preferences. This problem, although computationally intractable, has been addressed in several works with different algorithms. However, these approaches appeal to simplifications of the problem or present drawbacks that limit their application. For example, several approaches do not contemplate feature interactions, and some of them do not guarantee exact solutions or even valid solutions satisfying complex constraints. In this article, we propose a novel algorithm called CSA that overcomes the performance and common weaknesses of existing approaches. CSA can be parameterized with a set of classic search strategies (Backtracking, Branch & Bound, and Best-First Search) and heuristics that allow us to leverage solution optimality and search efficiency. This makes CSA appropriate for automating decisions both at design-time, where exact solutions are generally required, and at run-time, where selection must be done efficiently but sub-optimal solutions are acceptable. The algorithm supports different formats of objective functions, including multi-linear polynomial functions that are capable of representing feature interactions. We present an analysis to validate algorithm properties, and then a series of experiments with synthetic and real models to empirically compare CSA with existing alternatives to show the benefits of our approach. In our analysis, CSA showed to be complete, exact, and scalable for searching approximate solutions. The empirical results showed that the approximate variant of CSA can reach an optimality degree of 99%, against a 84% and 93% reached by other approximate alternatives based on genetic and greedy algorithms respectively. In terms of response time, CSA performed a 72% better than other approximate algorithms. Compared to other exact approaches, CSA improves response time on specific problem types. Furthermore, CSA was evaluated with problem instances involving feature interactions, showing that performance properties scale properly when the number of feature interactions increases. © 2018 Elsevier B.V.
@article{Sánchez2019264, author = {Sánchez, L.E. and Diaz-Pace, J.A. and Zunino, A.}, title = {A family of heuristic search algorithms for feature model optimization}, journal = {Science of Computer Programming}, year = {2019}, volume = {172}, pages = {264-293}, doi = {10.1016/j.scico.2018.12.002}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85059176951&doi=10.1016%2fj.scico.2018.12.002&partnerID=40&md5=067312c0e297ab7c0eabc9a9ea58ca3e}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, Argentina}, author_keywords = {Feature modeling; Heuristic search; Optimization; Search-based software engineering; Software product line}, document_type = {Article}, source = {Scopus} }
Estimating body condition score in dairy cows from depth images using convolutional neural networks, transfer learning and model ensembling techniques

J.R. Alvarez, M. Arroqui, P. Mangudo, J. Toloza, D. Jatip, J.M. Rodriguez, A. Teyseyre, C. Sanz, A. Zunino, C. Machado, and 1 more author

Agronomy, Sep 2019

Abs Bib DOI

BCS (Body Condition Score) is a method to estimate body fat reserves and accumulated energy balance of cows, placing estimations (or BCS values) in a scale of 1 to 5. Periodically rating BCS of dairy cows is very important since BCS values are associated with milk production, reproduction, and health of cows. However, in practice, obtaining BCS values is a time-consuming and subjective task performed visually by expert scorers. There have been several efforts to automate BCS of dairy cows by using image analysis and machine learning techniques. In a previous work, an automatic system to estimate BCS values was proposed, which is based on Convolutional Neural Networks (CNNs). In this paper we significantly extend the techniques exploited by that system via using transfer learning and ensemble modeling techniques to further improve BCS estimation accuracy. The improved system has achieved good estimations results in comparison with the base system. Overall accuracy of BCS estimations within 0.25 units of difference from true values has increased 4% (up to 82%), while overall accuracy within 0.50 units has increased 3% (up to 97%). © 2019 Iranian Fisheries Research Organization. All Rights Reserved.
@article{Alvarez2019, author = {Alvarez, J.R. and Arroqui, M. and Mangudo, P. and Toloza, J. and Jatip, D. and Rodriguez, J.M. and Teyseyre, A. and Sanz, C. and Zunino, A. and Machado, C. and Mateos, C.}, title = {Estimating body condition score in dairy cows from depth images using convolutional neural networks, transfer learning and model ensembling techniques}, journal = {Agronomy}, year = {2019}, volume = {9}, number = {2}, doi = {10.3390/agronomy9020090}, art_number = {90 c 2018 by the authors}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85061873283&doi=10.3390%2fagronomy9020090&partnerID=40&md5=1df3adaf380d66058959c16ca59ef85d}, affiliation = {CIVETAN (Facultad de Ciencias Veterinarias—UNCPBA, CICPBA and CONICET), UNICEN University, Tandil, B7001BBO, Argentina; D-TEC—Agencia Nacional de Promoción Científica y Tecnológica (ANPCyT), CABAC1425FQD, Argentina; ISISTAN-CONICET, UNICEN University, Tandil, B7001BBO, Argentina; Facultad de Ciencias Veterinarias, UNICEN University, Tandil, B7001BBO, Argentina; ISISTAN-UNICEN-CONICET, UNICEN University, Campus Universitario, Tandil B7001BBO, Buenos Aires, Argentina}, author_keywords = {Body Condition Score; Convolutional neural networks; Image analysis; Model ensembling; Precision livestock; Transfer learning}, document_type = {Article}, source = {Scopus} }
COBOL systems migration to SOA: Assessing antipatterns and complexity

C. Mateos, A. Zunino, A. Flores, and S. Misra

Information Technology and Control, Sep 2019

Abs Bib DOI

SOA and Web Services allow users to easily expose business functions to build larger distributed systems. However, legacy systems - mostly in COBOL - are left aside unless applying a migration approach. The main approaches are direct and indirect migration. The former implies wrapping COBOL programs with a thin layer of a Web Service oriented language/platform. The latter needs reengineering COBOL functions to a modern language/ platform. In our previous work, we presented an intermediate approach based on direct migration where developed Web Services are later refactored to improve the quality of their interfaces. Refactorings mainly capture good practices inherent to indirect migration. For this, antipatterns for WSDL documents (common bad practices) are detected to prevent issues related to WSDLs understanding and discoverability. In this paper, we assess antipatterns of Web Services’ WSDL documents generated upon the three migration approaches. In addition, generated Web Services’ interfaces are measured in complexity to attend both comprehension and interoperability. We apply a metric suite (by Baski & Misra) to measure complexity on services interfaces - i.e., WSDL documents. Migrations of two real COBOL systems upon the three approaches were assessed on antipatterns evidences and the complexity level of the generated SOA frontiers - a total of 431 WSDL documents. © 2019, Kauno Technologijos Universitetas. All rights reserved.
@article{Mateos201971, author = {Mateos, C. and Zunino, A. and Flores, A. and Misra, S.}, title = {COBOL systems migration to SOA: Assessing antipatterns and complexity}, journal = {Information Technology and Control}, year = {2019}, volume = {48}, number = {1}, pages = {71-89}, doi = {10.5755/j01.itc.48.1.21566}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85064766311&doi=10.5755%2fj01.itc.48.1.21566&partnerID=40&md5=1bfcdba25d74fceaea90b2b552b24b2a}, affiliation = {ISISTAN Research Institute, UNICEN, Paraje Arroyo Seco Str., Tandil, B7000, Argentina; CONICET, The National Scientific and Technical Research Council, Godoy Cruz Str. 2290, Buenos Aires, C1425FQB, Argentina; GIISCo Research Group, Faculty of Informatics, National University of Comahue, Buenos Aires Str. 1400, Neuquén, 8300, Argentina; Atilim University, Kizilcasar Mahallesi Str., Incek, Ankara, 06836, Turkey; Covenant University, Km. 10 Idiroko Road, Ota, P.M.B 1023, Nigeria}, author_keywords = {Direct migration; Indirect migration; Legacy system migration; Service-oriented architecture; Web services; WSDL antipatterns; WSDL complexity}, document_type = {Article}, source = {Scopus} }
Towards integrating mobile devices into dew computing: A model for hour-wise prediction of energy availability

M. Longo, M. Hirsch, C. Mateos, and A. Zunino

Information (Switzerland), Sep 2019

Abs Bib DOI

With self-provisioning of resources as premise, dew computing aims at providing computing services by minimizing the dependency over existing internetwork back-haul. Mobile devices have a huge potential to contribute to this emerging paradigm, not only due to their proximity to the end user, ever growing computing/storage features and pervasiveness, but also due to their capability to render services for several hours, even days,without being plugged to the electricity grid. Nonetheless,misusing the energy of their batteries can discourage owners to offer devices as resource providers in dew computing environments. Arguably, having accurate estimations of remaining battery would help to take better advantage of a device’s computing capabilities. In this paper, we propose a model to estimate mobile devices battery availability by inspecting traces of real mobile device owner’s activity and relevant device state variables. Themodel includes a feature extraction approach to obtain representative features/variables, and a prediction approach, based on regression models and machine learning classifiers. On average, the accuracy of our approach, measured with the mean squared error metric, overpasses the one obtained by a relatedwork. Prediction experiments at five hours ahead are performed over activity logs of 23 mobile users across several months. © 2019 by the authors.
@article{Longo2019, author = {Longo, M. and Hirsch, M. and Mateos, C. and Zunino, A.}, title = {Towards integrating mobile devices into dew computing: A model for hour-wise prediction of energy availability}, journal = {Information (Switzerland)}, year = {2019}, volume = {10}, number = {3}, doi = {10.3390/info10030086}, art_number = {86}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85063886689&doi=10.3390%2finfo10030086&partnerID=40&md5=edb159d16f646788778f593f8190c676}, affiliation = {Viterbi School of Engineering, University of Southern California, Los Angeles, CA 90007, United States; ISISTAN-UNICEN-CONICET, Tandil, Buenos Aires, B7001BBO, Argentina}, author_keywords = {Battery prediction; Dew computing; Feature selection; Machine learning; Mobile cloud computing}, document_type = {Article}, source = {Scopus} }

2018

A structural-semantic web service selection approach to improve retrievability of web services

M. Garriga, A.D. Renzis, I. Lizarralde, A. Flores, C. Mateos, A. Cechich, and A. Zunino

Information Systems Frontiers, Sep 2018

Abs Bib DOI

Service-Oriented Computing promotes building applications by consuming and reusing Web Services. However, the selection of adequate Web Services given a client application is still a major challenge. The effort of assessing and adapting candidate services could be overwhelming due to the “impedance” of Web Service interfaces expected by clients versus the actual interfaces of retrieved Web Services. In this work, we present a novel structural-semantic approach to help developers in the retrieval and selection of services from a service registry. The approach is based on a comprehensive structural scheme for service Interface Compatibility analysis, and WordNet as the semantic support to assess identifiers of operations and parameters. We also empirically analyze, compare and contrast the performance of three service selection methods: a pure structural approach, a pure semantic approach, and the structural-semantic (hybrid) approach proposed in this work. The experimental analysis was performed with two data-sets of real-world Web Services and a service discovery support already published in the literature. Results show that our hybrid service selection approach improved effectiveness in terms of retrievability of Web Services compared to the other approaches. © 2016, Springer Science+Business Media New York.
@article{Garriga20181319, author = {Garriga, M. and Renzis, A.D. and Lizarralde, I. and Flores, A. and Mateos, C. and Cechich, A. and Zunino, A.}, title = {A structural-semantic web service selection approach to improve retrievability of web services}, journal = {Information Systems Frontiers}, year = {2018}, volume = {20}, number = {6}, pages = {1319-1344}, doi = {10.1007/s10796-016-9731-1}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85007439427&doi=10.1007%2fs10796-016-9731-1&partnerID=40&md5=22df0504e2dc324e194d53c2e2635e19}, affiliation = {GiiSCo Research Group, Faculty of Informatics, Universidad Nacional del Comahue (UNComa), Buenos Aires, Neuquen 1400, Argentina; ISISTAN Research Institute, Universidad Nacional del Centro de la Provincia de Buenos Aires (UNPCBA), Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas, (CONICET), Buenos Aires, Argentina}, author_keywords = {Semantic service selection; Service interface; Service selection; Structural service selection; Web service discovery; Web services}, document_type = {Article}, source = {Scopus} }
Body condition estimation on cows from depth images using Convolutional Neural Networks

J. Rodríguez Alvarez, M. Arroqui, P. Mangudo, J. Toloza, D. Jatip, J.M. Rodriguez, A. Teyseyre, C. Sanz, A. Zunino, C. Machado, and 1 more author

Computers and Electronics in Agriculture, Sep 2018

Abs Bib DOI

BCS (“Body Condition Score”) is a method used to estimate body fat reserves and accumulated energy balance of cows. BCS heavily influences milk production, reproduction, and health of cows. Therefore, it is important to monitor BCS to achieve better animal response, but this is a time-consuming and subjective task performed visually by expert scorers. Several studies have tried to automate BCS of dairy cows by applying image analysis and machine learning techniques. This work analyzes these studies and proposes a system based on Convolutional Neural Networks (CNNs) to improve overall automatic BCS estimation, whose use might be extended beyond dairy production. The developed system has achieved good estimation results in comparison with other systems in the area. Overall accuracy of BCS estimations within 0.25 units of difference from true values was 78%, while overall accuracy within 0.50 units was 94%. Similarly, weighted precision and recall, which took into account imbalance BCS distribution in the built dataset, show similar values considering those error ranges. © 2018 Elsevier B.V.
@article{RodríguezAlvarez201812, author = {Rodríguez Alvarez, J. and Arroqui, M. and Mangudo, P. and Toloza, J. and Jatip, D. and Rodriguez, J.M. and Teyseyre, A. and Sanz, C. and Zunino, A. and Machado, C. and Mateos, C.}, title = {Body condition estimation on cows from depth images using Convolutional Neural Networks}, journal = {Computers and Electronics in Agriculture}, year = {2018}, volume = {155}, pages = {12-22}, doi = {10.1016/j.compag.2018.09.039}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85054395499&doi=10.1016%2fj.compag.2018.09.039&partnerID=40&md5=ae3ed647c104bd4a3b3bddd0d90529f9}, affiliation = {D-TEC – Agencia Nacional de Promoción Científica y Tecnológica (ANPCyT), Argentina; ISISTAN – UNICEN – CONICET, Tandil, Buenos Aires, Argentina; CIVETAN – UNICEN – CONICET – CICPBA, Tandil, Buenos Aires, Argentina; Faculty of Veterinary Sciences – UNICEN, Argentina}, author_keywords = {Body condition score; Convolutional Neural Networks; Image analysis; Precision livestock}, document_type = {Article}, source = {Scopus} }
Augmenting computing capabilities at the edge by jointly exploiting mobile devices: A survey

M. Hirsch, C. Mateos, and A. Zunino

Future Generation Computer Systems, Sep 2018

Abs Bib DOI

The ever-growing adoption of smart mobile devices is a worldwide phenomenon that positions smartphones and tablets as primary devices, i.e., that people mostly use. In addition to this, the computing capabilities of such devices, often under-utilized by their owners, are in continuous improvement. Today, smart mobile devices have multi-core CPUs, several gigabytes of RAM, and the ability to communicate through several wireless networking technologies. These facts caught the attention of researchers who propose to leverage smart mobile devices aggregated computing capabilities for running resource intensive software at the edge of the network. Such idea is conditioned by key features, named singularities in the context of this work, that makes smart mobile devices resource exploitation a difficult problem. These are the ability of devices to change location (user mobility), the shared condition -i.e., non-dedicated nature- of resources provided (lack of ownership) and the limited operation time given by the finite energy source (exhaustible resources). In this paper, we provide an in-depth analysis of proposals materializing this idea. We show that (a) existing approaches differ in the singularities combinations they target and the way they address each singularity through novel taxonomies, and (b) this fact makes them suitable for distinct goals and resource exploitation opportunities also schematized in this paper. The latter are represented by real life situations where resources provided by groups of smart mobile devices can be exploited, which in turn, are characterized by a social context and a networking support used to link and coordinate devices. The behavior of people in a given social context configure a special availability level of resources, while the networking support imposes restrictions on how data/computational tasks are distributed and results are collected. We conclude our analysis by discussing strong/weak points of the approaches and by identifying prospective future lines in the area. © 2018 Elsevier B.V.
@article{Hirsch2018644, author = {Hirsch, M. and Mateos, C. and Zunino, A.}, title = {Augmenting computing capabilities at the edge by jointly exploiting mobile devices: A survey}, journal = {Future Generation Computer Systems}, year = {2018}, volume = {88}, pages = {644-662}, doi = {10.1016/j.future.2018.06.005}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048532246&doi=10.1016%2fj.future.2018.06.005&partnerID=40&md5=e8d020e1985511b29f51d583089a6207}, affiliation = {ISISTAN-UNICEN-CONICET Research Institute. Campus Universitario, Tandil (B7001BBO), Argentina}, author_keywords = {Edge computing; Mobile cloud computing; Resource allocation; Resource-intensive applications; Smart mobile devices}, document_type = {Article}, source = {Scopus} }
Practical criteria for scheduling CPU-bound jobs in mobile devices at the edge

M. Hirsch, C. Mateos, and A. Zunino

In Proceedings - 2018 IEEE International Conference on Cloud Engineering, IC2E, Sep 2018

Abs Bib DOI

The ubiquity of mobile devices, their strong computational capabilities -frequently underused by the owners- and their close relationship to IoT environments, make them valuable providers of computing power at the edge, i.e. as an aid to deal with remote computing servers high-delay communication. Then, researchers have proposed to take advantage of the connection regularity of groups of mobile devices to fixed wireless networking infrastructures, e.g., access points, to scavenge mobile computing resources. However, among the key concerns to achieve such exploitation in an efficient way is providing new scheduling criteria for computations able to deal with the challenges posed by mobile devices finite energy sources. The value of considering battery-related parameters for ranking devices capabilities against not using them has been hardly investigated in the literature. Then, in this paper, we analyze several job scheduling criteria and provide statistical evidence that support our findings. The experiments are performed via a simulation software that employs energy consumption traces derived from real mobile devices, hence practical utility is ensured. © 2018 IEEE.
@inproceedings{Hirsch2018340, author = {Hirsch, M. and Mateos, C. and Zunino, A.}, title = {Practical criteria for scheduling CPU-bound jobs in mobile devices at the edge}, booktitle = {Proceedings - 2018 IEEE International Conference on Cloud Engineering, IC2E}, year = {2018}, pages = {340-345}, doi = {10.1109/IC2E.2018.00065}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85048313335&doi=10.1109%2fIC2E.2018.00065&partnerID=40&md5=debabdf44248bd8abf18a69887f3236f}, affiliation = {ISISTAN-UNCPBA-CONICET. Tandil, Buenos Aires, Argentina}, author_keywords = {Job scheduling; Mobile devices; Mobile edge computing}, document_type = {Conference Paper}, source = {Scopus} }
Spotting and Removing WSDL Anti-pattern Root Causes in Code-first Web Services Using NLP Techniques: A Thorough Validation of Impact on Service Discoverability

M. Hirsch, A. Rodríguez, J.M. Rodriguez, C. Mateos, and A. Zunino

Computer Standards and Interfaces, Sep 2018

Abs Bib DOI

To expose software as Web-accesible services, Web Service technologies demand developers to implement certain sofware artifacts, such as the service description using WSDL. Therefore, developers usually use automatic tools to perform this task, which take as input a code written in a programming language –e.g. Java– and generate the necessary artifacts for invoking it remotely. However, as a result of tool flaws and some bad coding practices, the description of the resulting Web Services might contain anti-patterns that difficult their discovery and use. In earlier work we proposed a tool-supported, code-first approach named Gapidt to develop Web Services in Java while early reducing the presence of anti-patterns in their descriptions through code refactorings. Bad coding practices, which potentially reduce the textual and structural information of generated WSDL documents, are automatically detected and informed to the developer by means of the GAnalyzer module so he/she can fix the service code. Moreover, developer provided information, such as service parameter names and operation comments, as well as re-utilization of data-type definitions, are exploited by the GMapper module upon generating WSDL documents. This paper focuses on a comprehensive experimental evaluation of the approach oriented at prospective users to assess expected discoverability gains and usage considerations taking into account various relevant service publishing technologies. In addition, we introduce a detailed comparison of Gapidt with a similar approach from the literature. The results show that Gapidt outperforms its competitor in terms of discoverability while improves Web Service description quality (better documentation and data-models). The Web Service discoverability levels of Gapidt outperforms that of third-party tools, either when using the GAnalyzer plus the GMapper, or only the GMapper. © 2017 Elsevier B.V.
@article{Hirsch2018116, author = {Hirsch, M. and Rodríguez, A. and Rodriguez, J.M. and Mateos, C. and Zunino, A.}, title = {Spotting and Removing WSDL Anti-pattern Root Causes in Code-first Web Services Using NLP Techniques: A Thorough Validation of Impact on Service Discoverability}, journal = {Computer Standards and Interfaces}, year = {2018}, volume = {56}, pages = {116-133}, doi = {10.1016/j.csi.2017.09.010}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85031772226&doi=10.1016%2fj.csi.2017.09.010&partnerID=40&md5=90d65060a54a2c21a851e2cfcbd79c08}, affiliation = {ISISTAN-CONICET, UNICEN. Campus Universitario, Tandil (B7001BBO), Argentina}, author_keywords = {Automatic detection; Code-first; Service discovery; Web services; WSDL anti-patterns}, document_type = {Article}, source = {Scopus} }
A Model for Hour-Wise Prediction of Mobile Device Energy Availability

M. Longo, C. Mateos, and A. Zunino

Advances in Intelligent Systems and Computing, Sep 2018

Abs Bib DOI

Mobile devices have become so ubiquitous and their computational capabilities have increased so much that they have been deemed as first-class resource providers in modern computational paradigms. Particularly, novel Mobile Cloud Computing paradigms such as Dew Computing promote offloading heavy computations to nearby mobile devices. Not only this requires to produce resource allocators to take advantage of device resources, but also mechanisms to quantify current and future energy availability in target devices. We propose a model to produce hour-wise estimations of battery availability by inspecting past device owner’s activity and relevant device state variables. The model includes a feature extraction approach to obtain representative features/variables, and a prediction approach, based on regression models and machine learning classifiers. Comparisons against a relevant related work in terms of the Mean Squared Error metric shows that our method provides more accurate battery availability predictions in the order of several hours ahead. © 2018, Springer International Publishing AG, part of Springer Nature.
@article{Longo2018351, author = {Longo, M. and Mateos, C. and Zunino, A.}, title = {A Model for Hour-Wise Prediction of Mobile Device Energy Availability}, journal = {Advances in Intelligent Systems and Computing}, year = {2018}, volume = {738}, pages = {351-358}, doi = {10.1007/978-3-319-77028-4_47}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85045834066&doi=10.1007%2f978-3-319-77028-4_47&partnerID=40&md5=4efdfc619578c893087db3a8b11531da}, affiliation = {University of Southern California, Los Angeles, CA, United States; ISISTAN-UNCPBA-CONICET, Tandil, Buenos Aires, Argentina}, author_keywords = {Android; Battery prediction; Feature selection; Mobile cloud computing; Time series}, document_type = {Conference Paper}, source = {Scopus} }
Task scheduling for processing big graphs in heterogeneous commodity clusters

A. Corbellini, D. Godoy, C. Mateos, S. Schiaffino, and A. Zunino

Communications in Computer and Information Science, Sep 2018

Abs Bib DOI

Large-scale graph processing is a challenging problem since vertices can be arbitrarily connected, reducing locality and easily expanding the solution space. As a result, in recent years, a new breed of distributed frameworks that handle graphs efficiently has emerged. In large clusters with many resources (RAM, CPUs, network connectivity), these frameworks focus on exploiting the available resources as efficiently as possible. However, on situations where the cluster hardware is unbalanced or low in computing resources, the framework must correctly allocate tasks in order to complete execution. In this work, we compare three frameworks, the generic Fork-Join framework adapted to graph processing, and the Pregel and DPM frameworks that were originally designed for computing graphs. A link-prediction algorithm was used as case study to analyze several scheduling strategies that allocate tasks to servers in a cluster of heterogeneous characteristics. The dataset used for the experiments is a snapshot from the Twitter graph, and specifically, a subset of its users that pushed the memory requirements of the algorithm. © Springer International Publishing AG 2018.
@article{Corbellini2018235, author = {Corbellini, A. and Godoy, D. and Mateos, C. and Schiaffino, S. and Zunino, A.}, title = {Task scheduling for processing big graphs in heterogeneous commodity clusters}, journal = {Communications in Computer and Information Science}, year = {2018}, volume = {796}, pages = {235-249}, doi = {10.1007/978-3-319-73353-1_16}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85040233343&doi=10.1007%2f978-3-319-73353-1_16&partnerID=40&md5=b2050e6d885f10b32cd29f3fd77614be}, affiliation = {ISISTAN-CONICET, UNICEN, Tandil, Buenos Aires, Argentina}, document_type = {Conference Paper}, source = {Scopus} }
DPM: A novel distributed large-scale social graph processing framework for link prediction algorithms

A. Corbellini, D. Godoy, C. Mateos, S. Schiaffino, and A. Zunino

Future Generation Computer Systems, Sep 2018

Abs Bib DOI

Large-scale graphs have become ubiquitous in social media. Computer-based recommendations in these huge graphs pose challenges in terms of algorithm design and resource usage efficiency when processing recommendations in distributed computing environments. Moreover, recommendation algorithms for graphs, particularly link prediction algorithms, have different requirements depending of the way the underlying graph is traversed. Path-based algorithms usually perform traversals in different directions to build a large ranking of vertices to recommend, whereas random walk-based algorithms build an initial subgraph and perform several iterations on those vertices to compute the final ranking. In this work, we propose a distributed graph processing framework called Distributed Partitioned Merge (DPM), which supports both types of algorithms and we compare its performance and resource usage w.r.t. two relevant frameworks, namely Fork-Join and Pregel. In our experiments, we show that in most tests DPM outperforms both Pregel and Fork-Join in terms of recommendation time, with a minor penalization in network usage in some scenarios. © 2017 Elsevier B.V.
@article{Corbellini2018474, author = {Corbellini, A. and Godoy, D. and Mateos, C. and Schiaffino, S. and Zunino, A.}, title = {DPM: A novel distributed large-scale social graph processing framework for link prediction algorithms}, journal = {Future Generation Computer Systems}, year = {2018}, volume = {78}, pages = {474-480}, doi = {10.1016/j.future.2017.02.025}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013197040&doi=10.1016%2fj.future.2017.02.025&partnerID=40&md5=8e9bab9e51e39d0f6e469341cb46e107}, affiliation = {ISISTAN-CONICET, UNICEN, Paraje Arroyo Seco - Campus Universitario, Tandil, Buenos Aires, 7000, Argentina}, author_keywords = {Distributed graph processing; Online Social Networks; Recommendation algorithms}, document_type = {Article}, source = {Scopus} }

2017

An empirical evaluation of a simple energy aware scheduler for mobile grids

A.P. Campos, J.M. Rodriguez, and A. Zunino

In 2017 43rd Latin American Computer Conference, CLEI, Sep 2017

Abs Bib DOI

Nowadays mobile devices are multi-core computers with considerable unused capabilities. Therefore, several researchers have considered harnessing the power of these battery-powered devices for distributed computing. Although their evergrowing capabilities, the fact that mobile devices run on battery poses a major challenge for applying traditional distributed computing techniques. Particularly, researchers aimed at using mobile devices as resources for executing computationally intensive task. Different job scheduling algorithms were proposed with this aim, but many of them require information that is unavailable or difficult to obtain in real-life environments, such as how much energy would require a job to be finished. In this context, Simple Energy Aware Scheduler (SEAS) is a scheduling technique for computational intensive Mobile Grids that only require easily accessible information. It was proposed in 2010 and it has been the base for a range of research work. Despite being described as easily implementable in real-life scenarios, SEAS and other SEAS-improvements works have always been evaluated using simulations. In this work, we present a distributed computing platform for mobile devices that support SEAS and empirical evaluation of the SEAS scheduler. The obtained result supports previous simulation results and by extension further validating other SEAS-based results. © 2017 IEEE.
@inproceedings{Campos20171, author = {Campos, A.P. and Rodriguez, J.M. and Zunino, A.}, title = {An empirical evaluation of a simple energy aware scheduler for mobile grids}, booktitle = {2017 43rd Latin American Computer Conference, CLEI}, year = {2017}, volume = {2017-January}, pages = {1-9}, doi = {10.1109/CLEI.2017.8226401}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046484534&doi=10.1109%2fCLEI.2017.8226401&partnerID=40&md5=0ed956429ff9278d616734df67f1603c}, affiliation = {Facultad de Ciencias Exactas, UNICEN, Tandil, Buenos Aires, Argentina; ISISTAN Research Institute, UNICEN-CONICET, Tandil, Buenos Aires, Argentina}, author_keywords = {Energy Aware Scheduler; Job Scheduling; Mobile Device; Mobile Grid}, document_type = {Conference Paper}, source = {Scopus} }
Word embeddings for improving REST services discoverability

I. Lizarralde, J.M. Rodriguez, C. Mateos, and A. Zunino

In 2017 43rd Latin American Computer Conference, CLEI , Sep 2017

Abs Bib DOI

Web Services have become essential to the software industry as they provide reusable, remotely-accessible functionality and data, thus accelerating client application development and relieving users from maintaining the consumed services. Since Web Services-particularly their descriptions-must be discovered before being consumed, many discovery approaches based on classic Information Retrieval techniques, which store and process textual service descriptions, have arisen. These discovery approaches are affected by natural language ambiguity, such as synonymy and homonymy. Such issues are known as term mismatch, since descriptions relevant to a keyword-based query can be retrieved only if they share many words. Recently, Word Embeddings emerged and tried to cope with this problem by representing words in a language as vectors in a continuous vector space. An interesting property of these vectors is that two different words with similar meaning are represented by vectors that are close in the space. Word Embeddings aim at categorising and quantifying words so that semantic relationships can be established through simple vector distance measures. In this paper, we exploit Word Embeddings to find hidden relationships between service descriptions and queries for the case of REST services, a recent alternative to SOAP-oriented services. The results showed improvements over classical service retrieval techniques such as Vector Space Model or Latent Semantic Analysis of up to 20% in Precision, 39% in Recall, 35% in F-Measure and 10% in NDCG. © 2017 IEEE.
@inproceedings{Lizarralde20171, author = {Lizarralde, I. and Rodriguez, J.M. and Mateos, C. and Zunino, A.}, title = {Word embeddings for improving REST services discoverability}, booktitle = {2017 43rd Latin American Computer Conference, CLEI }, year = {2017}, volume = {2017-January}, pages = {1-8}, doi = {10.1109/CLEI.2017.8226444}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046421411&doi=10.1109%2fCLEI.2017.8226444&partnerID=40&md5=3ab3e07baad80795c45ca779e38a8c04}, affiliation = {ISISTAN-UNICEN-CONICET, Tandil, Buenos Aires, Argentina}, document_type = {Conference Paper}, source = {Scopus} }
A performance comparison of data-aware heuristics for scheduling jobs in mobile grids

M. Hirsch, C. Mateos, J.M. Rodriguez, A. Zunino, Y. Garí, and D.A. Monge

In 2017 43rd Latin American Computer Conference, CLEI, Sep 2017

Abs Bib DOI

Given mobile devices ubiquity and capabilities, some researchers now consider them as resource providers of distributed environments called mobile Grids for running resource intensive software. Therefore, job scheduling has to deal with device singularities, such as energy constraints, mobility and unstable connectivity. Many existing schedulers consider at least one of these aspects, but their applicability strongly depends on information that is unavailable or difficult to estimate accurately, like job execution time. Other efforts do not assume knowing job CPU requirements but ignore energy consumption due to data transfer operations, which is not realistic for data-intensive applications. This work, on the contrary, considers the last as non negligible and known by the scheduler. Under these assumptions, we conduct a performance study of several traditional scheduling heuristics adapted to this environment, which are applied with the known information of jobs but evaluated along with job information unknown to the scheduler. Experiments are performed via a simulation software that employs hardware profiles derived from real mobile devices. Our goal is to contribute to better understand both the capabilities and limitations of this kind of schedulers in the incipient area of mobile Grids. © 2017 IEEE.
@inproceedings{Hirsch20171, author = {Hirsch, M. and Mateos, C. and Rodriguez, J.M. and Zunino, A. and Garí, Y. and Monge, D.A.}, title = {A performance comparison of data-aware heuristics for scheduling jobs in mobile grids}, booktitle = {2017 43rd Latin American Computer Conference, CLEI}, year = {2017}, volume = {2017-January}, pages = {1-8}, doi = {10.1109/CLEI.2017.8226474}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85046442660&doi=10.1109%2fCLEI.2017.8226474&partnerID=40&md5=11abacc633512a112a64b2454f38efda}, affiliation = {ISISTAN-UNCPBA-CONICET, Tandil, Buenos Aires, Argentina; ITIC-UNCuyo and CONICET, Mendoza, Argentina}, author_keywords = {job scheduling; Mobile devices; Mobile Grid; resource intensive applications}, document_type = {Conference Paper}, source = {Scopus} }
SMArtOp: A Java library for distributing high-dimensional sparse-matrix arithmetic operations

A. Tommasel, D. Godoy, and A. Zunino

Science of Computer Programming, Sep 2017

Abs Bib DOI

Sparse-matrix operations are commonplace in computational science, and novel solutions for speeding-up them are essential for numerous applications. SMArtOp is a software for efficiently dividing and distributing the processing of large-scale sparse-matrix arithmetic operations. This software relies on both the distinctive characteristics of each type of arithmetic operation and the particular matrices involved to split the operations into parallel and simpler tasks. Experimental evaluation showed the speeding-up and resource consumption advantages of the proposed software, in comparison to other linear-algebra libraries. © 2017 Elsevier B.V.
@article{Tommasel201726, author = {Tommasel, A. and Godoy, D. and Zunino, A.}, title = {SMArtOp: A Java library for distributing high-dimensional sparse-matrix arithmetic operations}, journal = {Science of Computer Programming}, year = {2017}, volume = {150}, pages = {26-30}, doi = {10.1016/j.scico.2017.06.005}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85023741949&doi=10.1016%2fj.scico.2017.06.005&partnerID=40&md5=9a4876070314e9f5b15745049602f301}, affiliation = {ISISTAN, UNICEN-CONICET, Facultad Cs. Exactas, Campus Universitario, Tandil, B7001BBO, Argentina}, author_keywords = {Big-scale sparse-matrix; Distributed computing; Matrix arithmetic operation}, document_type = {Article}, source = {Scopus} }
Controlling complexity of web services interfaces through a metrics-driven approach

D. Anabalon, A. Flores, C. Mateos, A. Zunino, and S. Misra

In Proceedings of the IEEE International Conference on Computing, Networking and Informatics, ICCNI, Sep 2017

Abs Bib DOI

Metric suites to assess Web Service quality attributes have been proposed recently. In particular, services interfaces in WSDL (Web Service Description Language) have distinct intrinsic aspects (e.g., size or complexity) able to be measured. We present an approach to prevent a high complexity on services interfaces (WSDLs), to ease consumers to reason about services’ offered functionality. Mostly, WSDLs are automatically derived from object-oriented (OO) source code, with a likely impact on complexity. In a previous work, we studied the statistical relationships between a metric suite of service interface complexity (by Baski & Misra) and the Chidamber & Kemerer’s OO metric suite (onto service implementations). In this work, we extend the study to find out how certain refactorings on services’ source codes prior to derive WSDLs might reduce complexity. For this, we conducted a series of experiments on a data-set of 148 real-world services. In this way, our approach exploits OO metrics as indicators at development-time, guiding software developers to achieve less complex service interfaces. © 2017 IEEE.
@inproceedings{Anabalon20171, author = {Anabalon, D. and Flores, A. and Mateos, C. and Zunino, A. and Misra, S.}, title = {Controlling complexity of web services interfaces through a metrics-driven approach}, booktitle = {Proceedings of the IEEE International Conference on Computing, Networking and Informatics, ICCNI}, year = {2017}, volume = {2017-January}, pages = {1-9}, doi = {10.1109/ICCNI.2017.8123807}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85047221054&doi=10.1109%2fICCNI.2017.8123807&partnerID=40&md5=a480c8b2e62ee145e0df701750221aed}, affiliation = {GIISCO Research Group, National University of Comahue, CONICET, Neuquén, Argentina; ISISTAN-CONICET Research Institute, UNICEN University, Tandil, Argentina; Covenant University, Otta, Nigeria}, author_keywords = {Code-First; Object-oriented Metrics; Web Service Interface Complexity; Web Services}, document_type = {Conference Paper}, source = {Scopus} }
Mining social web service repositories for social relationships to aid service discovery

A. Corbellini, D. Godoy, C. Mateos, A. Zunino, and I. Lizarralde

In IEEE International Working Conference on Mining Software Repositories, Sep 2017

Abs Bib DOI

The Service Oriented Computing (SOC) paradigm promotes building new applications by discovering and then invoking services, i.e., software components accessible through the Internet. Discovering services means inspecting registries where textual descriptions of services functional capabilities are stored. To automate this, existing approaches index descriptions and associate users’ queries to relevant services. However, the massive adoption of Web-exposed API development practices, specially in large service ecosystems such as the IoT, is leading to evergrowing registries which challenge the accuracy and speed of such approaches. The recent notion of Social Web Services (SWS), where registries not only store service information but also sociallike relationships between users and services opens the door to new discovery schemes. We investigate an approach to discover SWSs that operates on graphs with user-service relationships and employs lightweight topological metrics to assess service similarity. Then, ’socially’ similar services, which are determined exploiting explicit relationships and mining implicit relationships in the graph, are clustered via exemplar-based clustering to ultimately aid discovery. Experiments performed with the ProgrammableWeb.com registry, which is at present the largest SWS repository with over 15k services and 140k user-service relationships, show that pure topology-based clustering may represent a promising complement to content-based approaches, which in fact are more time-consuming due to text processing operations. © 2017 IEEE.
@inproceedings{Corbellini201775, author = {Corbellini, A. and Godoy, D. and Mateos, C. and Zunino, A. and Lizarralde, I.}, title = {Mining social web service repositories for social relationships to aid service discovery}, booktitle = {IEEE International Working Conference on Mining Software Repositories}, year = {2017}, pages = {75-79}, doi = {10.1109/MSR.2017.16}, art_number = {7962357}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85026528397&doi=10.1109%2fMSR.2017.16&partnerID=40&md5=6c02e5c877f405d25cb24ec4408ef7f9}, affiliation = {ISISTAN Research Institute, CONICET-UNCPBA, Campus Universitario, Tandil, Buenos Aires, B7001BBO, Argentina}, author_keywords = {Exemplar-based clustering; Service discovery; Social recommender systems; Social Web Service}, document_type = {Conference Paper}, source = {Scopus} }
A distributed approach for accelerating sparse matrix arithmetic operations for high-dimensional feature selection

A. Tommasel, D. Godoy, A. Zunino, and C. Mateos

Knowledge and Information Systems, Sep 2017

Abs Bib DOI

Matrix computations are both fundamental and ubiquitous in computational science, and as a result, they are frequently used in numerous disciplines of scientific computing and engineering. Due to the high computational complexity of matrix operations, which makes them critical to the performance of a large number of applications, their efficient execution in distributed environments becomes a crucial issue. This work proposes a novel approach for distributing sparse matrix arithmetic operations on computer clusters aiming at speeding-up the processing of high-dimensional matrices. The approach focuses on how to split such operations into independent parallel tasks by considering the intrinsic characteristics that distinguish each type of operation and the particular matrices involved. The approach was applied to the most commonly used arithmetic operations between matrices. The performance of the presented approach was evaluated considering a high-dimensional text feature selection approach and two real-world datasets. Experimental evaluation showed that the proposed approach helped to significantly reduce the computing times of big-scale matrix operations, when compared to serial and multi-thread implementations as well as several linear algebra software libraries. © 2016, Springer-Verlag London.
@article{Tommasel2017459, author = {Tommasel, A. and Godoy, D. and Zunino, A. and Mateos, C.}, title = {A distributed approach for accelerating sparse matrix arithmetic operations for high-dimensional feature selection}, journal = {Knowledge and Information Systems}, year = {2017}, volume = {51}, number = {2}, pages = {459-497}, doi = {10.1007/s10115-016-0981-5}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84983782426&doi=10.1007%2fs10115-016-0981-5&partnerID=40&md5=be4cd681e9ff341cdd56a3b787ac9745}, affiliation = {ISISTAN, UNICEN-CONICET, Paraje Arroyo Seco, Campus Universitario, Tandil, Buenos Aires, Argentina}, author_keywords = {Distributed computing; Feature selection; Matrix arithmetic operation; Sparse matrix}, document_type = {Article}, source = {Scopus} }
A Two-Phase Energy-Aware Scheduling Approach for CPU-Intensive Jobs in Mobile Grids

M. Hirsch, J.M. Rodriguez, C. Mateos, and A. Zunino

Journal of Grid Computing, Sep 2017

Abs Bib DOI

The profusion of mobile devices over the world and their evolved computational capabilities promote their inclusion as resource providers in traditional Grid environments. However, their efficient exploitation requires adapting current schedulers to operate with computing capabilities limited by energy supply and mobile devices that cannot be assumed to be dedicated, among other concerns. We propose a two-phase scheduling approach for running CPU-intensive jobs on mobile devices that combines novel energy-aware criteria with job stealing techniques. The approach was evaluated through an event-based simulator that uses battery consumption profiles extracted from real mobile devices. CPU usage derived from non-Grid processes was also modelled. For evaluating the first phase we compared the number of finalized jobs by all energy-aware criteria, while for the second phase we analyzed the performance boost introduced by job stealing. While the best first phase criteria finalized up to 90 % of submitted jobs, job stealing increased this percentage by up to 9 %. © 2016, Springer Science+Business Media Dordrecht.
@article{Hirsch201755, author = {Hirsch, M. and Rodriguez, J.M. and Mateos, C. and Zunino, A.}, title = {A Two-Phase Energy-Aware Scheduling Approach for CPU-Intensive Jobs in Mobile Grids}, journal = {Journal of Grid Computing}, year = {2017}, volume = {15}, number = {1}, pages = {55-80}, doi = {10.1007/s10723-016-9387-6}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994750385&doi=10.1007%2fs10723-016-9387-6&partnerID=40&md5=e3679963a89dd9347bc506f6bf88a208}, affiliation = {ISISTAN-CONICET. UNICEN University, Campus Universitario, Tandil, Buenos Aires B7001BBO, Argentina}, author_keywords = {CPU intensive application; Job scheduling; Job stealing; Mobile devices; Mobile grid}, document_type = {Article}, source = {Scopus} }
A domain independent readability metric for web service descriptions

A. De Renzis, M. Garriga, A. Flores, A. Cechich, C. Mateos, and A. Zunino

Computer Standards and Interfaces, Sep 2017

Abs Bib DOI

Web Services are influencing most IT-based industries as the basic building block of business infrastructures. A Web Service has an interface described in a machine-processable format (specifically WSDL). Service providers expose their services by publishing the corresponding WSDL documents. Service consumers can learn about service capability and how to interact with the services. Service descriptions (WSDL documents) should be ideally understood easily by service stakeholders so that the process of consuming services is simplified. In this work we present a practical metric to quantify readability in WSDL documents – attending to their semantics by using WordNet as the underlying concept hierarchy. In addition, we propose a set of best practices to be used during the development of WSDL documents to improve their readability. To validate our proposals, we performed both qualitative and quantitative experiments. A controlled survey with a group of (human) service consumers showed that software engineers required less time and effort to analyze WSDL documents with higher readability values. Other experiment compares readability values of a dataset of real-life WSDL documents from the industry before and after modifying them to adhere to the readability best practices proposed in this paper. We detected a significant readability improvement for WSDL documents written according to the best practices. In another experiment, we applied existing readability metrics for natural language texts detecting their unsuitability to the Web Service context. Lastly, we analyzed the readability best practices identifying their useful applicability to the industry. © 2016 Elsevier B.V.
@article{DeRenzis2017124, author = {De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Mateos, C. and Zunino, A.}, title = {A domain independent readability metric for web service descriptions}, journal = {Computer Standards and Interfaces}, year = {2017}, volume = {50}, pages = {124-141}, doi = {10.1016/j.csi.2016.09.005}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84995543273&doi=10.1016%2fj.csi.2016.09.005&partnerID=40&md5=9d46dec58449a24b4094bc0289ff03da}, affiliation = {GIISCO Research Group, National University of Comahue, Neuquén, Argentina; ISISTAN Research Institute, UNICEN University, Tandíl, Argentina}, author_keywords = {Domain independent; Readability; Web service descriptions; WordNet}, document_type = {Article}, source = {Scopus} }
Keeping Web Service interface complexity low using an OO metric-based early approach

C. Mateos, A. Zunino, S. Misra, D. Anabalon, and A. Flores

In Proceedings of the 2016 42nd Latin American Computing Conference, CLEI, Sep 2017

Abs Bib DOI

Web Services have been steadily gaining maturity as their adoption in the software industry grew. Accordingly, metric suites for assessing different quality attributes of Web Service artifacts have been proposed recently. Some researchers have particularly focused on assessing service interface descriptions in WSDL, which like any other software artifact have several inherent attributes (e.g., size or complexity) that can be measured. We study the statistical relationships between some recent service interface complexity metrics (Basci & Misra’s metrics suite) and the well-known Chidamber & Kemerer’s metric suite applied to service implementations, on a data-set of 154 real-world services. First, to prove the ability of Basci & Misra’s suite of measuring the complexity attribute in WSDL documents, a theoretical validation of these metrics using Weyuker’s properties is presented. Then, after finding high correlation between both metric suites, we show that refactoring service codes prior to generating the WSDL documents might reduce service interface complexity. © 2016 IEEE.
@inproceedings{Mateos2017, author = {Mateos, C. and Zunino, A. and Misra, S. and Anabalon, D. and Flores, A.}, title = {Keeping Web Service interface complexity low using an OO metric-based early approach}, booktitle = {Proceedings of the 2016 42nd Latin American Computing Conference, CLEI}, year = {2017}, doi = {10.1109/CLEI.2016.7833366}, art_number = {7833366}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013963287&doi=10.1109%2fCLEI.2016.7833366&partnerID=40&md5=d9820f9061fba3c3a9c78aca71e2de30}, affiliation = {ISISTAN-CONICET and UNICEN. Tandil, Buenos Aires, Argentina; Covenant University, Nigeria; UNComa and CONICET. Neuquén, Neuquén, Argentina}, author_keywords = {CODE-FIRST; OBJECT-ORIENTED METRICS; WEB SERVICE INTERFACE COMPLEXITY; WEB SERVICES; WEYUKER'S PROPERTIES}, document_type = {Conference Paper}, source = {Scopus} }
Assessing readability of Web service interfaces

A. De Renzis, M. Garriga, A. Flores, A. Cechich, C. Mateos, and A. Zunino

In Proceedings of the 2016 42nd Latin American Computing Conference, CLEI, Sep 2017

Abs Bib DOI

A Web Service has an interface described in a machine-processable format (specifically WSDL). Service providers expose their services by publishing their WSDL documents. Service consumers can learn about service capability and how to interact with the services. Service descriptions (WSDL documents) should be ideally understood easily by service stakeholders so that the process of consuming services is simplified. In this work we present a practical metric to quantify readability in WSDL documents. We adapted and extended an existing semantic readability metric to focus on WSDL documents by using WordNet as the underlying concept hierarchy. Finally, we performed a qualitative experiment: a controlled survey with a group of service consumers. The results showed that consumers (software engineers) required less time and effort to analyze WSDL documents with higher readability values. © 2016 IEEE.
@inproceedings{DeRenzis2017, author = {De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Mateos, C. and Zunino, A.}, title = {Assessing readability of Web service interfaces}, booktitle = {Proceedings of the 2016 42nd Latin American Computing Conference, CLEI}, year = {2017}, doi = {10.1109/CLEI.2016.7833369}, art_number = {7833369}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85013978362&doi=10.1109%2fCLEI.2016.7833369&partnerID=40&md5=5c45148f82ad5eaf5a0ed7df8f4c9792}, affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa University, Neuquen, Argentina; ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina; National Scientific and Technical Research Council (CONICET), Argentina}, author_keywords = {Readability; Service description quality; Service Discovery; Web Services; WordNet}, document_type = {Conference Paper}, source = {Scopus} }
A multi-core computing approach for large-scale multi-label classification

J.M. Rodriguez, D. Godoy, C. Mateos, and A. Zunino

Intelligent Data Analysis, Sep 2017

Abs Bib DOI

Large scale multi-label learning, i.e. the problem of determining the associated set of labels for an instance, is gaining relevance in recent years due to the emergence of several real-world applications. Most notably, the exponential growth of the Social Web where a resource can be labeled by millions of users using one or more tags, i.e. a resource can be associated to several labels at the same time. A well-known approach for multi-label classification is the Binary Relevance (BR) algorithm which trains a binary classifier for each label independently. However, the serial implementation of BR is not suitable for medium or large datasets due to the time and computational resources required for training. For example, training classifiers for mid-size datasets using MULAN implementation of BR might take several weeks. This paper discusses a parallel implementation of the MULAN BR technique that harnesses the computational power of nowadays multi-core processors. Our implementation presents a speed-up in the training phase of up to 12 times when compared to the original MULAN implementation. In addition, the cross-validation technique of MULAN had huge RAM requirements, making it unusable with large datasets. Therefore, we have overcome this limitation by using compact data structures and taking advantage of disk caching. We have also compared our implementation against scikit-learn, a popular tool for data mining and data analysis, showing significant improvements in speed-up. © 2017 - IOS Press and the authors. All rights reserved.
@article{Rodriguez2017329, author = {Rodriguez, J.M. and Godoy, D. and Mateos, C. and Zunino, A.}, title = {A multi-core computing approach for large-scale multi-label classification}, journal = {Intelligent Data Analysis}, year = {2017}, volume = {21}, number = {2}, pages = {329-352}, doi = {10.3233/IDA-150375}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85015010594&doi=10.3233%2fIDA-150375&partnerID=40&md5=05de9cd3b231ae1d7c2efc7e306044a9}, affiliation = {ISISTAN Research Institute, Unicen University, Campus Universitario, Tandil, B7001BBO, Argentina}, author_keywords = {Binary relevance classification; multi-core programming; multi-label classification; parallel classification}, document_type = {Article}, source = {Scopus} }
Assessing Web Services interfaces with lightweight semantic basis

M. Garriga, A. De Renzis, A. Flores, A. Cechich, and A. Zunino

Computing and Informatics, Sep 2017

Abs Bib DOI

In the last years, Web Services have become the technological choice to materialize the Service-Oriented Computing paradigm. However, a broad use of Web Services requires efficient approaches to allow service consumption from within applications. Currently, developers are compelled to search for suitable services mainly by manually exploring Web catalogs, which usually show poorly relevant information, than to provide the adequate "glue-code" for their assembly. This implies a large effort into discovering, selecting and adapting services. To overcome these challenges, this paper presents a novel Web Service Selection Method. We have defined an Interface Compatibility procedure to assess structural-semantic aspects from functional specifications - in the form of WSDL documents - of candidate Web Services. Two different semantic basis have been used to define and implement the approach: WordNet, a widely known lexical dictionary of the English language; and DISCO, a database which indexes co-occurrences of terms in very large text collections. We performed a set of experiments to evaluate the approach regarding the underlying semantic basis and against third-party approaches with a data-set of real-life Web Services. Promising results have been obtained in terms of well-known metrics of the Information Retrieval field. © 2017 Slovak Academy of Sciences. All rights reserved.
@article{Garriga20171173, author = {Garriga, M. and De Renzis, A. and Flores, A. and Cechich, A. and Zunino, A.}, title = {Assessing Web Services interfaces with lightweight semantic basis}, journal = {Computing and Informatics}, year = {2017}, volume = {36}, number = {5}, pages = {1173-1206}, doi = {10.4149/cai_2017_5_1173}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85044292568&doi=10.4149%2fcai_2017_5_1173&partnerID=40&md5=5e27c630c1defd05f38ec2ce0d186a90}, affiliation = {GIISCo Research Group, Facultad de Informática, Universidad Nacional del Comahue, Neuquén, Argentina; CONICET (National Scientific and Technical Research Council), Argentina; ISISTAN Research Institute, UNICEN, Tandil, Argentina}, author_keywords = {DISCO; Service discovery; Service oriented computing; Service Selection; Web Services; WordNet}, document_type = {Article}, source = {Scopus} }
Migration from COBOL to SOA: Measuring the impact on web services interfaces complexity

C. Mateos, A. Zunino, S. Misra, D. Anabalon, and A. Flores

Communications in Computer and Information Science, Sep 2017

Abs Bib DOI

SOA and Web Services allow to easily expose business functions to build larger distributed systems. However, legacy systems – mostly in COBOL – are left aside unless applying a migration approach. Main approaches are: direct and indirect migration. The former implies to wrap COBOL programs with a thin layer of a Web Service oriented language/platform. The latter needs reengineering COBOL functions to a modern language/platform. In a previous work, we presented an intermediate approach based on direct migration where developed Web Services are later refactored to improve their interfaces quality. Refactorings mainly capture good practices inherent to indirect migration. In this paper, we measure the complexity of Web Services’ interfaces generated by the three approaches. Both comprehension and interoperability can be affected according to the service interface complexity level. We apply a metric suite (by Baski & Misra) to measure complexity on services interfaces – i.e., WSDL documents. Migrations of two real COBOL systems upon the three approaches were compared on the complexity level of the generated WSDL documents. © Springer International Publishing AG 2017.
@article{Mateos2017266, author = {Mateos, C. and Zunino, A. and Misra, S. and Anabalon, D. and Flores, A.}, title = {Migration from COBOL to SOA: Measuring the impact on web services interfaces complexity}, journal = {Communications in Computer and Information Science}, year = {2017}, volume = {756}, pages = {266-279}, doi = {10.1007/978-3-319-67642-5_22}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85030858136&doi=10.1007%2f978-3-319-67642-5_22&partnerID=40&md5=3643e8030598cc43c60d3fd5c685b167}, affiliation = {ISISTAN-UNICEN-CONICET Research Institute, Tandil, Argentina; Covenant University, Ota, Nigeria; GIISCO Research Group, National University of Comahue, Neuquén, Argentina; CONICET, National Scientific and Technical Research Council, Buenos Aires, Argentina}, author_keywords = {Direct migration; Indirect migration; Legacy system migration; Service-oriented architecture; Web services; WSDL complexity}, document_type = {Conference Paper}, source = {Scopus} }
Persisting big-data: The NoSQL landscape

A. Corbellini, C. Mateos, A. Zunino, D. Godoy, and S. Schiaffino

Information Systems, Sep 2017

Abs Bib DOI

The growing popularity of massively accessed Web applications that store and analyze large amounts of data, being Facebook, Twitter and Google Search some prominent examples of such applications, have posed new requirements that greatly challenge traditional RDBMS. In response to this reality, a new way of creating and manipulating data stores, known as NoSQL databases, has arisen. This paper reviews implementations of NoSQL databases in order to provide an understanding of current tools and their uses. First, NoSQL databases are compared with traditional RDBMS and important concepts are explained. Only databases allowing to persist data and distribute them along different computing nodes are within the scope of this review. Moreover, NoSQL databases are divided into different types: Key-Value, Wide-Column, Document-oriented and Graph-oriented. In each case, a comparison of available databases is carried out based on their most important features. © 2016 Elsevier Ltd
@article{Corbellini20171, author = {Corbellini, A. and Mateos, C. and Zunino, A. and Godoy, D. and Schiaffino, S.}, title = {Persisting big-data: The NoSQL landscape}, journal = {Information Systems}, year = {2017}, volume = {63}, pages = {1-23}, doi = {10.1016/j.is.2016.07.009}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982272988&doi=10.1016%2fj.is.2016.07.009&partnerID=40&md5=4a7346e337660368c561126f919a7996}, affiliation = {ISISTAN (CONICET-UNCPBA) Research Institute, UNICEN University, Campus UniversitarioB7001BBO, Argentina}, author_keywords = {Big data; Database distribution; Database persistence; Distributed systems; NoSQL databases; Relational databases}, document_type = {Article}, source = {Scopus} }

2016

Improving scientific application execution on android mobile devices via code refactorings

A. Rodríguez, C. Mateos, and A. Zunino

Software - Practice and Experience, Sep 2016

Abs Bib DOI

The increasing number of mobile devices with ever-growing capabilities makes them useful for running scientific applications. However, these applications have high computational demands, whereas mobile devices have limited capabilities when compared with non-mobile devices. More importantly, mobile devices rely on batteries for their power supply. We initially measure the battery consumption of different versions of known micro-benchmarks representing common programming primitives found in scientific applications. Then, we analyze the performance of such micro-benchmarks in CPU-intensive mobile applications. We apply good programming practices and code refactorings to reduce battery consumption of scientific mobile applications. Our results show the reduction in energy usage from applying these refactorings to three scientific applications, and we consequently propose guidelines for high-performance computing applications. Our focus is on Android, the dominant mobile operating system. As a long-term contribution, our results represent one more step in the progress towards hybrid distributed infrastructures comprising fixed and mobile nodes, that is, the so-called mobile grids. Copyright © 2016 John Wiley & Sons, Ltd. Copyright © 2016 John Wiley & Sons, Ltd.
@article{Rodriguez2017763, author = {Rodríguez, A. and Mateos, C. and Zunino, A.}, title = {Improving scientific application execution on android mobile devices via code refactorings}, journal = {Software - Practice and Experience}, year = {2016}, volume = {47}, number = {5}, pages = {763-796}, doi = {10.1002/spe.2419}, url = {https://doi.org/10.1002/spe.2419}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Buenos Aires, Argentina}, author_keywords = {android; code refactoring; computational kernels; scientific computing; smartphones}, document_type = {Article}, source = {Scopus} }
Extending JASAG with data processing techniques for speeding up agricultural simulation applications: A case study with Simugan

M. Longo, M. Arroqui, J. Rodriguez, C. Machado, C. Mateos, and A. Zunino

Information Processing in Agriculture, Sep 2016

Abs Bib DOI

Resource-intensive agricultural simulation applications have increased the need for gridification tools –i.e., software to transform and scale up the applications using Grid infrastructures–. Previous research has proposed JASAG, a generic gridification tool for agricultural applications, through which the performance of a whole-farm simulation application called Simugan improved considerably. However, JASAG still lacks proper support for efficiently exploiting Grid storage resources, causing significant delays for assembling and summarizing the generated data. In this application note, two different data processing techniques in the context of JASAG are presented to tackle this problem. Simugan was again employed to validate the benefits of these techniques. Experiments using data processing techniques show that the execution time of Simugan was accelerated by a factor of up to 34.34. © 2016 China Agricultural University
@article{Longo2016235, author = {Longo, M. and Arroqui, M. and Rodriguez, J. and Machado, C. and Mateos, C. and Zunino, A.}, title = {Extending JASAG with data processing techniques for speeding up agricultural simulation applications: A case study with Simugan}, journal = {Information Processing in Agriculture}, year = {2016}, volume = {3}, number = {4}, pages = {235-243}, doi = {10.1016/j.inpa.2016.09.001}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85017022666&doi=10.1016%2fj.inpa.2016.09.001&partnerID=40&md5=0742f9d755c12e992272f0f28c8b312b}, affiliation = {ISISTAN – CONICET. Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina; Facultad de Ciencias Veterinarias – UNICEN. Tandil (B7001BBO), Buenos Aires, Argentina; Agencia Nacional de Promoción Científica y Tecnológica (ANPCyT), Argentina}, author_keywords = {Agricultural simulation applications; Data processing; Grid Computing; Gridification; JASAG; Simugan}, document_type = {Article}, source = {Scopus} }

Testing-supported Case-Based Reasoning for Web Service Selection

D. Anabalon, A. De Renzis, M. Garriga, A. Flores, A. Cechich, and A. Zunino

In 2016 IEEE Biennial Congress of Argentina, ARGENCON, Sep 2016

Abs Bib DOI

Web Service discovery and selection deals with the retrieval of the most suitable Web Service, given a required functionality. Addressing an effective solution remains difficult when only functional descriptions of services are available. The Artificial Intelligence (AI) field have contributed significantly to support the Web Services lifecycle. In this paper, we propose an extension of a previous approach that applied Case-Based Reasoning (CBR) for Web Service Selection, in which Web Services are behaviorally tested for conformance of a given required functionality. © 2016 IEEE.

@inproceedings{Anabalon2016,
  author = {Anabalon, D. and De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.},
  title = {Testing-supported Case-Based Reasoning for Web Service Selection},
  booktitle = {2016 IEEE Biennial Congress of Argentina, ARGENCON},
  year = {2016},
  doi = {10.1109/ARGENCON.2016.7585289},
  art_number = {7585289},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84994515697&doi=10.1109%2fARGENCON.2016.7585289&partnerID=40&md5=c40b42d52eae8eba6a9487b2389595f1},
  affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa University, Neuquen, Argentina; ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina},
  document_type = {Conference Paper},
  source = {Scopus}
}

Web Services Interfaces Assessment through Semantic Similarity of Terms

A. De Renzis, M. Garriga, A. Flores, A. Cechich, and A. Zunino

In Proceedings - International Conference of the Chilean Computer Science Society, SCCC, Sep 2016

Abs Bib DOI

This work presents an improvement on a novel Selection Method to develop applications in the context of the Service-Oriented Computing paradigm. We have defined an Interface Compatibility procedure to assess Web Services by exploring the available information from WSDL documents. Such information involves data types from return, parameters and exceptions, and identifiers from parameters and operation names. The lexical database WordNet was originally used as a semantic basis to assess terms from identifiers. In this paper we use the DISCO database as an alternative, to evaluate the independence of the approach w.r.t. the semantic basis. We made a comparative analysis through different experiments with a data-set of 465 real-life Web Services and measured the results using metrics from the Information Retrieval field. © 2014 IEEE.

@inproceedings{DeRenzis201621,
  author = {De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.},
  title = {Web Services Interfaces Assessment through Semantic Similarity of Terms},
  booktitle = {Proceedings - International Conference of the Chilean Computer Science Society, SCCC},
  year = {2016},
  volume = {2016-September},
  pages = {21-24},
  doi = {10.1109/SCCC.2014.34},
  art_number = {7559666},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84989844071&doi=10.1109%2fSCCC.2014.34&partnerID=40&md5=6d13c05e0d5df898bc9020f925042b6d},
  affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa University, Neuquen, Argentina; ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina},
  author_keywords = {DISCO;  Service Integration;  Service Oriented Computing;  Service Selection;  Web Services;  WordNet},
  document_type = {Conference Paper},
  source = {Scopus}
}

An empirical comparison of feature selection methods in problem transformation multi-label classification

J.M. Rodriguez, D. Godoy, and A. Zunino

IEEE Latin America Transactions, Sep 2016

Abs Bib DOI

Multi-label classification (MLC) is a supervised learning problem in which a particular example can be associated with a set of labels instead of a single one as in traditional classification. Many real-world applications, such as Web page classification or resource tagging on the Social Web, are challenging for existing MLC algorithms, because the label space grows exponentially as instance space increases. Under the problem transformation approach, the most common alternative for MLC, multi-label problems are transformed into several single label problems, whose outputs are then aggregated into a prediction to the whole classification problem. Feature selection techniques become crucial in large-scale MLC problems to help reducing dimensionality. However, the impact of feature selection in multi-label setting has not been as extensively studied as in the case of single-label data. In this paper, we present an empirical evaluation of feature selection techniques in the context of the three main problem transformation MLC methods: Binary Relevance, Pair-wise and Label power-set. Experimentation was performed across a number of benchmark datasets for multi-label classification exhibiting varied characteristics, which allows observing the behavior of techniques and assessing their impact according to multiple metrics. © 2003-2012 IEEE.
@article{Rodriguez20163784, author = {Rodriguez, J.M. and Godoy, D. and Zunino, A.}, title = {An empirical comparison of feature selection methods in problem transformation multi-label classification}, journal = {IEEE Latin America Transactions}, year = {2016}, volume = {14}, number = {8}, pages = {3784-3791}, doi = {10.1109/TLA.2016.7786364}, art_number = {7786364}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85007453596&doi=10.1109%2fTLA.2016.7786364&partnerID=40&md5=7d47a68d4584b6889ce8091a43d03ac5}, affiliation = {ISISTAN, Universidad Nacional del Centro de la Provincia de Buenos Aires (UNICEN) - Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET). Tandil, Buenos Aires, Argentina}, author_keywords = {Binary Relevance; Feature Selection; HOMER; Multi-label Classification; Pair-Wise; Problem Transformation Classification}, document_type = {Article}, source = {Scopus} }
Battery-aware centralized schedulers for CPU-bound jobs in mobile Grids

M. Hirsch, J.M. Rodriguez, A. Zunino, and C. Mateos

Pervasive and Mobile Computing, Sep 2016

Abs Bib DOI

Given the relentless growing number of mobile devices, researchers have pointed out that distributed computing environments, such as clusters or even computational Grids, could increase the available resources by scavenging devices’ capabilities. However, this negatively impacts on their batteries. We study centralized job schedulers that aim at exploiting clusters of mobile resources with rather stable devices in terms of connection time. These schedulers outperform a previous centralized scheduler, finishing up to 30% more jobs with the same amount of energy. We also show that the schedulers perform competitively compared to schedulers based on job stealing, which are more difficult to implement and consume more network resources and hence energy. © 2015 Elsevier B.V.
@article{Hirsch201673, author = {Hirsch, M. and Rodriguez, J.M. and Zunino, A. and Mateos, C.}, title = {Battery-aware centralized schedulers for CPU-bound jobs in mobile Grids}, journal = {Pervasive and Mobile Computing}, year = {2016}, volume = {29}, pages = {73-94}, doi = {10.1016/j.pmcj.2015.08.003}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84941249266&doi=10.1016%2fj.pmcj.2015.08.003&partnerID=40&md5=dc8f51228fe4083d1dc61e80b06682d7}, affiliation = {ISISTAN-CONICET Research Institute. Campus Universitario, Tandil, (B7001BBO), Argentina}, author_keywords = {Job scheduling; Job stealing; Mobile devices; Mobile grid; SEAS}, document_type = {Article}, source = {Scopus} }
Case-based Reasoning for Web Service Discovery and Selection

A. De Renzis, M. Garriga, A. Flores, A. Cechich, and A. Zunino

Electronic Notes in Theoretical Computer Science, Sep 2016

Abs Bib DOI

Web Service discovery and selection deal with the retrieval of the most suitable Web Service, given a required functionality. Addressing an effective solution remains difficult when only functional descriptions of services are available. In this paper, we propose a solution by applying Case-based Reasoning, in which the resemblance between a pair of cases is quantified through a similarity function. We show the feasibility of applying Case-based Reasoning for Web Service discovery and selection, by introducing a novel case representation, learning heuristics and three different similarity functions. We also experimentally validate our proposal with a dataset of 62 real-life Web Services, achieving competitive values in terms of well-known Information Retrieval metrics. © 2016 The Authors.
@article{DeRenzis201689, author = {De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.}, title = {Case-based Reasoning for Web Service Discovery and Selection}, journal = {Electronic Notes in Theoretical Computer Science}, year = {2016}, volume = {321}, pages = {89-112}, doi = {10.1016/j.entcs.2016.02.006}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84964669322&doi=10.1016%2fj.entcs.2016.02.006&partnerID=40&md5=9b3266cc2ec6daf7de93ee3e806634bb}, affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa University, Nuequen, Argentina; ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina}, author_keywords = {Case-based Reasoning; Service Discovery; Service Oriented Application; Service Selection; Web services}, document_type = {Conference Paper}, source = {Scopus} }
An analysis of the effects of bad smell-driven refactorings in mobile applications on battery usage

A.V. Rodríguez, A. Zunino, C. Mateos, and L.M. Longo

Sep 2016

Abs Bib DOI

Mobile devices are the most popular kind of computational device in the world. These devices have more limited resources than personal computers and battery consumption is always under user’s eye since mobile devices rely on their battery as energy supply. On the other hand, nowadays most applications are developed using object-oriented paradigm, which has some inherent features, like object creation, that consume important amounts of energy in the context of mobile development. These features are responsible for offering maintainability and flexibility, among other software quality-related advantages. Then, this chapter aims to present an analysis to evaluate the trade-off between object-oriented design purity and battery consumption. As a result, developers can design mobile applications taking into account these two issues, giving priority to object design quality and/or energy efficiency as needed. © 2016 by IGI Global. All rights reserved.
@book{Rodríguez2016155, author = {Rodríguez, A.V. and Zunino, A. and Mateos, C. and Longo, L.M.}, title = {An analysis of the effects of bad smell-driven refactorings in mobile applications on battery usage}, journal = {Modern Software Engineering Methodologies for Mobile and Cloud Environments}, year = {2016}, pages = {155-175}, doi = {10.4018/978-1-4666-9916-8.ch009}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84982218436&doi=10.4018%2f978-1-4666-9916-8.ch009&partnerID=40&md5=546245da530cff16cfc23f190c8a088d}, affiliation = {Universidad Nacional del Centro de la Provincia de Buenos Aires (UNICEN), Argentina; Instituto de Sistemas Tandil (ISISTAN), Argentina}, document_type = {Book Chapter}, source = {Scopus} }
Energy implications of common operations in resource-intensive java-based scientific applications

C. Mateos, A. Rodriguez, M. Longo, and A. Zunino

Advances in Intelligent Systems and Computing, Sep 2016

Abs Bib DOI

Today’s scientific applications usually take considerable time to run, and hence parallel computing environments, such as Grids and data centers/Clouds, have emerged. Indeed, traditionally, much research in high-performance computing has been conducted with the goal of executing such applications as fast as possible. However, energy has recently been recognized as another crucial goal to consider, because of its negative economic and ecological implications. Energy-driven solutions in these environments are mostly focused on the hardware and middleware layers, but little efforts target the application level. We revisit a catalog of primitives commonly used in object oriented-based scientific programming, or micro-benchmarks, to identify energy-friendly variants of the same primitive. Based on this, we refactor three existing scientific applications, resulting in energy improvements ranging from 2.58% to 96.74%. © Springer International Publishing Switzerland 2016.
@article{Mateos2016739, author = {Mateos, C. and Rodriguez, A. and Longo, M. and Zunino, A.}, title = {Energy implications of common operations in resource-intensive java-based scientific applications}, journal = {Advances in Intelligent Systems and Computing}, year = {2016}, volume = {444}, pages = {739-748}, doi = {10.1007/978-3-319-31232-3_69}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961637097&doi=10.1007%2f978-3-319-31232-3_69&partnerID=40&md5=f04b3d630508016aefc6b905d24e3d8e}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, Buenos Aires, B7001BBO, Argentina}, author_keywords = {Energy; Java; Micro-benchmarks; Scientific application}, document_type = {Conference Paper}, source = {Scopus} }
Assessing cognitive complexity in Java-based Object-Oriented systems: Metrics and tool support

M. Crasso, C. Mateos, A. Zunino, S. Misra, and P. Polvorín

Computing and Informatics, Sep 2016

Abs Bib

Software cognitive complexity refers to how demanding the mental process of performing tasks such as coding, testing, debugging, or modifying source code is. Achieving low levels of cognitive complexity is crucial for ensuring high levels of software maintainability, which is one of the most rewardful software quality attributes. Therefore, in order to control and ensure software maintainability, it is first necessary to accurately quantify software cognitive complexity. In this line, this paper presents a software metric to assess cognitive complexity in Object-Oriented (OO) systems, and particularly those developed in the Java language, which is very popular among OO programming languages. The proposed metric is based on a characterization of basic control structures present in Java systems. Several algorithms to compute the metric and their materialization in the Eclipse IDE are also introduced. Finally, a theoretical validation of the metric against a framework specially designed to validate software complexity metrics is presented, and the applicability of the tool is shown by illustrating the metric in the context of ten real world Java projects and relevant metrics from the well-known Chidamber-Kemerer metric suite.
@article{Crasso2016497, author = {Crasso, M. and Mateos, C. and Zunino, A. and Misra, S. and Polvorín, P.}, title = {Assessing cognitive complexity in Java-based Object-Oriented systems: Metrics and tool support}, journal = {Computing and Informatics}, year = {2016}, volume = {35}, number = {3}, pages = {497-527}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84989201315&partnerID=40&md5=e4d3056fe524fe39c2d421deac0f15aa}, affiliation = {IBM Research, Mar del Plata, Buenos Aires, Argentina; ISISTAN, CONICET, UNICEN, University Campus Universitario, Tandil, Buenos Aires, B7001BBO, Argentina; Atilim University, Ankara, Turkey; ProcessOne, Paris, France}, author_keywords = {Basic control structures; CK metric suite; Java; Software cognitive complexity}, document_type = {Article}, source = {Scopus} }
An evaluation of distributed processing models for randomwalk-based link prediction algorithms over social big data

A. Corbellini, C. Mateos, D. Godoy, A. Zunino, and S. Schiaffino

Advances in Intelligent Systems and Computing, Sep 2016

Abs Bib DOI

The problem of inferring missing relationships between people in online social networks such as Facebook, Google+ and Twitter is currently being given much attention due to its enormous applicability. To this end, link prediction algorithms which operate on graph data have been considered. However, the relentless increase of the size of such networks calls for distributed processing models able to cope with the associated big amounts of data. In this paper, we study the suitability of three models (Fork-Join, Pregel and DPM) for scaling up a common class of such algorithms, i.e. random walk-based. Broadly, Fork-Join and Pregel promote two rather different ways of creating and handling parallel sub-computations, while DPM is a model combining the best of both. Experiments performed with the Twitter graph and two classical random walk-based algorithms named HITS and SALSA show that DPM outperforms Fork-Join and Pregel by [30-40]% and [10-20]% respectively in terms of recommendation time. © Springer International Publishing Switzerland 2016.
@article{Corbellini2016919, author = {Corbellini, A. and Mateos, C. and Godoy, D. and Zunino, A. and Schiaffino, S.}, title = {An evaluation of distributed processing models for randomwalk-based link prediction algorithms over social big data}, journal = {Advances in Intelligent Systems and Computing}, year = {2016}, volume = {444}, pages = {919-928}, doi = {10.1007/978-3-319-31232-3_87}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84961675274&doi=10.1007%2f978-3-319-31232-3_87&partnerID=40&md5=74a39f3b706510de2e80d2e8dbfb1dde}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, Buenos Aires, B7001BBO, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Big data; Fork-Join; HITS; Link prediction; Online social networks; Pregel; SALSA}, document_type = {Conference Paper}, source = {Scopus} }
RESTful service composition at a glance: A survey

M. Garriga, C. Mateos, A. Flores, A. Cechich, and A. Zunino

Journal of Network and Computer Applications, Sep 2016

Abs Bib DOI

In the last years, Web Service composition has undoubtedly become the most promising way to integrate business-to-business applications. However, the industry and the academia often disagree on materializing current solutions, which are based on either SOAP Web Services or semantic Web Services. Besides, any service composition mechanism entails multiple and complex factors such as adaptability, scalability and lightweightness. Recently, RESTful services have shown their potential to compose reliable and visible Web-scale applications based on the so-called mashups. In this paper, we survey a comprehensive set of RESTful composition approaches, i.e., the most promising in their area, totaling 29 approaches. Then, we propose two sets of features to analyze, characterize and compare such approaches: features inherent to SOAP services composition approaches and RESTful services composition features. Lastly, we discuss research challenges and open research problems in the area. © 2015 Elsevier Ltd.
@article{Garriga201632, author = {Garriga, M. and Mateos, C. and Flores, A. and Cechich, A. and Zunino, A.}, title = {RESTful service composition at a glance: A survey}, journal = {Journal of Network and Computer Applications}, year = {2016}, volume = {60}, pages = {32-53}, doi = {10.1016/j.jnca.2015.11.020}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84950970606&doi=10.1016%2fj.jnca.2015.11.020&partnerID=40&md5=38ff1aaae91804402ac4d598b27ba307}, affiliation = {GIISCo Research Group, University of Comahue, Buenos Aires 1400, Neuquen, 8300, Argentina; ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Restful services; Service composition; Service mashups; Web Services}, document_type = {Review}, source = {Scopus} }

2015

Improving REST Service Discovery with Unsupervised Learning Techniques

J.M. Rodriguez, A. Zunino, C. Mateos, F.O. Segura, and E. Rodriguez

In Proceedings - 2015 9th International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS, Sep 2015

Abs Bib DOI

Discovery and replacement are two of the main features of Service Oriented Computing. There has been much research on these topics for traditional SOAP-based Web Services, particularly on discovery. Although the original proposal for REST services lacks this feature, some researchers have studied how to perform discovery for REST services using both IR based techniques and semantic techniques. This work presents a novel IR-based discovery approach for REST services described via WADL files. Our approach takes advantage of unsupervised machine learning techniques for improving discovering results. In particular, the approach relies on clustering algorithms, such as K-means or X-means, to reduce the search space for a given query. The experimental results show that using an appropriate clustering technique, our approach achieves nearly 4 times higher F-measure than a traditional IR-based search engine, namely Apache Lucene. Additionally, the paper reports other metrics, such as Recall, Precision, Precision at-10 and Recall at-10, that also point out that the proposed approach outperforms Lucene. Finally, another important contribution is a set of queries and WADL files gathered from the Internet that can be used for evaluating future discovery proposals. © 2015 IEEE.
@inproceedings{Rodriguez201597, author = {Rodriguez, J.M. and Zunino, A. and Mateos, C. and Segura, F.O. and Rodriguez, E.}, title = {Improving REST Service Discovery with Unsupervised Learning Techniques}, booktitle = {Proceedings - 2015 9th International Conference on Complex, Intelligent, and Software Intensive Systems, CISIS}, year = {2015}, pages = {97-104}, doi = {10.1109/CISIS.2015.14}, art_number = {7185172}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84959511262&doi=10.1109%2fCISIS.2015.14&partnerID=40&md5=f603d357700bf78d17cce3fa2613d04e}, affiliation = {ISISTAN - Research Institute, Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Tandil, Argentina; Facultad de Ciencias Exactas, UNICEN, Tandil, Argentina}, author_keywords = {Information Retrieval; REST; Services Discovery; WADL}, document_type = {Conference Paper}, source = {Scopus} }
A tool to improve code-first Web services discoverability through text mining techniques

C. Mateos, J.M. Rodriguez, and A. Zunino

Software - Practice and Experience, Sep 2015

Abs Bib DOI

SummaryService-oriented development is challenging mainly because Web service developers tend to disregard the importance of the exposed service APIs, which are specified using Web Service Description Language (WSDL) documents. Methodologically, WSDL documents can be either manually generated or inferred from service implementations using WSDL generation tools. The latter option, called code first, is the most used approach in the industry. However, it is known that there are some bad practices in service implementations or defects in WSDL generation tools that may cause WSDL documents to present WSDL anti-patterns, which in turn compromise the chances of documents of being discovered and understood. In this paper, we present a software tool that assists developers in obtaining WSDL documents with as few WSDL anti-patterns as possible. The tool combines text mining and meta-programming techniques to process service implementations and is developed as an Eclipse plug-in. An evaluation of the tool by using a data-set of real service implementations in terms of anti-pattern avoidance accuracy and discovery performance by using classical Information Retrieval metrics - Precision-at-n, Recall and Normalized Discounted Cumulative Gain - is also reported. Copyright © 2014 John Wiley & Sons, Ltd.
@article{Mateos2015925, author = {Mateos, C. and Rodriguez, J.M. and Zunino, A.}, title = {A tool to improve code-first Web services discoverability through text mining techniques}, journal = {Software - Practice and Experience}, year = {2015}, volume = {45}, number = {7}, pages = {925-948}, doi = {10.1002/spe.2268}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84930381813&doi=10.1002%2fspe.2268&partnerID=40&md5=6a18a2e4fc2d83b0e1a369a32ca3fd52}, affiliation = {ISISTAN, CONICET - UNICEN, Tandil, Buenos Aires, B7001BBO, Argentina}, author_keywords = {automatic detection; code first; service discovery; Web services; WSDL anti-patterns}, document_type = {Conference Paper}, source = {Scopus} }
Publication practices in the Argentinian Computer Science community: a bibliometric perspective

D. Godoy, A. Zunino, and C. Mateos

Scientometrics, Sep 2015

Abs Bib DOI

The Computer Science (CS) community has been discussing, for some time now, the role of conferences as publication venues. In this regard, computer scientists claim to have a long-standing tradition in publishing their research results in conferences, which are also recognized as being different to events in other disciplines. This practice, however, contrasts with journal driven publication practices which are the prevailing academic standard. Consequently, the assessment of the quality of CS conferences with respect to journals is a recurrent topic of discussion within evaluation boards in charge of judging researchers’ performance. Even when agreements are feasible inside the discipline, they are often subject to the scrutiny in the context of multi-disciplinary evaluation boards—usually ruled by standard bibliometrics—in which CS researchers compete for obtaining scholarships, positions and funding. The Argentinian CS community is not an exception in this respect. In this paper, we present a study of the publication practices of the Argentinian CS community, their evolution over time and, more importantly, the impact they achieved in terms of citations. The findings of this study are good basis for understanding the publishing practices of our community, promoting future discussions as well as supporting the community positions regarding these issues. © 2014, Akadémiai Kiadó, Budapest, Hungary.
@article{Godoy20151795, author = {Godoy, D. and Zunino, A. and Mateos, C.}, title = {Publication practices in the Argentinian Computer Science community: a bibliometric perspective}, journal = {Scientometrics}, year = {2015}, volume = {102}, number = {2}, pages = {1795-1814}, doi = {10.1007/s11192-014-1450-0}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84921894452&doi=10.1007%2fs11192-014-1450-0&partnerID=40&md5=b903bc5f7c0f637bea4eccec524bcbe0}, affiliation = {ISISTAN Research Institute - Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Universidad Nacional del Centro de la Provincia de Buenos Aires (UNICEN), University Campus, Paraje Arroyo Seco (BBO7001B), Tandil, Buenos Aires, Argentina}, author_keywords = {Computer science; Conferences and journals; Publication practices}, document_type = {Article}, source = {Scopus} }

Web services composition mechanisms: A review

M. Garriga, A. Flores, A. Cechich, and A. Zunino

IETE Technical Review (Institution of Electronics and Telecommunication Engineers, India), Sep 2015

Abs Bib DOI

Web Service composition is becoming the most promising way for business-to-business systems integration. However, current mechanisms for service composition entail a trade-off on multiple and complex factors. Thereby existing solutions based on business Web Services, semantic Web Services, or the recent RESTful services, lack of a standardized adoption. This paper gives an overview of current approaches according to a set of features. Moreover, related core problems and future directions of service composition mechanisms are pointed out. Copyright © 2015 by the IETE.

@article{Garriga2015376,
  author = {Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.},
  title = {Web services composition mechanisms: A review},
  journal = {IETE Technical Review (Institution of Electronics and Telecommunication Engineers, India)},
  year = {2015},
  volume = {32},
  number = {5},
  pages = {376-383},
  doi = {10.1080/02564602.2015.1019942},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84973470515&doi=10.1080%2f02564602.2015.1019942&partnerID=40&md5=170992124d2966d77ee7e4749313323d},
  affiliation = {GIISCo Research Group, Facultad de Informática, Universidad Nacional del Comahue, Neuquen, Argentina; CONICET (National Scientific and Technical Research Council), Argentina; ISISTAN Research Institute, UNICEN, Tandil, Buenos Aires, Argentina},
  author_keywords = {Choreography;  Mashup;  Orchestration;  Service composition;  Web services;  Workflow},
  document_type = {Review},
  source = {Scopus}
}

A stitch in time saves nine: Early improving code-first web services discoverability

C. Mateos, M. Crasso, A. Zunino, and J.L. Ordiales Coscia

International Journal of Cooperative Information Systems, Sep 2015

Abs Bib DOI

Web Services represent a number of standard technologies and methodologies that allow developers to build applications under the Service-Oriented Computing paradigm. Within these, the WSDL language is used for representing Web Service interfaces, while code-first remains the de facto standard for building such interfaces. Previous studies with contract-first Web Services have shown that avoiding a specific catalog of bad WSDL specification practices, or anti-patterns, can reward Web Service publishers as service understandability and discoverability are considerably improved. In this paper, we study a number of simple and well-known code service refactorings that early reduce anti-pattern occurrences in WSDL documents. This relationship relies upon a statistical correlation between common OO metrics taken on a service’s code and the anti-pattern occurrences in the generated WSDL document. We quantify the effects of the refactorings - which directly modify OO metric values and indirectly alter anti-pattern occurrences - on service discovery. All in all, we show that by applying the studied refactorings, anti-patterns are reduced and Web Service discovery is significantly improved. For the experiments, a dataset of real-world Web Services and an academic service registry have been employed. © 2015 World Scientific Publishing Company.
@article{Mateos2015, author = {Mateos, C. and Crasso, M. and Zunino, A. and Ordiales Coscia, J.L.}, title = {A stitch in time saves nine: Early improving code-first web services discoverability}, journal = {International Journal of Cooperative Information Systems}, year = {2015}, volume = {24}, number = {2}, doi = {10.1142/S0218843015500045}, art_number = {1550004}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84938604784&doi=10.1142%2fS0218843015500045&partnerID=40&md5=cbbd1483457e5531c596e40b9c9fb1c1}, affiliation = {ISISTAN-CONICET, Universidad Nacional Del Centro de la Provincia de Buenos Aires, Campus Universitario, Paraje Arroyo Seco, Tandil, Buenos Aires, B7001BBO, Argentina; IBM Research, Argentina; Klarna, Sweden}, author_keywords = {code-first; object-oriented metrics; Service-Oriented Computing; Web Services; Web Services Discovery; WSDL anti-Patterns}, document_type = {Article}, source = {Scopus} }
An architecture and platform for developing distributed recommendation algorithms on large-scale social networks

A. Corbellini, C. Mateos, D. Godoy, A. Zunino, and S. Schiaffino

Journal of Information Science, Sep 2015

Abs Bib DOI

The creation of new and better recommendation algorithms for social networks is currently receiving much attention owing to the increasing need for new tools to assist users. The volume of available social data as well as experimental datasets force recommendation algorithms to scale to many computers. Given that social networks can be modelled as graphs, a distributed graph-oriented support able to exploit computer clusters arises as a necessity. In this work, we propose an architecture, called Lightweight-Massive Graph Processing Architecture, which simplifies the design of graph-based recommendation algorithms on clusters of computers, and a Java implementation for this architecture composed of two parts: Graphly, an API offering operations to access graphs; and jLiME, a framework that supports the distribution of algorithm code and graph data. The motivation behind the creation of this architecture is to allow users to define recommendation algorithms through the API and then customize their execution using job distribution strategies, without modifying the original algorithm. Thus, algorithms can be programmed and evaluated without the burden of thinking about distribution and parallel concerns, while still supporting environment-level tuning of the distributed execution. To validate the proposal, the current implementation of the architecture was tested using a followee recommendation algorithm for Twitter as case study. These experiments illustrate the graph API, quantitatively evaluate different job distribution strategies w.r.t. recommendation time and resource usage, and demonstrate the importance of providing non-invasive tuning for recommendation algorithms. © Chartered Institute of Library and Information Professionals.
@article{Corbellini2015686, author = {Corbellini, A. and Mateos, C. and Godoy, D. and Zunino, A. and Schiaffino, S.}, title = {An architecture and platform for developing distributed recommendation algorithms on large-scale social networks}, journal = {Journal of Information Science}, year = {2015}, volume = {41}, number = {5}, pages = {686-704}, doi = {10.1177/0165551515588669}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84942105316&doi=10.1177%2f0165551515588669&partnerID=40&md5=dd2b4869360f25c19ad93f7b1399fa8b}, affiliation = {ISISTAN Research Institute, UNICEN UniversityB7001BBO, Argentina}, author_keywords = {Graph databases; graph-processing frameworks; large-scale processing; recommendation algorithms; social networks; work scheduling}, document_type = {Article}, source = {Scopus} }
Measuring the impact of the approach to migration in the quality of web service interfaces

C. Mateos, M. Crasso, J.M. Rodriguez, A. Zunino, and M. Campo

Enterprise Information Systems, Sep 2015

Abs Bib DOI

There is a good consensus on the strategic value of service-oriented architecture (SOA) as a way of structuring systems, and a common trend is to migrate legacy applications that use outdated technologies and architectures to SOA. We study the effects in the resulting Web Service interfaces of applying two traditional migration approaches combined with common ways of building services, namely, direct migration with code-first and indirect migration with contract-first. The migrated system was a 35-year-old COBOL system of a government agency that serves several millions of users. In addition, we provide a deep explanation of the trade-offs involved in following either combinations. Results confirm that the ‘fast and cheap’ approach to move into SOA, which is commonplace in the industry, may deliver poor service interfaces, and interface quality is also subject to the tools supporting the migration process. © 2012, © 2012 Taylor & Francis.
@article{Mateos201558, author = {Mateos, C. and Crasso, M. and Rodriguez, J.M. and Zunino, A. and Campo, M.}, title = {Measuring the impact of the approach to migration in the quality of web service interfaces}, journal = {Enterprise Information Systems}, year = {2015}, volume = {9}, number = {1}, pages = {58-85}, doi = {10.1080/17517575.2012.717234}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84911058951&doi=10.1080%2f17517575.2012.717234&partnerID=40&md5=bb1c88ec543ca382a96a80114fa2b09b}, affiliation = {ISISTAN Research Institute – UNICEN, Campus Universitario, Tandil, Buenos Aires, B7001BBO, Argentina; CONICET (Consejo Nacional de Investigaciones Científicas y Técnicas), Av. Rivadavia 1917, Buenos Aires, C1033AAJ, Argentina}, author_keywords = {code-first; contract-first; direct migration; indirect migration; legacy system migration; service interface design; service modelling; services-oriented architectures; web services}, document_type = {Article}, source = {Scopus} }

2014

Detecting botnet traffic from a single host

S. García, A. Zunino, and M. Campo

Sep 2014

Abs Bib DOI

The detection of bots and botnets in the network may be improved if the analysis is done on the traffic of one bot alone. While a botnet may be detected by correlating the behavior of several bots in a large amount of traffic, one bot alone can be detected by analyzing its unique trends in less traffic. The algorithms to differentiate the traffic of one bot from the normal traffic of one computer may take advantage of these differences. The authors propose to detect bots in the network by analyzing the relationships between flow features in a time window. The technique is based on the Expectation-Maximization clustering algorithm. To verify the method they designed test-beds and obtained a dataset of six different captures. The results are encouraging, showing a true positive error rate of 99.08% with a false positive error rate of 0.7%. © 2015, IGI Global.
@book{García2014426, author = {García, S. and Zunino, A. and Campo, M.}, title = {Detecting botnet traffic from a single host}, journal = {Handbook of Research on Emerging Developments in Data Privacy}, year = {2014}, pages = {426-446}, doi = {10.4018/978-1-4666-7381-6.ch019}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84946142375&doi=10.4018%2f978-1-4666-7381-6.ch019&partnerID=40&md5=aa9fa487c96de4b9b5baa7ffc3fbbb02}, affiliation = {UNICEN, Argentina; Agents Technology Group, Czech Technical University, Czech Republic; ISISTAN Research Institute, Argentina; CONICET, Argentina}, document_type = {Book Chapter}, source = {Scopus} }
Refactoring code-first Web Services for early avoiding WSDL anti-patterns: Approach and comprehensive assessment

J.L. Ordiales Coscia, C. Mateos, M. Crasso, and A. Zunino

Science of Computer Programming, Sep 2014

Abs Bib DOI

Previous research of our own [34] has shown that by avoiding certain bad specification practices, or WSDL anti-patterns, contract-first Web Service descriptions expressed in WSDL can be greatly improved in terms of understandability and retrievability. The former means the capability of a human discoverer to effectively reason about a Web Service functionality just by inspecting its associated WSDL description. The latter means correctly retrieving a relevant Web Service by a syntactic service registry upon a meaningful user’s query. However, code-first service construction dominates in the industry due to its simplicity. This paper proposes an approach to avoid WSDL anti-patterns in code-first Web Services. We also evaluate the approach in terms of services understandability and retrievability, deeply discuss the experimental results, and delineate some guidelines to help code-first Web Service developers in dealing with the trade-offs that arise between these two dimensions. Certainly, our approach allows services to be more understandable, due to anti-pattern remotion, and retrievable as measured by classical Information Retrieval metrics. © 2014 Elsevier B.V. All rights reserved.
@article{OrdialesCoscia2014374, author = {Ordiales Coscia, J.L. and Mateos, C. and Crasso, M. and Zunino, A.}, title = {Refactoring code-first Web Services for early avoiding WSDL anti-patterns: Approach and comprehensive assessment}, journal = {Science of Computer Programming}, year = {2014}, volume = {89}, number = {PART C}, pages = {374-407}, doi = {10.1016/j.scico.2014.03.015}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84900310154&doi=10.1016%2fj.scico.2014.03.015&partnerID=40&md5=79cab09e033a159e067b29242f483bbc}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil B7001BBO, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Code-first; Service retrievability; Service understandability; Web services; WSDL anti-patterns}, document_type = {Article}, source = {Scopus} }
EasySOC: Making web service outsourcing easier

M. Crasso, C. Mateos, A. Zunino, and M. Campo

Information Sciences, Sep 2014

Abs Bib DOI

Service-oriented computing has been widely recognized as a revolutionary paradigm for software development. Despite the important benefits this paradigm provides, current approaches for service-enabling applications still lead to high costs for outsourcing services with regard to two phases of the software life cycle. During the implementation phase, developers have to invest much effort into manually discovering services and then providing code to invoke them. Mostly, the outcome of the second task is software containing service-aware code, therefore it is more difficult to modify and to test during the maintenance phase. This paper describes EasySOC, an approach that aims to decrease the costs of creating and maintaining service-oriented applications. EasySOC combines text mining, machine learning, and best practices from component-based software development to allow developers to quickly discover and non-invasively invoke services. We evaluated the performance of the EasySOC discovery mechanism using 391 services. In addition, through a case study, we conducted a comparative analysis of the software technical quality achieved by employing EasySOC versus not using it. © 2013 Elsevier Inc. All rights reserved.
@article{Crasso2014452, author = {Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {EasySOC: Making web service outsourcing easier}, journal = {Information Sciences}, year = {2014}, volume = {259}, pages = {452-473}, doi = {10.1016/j.ins.2010.01.013}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84889634421&doi=10.1016%2fj.ins.2010.01.013&partnerID=40&md5=1dc898a3a018ef0e238ac9c9b571dee1}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientficas y Tcnicas (CONICET), Argentina}, author_keywords = {Dependency injection; Machine learning; Service outsourcing; Service-oriented computing; Text mining}, document_type = {Article}, source = {Scopus} }
Energy-efficient job stealing for CPU-intensive processing in mobile devices

J.M. Rodriguez, C. Mateos, and A. Zunino

Computing, Sep 2014

Abs Bib DOI

Mobile devices have evolved from simple electronic agendas and mobile phones to small computers with great computational capabilities. In addition, there are more than 2 billion mobile devices around the world. Taking these facts into account, mobile devices are a potential source of computational resources for clusters and computational Grids. In this work, we present an analysis of different schedulers based on job stealing for mobile computational Grids. These job stealing techniques have been designed to consider energy consumption and battery status. As a result of this work, we present empirical evidence showing that energy-aware job stealing is more efficient than traditional random stealing in this context. In particular, our results show that mobile Grids using energy-aware job stealing might finish up to 11 % more jobs than when using random stealing, and up to 24 % more jobs than when not using any job stealing technique. This means that using energy-aware job stealing increases the energy efficiency of mobile computational Grids because it increases the number of jobs that can be executed using the same amount of energy. © 2012 Springer-Verlag Wien.
@article{Rodriguez201487, author = {Rodriguez, J.M. and Mateos, C. and Zunino, A.}, title = {Energy-efficient job stealing for CPU-intensive processing in mobile devices}, journal = {Computing}, year = {2014}, volume = {96}, number = {2}, pages = {87-117}, doi = {10.1007/s00607-012-0245-5}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84894103891&doi=10.1007%2fs00607-012-0245-5&partnerID=40&md5=0fbda7accf3119bd3e3ca5dc3c2af156}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Buenos Aires, Argentina}, author_keywords = {CPU intensive application; Job scheduling; Job stealing; Mobile devices; Mobile Grid}, document_type = {Article}, source = {Scopus} }
An approach for managing quality attributes at runtime using feature models

L.E. Sanchez, J.A. Diaz-Pace, A. Zunino, S. Moisan, and J.-P. Rigault

In Proceedings - 2014 8th Brazilian Symposium on Software Components, Architectures and Reuse, SBCARS, Sep 2014

Abs Bib DOI

Feature modeling has been widely used in domain engineering for the development and configuration of software products. A feature model represents the set of possible configurations to apply in a given context. Recently, this formalism was applied to the runtime (re-)configuration of systems with high variability and context changes, in which the selection of the best candidate configuration is seen as an optimization problem based on quality criteria. To this end, we propose an approach for the specification, measurement and optimization of runtime quality attributes based on feature models, and furthermore, we describe its integration into a component-based architecture for supporting dynamically adaptive systems. Feature models are annotated with quality-attribute properties and metrics, and then an efficient and flexible algorithm is used to deal with the optimization problem. We report on some examples of adaptation and quality-attribute scenarios in the context of a video surveillance domain, in order to illustrate the pros and cons of our approach. © 2014 IEEE.
@inproceedings{Sanchez201411, author = {Sanchez, L.E. and Diaz-Pace, J.A. and Zunino, A. and Moisan, S. and Rigault, J.-P.}, title = {An approach for managing quality attributes at runtime using feature models}, booktitle = {Proceedings - 2014 8th Brazilian Symposium on Software Components, Architectures and Reuse, SBCARS}, year = {2014}, pages = {11-20}, doi = {10.1109/SBCARS.2014.13}, art_number = {7012978}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84946689680&doi=10.1109%2fSBCARS.2014.13&partnerID=40&md5=e9bc2f983a5e3ed71b3d533f67bdbdc4}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, Buenos Aires, Argentina; INRIA Sophia Antipolis Méditerrannée, Route des Lucioles 06902, Sophia Antipolis Cedex, France}, author_keywords = {Component-Based Software Engineering; Dynamic Software Product Lines; Feature Models; Optimization; Quality Attributes; Runtime Adaptation}, document_type = {Conference Paper}, source = {Scopus} }

PFS: A productivity forecasting system for desktop computers to improve grid applications performance in enterprise desktop grid

S.A. Salinas, C. García Garino, and A. Zunino

Computing and Informatics, Sep 2014

Abs Bib

An Enterprise Desktop Grid (EDG) is a low cost platform that gathers desktop computers spread over different institutions. This platform uses desktop computers idle time to run grid applications. We argue that computers in these environments have a predictable productivity that affects a grid application execution time. In this paper, we propose a system called PFS for computer productivity forecasting that improves grid applications performance. We simulated 157 500 applications and compared the performance achieved by our proposal against two recent strategies. Our experiments show that a grid scheduler based on PFS runs applications faster than schedulers based on other selection strategies.

@article{Salinas2014783,
  author = {Salinas, S.A. and García Garino, C. and Zunino, A.},
  title = {PFS: A productivity forecasting system for desktop computers to improve grid applications performance in enterprise desktop grid},
  journal = {Computing and Informatics},
  year = {2014},
  volume = {33},
  number = {4},
  pages = {783-809},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84921833442&partnerID=40&md5=1f25e555ddfd0e418632c057ff88c6ba},
  affiliation = {ITIC Research Institute, Universidad Nacional de Cuyo, ECT, Padre Jorge Contreras 1300, Mendoza, M5500, Argentina; ITIC Research Institute, Facultad de Ingeniería, Universidad Nacional de Cuyo, Centro Universitario, Mendoza, M5500, Argentina; CONICET - ISISTAN Research Institute, UNICEN University Parajc Arroyo Seco, Tandil, Buenos Aires, B7001BBO, Argentina},
  author_keywords = {Computer productivity forecasting;  Enterprise Desktop Grid;  Grid scheduling systems;  Heuristic method;  Prediction methods},
  document_type = {Article},
  source = {Scopus}
}

Survey on network-based botnet detection methods

S. García, A. Zunino, and M. Campo

Security and Communication Networks, Sep 2014

Abs Bib DOI

Botnets are an important security problem on the Internet. They continuously evolve their structure, protocols and attacks. This survey analyzes and compares the most important efforts carried out in a network-based detection area. It accomplishes four tasks: first, the comparison of previous surveys and the proposal of four new dimensions to analyze their classification schemes; second, a new classification and comparison of network-based botnet detection proposals, which includes the definition of 20 desired properties of every botnet detection paper; third, an extensive comparison between the most representative detection proposals; and fourth, the description of the most important problems and highlights in the area. We conclude that the area has achieved great advances so far, but there are still many open problems. © 2013 John Wiley & Sons, Ltd.
@article{García2014878, author = {García, S. and Zunino, A. and Campo, M.}, title = {Survey on network-based botnet detection methods}, journal = {Security and Communication Networks}, year = {2014}, volume = {7}, number = {5}, pages = {878-903}, doi = {10.1002/sec.800}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84898468370&doi=10.1002%2fsec.800&partnerID=40&md5=2c5981d6ac35b322fca8563caa93feac}, affiliation = {ISISTAN Research Institute-CONICET, Faculty of Sciences, Universidad Nacional del Centro de la Provincia de Buenos Aires, University Campus, Paraje Arroyo Seco (BBO7001B), Tandil, Buenos Aires, Argentina}, author_keywords = {Botnets; Information security; Network behavior; Network detection; Survey}, document_type = {Article}, source = {Scopus} }
Multi-label classification using distributed computing [Clasificación multi-etiqueta utilizando computación distribuida]

J.M. Rodriguez, A. Zunino, D. Godoy, and C. Mateos

In 2014 IEEE Biennial Congress of Argentina, ARGENCON, Sep 2014

Abs Bib DOI

Multi-label classification techniques have been developed for problems where objects can be associated to several disjoint labels, such as the scientific topics covered by a paper. However, these techniques tend to be computationally complex, which makes it difficult to use them in practice. Therefore, they might be unsuitable for large problems. This paper presents an approach to accelerate a well-know multi-label classification technique, called Binary Relevance, by using small computational clusters. In this classification technique, the training times grow linearly with the number of labels. In particular, this work aims at reducing the times required for training a Binary Relevance classifier. This approach was tested using 7 data-sets with 81 associated labels and more than a quarter million training instances. Experimental results shown a linear increment on the speed-up when computational nodes are added to the cluster. © 2014 IEEE.
@inproceedings{Rodriguez201490, author = {Rodriguez, J.M. and Zunino, A. and Godoy, D. and Mateos, C.}, title = {Multi-label classification using distributed computing [Clasificación multi-etiqueta utilizando computación distribuida]}, booktitle = {2014 IEEE Biennial Congress of Argentina, ARGENCON}, year = {2014}, pages = {90-95}, doi = {10.1109/ARGENCON.2014.6868477}, art_number = {6868477}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906665882&doi=10.1109%2fARGENCON.2014.6868477&partnerID=40&md5=3655649b20fbe05d68f70117494e831e}, affiliation = {ISISTAN, UNICEN-CONICET, Campus Universitario, Paraje-Arroyo-Saco, Tandil, Buenos Aires, Argentina}, document_type = {Conference Paper}, source = {Scopus} }
Sparse-matrix arithmetic operations in computer clusters: A text feature selection application

A. Tommasel, C. Mateos, D. Godoy, and A. Zunino

In 2014 IEEE Biennial Congress of Argentina, ARGENCON, Sep 2014

Abs Bib DOI

Arithmetic operations on matrices are frequently used in scientific computing areas. They usually become a performance bottleneck due to their high complexity. In this context, the parallel processing of matrix operations in distributed environments arises as an important field of study. This work presents several strategies for distributing sparse matrix arithmetic operations on computer clusters, focusing on the intrinsic characteristics of the operations and the matrices involved. The performance of the proposed strategies for determining the number of parallel tasks to be executed on the computer cluster was evaluated considering a high-dimensional feature selection approach. Additionally, the performance of two alternatives for efficiently representing big-scale sparse matrices was tested. Experimental results showed that the proposed strategies significantly reduce the computing time of matrix operations, outperforming computations based on serial and multi-thread implementations. © 2014 IEEE.
@inproceedings{Tommasel2014458, author = {Tommasel, A. and Mateos, C. and Godoy, D. and Zunino, A.}, title = {Sparse-matrix arithmetic operations in computer clusters: A text feature selection application}, booktitle = {2014 IEEE Biennial Congress of Argentina, ARGENCON}, year = {2014}, pages = {458-463}, doi = {10.1109/ARGENCON.2014.6868535}, art_number = {6868535}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906658521&doi=10.1109%2fARGENCON.2014.6868535&partnerID=40&md5=d034b2fd02611bd1cb333295e98568fc}, affiliation = {ISISTAN Research Institute, CONICET-UNCPBA, Tandil, Buenos Aires, Argentina}, document_type = {Conference Paper}, source = {Scopus} }
An empirical comparison of botnet detection methods

S. García, M. Grill, J. Stiborek, and A. Zunino

Computers and Security, Sep 2014

Abs Bib DOI

The results of botnet detection methods are usually presented without any comparison. Although it is generally accepted that more comparisons with third-party methods may help to improve the area, few papers could do it. Among the factors that prevent a comparison are the difficulties to share a dataset, the lack of a good dataset, the absence of a proper description of the methods and the lack of a comparison methodology. This paper compares the output of three different botnet detection methods by executing them over a new, real, labeled and large botnet dataset. This dataset includes botnet, normal and background traffic. The results of our two methods (BClus and CAMNEP) and BotHunter were compared using a methodology and a novel error metric designed for botnet detections methods. We conclude that comparing methods indeed helps to better estimate how good the methods are, to improve the algorithms, to build better datasets and to build a comparison methodology. © 2014 Elsevier Ltd. All rights reserved.
@article{García2014100, author = {García, S. and Grill, M. and Stiborek, J. and Zunino, A.}, title = {An empirical comparison of botnet detection methods}, journal = {Computers and Security}, year = {2014}, volume = {45}, pages = {100-123}, doi = {10.1016/j.cose.2014.05.011}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84903157026&doi=10.1016%2fj.cose.2014.05.011&partnerID=40&md5=0bde45317036b1ea3623e0ae4e495c9f}, affiliation = {ISISTAN Research Institute - CONICET, Faculty of Sciences, UNICEN University, Argentina; Agents Technology Group, Department of Computer Science and Engineering, Czech Republic}, author_keywords = {Anomaly detection; Botnet dataset; Botnet detection; Malware detection; Methods comparison; Network traffic}, document_type = {Article}, source = {Scopus} }
A software support to initiate systems engineering students in service-oriented computing

C. Mateos, M. Crasso, A. Zunino, and M. Campo

Computer Applications in Engineering Education, Sep 2014

Abs Bib DOI

An evolutionary process that is currently taking place in the software industry is the shift from developing applications from scratch to discovering and assembling services published in the Internet. This has given birth to a new computing paradigm called service-oriented computing (SOC). We investigated whether simplifying and automating tasks inherent to SOC-based development, while exploiting systems engineering students’ experience in earlier paradigms, namely object orientation, reduce the cognitive effort needed to learn SOC. The study involved 38 undergraduate students plus 7 postgraduate students from 4 universities, which attended a course about SOC development models and technologies. Then, they were asked to develop a real-life service-oriented application using two alternatives, namely existing SOC libraries and a software support of our own named EasySOC. EasySOC promotes using common object-oriented design patterns to structure service-oriented applications, facilitates service discovery, and hides many technological details from users. The students were surveyed about their perception on both alternatives using a Likert-based questionnaire. Results show that the students, who had no previous experience in service-oriented notions before the experiment, perceived that EasySOC allows focusing on essential aspects of the paradigm while concealing accidental aspects, and provides adequate support and guidance to bridge the gap. © 2011 Wiley Periodicals, Inc.
@article{Mateos2014252, author = {Mateos, C. and Crasso, M. and Zunino, A. and Campo, M.}, title = {A software support to initiate systems engineering students in service-oriented computing}, journal = {Computer Applications in Engineering Education}, year = {2014}, volume = {22}, number = {2}, pages = {252-265}, doi = {10.1002/cae.20551}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899482392&doi=10.1002%2fcae.20551&partnerID=40&md5=7f952fa81d461f8506a65c0b3f64e8b2}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil B7001BBO, Buenos Aires, Argentina}, author_keywords = {authoring tools and methods; programming and programming languages; service-oriented computing; teaching/learning strategies}, document_type = {Article}, source = {Scopus} }
Semantic-structural assessment scheme for integrability in service-oriented applications

A. De Renzis, M. Garriga, A. Flores, A. Cechich, and A. Zunino

In Proceedings of the 2014 Latin American Computing Conference, CLEI, Sep 2014

Abs Bib DOI

This work improves a novel Service Selection Method for the development of Service-Oriented Applications in the context of the Service-Oriented Computing (SOC) paradigm. We have defined a Semantic-Structural Scheme to assess Web Services on Interface Compatibility exploring the available information from WSDL documents. The structural information involves data types from return, parameters and exceptions. The semantic information concerns identifiers from parameters and operation names. The lexical database WordNet is used as a semantic basis. Two appraisal values were defined: compatibility gap and adaptability gap. The former is centered on functional aspects. The latter explains the adaptation effort to a successful integration. We validated those appraisals values through different experiments with a data-set of 465 real-life Web Services and measured the results using three metrics from the Information Retrieval field. © 2014 IEEE.
@inproceedings{DeRenzis2014, author = {De Renzis, A. and Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.}, title = {Semantic-structural assessment scheme for integrability in service-oriented applications}, booktitle = {Proceedings of the 2014 Latin American Computing Conference, CLEI}, year = {2014}, doi = {10.1109/CLEI.2014.6965175}, art_number = {6965175}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84919459205&doi=10.1109%2fCLEI.2014.6965175&partnerID=40&md5=688c014866bf4b8b3f341e9bbe3b6642}, affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa University, Neuquen, Argentina; ISISTAN Research Institute, UNICEN University Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Service Discovery; Service Integration; Service Oriented Applications; Service Selection; Web Services}, document_type = {Conference Paper}, source = {Scopus} }
A programming interface and platform support for developing recommendation algorithms on large-scale social networks

A. Corbellini, D. Godoy, C. Mateos, A. Zunino, and S. Schiaffino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2014

Abs Bib DOI

Friend recommendation algorithms in large-scale social networks such as Facebook or Twitter usually require the exploration of huge user graphs. In current solutions for parallelizing graph algorithms, the burden of dealing with distributed concerns falls on algorithm developers. In this paper, a simple yet powerful programming interface (API) to implement distributed graph traversal algorithms is presented. A case study on implementing a followee recommendation algorithm for Twitter using the API is described. This case study not only illustrates the simplicity offered by the API for developing algorithms, but also how different aspects of the distributed solutions can be treated and experimented without altering the algorithm code. Experiments evaluating the performance of different job scheduling strategies illustrate the flexibility or our approach. © 2014 Springer International Publishing.
@article{Corbellini201467, author = {Corbellini, A. and Godoy, D. and Mateos, C. and Zunino, A. and Schiaffino, S.}, title = {A programming interface and platform support for developing recommendation algorithms on large-scale social networks}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2014}, volume = {8658 LNCS}, pages = {67-74}, doi = {10.1007/978-3-319-10166-8_6}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84905907398&doi=10.1007%2f978-3-319-10166-8_6&partnerID=40&md5=7f668947b84474310af5b8a535cf33f9}, affiliation = {ISISTAN Research Institute - Consejo Nacional de Investigaciones Cientificas Y Tecnicas (CONICET), Univ. Nacional del Centro de la Provincia de Bs. As. (UNICEN), Campus Universitario, Paraje Arroyo Seco, (BBO7001B), Tandil, Buenos Aires, Argentina}, document_type = {Conference Paper}, source = {Scopus} }
A tool for building retrievable code-first Web Services

M. Hirsch, A. Rodriguez, J.M. Rodriguez, C. Mateos, A. Zunino, and J.L. Ordiales Coscia

In 2014 IEEE Biennial Congress of Argentina, ARGENCON, Sep 2014

Abs Bib DOI

Although producing high quality WSDL documents is a key factor in a Web Service system success, previous works have shown that WSDL document quality, in terms of readability and discoverability, is often disregarded by service developers. One of the main causes of this is that developers do not write the WSDL documents directly. Instead, these documents are automatically generated from service implementations, which are called code-first Web Services. This work presents a novel tool for assisting Java code-first Web Service development that spots potential issues that might lead to low quality WSDL documents. The approach was empirically evaluated using 81 open-source Web Service implementations. The evaluation shows that the WSDL documents generated using our tool can be more easily retrieved from Web Service registries by users. This indirectly implies that these WSDL documents have a better quality than the ones generated using alternative tools. © 2014 IEEE.
@inproceedings{Hirsch2014165, author = {Hirsch, M. and Rodriguez, A. and Rodriguez, J.M. and Mateos, C. and Zunino, A. and Ordiales Coscia, J.L.}, title = {A tool for building retrievable code-first Web Services}, booktitle = {2014 IEEE Biennial Congress of Argentina, ARGENCON}, year = {2014}, pages = {165-170}, doi = {10.1109/ARGENCON.2014.6868490}, art_number = {6868490}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906680044&doi=10.1109%2fARGENCON.2014.6868490&partnerID=40&md5=33784942cd218cf9ff8aa78ee4280492}, affiliation = {ISISTAN, UNICEN-CONICET, Campus Universitario - Paraje Arroyo Seco, Tandil, Buenos Aires, Argentina; ThoughtWorksPorto Alegre, Rio Grande do Sul, Brazil}, document_type = {Conference Paper}, source = {Scopus} }

2013

Revising WSDL documents: Why and how, part 2

C. Mateos, M. Crasso, A. Zunino, and J.L. Ordiales Coscia

IEEE Internet Computing, Sep 2013

Abs Bib DOI

In a previous article, the authors demonstrated that effectively discovering Web services helps developers avoid several common design errors in Web Service Description Language (WSDL) documents. Their proposed guidelines are unfortunately applicable only when publishers follow the top-down, or contract-first, method of building services, which isn’t very popular due to its inherent costs. Here, they present an approach for preventing such errors when using a counterpart method-namely, bottom-up or code-first-and measure the approach’s impact on service discovery. The rationale behind the study is that because code-first service interfaces are automatically generated by tools that-given a service implementation-deterministically map programming language constructs onto WSDL elements, the measurable properties of service implementations could influence resulting service interfaces. © 2013 IEEE.

@article{Mateos201346,
  author = {Mateos, C. and Crasso, M. and Zunino, A. and Ordiales Coscia, J.L.},
  title = {Revising WSDL documents: Why and how, part 2},
  journal = {IEEE Internet Computing},
  year = {2013},
  volume = {17},
  number = {5},
  pages = {46-53},
  doi = {10.1109/MIC.2013.4},
  art_number = {6489973},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84884538564&doi=10.1109%2fMIC.2013.4&partnerID=40&md5=aa0f910715b3f09f1a0e6e583481841a},
  affiliation = {Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Instituto de Sistemas Tandil (ISISTAN), Argentinian National Council for Scientific and Technical Research (CONICET), Argentina; Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Argentina},
  author_keywords = {service architectures;  services discovery process and methodology;  Web Services Description Language;  Web services modeling;  Web services publishing;  WSDL},
  document_type = {Article},
  source = {Scopus}
}

An evaluation on developer’s perception of XML schema complexity metrics for web services

M. Crasso, C. Mateos, J.L.O. Coscia, A. Zunino, and S. Misra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2013

Abs Bib DOI

Undoubtedly, the Service-Oriented Computing (SOC) is not an incipient computing paradigm anymore, while Web Services technologies is now a very mature stack of technologies. Both have been steadily gaining maturity as their adoption in the software industry grew. Accordingly, several metric suites for assessing different quality attributes of Web Services have been recently proposed. In particular, researchers have focused on measuring services interfaces descriptions, which like any other software artifact, have a measurable size, complexity and quality. This paper presents a study that assesses human perception of some recent services interfaces complexity metrics (Basci and Misra’s metrics suite). Empirical evidence suggests that a service interface that it is not complex for a software application, in terms of time and space required to analyze it, will not be necessarily well designed, in terms of best practices for designing Web Services. A Likert-based questionnaire was used to gather individuals opinions about this topic. © 2013 Springer-Verlag Berlin Heidelberg.
@article{Crasso2013475, author = {Crasso, M. and Mateos, C. and Coscia, J.L.O. and Zunino, A. and Misra, S.}, title = {An evaluation on developer's perception of XML schema complexity metrics for web services}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2013}, volume = {7972 LNCS}, number = {PART 2}, pages = {475-486}, doi = {10.1007/978-3-642-39643-4_34}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880763128&doi=10.1007%2f978-3-642-39643-4_34&partnerID=40&md5=9f8813b47b4fa505755dfcd7325eb19c}, affiliation = {ISISTAN Research Institute, Argentina; UNICEN University, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina; Department of Computer Engineering, Atilim University, Ankara, Turkey}, author_keywords = {Human Perception; Service-Oriented Computing; Web Service Complexity; Web Service Understandability; Web Services}, document_type = {Conference Paper}, source = {Scopus} }

Legacy system migration approaches

G. Salvatierra, C. Mateos, M. Crasso, A. Zunino, and M. Campo

IEEE Latin America Transactions, Sep 2013

Abs Bib DOI

Legacy Systems have become a challenge for many enterprises, which have been migrating its legacy systems towards new computational environments because of interoperability issues with modern technologies, high maintenance costs, and hiring expert staff who possess high legacy technologies background. In order to find a strategy to solve legacy systems concerns, several approaches and experiences were created for the last years. This paper presents a strengths and weaknesses analysis of 18 migration approaches. © 2003-2012 IEEE.

@article{Salvatierra2013840,
  author = {Salvatierra, G. and Mateos, C. and Crasso, M. and Zunino, A. and Campo, M.},
  title = {Legacy system migration approaches},
  journal = {IEEE Latin America Transactions},
  year = {2013},
  volume = {11},
  number = {2},
  pages = {840-851},
  doi = {10.1109/TLA.2013.6533975},
  art_number = {6533975},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84879919631&doi=10.1109%2fTLA.2013.6533975&partnerID=40&md5=193ea0809781e5b51ed81f0483618661},
  affiliation = {Universidad Nacional Del Centro de la Provincia de Buenos Aires, Tandil, Buenos Aires, Argentina},
  author_keywords = {Black Box Modernization;  Direct Migration;  Indirect Migration;  Legacy System Migration;  Semi Automatic COBOL Migration;  Services Oriented Architecture;  System Modernization;  System Replacement;  White Box Modernization},
  document_type = {Article},
  source = {Scopus}
}

Easyfjp: Providing hybrid parallelism as a concern for divide and conquer java applications

C. Mateos, A. Zunino, and M. Hirsch

Computer Science and Information Systems, Sep 2013

Abs Bib DOI

Because of the increasing availability of multi-core machines, clusters, Grids, and combinations of these there is now plenty of computational power, but today’s programmers are not fully prepared to exploit parallelism. In particular, Java has helped in handling the heterogeneity of such environments. However, there is a lot of ground to cover regarding facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi-automatic parallelism and Parallelism as a Concern (PaaC). The former allows users to be mostly unaware of parallel exploitation problems and at the same time manually optimize parallelized applications whenever necessary, while the latter al-lows applications to be separated from parallel-related code. In this paper, we present EasyFJP, an approach that implicitly exploits parallelism in Java applications based on the concept of fork-join synchronization pattern, a simple but effective abstraction for creating and coordinating parallel tasks. In addition, EasyFJP lets users to explicitly optimize applications through policies, or user-provided rules to dynamically regulate task granularity. Finally, EasyFJP relies on PaaC by means of source code generation techniques to wire applications and parallel-specific code together. Experiments with real-world applications on an emulated Grid and evidence that Easy FJP delivers competitive performance compared to state-of-the-art Java parallel programming tools.
@article{Mateos20131129, author = {Mateos, C. and Zunino, A. and Hirsch, M.}, title = {Easyfjp: Providing hybrid parallelism as a concern for divide and conquer java applications}, journal = {Computer Science and Information Systems}, year = {2013}, volume = {10}, number = {3}, pages = {1129-1163}, doi = {10.2298/CSIS120712021M}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84880058712&doi=10.2298%2fCSIS120712021M&partnerID=40&md5=51bb6ef2c3211b13a53adcb78824e697}, affiliation = {ISISTAN Research Institute - CONICET, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; UNICEN University, Campus Universitario, Tandil (B7001BBO),Buenos Aires, Argentina}, author_keywords = {Explicit parallelism; Fork-join synchronization patterns; Implicit parallelism; Java; Parallel computing; Parallelism as a concern (PaaC); Policies}, document_type = {Article}, source = {Scopus} }
Best practices for describing, consuming, and discovering web services: A comprehensive toolset

J.M. Rodriguez, M. Crasso, C. Mateos, and A. Zunino

Software - Practice and Experience, Sep 2013

Abs Bib DOI

The service-oriented computing (SOC) paradigm has recently gained a lot of attention in the software industry because SOC represents a novel and a fresh way of architecting distributed applications. SOC is usually materialized via web services, which allows developers to structure applications exposing a clear, public interface to their capabilities. Although conceptually and technologically mature, SOC still lacks adequate development support from a methodological point of view. In this paper, we present the EasySOC project, a set of guidelines to simplify the development of service-oriented applications and services. EasySOC is a synthesized catalog of best SOC development practices that arise as a result of several years of research in fundamental Services Computing topics, that is, Web Service Description Language-based technical specification, Web Service discovery, and Web Service outsourcing. In addition, we describe a materialization of the guidelines for the Java language, which has been implemented as a plug-in for the Eclipse IDE. We believe that both the practical nature of the guidelines and the availability of this software that enforces them may help software practitioners to rapidly exploit our ideas for building real SOC applications. Copyright © 2012 John Wiley & Sons, Ltd.
@article{Rodriguez2013613, author = {Rodriguez, J.M. and Crasso, M. and Mateos, C. and Zunino, A.}, title = {Best practices for describing, consuming, and discovering web services: A comprehensive toolset}, journal = {Software - Practice and Experience}, year = {2013}, volume = {43}, number = {6}, pages = {613-639}, doi = {10.1002/spe.2123}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84877630190&doi=10.1002%2fspe.2123&partnerID=40&md5=826fdd0322c348ff2580e8d638e76247}, affiliation = {ISISTAN Research Institute, UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {service-oriented computing; service-oriented development guidelines; web service consumption; web service discovery; web services; WSDL anti-patterns}, document_type = {Article}, source = {Scopus} }
Bottom-up and top-down cobol system migration to web services

J.M. Rodriguez, M. Crasso, C. Mateos, A. Zunino, and M. Campo

IEEE Internet Computing, Sep 2013

Abs Bib DOI

Moving from mainframe systems to a service-oriented architecture (SOA) using Web services is an attractive but daunting task. The bottom-up or direct-migration approach enables the effective modernization of legacy systems to Web services. Conversely, bringing migration into fruition with the top-down or indirect-migration approach is more difficult, but it achieves better migration results. Employing both approaches on the same large enterprise system is uncommon, which leaves no room for comparison. This article describes the migration processes, costs, and outcomes of applying both approaches on a real Cobol system. © 1997-2012 IEEE.
@article{Rodriguez201344, author = {Rodriguez, J.M. and Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {Bottom-up and top-down cobol system migration to web services}, journal = {IEEE Internet Computing}, year = {2013}, volume = {17}, number = {2}, pages = {44-51}, doi = {10.1109/MIC.2011.162}, art_number = {6109214}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84875739471&doi=10.1109%2fMIC.2011.162&partnerID=40&md5=7d6c043ce246b73821649cf62cb2dbf5}, affiliation = {UNICEN, Argentina}, author_keywords = {Internet computing; services architectures; Web services modeling}, document_type = {Article}, source = {Scopus} }
An approach for Web Service discoverability anti-pattern detection for journal of web engineering

J.M. Rodriguez, M. Crasso, and A. Zunino

Journal of Web Engineering, Sep 2013

Abs Bib

The Service Oriented Computing paradigm and its most popular implementation, namely Web Services, are at the crossing of distributed computing and loosely coupled systems. Web Services can be discovered and reused dynamically using non-proprietary mechanisms, but when Web Services are poorly described, they become difficult to be discovered, understood, and then reused. This paper presents novel algorithms and heuristics for automatically detecting common pitfalls that should be avoided when creating Web Services descriptions. To assess the accuracy of the proposed algorithms and heuristics, we compared their results with the results of manually analyzing a data-set of 400 publicly available services. In addition, we analyzed the correlation between the algorithms and heuristics results and other well-known quality metrics, which were presented by Al-Masri and Mahmoud. The average detection accuracy was 93.14%, and the false positive and false negative rates of 4.06% and 9.91%, respectively. Additionally, the Al-Masri and Mahmoud’s quality metrics related to Web Services descriptions had a direct correlation with most of the automatic detecting results. The proposed algorithms and heuristics for automatically detecting common pitfalls are powerful tools for both improving existent Web Services and developing new Web Services that can be easily discovered, understood and reused. © Rinton Press.
@article{Rodriguez2013131, author = {Rodriguez, J.M. and Crasso, M. and Zunino, A.}, title = {An approach for Web Service discoverability anti-pattern detection for journal of web engineering}, journal = {Journal of Web Engineering}, year = {2013}, volume = {12}, number = {1-2}, pages = {131-158}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84872192616&partnerID=40&md5=eeeb2aae0b6f1ddc86edf4843d1ed3fb}, affiliation = {ISISTAN, Universidad Nacional del Centro de la Provincia de Buenos Aires, Paraje Arroyo Seco Tandil, Buenos Aires B7001BBO, Argentina; CONICET, Argentina}, author_keywords = {Antipatterns detection; Web Services; Web Services Discoverability Anti-patterns; Web Services Modeling}, document_type = {Article}, source = {Scopus} }
Anti-pattern free code-first web services for state-of-the-art Java WSDL generation tools

J.L. Ordiales Coscia, C. Mateos, M. Crasso, and A. Zunino

International Journal of Web and Grid Services, Sep 2013

Abs Bib DOI

Service-Oriented Computing (SOC) promotes structuring applications via coarse-grained, remote components called services. To materialise SOC, web services is the most common choice. A web service comprises an implementation and a description using the Web Services Description Language (WSDL). Web services are often built by first implementing their behaviour and then generating its WSDL document via automatic tools. However, bad design practices already present in a service implementation may end up affecting the quality of its WSDL document. For web services to be reusable, good WSDL designs are crucial. Previously, Mateos et al. show that there is a high correlation between Object-Oriented (OO) metrics from service implementations and the occurrences of ’anti-patterns’ in WSDL documents. In this follow-up paper, these results are extended to all the existing WSDL generation tools. A detailed analysis of the impact of OO metric-driven code refactorings on the quality of WSDL documents is also reported. Copyright © 2013 Inderscience Enterprises Ltd.
@article{OrdialesCoscia2013107, author = {Ordiales Coscia, J.L. and Mateos, C. and Crasso, M. and Zunino, A.}, title = {Anti-pattern free code-first web services for state-of-the-art Java WSDL generation tools}, journal = {International Journal of Web and Grid Services}, year = {2013}, volume = {9}, number = {2}, pages = {107-126}, doi = {10.1504/IJWGS.2013.054108}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84878517642&doi=10.1504%2fIJWGS.2013.054108&partnerID=40&md5=9ddbc50c1ab426f55f811eb8ddcf6942}, affiliation = {ISISTAN-CONICET - UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {Code-first; Java; Object-oriented metrics; Service-oriented computing; Web services; WSDL anti-patterns; WSDL generation tools}, document_type = {Article}, source = {Scopus} }
Service selection based on a practical interface assessment scheme

M. Garriga, A. Flores, C. Mateos, A. Zunino, and A. Cechich

International Journal of Web and Grid Services, Sep 2013

Abs Bib DOI

Service-oriented computing promotes building applications by consuming reusable services. However, facing the selection of adequate services for a specific application still is a major challenge. Even with a reduced set of candidate services, the effort of assessing candidates could be overwhelming. We have defined an approach to assist developers in the selection of services, which mainly comprises an assessment process for service interface compatibility. This assessment process is based on a comprehensive structural scheme for service interfaces matching. The scheme allows developers to gain knowledge on likely services’ interactions and their required adaptations to achieve a successful integration. We evaluated the performance of the interface compatibility analysis with a data set of 453 services and two different service discovery registries. The experiments show an improvement of up to 15% in precision and up to 8% in the DCG usefulness metric, with regard to the previous results obtained using only textual (syntactical) information. © 2013 Inderscience Enterprises Ltd.
@article{Garriga2013369, author = {Garriga, M. and Flores, A. and Mateos, C. and Zunino, A. and Cechich, A.}, title = {Service selection based on a practical interface assessment scheme}, journal = {International Journal of Web and Grid Services}, year = {2013}, volume = {9}, number = {4}, pages = {369-393}, doi = {10.1504/IJWGS.2013.057469}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84887911575&doi=10.1504%2fIJWGS.2013.057469&partnerID=40&md5=365c63e4319c10f2100ef600d5e76299}, affiliation = {GIISCo Research Group, Faculty of Informatics, UNComa, Neuquén, Argentina; National Scientific and Technical Research Council (CONICET), Neuquén, Argentina; ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina}, author_keywords = {Interface compatibility; Service-oriented computing; Web Service discovery; Web Service selection; Web Services}, document_type = {Article}, source = {Scopus} }

2012

Are smartphones really useful for scientific computing?

J.M. Rodriguez, C. Mateos, and A. Zunino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

Smartphones are a new kind of mobile devices that allow users to take their office anywhere and anytime with them. The number of smartphones is rapidly growing. Most of the time their capabilities are underused, therefore several authors have studied how to exploit smartphones for assisting scientific computing. Yet, as far as we know, there is no study aimed at determining whether smartphones can do a significant contribution to this area as resource providers. This paper shows that smartphones are not that slow when compared to standard mobile devices, such as notebooks. Furthermore, a notebook running on battery only performed 8 times more work than a low-end smartphone before their batteries run out. However, the low-end smartphone is 145 times slower than the notebook, and the smartphone battery has less capacity than the notebook battery. Since smartphones can execute large amount of work running on battery, we think that smartphones can have a major role in building the next-generation HPC infrastructures. © 2012 Springer-Verlag.
@article{Rodríguez201238, author = {Rodriguez, J.M. and Mateos, C. and Zunino, A.}, title = {Are smartphones really useful for scientific computing?}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2012}, volume = {7547 LNCS}, pages = {38-47}, doi = {10.1007/978-3-642-34010-9_4}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871223199&doi=10.1007%2f978-3-642-34010-9_4&partnerID=40&md5=1ea6ae59ff4e7b1dc5e4360a9462ce98}, affiliation = {ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Argentina}, author_keywords = {Android; Benchmark; Linpack; Scientific Computing; SciMark; Smartphones}, document_type = {Conference Paper}, source = {Scopus} }
An architecture for resource behavior prediction to improve scheduling systems performance on enterprise desktop grids

S.A. Salinas, C.G. Garino, and A. Zunino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

An Enterprise Desktop Grid (EDG) is a low cost platform that scavenges idle desktop computers to run Grid applications. Since EDGs use idle computer time, it is important to estimate the expected computer availability. Based on this estimation, a scheduling system is able to select those computers with more expected availability to run applications. As a consequence, an overall performance improvement is achieved. Different techniques have been proposed to predict the computer state for an instant of time, but this information is not enough. A prediction model provides a sequence of computer states for different instants of time. The problem is how to identify computer behavior having as input this sequence of states. We identify the need of providing a architecture to model and evaluate desktop computer behavior. Thus, a scheduling system is able to compare and select resources that run applications faster. Experiments have shown that programs run up to 8 times faster when the scheduler selects a computer suggested by our proposal. © 2012 Springer-Verlag.
@article{Salinas2012186, author = {Salinas, S.A. and Garino, C.G. and Zunino, A.}, title = {An architecture for resource behavior prediction to improve scheduling systems performance on enterprise desktop grids}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2012}, volume = {7547 LNCS}, pages = {186-196}, doi = {10.1007/978-3-642-34010-9_18}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871209996&doi=10.1007%2f978-3-642-34010-9_18&partnerID=40&md5=2c749c7a9ee5b019266fe2c22b4d1bde}, affiliation = {Instituto para Las Tecnologías de la Información Y Las Comunicaciones (ITIC), UNCuyo, Mendoza, Argentina; Facultad de Ingeniería, UNCuyo, Mendoza, Argentina; ISISTAN, Facultad de Ciencias Exactas, UNICEN, Tandil, Argentina}, author_keywords = {Classification Algorithms; Computer Behavior Prediction; Enterprise Desktop Grid; Resource Discovery System; Scheduling System}, document_type = {Conference Paper}, source = {Scopus} }
A programming model for the semantic web

M. Crasso, C. Mateos, A. Zunino, and M. Campo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

This year the concept of "Semantic Web" celebrates its tenth anniversary since it was coined by prominent researchers Tim Berners-Lee, James Hendler and Ora Lassila. To date, there are many technologies to describe, in a machine-understandable way, information and services available in the Web. An incipient research area is focused on solving the issues related to building applications for truly exploiting semantically-described resources. In this paper, we present an approach to upgrade a software application into a Semantic Web-enabled one. The approach builds on the Aspect-Oriented Programming (AOP) paradigm to allow developers to incorporate ontology management capabilities into an ordinary object-oriented application without modifying its source code. The paper also discusses related works and presents case studies. © 2012 Springer-Verlag.
@article{Crasso2012208, author = {Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {A programming model for the semantic web}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2012}, volume = {7547 LNCS}, pages = {208-218}, doi = {10.1007/978-3-642-34010-9_20}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84871211751&doi=10.1007%2f978-3-642-34010-9_20&partnerID=40&md5=798e11650cb5103f694debf50f9c540a}, affiliation = {ISISTAN Research Institute, UNICEN University, Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Argentina}, author_keywords = {Aspect-Oriented Programming; Model; Semantic Web; Software}, document_type = {Conference Paper}, source = {Scopus} }
Pattern-based modifiability analysis of EJB architectures

J.A.D. Pace, and A. Zunino

In Proceedings - 2012 6th Brazilian Symposium on Software Components, Architectures and Reuse, SBCARS, Sep 2012

Abs Bib DOI

Over the last years, several techniques to evaluate modiflability of software architectureshave been developed. One of such techniques is change impact analysis (CIA), which aids developers in assessing the effects of change scenarios on architectural modules. However, CIA does not take into account the pattern structures behind those modules. In architectural frameworks, such as the Enterprise Java Beans (EJB) architecture, the use of patterns is a key practice to achieve modiflability goals. Although patterns can be easily understood individually, when an application combines several pattern instances the analysis is not straightforward. In practice, many EJB designs are assessed in an ad-hoc manner and relying on the developers’ experience. A way of dealing with this problem is through the integration of modiflabiliy analysis models and patterns. We propose a knowledge-based approach that explicitly links the EJB patterns to a scenario-based analysis for multi-tier architectures. Specifically, we have developed a modiflability reasoning framework that reifies the EJB patterns present in a given design solution and, for a set of predetermined scenarios, the reasoning framework identifies which architectural elements can be affected by the scenarios. The reasoning framework outputs metrics for each of the scenarios regarding specific EJB tiers. The main contribution of this approach is that assists developers to evaluate EJB alternatives, providing quantitative information about the modiflability implications of their decisions. A preliminary evaluation has shown that the the reasoning framework is viable to analyze EJB designs. ©2012 IEEE.
@inproceedings{Pace201241, author = {Pace, J.A.D. and Zunino, A.}, title = {Pattern-based modifiability analysis of EJB architectures}, booktitle = {Proceedings - 2012 6th Brazilian Symposium on Software Components, Architectures and Reuse, SBCARS}, year = {2012}, pages = {41-50}, doi = {10.1109/SBCARS.2012.19}, art_number = {6394973}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84873041738&doi=10.1109%2fSBCARS.2012.19&partnerID=40&md5=ee1039d988b467efaf26d591b9af108b}, affiliation = {ISISTAN Research Institute-CONICET, Argentina}, author_keywords = {Component architectures; Design tor quality; Software design; Software maintenance; Software reusability}, document_type = {Conference Paper}, source = {Scopus} }
Estimating Web Service interface complexity and quality through conventional object-oriented metrics

J.L.O. Coscia, M. Crasso, C. Mateos, and A. Zunino

In 15th Ibero-American Conference on Software Engineering, CIbSE, Sep 2012

Abs Bib

Historically, software engineers have conceived metric suites as valuable tools to estimate the quality of their software artifacts. Recently, a fresh computing paradigm called Service-Oriented Computing (SOC) has emerged at the crossing of massively distributed and heterogeneous software. This paper presents a statistical correlation analysis showing that classic software engineering metrics can be used to predict the complexity and quality of WSDL documents, the cornerstone software artifact when materializing this novel computing paradigm with Web-based technologies. For the experiments, 154 real world WSDL documents have been employed.
@inproceedings{Coscia2012, author = {Coscia, J.L.O. and Crasso, M. and Mateos, C. and Zunino, A.}, title = {Estimating Web Service interface complexity and quality through conventional object-oriented metrics}, booktitle = {15th Ibero-American Conference on Software Engineering, CIbSE}, year = {2012}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84886669269&partnerID=40&md5=9afbd8cb60fae419d7d0a700ce781c91}, affiliation = {ISISTAN Research Institute, Argentina; UNICEN University, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Code-first; Early detection; Object-oriented metrics; Service-oriented computing; Web services}, document_type = {Conference Paper}, source = {Scopus} }
Testing-based process for service-oriented applications

M. Garriga, A. Flores, A. Cechich, and A. Zunino

In Proceedings - International Conference of the Chilean Computer Science Society, SCCC, Sep 2012

Abs Bib DOI

Service-Oriented Computing allows building applications by reusing web-accessible services. However, current approaches still involve a large effort both at discovery of services and their successful integration. This paper presents a novel approach to assist developers at discovery, selection and integration of services. In particular, the paper focuses on the selection method that involves two main evaluations on candidate services to achieve a concrete decision upon the most appropriate service. Initially, a syntactic Interface Compatibiliy assessment characterizes the list of candidate services according to a calculated syntactic distance to then proceed with a Behavior Compatibility evaluation that is based on a blackbox testing framework. The usefulness of the selection method is highlighted through a series of case studies. © 2011 IEEE.
@inproceedings{Garriga201264, author = {Garriga, M. and Flores, A. and Cechich, A. and Zunino, A.}, title = {Testing-based process for service-oriented applications}, booktitle = {Proceedings - International Conference of the Chilean Computer Science Society, SCCC}, year = {2012}, pages = {64-73}, doi = {10.1109/SCCC.2011.10}, art_number = {6363384}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84874149806&doi=10.1109%2fSCCC.2011.10&partnerID=40&md5=55dbff0b4ab95e6eb2d3638b27130ee7}, affiliation = {GIISCo Research Group, Facultad de Informática, Universidad Nacional Del Comahue, Neuquen, Argentina; ISISTAN Research Institute, UNICEN, Tandil, Buenos Aires, Argentina; CONICET (National Scientific and Technical Research Council), Argentina}, author_keywords = {Service-oriented Computing; Web Services; Component-based Systems; Software Testing}, document_type = {Conference Paper}, source = {Scopus} }
The SOA frontier: Experiences with three migration approaches

J.M. Rodriguez, M. Crasso, C. Mateos, A. Zunino, M. Campo, and G. Salvatierra

Sep 2012

Abs Bib DOI

Service Oriented Architecture (SOA) and Web Services are the current trend to integrate large and distributed systems, which is a common situation in both the business and government worlds. However, within these worlds, systems are commonly written in COBOL because they were developed several decades ago. Therefore, migration of COBOL systems into service-oriented architectures becomes a necessity. Two main approaches are used to migrate COBOL systems to SOA systems: Direct and indirect migration. Direct migration implies wrapping the current COBOL routines of a system with a software layer developed under a newer platform that can be used to offer Web Services. In contrast, indirect migration requires re-designing and re-implementing the COBOL routines’ functionality using a newer platform as well. In this chapter, the authors propose a novel migration approach, which takes the best of the two previous approaches. To assess the advantages and disadvantages of these approaches, this chapter presents a case study from a government agency COBOL system that has been migrated to a Web services-based system using the three approaches. As a result of having these migration attempts, the authors present the trade-off between direct and indirect migration, the resulting service interfaces quality, and the migration costs. These results also show that this new migration approach offers a good balance to the above trade-off, which makes the approach applicable to similar COBOL migration scenarios. © 2013, IGI Global.
@book{Rodriguez2012126, author = {Rodriguez, J.M. and Crasso, M. and Mateos, C. and Zunino, A. and Campo, M. and Salvatierra, G.}, title = {The SOA frontier: Experiences with three migration approaches}, journal = {Migrating Legacy Applications: Challenges in Service Oriented Architecture and Cloud Computing Environments}, year = {2012}, pages = {126-152}, doi = {10.4018/978-1-4666-2488-7.ch006}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84898366656&doi=10.4018%2f978-1-4666-2488-7.ch006&partnerID=40&md5=48bf50d9efa5dfeed2b24d1b2ca0b56a}, affiliation = {ISISTAN, Universidad Nacional del Centro de la Provincia de Buenos Aires, Argentina}, document_type = {Book Chapter}, source = {Scopus} }
Parallelism as a concern in Java through fork-join synchronization patterns

C. Mateos, A. Zunino, and M. Hirsch

In Proceedings - 12th International Conference on Computational Science and Its Applications, ICCSA, Sep 2012

Abs Bib DOI

We are facing a hardware revolution given by the increasing availability of multicore computers, clusters, Grids, and combinations of these. Consequently, there is plenty of computational power, but today’s programmers are not fully prepared to exploit parallelism and distribution. Particularly, Java has helped in handling the heterogeneity of such environments, but there is a lack of facilities to easily and elegantly parallelizing applications. One path to this end seems to be the synthesis of semi-automatic parallelism and Parallelism as a Concern (PaaC). We briefly survey relevant Java-based parallel development tools, identify their drawbacks, and discuss some insights of an ongoing approach for mitigating them. © 2012 IEEE.
@inproceedings{Mateos201249, author = {Mateos, C. and Zunino, A. and Hirsch, M.}, title = {Parallelism as a concern in Java through fork-join synchronization patterns}, booktitle = {Proceedings - 12th International Conference on Computational Science and Its Applications, ICCSA}, year = {2012}, pages = {49-56}, doi = {10.1109/ICCSA.2012.18}, art_number = {6257609}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866396576&doi=10.1109%2fICCSA.2012.18&partnerID=40&md5=c0caa1d11c1db4cf21e22b02151849f3}, affiliation = {ISISTAN Research Institute, UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; CONICET, Argentina; UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {distributed computing; fork-join synchronization patterns; Java; parallel software development}, document_type = {Conference Paper}, source = {Scopus} }
Information diffusion in web services networks

S. Mokarizadeh, P. Küngas, M. Matskin, M. Crasso, M. Campo, and A. Zunino

In Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS, Sep 2012

Abs Bib DOI

Information diffusion has been studied between and within biosphere, microblogs, social networks, citation networks and other domains, where the network structure is present. These studies have turned to be useful for acquiring intrinsic knowledge for strategic decision making in related areas, for example, planning online campaigns in case of microblogs and blogosphere. In the context of data-centric Web services, information exchange patterns will reveal practical heuristics for efficient Web services selection and composition. For example, by possible knowledge that there is information flow between Web services of Financial Analysis Services and Enterprise Resource Planning Services, as outlined by our experimental results, the potential applications, which interact with Financial Analysis services, can be adjusted to take advantage of Enterprise Resource Planning services as well. In this paper we present a method for analyzing information diffusion between categories of data-centric Web services. The method operates on a Web services network constructed by linking interface descriptions of categorized Web services. The proposed method is evaluated on a case study of global Web services. The results indicate high potential of the proposed model in understanding interactions between categories of Web services. © 2012 IEEE.
@inproceedings{Mokarizadeh2012488, author = {Mokarizadeh, S. and Küngas, P. and Matskin, M. and Crasso, M. and Campo, M. and Zunino, A.}, title = {Information diffusion in web services networks}, booktitle = {Proceedings - 2012 IEEE 19th International Conference on Web Services, ICWS}, year = {2012}, pages = {488-495}, doi = {10.1109/ICWS.2012.89}, art_number = {6257844}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84866422369&doi=10.1109%2fICWS.2012.89&partnerID=40&md5=6f0fe6db94a4973f584df6a63a93b9bb}, affiliation = {Royal Institute of Technology, Stockholm, Sweden; University of Tartu, Tartu, Estonia; UNICEN University, CONICET, Tandil, Argentina}, author_keywords = {Automated categorization; Information diffusion; Web services; Web services networks}, document_type = {Conference Paper}, source = {Scopus} }
RESTful Web Services improve the efficiency of data transfer of a whole-farm simulator accessed by Android smartphones

M. Arroqui, C. Mateos, C. Machado, and A. Zunino

Computers and Electronics in Agriculture, Sep 2012

Abs Bib DOI

The relentlessly increasing importance and application of Information and Communication Technologies (ICTs) in Agriculture have given birth to a new field called e-Agriculture, which focus on improving agricultural and rural development through a variety of technologies. In this sense, Agricultural Information Systems (AISs) are distributed sources of information that exploit ICTs to make agricultural processes and decision making more efficient. In order to integrate AISs and therefore build added value AISs, Web Service technologies seem to be the right path towards heterogeneous systems integration. However, there is still uncertain which is the best implementation approach to integrate Web Service-enabled AISs and mobile devices, i.e., the remote information accessors by excellence in rural areas. We comparatively explore the outcomes of employing either Simple Object Access Protocol (SOAP) or REpresentational State Transfer (REST) approaches in a Web Service-enabled whole-farm simulator accessed from Android-powered smartphones. Memory usage was 24% lower in SOAP, but even older and lower-end smartphones have enough RAM to avoid detrimental effects on performance. REST-based approaches broadly incur in less byte transferred compared to SOAP, which has huge implications on costs. That is particularly important when the Internet is accessed via GPRS or 3G protocols and pay-per-byte data plans as in most of Latin America rural areas. However, when unlimited data usage became less costly and more available in such areas, SOAP might be preferred due to the higher maturity of both the protocol and the available developer environments. © 2012 Elsevier B.V.
@article{Arroqui201214, author = {Arroqui, M. and Mateos, C. and Machado, C. and Zunino, A.}, title = {RESTful Web Services improve the efficiency of data transfer of a whole-farm simulator accessed by Android smartphones}, journal = {Computers and Electronics in Agriculture}, year = {2012}, volume = {87}, pages = {14-18}, doi = {10.1016/j.compag.2012.05.016}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84862649974&doi=10.1016%2fj.compag.2012.05.016&partnerID=40&md5=c817072628ed76ebb35ad91c648b0a71}, affiliation = {ISISTAN Research Institute, UNICEN, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), CABA, Buenos Aires, Argentina; Facultad de Ciencias Veterinarias, UNICEN, Tandil (B7001BBO), Buenos Aires, Argentina; Agencia Nacional de Promoción Científica y Tecnológica (ANPCyT), CABA, Buenos Aires, Argentina}, author_keywords = {Agricultural information systems; Mobile devices; REST; Simugan; SOAP; Web services}, document_type = {Article}, source = {Scopus} }
Towards a computer assisted approach for migrating legacy systems to SOA

G. Salvatierra, C. Mateos, M. Crasso, and A. Zunino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

Legacy system migration to Service-oriented Architectures (SOA) has been identified as the right path to the modernization of enterprise solutions needing agility to respond to changes and high levels of interoperability. However, one of the main challenges of migrating to SOA is finding an appropriate balance between migration effort and the quality of resulting service interfaces. This paper describes an approach to assist software analysts in the definition of produced services, which bases on the fact that poorly designed service interfaces may be due to bad design and implementation decisions present in the legacy system. Besides automatically detecting common design pitfalls, the approach suggests refactorings to correct them. Resulting services have been compared with those that resulted from migrating a real system by following two classic approaches. © 2012 Springer-Verlag.
@article{Salvatierra2012484, author = {Salvatierra, G. and Mateos, C. and Crasso, M. and Zunino, A.}, title = {Towards a computer assisted approach for migrating legacy systems to SOA}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2012}, volume = {7336 LNCS}, number = {PART 4}, pages = {484-497}, doi = {10.1007/978-3-642-31128-4_36}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863914607&doi=10.1007%2f978-3-642-31128-4_36&partnerID=40&md5=16aae3c4ca02a16a11e1025fc5b96b07}, affiliation = {ISISTAN Research Institute, Tandil, Argentina; UNICEN University, Tandil, Argentina; Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Argentina}, author_keywords = {direct migration; indirect migration; legacy system migration; semi-automatic cobol migration; Services-oriented architecture; web services}, document_type = {Conference Paper}, source = {Scopus} }

Predicting web service maintainability via object-oriented metrics: A statistics-based approach

J.L.O. Coscia, M. Crasso, C. Mateos, A. Zunino, and S. Misra

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

The Service-Oriented Computing paradigm enables the construction of distributed systems by assembling loosely coupled pieces of software called services, which have clear interfaces to their functionalities. Service interface descriptions have many aspects, such as complexity and quality, all of which can be measured. This paper presents empirical evidence showing that services interfaces maintainability can be predicted by applying traditional software metrics in service implementations. A total of 11 source code level metrics and 5 service interface metrics have been statistically correlated using 154 real world services. © 2012 Springer-Verlag.

@article{Coscia201229,
  author = {Coscia, J.L.O. and Crasso, M. and Mateos, C. and Zunino, A. and Misra, S.},
  title = {Predicting web service maintainability via object-oriented metrics: A statistics-based approach},
  journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  year = {2012},
  volume = {7336 LNCS},
  number = {PART 4},
  pages = {29-39},
  doi = {10.1007/978-3-642-31128-4_3},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863959084&doi=10.1007%2f978-3-642-31128-4_3&partnerID=40&md5=d9e281493aa7c9c0e90325b22501d10b},
  affiliation = {ISISTAN Research Institute, Tandil, Argentina; UNICEN University, Tandil, Argentina; Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Argentina; Department of Computer Engineering, Atilim University, Ankara, Turkey},
  author_keywords = {Code-First;  Object-Oriented Metrics;  Service-Oriented Computing;  Web Service Maintainability;  Web Service Maintainability Prediction;  Web Services},
  document_type = {Conference Paper},
  source = {Scopus}
}

A suite of cognitive complexity metrics

S. Misra, M. Koyuncu, M. Crasso, C. Mateos, and A. Zunino

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2012

Abs Bib DOI

In this paper, we propose a suite of cognitive metrics for evaluating complexity of object-oriented (OO) codes. The proposed metric suite evaluates several important features of OO languages. Specifically, the proposed metrics are to measure method complexity, message complexity (coupling), attributes complexity and class complexity. We propose also a code complexity by considering the complexity due to inheritance for the whole system. All these proposed metrics (except attribute complexity) use the cognitive aspect of the code in terms of cognitive weight. All the metrics have critically examined through theoretical and empirical validation processes. © 2012 Springer-Verlag.

@article{Misra2012234,
  author = {Misra, S. and Koyuncu, M. and Crasso, M. and Mateos, C. and Zunino, A.},
  title = {A suite of cognitive complexity metrics},
  journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  year = {2012},
  volume = {7336 LNCS},
  number = {PART 4},
  pages = {234-247},
  doi = {10.1007/978-3-642-31128-4_17},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863952740&doi=10.1007%2f978-3-642-31128-4_17&partnerID=40&md5=b9fbd87be7d661fa54dc26b5bd2f9d61},
  affiliation = {Department of Computer Engineering, Atilim University, Ankara, Turkey; ISISTAN Research Institute, UNICEN University, Tandil, Argentina; Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Argentina},
  author_keywords = {attributes;  class;  cognitive complexity;  coupling;  inheritance;  messages;  methods;  software metrics;  validation},
  document_type = {Conference Paper},
  source = {Scopus}
}

An approach to improve code-first web services discoverability at development time

J.L. Ordiales Coscia, M. Crasso, C. Mateos, and A. Zunino

In Proceedings of the ACM Symposium on Applied Computing, Sep 2012

Abs Bib DOI

Previous efforts towards simplifying Web Service discovery have shown that avoiding some well-known WSDL specification anti-patterns yield quite good results in making more discoverable services. The anti-patterns, however, have been studied with contract-first Web Services, a service construction methodology that is much less popular in the software industry compared to code-first. We study a number of source code refactorings that can be applied at service development time to reduce the presence of anti-patterns in code-first WSDL documents. The cornerstone of these refactorings is a statistical correlation between common object-oriented (OO) metrics and the anti-patterns computed by using a data-set of real Web Services. We quantify the impact of the refactorings on Web Service discovery and show that more clear WSDL documents are generated and service discovery is greatly improved. © 2012 ACM.
@inproceedings{OrdialesCoscia2012638, author = {Ordiales Coscia, J.L. and Crasso, M. and Mateos, C. and Zunino, A.}, title = {An approach to improve code-first web services discoverability at development time}, booktitle = {Proceedings of the ACM Symposium on Applied Computing}, year = {2012}, pages = {638-643}, doi = {10.1145/2245276.2245400}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84863575421&doi=10.1145%2f2245276.2245400&partnerID=40&md5=b00e70cdd00920ab11cc856e3b85718d}, affiliation = {ISISTAN Research Institute - CONICET, UNICEN, Tandil, Argentina}, author_keywords = {code-first; OO metrics; web service discovery; web services; WSDL anti-patterns}, document_type = {Conference Paper}, source = {Scopus} }
Enhancing the BYG gridification tool with state-of-the-art Grid scheduling mechanisms and explicit tuning support

C. Mateos, A. Zunino, M. Hirsch, and M. Fernández

Advances in Engineering Software, Sep 2012

Abs Bib DOI

Grid Computing allows scientists and engineers to run compute intensive experiments that were unfeasible not so long ago. On the downside, for users not proficient in distributed technologies, programming for Grids is difficult, tedious, time-consuming and error-prone. Then, disciplinary users typically waste precious time that could be instead invested into analyzing results. In a previous paper, we introduced BYG (Mateos et al., 2011) [28], a Java-based software that automatically parallelizes sequential applications by directly modifying their compiled codes. In addition, BYG is designed to harness Grid resources by reusing existing Grid platforms and schedulers. In its current shape, however, BYG lacks support for some state-of-the-art Grid schedulers and mechanisms for introducing application-dependent optimizations to parallelized codes. In this paper, we present several extensions to BYG aimed at overcoming these problems and thus improving its applicability and delivered efficiency. We also report experiments by using traditional computational kernels and real-life applications to show the positive practical implications of the proposed extensions. © 2011 Elsevier Ltd. All rights reserved.
@article{Mateos201227, author = {Mateos, C. and Zunino, A. and Hirsch, M. and Fernández, M.}, title = {Enhancing the BYG gridification tool with state-of-the-art Grid scheduling mechanisms and explicit tuning support}, journal = {Advances in Engineering Software}, year = {2012}, volume = {43}, number = {1}, pages = {27-43}, doi = {10.1016/j.advengsoft.2011.08.006}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80054694670&doi=10.1016%2fj.advengsoft.2011.08.006&partnerID=40&md5=8846cc37fa9d1c3ceec414e9c8b499b6}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina; UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {BYG; Grid computing; GridGain; Gridification; Java; Policies; Satin}, document_type = {Article}, source = {Scopus} }

2011

A novel mechanism for gridification of compiled java applications

C. Mateos, A. Zunino, R. Trachsel, and M. Campo

Computing and Informatics, Sep 2011

Abs Bib

Exploiting Grids intuitively requires developers to alter their applications, which calls for expertise on Grid programming. Gridification tools address this problem by semi-automatically making user applications to be Grid-aware. However, most of these tools produce monolithic Grid applications in which common tuning mechanisms (e.g. parallelism) are not applicable, and do not reuse existing Grid middleware services. We propose BYG (BYtecode Gridifier), a gridification tool that relies on novel bytecode rewriting techniques to parallelize and easily execute existing applications via Grid middlewares. Experiments performed by using several computing intensive applications on a cluster and a simulated wide-area Grid suggest that our techniques are effective while staying competitive compared to programmatically using such services for gridifying applications.
@article{Mateos20111259, author = {Mateos, C. and Zunino, A. and Trachsel, R. and Campo, M.}, title = {A novel mechanism for gridification of compiled java applications}, journal = {Computing and Informatics}, year = {2011}, volume = {30}, number = {6}, pages = {1259-1285}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84857842258&partnerID=40&md5=6e9807a23f6cf47ae566fed662ff4fe7}, affiliation = {ISISTAN - UNICEN, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Grid computing; Grid middlewares; Gridification; Java bytecode; Parallelism; Resource-intensive applications; Satin}, document_type = {Article}, source = {Scopus} }
Combining query-by-example and query expansion for simplifying web service discovery

M. Crasso, A. Zunino, and M. Campo

Information Systems Frontiers, Sep 2011

Abs Bib DOI

The vision of a worldwide computing network of services that Service Oriented Computing paradigm and its most popular materialization, namely Web Service technologies, promote is a victim of its own success. As the number of publicly available services grows, discovering proper services is similar to finding a needle in a haystack. Different approaches aim at making discovery more accurate and even automatic. However they impose heavy modifications over current Web Service infrastructures and require developers to invest much effort into publishing and describing their services and needs. So far, the acceptance of this paradigm is mainly limited by the high costs associated with connecting service providers and consumers. This paper presents WSQBE+, an approach to make Web Service publication and discovery easier. WSQBE+ combines open standards and popular best practices for using external Web services with text-mining and machine learning techniques. We describe our approach and empirically evaluate it in terms of retrieval effectiveness and processing time, by using a data-set of 391 public services. © 2009 Springer Science+Business Media, LLC.
@article{Crasso2011407, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {Combining query-by-example and query expansion for simplifying web service discovery}, journal = {Information Systems Frontiers}, year = {2011}, volume = {13}, number = {3}, pages = {407-428}, doi = {10.1007/s10796-009-9221-9}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-80051685521&doi=10.1007%2fs10796-009-9221-9&partnerID=40&md5=7dacc7bbd665266a60bb5274088d5711}, affiliation = {ISISTAN Research Institute, Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNCPBA), Campus Universitario, Buenos Aires Tandil (B7001BBO), Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Buenos Aires, Argentina}, author_keywords = {Query expansion; Service oriented computing; Web Service discovery}, document_type = {Article}, source = {Scopus} }
SWAM: A logic-based mobile agent programming language for the Semantic Web

M. Crasso, C. Mateos, A. Zunino, and M. Campo

Expert Systems with Applications, Sep 2011

Abs Bib DOI

Once a big repository of static data, the Web has been gradually evolved into a worldwide network of information and services known as the Semantic Web. This environment allows programs to autonomously interact with Web-accessible information and services. In this sense, mobile agent technology could help in efficiently exploiting this relatively new Web in a fully automated way, since Semantic Web resources are described in a computer-understandable way. In this paper, we present SWAM, a platform for building and deploying Prolog-based intelligent mobile agents on the Semantic Web. The article also reports examples and experimental results in order to illustrate as well as to assess the benefits of SWAM. © 2010 Elsevier Ltd. All rights reserved.
@article{Crasso20111723, author = {Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {SWAM: A logic-based mobile agent programming language for the Semantic Web}, journal = {Expert Systems with Applications}, year = {2011}, volume = {38}, number = {3}, pages = {1723-1737}, doi = {10.1016/j.eswa.2010.07.098}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78049529721&doi=10.1016%2fj.eswa.2010.07.098&partnerID=40&md5=7faa968e59a5461af6f04a389747a4c7}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientficas y Tcnicas (CONICET), Argentina}, author_keywords = {Logic programming; Mobile agents; Ontologies; Semantic Web; Web services}, document_type = {Article}, source = {Scopus} }
Research review: A survey of approaches to Web Service discovery in service-oriented architectures

M. Crasso, A. Zunino, and M. Campo

Journal of Database Management, Sep 2011

Abs Bib DOI

Discovering services acquires importance as Service-Oriented Computing (SOC) becomes an adopted paradigm. SOC’s most popular materializations, namely Web Services technologies, have different challenges related to service discovery and, in turn, many approaches have been proposed. As these approaches are different, one solution may be better than another according to certain requirements. In consequence, choosing a service discovery system is a hard task. To alleviate this task, this paper proposes eight criteria, based on the requirements for discovering services within common service-oriented environments, allowing the characterization of discovery systems. These criteria cover functional and non-functional aspects of approaches to service discovery. The results of the characterization of 22 contemporary approaches and potential research directions for the area are also shown. Copyright © 2011, IGI Global.
@article{Crasso2011102, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {Research review: A survey of approaches to Web Service discovery in service-oriented architectures}, journal = {Journal of Database Management}, year = {2011}, volume = {22}, number = {1}, pages = {102-132}, doi = {10.4018/jdm.2011010105}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79954597293&doi=10.4018%2fjdm.2011010105&partnerID=40&md5=7bc82ac75cc36d503ec70e3a8ec9e9e3}, affiliation = {ISISTAN - UNICEN, Argentina}, author_keywords = {Service discovery; Service-oriented architecture; Service-oriented computing; Web service discovery; Web Service technology}, document_type = {Review}, source = {Scopus} }
Introducing mobile devices into Grid systems: A survey

J.M. Rodriguez, A. Zunino, and M. Campo

International Journal of Web and Grid Services, Sep 2011

Abs Bib DOI

Mobile device capabilities have been steadily increasing in the past years. Therefore, mobile Grids potential benefits have encouraged research on this topic. Researchers have identified several issues, such as energy consumption and limited resources, that steam from using mobile devices because they are small computers that run on battery and can move outside of the wireless coverage area. This paper analyses these issues discusses proposed solutions to them in the different Grid abstraction levels from Grid fabric layer to Grid user application layer. Finally, we propose a taxonomy that considers the use of mobile devices and discuss future research opportunities. Copyright © 2011 Inderscience Enterprises Ltd.
@article{Rodriguez20111, author = {Rodriguez, J.M. and Zunino, A. and Campo, M.}, title = {Introducing mobile devices into Grid systems: A survey}, journal = {International Journal of Web and Grid Services}, year = {2011}, volume = {7}, number = {1}, pages = {1-40}, doi = {10.1504/IJWGS.2011.038386}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79551660564&doi=10.1504%2fIJWGS.2011.038386&partnerID=40&md5=594dc26d17177af6898a4cfc32e22652}, affiliation = {ISISTAN Research Institute, Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {Grid systems; Mobile devices; Mobile Grid; Mobile Grid survey}, document_type = {Article}, source = {Scopus} }

Detecting WSDL bad practices in code-first Web Services

C. Mateos, M. Crasso, A. Zunino, and J.L.O. Coscia

International Journal of Web and Grid Services, Sep 2011

Abs Bib DOI

Service-Oriented Computing (SOC) allows developers to structure applications as a set of reusable services. Web Services expose their functionality by using Web Service Description Language (WSDL). We found that there is a high correlation between well-known object-oriented metrics taken in the code implementing services and the occurrences of ’anti-patterns’ in their WSDLs. We show that some simple refactorings performed early when developing Web Services can greatly improve the quality of WSDL documents. Then, the contribution of this work is a practical approach to guide practitioners in obtaining better WSDL designs that aligns with the technologies and techniques commonly used in the industry for building services. © 2011 Inderscience Enterprises Ltd.

@article{Mateos2011357,
  author = {Mateos, C. and Crasso, M. and Zunino, A. and Coscia, J.L.O.},
  title = {Detecting WSDL bad practices in code-first Web Services},
  journal = {International Journal of Web and Grid Services},
  year = {2011},
  volume = {7},
  number = {4},
  pages = {357-387},
  doi = {10.1504/IJWGS.2011.044710},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84857166838&doi=10.1504%2fIJWGS.2011.044710&partnerID=40&md5=4d800d77ebd21191350341c258fbdb48},
  affiliation = {ISISTAN Research Institute, UNICEN University, Tandil (B7001BBO), Buenos Aires, Argentina; UNICEN University, Argentina},
  author_keywords = {Code-first;  Early detection;  Object-oriented metrics;  Service-Oriented Computing;  SoC;  Web service discovery;  Web services;  WSDL anti-patterns;  WSDL specification},
  document_type = {Article},
  source = {Scopus}
}

A software tool for semi-automatic gridification of resource-intensive Java bytecodes and its application to ray tracing and sequence alignment

C. Mateos, A. Zunino, M. Hirsch, M. Fernández, and M. Campo

Advances in Engineering Software, Sep 2011

Abs Bib DOI

Computational Grids deliver the necessary computational infrastructure to perform resource-intensive computations such as the ones that solve the problems scientists are facing today. Exploiting Computational Grids comes at the expense of explicitly adapting the ordinary software implementing scientific problems to take advantage of Grid resources, which unavoidably requires knowledge on Grid programming. The recent notion of "gridifying" ordinary applications, which is based on semi-automatically deriving a Grid-aware version from the compiled code of a sequential application, promises users to be relieved from the requirement of manual usage of Grid APIs within their source codes. In this paper, we describe a novel gridification tool that allows users to easily parallelize Java applications on Grids. Extensive experiments with two real-world applications - ray tracing and sequence alignment - suggest that our approach provides a convenient balance between ease of gridification and Grid resource exploitation compared to manually using Grid APIs for gridifying ordinary applications. © 2010 Elsevier Ltd. All rights reserved.
@article{Mateos2011172, author = {Mateos, C. and Zunino, A. and Hirsch, M. and Fernández, M. and Campo, M.}, title = {A software tool for semi-automatic gridification of resource-intensive Java bytecodes and its application to ray tracing and sequence alignment}, journal = {Advances in Engineering Software}, year = {2011}, volume = {42}, number = {4}, pages = {172-186}, doi = {10.1016/j.advengsoft.2011.02.003}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79953189342&doi=10.1016%2fj.advengsoft.2011.02.003&partnerID=40&md5=ff58f735d7a2d5d2254f46ab29f2e1ea}, affiliation = {ISISTAN Research Institute, Campus Universitario, Tandil, Buenos Aires, Argentina; UNICEN University, Tandil, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas, Ciudad Autónoma de Buenos Aires, Buenos Aires, Argentina}, author_keywords = {Automatic parallelism; Computational grids; Gridification; Java bytecode; Parallelization heuristics; Resource-intensive applications}, document_type = {Article}, source = {Scopus} }

2010

Testing-based selection method for integrability on service-oriented applications

A. Flores, A. Cechich, A. Zunino, and M.P. Usaola

In Proceedings - 5th International Conference on Software Engineering Advances, ICSEA, Sep 2010

Abs Bib DOI

Service-Oriented Computing allows building applications by reusing web-accessible services. However, current approaches still involve a large effort both at discovery of services and their successful integration. This paper presents a novel approach to help developers to easily deal with discovery, selection and integration of services; and it is based on two recent approaches addressing software maintainability. The first one, called EasySOC, provides specific semi-automated methods for both discovery and integration of services. The second one, initially developed for substitutability of component-based systems, supplies a method for selection of an appropriate third-party candidate component or service, by applying blackbox testing techniques. In this paper we present the usefulness of the selection method within the whole approach. © 2010 IEEE.
@inproceedings{Flores2010373, author = {Flores, A. and Cechich, A. and Zunino, A. and Usaola, M.P.}, title = {Testing-based selection method for integrability on service-oriented applications}, booktitle = {Proceedings - 5th International Conference on Software Engineering Advances, ICSEA}, year = {2010}, pages = {373-379}, doi = {10.1109/ICSEA.2010.63}, art_number = {5614944}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78649930518&doi=10.1109%2fICSEA.2010.63&partnerID=40&md5=769d92fb381bb1040cc0d818b29ffd4d}, affiliation = {GIISCo Research Group, Facultad de Informática, Universidad Nacional del Comahue, Neuquen, Argentina; ISISTAN Research Institute, CONICET, UNICEN, Tandil, Buenos Aires, Argentina; Alarcos Research Group, Escuela Superior de Informática, Universidad de Castilla-La Mancha, Ciudad Real, Spain}, author_keywords = {Component-based systems; Service-oriented computing; Software testing; Web services}, document_type = {Conference Paper}, source = {Scopus} }
Improving Web service descriptions for effective service discovery

J.M. Rodriguez, M. Crasso, A. Zunino, and M. Campo

Science of Computer Programming, Sep 2010

Abs Bib DOI

Service-Oriented Computing (SOC) is a new paradigm that replaces the traditional way to develop distributed software with a combination of discovery, engagement and reuse of third-party services. Web Service technologies are currently the most adopted alternative for implementing the SOC paradigm. However, Web Service discovery presents many challenges that, in the end, hinder service reuse. This paper reports frequent practices present in a body of public services that attempt to prevent the discovery of any service. In addition, we have studied how to solve the discoverability problems that these bad practices cause. Accordingly, this paper presents a novel catalog of eight Web Service discoverability anti-patterns. We conducted a comparative analysis of the retrieval effectiveness of three discovery systems by using the original body of Web Services versus their corrected version. This experiment shows that the removal of the identified anti-patterns eases the discovery process by allowing the employed discovery systems to rank more relevant services before non-relevant ones, with the same queries. Moreover, we conducted a survey to collect the opinions from 26 individuals about whether the improved descriptions are more intelligible than the original ones. This experiment provides more evidence of the importance of correcting the observed problems. © 2010 Elsevier B.V.
@article{Rodriguez20101001, author = {Rodriguez, J.M. and Crasso, M. and Zunino, A. and Campo, M.}, title = {Improving Web service descriptions for effective service discovery}, journal = {Science of Computer Programming}, year = {2010}, volume = {75}, number = {11}, pages = {1001-1021}, doi = {10.1016/j.scico.2010.01.002}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77955473514&doi=10.1016%2fj.scico.2010.01.002&partnerID=40&md5=5f1f54def0cb59aad452ba72c90a2224}, affiliation = {ISISTAN Research Institute, Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientficas y Tcnicas (CONICET), Argentina}, author_keywords = {Web Service discoverability anti-patterns; Web Service discovery; Web Service publication; Web Services}, document_type = {Conference Paper}, source = {Scopus} }
Combining document classification and ontology alignment for semantically enriching web services

M. Crasso, A. Zunino, and M. Campo

New Generation Computing, Sep 2010

Abs Bib DOI

Semantic Web Services represent the basic blocks for building a network of distributed and heterogeneous applications, without human intervention. Despite the high level of automatism that can be achieved with Semantic Web Services technology, this is not broadly adopted. One factor that hinders the widespread usage of this technology is the effort required to annotate semantically ordinary services. This paper presents AWSA (Automatic Web Service Annotator), an approach for easing the conversion of Web Services into Semantic Web enabled services. The main idea behind AWSA is to annotate Web Services with concepts defined by existing ontologies, which have been used for annotating similar services in the past. This approach combines text preprocessing, document classification and ontology alignment techniques to extract valuable information conveyed in standard service descriptions, reduce the search space and find proper concepts for the service being annotated, respectively. Experimental evaluations show the feasibility of the proposed approach. © 2010 Ohmsha and Springer Japan jointly hold copyright of the journal.
@article{Crasso2010371, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {Combining document classification and ontology alignment for semantically enriching web services}, journal = {New Generation Computing}, year = {2010}, volume = {28}, number = {4}, pages = {371-403}, doi = {10.1007/s00354-009-0094-8}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-78650084015&doi=10.1007%2fs00354-009-0094-8&partnerID=40&md5=9a603b176b77a7a953b0bdd10032ea3e}, affiliation = {ISISTAN Research Institute, UNICEN University, Tandil (B7001BBO) Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Buenos Aires, Argentina}, author_keywords = {Document Classification; Ontology Alignment; Semantic Web Services}, document_type = {Article}, source = {Scopus} }
An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications

C. Mateos, A. Zunino, and M. Campo

Computer Languages, Systems and Structures, Sep 2010

Abs Bib DOI

Motivated by the advent of powerful hardware such as SMP machines and execution environments such as Grids, research in parallel programming has gained much attention within the distributed computing community. There is a substantial body of efforts in the form of parallel libraries and frameworks that supply developers with programming tools to exploit parallelism in their applications. Still, many of these efforts prioritize performance over other important characteristics such as code invasiveness, ease of use and independence of the underlying executing hardware/environment. In this paper, we present EasyFJP, a new approach for semi-automatically injecting parallelism into sequential Java applications that offers a convenient balance to these four aspects. EasyFJP is based upon the popular fork/join parallel pattern, and combines implicit, application-level parallelism with explicit, non-invasive application tuning. Experiments performed with several classic CPU-intensive benchmarks and a real-world application confirm that EasyFJP effectively addresses these problems while delivers very competitive performance. © 2010 Elsevier Ltd. All rights reserved.
@article{Mateos2010288, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {An approach for non-intrusively adding malleable fork/join parallelism into ordinary JavaBean compliant applications}, journal = {Computer Languages, Systems and Structures}, year = {2010}, volume = {36}, number = {3}, pages = {288-315}, doi = {10.1016/j.cl.2009.12.003}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77949485249&doi=10.1016%2fj.cl.2009.12.003&partnerID=40&md5=12773c51dd91374337db72f77cd1769d}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina}, author_keywords = {Fork-join parallelism; Implicit parallelism; Java; Non-invasive tuning; Parallel computing}, document_type = {Article}, source = {Scopus} }

Revising WSDL documents: Why and how

M. Crasso, J.M. Rodriguez, A. Zunino, and M. Campo

IEEE Internet Computing, Sep 2010

Abs Bib DOI

Although Web service technologies promote reuse, Web Services Description Language (WSDL) documents that are supposed to describe the API that services offer often fail to do so properly. Therefore, finding services, understanding what they do, and reusing them are challenging tasks. The authors describe the most common errors they’ve found in real WSDL documents, explain how these errors impact service discovery, and present some guidelines for revising them. © 2006 IEEE.

@article{Crasso201048,
  author = {Crasso, M. and Rodriguez, J.M. and Zunino, A. and Campo, M.},
  title = {Revising WSDL documents: Why and how},
  journal = {IEEE Internet Computing},
  year = {2010},
  volume = {14},
  number = {5},
  pages = {48-56},
  doi = {10.1109/MIC.2010.81},
  art_number = {5467007},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77956356054&doi=10.1109%2fMIC.2010.81&partnerID=40&md5=f6fe45479eedc8c34a1de4f1d05c9bcd},
  affiliation = {Universidad Nacional de Centro de la Provincia, Buenos Aire, Argentina},
  author_keywords = {services discovery process and methodology;  Web Services Description Language;  Web services modeling;  Web services publishing;  WSDL},
  document_type = {Article},
  source = {Scopus}
}

Separation of concerns in service-oriented applications based on pervasive design patterns

C. Mateos, M. Crasso, A. Zunino, and M. Campo

In Proceedings of the ACM Symposium on Applied Computing, Sep 2010

Abs Bib DOI

Service-Oriented Computing (SOC) allows developers to build applications by reusing and invoking Web-accessible services. SOC promotes loose coupling between applications and services, which has been mostly addressed by using techniques for Separation of Concerns (SoC). Contemporary SOC development models based on SoC either rely on difficult-to-adopt, ad-hoc programming facilities and languages or fail at isolating applications from details of the application-service interaction. We propose DI4WS, a SOC programming model that combines the well-known Adapter and Dependency Injection patterns. We show that DI4WS allows reducing couplings to services, which has a positive effect on application maintenance, without requiring developers to learn such facilities or languages. DI4WS follows a contract-last approach to service invocation, whereby developers first code the logic of their applications and then non-invasively "adapt" and "inject" required services. An empirical comparison of DI4WS with two related approaches to decouple services is also reported, showing that the DI4WS versions of 4 evaluated applications used less memory and ran faster than the others. © 2010 ACM.
@inproceedings{Mateos2010849, author = {Mateos, C. and Crasso, M. and Zunino, A. and Campo, M.}, title = {Separation of concerns in service-oriented applications based on pervasive design patterns}, booktitle = {Proceedings of the ACM Symposium on Applied Computing}, year = {2010}, pages = {849-853}, doi = {10.1145/1774088.1774263}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77954712267&doi=10.1145%2f1774088.1774263&partnerID=40&md5=9fb4e37d3f92aa33f39122721bcced5f}, affiliation = {ISISTAN Research Institute - CONICET, UNICEN, Tandil, Argentina}, author_keywords = {contract-last service consumption; dependency injection; separation of concerns; service-oriented computing; web services}, document_type = {Conference Paper}, source = {Scopus} }
On the evaluation of gridification effort and runtime aspects of JGRIM applications

C. Mateos, A. Zunino, and M. Campo

Future Generation Computer Systems, Sep 2010

Abs Bib DOI

Nowadays, Grid Computing has been widely recognized as the next big thing in distributed software development. Grid technologies allow developers to implement massively distributed applications with enormous demands for resources such as processing power, data and network bandwidth. Despite the important benefits Grid Computing offers, contemporary approaches for Grid-enabling applications still force developers to invest much effort into manually providing code to discover and access Grid resources and services. Moreover, the outcome of this task is usually software that is polluted by Grid-aware code, as a result of which the maintainability suffers. In a previous article we presented JGRIM, a novel approach to easily gridify Java applications. In this paper, we report a detailed evaluation of JGRIM that was conducted by comparing it with Ibis and ProActive, two platforms for Grid development. Specifically, we used these three platforms for gridifying the k-Nearest Neighbor algorithm and an application for restoring panoramic images. The results show that JGRIM simplifies gridification without resigning performance for these applications. © 2010 Elsevier B.V. All rights reserved.
@article{Mateos2010797, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {On the evaluation of gridification effort and runtime aspects of JGRIM applications}, journal = {Future Generation Computer Systems}, year = {2010}, volume = {26}, number = {6}, pages = {797-819}, doi = {10.1016/j.future.2010.02.014}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77951128919&doi=10.1016%2fj.future.2010.02.014&partnerID=40&md5=6f2e55ebbc24a5487126a0d311d09ba5}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Dependency injection; Grid computing; Grid services; Gridification; JGRIM}, document_type = {Article}, source = {Scopus} }
m-JGRIM: A novel middleware for Gridifying Java applications into mobile Grid services

C. Mateos, A. Zunino, and M. Campo

Software - Practice and Experience, Sep 2010

Abs Bib DOI

The benefits of Grids for building massively distributed applications have been broadly acknowledged. However, the high complexity of developing Grid applications compromises the widespread adoption of the paradigm. In a previous paper (Future Gener. Comput. Syst. 2008; 24(2):99-118), we have described JGRIM, a method for easily ’gridifying’ Java applications, based on non-invasively injecting Grid functionality into ordinary code through Dependency Injection (DI). DI is similar to the Inversion of Control notion of object-oriented frameworks and allows external services providing certain functionality to be injected into application components that require these services without affecting the components’ implementation. In this paper, we briefly revisit JGRIM and present m-JGRIM, a novel Java middleware that materializes JGRIM concepts by transforming ordinary applications into entities called Mobile Grid Services, i.e. gridified applications with mobile capabilities that live within a Grid. We also provide an evaluation of the performance of m-JGRIM. Grid practitioners should find this paper useful in having an assessment of the practical benefits and costs of gridifying applications with the middleware, and a down-to-earth description of JGRIM, whose advantages for Grid-enabling applications from a software engineering perspective have been already evaluated in (Future Gener. Comput. Syst. 2008; 24(2):99-118). Copyright © 2010 John Wiley & Sons, Ltd.
@article{Mateos2010331, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {m-JGRIM: A novel middleware for Gridifying Java applications into mobile Grid services}, journal = {Software - Practice and Experience}, year = {2010}, volume = {40}, number = {4}, pages = {331-362}, doi = {10.1002/spe.961}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77950789955&doi=10.1002%2fspe.961&partnerID=40&md5=cfb02f1b8cf653f2ea3475814c8c791e}, affiliation = {ISISTAN Research Institute - UNICEN, Campus Universitario, Tandil B7001BBO, Buenos Aires, Argentina; Consejo Nacional de Investigaciones Cientficas y Tcnicas (CONICET), Buenos Aires, Argentina}, author_keywords = {Dependency injection; Grid computing; Grid middlewares; Gridification; Java; JGRIM; Mobile grid services (MGS)}, document_type = {Article}, source = {Scopus} }
Empirically assessing the impact of dependency injection on the development of web service applications

M. Crasso, C. Mateos, A. Zunino, and M. Campo

Journal of Web Engineering, Sep 2010

Abs Bib

Service-Oriented Computing (SOC) has been broadly conceived as the next big thing in distributed software development. The software industry has embraced SOC through Web Services -functionality that is accessible via ubiquitous protocols such as HTTP-. This technology provides the basis for reuse and interoperability of applications across the WWW. However, consuming Web Services is still an expensive task in terms of development costs, since developers still have to invest much effort not only into manually discovering services, but also on providing code to invoke them, which leads to software that is polluted with service-aware code and therefore is more difficult to modify and test. Recently, a technique that has become very popular for building software is Dependency Injection (DI), which allows applications to be far more testable and maintainable. In this paper, we quantitatively analyze some of the benefits and costs of DI for building Web Service applications. We base our experiments on a refined version of DI that combines text-mining, machine learning, and best practices from component-based software development to simplify the way Web Services are discovered and consumed. To our knowledge, this is the first study on the impacts of using DI in the context of SOC. © Rinton Press.
@article{Crasso201066, author = {Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {Empirically assessing the impact of dependency injection on the development of web service applications}, journal = {Journal of Web Engineering}, year = {2010}, volume = {9}, number = {1}, pages = {66-94}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77954734345&partnerID=40&md5=d0cc26b74d58c4f55453e0fd31de6143}, affiliation = {ISISTAN Research Institute, Universidad Nacional del Centro, CONICET, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {Code-first outsourcing; Dependency injection; Service-oriented computing; Text mining; Web Services}, document_type = {Article}, source = {Scopus} }
An approach to assist developers to annotate web services with ontologies

M. Crasso, A. Zunino, and M. Campo

In Semantic Web: Standards, Tools and Ontologies, Sep 2010

Abs Bib

Web Service standards and ontologies represent the basic blocks for building a world-wide network of computer-understandable resources. The process of linkingWeb Services to ontologies, a.k.a. annotation, has been identified as a hard task. This paper presents a novel approach to annotate Web Services, which is based on linking services to ontologies that have been used for annotating similar services in the past. We discuss related work, describe the proposed approach and present experimental results. The reported experiments show the feasibility of the approach to annotate 100 real word services. © 2010 Nova Science Publishers, Inc.
@incollection{Crasso2010195, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {An approach to assist developers to annotate web services with ontologies}, booktitle = {Semantic Web: Standards, Tools and Ontologies}, year = {2010}, pages = {195-230}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-85035028729&partnerID=40&md5=e60df05a54f1e981f342478d2648cbdd}, affiliation = {ISISTAN Research Institute, Universidad Nacional del Centro de la provincia de Buenos Aires (UNICEN), Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Tandil (B7001BBO), Buenos Aires, 66100, Argentina}, document_type = {Book Chapter}, source = {Scopus} }

Automatically detecting opportunities for web service descriptions improvement

J.M. Rodriguez, M. Crasso, A. Zunino, and M. Campo

IFIP Advances in Information and Communication Technology, Sep 2010

Abs Bib DOI

Mostly e-business and e-applications rely on the Service Oriented Computing paradigm and its most popular implementation, namely Web Services. When properly implemented and described, Web Services can be dynamically discovered and reused using Internet technologies, pushing interoperability to unprecedented levels. However, poorly described Web Services are rather difficult to be discovered, understood, and reused. This paper presents heuristics for automatically detecting common pitfalls that should be avoided when creating Web Service descriptions. Experimental results with ca. 400 realworld Web Services, empirically show the feasibility of the proposed heuristics. © 2010 IFIP International Federation for Information Processing.

@article{Rodriguez2010139,
  author = {Rodriguez, J.M. and Crasso, M. and Zunino, A. and Campo, M.},
  title = {Automatically detecting opportunities for web service descriptions improvement},
  journal = {IFIP Advances in Information and Communication Technology},
  year = {2010},
  volume = {341 AICT},
  pages = {139-150},
  doi = {10.1007/978-3-642-16283-1_18},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84857184998&doi=10.1007%2f978-3-642-16283-1_18&partnerID=40&md5=8a62b12edca804a685142ecb0c9c211d},
  affiliation = {ISISTAN Research Institute, Universidad Nacional Del Centro de la Provincia de Buenos Aires (UNICEN), Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina},
  author_keywords = {Web Service discoverability anti-patterns;  Web Service modeling},
  document_type = {Conference Paper},
  source = {Scopus}
}

The EasySOC project: A rich catalog of best practices for developing web service applications

J.M. Rodriguez, M. Crasso, C. Mateos, A. Zunino, and M. Campo

In Proceedings - International Conference of the Chilean Computer Science Society, SCCC, Sep 2010

Abs Bib DOI

The Service-Oriented Computing (SOC) paradigm has gained a lot of attention in the software industry since represents a novel way of architecting distributed applications. SOC is mostly materialized via Web Services, which allows developers to structure applications as building blocks exposing a clear, public interface to their capabilities. Although conceptually and technologically mature, SOC still lacks adequate development support from a methodological point of view. We present the Easy SOC project, a catalog of guidelines to build service-oriented applications and services. This catalog synthesizes best SOC development practices that arise as a result of several years of research in fundamental SOC-related topics, namely WSDL-based technical specification, Web Service discovery and Web Service outsourcing. In addition, we describe a plug-in for the Eclipse IDE that has been implemented to simplify the utilization of the guidelines. We believe that both the practical nature of the guidelines, the empirical evidence that supports them, and the availability of IDE support that enforces them will help software practitioners to rapidly exploit our ideas for building real SOC applications. © 2010 IEEE.
@inproceedings{Rodriguez201033, author = {Rodriguez, J.M. and Crasso, M. and Mateos, C. and Zunino, A. and Campo, M.}, title = {The EasySOC project: A rich catalog of best practices for developing web service applications}, booktitle = {Proceedings - International Conference of the Chilean Computer Science Society, SCCC}, year = {2010}, pages = {33-42}, doi = {10.1109/SCCC.2010.12}, art_number = {5750492}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-79955932893&doi=10.1109%2fSCCC.2010.12&partnerID=40&md5=0e6ff32c86a6469bc9df870b9d39ea66}, affiliation = {ISISTAN Research Institute, UNICEN University, Consejo Nacional de Investigaciones Científicas Y Técnicas (CONICET), Tandil, Buenos Aires, Argentina}, author_keywords = {Service-Oriented Computing; Service-oriented development guidelines; Web Service consumption; Web Service discovery; Web Services; WSDL anti-patterns}, document_type = {Conference Paper}, source = {Scopus} }

2009

JEETuningExpert: A software assistant for improving Java Enterprise Edition application performance

M. Crasso, A. Zunino, L. Moreno, and M. Campo

Expert Systems with Applications, Sep 2009

Abs Bib DOI

Designing a JEE (Java Enterprise Edition)-based enterprise application capable of achieving its performance objectives is rather hard. Predicting the performance of this type of systems at the design level is difficult and sometimes not viable, because this requires having precise knowledge of the expected load conditions and the underlying software infrastructure. Besides, the requirement for rapid time-to-market leads to postpone performance tuning until systems are developed, packaged and running. In this paper we present a novel approach for automatically detecting performance problems in JEE-based applications and, in turn, suggesting courses of actions to correct them. The idea is to allow developers to smoothly identify and eradicate performance anti-patterns by automatically analyzing execution traces. The approach has been implemented as a tool called JEETuningExpert, and validated using three well-known JEE reference applications. Specifically, we evaluated the effectiveness of JEETuningExpert for detecting performance problems, measured the overhead imposed by online monitoring each application and the improvements were achieved after following the suggested corrective actions. These results empirically showed that the refactored applications are 40.08%, 76.94% and 61.13% faster, on average. © 2009 Elsevier Ltd. All rights reserved.
@article{Crasso200911718, author = {Crasso, M. and Zunino, A. and Moreno, L. and Campo, M.}, title = {JEETuningExpert: A software assistant for improving Java Enterprise Edition application performance}, journal = {Expert Systems with Applications}, year = {2009}, volume = {36}, number = {9}, pages = {11718-11729}, doi = {10.1016/j.eswa.2009.04.024}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-67349108267&doi=10.1016%2fj.eswa.2009.04.024&partnerID=40&md5=b0e796d9c7cab5c0cf38e8804f55b110}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina}, author_keywords = {Expert systems; Intelligent systems; Java enterprise applications; Performance anti-patterns; Performance tuning}, document_type = {Article}, source = {Scopus} }
Chronos: A multi-agent system for distributed automatic meeting scheduling

A. Zunino, and M. Campo

Expert Systems with Applications, Sep 2009

Abs Bib DOI

Meeting scheduling is a time-consuming and tedious task that often involves negotiating conflicting interests among groups of people. This paper describes Chronos, a multi-agent system for helping users in organizing their meetings. The system assigns an intelligent Organizer Agent to each user. These agents are able to schedule events negotiating time, place, day, etc. according to users’ habits and preferences. Chronos agents do not reveal users’ habits or calendars to other users in order to maintain privacy. In addition, each Organizer Agent learns from its user’s preferences and from negotiations with other agents, to provide better and more accurate assistance. The paper reports encouraging experimental results and comparisons with related approaches. © 2008 Elsevier Ltd. All rights reserved.
@article{Zunino20097011, author = {Zunino, A. and Campo, M.}, title = {Chronos: A multi-agent system for distributed automatic meeting scheduling}, journal = {Expert Systems with Applications}, year = {2009}, volume = {36}, number = {3 PART 2}, pages = {7011-7018}, doi = {10.1016/j.eswa.2008.08.024}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-58349102283&doi=10.1016%2fj.eswa.2008.08.024&partnerID=40&md5=36c66ea9586e321d3dbf3b2737e1d449}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina}, author_keywords = {Intelligent agents; Meeting scheduling; Multi-agent systems}, document_type = {Article}, source = {Scopus} }
Grid-Enabling applications with JGRIM

C. Mateos, A. Zunino, and M. Campo

International Journal of Grid and High Performance Computing, Sep 2009

Abs Bib DOI

The development of massively distributed applications with enormous demands for computing power, memory, storage and bandwidth is now possible with the Grid. Despite these advances, building Grid applications is still very difficult. We present JGRIM, an approach to easily gridify Java applications by separating functional and Grid concerns in the application code, and report evaluations of its benefits with respect to related approaches. The results indicate that JGRIM simplifies the process of porting applications to the Grid, and the Grid code obtained from this process performs in a very competitive way compared to the code resulting from using similar tools. [Article copies are available for purchase from InfoSci-on-Demand.com] © 2009, IGI Global.
@article{Mateos200952, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {Grid-Enabling applications with JGRIM}, journal = {International Journal of Grid and High Performance Computing}, year = {2009}, volume = {1}, number = {3}, pages = {52-72}, doi = {10.4018/jghpc.2009070104}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-77949487455&doi=10.4018%2fjghpc.2009070104&partnerID=40&md5=f0d03cf48c621ee179ea164e580b2bf6}, affiliation = {ISISTAN - UNCPBA, Argentina}, author_keywords = {Dependency injection; Grid computing; Grid programmingmodels; Grid resources; Gridification; JGRIM}, document_type = {Article}, source = {Scopus} }
BYG: An approach to just-in-time gridification of conventional java applications

C. Mateos, A. Zunino, M. Campo, and R. Trachsel

Advances in Parallel Computing, Sep 2009

Abs Bib DOI

Grid technologies allow developers to run applications with enormous demands for resources such as processing power, data and network bandwidth. However, exploiting Grid resources demands developers to alter their applications to explicitly access the services of specific Grid middlewares. This involves more development effort and requires expertise on Grid programming. A number of recent research efforts among the so-called gridification methods aim to avoid these problems by semi-automatically deriving the Grid-enabled version of an application from its binary code. However, most of these approaches produce coarse-grained Grid applications that prevent programmers from employing tuning mechanisms such as parallelism and distribution, and are rather inflexible, since they were not designed to reuse existing Grid middleware services. To solve these issues, we propose BYG (BYtecode Gridifier), a new gridification method to easily gridify binary Java applications. The chapter describes the prototype implementation of BYG and some experiments showing the feasibility of the approach. Results show that BYG can be used to conveniently gridify and efficiently execute a broad range of computing intensive applications. © 2009 The authors and IOS Press. All rights reserved.
@article{Mateos2009232, author = {Mateos, C. and Zunino, A. and Campo, M. and Trachsel, R.}, title = {BYG: An approach to just-in-time gridification of conventional java applications}, journal = {Advances in Parallel Computing}, year = {2009}, volume = {17}, pages = {232-260}, doi = {10.3233/978-1-60750-004-9-232}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84906562044&doi=10.3233%2f978-1-60750-004-9-232&partnerID=40&md5=bc45692e36822a52dabe569dc4739067}, affiliation = {ISISTAN Research Institute - UNICEN, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; CONICET (Consejo Nacional de Investigaciones Cientficas y Técnicas), Argentina}, author_keywords = {Grid computing; Grid middlewares; gridification; Java bytecode; just-in-time computing; legacy programs}, document_type = {Article}, source = {Scopus} }

2008

A peer-to-peer communication infrastructure for groupware applications

P. Gotthelf, A. Zunino, and M. Campo

International Journal of Cooperative Information Systems, Sep 2008

Abs Bib DOI

Many advances have been done to allow groups of people to work together and collaborate in the Internet. Collaborative systems are characterized by the way participants interact. In many cases, equal standing members should cooperate in a non-authoritative environment, where no entity or authority is or should be in charge of regulating the group. Therefore, decentralized communication infrastructures have been hailed as promising alternatives. Recently, decentralized infrastructures based on P2P approaches have drawn the attention of the research community because of their benefits in terms of scalability, robustness, availability and potentials for leveraging computational resources distributed across the Internet. In this paper, a scalable peer-to-peer (P2P) communication Infrastructure for groupware applications is presented. It enables a large number of people to join and cooperate in a robust, decentralized and easy deployable way, without requiring high capacity servers or any other special network infrastructure. The communication infrastructure is based on a binary tree as overlay structure, which implements all groupware communication functionality, including membership management and packet forwarding, at application level, making it an inexpensive and fast deployable solution for equal standing members, such as home users with a domestic connection to the Internet. Two applications, one for synchronous groupware and the other for asynchronous collaboration, have been developed to validate the approach. Comparisons with other communication infrastructures in aspects such as end-to-end propagation delay, group latency, throughput, protocol overhead, failure recovery and link stress, show that our approach is a scalable and robust alternative. © 2008 World Scientific Publishing Company.
@article{Gotthelf2008523, author = {Gotthelf, P. and Zunino, A. and Campo, M.}, title = {A peer-to-peer communication infrastructure for groupware applications}, journal = {International Journal of Cooperative Information Systems}, year = {2008}, volume = {17}, number = {4}, pages = {523-554}, doi = {10.1142/S0218843008001920}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-56849119625&doi=10.1142%2fS0218843008001920&partnerID=40&md5=7f19c73fa545b065590e10f4284fcee2}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET)}, author_keywords = {Application level multicast; Groupware; Overlay networks; P2P}, document_type = {Conference Paper}, source = {Scopus} }

Query by example for web services

M. Crasso, A. Zunino, and M. Campo

In Proceedings of the ACM Symposium on Applied Computing, Sep 2008

Abs Bib DOI

Web services have acquired enormous popularity among software developers and researchers due to the increasing levels of flexibility required by current distributed applications. However, service search facilities are still rather difficult to use. This paper presents WSQBE, a search method that aims at assisting service discoverers by generating a short list of candidate services and easing query specification. In contrast with previous approaches, WSQBE discovery process is based on a novel search space reduction mechanism. Experimental evaluations of our approach are also reported. Copyright 2008 ACM.

@inproceedings{Crasso20082376,
  author = {Crasso, M. and Zunino, A. and Campo, M.},
  title = {Query by example for web services},
  booktitle = {Proceedings of the ACM Symposium on Applied Computing},
  year = {2008},
  pages = {2376-2380},
  doi = {10.1145/1363686.1364251},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-56749174175&doi=10.1145%2f1363686.1364251&partnerID=40&md5=8df1ad7e3477804691a59c4724284716},
  affiliation = {CONICET and ISISTAN Research Institute, Fac. Cs. Exactas, Campus Universitario, Paraje Arroyo Seco, Tandil (B7001BBO), Buenos Aires, Argentina},
  author_keywords = {Distributed systems;  Information filtering;  Information retrieval;  Query-by-example;  Web service discovery;  Web services},
  document_type = {Conference Paper},
  source = {Scopus}
}

GMAC: An overlay multicast network for mobile agent platforms

P. Gotthelf, A. Zunino, C. Mateos, and M. Campo

Journal of Parallel and Distributed Computing, Sep 2008

Abs Bib DOI

The lack of proper support for multicast services in the Internet has hindered the widespread use of applications that rely on group communication services such as mobile software agents. Although they do not require high bandwidth or heavy traffic, these types of applications need to cooperate in a scalable, fair and decentralized way. This paper presents GMAC, an overlay network that implements all multicast related functionality-including membership management and packet forwarding-in the end systems. GMAC introduces a new approach for providing multicast services for mobile agent platforms in a decentralized way, where group members cooperate in a fair way, minimize the protocol overhead, thus achieving great scalability. Simulations comparing GMAC with other approaches, in aspects such as end-to-end group propagation delay, group latency, group bandwidth, protocol overhead, resource utilization and failure recovery, show that GMAC is a scalable and robust solution to provide multicast services in a decentralized way to mobile software agent platforms with requirements similar to MoviLog. © 2008 Elsevier Ltd. All rights reserved.
@article{Gotthelf20081081, author = {Gotthelf, P. and Zunino, A. and Mateos, C. and Campo, M.}, title = {GMAC: An overlay multicast network for mobile agent platforms}, journal = {Journal of Parallel and Distributed Computing}, year = {2008}, volume = {68}, number = {8}, pages = {1081-1096}, doi = {10.1016/j.jpdc.2008.04.002}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-46149083710&doi=10.1016%2fj.jpdc.2008.04.002&partnerID=40&md5=fbccabfff364395eba52d0d2f224686e}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas (CONICET), Argentina}, author_keywords = {Computer networks; Mobile software agents; Multicast networks; Overlay networks; P2P}, document_type = {Article}, source = {Scopus} }
A survey on approaches to gridification

C. Mateos, A. Zunino, and M. Campo

Software - Practice and Experience, Sep 2008

Abs Bib DOI

The Grid shows itself as a globally distributed computing environment, in which hardware and software resources are virtualized to transparently provide applications with vast capabilities. Just like the electrical power grid, the Grid aims at offering a powerful yet easy-to-use computing infrastructure to which applications can be easily ’plugged’ and efficiently executed. Unfortunately, it is still very difficult to Grid-enable applications, since current tools force users to take into account many details when adapting applications to run on the Grid. In this paper, we survey some of the recent efforts in providing tools for easy gridification of applications and propose several taxonomies to identify approaches followed in the materialization of such tools. We conclude this paper by describing common features among the proposed approaches, and by pointing out open issues and future directions in the research and development of gridification methods. Copyright © 2007 John Wiley & Sons, Ltd.
@article{Mateos2008523, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {A survey on approaches to gridification}, journal = {Software - Practice and Experience}, year = {2008}, volume = {38}, number = {5}, pages = {523-556}, doi = {10.1002/spe.847}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-41849128135&doi=10.1002%2fspe.847&partnerID=40&md5=e9370ce5a67ace56a47edeabec7433dc}, affiliation = {ISISTAN Research Institute, UNICEN, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Conseja Nacional de Investigaciones Científias y Técnias (CONICET), Argentina}, author_keywords = {Grid computing; Grid development; Gridification tools}, document_type = {Article}, source = {Scopus} }
Easy web service discovery: A query-by-example approach

M. Crasso, A. Zunino, and M. Campo

Science of Computer Programming, Sep 2008

Abs Bib DOI

Web services have acquired enormous popularity among software developers. This popularity has motivated developers to publish a large number of Web service descriptions in UDDI registries. Although these registries provide search facilities, they are still rather difficult to use and often require service consumers to spend too much time manually browsing and selecting service descriptions. This paper presents a novel search method for Web services called WSQBE that aims at both easing query specification and assisting discoverers by returning a short and accurate list of candidate services. In contrast with previous approaches, WSQBE discovery process is based on an automatic search space reduction mechanism that makes this approach more efficient. Empirical evaluations of WSQBE search space reduction mechanism, retrieval performance, processing time and memory usage, using a registry with 391 service descriptions, are presented. © 2008 Elsevier B.V. All rights reserved.
@article{Crasso2008144, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {Easy web service discovery: A query-by-example approach}, journal = {Science of Computer Programming}, year = {2008}, volume = {71}, number = {2}, pages = {144-164}, doi = {10.1016/j.scico.2008.02.002}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-42149137270&doi=10.1016%2fj.scico.2008.02.002&partnerID=40&md5=ee64fc6bbc03e2d7ace58c736d8b17f6}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina}, author_keywords = {Distributed systems; Information filtering; Information retrieval; Query-by-example; Web service discovery; Web services}, document_type = {Article}, source = {Scopus} }
JGRIM: An approach for easy gridification of applications

C. Mateos, A. Zunino, and M. Campo

Future Generation Computer Systems, Sep 2008

Abs Bib DOI

The term "Grid" was coined to describe a form of distributed computing in which hardware and software resources from disparate sites are virtualized to provide applications with a single, powerful computing infrastructure. In fact, the term comes from an analogy with the electrical power grid infrastructure, since researchers expect applications to access Grid resources as transparently as electricity is now consumed. However, "plugging" applications into the Grid is still very difficult because current toolkits force programmers to take into account many complex details when coding applications for the Grid. This paper presents JGRIM, a middleware for easy "gridification" of ordinary Java applications. The main goal of JGRIM is to make the task of porting applications to the Grid easier and, at the same time, provide facilities to easily address efficiency issues when gridifying an application. An experimental evaluation showing the feasibility of our approach and some of its benefits is also reported. © 2007 Elsevier Ltd. All rights reserved.
@article{Mateos200899, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {JGRIM: An approach for easy gridification of applications}, journal = {Future Generation Computer Systems}, year = {2008}, volume = {24}, number = {2}, pages = {99-118}, doi = {10.1016/j.future.2007.04.011}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-34948859525&doi=10.1016%2fj.future.2007.04.011&partnerID=40&md5=5213f768b830c97ebd8bf80b24d80aac}, affiliation = {ISISTAN Research Institute - UNICEN, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina}, author_keywords = {Dependency injection; Grid computing; Gridification; Mobile agents; Service-oriented grids}, document_type = {Article}, source = {Scopus} }
AWSC: An approach to Web service classification based on machine learning techniques

M. Crasso, A. Zunino, and M. Campo

Inteligencia Artificial, Sep 2008

Abs Bib DOI

A Web service is a Web accessible software that can be published, located and invoked by using standard Web protocols. Automatically determining the category of a Web service, from several pre-defined categories, is an important problem with many applications such as service discovery, semantic annotation and service matching. This paper describes AWSC (Automatic Web Service Classification), an automatic classifier of Web service descriptions. AWSC exploits the connections between the category of a Web service and the information commonly found in standard descriptions. In addition, AWSC bridges different styles for describing services by combining text mining and machine learning techniques. Experimental evaluations show that this combination helps our classification system at improving its precision. In addition, we report an experimental comparison of AWSC with a related work. © AEPIA.
@article{Crasso200825, author = {Crasso, M. and Zunino, A. and Campo, M.}, title = {AWSC: An approach to Web service classification based on machine learning techniques}, journal = {Inteligencia Artificial}, year = {2008}, volume = {12}, number = {37}, pages = {25-36}, doi = {10.4114/ia.v12i37.955}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-42149134371&doi=10.4114%2fia.v12i37.955&partnerID=40&md5=1f34a806af9e1c56f3cbce5e1707c6a5}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina}, author_keywords = {Machine learning; Text classification; Web services}, document_type = {Conference Paper}, source = {Scopus} }

2007

Mobile agents meet web services

C. Mateos, A. Zunino, and M. Campo

In Modern Technologies in Web Services Research, Sep 2007

Abs Bib DOI

Web services standards provide the basis for interoperability, discovery and integration of distributed applications. Web services will enable mobile agents to better use and exploit Web accessible applications and resources. However, there is a lack of tools for integrating mobile agents and Web services. This chapter presents MoviLog, a novel programming language for enabling mobile agents to consume Web services. The most interesting aspect of the language is its reactive mobility by failure mechanism that allows programmers to develop mobile agents without explicitly providing code for handling mobility or Web services invocations. © 2007, IGI Global.
@incollection{Mateos200798, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {Mobile agents meet web services}, booktitle = {Modern Technologies in Web Services Research}, year = {2007}, pages = {98-121}, doi = {10.4018/978-1-59904-280-0.ch006}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84899280379&doi=10.4018%2f978-1-59904-280-0.ch006&partnerID=40&md5=46d1bd76fa97b2fd58d45c9f82f3bbd2}, affiliation = {ISISTAN, UNICEN-CONICET, Tandil, Argentina}, document_type = {Book Chapter}, chapter = {6}, source = {Scopus} }

Extending movilog for supporting Web services

C. Mateos, A. Zunino, and M. Campo

Computer Languages, Systems and Structures, Sep 2007

Abs Bib DOI

Web Services enable computers to interact and exploit Web-accessible programs without human intervention. Despite researchers agree that mobile agent technology will obtain significant benefits from this line of research, the lack of proper development tools hinder the widespread adoption of mobile agent technology on the Web. This paper describes a novel programming language called WS-Log whose goal is to provide a tight integration between mobile agents and Web Services. Examples and experimental results showing some of the advantages of WS-Log are also reported. © 2006 Elsevier Ltd. All rights reserved.

@article{Mateos200711,
  author = {Mateos, C. and Zunino, A. and Campo, M.},
  title = {Extending movilog for supporting Web services},
  journal = {Computer Languages, Systems and Structures},
  year = {2007},
  volume = {33},
  number = {1},
  pages = {11-31},
  doi = {10.1016/j.cl.2006.02.001},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-33746860707&doi=10.1016%2fj.cl.2006.02.001&partnerID=40&md5=c8ff96c3d41f132bcee0f6724067e115},
  affiliation = {ISISTAN Research Institute. UNICEN University, UNCPBA, Campus Universitario, Tandil, B7001BBO Buenos Aires, Argentina},
  author_keywords = {Intelligent agents;  Logic programming;  Mobile agents;  Web services},
  document_type = {Article},
  source = {Scopus}
}

A decentralized middleware for groupware applications

P. Gotthelf, A. Zunino, and M. Campo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2007

Abs Bib DOI

Many advances have been done to allow groups of people to work together and collaborate in the Internet. Most of these advances rely on a single server or other centralized communication topologies. However, pure decentralized approaches can bring many benefits to groupware applications, such as scalability, robustness, availability and easy deployment. In this paper, a decentralized middleware for groupware applications is presented, which enables people to join and cooperate in groups in a robust and easy deployable way, without relying on a central server or requiring any other special infrastructure. Two applications, one for synchronous groupware and other for asynchronous collaboration are shown as examples of successful experiences. This groupware middleware is based on a binary tree as overlay structure, which implements all groupware communication functionality, including membership management and packet forwarding, at application level, making it suitable for the Internet. Comparisons with other approaches in aspects such as throughput, protocol overhead, resource utilization and group bandwidth, shows that this middleware is a scalable and robust communication scheme to synchronous or asynchronous groups in the Internet. © Springer-Verlag Berlin Heidelberg 2007.
@article{Gotthelf2007191, author = {Gotthelf, P. and Zunino, A. and Campo, M.}, title = {A decentralized middleware for groupware applications}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2007}, volume = {4715 LNCS}, pages = {191-206}, doi = {10.1007/978-3-540-74812-0_15}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-38149011516&doi=10.1007%2f978-3-540-74812-0_15&partnerID=40&md5=0fb3a695c258bdb7fe3cfcba9f762dd6}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Tandil (B7001BBO), Buenos Aires, Argentina; Consejo Nacional de Investigaciones Científicas y Técnicas Conicet}, document_type = {Conference Paper}, source = {Scopus} }

2006

Adding semantic web services matching and discovery support to the moviLog platform

C. Mateos, M. Crasso, A. Zunino, and M. Campo

IFIP International Federation for Information Processing, Sep 2006

Abs Bib DOI

Semantic Web services are self describing programs that can be searched, understood and used by other programs. Despite the advantages Semantic Web services provide, specially for building agent based systems, there is a need for mechanisms to enable agents to discover Semantic Web services. This paper describes an extension of the MoviLog agent platform for searching Web services taking into account their semantic descriptions. Preliminary experiments showing encouraging results are also reported. © 2006 International Federation for Information Processing.
@article{Mateos200651, author = {Mateos, C. and Crasso, M. and Zunino, A. and Campo, M.}, title = {Adding semantic web services matching and discovery support to the moviLog platform}, journal = {IFIP International Federation for Information Processing}, year = {2006}, volume = {217}, pages = {51-60}, doi = {10.1007/978-0-387-34747-9_6}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-33845518643&doi=10.1007%2f978-0-387-34747-9_6&partnerID=40&md5=bfa4798f4b13cd9fc227dc469d126303}, affiliation = {ISISTAN Research Institute, Facultad de Cs. Exactas, UNICEN, Campus Universitario, Paraje Arroyo Seco - Bs. As., Argentina}, document_type = {Article}, source = {Scopus} }

Supporting ontology-based semantic matching of web services in movilog

C. Mateos, M. Crasso, A. Zunino, and M. Campo

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2006

Abs Bib DOI

The Web is moving towards the creation of a worldwide network of Web Services known as the Semantic Web. This new environment will allow agents to autonomously interact with Web information and services. This paper presents Apollo, an infrastructure which offers semantic matching and discovery capabilities to MoviLog, a platform for building mobile agents on the Semantic Web. Examples and experimental results showing the practical usefulness of Apollo are also reported. © Springer-Verlag Berlin Heidelberg 2006.

@article{Mateos2006390,
  author = {Mateos, C. and Crasso, M. and Zunino, A. and Campo, M.},
  title = {Supporting ontology-based semantic matching of web services in movilog},
  journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)},
  year = {2006},
  volume = {4140 LNAI},
  pages = {390-399},
  doi = {10.1007/11874850_43},
  url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-33751368998&doi=10.1007%2f11874850_43&partnerID=40&md5=61d86aeadc2e1abd14f65df0d32c5db6},
  affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, (B7001BBO) Tandil, Bs. As., Argentina},
  document_type = {Conference Paper},
  source = {Scopus}
}

2005

Reactive mobility by failure: When fail means move

A. Zunino, M. Campo, and C. Mateos

Information Systems Frontiers, Sep 2005

Abs Bib DOI

Mobile agent development is mainly supported by Java-based platforms and tools. However, the weak mobility model they use, the lack of adequate support for developing inference and reasoning mechanisms, added to the inherent complexity of building location-aware software, impose strong limitations for developing mobile intelligent agent systems. In this article we present MoviLog, a platform for building Prolog-based mobile agents with a strong mobility model. MoviLog is an extension of JavaLog, an integration of Java and Prolog, that allows us to take advantage of the best features of the programming paradigms they represent. MoviLog agents, called Brainlets, are able to migrate among different Web sites, either proactively or reactively, to use the available knowledge in order to find a solution. The major contribution of MoviLog is its Reactive Mobility by Failure (RMF) mechanism. RMF is a mechanism that acts when an agent needs a resource or service that is not available at the current executing site. RMF uses a distributed multi-agent system to transparently transport the executing agent to the site where the resource/service is available, thus reducing the development effort with respect to the traditional mobile agent approach, while maintaining its advantages. © Springer Science + Business Media, Inc. 2005.
@article{Zunino2005141, author = {Zunino, A. and Campo, M. and Mateos, C.}, title = {Reactive mobility by failure: When fail means move}, journal = {Information Systems Frontiers}, year = {2005}, volume = {7}, number = {2 SPEC. ISS.}, pages = {141-154}, doi = {10.1007/s10796-005-1475-2}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-22944489209&doi=10.1007%2fs10796-005-1475-2&partnerID=40&md5=270e99f20b701f25eca06d9916924fa1}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario (B7001BBO), Tandil, Bs. As., Argentina; National Council for Scientific and Technical Research of Argentina (CONICET), Argentina; Council for Scientific Research of Buenos Aires, Argentina (CIC), Argentina; Department of the VI Argentine Symposium on Artificial Intelligence (ASAI), Argentina; Computer Science Department; ISISTAN Research Institute, UNICEN, Argentina}, author_keywords = {Intelligent agents; Logic programming; Mobile agents; Mobility}, document_type = {Review}, source = {Scopus} }
JavaLog: A framework-based integration of Java and Prolog for agent-oriented programming

A. Amandi, M. Campo, and A. Zunino

Computer Languages, Systems and Structures, Sep 2005

Abs Bib DOI

Intelligent agent development has imposed new challenges on the necessary language support. Object-oriented languages have been proposed as an appropriate tool, although logic-oriented languages are more adequate for managing mental attitudes. Multi-paradigm languages supporting encapsulation of actions, hiding of private knowledge and flexible manipulation of knowledge are, certainly, a good alternative for programming agents. However, a unique language to support flexible and efficient development of multi-agent systems confronts with the tradeoffs imposed by expressive power, efficiency and support technology. An alternative to conciliate these tradeoffs is not to think about a single language but an incrementally compatible family of agent-oriented multi-paradigm languages. In this work we present an approach based on object-oriented framework technology for integrating object and logic paradigms in such a way that new language features can be incrementally added to the core language. This core language is based on logic modules integrated as object abstractions in the object paradigm. JavaLog is a materialization of this framework integrating Java and Prolog. This core was extended to provide multi-threading support, mobility and temporal-logic operators to Prolog. MoviLog, the mobile part of the family provides a novel mobility mechanism, reactive mobility by failure, which enables virtual Prolog databases distributed across Web sites. © 2004 Elsevier Ltd. All rights reserved.
@article{Amandi200517, author = {Amandi, A. and Campo, M. and Zunino, A.}, title = {JavaLog: A framework-based integration of Java and Prolog for agent-oriented programming}, journal = {Computer Languages, Systems and Structures}, year = {2005}, volume = {31}, number = {1}, pages = {17-33}, doi = {10.1016/j.cl.2004.03.001}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-5444254505&doi=10.1016%2fj.cl.2004.03.001&partnerID=40&md5=b3e3bfdc794ead506c69afa7f407b4a8}, affiliation = {ISISTAN Research Institute, UNICEN University, Campus Universitario, Paraje Arroyo Seco, Tandil (7000), Buenos Aires, Argentina}, author_keywords = {Agent-oriented programming; Intelligent agents; Logic programming; Multi-paradigm languages; Object-oriented frameworks; Object-oriented programming}, document_type = {Article}, source = {Scopus} }
Integrating intelligent mobile agents with Web services

C. Mateos, A. Zunino, and M. Campo

International Journal of Web Services Research, Sep 2005

Abs Bib DOI

Research on Web services aims at extending the Web with computer-understandable descriptions enabling programs to interact and exploit Web-accessible programs without human intervention. Advances in this line of research will strongly benefit the fields of intelligent and mobile agents due to their potentials for building Web-enabled applications. In this paper, we describe a novel programming language called MoviLog for developing intelligent mobile agents that interact with Web services. The most interesting aspect of the language is its Reactive Mobility by Failure mechanism that allows programmers to develop mobile agents without explicitly providing code for handling mobility. Copyright © 2005, Idea Group Inc.
@article{Mateos200585, author = {Mateos, C. and Zunino, A. and Campo, M.}, title = {Integrating intelligent mobile agents with Web services}, journal = {International Journal of Web Services Research}, year = {2005}, volume = {2}, number = {2}, pages = {85-103}, doi = {10.4018/jwsr.2005040105}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-15744384383&doi=10.4018%2fjwsr.2005040105&partnerID=40&md5=2890fbc6cada9f90de8860c2e999ee96}, affiliation = {ISISTAN-UNCPBA-CIC, Argentina; ISISTAN-UNCPBA-CONICET, Argentina}, author_keywords = {Logic programming; Mobile agents; Web applications; Web services}, document_type = {Article}, source = {Scopus} }

2003

MoviLog: A Platform for Prolog-Based Strong Mobile Agents on the WWW

Alejandro Zunino, Marcelo Campo, and Cristian Mateos

Inteligencia Artificial, Sep 2003

Bib

@article{DBLP:journals/aepia/ZuninoCM03,
  author = {Zunino, Alejandro and Campo, Marcelo and Mateos, Cristian},
  title = {MoviLog: {A} Platform for Prolog-Based Strong Mobile Agents on the
      {WWW}},
  journal = {Inteligencia Artificial},
  volume = {7},
  number = {21},
  pages = {83--92},
  year = {2003},
  url = {http://journal.iberamia.org/index.php/ia/article/view/394/article\%20\%281\%29.pdf},
  timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl = {https://dblp.org/rec/journals/aepia/ZuninoCM03.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

2002

Simplifying mobile agent development through reactive mobility by failure

A. Zunino, M. Campo, and C. Mateos

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 2002

Abs Bib DOI

Nowadays, Java-based platforms are the most common proposals for building mobile agent systems using web technology. However, the weak mobility model they use, the lack of adequate support for supporting inference and reasoning, added to the inherent complexity of developing location aware software, impose strong limitations for developing mobile intelligent agent systems. In this article we present MoviLog, a platform for building Prolog-based mobile agents with a strong mobility model. MoviLog is an extension of JavaLog, an integration of Java and Prolog, that allows a user to take advantage of the best features of the programming paradigms they represent. MoviLog provides logic modules, called Brainlets, which are able to migrate among different web sites, either proactively or reactively, to use the available knowledge in order to find a solution. The most interesting feature introduced by MoviLog is the reactive mobility by failure (RMF)mec hanism. This mechanism acts when a specially declared Prolog predicate fails, by transparently moving a Brainlet to another host which has declared the same predicate to try to satisfy the current goal. © Springer-Verlag Berlin Heidelberg 2002.
@article{Zunino2002163, author = {Zunino, A. and Campo, M. and Mateos, C.}, title = {Simplifying mobile agent development through reactive mobility by failure}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {2002}, volume = {2507}, pages = {163-174}, doi = {10.1007/3-540-36127-8_16}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84948180467&doi=10.1007%2f3-540-36127-8_16&partnerID=40&md5=467a00bed94b6cbb74d472d52e6c7032}, affiliation = {ISISTAN Research Institute - UNICEN University, Campus Universitario, Tandil, Bs. As B7001BBO, Argentina}, document_type = {Conference Paper}, source = {Scopus} }

2001

JavaLog: Un Lenguaje para la Programacion de Agentes

Alejandro Zunino, Luis Berdún, and Analı́a Amandi

Inteligencia Artificial, Sep 2001

Bib

@article{DBLP:journals/aepia/ZuninoBA01,
  author = {Zunino, Alejandro and Berd{\'{u}}n, Luis and Amandi, Anal{\'{\i}}a},
  title = {JavaLog: Un Lenguaje para la Programacion de Agentes},
  journal = {Inteligencia Artificial},
  volume = {5},
  number = {13},
  pages = {94--99},
  year = {2001},
  url = {http://journal.iberamia.org/index.php/ia/article/view/311/article\%20\%281\%29.pdf},
  timestamp = {Mon, 02 Mar 2020 00:00:00 +0100},
  biburl = {https://dblp.org/rec/journals/aepia/ZuninoBA01.bib},
  bibsource = {dblp computer science bibliography, https://dblp.org}
}

1999

Multi-paradigm languages supporting multi-agent development

A. Amandi, A. Zunino, and R. Iturregui

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics), Sep 1999

Abs Bib DOI

Object-oriented languages generally support agent developments despite logic languages are more appropriate for managing mental attitudes. The alternative of a multi-paradigm language is a way for supporting agent constructions we explore. A multi-paradigm language that supports the encapsulation of actions, the hiding of private knowledge and the flexible manipulation of knowledge could be a good candidate for programming agents. Therefore, we present an approach for integrating object and logic paradigms based on logic modules combined with object-oriented abstractions. This approach aims at the construction of flexible agents in terms of easy extensions of the components of the logic interpreter. JavaLog, a particular implementation based on Java and Prolog, is also introduced. © Springer-Verlag Berlin Heidelberg 1999.
@article{Amandi1999128, author = {Amandi, A. and Zunino, A. and Iturregui, R.}, title = {Multi-paradigm languages supporting multi-agent development}, journal = {Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)}, year = {1999}, volume = {1647}, pages = {128-139}, doi = {10.1007/3-540-48437-X_11}, url = {https://www.scopus.com/inward/record.uri?eid=2-s2.0-84855890088&doi=10.1007%2f3-540-48437-X_11&partnerID=40&md5=25d789edad6e3cf4f3696cadc62be5f6}, affiliation = {ISISTAN Research Institute, Universidad Nacional del Centro de la Pcia, 7000, de Buenos Aires Campus Paraje Arroyo Seco, Tandil - Bs. As, Argentina}, document_type = {Conference Paper}, source = {Scopus} }