Visible range plasmonic effect produced by aluminium nanoparticles embedded in amorphous silicon

We present results, obtained by means of an analytic study and a numerical simulation, about the resonant condition necessary to produce a Localized Surface Plasmonic Resonance (LSPR) effect at the surface of metal nanospheres embedded in an amorphous silicon matrix. The study is based on a Lorentz dispersive model for a-Si:H permittivity and a Drude model for the metals. Considering the absorption spectra of a-Si:H, the best choice for the metal nanoparticles appears to be aluminium, indium or magnesium. No difference has been observed when considering a-SiC:H. Finite-difference time-domain (FDTD) simulation of an Al nanosphere embedded into an amorphous silicon matrix shows an increased scattering radius and the presence of LSPR induced by the metal/semiconductor interaction under green light (560 nm) illumination. Further results include the effect of the nanoparticles shape (nano-ellipsoids) in controlling the wavelength suitable to produce LSPR. It has been shown that is possible to produce LSPR in the red part of the visible spectrum (the most critical for a-Si:H solar cells applications in terms of light absorption enhancement) with aluminium nano-ellipsoids. As an additional results we may conclude that the double Lorentz-Lorenz model for the optical functions of a-Si:H is numerically stable in 3D simulations and can be used safely in the FDTD algorithm. A further simulation study is directed to determine an optimal spatial distribution of Al nanoparticles, with variable shapes, capable to enhance light absorption in the red part of the visible spectrum, exploiting light trapping and plasmonic effects. © 2015 WILEY-VCH Verlag GmbH & Co. KGaA, Weinheim.

Analysis of Forest Fires by means of Pseudo Phase Plane and Multidimensional Scaling Methods

Forest fires dynamics is often characterized by the absence of a characteristic length-scale, long range correlations in space and time, and long memory, which are features also associated with fractional order systems. In this paper a public domain forest fires catalogue, containing information of events for Portugal, covering the period from 1980 up to 2012, is tackled. The events are modelled as time series of Dirac impulses with amplitude proportional to the burnt area. The time series are viewed as the system output and are interpreted as a manifestation of the system dynamics. In the first phase we use the pseudo phase plane (PPP) technique to describe forest fires dynamics. In the second phase we use multidimensional scaling (MDS) visualization tools. The PPP allows the representation of forest fires dynamics in two-dimensional space, by taking time series representative of the phenomena. The MDS approach generates maps where objects that are perceived to be similar to each other are placed on the map forming clusters. The results are analysed in order to extract relationships among the data and to better understand forest fires behaviour.

Evaluation of different methods for Plasmodia detection, in well defined population groups in an endemic area of Brazil

In Brazil, more than 500,000 new cases of malaria were notified in 1992. Plasmodium falciparum and P.vivax are the responsible species for 99.3% of the cases. For adequate treatment, precoce diagnosis is necessary. In this work, we present the results of the traditional Plasmodia detection method, thick blood film (TBF), and the results of alternative methods: Immunofluorescence assay (IFA) with polyclonal antibody and Quantitative Buffy Coat method (QBC)® in a well defined population groups. The analysis were done in relation to the presence or absence of malaria clinical symptoms. Also different classes of immunoglobulins anti-P.falciparum were quantified for the global analysis of the results, mainly in the discrepant results. We concluded that alternative methods are more sensitive than TBF and that the association of epidemiological, clinical and laboratory findings is necessary to define the presence of malaria.

A MAP approach to evidence accumulation clustering

The Evidence Accumulation Clustering (EAC) paradigm is a clustering ensemble method which derives a consensus partition from a collection of base clusterings obtained using different algorithms. It collects from the partitions in the ensemble a set of pairwise observations about the co-occurrence of objects in a same cluster and it uses these co-occurrence statistics to derive a similarity matrix, referred to as co-association matrix. The Probabilistic Evidence Accumulation for Clustering Ensembles (PEACE) algorithm is a principled approach for the extraction of a consensus clustering from the observations encoded in the co-association matrix based on a probabilistic model for the co-association matrix parameterized by the unknown assignments of objects to clusters. In this paper we extend the PEACE algorithm by deriving a consensus solution according to a MAP approach with Dirichlet priors defined for the unknown probabilistic cluster assignments. In particular, we study the positive regularization effect of Dirichlet priors on the final consensus solution with both synthetic and real benchmark data.

Estimation of rotational frequency response functions

As it is widely known, in structural dynamic applications, ranging from structural coupling to model updating, the incompatibility between measured and simulated data is inevitable, due to the problem of coordinate incompleteness. Usually, the experimental data from conventional vibration testing is collected at a few translational degrees of freedom (DOF) due to applied forces, using hammer or shaker exciters, over a limited frequency range. Hence, one can only measure a portion of the receptance matrix, few columns, related to the forced DOFs, and rows, related to the measured DOFs. In contrast, by finite element modeling, one can obtain a full data set, both in terms of DOFs and identified modes. Over the years, several model reduction techniques have been proposed, as well as data expansion ones. However, the latter are significantly fewer and the demand for efficient techniques is still an issue. In this work, one proposes a technique for expanding measured frequency response functions (FRF) over the entire set of DOFs. This technique is based upon a modified Kidder's method and the principle of reciprocity, and it avoids the need for modal identification, as it uses the measured FRFs directly. In order to illustrate the performance of the proposed technique, a set of simulated experimental translational FRFs is taken as reference to estimate rotational FRFs, including those that are due to applied moments.

Unmixing hyperspectral data: independent and dependent component analysis

The development of high spatial resolution airborne and spaceborne sensors has improved the capability of ground-based data collection in the fields of agriculture, geography, geology, mineral identification, detection [2, 3], and classification [4–8]. The signal read by the sensor from a given spatial element of resolution and at a given spectral band is a mixing of components originated by the constituent substances, termed endmembers, located at that element of resolution. This chapter addresses hyperspectral unmixing, which is the decomposition of the pixel spectra into a collection of constituent spectra, or spectral signatures, and their corresponding fractional abundances indicating the proportion of each endmember present in the pixel [9, 10]. Depending on the mixing scales at each pixel, the observed mixture is either linear or nonlinear [11, 12]. The linear mixing model holds when the mixing scale is macroscopic [13]. The nonlinear model holds when the mixing scale is microscopic (i.e., intimate mixtures) [14, 15]. The linear model assumes negligible interaction among distinct endmembers [16, 17]. The nonlinear model assumes that incident solar radiation is scattered by the scene through multiple bounces involving several endmembers [18]. Under the linear mixing model and assuming that the number of endmembers and their spectral signatures are known, hyperspectral unmixing is a linear problem, which can be addressed, for example, under the maximum likelihood setup [19], the constrained least-squares approach [20], the spectral signature matching [21], the spectral angle mapper [22], and the subspace projection methods [20, 23, 24]. Orthogonal subspace projection [23] reduces the data dimensionality, suppresses undesired spectral signatures, and detects the presence of a spectral signature of interest. The basic concept is to project each pixel onto a subspace that is orthogonal to the undesired signatures. As shown in Settle [19], the orthogonal subspace projection technique is equivalent to the maximum likelihood estimator. This projection technique was extended by three unconstrained least-squares approaches [24] (signature space orthogonal projection, oblique subspace projection, target signature space orthogonal projection). Other works using maximum a posteriori probability (MAP) framework [25] and projection pursuit [26, 27] have also been applied to hyperspectral data. In most cases the number of endmembers and their signatures are not known. Independent component analysis (ICA) is an unsupervised source separation process that has been applied with success to blind source separation, to feature extraction, and to unsupervised recognition [28, 29]. ICA consists in finding a linear decomposition of observed data yielding statistically independent components. Given that hyperspectral data are, in given circumstances, linear mixtures, ICA comes to mind as a possible tool to unmix this class of data. In fact, the application of ICA to hyperspectral data has been proposed in reference 30, where endmember signatures are treated as sources and the mixing matrix is composed by the abundance fractions, and in references 9, 25, and 31–38, where sources are the abundance fractions of each endmember. In the first approach, we face two problems: (1) The number of samples are limited to the number of channels and (2) the process of pixel selection, playing the role of mixed sources, is not straightforward. In the second approach, ICA is based on the assumption of mutually independent sources, which is not the case of hyperspectral data, since the sum of the abundance fractions is constant, implying dependence among abundances. This dependence compromises ICA applicability to hyperspectral images. In addition, hyperspectral data are immersed in noise, which degrades the ICA performance. IFA [39] was introduced as a method for recovering independent hidden sources from their observed noisy mixtures. IFA implements two steps. First, source densities and noise covariance are estimated from the observed data by maximum likelihood. Second, sources are reconstructed by an optimal nonlinear estimator. Although IFA is a well-suited technique to unmix independent sources under noisy observations, the dependence among abundance fractions in hyperspectral imagery compromises, as in the ICA case, the IFA performance. Considering the linear mixing model, hyperspectral observations are in a simplex whose vertices correspond to the endmembers. Several approaches [40–43] have exploited this geometric feature of hyperspectral mixtures [42]. Minimum volume transform (MVT) algorithm [43] determines the simplex of minimum volume containing the data. The MVT-type approaches are complex from the computational point of view. Usually, these algorithms first find the convex hull defined by the observed data and then fit a minimum volume simplex to it. Aiming at a lower computational complexity, some algorithms such as the vertex component analysis (VCA) [44], the pixel purity index (PPI) [42], and the N-FINDR [45] still find the minimum volume simplex containing the data cloud, but they assume the presence in the data of at least one pure pixel of each endmember. 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. Hyperspectral sensors collects spatial images over many narrow contiguous bands, yielding large amounts of data. For this reason, very often, the processing of hyperspectral data, included unmixing, is preceded by a dimensionality reduction step to reduce computational complexity and to improve the signal-to-noise ratio (SNR). Principal component analysis (PCA) [46], maximum noise fraction (MNF) [47], and singular value decomposition (SVD) [48] are three well-known projection techniques widely used in remote sensing in general and in unmixing in particular. The newly introduced method [49] exploits the structure of hyperspectral mixtures, namely the fact that spectral vectors are nonnegative. The computational complexity associated with these techniques is an obstacle to real-time implementations. To overcome this problem, band selection [50] and non-statistical [51] algorithms have been introduced. This chapter addresses hyperspectral data source dependence and its impact on ICA and IFA performances. The study consider simulated and real data and is based on mutual information minimization. Hyperspectral observations are described by a generative model. This model takes into account the degradation mechanisms normally found in hyperspectral applications—namely, signature variability [52–54], abundance constraints, topography modulation, and system noise. The computation of mutual information is based on fitting mixtures of Gaussians (MOG) to data. The MOG parameters (number of components, means, covariances, and weights) are inferred using the minimum description length (MDL) based algorithm [55]. We study the behavior of the mutual information as a function of the unmixing matrix. The conclusion is that the unmixing matrix minimizing the mutual information might be very far from the true one. Nevertheless, some abundance fractions might be well separated, mainly in the presence of strong signature variability, a large number of endmembers, and high SNR. We end this chapter by sketching a new methodology to blindly unmix hyperspectral data, where abundance fractions are modeled as a mixture of Dirichlet sources. This model enforces positivity and constant sum sources (full additivity) constraints. The mixing matrix is inferred by an expectation-maximization (EM)-type algorithm. This approach is in the vein of references 39 and 56, replacing independent sources represented by MOG with mixture of Dirichlet sources. Compared with the geometric-based approaches, the advantage of this model is that there is no need to have pure pixels in the observations. The chapter is organized as follows. Section 6.2 presents a spectral radiance model and formulates the spectral unmixing as a linear problem accounting for abundance constraints, signature variability, topography modulation, and system noise. Section 6.3 presents a brief resume of ICA and IFA algorithms. Section 6.4 illustrates the performance of IFA and of some well-known ICA algorithms with experimental data. Section 6.5 studies the ICA and IFA limitations in unmixing hyperspectral data. Section 6.6 presents results of ICA based on real data. Section 6.7 describes the new blind unmixing scheme and some illustrative examples. Section 6.8 concludes with some remarks.

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.

Blind hyperspectral unmixing

This paper introduces a new hyperspectral unmixing method called Dependent Component Analysis (DECA). This method decomposes a hyperspectral image into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA models the abundance fractions as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. DECA performance is illustrated using simulated and real data.

Hyperspectral unmixing algorithm via dependent component analysis

This paper introduces a new method to blindly unmix hyperspectral data, termed dependent component analysis (DECA). This method decomposes a hyperspectral images into a collection of reflectance (or radiance) spectra of the materials present in the scene (endmember signatures) and the corresponding abundance fractions at each pixel. DECA assumes that each pixel is a linear mixture of the endmembers signatures weighted by the correspondent abundance fractions. These abudances are modeled as mixtures of Dirichlet densities, thus enforcing the constraints on abundance fractions imposed by the acquisition process, namely non-negativity and constant sum. The mixing matrix is inferred by a generalized expectation-maximization (GEM) type algorithm. This method overcomes the limitations of unmixing methods based on Independent Component Analysis (ICA) and on geometrical based approaches. The effectiveness of the proposed method is illustrated using simulated data based on U.S.G.S. laboratory spectra and real hyperspectral data collected by the AVIRIS sensor over Cuprite, Nevada.

A Eficácia do Programa Fifa 11+ na Prevenção de Lesões em Atletas de Futebol Sub18

Introdução: No futebol, as lesões são da mais fulcral importância pelo que a sua prevenção se revela de extrema pertinência. A FIFA criou o FIFA 11+, um programa de prevenção de lesões, que revelou resultados positivos em equipas jovens tanto femininas como masculinas. No entanto, em Portugal, os resultados da sua implementação são escassos, principalmente em camadas jovens. Objetivo: Estudar a eficácia do programa FIFA 11+ na prevenção de lesões em atletas de futebol – sub 18. Métodos: O presente estudo quasi experimental teve como amostra uma equipa de 24 atletas, divididos voluntariamente em 2 grupos: o grupo experimental (GE) (n=12), e o grupo controlo (GC) (n= 12). Ambos os grupos realizaram os treinos normais sendo o grupo experimental sujeito adicionalmente ao programa FIFA 11+ duas vezes por semana, durante 12 semanas. Foi utilizado ainda o Orchard Sports Injury Classification System (OSICS-10) como sistema de classificação de lesões, sendo estas divididas em graves, moderadas, leves e mínimas. O teste Mann-Whitney foi utilizado para a comparação entre grupos, e o teste de Wilcoxon para a comparação intra grupo. Resultados: Quando comparados o GE com o GC em M0 não se observaram diferenças estatisticamente significativas (p=0.065), no número de lesões entre os grupos. O mesmo se verificou após a implementação do programa FIFA 11+ (p=1,000). Na comparação intra-grupo de M0 e M1 o grupo controlo não apresentou diferenças estatisticamente significativas (p=0,317) enquanto que no grupo experimental se observou que existiam significativamente menos lesões após a implementação do programa. (p=0,025). Conclusão: O programa FIFA 11+ parece ser indicado para a prevenção e diminuição de lesões desportivas em jogadores amadores de equipas sub-18, quando aplicado duas vezes por semana. Apesar disso, para eleger o programa como uma ferramenta de eleição na promoção da saúde, mais estudos são sugeridos utilizando uma amostra maior e se possível num período superior.

Força Muscular Isocinética após Reconstrução do Ligamento Cruzado Anterior – Influência do Tipo de Enxerto (Osso-Tendão-Osso/Isquio-Tibiais)

Introdução: É reconhecida a importância do ligamento cruzado anterior (LCA) no funcionamento normal do joelho. Em caso de rotura ligamentar, nomeadamente em desportos com marcada solicitação dos movimentos de rotação do joelho, é justificada a necessidade de reconstrução do LCA na maioria dos casos. Objetivo (s): Avaliar a influência do tipo de enxerto na reconstrução do ligamento cruzado anterior na força muscular isocinética, assim como na funcionalidade e sintomas após 6 meses. Métodos: Estudo transversal analítico, constituído por 20 indivíduos voluntários do sexo masculino, que haviam sido submetidos a uma ligamentoplastia do cruzado anterior, pelo mesmo cirurgião, seguido de uma intervenção individualizada por um fisioterapeuta. Em 10 indivíduos, o procedimento cirúrgico foi realizado com enxerto do tendão rotuliano (grupo OTO), e nos restantes 10 com enxerto do semitendinoso e gracilis (grupo STG). Como forma de avaliar a Força Muscular Isocinética (Peak Torque, Trabalho Total Muscular, ratio Isquiotibiais/Quadricipite), foi utilizado o Dinamómetro Isocinético Biodex. A avaliação foi efectuada apenas aos 6 meses após o procedimento cirúrgico. Para observação da funcionalidade, amplitude de movimento e sintomas, utilizou-se o questionário International Knee Documentation Committee (IKDC). Resultados: Foi possível observar que entre os grupos apenas se observaram diferenças significativas no peak torque de extensão a 180º no membro não lesado (p=0,019). Contudo, foi observada uma tendência para o grupo OTO apresentar um maior défice no peak torque e trabalho total muscular em extensão. Comparativamente ao membro contra-lateral, o membro lesado apresentou valores significativamente inferiores na maioria das variáveis ( p < 0,05). Conclusão: Após 6 meses de pós-cirúrgico com reabilitação de fisioterapia, não foi possível apontar qual o enxerto que garante uma melhor recuperação da força muscular. Aos 6 meses, ambos os grupos ainda apresentaram limitações musculares, quando comparados com o lado contra-lateral. Relativamente ao rácio isquiotibiais/quadricípite, assim como no IKDC, não se observaram diferenças entre os dois tipos de enxertos.

Utilização de PAM's e Medicamentos e/ou Produtos à base de Plantas pela População do Concelho de Bragança

Introdução: Entende-se por fitoterapia a terapêutica caracterizada pelo uso de plantas medicinais nas diferentes formas farmacêuticas com finalidade terapêutica, usada assim para prevenir, atenuar ou curar um estado patológico. Objetivos: Caracterizar a utilização de plantas aromáticas e medicinais (PAM´s), medicamentos e produtos à base de plantas pela população do concelho de Bragança, conhecer a fonte de indicação deste tipo de produtos, apurar a relação entre a fonte de indicação e o estado de saúde após a utilização, verificar a sua correta utilização relativa à indicação terapêutica, modo e frequência de utilização, identificar potenciais interacções medicamentosas, averiguar se os utentes informam o médico do seu uso, investigar a ocorrência de efeitos adversos e apurar a relação entre os efeitos adversos ocorridos e o género dos inquiridos. Métodos: Trata-se de um estudo observacional analítico-transversal. Nele participaram 404 indivíduos de ambos os géneros e com idades compreendidas entre os 18 e os 89 anos. A recolha de dados foi realizada entre os meses de abril e junho de 2014, através de um questionário estruturado de autopreenchimento, formado por 30 perguntas. Após a recolha dos dados procedeu-se à leitura óptica dos questionários, sendo os dados posteriormente exportados para SPSS permitindo assim o tratamento dos mesmos. Para análise estatística utilizou-se o teste do qui-quadrado considerando o nível de significância p <0,05. Resultados: Verificou-se que 53,7% dos inquiridos recorre terapeuticamente a PAM´s que inclui principalmente o uso de cidreira e camomila enquanto 33,8% faz uso de medicamentos e/ou produtos àbase de plantas nomeadamente Valdispert e Daflon. A utilização de PAM,s é motivada por autoconhecimento e indicação de familiares, amigos e vizinhos. Já os medicamentos e/ou produtos à base de plantas são utilizados maioritariamente por prescrição médica e indicação na farmácia. A ocorrência de efeitos indesejáveis foi sentida unicamente com a utilização de PAM´s e em pequena escala. Conclusão: O recurso a este tipo de produtos é uma prática bastante comum entre os moradores do concelho de Bragança, que utilizam uma grande diversidade de plantas e produtos à base de plantas para um variado leque de indicações terapêuticas, apontando a percentagem de respostas para um conhecimento dos seus efeitos terapêuticos.

New ultrasonic-based methods in proteomics

Dissertação apresentada para obtenção do Grau de Doutor em Bioquímica pela Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia.A presente dissertação foi preparada no âmbito do convénio bilateral existente entre a Universidade Nova de Lisboa e a Universidade de Vigo.

Resistência ao fogo de alvenarias sem função estrutural

Um incêndio é algo difícil de prever, assim como a sua consequência nos elementos de construção. Dessa forma, ao longo das últimas décadas, os elementos de construção têm sido alvo de diversos estudos a fim de avaliar os seus comportamentos quando solicitados em situação de incêndio. O International Building Code (IBC) descreve um método de cálculo analítico para a determinação da resistência ao fogo dos elementos da construção de acordo com os procedimentos de teste estabelecidos na ASTM E119 (Standard Test Methods for Fire Tests of Building Construction and Materials). Nesta dissertação foi feita uma análise desse método, que se mostrou inadequado para estimar a resistência ao fogo das alvenarias, sem função estrutural, de blocos cerâmicos e blocos de betão, uma vez que despreza qualquer efeito do ar no interior das mesmas. No seguimento desta análise, é apresentado um desenvolvimento do método descrito tendo em conta o efeito do ar. Depois de uma análise aos vários tipos de blocos cerâmicos e de betão com diferentes dimensões e geometrias foi possível obter uma relação entre a espessura equivalente de ar existente num bloco e a sua respectiva resistência ao fogo, de modo a serem obtidos os valores descritos na normalização existente. O efeito do ar mostrou ter uma maior influência na resistência ao fogo nas alvenarias constituídas por blocos cerâmicos de furação vertical, já que a sua geometria caracterizada por um elevado número de pequenos alvéolos contribui para o aumento do isolamento térmico, e consequentemente da sua resistência ao fogo. Nas alvenarias rebocadas os valores da resistência ao fogo aumentam cerca de 50%, quando revestidos com argamassa de cimento, e 70% quando revestidos com gesso, logo, o emprego de revestimentos representam uma boa alternativa para aumentar a resistência ao fogo.

Using data mining techniques to support breast cancer diagnosis

More than ever, there is an increase of the number of decision support methods and computer aided diagnostic systems applied to various areas of medicine. In breast cancer research, many works have been done in order to reduce false-positives when used as a double reading method. In this study, we aimed to present a set of data mining techniques that were applied to approach a decision support system in the area of breast cancer diagnosis. This method is geared to assist clinical practice in identifying mammographic findings such as microcalcifications, masses and even normal tissues, in order to avoid misdiagnosis. In this work a reliable database was used, with 410 images from about 115 patients, containing previous reviews performed by radiologists as microcalcifications, masses and also normal tissue findings. Throughout this work, two feature extraction techniques were used: the gray level co-occurrence matrix and the gray level run length matrix. For classification purposes, we considered various scenarios according to different distinct patterns of injuries and several classifiers in order to distinguish the best performance in each case described. The many classifiers used were Naïve Bayes, Support Vector Machines, k-nearest Neighbors and Decision Trees (J48 and Random Forests). The results in distinguishing mammographic findings revealed great percentages of PPV and very good accuracy values. Furthermore, it also presented other related results of classification of breast density and BI-RADS® scale. The best predictive method found for all tested groups was the Random Forest classifier, and the best performance has been achieved through the distinction of microcalcifications. The conclusions based on the several tested scenarios represent a new perspective in breast cancer diagnosis using data mining techniques.