The discovery of three lost ‘Salting’ carpets: science as a tool for revealing their history

Thesis presented at the Faculdade de Ciências e Tecnologia, Universidade Nova de Lisboa, to obtain a Master degree in Conservation and Restoration,Specialization in Textiles

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.

ISO 14001:2015: An Improved Tool for Sustainability

ISO 14001 is an International Standard of worldwide acceptance based on the concept that better environmental performance can be achieved when environmental aspects are systematically identified and managed giving a major contribution to Sustainability, through pollution prevention, improved environmental performance and complying with applicable laws. This paper aims to discuss the Sustainability approach through the use of Environmental Management Standards (EMS), the results achieved by organizations that implement and certify those EMS and a special focus on the current process of ISO 14001:2015 revision and the logic behind it.

Group decision making for selection of an information system in a business context

The main objective of this work is to report on the development of a multi-criteria methodology to support the assessment and selection of an Information System (IS) framework in a business context. The objective is to select a technological partner that provides the engine to be the basis for the development of a customized application for shrinkage reduction on the supply chains management. Furthermore, the proposed methodology di ers from most of the ones previously proposed in the sense that 1) it provides the decision makers with a set of pre-defined criteria along with their description and suggestions on how to measure them and 2)it uses a continuous scale with two reference levels and thus no normalization of the valuations is required. The methodology here proposed is has been designed to be easy to understand and use, without a specific support of a decision making analyst.

Ambientes Tridimensionais Sonoros

O estado emocional de um individuo tem um papel importante na realização de determinada tarefa, ou conjunto de tarefas, na medida em que pode influenciar o bom desempenho na realização destas. O ser humano pode sentir diversas emoções e, conjugadas, resultam em inúmeros estados emocionais. A música pode influenciar o nosso estado emocional, mesmo de uma forma inconsciente. Por isso ouvimos música enquanto realizamos várias tarefas. O foco desta dissertação consistiu na criação de uma ferramenta multimédia – EMOCUBE (emotion cube – caixa de emoções) que, através da música, contribuísse para o sucesso da realização de determinada tarefa/situação. A cada situação é atribuído um estado emocional, que influenciará a seleção das músicas sugeridas ao ouvinte. Os resultados da avaliação efetuada sobre a aplicação foram, de uma forma geral, positivos e salientaram a originalidade da ideia deste projeto. Com o desenvolvimento desta aplicação, abriram-se portas para novos projetos e possíveis parcerias com ferramentas e aplicações já existentes no mercado.

A satisfação dos trabalhadores com as práticas de gestão de recursos humanos: o caso de uma Instituição do Ensino Superior Público em Portugal

Este estudo tem como objetivos: (1) conhecer as práticas desenvolvidas numa organização do Ensino Superior Público Português; (2) conhecer a tipologia das práticas de GRH de cariz tradicional e de cariz estratégico; (3) perceber em que medida as práticas de GRH estão relacionadas com a área de qualificação dos responsáveis do departamento de RH; (4) averiguar o grau de satisfação que os trabalhadores sentem com as Práticas de Gestão de Recursos Humanos desenvolvidas e a sua relação com a área de qualificação dos responsáveis do departamento de RH. Foi utilizada uma metodologia mista, que possibilita ampliar a obtenção de resultados em abordagens investigativas, proporcionando ganhos relevantes para a pesquisa. É realizado um primeiro estudo exploratório, que utiliza uma metodologia mista quantitativa e qualitativa, com recurso a uma entrevista semiestruturada e inquérito realizados aos responsáveis de RH, e que tem como objetivos identificar e caracterizar as Práticas de GRH vigentes na Organização e, consequentemente, averiguar se se aproximam das designadas na literatura, assim como averiguar o grau de intervenção do DRH no desenvolvimento das PGRH e caraterizar o perfil do responsável de RH na Organização, averiguando se a área de formação de RH influencia as Práticas de GRH desenvolvidas. No segundo estudo, recorremos a uma metodologia quantitativa com recurso ao inquérito por questionário, aplicado aos trabalhadores que exercem funções a tempo integral, para averiguar o grau de satisfação dos trabalhadores em relação às Práticas de Gestão de Recursos Humanos. Na compilação dos dois estudos foi nosso objetivo obter respostas às questões que orientaram a nossa investigação. Na parte final da dissertação são discutidos os principais resultados obtidos e apresentadas as conclusões do estudo aqui levado a cabo. Os resultados sugerem que: 1) as PGRH existentes são essencialmente de cariz tradicional, em especial a gestão administrativa; 2) as PGRH predominantes são: o Planeamento de Recursos Humanos, a Análise e Descrição de Funções, o Recrutamento e Seleção, a Formação e Desenvolvimento, a Gestão Administrativa, a Comunicação e a Partilha de Informação, Ética e Deontologia e o Estatuto Disciplinar; 3) existe pouco recurso ao outsourcing para as PGRH; 4) o grau de intervenção DRH baseia-se em atividades de cariz mais administrativo; 5) as práticas tradicionais de RH são aquelas que requerem mais tempo ao DRH; 6) não existe relação entre o tipo de PGRH e a área de qualificação do responsável do DRH; 7) as PGRH são realizadas seguindo essencialmente as normas legais e regras rígidas da GRH na AP; 8) algumas PGRH não são entendidas em contexto da AP, como importantes pelos gestores, embora já sejam desenvolvidos alguns procedimentos dessas práticas; 9) a PGRH da formação e desenvolvimento não é corretamente desenvolvida e não dá cumprimento ao estipulado na lei; 10) a gestão de carreiras e o sistema de compensação e recompensas são entendidas como inexistentes, porque não existem promoções e progressões desde 2005; 11) a avaliação do desempenho é um sistema burocrático e ritualista com fins de promoção e compensação, sem efeitos práticos no momento atual, e que causa insatisfação e o sentimento de injustiça; 12) existem problemas de comunicação quanto a partilha e uniformização de procedimentos entre UO; 13) a satisfação dos trabalhadores é maior com as PGRH de tipo tradicional, nomeadamente na gestão administrativa, recrutamento e seleção, análise e descrição de funções, acolhimento, integração e socialização 14) a satisfação é menor na gestão de carreiras, no sistema de compensação e recompensas e na avaliação do desempenho; 15) quanto a relação entre o grau de satisfação e as características sócio demográficas e profissionais dos inquiridos, os casos com significância mostram que os trabalhadores com 10 ou mais anos de antiguidade tendem a sentir mais satisfação com as práticas em GRH; 16) existe mais satisfação dos trabalhadores das UO onde o responsável de DRH possui formação na área de RH.

Microencapsulation technology: a powerful tool for human embryonic stem cells expansion and cryopreservation

Dissertation presented to obtain a Master degree in Biotechnology at the Universidade Nova de Lisboa, Faculdade de Ciências e Tecnologia

Expatriates recruitment and selection for long-term international assignments in portuguese companies

Long-term international assignments’ increase requires more attention being paid for the preparation of these foreign assignments, especially on the recruitment and selection process of expatriates. This article explores how the recruitment and selection process of expatriates is developed in Portuguese companies, examining the main criteria on recruitment and selection of expatriates’ decision to send international assignments. The paper is based on qualitative case studies of companies located in Portugal. The data were collected through semi-structured interviews of 42 expatriates and 18 organisational representatives as well from nine Portuguese companies. The findings show that the most important criteria are: (1) trust from managers, (2) years in service, (3) previous technical and language competences, (4) organisational knowledge and, (5) availability. Based on the findings, the article discusses in detail the main theoretical and managerial implications. Suggestions for further research are also presented.

China's space program : a new tool for PRC "soft power" in international relations?

When China launched an anti-satellite (ASAT) weapon in January 2007 to destroy one of its inactive weather satellites, most reactions from academics and U.S. space experts focused on a potential military “space race” between the United States and China. Overlooked, however, is China’s growing role as global competitor on the non-military side of space. China’s space program goes far beyond military counterspace applications and manifests manned space aspirations, including lunar exploration. Its pursuit of both commercial and scientific international space ventures constitutes a small, yet growing, percentage of the global space launch and related satellite service industry. It also highlights China’s willingness to cooperate with nations far away from Asia for political and strategic purposes. These partnerships may constitute a challenge to the United States and enhance China’s “soft power” among key American allies and even in some regions traditionally dominated by U.S. influence (e.g., Latin America and Africa). Thus, an appropriate U.S. response may not lie in a “hard power” counterspace effort but instead in a revival of U.S. space outreach of the past, as well as implementation of more business-friendly export control policies.

Decision support tool for Virtual Power Players: Hybrid Particle Swarm Optimization applied to Day-ahead Vehicle-To-Grid Scheduling

This paper presents a decision support tool methodology to help virtual power players (VPPs) in the Smart Grid (SGs) context to solve the day-ahead energy resource scheduling considering the intensive use of Distributed Generation (DG) and Vehicle-To-Grid (V2G). The main focus is the application of a new hybrid method combing a particle swarm approach and a deterministic technique based on mixedinteger linear programming (MILP) to solve the day-ahead scheduling minimizing total operation costs from the aggregator point of view. A realistic mathematical formulation, considering the electric network constraints and V2G charging and discharging efficiencies is presented. Full AC power flow calculation is included in the hybrid method to allow taking into account the network constraints. A case study with a 33-bus distribution network and 1800 V2G resources is used to illustrate the performance of the proposed method.

Data Extraction Tool to Analyse, Transform and Store Real Data from Electricity Markets

The study of electricity markets operation has been gaining an increasing importance in the last years, as result of the new challenges that the restructuring process produced. Currently, lots of information concerning electricity markets is available, as market operators provide, after a period of confidentiality, data regarding market proposals and transactions. These data can be used as source of knowledge to define realistic scenarios, which are essential for understanding and forecast electricity markets behavior. The development of tools able to extract, transform, store and dynamically update data, is of great importance to go a step further into the comprehension of electricity markets and of the behaviour of the involved entities. In this paper an adaptable tool capable of downloading, parsing and storing data from market operators’ websites is presented, assuring constant updating and reliability of the stored data.

An automatic tool to Extract, Transform and Load data from real electricity markets

The study of Electricity Markets operation has been gaining an increasing importance in the last years, as result of the new challenges that the restructuring produced. Currently, lots of information concerning Electricity Markets is available, as market operators provide, after a period of confidentiality, data regarding market proposals and transactions. These data can be used as source of knowledge, to define realistic scenarios, essential for understanding and forecast Electricity Markets behaviour. The development of tools able to extract, transform, store and dynamically update data, is of great importance to go a step further into the comprehension of Electricity Markets and the behaviour of the involved entities. In this paper we present an adaptable tool capable of downloading, parsing and storing data from market operators’ websites, assuring actualization and reliability of stored data.

Load Profiling Tool to Support Smart Grid Operation Scenarios

This paper presents the characterization of high voltage (HV) electric power consumers based on a data clustering approach. The typical load profiles (TLP) are obtained selecting the best partition of a power consumption database among a pool of data partitions produced by several clustering algorithms. The choice of the best partition is supported using several cluster validity indices. The proposed data-mining (DM) based methodology, that includes all steps presented in the process of knowledge discovery in databases (KDD), presents an automatic data treatment application in order to preprocess the initial database in an automatic way, allowing time saving and better accuracy during this phase. These methods are intended to be used in a smart grid environment to extract useful knowledge about customers’ consumption behavior. To validate our approach, a case study with a real database of 185 HV consumers was used.

Environmental performance policy indicators for the public sector: The case of the defence sector

Journal of Environmental Management, nº 82 p. 410–432