Abstract: An increasing number of web repositories rely on tag-based metadata to organize and classify their content. The users of these systems freely associate tags to system's resources - e.g., URLs, images, bookmarks. The term folksonomy refers to this collective classification, which emerges from tagging carried by users interacting in web social environments.

We proposed a hybrid entity to fuse ontologies and folksonomies, we call ``folksonomized ontology'', which combines complementary aspects of both. The formal and engineered knowledge of ontologies is fused with the latent semantics of social data.

In this technical report we show the implementation of a crawler to collect data from folksonomic systems on the web. We discuss the API of this systems and the way the data was stored.

Abstract: We present the first verification methods that automatically generate bases of inequality and equality invariants expressed by multivariate formal power series and transcendental functions. We also discuss their convergence over hybrid systems that exhibit non linear models and parameters. We reduce the invariant generation problem to linear algebraic matrix systems, from which one can provide effective methods for solving the original problem. We show that the preconditions for discrete transitions, the Lie-derivatives for continuous evolution and the newly introduced relaxed consecution requirements can be viewed as morphisms and, thus, can be represented by matrices. More specifically, we obtain very general sufficient conditions for the existence and the computation of formal power series invariants over multivariate polynomial continuous differential systems. The formal power series invariant generated are often composed by expansion of some well-known transcendental functions (e.g. , ,... ) and has an analysable closed-form facilitating the use of the invariants to verify safety properties. Our examples with non linear continuous evolution similar to those present today in many critical hybrid embedded systems, show the strength of our results and prove that some of them are beyond the limits of other recent approaches.

Abstract: The integration of WiMAX networks with EPON networks combine the large bandwidth availability in optical access networks with the mobility provided by wireless technologies. In this integration, a WiMAX bandwidth scheduler that takes into account the variability of the channel capacity provided by the EPON scheduler is quite important, since the granted bandwidth must be sucient to support the QoS of WiMAX connections. This paper evaluates the performance of a standard-compliant WiMAX uplink scheduler designed to the ONU-BS. The evaluation is conducted using integrated simulators for the WiMAX and for the EPON components. Simulation results show that the proposed scheduler is able to provide QoS to the subscriber stations.

Abstract: This paper proposes three new hybrid mechanisms for the scheduling of grid tasks, which integrate reactive and proactive approaches. They differ by the scheduler used to define the initial schedule of an application and by the scheduler used to reschedule the application. The mechanisms are compared to reactive and proactive mechanisms. Results show that hybrid approach produces performance close to that of the reactive mechanism, but demanding less migrations.

Abstract: Similar to ballistic tests in which we match a gun to its bullets, we can identify a given digital camera that acquired an image under investigation. In this paper, we introduce a method for identifying whether or not an image was captured by a specific digital camera. The method relies on well-known and established noise residual features related to the images under investigation. The novelty of our approach is in the extension of such features considering an ``open set" recognition scenario, under which we can not rely on the assumption of full access to all of the potential source cameras. In this case, we model the decision space to take advantage of a few known cameras and carve the decision boundaries to decrease false matches increasing the reliability of image source attribution as an aid for digital forensics in the court of law.

Resumo: As moscas-das-frutas são pragas de importância quarentenária a nível mundial, dentre as quais se destacam algumas espécies de Anastrepha, que atacam um grande número de frutíferas e estão amplamente distribuídas pelo Brasil. A identificação das espécies de moscas-das frutas é baseada nos caracteres morfológicos do mesonoto, asa e acúleo. Nos últimos anos, têm sido desenvolvidas ferramentas que complementam a taxonomia tradicional na identificação de algumas espécies de insetos. Além de diminuir o tempo gasto pelos especialistas, essas novas ferramentas podem permitir que um número maior de pesquisadores estude e/ou identifique esses insetos. Sendo assim, o presente estudo tem como objetivo testar a eficácia de novas técnicas para identificação de três espécies de moscas-das-frutas. Neste trabalho, foram aplicadas e comparadas técnicas de análise de imagens e aprendizagem de máquina na tarefa de classificação de moscas-das-frutas, visando obter dados que possam futuramente servir de base para o desenvolvimento de sistemas de identificação automática dessas espécies utilizando imagens de asas e acúleos.

Abstract: Insert here the abstract in English.

Resumen El resumen del relatório en español.

Abstract: Complex systems have been widely investigated using formal techniques for testing and verifying critical aspects of their reactive behavior. Such behavior is usually captured by the notion of context transformations that interact with the environment. Other aspects require timed models to describe the systems' continuous evolution in time. In this work, we propose a timed context formalism able to model the combination of time evolution and context transformations. Further, we derive a more flexible and manageable strategy to discretize such models and prove correctness of the discretized model against the original one. The flexibility to find suitable granularities both to time evolution as well as to values of context variables opens the possibility for constructing more compact grid automata. Based on this discretizing approach we present a testing framework to automatically generate test suites from the resulting automata. The test suites can then be used to verify properties of candidate implementations with the aid of test purposes.

Abstract: Can we quantitatively compare different computer scientists? There is a widespread belief among computer science researchers that different subareas within Computer Science (CS) have different publishing practices (production throughput per year, preference either for journals or conferences, number of citations, etc.) making the use of a unified evaluation criterion unfair. In this paper, we present productivity measures (both journal and conference productivity) and impact measures (citations per paper and H-index) for a random set of researchers in 17 different CS subareas. This research quantifies the mentioned intuitions and pre-empirical impressions and shows that, indeed, there are different publication practices and impact value measures for the different CS subareas. However, we show that few of the differences are significant.

Resumo: Apresentamos neste trabalho critérios gráficos (ou visuais) que dão condições necessárias e suficientes para saber se uma permutação algébrica divide outra permutação. Estes critérios podem originar algoritmos eficientes para decidir divisibilidade entre permutações.

Abstract: Grid scheduling is essential to Quality of Service provisioning as well as to efficient management of grid resources. Grid scheduling usually considers the state of the grid resources as well application demands. However, such demands are generally unknown for highly demanding applications, since these often generate data which will be transferred during their execution. Without appropriate assessment of these demands, scheduling decisions can lead to poor performance. Thus, it is of paramount importance to consider uncertainties in the formulation of a grid scheduling problem. This paper introduces the IPDT-FUZZY scheduler, a scheduler which considers the demands of grid applications with such uncertainties. The scheduler uses fuzzy optimization, and both computational and communication demands are expressed as fuzzy numbers. Its performance was evaluated, and it was shown to be attractive when communication requirements are uncertain. Its efficacy is compared, via simulation, to that of a deterministic counterpart scheduler and the results reinforce its adequacy for dealing with the lack of accuracy in the estimation of communication demands.

Abstract: Imprecise input data imposes additional challenges to grid scheduling. This paper introduces a novel scheduler based on fuzzy optimization called IP-FULL-FUZZY which considers uncertainties of both application demands and of resource availability. The effectiveness of the proposed scheduler is compared to those of a non-fuzzy scheduler as well as to those of a fuzzy scheduler which considers only uncertainties of application demands. Results evince the advantages of adopting the proposed scheduler.

Abstract: The uncertainty of the demands of grid applications can cause unpredicted performance and, consequently, can make ineffective schedules derived for target demand values. To produce effective results, schedulers need to take into account the difficulty in estimating the demands of applications. In this paper, a scheduler based on fuzzy optimization is proposed to deal with such uncertainties. It is shown, via numerical results, that the proposed scheduler presents advantages when compared to classical schedulers.

Abstract: Central to grid processing is the scheduling of application tasks to resources. Schedulers need to consider heterogeneous computational and communication resources, producing the shortest possible schedule under time constraints dictated by both the application needs and the frequency of fluctuation of resource availability. This paper introduces a set of schedulers with such characteristics.

Abstract: This paper introduces a procedure called Traffic Engineering for grids for enabling grid networks to self-adjust to resource availability. The proposal is based on monitoring the state of resources and on task migration. It involves several layers of the Internet architecture. Experiments executed in NS-2 are used to illustrate the efficacy of the procedure proposed.

Abstract: Grid systems allow the execution of a class of highly demanding services and applications. These grids involve communication networks, and their links are essential resources for massive data transfers. However, the management of current grid systems requires intervention for efficient service provisioning. Moreover, this need increases with the increase in demand for grid services. Therefore, grid systems will become effective only when they are capable of self-managing resource allocation to cope with fluctuations in resource availability. At present, however, very few integrated self-adaptive mechanisms have been implemented in existing grid systems. The aim of this paper is to provide a survey of existing mechanisms and suggest directions for enabling autonomic operation of grid systems.