4,247 research outputs found

    The potential of OXONE as an alternative disinfectant to control drinking water biofilms

    Get PDF
    UIDB/04469/2020, LA/P/0045/2020 (ALiCE), UIDB/00511/2020 and UIDP/00511/2020 (LEPABE), funded by national funds through FCT/MCTES (PIDDAC); Project Biocide_for_Biofilm - PTDC/BII-BTI/30219/2017 - POCI-01-0145-FEDER-030219, funded by FEDER funds through COMPETE2020 – Programa Operacional Competitividade e Internacionalização (POCI) and by national funds (PIDDAC) through FCT/MCTES; and FCT PhD grant awarded to Isabel Maria Oliveira (SFRH/BD/ 138117/2018).info:eu-repo/semantics/publishedVersio

    Cícero e Ovídio: o poder da uxor em contexto de exílio

    Get PDF
    Resumo indisponível

    Algorithm of dynamic programming for optimization of the global matching between two contours defined by ordered points

    Get PDF
    This paper presents a new assignment algorithm with order restriction. Our optimization algorithm was developed using dynamic programming. It was implemented and tested to determine the best global matching that preserves the order of the points that define two contours to be matched. In the experimental tests done, we used the affinity matrix obtained via the method proposed by Shapiro, based on geometric modeling and modal matching. \newline The proposed algorithm revealed an optimum performance, when compared with classic assignment algorithms: Hungarian Method, Simplex for Flow Problems and LAPm. Indeed, the quality of the matching improved when compared with these three algorithms, due to the disappearance of crossed matching, which is allowed by the conventional assignment algorithms. Moreover, the computational cost of this algorithm is much lower than the ones of other three, leading to enhanced execution times

    Optimization of the global matching between two contours defined by ordered points using an algorithm based on dynamic programming

    Get PDF
    This paper presents a new assignment algorithm with order restriction, developed using the paradigm of dynamic programming. The algorithm was implemented and tested to determine the best global matching between two sets of points that represent the contours to be matched. In the experimental tests done, we used the affinity matrix obtained via the method proposed by Shapiro based on geometric modeling and modal matching.The proposed algorithm revealed an optimum performance, when compared with the classic assignment algorithms considered in this work: Hungarian method, Simplex for Flow Problems and LAPm. Indeed, the quality of the matching improved when compared with these three algorithms, because the crossed matching, allowed by the conventional assignment algorithms, disappeared. Besides, the computational cost of our algorithm is very low in comparison with the other three, resulting in lesser execution times

    Cleavages of photochromic compounds derived from heterocycles under electrospray tandem mass spectrometry : study of the influence of the heteroatom in fragmentation mechanisms

    Get PDF
    In this paper we report the fragmentation pathways of chromenes derived from carbazole, dibenzofuran and dibenzothiophene, under ESI-MS/MS experimental conditions, and their relationship with structural features, specially focused on the heteroatom’s effect on the fragmentation mechanisms.Fundação para a Ciência e Tecnologia (FCT

    Book of abstracts: ISTAR-IUL Winter School 2018 Applied Transdisciplinary Research

    Get PDF
    corecore