Numerical and Experimental Analysis of Balanced and Unbalanced Adhesive Single-Lap Joints between Aluminium Adherends

The single-lap joint is the most commonly used, although it endures significant bending due to the non-collinear load path, which negatively affects its load bearing capabilities. The use of material or geometric changes is widely documented in the literature to reduce this handicap, acting by reduction of peel and shear peak stresses or alterations of the failure mechanism emerging from local modifications. In this work, the effect of using different thickness adherends on the tensile strength of single-lap joints, bonded with a ductile and brittle adhesive, was numerically and experimentally evaluated. The joints were tested under tension for different combinations of adherend thickness. The effect of the adherends thickness mismatch on the stress distributions was also investigated by Finite Elements (FE), which explained the experimental results and the strength prediction of the joints. The numerical study was made by FE and Cohesive Zone Modelling (CZM), which allowed characterizing the entire fracture process. For this purpose, a FE analysis was performed in ABAQUS® considering geometric non-linearities. In the end, a detailed comparative evaluation of unbalanced joints, commonly used in engineering applications, is presented to give an understanding on how modifications in the bonded structures thickness can influence the joint performance.

Effect of Adherend Recessing on the Tensile Strength of Single Lap Joints

Bonded joints are gaining importance in many fields of manufacturing owing to a significant number of advantages to the traditional methods. The single lap joint (SLJ) is the most commonly used method. The use of material or geometric changes in SLJ reduces peel and shear peak stresses at the damage initiation sites. In this work, the effect of adherend recessing at the overlap edges on the tensile strength of SLJ, bonded with a brittle adhesive, was experimentally and numerically studied. The recess dimensions (length and depth) were optimized for different values of overlap length (LO), thus allowing the maximization of the joint’s strength by the reduction of peak stresses at the overlap edges. The effect of recessing was also investigated by a finite element (FE) analysis and cohesive zone modelling (CZM), which allowed characterizing the entire fracture process and provided joint strength predictions. For this purpose, a static FE analysis was performed in ABAQUS1 considering geometric nonlinearities. In the end, the experimental and FE results revealed the accuracy of the FE analysis in predicting the strength and also provided some design principles for the strength improvement of SLJ using a relatively simple and straightforward technique.

Design and performance evaluation of turbo FDE receivers

Dissertação apresentada na Faculdade de Ciências e Tecnologia da Universidade Nova de Lisboa para obtenção do Grau de Mestre em Engenharia Electrotécnica e de Computadores

Complementary filter design with three frequency bands: robot attitude estimation

This paper extents the by now classic sensor fusion complementary filter (CF) design, involving two sensors, to the case where three sensors that provide measurements in different bands are available. This paper shows that the use of classical CF techniques to tackle a generic three sensors fusion problem, based solely on their frequency domain characteristics, leads to a minimal realization, stable, sub-optimal solution, denoted as Complementary Filters3 (CF3). Then, a new approach for the estimation problem at hand is used, based on optimal linear Kalman filtering techniques. Moreover, the solution is shown to preserve the complementary property, i.e. the sum of the three transfer functions of the respective sensors add up to one, both in continuous and discrete time domains. This new class of filters are denoted as Complementary Kalman Filters3 (CKF3). The attitude estimation of a mobile robot is addressed, based on data from a rate gyroscope, a digital compass, and odometry. The experimental results obtained are reported.

Design of a Mobile Application for Eye Signs Screening

Mestrado em Engenharia Computação e Instrumentação Médica

Virtual Communities of Practice: Design and Development of Support Platforms and Participation Fostering

Mestrado em Engenharia Informática - Área de Especialização em Sistemas Gráficos e Multimédia

System-on-chip field-programmable gate array design for onboard real-time hyperspectral unmixing

Hyperspectral instruments have been incorporated in satellite missions, providing large amounts of data of high spectral resolution of the Earth surface. This data can be used in remote sensing applications that often require a real-time or near-real-time response. To avoid delays between hyperspectral image acquisition and its interpretation, the last usually done on a ground station, onboard systems have emerged to process data, reducing the volume of information to transfer from the satellite to the ground station. For this purpose, compact reconfigurable hardware modules, such as field-programmable gate arrays (FPGAs), are widely used. This paper proposes an FPGA-based architecture for hyperspectral unmixing. This method based on the vertex component analysis (VCA) and it works without a dimensionality reduction preprocessing step. The architecture has been designed for a low-cost Xilinx Zynq board with a Zynq-7020 system-on-chip FPGA-based on the Artix-7 FPGA programmable logic and tested using real hyperspectral data. Experimental results indicate that the proposed implementation can achieve real-time processing, while maintaining the methods accuracy, which indicate the potential of the proposed platform to implement high-performance, low-cost embedded systems, opening perspectives for onboard hyperspectral image processing.

Vertex component analysis: a geometric-based approach to unmix hyperspectral data

Hyperspectral remote sensing exploits the electromagnetic scattering patterns of the different materials at specific wavelengths [2, 3]. Hyperspectral sensors have been developed to sample the scattered portion of the electromagnetic spectrum extending from the visible region through the near-infrared and mid-infrared, in hundreds of narrow contiguous bands [4, 5]. The number and variety of potential civilian and military applications of hyperspectral remote sensing is enormous [6, 7]. Very often, the resolution cell corresponding to a single pixel in an image contains several substances (endmembers) [4]. In this situation, the scattered energy is a mixing of the endmember spectra. A challenging task underlying many hyperspectral imagery applications is then decomposing a mixed pixel into a collection of reflectance spectra, called endmember signatures, and the corresponding abundance fractions [8–10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. Linear mixing model holds approximately when the mixing scale is macroscopic [13] and there is negligible interaction among distinct endmembers [3, 14]. If, however, the mixing scale is microscopic (or intimate mixtures) [15, 16] and the incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [17], the linear model is no longer accurate. Linear spectral unmixing has been intensively researched in the last years [9, 10, 12, 18–21]. It considers that a mixed pixel is a linear combination of endmember signatures weighted by the correspondent abundance fractions. Under this model, and assuming that the number of substances and their reflectance spectra are known, hyperspectral unmixing is a linear problem for which many solutions have been proposed (e.g., maximum likelihood estimation [8], spectral signature matching [22], spectral angle mapper [23], subspace projection methods [24,25], and constrained least squares [26]). In most cases, the number of substances and their reflectances are not known and, then, hyperspectral unmixing falls into the class of blind source separation problems [27]. Independent component analysis (ICA) has recently been proposed as a tool to blindly unmix hyperspectral data [28–31]. ICA is based on the assumption of mutually independent sources (abundance fractions), which is not the case of hyperspectral data, since the sum of abundance fractions is constant, implying statistical dependence among them. This dependence compromises ICA applicability to hyperspectral images as shown in Refs. [21, 32]. In fact, ICA finds the endmember signatures by multiplying the spectral vectors with an unmixing matrix, which minimizes the mutual information among sources. If sources are independent, ICA provides the correct unmixing, since the minimum of the mutual information is obtained only when sources are independent. This is no longer true for dependent abundance fractions. Nevertheless, some endmembers may be approximately unmixed. These aspects are addressed in Ref. [33]. Under the linear mixing model, the observations from a scene are in a simplex whose vertices correspond to the endmembers. Several approaches [34–36] have exploited this geometric feature of hyperspectral mixtures [35]. Minimum volume transform (MVT) algorithm [36] determines the simplex of minimum volume containing the data. The method presented in Ref. [37] is also of MVT type but, by introducing the notion of bundles, it takes into account the endmember variability usually present in hyperspectral mixtures. The MVT type approaches are complex from the computational point of view. Usually, these algorithms find in the first place the convex hull defined by the observed data and then fit a minimum volume simplex to it. For example, the gift wrapping algorithm [38] computes the convex hull of n data points in a d-dimensional space with a computational complexity of O(nbd=2cþ1), where bxc is the highest integer lower or equal than x and n is the number of samples. The complexity of the method presented in Ref. [37] is even higher, since the temperature of the simulated annealing algorithm used shall follow a log( ) law [39] to assure convergence (in probability) to the desired solution. Aiming at a lower computational complexity, some algorithms such as the pixel purity index (PPI) [35] and the N-FINDR [40] still find the minimum volume simplex containing the data cloud, but they assume the presence of at least one pure pixel of each endmember in the data. This is a strong requisite that may not hold in some data sets. In any case, these algorithms find the set of most pure pixels in the data. PPI algorithm uses the minimum noise fraction (MNF) [41] as a preprocessing step to reduce dimensionality and to improve the signal-to-noise ratio (SNR). The algorithm then projects every spectral vector onto skewers (large number of random vectors) [35, 42,43]. The points corresponding to extremes, for each skewer direction, are stored. A cumulative account records the number of times each pixel (i.e., a given spectral vector) is found to be an extreme. The pixels with the highest scores are the purest ones. N-FINDR algorithm [40] is based on the fact that in p spectral dimensions, the p-volume defined by a simplex formed by the purest pixels is larger than any other volume defined by any other combination of pixels. This algorithm finds the set of pixels defining the largest volume by inflating a simplex inside the data. ORA SIS [44, 45] is a hyperspectral framework developed by the U.S. Naval Research Laboratory consisting of several algorithms organized in six modules: exemplar selector, adaptative learner, demixer, knowledge base or spectral library, and spatial postrocessor. The first step consists in flat-fielding the spectra. Next, the exemplar selection module is used to select spectral vectors that best represent the smaller convex cone containing the data. The other pixels are rejected when the spectral angle distance (SAD) is less than a given thresh old. The procedure finds the basis for a subspace of a lower dimension using a modified Gram–Schmidt orthogonalizati on. The selected vectors are then projected onto this subspace and a simplex is found by an MV T pro cess. ORA SIS is oriented to real-time target detection from uncrewed air vehicles using hyperspectral data [46]. In this chapter we develop a new algorithm to unmix linear mixtures of endmember spectra. First, the algorithm determines the number of endmembers and the signal subspace using a newly developed concept [47, 48]. Second, the algorithm extracts the most pure pixels present in the data. Unlike other methods, this algorithm is completely automatic and unsupervised. To estimate the number of endmembers and the signal subspace in hyperspectral linear mixtures, the proposed scheme begins by estimating sign al and noise correlation matrices. The latter is based on multiple regression theory. The signal subspace is then identified by selectin g the set of signal eigenvalue s that best represents the data, in the least-square sense [48,49 ], we note, however, that VCA works with projected and with unprojected data. The extraction of the end members exploits two facts: (1) the endmembers are the vertices of a simplex and (2) the affine transformation of a simplex is also a simplex. As PPI and N-FIND R algorithms, VCA also assumes the presence of pure pixels in the data. The algorithm iteratively projects data on to a direction orthogonal to the subspace spanned by the endmembers already determined. The new end member signature corresponds to the extreme of the projection. The algorithm iterates until all end members are exhausted. VCA performs much better than PPI and better than or comparable to N-FI NDR; yet it has a computational complexity between on e and two orders of magnitude lower than N-FINDR. The chapter is structure d as follows. Section 19.2 describes the fundamentals of the proposed method. Section 19.3 and Section 19.4 evaluate the proposed algorithm using simulated and real data, respectively. Section 19.5 presents some concluding remarks.

A didactic sequence of elementary geometric optics Informed by history and philosophy of science

The concepts and instruments required for the teaching and learning of geometric optics are introduced in the didactic processwithout a proper didactic transposition. This claim is secured by the ample evidence of both wide- and deep-rooted alternative concepts on the topic. Didactic transposition is a theory that comes from a reflection on the teaching and learning process in mathematics but has been used in other disciplinary fields. It will be used in this work in order to clear up the main obstacles in the teachinglearning process of geometric optics. We proceed to argue that since Newton’s approach to optics, in his Book I of Opticks, is independent of the corpuscular or undulatory nature of light, it is the most suitable for a constructivist learning environment. However, Newton’s theory must be subject to a proper didactic transposition to help overcome the referred alternative concepts. Then is described our didactic transposition in order to create knowledge to be taught using a dialogical process between students’ previous knowledge, history of optics and the desired outcomes on geometrical optics in an elementary pre-service teacher training course. Finally, we use the scheme-facet structure of knowledge both to analyse and discuss our results as well as to illuminate shortcomings that must be addressed in our next stage of the inquiry.

Projeto de uma ponte atirantada rodoferroviária sobre o rio Lima, Viana do Castelo

Trabalho académico com o objetivo do autor desenvolver um estudo prévio e um projeto de uma travessia sobre o rio Lima, na cidade de Viana do Castelo constituída por uma ponte de tirantes rodoferroviária. O projeto académico visa, também, desenvolver e compreender: os conceitos básicos, as metodologias de conceção, e o funcionamento de estruturas desse género. O motivo principal da escolha do tema é a necessidade de uma alternativa à ponte Eiffel em Viana do Castelo, e juntando o facto de em Portugal não existir nenhuma obra de arte de tirantes rodoferroviária até ao presente, seria interessante estudar e projetar uma estrutura rodoferroviária de tirantes. Das diversas possibilidades de sistemas estruturais estudados, adotou-se uma ponte que acomodará 4 vias rodoviárias e 2 vias ferroviárias, com um desenvolvimento total de 660 metros, constituída por dois vãos laterais com 165 metros cada um, e com um vão central de 330 metros. A obra de arte será em semi-leque com dois planos de tirantes, ancorados a duas torres de betão em Y invertido de altura aproximadamente de 110 metros. O tabuleiro será duplo misto aço-betão, constituído por duas vigas trianguladas do tipo Warren, e por carlingas, afastadas entre si de 15 metros com secções tubulares metálicas de espessura variável. As carlingas ao nível superior suportam a laje de betão, que constitui a rodovia, e inferiormente, suportam outra laje de betão para a parte ferroviária. O trabalho inicia-se com o enquadramento conceptual geral da envolvente da obra de arte, seguidamente com apresentação da evolução histórica ao longo do tempo das pontes de tirantes, e à apresentação de algumas pontes rodoferroviárias de tirantes. É realizada uma análise preliminar, onde se estudam as restrições, as condicionantes, o local de implantação, e o sistema da configuração geométrica a adotar na conceção estrutural. São descritos todos os tipos de materiais, equipamentos a utilizar, bem como as suas características mecânicas necessárias para o cálculo estrutural. A quantificação das ações e das combinações de cálculo efetuaram-se de acordo com as normas em vigor nacionais e europeias, designadamente os Eurocódigos das várias especialidades e o Regulamento de Segurança e Ações para Estruturas de Edifícios e Pontes. Efetuou-se um pré-dimensionamento e uma otimização de vários sistemas estruturais possíveis de todos os elementos estruturais, tendo em conta variáveis de estudo como a economia e a resistência estrutural das secções, por forma a chegar à solução final. A estrutura foi discretizada e analisada num modelo estático tridimensional num programa de cálculo automático. A análise de resultados foi efetuada longitudinalmente para a verificação dos Estados Limites Últimos e Estados Limites de Utilização dos elementos estruturais que constituem a ponte. Foi ainda efetuada uma estimativa orçamental da ponte no rio Lima na cidade de Viana do Castelo.

Paradigmas de interfaces dos novos media: desafios para o design

Trabalho de Projecto de Mestrado em Ciências da Comunicação Variante Novos Media e Práticas Web

Application of the EcoBlock method to eco-design - electric hand dryers versus paper towels

Sustainable Construction, Materials and Practice, p. 426-432

Demand Response Design and Use Based on Network Locational Marginal Prices

Power systems have been experiencing huge changes mainly due to the substantial increase of distributed generation (DG) and the operation in competitive environments. Virtual Power Players (VPP) can aggregate several players, namely a diversity of energy resources, including distributed generation (DG) based on several technologies, electric storage systems (ESS) and demand response (DR). Energy resources management gains an increasing relevance in this competitive context. This makes the DR use more interesting and flexible, giving place to a wide range of new opportunities. This paper proposes a methodology to support VPPs in the DR programs’ management, considering all the existing energy resources (generation and storage units) and the distribution network. The proposed method is based on locational marginal prices (LMP) values. The evaluation of the impact of using DR specific programs in the LMP values supports the manager decision concerning the DR use. The proposed method has been computationally implemented and its application is illustrated in this paper using a 33-bus network with intensive use of DG.

Using perspective schema and a reference model to design the ETL process

Dissertação apresentada para a obtenção do Grau de Doutor em Informática

Improving discovery in the life sciences using semantic Web technologies and linked data: design principles for life sciences knowledge organization systems

Dissertation presented to obtain the Ph.D degree in Bioinformatics