New Optimization Algorithms for Structural Reliability Analysis

Solution of structural reliability problems by the First Order method require optimization algorithms to find the smallest distance between a limit state function and the origin of standard Gaussian space. The Hassofer-Lind-Rackwitz-Fiessler (HLRF) algorithm, developed specifically for this purpose, has been shown to be efficient but not robust, as it fails to converge for a significant number of problems. On the other hand, recent developments in general (augmented Lagrangian) optimization techniques have not been tested in aplication to structural reliability problems. In the present article, three new optimization algorithms for structural reliability analysis are presented. One algorithm is based on the HLRF, but uses a new differentiable merit function with Wolfe conditions to select step length in linear search. It is shown in the article that, under certain assumptions, the proposed algorithm generates a sequence that converges to the local minimizer of the problem. Two new augmented Lagrangian methods are also presented, which use quadratic penalties to solve nonlinear problems with equality constraints. Performance and robustness of the new algorithms is compared to the classic augmented Lagrangian method, to HLRF and to the improved HLRF (iHLRF) algorithms, in the solution of 25 benchmark problems from the literature. The new proposed HLRF algorithm is shown to be more robust than HLRF or iHLRF, and as efficient as the iHLRF algorithm. The two augmented Lagrangian methods proposed herein are shown to be more robust and more efficient than the classical augmented Lagrangian method.

A practical approach for outdoors distributed target localization in wireless sensor networks

Wireless sensor networks are posed as the new communication paradigm where the use of small, low-complexity, and low-power devices is preferred over costly centralized systems. The spectra of potential applications of sensor networks is very wide, ranging from monitoring, surveillance, and localization, among others. Localization is a key application in sensor networks and the use of simple, efficient, and distributed algorithms is of paramount practical importance. Combining convex optimization tools with consensus algorithms we propose a distributed localization algorithm for scenarios where received signal strength indicator readings are used. We approach the localization problem by formulating an alternative problem that uses distance estimates locally computed at each node. The formulated problem is solved by a relaxed version using semidefinite relaxation technique. Conditions under which the relaxed problem yields to the same solution as the original problem are given and a distributed consensusbased implementation of the algorithm is proposed based on an augmented Lagrangian approach and primaldual decomposition methods. Although suboptimal, the proposed approach is very suitable for its implementation in real sensor networks, i.e., it is scalable, robust against node failures and requires only local communication among neighboring nodes. Simulation results show that running an additional local search around the found solution can yield performance close to the maximum likelihood estimate.

Desenvolvimento da célula base de microestruturas periódicas de compósitos sob otimização topológica

This thesis develops a new technique for composite microstructures projects by the Topology Optimization process, in order to maximize rigidity, making use of Deformation Energy Method and using a refining scheme h-adaptative to obtain a better defining the topological contours of the microstructure. This is done by distributing materials optimally in a region of pre-established project named as Cell Base. In this paper, the Finite Element Method is used to describe the field and for government equation solution. The mesh is refined iteratively refining so that the Finite Element Mesh is made on all the elements which represent solid materials, and all empty elements containing at least one node in a solid material region. The Finite Element Method chosen for the model is the linear triangular three nodes. As for the resolution of the nonlinear programming problem with constraints we were used Augmented Lagrangian method, and a minimization algorithm based on the direction of the Quasi-Newton type and Armijo-Wolfe conditions assisting in the lowering process. The Cell Base that represents the composite is found from the equivalence between a fictional material and a preescribe material, distributed optimally in the project area. The use of the strain energy method is justified for providing a lower computational cost due to a simpler formulation than traditional homogenization method. The results are presented prescription with change, in displacement with change, in volume restriction and from various initial values of relative densities.

Development of new scenario decomposition techniques for linear and nonlinear stochastic programming

Une approche classique pour traiter les problèmes d’optimisation avec incertitude à deux- et multi-étapes est d’utiliser l’analyse par scénario. Pour ce faire, l’incertitude de certaines données du problème est modélisée par vecteurs aléatoires avec des supports finis spécifiques aux étapes. Chacune de ces réalisations représente un scénario. En utilisant des scénarios, il est possible d’étudier des versions plus simples (sous-problèmes) du problème original. Comme technique de décomposition par scénario, l’algorithme de recouvrement progressif est une des méthodes les plus populaires pour résoudre les problèmes de programmation stochastique multi-étapes. Malgré la décomposition complète par scénario, l’efficacité de la méthode du recouvrement progressif est très sensible à certains aspects pratiques, tels que le choix du paramètre de pénalisation et la manipulation du terme quadratique dans la fonction objectif du lagrangien augmenté. Pour le choix du paramètre de pénalisation, nous examinons quelques-unes des méthodes populaires, et nous proposons une nouvelle stratégie adaptive qui vise à mieux suivre le processus de l’algorithme. Des expériences numériques sur des exemples de problèmes stochastiques linéaires multi-étapes suggèrent que la plupart des techniques existantes peuvent présenter une convergence prématurée à une solution sous-optimale ou converger vers la solution optimale, mais avec un taux très lent. En revanche, la nouvelle stratégie paraît robuste et efficace. Elle a convergé vers l’optimalité dans toutes nos expériences et a été la plus rapide dans la plupart des cas. Pour la question de la manipulation du terme quadratique, nous faisons une revue des techniques existantes et nous proposons l’idée de remplacer le terme quadratique par un terme linéaire. Bien que qu’il nous reste encore à tester notre méthode, nous avons l’intuition qu’elle réduira certaines difficultés numériques et théoriques de la méthode de recouvrement progressif.

Development of new scenario decomposition techniques for linear and nonlinear stochastic programming

Une approche classique pour traiter les problèmes d’optimisation avec incertitude à deux- et multi-étapes est d’utiliser l’analyse par scénario. Pour ce faire, l’incertitude de certaines données du problème est modélisée par vecteurs aléatoires avec des supports finis spécifiques aux étapes. Chacune de ces réalisations représente un scénario. En utilisant des scénarios, il est possible d’étudier des versions plus simples (sous-problèmes) du problème original. Comme technique de décomposition par scénario, l’algorithme de recouvrement progressif est une des méthodes les plus populaires pour résoudre les problèmes de programmation stochastique multi-étapes. Malgré la décomposition complète par scénario, l’efficacité de la méthode du recouvrement progressif est très sensible à certains aspects pratiques, tels que le choix du paramètre de pénalisation et la manipulation du terme quadratique dans la fonction objectif du lagrangien augmenté. Pour le choix du paramètre de pénalisation, nous examinons quelques-unes des méthodes populaires, et nous proposons une nouvelle stratégie adaptive qui vise à mieux suivre le processus de l’algorithme. Des expériences numériques sur des exemples de problèmes stochastiques linéaires multi-étapes suggèrent que la plupart des techniques existantes peuvent présenter une convergence prématurée à une solution sous-optimale ou converger vers la solution optimale, mais avec un taux très lent. En revanche, la nouvelle stratégie paraît robuste et efficace. Elle a convergé vers l’optimalité dans toutes nos expériences et a été la plus rapide dans la plupart des cas. Pour la question de la manipulation du terme quadratique, nous faisons une revue des techniques existantes et nous proposons l’idée de remplacer le terme quadratique par un terme linéaire. Bien que qu’il nous reste encore à tester notre méthode, nous avons l’intuition qu’elle réduira certaines difficultés numériques et théoriques de la méthode de recouvrement progressif.

Splitting of a prevalent Mycobacterium bovis spoligotype by variable-number tandem-repeat typing reveals high heterogeneity in an evolving clonal group

Mycobacterium bovis populations in countries with persistent bovine tuberculosis usually show a prevalent spoligotype with a wide geographical distribution. This study applied mycobacterial interspersed repetitive-unit-variable-number tandem-repeat (MIRU-VNTR) typing to a random panel of 115 M. bovis isolates that are representative of the most frequent spoligotype in the Iberian Peninsula, SB0121. VNTR typing targeted nine loci: ETR-A (alias VNTR2165), ETR-B (VNTR2461), ETR-D (MIRU4, VNTR580), ETR-E (MIRU31, VNTR3192), MIRU26 (VNTR2996), QUB11a (VNTR2163a), QUB11b (VNTR2163b), QUB26 (VNTR4052), and QUB3232 (VNTR3232). We found a high degree of diversity among the studied isolates (discriminatory index [D] = 0.9856), which were split into 65 different MIRU-VNTR types. An alternative short-format MIRU-VNTR typing targeting only the four loci with the highest variability values was found to offer an equivalent discriminatory index. Minimum spanning trees using the MIRU-VNTR data showed the hypothetical evolution of an apparent clonal group. MIRU-VNTR analysis was also applied to the isolates of 176 animals from 15 farms infected by M. bovis SB0121; in 10 farms, the analysis revealed the coexistence of two to five different MIRU types differing in one to six loci, which highlights the frequency of undetected heterogeneity.

A Variable Neighborhood Search Approach for Solving the Maximum Set Splitting Problem

This paper presents a Variable neighbourhood search (VNS) approach for solving the Maximum Set Splitting Problem (MSSP). The algorithm forms a system of neighborhoods based on changing the component for an increasing number of elements. An efficient local search procedure swaps the components of pairs of elements and yields a relatively short running time. Numerical experiments are performed on the instances known in the literature: minimum hitting set and Steiner triple systems. Computational results show that the proposed VNS achieves all optimal or best known solutions in short times. The experiments indicate that the VNS compares favorably with other methods previously used for solving the MSSP. ACM Computing Classification System (1998): I.2.8.

Splitting of a prevalent Mycobacterium bovis spoligotype by variable-number tandem-repeat typing reveals high heterogeneity in an evolving clonal group

Mycobacterium bovis populations in countries with persistent bovine tuberculosis usually show a prevalent spoligotype with a wide geographical distribution. This study applied mycobacterial interspersed repetitive-unit-variable-number tandem-repeat (MIRU-VNTR) typing to a random panel of 115 M. bovis isolates that are representative of the most frequent spoligotype in the Iberian Peninsula, SB0121. VNTR typing targeted nine loci: ETR-A (alias VNTR2165), ETR-B (VNTR2461), ETR-D (MIRU4, VNTR580), ETR-E (MIRU31, VNTR3192), MIRU26 (VNTR2996), QUB11a (VNTR2163a), QUB11b (VNTR2163b), QUB26 (VNTR4052), and QUB3232 (VNTR3232). We found a high degree of diversity among the studied isolates (discriminatory index [D] = 0.9856), which were split into 65 different MIRU-VNTR types. An alternative short-format MIRU-VNTR typing targeting only the four loci with the highest variability values was found to offer an equivalent discriminatory index. Minimum spanning trees using the MIRU-VNTR data showed the hypothetical evolution of an apparent clonal group. MIRU-VNTR analysis was also applied to the isolates of 176 animals from 15 farms infected by M. bovis SB0121; in 10 farms, the analysis revealed the coexistence of two to five different MIRU types differing in one to six loci, which highlights the frequency of undetected heterogeneity.

Conformational dynamics of thyroid hormones by variable temperature nuclear magnetic resonance: The role of side chain rotations and cisoid/transoid interconversions

H-1 NMR spectra of the thyroid hormone thyroxine recorded at low temperature and high field show splitting into two peaks of the resonance due to the H2,6 protons of the inner (tyrosyl) ring. A single resonance is observed in 600 MHz spectra at temperatures above 185 K. An analysis of the line shape as a function of temperature shows that the coalescence phenomenon is due to an exchange process with a barrier of 37 kJ mol(-1). This is identical to the barrier for coalescence of the H2',6' protons of the outer (phenolic) ring reported previously for the thyroid hormones and their analogues. It is proposed that the separate peaks at low temperature are due to resonances for H2,6 in cisoid and transoid conformers which are populated in approximately equal populations. These two peaks are averaged resonances for the individual H2 and H6 protons. Conversion of cisoid to transoid forms can occur via rotation of either the alanyl side chain or the outer ring, from one face of the inner ring to the other. It is proposed that the latter process is the one responsible for the observed coalescence phenomenon. The barrier to rotation of the alanyl side chain is greater than or equal to 37 kJ mol(-1), which is significantly larger than has previously been reported for Csp(2)-Csp(3) bonds in other Ph-CH2-X systems. The recent crystal structure of a hormone agonist bound to the ligand-binding domain of the rat thyroid hormone receptor (Wagner et al. Nature 1995, 378, 690-697) shows the transoid form to be the bound conformation. The significant energy barrier to cisoid/transoid interconversion determined in the current study combined with the tight fit of the hormone to its receptor suggests that interconversion between the forms cannot occur at the receptor site but that selection for the preferred bound form occurs from the 50% population of the transoid form in solution.

An efficient flux difference splitting algorithm for unsteady duct flows of a real gas

A numerical scheme is presented for the solution of the Euler equations of compressible flow of a real gas in a single spatial coordinate. This includes flow in a duct of variable cross-section, as well as flow with slab, cylindrical or spherical symmetry, as well as the case of an ideal gas, and can be useful when testing codes for the two-dimensional equations governing compressible flow of a real gas. The resulting scheme requires an average of the flow variables across the interface between cells, and this average is chosen to be the arithmetic mean for computational efficiency, which is in contrast to the usual “square root” averages found in this type of scheme. The scheme is applied with success to five problems with either slab or cylindrical symmetry and for a number of equations of state. The results compare favourably with the results from other schemes.

Cylindrically symmetric flows in a Lagrangian frame

An approximate Riemann solver, in a Lagrangian frame of reference, is presented for the compressible flow equations with cylindrical and spherical symmetry, including flow in a duct of variable cross section. The scheme is applied to a cylindrically symmetric problem involving the interaction of shocks.

A generalised Bayesian instrumental variable approach under student t-distributed errors with application

Bayesian analysis is given of an instrumental variable model that allows for heteroscedasticity in both the structural equation and the instrument equation. Specifically, the approach for dealing with heteroscedastic errors in Geweke (1993) is extended to the Bayesian instrumental variable estimator outlined in Rossi et al. (2005). Heteroscedasticity is treated by modelling the variance for each error using a hierarchical prior that is Gamma distributed. The computation is carried out by using a Markov chain Monte Carlo sampling algorithm with an augmented draw for the heteroscedastic case. An example using real data illustrates the approach and shows that ignoring heteroscedasticity in the instrument equation when it exists may lead to biased estimates.

Slower rescue of ER homeostasis by the unfolded protein response pathway associated with common variable immunodeficiency

Common variable immunodeficiency (CVID) is a primary immunodeficiency characterized by hypogammaglobulinemia and recurrent infections. Herein we addressed the role of unfolded protein response (UPR) in the pathogenesis of the disease. Augmented unspliced X-box binding protein 1 (XBP-1) mRNA concurrent with co-localization of IgM and BiP/GRP78 were found in one CVID patient. At confocal microscopy analysis this patient`s cells were enlarged and failed to present the typical surface distribution of IgM, which accumulated within an abnormally expanded endoplasmic reticulum. Sequencing did not reveal any mutation on XBP-1, neither on IRE-1 alpha that could potentially prevent the splicing to occur. Analysis of spliced XBP-1, IRE-1 alpha and BiP messages after LPS or Brefeldin A treatment showed that, unlike healthy controls that respond to these endoplasmic reticulum (ER) stressors by presenting waves of transcription of these three genes, this patient`s cells presented lower rates of transcription, not reaching the same level of response of healthy subjects even after 48 h of ER stress. Treatment with DMSO rescued IgM and IgG secretion as well as the expression of spliced XBP-1. Our findings associate diminished splicing of XBP-1 mRNA with accumulation of IgM within the ER and lower rates of chaperone transcription, therefore providing a mechanism to explain the observed hypogammaglobulinemia. (C) 2008 Elsevier Ltd. All rights reserved.

Variable assessment of wing colouration in aerial contests of the red-winged damselfly Mnesarete pudica (Zygoptera, Calopterygidae)

Wing pigmentation is a trait that predicts the outcome of male contests in some damselflies. Thus, it is reasonable to suppose that males would have the ability to assess wing pigmentation and adjust investment in a fight according to the costs that the rival may potentially impose. Males of the damselfly Mnesarete pudica exhibit red-coloured wings and complex courtship behaviour and engage in striking male– male fights. In this study, we investigated male assessment behaviour during aerial contests. Theory suggests that the relationship between male resource-holding potential (RHP) and contest duration describes the kind of assessment adopted by males: self-assessment, opponent-only assessment or mutual assessment. A recent theory also suggests that weak and strong males exhibit variations in the assessment strategies adopted. We estimated male RHP through male body size and wing colouration (i.e. pigmentation, wing reflectance spectra and transmission spectra) and studied the relationship between male RHP and contest duration from videodocumented behavioural observations of naturally occurring individual contests in the field. The results showed that males with more opaque wings and larger red spots were more likely to win contests. The relationships between RHP and contest durations partly supported the self-assessment and the mutual assessment models. We then experimentally augmented the pigmented area of the wings, in order to evaluate whether strong and weak males assess rivals’ RHP through wing pigmentation. Our experimental manipulation, however, clearly demonstrated that strong males assess rivals’ wing pigmentation. We finally suggest that there is a variation in the assessment strategy adopted by males

Variable assessment of wing colouration in aerial contests of the red-winged damselfly Mnesarete pudica (Zygoptera, Calopterygidae)

Coordenação de Aperfeiçoamento de Pessoal de Nível Superior (CAPES)