Observação e modelação do comportamento dinâmico do viaduto do Corgo: utilização integrada de modelos de identificação modal e modelos de elementos finitos de barra

Trabalho Final de Mestrado elaborado no Laboratório Nacional de Engenharia Civil (LNEC) para a obtenção do grau de Mestre em Engenharia Civil pelo Instituto Superior de Engenharia de Lisboa no âmbito do protocolo de Cooperação entre o ISEL e o LNEC

Operational modal monitoring of ancient structures using wireless technology

Operational Modal Analysis is currently applied in structural dynamic monitoring studies using conventional wired based sensors and data acquisition platforms. This approach, however, becomes inadequate in cases where the tests are performed in ancient structures with esthetic concerns or in others, where the use of wires greatly impacts the monitoring system cost and creates difficulties in the maintenance and deployment of data acquisition platforms. In these cases, the use of sensor platforms based on wireless and MEMS would clearly benefit these applications. This work presents a first attempt to apply this wireless technology to the structural monitoring of historical masonry constructions in the context of operational modal analysis. Commercial WSN platforms were used to study one laboratory specimen and one of the structural elements of a XV century building in Portugal. Results showed that in comparison to the conventional wired sensors, wireless platforms have poor performance in respect to the acceleration time series recorded and the detection of modal shapes. However, for frequency detection issues, reliable results were obtained, especially when random excitation was used as noise source.

GPU implementation of the simplex identification via split augmented Lagrangian

Hyperspectral imaging can be used for object detection and for discriminating between different objects based on their spectral characteristics. One of the main problems of hyperspectral data analysis is the presence of mixed pixels, due to the low spatial resolution of such images. This means that several spectrally pure signatures (endmembers) are combined into the same mixed pixel. Linear spectral unmixing follows an unsupervised approach which aims at inferring pure spectral signatures and their material fractions at each pixel of the scene. The huge data volumes acquired by such sensors put stringent requirements on processing and unmixing methods. This paper proposes an efficient implementation of a unsupervised linear unmixing method on GPUs using CUDA. The method finds the smallest simplex by solving a sequence of nonsmooth convex subproblems using variable splitting to obtain a constraint formulation, and then applying an augmented Lagrangian technique. The parallel implementation of SISAL presented in this work exploits the GPU architecture at low level, using shared memory and coalesced accesses to memory. The results herein presented indicate that the GPU implementation can significantly accelerate the method's execution over big datasets while maintaining the methods accuracy.

Parallel hyperspectral unmixing method via split augmented lagrangian on GPU

One of the main problems of hyperspectral data analysis is the presence of mixed pixels due to the low spatial resolution of such images. Linear spectral unmixing aims at inferring pure spectral signatures and their fractions at each pixel of the scene. The huge data volumes acquired by hyperspectral sensors put stringent requirements on processing and unmixing methods. This letter proposes an efficient implementation of the method called simplex identification via split augmented Lagrangian (SISAL) which exploits the graphics processing unit (GPU) architecture at low level using Compute Unified Device Architecture. SISAL aims to identify the endmembers of a scene, i.e., is able to unmix hyperspectral data sets in which the pure pixel assumption is violated. The proposed implementation is performed in a pixel-by-pixel fashion using coalesced accesses to memory and exploiting shared memory to store temporary data. Furthermore, the kernels have been optimized to minimize the threads divergence, therefore achieving high GPU occupancy. The experimental results obtained for the simulated and real hyperspectral data sets reveal speedups up to 49 times, which demonstrates that the GPU implementation can significantly accelerate the method's execution over big data sets while maintaining the methods accuracy.

Estratégias de planeamento de mobilidade ciclável e avaliação da transferência modal – caso de estudo em Almada

Dissertação para obtenção do Grau de Mestre em Engenharia do Ambiente, perfil de Ordenamento do Território e Impactes Ambientais

Influência dos tarifários de transportes colectivos na repartição modal dos transportes na AML

Dissertação para obtenção do Grau de Mestre em Engenharia do Ambiente, Perfil de Ordenamento do Território e Impactes Ambientais

Identificação modal e actualização de modelos de elementos finitos

Dissertação para obtenção do Grau de Mestre em Engenharia Civil - Perfil Estruturas

Identificação de dano estrutural com base em análise modal

O presente trabalho procura mostrar as potencialidades das técnicas de monitorização estrutural, de detecção, localização e caracterização de dano através de alterações dos parâmetros modais. As características dinâmicas de vibração de uma estrutura são alteradas pela presença de dano, o que, representando uma perda física, conduz à consequente perda de rigidez. Este fenómeno é responsável por modificações nas frequências naturais, deslocamentos modais e respectivas derivadas. Este trabalho apresenta a curvatura das configurações modais como possível parâmetro de controlo na identificação de dano estrutural. Neste documento encontram-se vários estudos de sensibilidade realizados em três modelos distintos (viga bi-apoiada, viga em consola e pórtico encastrado) em que se pretende avaliar a fiabilidade do método das curvaturas. Foram também desenvolvidos estudos respeitantes às alterações das frequências naturais e às alterações de dois indicadores estatísticos, o MAC e o COMAC. Com base nos resultados do método das curvaturas foi desenvolvida uma Java Applet, que constitui uma ferramenta de cálculo que permite explorar as potencialidades do método das curvaturas modais na identificação de danos em várias estruturas. Esta aplicação foi desenvolvida no compilador NetBeans IDE.

Análise modal de um edifício de paredes de alvenaria resistente

O parque habitacional em Portugal é composto por um elevado número de edifícios antigos constituídos por paredes de alvenaria resistente. Nos últimos anos tem-se constatado um interesse crescente na preservação e reutilização dessas construções, por se encontrarem frequentemente em zonas históricas privilegiadas, e com potencial interesse de exploração económica. Estes motivos têm levado à realização de intervenções estruturais nesses edifícios, com vista à reorganização dos espaços, podendo desencadear alterações no seu comportamento estrutural. O objetivo primordial deste estudo é avaliar as alterações da resposta modal de um edifício de paredes de alvenaria resistente, sujeito a uma intervenção de remoção das paredes num dos seus fogos. Para tal, realizaram-se duas campanhas experimentais de identificação modal à vibração ambiente, com o intuito de determinar as propriedades dinâmicas da estrutura, antes e após a intervenção. Procedeu-se à elaboração de um modelo de elementos finitos da estrutura recorrendo ao programa de análise de estruturas SAP2000, que permitiu efetuar também a correspondente análise numérica do problema. Foi ainda realizada uma análise ao comportamento modal do edifício, onde se identificaram diversas hipóteses que influenciam a resposta dinâmica da estrutura, tendo sido desenvolvidos alguns modelos numéricos, com o objetivo de examinar nomeadamente a influência dos edifícios adjacentes, e da interação solo-estrutura, no comportamento global do edifício analisado.

Spiral Split

Combined media on photographic paper. 55" x 53"

Setting boundaries: brain dynamics of modal and amodal illusory shape completion in humans.

Normal visual perception requires differentiating foreground from background objects. Differences in physical attributes sometimes determine this relationship. Often such differences must instead be inferred, as when two objects or their parts have the same luminance. Modal completion refers to such perceptual "filling-in" of object borders that are accompanied by concurrent brightness enhancement, in turn termed illusory contours (ICs). Amodal completion is filling-in without concurrent brightness enhancement. Presently there are controversies regarding whether both completion processes use a common neural mechanism and whether perceptual filling-in is a bottom-up, feedforward process initiating at the lowest levels of the cortical visual pathway or commences at higher-tier regions. We previously examined modal completion (Murray et al., 2002) and provided evidence that the earliest modal IC sensitivity occurs within higher-tier object recognition areas of the lateral occipital complex (LOC). We further proposed that previous observations of IC sensitivity in lower-tier regions likely reflect feedback modulation from the LOC. The present study tested these proposals, examining the commonality between modal and amodal completion mechanisms with high-density electrical mapping, spatiotemporal topographic analyses, and the local autoregressive average distributed linear inverse source estimation. A common initial mechanism for both types of completion processes (140 msec) that manifested as a modulation in response strength within higher-tier visual areas, including the LOC and parietal structures, is demonstrated, whereas differential mechanisms were evident only at a subsequent time period (240 msec), with amodal completion relying on continued strong responses in these structures.

Split sex ratios in the social Hymenoptera: a meta-analysis

The study of sex allocation in social Hymenoptera (ants, bees, and wasps) provides an excellent opportunity for testing kin-selection theory and studying conflict resolution. A queen-worker conflict over sex allocation is expected because workers are more related to sisters than to brothers, whereas queens are equally related to daughters and sons. If workers fully control sex allocation, split sex ratio theory predicts that colonies with relatively high or low relatedness asymmetry (the relatedness of workers to females divided by the relatedness of workers to males) should specialize in females or males, respectively. We performed a meta-analysis to assess the magnitude of adaptive sex allocation biasing by workers and degree of support for split sex ratio theory in the social Hymenoptera. Overall, variation in relatedness asymmetry (due to mate number or queen replacement) and variation in queen number (which also affects relatedness asymmetry in some conditions) explained 20.9% and 5% of the variance in sex allocation among colonies, respectively. These results show that workers often bias colony sex allocation in their favor as predicted by split sex ratio theory, even if their control is incomplete and a large part of the variation among colonies has other causes. The explanatory power of split sex ratio theory was close to that of local mate competition and local resource competition in the few species of social Hymenoptera where these factors apply. Hence, three of the most successful theories explaining quantitative variation in sex allocation are based on kin selection.

A study on the expressive power of some fragments of the modal µ-Calculus

Résumé Le μ-calcul est une extension de la logique modale par des opérateurs de point fixe. Dans ce travail nous étudions la complexité de certains fragments de cette logique selon deux points de vue, différents mais étroitement liés: l'un syntaxique (ou combinatoire) et l'autre topologique. Du point de vue syn¬taxique, les propriétés définissables dans ce formalisme sont classifiées selon la complexité combinatoire des formules de cette logique, c'est-à-dire selon le nombre d'alternances des opérateurs de point fixe. Comparer deux ensembles de modèles revient ainsi à comparer la complexité syntaxique des formules as¬sociées. Du point de vue topologique, les propriétés définissables dans cette logique sont comparées à l'aide de réductions continues ou selon leurs positions dans la hiérarchie de Borel ou dans celle projective. Dans la première partie de ce travail nous adoptons le point de vue syntax¬ique afin d'étudier le comportement du μ-calcul sur des classes restreintes de modèles. En particulier nous montrons que: (1) sur la classe des modèles symétriques et transitifs le μ-calcul est aussi expressif que la logique modale; (2) sur la classe des modèles transitifs, toute propriété définissable par une formule du μ-calcul est définissable par une formule sans alternance de points fixes, (3) sur la classe des modèles réflexifs, il y a pour tout η une propriété qui ne peut être définie que par une formule du μ-calcul ayant au moins η alternances de points fixes, (4) sur la classe des modèles bien fondés et transitifs le μ-calcul est aussi expressif que la logique modale. Le fait que le μ-calcul soit aussi expressif que la logique modale sur la classe des modèles bien fondés et transitifs est bien connu. Ce résultat est en ef¬fet la conséquence d'un théorème de point fixe prouvé indépendamment par De Jongh et Sambin au milieu des années 70. La preuve que nous donnons de l'effondrement de l'expressivité du μ-calcul sur cette classe de modèles est néanmoins indépendante de ce résultat. Par la suite, nous étendons le langage du μ-calcul en permettant aux opérateurs de point fixe de lier des occurrences négatives de variables libres. En montrant alors que ce formalisme est aussi ex¬pressif que le fragment modal, nous sommes en mesure de fournir une nouvelle preuve du théorème d'unicité des point fixes de Bernardi, De Jongh et Sambin et une preuve constructive du théorème d'existence de De Jongh et Sambin. RÉSUMÉ Pour ce qui concerne les modèles transitifs, du point de vue topologique cette fois, nous prouvons que la logique modale correspond au fragment borélien du μ-calcul sur cette classe des systèmes de transition. Autrement dit, nous vérifions que toute propriété définissable des modèles transitifs qui, du point de vue topologique, est une propriété borélienne, est nécessairement une propriété modale, et inversement. Cette caractérisation du fragment modal découle du fait que nous sommes en mesure de montrer que, modulo EF-bisimulation, un ensemble d'arbres est définissable dans la logique temporelle Ε F si et seulement il est borélien. Puisqu'il est possible de montrer que ces deux propriétés coïncident avec une caractérisation effective de la définissabilité dans la logique Ε F dans le cas des arbres à branchement fini donnée par Bojanczyk et Idziaszek [24], nous obtenons comme corollaire leur décidabilité. Dans une deuxième partie, nous étudions la complexité topologique d'un sous-fragment du fragment sans alternance de points fixes du μ-calcul. Nous montrons qu'un ensemble d'arbres est définissable par une formule de ce frag¬ment ayant au moins η alternances si et seulement si cette propriété se trouve au moins au n-ième niveau de la hiérarchie de Borel. Autrement dit, nous vérifions que pour ce fragment du μ-calcul, les points de vue topologique et combina- toire coïncident. De plus, nous décrivons une procédure effective capable de calculer pour toute propriété définissable dans ce langage sa position dans la hiérarchie de Borel, et donc le nombre d'alternances de points fixes nécessaires à la définir. Nous nous intéressons ensuite à la classification des ensembles d'arbres par réduction continue, et donnons une description effective de l'ordre de Wadge de la classe des ensembles d'arbres définissables dans le formalisme considéré. En particulier, la hiérarchie que nous obtenons a une hauteur (ωω)ω. Nous complétons ces résultats en décrivant un algorithme permettant de calculer la position dans cette hiérarchie de toute propriété définissable.

Necessary and sufficient conditions for robust stability using modal intervals

In this paper, robustness of parametric systems is analyzed using a new approach to interval mathematics called Modal Interval Analysis. Modal Intervals are an interval extension that, instead of classic intervals, recovers some of the properties required by a numerical system. Modal Interval Analysis not only simplifies the computation of interval functions but allows semantic interpretation of their results. Necessary, sufficient and, in some cases, necessary and sufficient conditions for robust performance are presented