Publications

From Web Science Brasil

Revision as of 18:26, 12 June 2010

Instructions

Please upload here your publications related to our project, according to the following guidelines:

1. If your publication is a position paper, use the SBC paper formatting template.
2. Make sure your publication acknowledges our project, CNPq 557.128/2009-9 and, for those in Rio, also FAPERJ E-26/170028/2008 (Programa INC&T - Projeto: Instituto Brasileiro de Pesquisa em Ciência da Web).
3. Edit the page and include an item in the publications list below for your publication, relating it to one of the project goals, using the #Publication template below
4. Save the page.
5. Click on the red link to upload your file. When uploading the file, copy the paper abstract to the "Summary" field.

Publication list

• Breitman, K., Pastor, O., Barbosa, S.D.J. Flexible Narrative Representations: Bridging the gap between Formal Models and Informal Representations. In Flexitools Workshop 2010, ACM/IEEE 32nd International Conference on Software Engineering, ICSE 2010. Cape Town, South Africa, 2-8 May 2010.
  • project area - topic - goal
  • 30-word statement of contribution to the related project goal

• Eraldo R. Fernandes, Carlos E. M. Crestana, Ruy L. Milidiú. Hedge detection using the RelHunter approach. In: Proceedings of the Fourteenth Conference on Computational Natural Language Learning Shared Task (CoNLL 2010), Uppsala, Sweden, 2010 (to appear).
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We apply RelHunter to the CoNLL 2010 Shared Task - Closed Task 2: detection of hedge cues and their scopes. The $F$-score of our system is $54.05$, whereas the highest one is $57.32$.

• Paulo Gomide, Ruy L. Milidiú. Assessing Stock Market Time Series Predictors Quality Through a Pairs Trading System. In: Proceedings of the XI Brazilian Symposium on Artificial Neural Network - SBRN, São Bernardo do Campo, Brasil, 2010 (accepted).

• Eraldo R. Fernandes, Cícero N. dos Santos, and Ruy L. Milidiú. A Machine Learning Approach to Portuguese Clause Identification. In: Proceedings of the PROPOR'2010, Porto Alegre, Brasil, 55-64, 2010.
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We propose and evaluate an Entropy Guided Transformation Learning system for Portuguese clause identification. This is the first machine-learning-based approach to this task.

• Leandro G. M. Alvim, Paula Vilela, Eduardo N. Motta, Ruy L. Milidiú. Sentiment of Financial News: A Natural Language Processing Approach. In: Proceedings of the 1st Workshop on Natural Language Processing Tools Applied to Discourse Analysis in Psychology (2010), Buenos Aires, Argentina, May 10 - 14, 2010.
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We use basic Natural Language Processors to improve Sentiment Analysis quality for financial news. We also provide Petronews, a new annotated dataset containing news about Petrobras.

• Cícero N. dos Santos, Ruy L. Milidiú, Carlos E. M. Crestana and Eraldo R. Fernandes. ETL Ensembles for Chunking, NER and SRL. In: Proceedings of the 11th International Conference on Intelligent Text Processing and Computational Linguistics, A. Gelbukh (Ed.): CICLing 2010, LNCS 6008, pp. 100 - 112. Springer, Heidelberg (2010).
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We apply ETL Ensembles for three basic Computational Linguistic tasks: Text Chunking, Named Entity Recognition and Semantic Role Labeling. Our systems performance is competitive with state-of-the-art.

• Pedro Henriques dos Santos Teixeira and Ruy L. Milidiú. Data Stream Anomaly Detection through Principal Subspace Tracking. In: Proceedings of the 25th Symposium On Applied Computing, ACM-SAC'2010, Sierre, Switzerland, 2010.
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We introduce the Fast Rank-Adaptive row-Householder Subspace Tracking (FRAHST) algorithm for anomaly detection in multiple co-evolving data streams. This work received the Best Paper Award in the Information Systems theme at the Conference.

• Ruy L. Milidiú, Leandro G. M. Alvim, Cícero N. dos Santos. Daily Volume Forecasting Using High-Frequency Predictors. In: Proceedings of the IASTED International Conference on Artificial Intelligence and Applications (AIA 2010), Innsbruck, Austria, February 15 – 17, 2010.
  • Análise da Aplicabilidade da Solução em Outros Cenários - Gerenciamento de Dados na Web - Descoberta de Conhecimento na Web
  • We explore the use of intraday information to improve daily volume forecasting. Our SVM and PLS predictors show a remarkable quality when tested with the top nine high liquidity Bovespa stocks.

• Nunes, I., Barbosa, S.D.J., Lucena, C.J.P. An End-user Domain-specific Model to Drive Dynamic User Agents Adaptations. The 22nd International Conference on Software Engineering and Knowledge Engineering, SEKE 2010. San Francisco Bay, USA, 1-3 July 2010.
  • Software technologies for web applications - A Multi-Agent Systems Approach for Developing Autonomic Web Applications - G1. Design techniques to improve the development of autonomic Web applications
  • Our metamodel provides a domain-specific language that empowers users to express their preferences to program their agents, together with a MAS architecture that modularizes variability into agent abstractions.

• Cirilo, E.J.R., Nunes, I., Kulesza, U., Lucena, C.J.P. Automating the Product Derivation Process of Multi-Agent Systems Product Lines, Journal of Systems and Software (submitted), 2010. Extended version of the paper presented in the XXIII Simpósio Brasileiro de Engenharia de Software (SBES 2009), Fortaleza, Brazil, pp. 12-21.
  • Software technologies for web applications - Model-driven Design and Implementation of Web Applications - G3. Develop methodologies, empirical studies and tools to support the development of software product lines for the Web context
  • In this paper, we present an approach that addresses the application engineering process of MAS-PLs. The main goal of our approach is to provide models to capture the configuration knowledge associated with agent abstractions, thus enabling the MAS-PL variability management and automatic product derivation. Our approach is implemented as an extension of the GenArch product derivation tool.

• Cowan, D., Alencar, P., McGarry, F., Lucena, C., Nunes, I. A Web-based Framework for Collaborative Innovation. First Workshop of the Brazilian Institute for Web Science Research (Position paper), 2010.
  • Software technologies for web applications - Model-driven Design and Implementation of Web Applications - G1. Define a model-driven framework to support specification, design and implementation of Web applications, seen as part of men-machine teams
  • This paper describes a framework to support the social and technical principles which underlie current and future web-based CI. It will also present the evolving technologies being developed to support CI and examples of web-based systems for CI in specific fields such as environment, cultural heritage, socio-economic development and health.

• Gadelha, B., Cirilo, E., Gerosa, M.A., Castro Jr, A., Fuks H., Lucena, C.J.P. An Approach for Developing Component-based Groupware Product Lines using the Groupware Workbench. The 14th International Software Product Line Conference (SPLC 2010), SPLC 2010. Jeju Island, South Korea, 13 - 17 September 2010.
  • Software technologies for web applications - Model-driven Design and Implementation of Web Applications - G3. Develop methodologies, empirical studies and tools to support the development of software product lines for the Web context
  • In this paper we propose the development of a Collablet product line using the Groupware Workbench. This approach combines the benefits of Software Product Lines and software components providing a systematic way for tailoring customized groupware through the use of Collablets automatically derived from product lines.

• Marina Groshaus and Jayme L. Szwarcfiter, Biclique graphs and biclique matrices, Journal of Graph Theory 63 (2010), pp. 1-16 - doi 10.1002/jgt.20442
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • This paper describes biclique matrices of a graph, in similar terms of the well known clique matrices. This concept is then employed in the characterization of biclique graphs, the intersection graph of the maximal bicliques of a graph.

• Márcia R. Cerioli, Fabiano S. Oliveira and Jayme L. Szwarcfiter, Extreme cliques in interval graphs, Ars Combinatoria 94 (2010) pp. 103-114.
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • Interval graphs and the corresponding interval models are emp´loyed in many different applications. This work characterizes which maximal cliques can appear in the extremes of any interval model.

• Mitre C. Dourado, Fábio Protti, Dieter Rautenbach and Jayme L. Szwarcfiter, On the hull number of triangle-free graphs, SIAM Journal on Discrete Mathematics 23 (2010), PP. 2163-2172 - doi 10.1137/090751797
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • The work describes some different bounds for the computation of the hull number of a graph which contain no triangles. Recall that the computation of the hull number is a NP-complete problem in general.

• Mitre C. Dourado, Fábio Protti, Dieter Rautenbach and Jayme L. Szwarcfiter, Some remarks on the geodetic number of a graph, Discrete Mathematics 320 (2010) pp. 832-837 - doi 10.1016/j.disc.2009.09.018
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • The geodetic number of a graph is closely related to shortest paths and therefore plays a role in finding points with distance constraints in the web graph. This paper describes some properties of the geodetic number of a graph, including efficiente algorithms for special cases, and negative complexity results.

• Edson N. Cáceres, Siang W. Song and Jayme L. Szwarcfiter, Parallel Algorithms for Maximal Cliques in Circle Graphs and Unrestricted Depth Search, RAIRO - Informatique Théorique et Applications -- accepted
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • This papers describes parallel algorithms for generating all the maximal cliques of a circle graph, The method employs an algorithm for performing unrestricted depth-first search in a general graph.

• José Viterbo, Markus Endler, Gustavo Baptista, A Two-tier Approach for Decentralized Reasoning in Ambient Intelligence, IEEE Intelligent Systems, 2010 (accepted)
  • "Software technologies for web applications - A Multi-Agent Systems Approach for Developing Autonomic Web Applications - G1. Design techniques to improve the development of autonomic Web applications
  • Defines a distributed algorithm for cooperative detection of context situations in mobile and ubiquitous computing based on ontologies.

• Felipe Quintella, Luciano Soares, Alberto Raposo, DWeb3D: A toolkit for developing X3D applications in a simplified environment, Web3D International Conference on 3D Web Technology, 2010. Los Angeles, 24-25 July, 2010.
  • Web-based Collaborative Virtual Environments - G1. Investigate the Web as a means for eScience and eLearning through CVEs
  • DWeb3d is a toolkit to help the development of dynamic X3D applications, showing that it is possible to simplify the development process, increasing the access to developers.

• Flávia C. Delicato, Paulo F. Pires, Luci Pirmez, Thais Batista, "Wireless Sensor Networks as a Service," ecbs, pp.410-417, 2010 17th IEEE International Conference and Workshops on the Engineering of Computer-Based Systems, 2010

• Koga, I. K., Medeiros, C. B., Branquinho, O. Handling and Publishing Wireless Sensor Network Data: a hands-on experiment. In IV eScience Workshop 2010, XXX Congresso da SBC (XXX Conference of the Brazilian Computer Society), [ttp://www.dcc.ufrj.br/~escience]. Belo Horizonte, MG, July 2010.
  • Developing the Semantic Web: G2. Definition of a method for the description, discovery and automated composition of semantic Web services
  • Discussion of interoperability issues concerning flexible publication of real time sensor data on the Web, using semantic web standards and web services.

• Mitre C. Dourado, Fábio Protti and Jayme L. Szwarcfiter, Complexity results related to monophonic convexity, Discrete Applied Mathematics 158 (2010), pp. 1268-1274 - doi 10.1016/j.dam.2009.11.016
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • The paper proves various complexity results for the monophonic complexity of graphs. In particular it is shown that the computation of the monophonioc number of a graph is NP-har and, in contrast, there exists a polynomial-time efficient algorithm for finding the hull number, within this convexity.

• Min C. Lin, Francisco Soulignac and Jayme L. Szwarcfiter, The clique operator on circular-arc graphs, Discrete Applied Mathematics 158 (2010) pp. 1259-1267 - doi 10.1016/j.dam.2009.01.019
  • Foundations of Web Science - G1 Define algorithms on graphs and / or negative results for combinatorial optimization
  • The application of the clique operator has been studied before for some classes of graphs. In this article we examine the clique operator applied to circular-arc graphs. We study the clique behaviour of this class and determine when a graph converges or diverges, under the application of such an operator.

• Santos Neto, B.F., Silva, V.T., Lucena, C.J.P. Using Jason to Develop Normative Agents. Brazilian Symposium on Artificial Intelligence (SBIA) , SBIA 2010. São Bernardo do Campo, BR, 23-28 October 2010.
  • Software technologies for web applications - A Multi-Agent Systems Approach for Developing Autonomic Web Applications - G2. Define a framework to support the development of autonomic Web applications.
  • Norms have become one of the most promising mechanisms of social control to ensure a desirable social order in open multi-agent systems where autonomous, heterogeneous and independently designed entities can work towards similar or different ends. This paper proposes an implementation to the Jason platform to build goal-oriented agents that can reason about norms.

• Casanova, M. A., Lauschner, T., Leme, L. A. P. P., Breitman, K. K., Furtado, A. L., Vidal, V. M. P. [[Media: casanova-2010-MCC-06-10.pdf|Revising the Constraints of the Mediated Schema]], Monografias em Ciência da Computação, Departamento de Informática, PUC-Rio, May 2010.
  • Management of Web Data - Accessing the Deep Web - Definition of heuristics for database identification, mediated schema definition and schema matching
  • This paper addresses the problem of changing the constraints of a mediated schema to accommodate the set of constraints of a new export schema.

• Casanova, M. A., Furtado, A. L., Macêdo, J. A. F., Vidal, V. M. P.

[[Media: casanova-2010-MCC-11-10.pdf| Extralite Schemas with Role Hierarchies]], Monografias em Ciência da Computação, Departamento de Informática, PUC-Rio, June 2010.

• • Management of Web Data - Accessing the Deep Web - Definition of heuristics for database identification, mediated schema definition and schema matching
  • This paper addresses the problems of testing strict satisfiability and deciding logical implication for extralite schemas with role hierarchies.

• Leme, L. A. P. P., Casanova, M. A., Breitman, K.K., Furtado, A.L.

[[Media: casanova-2010-jbcs.pdf|OWL Schema Matching]], J. Brazilian Computer Society (2010) 16: 21–34. [http: //www.sbc.org.br/jbcs/ JBCS], DOI: 10.1007/s13173-010-0005-3.

• • Management of Web Data - Accessing the Deep Web - Definition of heuristics for database identification, mediated schema definition and schema matching
  • This paper describes an instance-based schema matching technique for an OWL dialect, proposes a data model for storing provenance data, and presents experimental results with real data downloaded from the Web.

• Sacramento, E.R., Vidal, V. M. P., Macêdo, J. A. F., Lóscio, B.F., Lopes, F. L. R., Lemos, F., Casanova, M. A.

[[Media: casanova-2010-ICEIS.pdf| Towards Automatic Generation of Application Ontologies]], Proc. 12th International Conference on Enterprise Information Systems, ICEIS 2010, Funchal, Madeira, Portugal, 8-12 June, 2010 (poster presentation).

• • Management of Web Data - Accessing the Deep Web - Definition of heuristics for database identification, mediated schema definition and schema matching
  • This paper describes a strategy to automatically generate application ontologies and mappings, from a set of local ontologies, a domain ontology and the result of the matching between each local ontology and the domain ontology.

• Piccinini, H., Casanova, M. A., Cavalieri, M., Furtado, A.L.

[[Media: casanova-2010-secogis.pdf|W-Ray: A Strategy to Publish Deep Web Geographic Data]], accepted to the 4th International Workshop on Semantic and Conceptual Issues in GIS (SeCoGIS), SeCoGIS 2010, in conjunction with the 29th International Conference on Conceptual Modeling (ER 2010), tp://cs.ulb.ac.be/conferences/secogis10/ SeCoGIS 2010], Vancouver, BC, Canada, 1-4 November, 2010.

• • Management of Web Data - Accessing the Deep Web - Definition of heuristics for database identification, mediated schema definition and schema matching
  • This paper introduces an approach to address the problem of accessing data from the Deep Web. The approach relies on describing the data through sentences, and on publishing the sentences as Web pages.

Publication template

Please use the following template when including a publication in the list:

* authors' list  [[Media:filename.pdf|paper title]], [conference link  conference acronym], place, date
** major area - minor area - goal
** paper summary, with at most 35 words