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

Resumo indisponível

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

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

On the simulation of the filling stage of thermoplastic injection molding using the open-source solver openInjMoldSim

NORTE-07-0162-FEDER-000086 and the Minho Advanced Computing Center (MACC) for providing HP

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

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

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

Identifying the centrality levels of futsal players : a network approach

The aim of this study it was verify the differences of prominence levels between tactical positions in futsal (indoor football). For that reason, it was performed an analysis of variance between competitive levels and tactical positions for the centrality metrics computed by using network analysis. Forty-six futsal players from different competitive levels (U12, U14, U16 and Amateurs) it were analysed during three official futsal matches. Results revealed no differences in centrality metrics between competitive levels (p = 1.00; = 0.001; very small effect size) had no significant statistical differences in the centrality metrics. Nevertheless, tactical position (p = 0.001; = 0.593; moderate effect size) had significant main effects on the centrality metrics. Centrality metrics revealed that defenders are the most prominent players in to receive the ball. By the other hand, defenders and wings are the positions with greater centralities in to pass the ball for the teammates.info:eu-repo/semantics/publishedVersio