Autonomic Activities in the Execution of Scientific Workflows: Evaluation of the AWARD Framework

Workflows have been successfully applied to express the decomposition of complex scientific applications. However the existing tools still lack adequate support to important aspects namely, decoupling the enactment engine from tasks specification, decentralizing the control of workflow activities allowing their tasks to run in distributed infrastructures, and supporting dynamic workflow reconfigurations. We present the AWARD (Autonomic Workflow Activities Reconfigurable and Dynamic) model of computation, based on Process Networks, where the workflow activities (AWA) are autonomic processes with independent control that can run in parallel on distributed infrastructures. Each AWA executes a task developed as a Java class with a generic interface allowing end-users to code their applications without low-level details. The data-driven coordination of AWA interactions is based on a shared tuple space that also enables dynamic workflow reconfiguration. For evaluation we describe experimental results of AWARD workflow executions in several application scenarios, mapped to the Amazon (Elastic Computing EC2) Cloud.

Preventable exposure in routine chest CT examinations: evaluation of effective dose beyond prescribed anatomical landmarks

Objective - Evaluate preventable exposure dose in routine chest CT examinations beyond prescribed anatomical landmarks and estimate extra dose delivered to the patient. Background/rationale - Recent technical advances have greatly increased the clinical applications of CT; developments in multidetector-row CT (MDCT) technology have occurred; the major disadvantage with the increased use of MDCT is associated radiation exposure.

Evaluation of lung function abnormalities prevalence in poultry workers

Introduction - Poultry workers can be at an increased risk of occupational respiratory diseases, like asthma, chronic obstructive pulmonary disease and extrinsic allergic alveolitis. Spirometry screening is fundamental to early diagnosis trough the identification of related ventilatory defects. Purpose - We aimed to assess the prevalence of lung function abnormalities in poultry workers.

Validação do questionário 'Prosthesis Evaluation Questionnaire - PEQ'

Mestrado em Gestão e Avaliação de Tecnologias em Saúde

Probabilistic consensus clustering using evidence accumulation

Clustering ensemble methods produce a consensus partition of a set of data points by combining the results of a collection of base clustering algorithms. In the evidence accumulation clustering (EAC) paradigm, the clustering ensemble is transformed into a pairwise co-association matrix, thus avoiding the label correspondence problem, which is intrinsic to other clustering ensemble schemes. In this paper, we propose a consensus clustering approach based on the EAC paradigm, which is not limited to crisp partitions and fully exploits the nature of the co-association matrix. Our solution determines probabilistic assignments of data points to clusters by minimizing a Bregman divergence between the observed co-association frequencies and the corresponding co-occurrence probabilities expressed as functions of the unknown assignments. We additionally propose an optimization algorithm to find a solution under any double-convex Bregman divergence. Experiments on both synthetic and real benchmark data show the effectiveness of the proposed approach.

Enhancing the selection of a model-based clustering with external categorical variables

In cluster analysis, it can be useful to interpret the partition built from the data in the light of external categorical variables which are not directly involved to cluster the data. An approach is proposed in the model-based clustering context to select a number of clusters which both fits the data well and takes advantage of the potential illustrative ability of the external variables. This approach makes use of the integrated joint likelihood of the data and the partitions at hand, namely the model-based partition and the partitions associated to the external variables. It is noteworthy that each mixture model is fitted by the maximum likelihood methodology to the data, excluding the external variables which are used to select a relevant mixture model only. Numerical experiments illustrate the promising behaviour of the derived criterion.

Robot visual localization through local feature fusion: an evaluation of multiple classifiers combination approaches

In the last decade, local image features have been widely used in robot visual localization. In order to assess image similarity, a strategy exploiting these features compares raw descriptors extracted from the current image with those in the models of places. This paper addresses the ensuing step in this process, where a combining function must be used to aggregate results and assign each place a score. Casting the problem in the multiple classifier systems framework, in this paper we compare several candidate combiners with respect to their performance in the visual localization task. For this evaluation, we selected the most popular methods in the class of non-trained combiners, namely the sum rule and product rule. A deeper insight into the potential of these combiners is provided through a discriminativity analysis involving the algebraic rules and two extensions of these methods: the threshold, as well as the weighted modifications. In addition, a voting method, previously used in robot visual localization, is assessed. Furthermore, we address the process of constructing a model of the environment by describing how the model granularity impacts upon performance. All combiners are tested on a visual localization task, carried out on a public dataset. It is experimentally demonstrated that the sum rule extensions globally achieve the best performance, confirming the general agreement on the robustness of this rule in other classification problems. The voting method, whilst competitive with the product rule in its standard form, is shown to be outperformed by its modified versions.

Pozzolanic activity of oil-refining catalyst: evaluation by electron and atomic microscopy

The reuse of waste fluid catalytic cracking (FCC) catalyst as partial surrogate for cement can reduce the environmental impact of both the oil-refinery and cement production industries [1,2]. FCC catalysts can be considered as pozzolanic materials since in the presence of water they tend to chemically react with calcium hydroxide to produce compounds possessing cementitious properties [3,4]. In addition, partial replacement of cement with FCC catalysts can enhance the performance of pastes and mortars, namely by improving their compressive strength [5,6]. In the present work the reaction of waste FCC catalyst with Ca(OH)2 has been investigated after a curing time of 28 days by scanning electron microscopy (SEM) with electron backscattered signal (BSE) combined with X-ray energy dispersive spectroscopy (EDS) carried out with a JEOL JSM 7001F instrument operated at 15 kV coupled to an INCA pentaFetx3 Oxford spectrometer. The polished cross-sections of FCC particles embedded in resin have also been evaluated by atomic force microscopy (AFM) in contact mode (CM) using a NanoSurf EasyScan 2 instrument. The SEM/EDS results revealed that an inward migration of Ca occurred during the reaction. A weaker outward migration of Si and Al was also apparent (Fig. 1). The migration of Ca was not homogeneous and tended to follow high-diffusivity paths within the porous waste FCC catalyst particles. The present study suggests that the porosity of waste FCC catalysts is key for the migration/reaction of Ca from the surrounding matrix, playing an important role in the pozzolanic activity of the system. The topography images and surface roughness parameters obtained by atomic force microscopy can be used to infer the local porosity in waste FCC catalyst particles (Fig. 2).

A MAP approach to evidence accumulation clustering

The Evidence Accumulation Clustering (EAC) paradigm is a clustering ensemble method which derives a consensus partition from a collection of base clusterings obtained using different algorithms. It collects from the partitions in the ensemble a set of pairwise observations about the co-occurrence of objects in a same cluster and it uses these co-occurrence statistics to derive a similarity matrix, referred to as co-association matrix. The Probabilistic Evidence Accumulation for Clustering Ensembles (PEACE) algorithm is a principled approach for the extraction of a consensus clustering from the observations encoded in the co-association matrix based on a probabilistic model for the co-association matrix parameterized by the unknown assignments of objects to clusters. In this paper we extend the PEACE algorithm by deriving a consensus solution according to a MAP approach with Dirichlet priors defined for the unknown probabilistic cluster assignments. In particular, we study the positive regularization effect of Dirichlet priors on the final consensus solution with both synthetic and real benchmark data.