Avaliação de operadoras de saúde por usuários pelo método Analytic Hierarchy Process

OBJETIVO: Analisar a qualidade dos serviços oferecidos por empresas operadoras de planos de saúde, segundo a percepção de usuários. MÉTODOS: Estudo transversal com 360 usuários de sete operadoras de planos de saúde da cidade de Curitiba, PR, e região metropolitana em 2008. Foi aplicado questionário sobre as preferências dos usuários em relação a seis atributos (localização dos pontos de atendimento; efetividade da ação dos médicos, clínicas e hospitais; rapidez e amabilidade no atendimento; facilidade na liberação de guias; preço; abrangência da rede credenciada) de cada uma das empresas operadoras. Para a análise das respostas foi utilizado o método Analytic Hierarchy Process (AHP, ou Processo Analítico de Hierarquia), ferramenta de análise de decisão e planejamento de múltiplos critérios. RESULTADOS: O atributo mais valorizado pelos usuários foi "preço". As empresas foram agrupadas em dois conjuntos de preferências em relação aos atributos: dos sete planos de saúde, dois apresentaram menor preferência (entre 23% e 19%) e cinco, maior preferência (em torno de 10%). CONCLUSÕES: Com esse tipo de pesquisa, as empresas operadoras de planos de saúde poderiam reformular suas estruturas, processos, preços e redes credenciadas com o objetivo de melhorar seu posicionamento no mercado.

Evaluating P-NET message's response time with fixed priority queuing at application process level

P-NET is a multi-master fieldbus standard based on a virtual token passing scheme. In P-NET each master is allowed to transmit only one message per token visit. In the worst-case, the communication response time can be derived considering that, in each token cycle, all stations use the token to transmit a message. In this paper, we define a more sophisticated P-NET model, which considers the actual token utilisation. We then analyse the possibility of implementing a local priority-based scheduling policy to improve the real-time behaviour of P-NET.

Concurrent tabling

In the past few years Tabling has emerged as a powerful logic programming model. The integration of concurrent features into the implementation of Tabling systems is demanded by need to use recently developed tabling applications within distributed systems, where a process has to respond concurrently to several requests. The support for sharing of tables among the concurrent threads of a Tabling process is a desirable feature, to allow one of Tabling’s virtues, the re-use of computations by other threads and to allow efficient usage of available memory. However, the incremental completion of tables which are evaluated concurrently is not a trivial problem. In this dissertation we describe the integration of concurrency mechanisms, by the way of multi-threading, in a state of the art Tabling and Prolog system, XSB. We begin by reviewing the main concepts for a formal description of tabled computations, called SLG resolution and for the implementation of Tabling under the SLG-WAM, the abstract machine supported by XSB. We describe the different scheduling strategies provided by XSB and introduce some new properties of local scheduling, a scheduling strategy for SLG resolution. We proceed to describe our implementation work by describing the process of integrating multi-threading in a Prolog system supporting Tabling, without addressing the problem of shared tables. We describe the trade-offs and implementation decisions involved. We then describe an optimistic algorithm for the concurrent sharing of completed tables, Shared Completed Tables, which allows the sharing of tables without incurring in deadlocks, under local scheduling. This method relies on the execution properties of local scheduling and includes full support for negation. We provide a theoretical framework and discuss the implementation’s correctness and complexity. After that, we describe amethod for the sharing of tables among threads that allows parallelism in the computation of inter-dependent subgoals, which we name Concurrent Completion. We informally argue for the correctness of Concurrent Completion. We give detailed performance measurements of the multi-threaded XSB systems over a variety of machines and operating systems, for both the Shared Completed Tables and the Concurrent Completion implementations. We focus our measurements inthe overhead over the sequential engine and the scalability of the system. We finish with a comparison of XSB with other multi-threaded Prolog systems and we compare our approach to concurrent tabling with parallel and distributed methods for the evaluation of tabling. Finally, we identify future research directions.

Mining protein structure data

The principal topic of this work is the application of data mining techniques, in particular of machine learning, to the discovery of knowledge in a protein database. In the first chapter a general background is presented. Namely, in section 1.1 we overview the methodology of a Data Mining project and its main algorithms. In section 1.2 an introduction to the proteins and its supporting file formats is outlined. This chapter is concluded with section 1.3 which defines that main problem we pretend to address with this work: determine if an amino acid is exposed or buried in a protein, in a discrete way (i.e.: not continuous), for five exposition levels: 2%, 10%, 20%, 25% and 30%. In the second chapter, following closely the CRISP-DM methodology, whole the process of construction the database that supported this work is presented. Namely, it is described the process of loading data from the Protein Data Bank, DSSP and SCOP. Then an initial data exploration is performed and a simple prediction model (baseline) of the relative solvent accessibility of an amino acid is introduced. It is also introduced the Data Mining Table Creator, a program developed to produce the data mining tables required for this problem. In the third chapter the results obtained are analyzed with statistical significance tests. Initially the several used classifiers (Neural Networks, C5.0, CART and Chaid) are compared and it is concluded that C5.0 is the most suitable for the problem at stake. It is also compared the influence of parameters like the amino acid information level, the amino acid window size and the SCOP class type in the accuracy of the predictive models. The fourth chapter starts with a brief revision of the literature about amino acid relative solvent accessibility. Then, we overview the main results achieved and finally discuss about possible future work. The fifth and last chapter consists of appendices. Appendix A has the schema of the database that supported this thesis. Appendix B has a set of tables with additional information. Appendix C describes the software provided in the DVD accompanying this thesis that allows the reconstruction of the present work.

Specification of software architecture reconfiguration

In the past years, Software Architecture has attracted increased attention by academia and industry as the unifying concept to structure the design of complex systems. One particular research area deals with the possibility of reconfiguring architectures to adapt the systems they describe to new requirements. Reconfiguration amounts to adding and removing components and connections, and may have to occur without stopping the execution of the system being reconfigured. This work contributes to the formal description of such a process. Taking as a premise that a single formalism hardly ever satisfies all requirements in every situation, we present three approaches, each one with its own assumptions about the systems it can be applied to and with different advantages and disadvantages. Each approach is based on work of other researchers and has the aesthetic concern of changing as little as possible the original formalism, keeping its spirit. The first approach shows how a given reconfiguration can be specified in the same manner as the system it is applied to and in a way to be efficiently executed. The second approach explores the Chemical Abstract Machine, a formalism for rewriting multisets of terms, to describe architectures, computations, and reconfigurations in a uniform way. The last approach uses a UNITY-like parallel programming design language to describe computations, represents architectures by diagrams in the sense of Category Theory, and specifies reconfigurations by graph transformation rules.

Foresight methodologies to understand changes in the labour process. Experience from Portugal

The foresight and scenario building methods can be an interesting reference for social sciences, especially in terms of innovative methods for labour process analysis. A scenario – as a central concept for the prospective analysis – can be considered as a rich and detailed portrait of a plausible future world. It can be a useful tool for policy-makers to grasp problems clearly and comprehensively, and to better pinpoint challenges as well as opportunities in an overall framework. The features of the foresight methods are being used in some labour policy making experiences. Case studies developed in Portugal will be presented, and some conclusions will be drawn in order to organise a set of principles for foresight analysis applied to the European project WORKS on the work organisation re-structuring in the knowledge society, and on the work design methods for new management structures of virtual organisations.

Application of FTA and the perceived impact on employment policies: the case of nanotechnology in the Netherlands, Germany and Portugal

In this paper we will analyse the usage of FTA to support decision-making in employment policy relate to specific occupational groups. The examples can be better understood if one focus on the nanotechnology and its implications on some sectors (clothing, bio-medical engineering, micro-electronics). When this is done will be clear which occupations will engage a restructuring process (engineers, specialised technicians, qualified machine operators, quality controllers) and what policies are being designed to cope with it. This means toward which extend social partners have driven specific policies on these issues (focused in their sectors).

Performance of concrete made with aggregates recycled from precasting industry waste: influence of the crushing process

The aim of this paper is to evaluate the influence of the crushing process used to obtain recycled concrete aggregates on the performance of concrete made with those aggregates. Two crushing methods were considered: primary crushing, using a jaw crusher, and primary plus secondary crushing (PSC), using a jaw crusher followed by a hammer mill. Besides natural aggregates (NA), these two processes were also used to crush three types of concrete made in laboratory (L20, L45 e L65) and three more others from the precast industry (P20, P45 e P65). The coarse natural aggregates were totally replaced by coarse recycled concrete aggregates. The recycled aggregates concrete mixes were compared with reference concrete mixes made using only NA, and the following properties related to the mechanical and durability performance were tested: compressive strength; splitting tensile strength; modulus of elasticity; carbonation resistance; chloride penetration resistance; water absorption by capillarity; water absorption by immersion; and shrinkage. The results show that the PSC process leads to better performances, especially in the durability properties. © 2014 RILEM

A web-based platform for biosignal visualization and annotation

With the advent of wearable sensing and mobile technologies, biosignals have seen an increasingly growing number of application areas, leading to the collection of large volumes of data. One of the difficulties in dealing with these data sets, and in the development of automated machine learning systems which use them as input, is the lack of reliable ground truth information. In this paper we present a new web-based platform for visualization, retrieval and annotation of biosignals by non-technical users, aimed at improving the process of ground truth collection for biomedical applications. Moreover, a novel extendable and scalable data representation model and persistency framework is presented. The results of the experimental evaluation with possible users has further confirmed the potential of the presented framework.

A complex protocol layer as a linux user-space process

With the current complexity of communication protocols, implementing its layers totally in the kernel of the operating system is too cumbersome, and it does not allow use of the capabilities only available in user space processes. However, building protocols as user space processes must not impair the responsiveness of the communication. Therefore, in this paper we present a layer of a communication protocol, which, due to its complexity, was implemented in a user space process. Lower layers of the protocol are, for responsiveness issues, implemented in the kernel. This protocol was developed to support large-scale power-line communication (PLC) with timing requirements.

Comparative study about heating systems for pultrusion process

Different heating systems have been used in pultrusion, where the most widely used heaters are planar resistances. The primary objective of this study was to develop an improved heating system and compare its performance with that of a system with planar resistances. In this study, thermography was used to better understand the temperature profile along the die. Finite element analysis was performed to determine the amount of energy consumed by the heating systems. Improvements were made to the die to test the new heating system, and it was found that the new system reduced the setup time and energy consumption by approximately 57%.

Overcoming the objectification of western classical music with the concept of music as a process

Dissertation to obtain the degree of Master in Music - Artistic Interpretation

Optimal location of the workpiece in a PKM-based machining robotic cell

Most machining tasks require high accuracy and are carried out by dedicated machine-tools. On the other hand, traditional robots are flexible and easy to program, but they are rather inaccurate for certain tasks. Parallel kinematic robots could combine the accuracy and flexibility that are usually needed in machining operations. Achieving this goal requires proper design of the parallel robot. In this chapter, a multi-objective particle swarm optimization algorithm is used to optimize the structure of a parallel robot according to specific criteria. Afterwards, for a chosen optimal structure, the best location of the workpiece with respect to the robot, in a machining robotic cell, is analyzed based on the power consumed by the manipulator during the machining process.

Parallel texts alignment

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

Drilling process of composite laminates – a tool based analysis

“Drilling of polymeric matrix composites structures”