Tensile creep of a structural epoxy adhesive: experimental and analytical characterization

Epoxy adhesives are nowadays being extensively used in Civil Engineering applications, mostly in the scope of the rehabilitation of reinforced concrete (RC) structures. In this context, epoxy adhesives are used to provide adequate stress transference from fibre reinforced polymers (FRP) to the surrounding concrete substrate. Most recently, the possibility of using prestressed FRPs bonded with these epoxy adhesives is also being explored in order to maximize the potentialities of this strengthening approach. In this context, the understanding of the long term behaviour of the involved materials becomes essential. Even when non-prestressed FRPs are used a certain amount of stress is permanently applied on the adhesive interface during the serviceability conditions of the strengthened structure, and the creep of the adhesive may cause a continuous variation in the deformational response of the element. In this context, this paper presents a study aiming to experimentally characterize the tensile creep behaviour of an epoxy-based adhesive currently used in the strengthening of concrete structures with carbon FRP (CFRP) systems. To analytically describe the tensile creep behaviour, the modified Burgers model was fitted to the experimental creep curves, and the obtained results revealed that this model is capable of predicting with very good accuracy the long term behaviour of this material up to a sustained stress level of 60% of the adhesive’s tensile strength.

Comparison of single and multi-objective evolutionary algorithms for robust link-state routing

Traffic Engineering (TE) approaches are increasingly impor- tant in network management to allow an optimized configuration and resource allocation. In link-state routing, the task of setting appropriate weights to the links is both an important and a challenging optimization task. A number of different approaches has been put forward towards this aim, including the successful use of Evolutionary Algorithms (EAs). In this context, this work addresses the evaluation of three distinct EAs, a single and two multi-objective EAs, in two tasks related to weight setting optimization towards optimal intra-domain routing, knowing the network topology and aggregated traffic demands and seeking to mini- mize network congestion. In both tasks, the optimization considers sce- narios where there is a dynamic alteration in the state of the system, in the first considering changes in the traffic demand matrices and in the latter considering the possibility of link failures. The methods will, thus, need to simultaneously optimize for both conditions, the normal and the altered one, following a preventive TE approach towards robust configurations. Since this can be formulated as a bi-objective function, the use of multi-objective EAs, such as SPEA2 and NSGA-II, came nat- urally, being those compared to a single-objective EA. The results show a remarkable behavior of NSGA-II in all proposed tasks scaling well for harder instances, and thus presenting itself as the most promising option for TE in these scenarios.

An immunity based configuration for multilayer single featured biometric authentication algorithms

Immune systems have been used in the last years to inspire approaches for several computational problems. This paper focus on behavioural biometric authentication algorithms’ accuracy enhancement by using them more than once and with different thresholds in order to first simulate the protection provided by the skin and then look for known outside entities, like lymphocytes do. The paper describes the principles that support the application of this approach to Keystroke Dynamics, an authentication biometric technology that decides on the legitimacy of a user based on his typing pattern captured on he enters the username and/or the password and, as a proof of concept, the accuracy levels of one keystroke dynamics algorithm when applied to five legitimate users of a system both in the traditional and in the immune inspired approaches are calculated and the obtained results are compared.

Analytical and numerical study of the electro-osmotic annular flow of viscoelastic fluids

In this work we present semi-analytical solutions for the electro-osmotic annular flow of viscoelastic fluids modeled by the Linear and Exponential PTT models. The viscoelastic fluid flows in the axial direction between two concentric cylinders under the combined influences of electrokinetic and pressure forcings. The analysis invokes the Debye-Hückel approximation and includes the limit case of pure electro-osmotic flow. The solution is valid for both no slip and slip velocity at the walls and the chosen slip boundary condition is the linear Navier slip velocity model. The combined effects of fluid rheology, electro-osmotic and pressure gradient forcings on the fluid velocity distribution are also discussed.

Annular flow of viscoelastic fluids: Analytical and numerical solutions

This work provides analytical and numerical solutions for the linear, quadratic and exponential Phan–Thien–Tanner (PTT) viscoelastic models, for axial and helical annular fully-developed flows under no slip and slip boundary conditions, the latter given by the linear and nonlinear Navier slip laws. The rheology of the three PTT model functions is discussed together with the influence of the slip velocity upon the flow velocity and stress fields. For the linear PTT model, full analytical solutions for the inverse problem (unknown velocity) are devised for the linear Navier slip law and two different slip exponents. For the linear PTT model with other values of the slip exponent and for the quadratic PTT model, the polynomial equation for the radial location (β) of the null shear stress must be solved numerically. For both models, the solution of the direct problem is given by an iterative procedure involving three nonlinear equations, one for β, other for the pressure gradient and another for the torque per unit length. For the exponential PTT model we devise a numerical procedure that can easily compute the numerical solution of the pure axial flow problem

Algorithms and tools for in silico design of cell factories

PhD thesis in Bioengineering

Combining analytical methodologies for the identification of Aspergillus section Flavi strains isolated from Brazilian agricultural commodities

The use of chemical analysis of microbial components, including proteins, became an important achievement in the 80’s of the last century to the microbial identification. This led a more objective microbial identification scheme, called chemotaxonomy, and the analytical tools used in the field are mainly 1D/2D gel electrophoresis, spectrophotometry, high-performance liquid chromatography, gas chromatography, and combined gas chromatography-mass spectrometry. The Edman degradation reaction was also applied to peptides sequence giving important insights to the microbial identification. The rapid development of these techniques, in association with knowledge generated by DNA sequencing and phylogeny based on rRNA gene and housekeeping genes sequences, boosted the microbial identification to an unparalleled scale. The recent results of mass spectrometry (MS), like Matrix-Assisted Laser Desorption/Ionisation Time-of-Flight (MALDI-TOF), for rapid and reliable microbial identification showed considerable promise. In addition, the technique is rapid, reliable and inexpensive in terms of labour and consumables when compared with other biological techniques. At present, MALDI-TOF MS adds an additional step for polyphasic identification which is essential when there is a paucity of characters or high DNA homologies for delimiting very close related species. The full impact of this approach is now being appreciated when more diverse species are studied in detail and successfully identified. However, even with the best polyphasic system, identification of some taxa remains time-consuming and determining what represents a species remains subjective. The possibilities opened with new and even more robust mass spectrometers combined with sound and reliable databases allow not only the microbial identification based on the proteome fingerprinting but also include de novo specific proteins sequencing as additional step. These approaches are pushing the boundaries in the microbial identification field.

Seismic retrofit of masonry-to-timber connections in historical constructions

Tese de Doutoramento em Engenharia Civil.

Testing Nelder-Mead based repulsion algorithms for multiple roots of nonlinear systems via a two-level factorial design of experiments

This paper addresses the challenging task of computing multiple roots of a system of nonlinear equations. A repulsion algorithm that invokes the Nelder-Mead (N-M) local search method and uses a penalty-type merit function based on the error function, known as 'erf', is presented. In the N-M algorithm context, different strategies are proposed to enhance the quality of the solutions and improve the overall efficiency. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm. The main goal of this paper is to use a two-level factorial design of experiments to analyze the statistical significance of the observed differences in selected performance criteria produced when testing different strategies in the N-M based repulsion algorithm.

Bootstrap performance profiles in stochastic algorithms assessment

Optimization with stochastic algorithms has become a relevant research field. Due to its stochastic nature, its assessment is not straightforward and involves integrating accuracy and precision. Performance profiles for the mean do not show the trade-off between accuracy and precision, and parametric stochastic profiles require strong distributional assumptions and are limited to the mean performance for a large number of runs. In this work, bootstrap performance profiles are used to compare stochastic algorithms for different statistics. This technique allows the estimation of the sampling distribution of almost any statistic even with small samples. Multiple comparison profiles are presented for more than two algorithms. The advantages and drawbacks of each assessment methodology are discussed.

Metabolic profiling and classification of propolis samples from Southern Brazil: an NMR-based platform coupled with machine learning

The chemical composition of propolis is affected by environmental factors and harvest season, making it difficult to standardize its extracts for medicinal usage. By detecting a typical chemical profile associated with propolis from a specific production region or season, certain types of propolis may be used to obtain a specific pharmacological activity. In this study, propolis from three agroecological regions (plain, plateau, and highlands) from southern Brazil, collected over the four seasons of 2010, were investigated through a novel NMR-based metabolomics data analysis workflow. Chemometrics and machine learning algorithms (PLS-DA and RF), including methods to estimate variable importance in classification, were used in this study. The machine learning and feature selection methods permitted construction of models for propolis sample classification with high accuracy (>75%, reaching 90% in the best case), better discriminating samples regarding their collection seasons comparatively to the harvest regions. PLS-DA and RF allowed the identification of biomarkers for sample discrimination, expanding the set of discriminating features and adding relevant information for the identification of the class-determining metabolites. The NMR-based metabolomics analytical platform, coupled to bioinformatic tools, allowed characterization and classification of Brazilian propolis samples regarding the metabolite signature of important compounds, i.e., chemical fingerprint, harvest seasons, and production regions.

Comparação dosimétrica de dois sistemas de planeamento de tratamento em radioterapia conformacional 3D

Dissertação de mestrado em Biofísica e Bionanossistemas

Algorithms and computational tools for metabolic flux analysis

PhD thesis in Biomedical Engineering

A survey of distributed data aggregation algorithms

Distributed data aggregation is an important task, allowing the de- centralized determination of meaningful global properties, that can then be used to direct the execution of other applications. The resulting val- ues result from the distributed computation of functions like count, sum and average. Some application examples can found to determine the network size, total storage capacity, average load, majorities and many others. In the last decade, many di erent approaches have been pro- posed, with di erent trade-o s in terms of accuracy, reliability, message and time complexity. Due to the considerable amount and variety of ag- gregation algorithms, it can be di cult and time consuming to determine which techniques will be more appropriate to use in speci c settings, jus- tifying the existence of a survey to aid in this task. This work reviews the state of the art on distributed data aggregation algorithms, providing three main contributions. First, it formally de nes the concept of aggrega- tion, characterizing the di erent types of aggregation functions. Second, it succinctly describes the main aggregation techniques, organizing them in a taxonomy. Finally, it provides some guidelines toward the selection and use of the most relevant techniques, summarizing their principal characteristics.

Green's relations, regularity and abundancy for semigroups of quasi-onto transformations

Let V be an infinite-dimensional vector space and for every infinite cardinal n such that n≤dimV, let AE(V,n) denote the semigroup of all linear transformations of V whose defect is less than n. In 2009, Mendes-Gonçalves and Sullivan studied the ideal structure of AE(V,n). Here, we consider a similarly-defined semigroup AE(X,q) of transformations defined on an infinite set X. Quite surprisingly, the results obtained for sets differ substantially from the results obtained in the linear setting.