Hyperspectral unmixing based on mixtures of Dirichlet components

This paper introduces a new unsupervised hyperspectral unmixing method conceived to linear but highly mixed hyperspectral data sets, in which the simplex of minimum volume, usually estimated by the purely geometrically based algorithms, is far way from the true simplex associated with the endmembers. The proposed method, an extension of our previous studies, resorts to the statistical framework. The abundance fraction prior is a mixture of Dirichlet densities, thus automatically enforcing the constraints on the abundance fractions imposed by the acquisition process, namely, nonnegativity and sum-to-one. A cyclic minimization algorithm is developed where the following are observed: 1) The number of Dirichlet modes is inferred based on the minimum description length principle; 2) a generalized expectation maximization algorithm is derived to infer the model parameters; and 3) a sequence of augmented Lagrangian-based optimizations is used to compute the signatures of the endmembers. Experiments on simulated and real data are presented to show the effectiveness of the proposed algorithm in unmixing problems beyond the reach of the geometrically based state-of-the-art competitors.

Spectral and weak polynomial completeness for the product of nonsingular matrices

Let F be a field with at least four elements. In this paper, we identify all the pairs (A, B) of n x n nonsingular matrices over F, satisfying the following property: for every monic polynomial f (x) = x(n) + a(n-1)x(n-1) +... + a(1)x + a(0) over F, with a root in F and a(0) = (-1)(n) det(AB), there are nonsingular matrices X, Y is an element of F-nxn such that XAX(-1)Y BY-1 has characteristic polynomial f (x).

Práticas de contabilidade e controlo de gestão no setor automóvel

Dissertação apresentada para obtenção do Grau de Mestre em Contabilidade e Finanças, sob orientação de: Amélia Ferreira da Silva José António Fernandes Lopes Oliveira Vale

Weakly spectrally complete pair of matrices

Let and be matrices over an algebraically closed field. Let be elements of such that and . We give necessary and sufficient condition for the existence of matrices and similar to and, respectively, such that has eigenvalues.

Automatic musical instrument recognition for multimedia indexing

Trabalho apresentado no âmbito do Mestrado em Engenharia Informática, como requisito parcial para obtenção do grau de Mestre em Engenharia Informática

Recommending media content based on machine learning methods

Dissertação para obtenção do Grau de Mestre em Engenharia Informática

Desenvolvimento da fluência no cálculo mental através do uso de estratégias de cálculo: um estudo no 4.º e no 6.º ano de escolaridade

Relatório de estágio de mestrado em Ensino do 1º e 2º Ciclo do Ensino Básico

Abordagem histórica e institucional da mudança em contabilidade de gestão: o caso da normalização nos hospitais públicos portugueses

A teoria institucional constituiu o enquadramento no qual foi suportada a pergunta geral desta investigação: como e porquê a Normalização da Contabilidade de Gestão (NCG) nos hospitais públicos portugueses surgiu e evoluiu? O objetivo geral foi compreender de forma profunda o surgimento e a mudança nas regras de NCG dos hospitais públicos portugueses no período histórico 1954-2011. Face ao enquadramento institucional que justificou uma investigação interpretativa, foi usado como método de investigação um estudo de caso explanatório. A evidência sobre o caso da NCG nos hospitais públicos portugueses foi recolhida em documentos e através de 58 entrevistas realizadas em 47 unidades de análise (nos serviços centrais de contabilidade do Ministério da Saúde e em 46 hospitais públicos, num total de 53 existentes). Quanto aos principais resultados obtidos, no período 1954-1974, as regras criadas pelo poder político para controlo dos gastos públicos e a contabilidade orçamental de base de caixa estiveram na génese dos primeiros conceitos de Contabilidade de Gestão (CG) para os serviços públicos de saúde portugueses. A transição de um regime ditatorial para um regime democrático (25 de Abril de 1974), a criação do Plano Oficial de Contabilidade (POC/77) e a implementação de um estado social com Serviço Nacional de Saúde (SNS) criaram a conjuntura crítica necessária para o surgimento de um Plano Oficial de Contabilidade para os Serviços de Saúde (POCSS/80) que incluiu regras de CG. A primeira edição do Plano de Contabilidade Analítica dos Hospitais (PCAH), aprovada em 1996, não foi uma construção de raiz, mas antes uma adaptação para os hospitais das regras de CG incluídas no POCSS/91 que havia revisto o POCSS/80. Após o início da implementação do PCAH, em 1998, ocorreram sequências de autorreforço institucionalizadoras destas normas, no período 1998-2011, por influência de pressões isomórficas coercivas que delinearam um processo de evolução incremental cujo resultado foi uma reprodução por adaptação, num contexto de dependência de recursos. Vários agentes internos e externos pressionaram, no período 2003-2011, através de sequências reativas para a desinstitucionalização do PCAH em resposta ao persistente fenómeno de loose coupling. Mas o PCAH só foi descontinuado nos hospitais com privatização da governação e rejeição dos anteriores sistemas de informação. Ao nível da extensão da teoria, este estudo de caso adotou o institucionalismo histórico na investigação em CG, quanto se sabe pela primeira vez, que se mostra útil na interpretação dos processos e dos resultados da criação e evolução de instituições de CG num determinado contexto histórico. Na condição de dependência de recursos, as sequências de autorreforço, via isomorfismo coercivo, tendem para uma institucionalização com fenómeno de loose coupling. Como resposta a este fenómeno, ocorrem sequências reativas no sentido da desinstitucionalização. Perante as pressões (políticas, funcionais, sociais e tecnológicas) desinstitucionalizadoras, o fator governação privada acelera o processo de desinstitucionalização, enquanto o fator governação pública impede ou abranda esse processo.

New integrative computational approaches unveil the Saccharomyces cerevisiae pheno-metabolomic fermentative profile and allow strain selection for winemaking

During must fermentation by Saccharomyces cerevisiae strains thousands of volatile aroma compounds are formed. The objective of the present work was to adapt computational approaches to analyze pheno-metabolomic diversity of a S. cerevisiae strain collection with different origins. Phenotypic and genetic characterization together with individual must fermentations were performed, and metabolites relevant to aromatic profiles were determined. Experimental results were projected onto a common coordinates system, revealing 17 statistical-relevant multi-dimensional modules, combining sets of most-correlated features of noteworthy biological importance. The present method allowed, as a breakthrough, to combine genetic, phenotypic and metabolomic data, which has not been possible so far due to difficulties in comparing different types of data. Therefore, the proposed computational approach revealed as successful to shed light into the holistic characterization of S. cerevisiae pheno-metabolome in must fermentative conditions. This will allow the identification of combined relevant features with application in selection of good winemaking strains.

Infinite index subgroups and finiteness properties of intersections of geometrically finite groups

We explore which types of finiteness properties are possible for intersections of geometrically finite groups of isometries in negatively curved symmetric rank one spaces. Our main tool is a twist construction which takes as input a geometrically finite group containing a normal subgroup of infinite index with given finiteness properties and infinite Abelian quotient, and produces a pair of geometrically finite groups whose intersection is isomorphic to the normal subgroup.

New FFT/IFFT Factorizations with Regular Interconnection Pattern Stage-to-Stage Subblocks

Les factoritzacions de la FFT (Fast Fourier Transform) que presenten un patró d’interconnexió regular entre factors o etapes son conegudes com algorismes paral·lels, o algorismes de Pease, ja que foren originalment proposats per Pease. En aquesta contribució s’han desenvolupat noves factoritzacions amb blocs que presenten el patró d’interconnexió regular de Pease. S’ha mostrat com aquests blocs poden ser obtinguts a una escala prèviament seleccionada. Les noves factoritzacions per ambdues FFT i IFFT (Inverse FFT) tenen dues classes de factors: uns pocs factors del tipus Cooley-Tukey i els nous factors que proporcionen la mateix patró d’interconnexió de Pease en blocs. Per a una factorització donada, els blocs comparteixen dimensions, el patró d’interconnexió etapa a etapa i a més cada un d’ells pot ser calculat independentment dels altres.

On the trace of an endofunctor of a small category

The trace of a square matrix can be defined by a universal property which, appropriately generalized yields the concept of "trace of an endofunctor of a small category". We review the basic definitions of this general concept and give a new construction, the "pretrace category", which allows us to obtain the trace of an endofunctor of a small category as the set of connected components of its pretrace. We show that this pretrace construction determines a finite-product preserving endofunctor of the category of small categories, and we deduce from this that the trace inherits any finite-product algebraic structure that the original category may have. We apply our results to several examples from Representation Theory obtaining a new (indirect) proof of the fact that two finite dimensional linear representations of a finite group are isomorphic if and only if they have the same character.

The Inflation Bias under Calvo and Rotemberg Pricing.

New Keynesian models rely heavily on two workhorse models of nominal inertia - price contracts of random duration (Calvo, 1983) and price adjustment costs (Rotemberg, 1982) - to generate a meaningful role for monetary policy. These alternative descriptions of price stickiness are often used interchangeably since, to a first order of approximation they imply an isomorphic Phillips curve and, if the steady-state is efficient, identical objectives for the policy maker and as a result in an LQ framework, the same policy conclusions. In this paper we compute time-consistent optimal monetary policy in bench-mark New Keynesian models containing each form of price stickiness. Using global solution techniques we find that the inflation bias problem under Calvo contracts is significantly greater than under Rotemberg pricing, despite the fact that the former typically significant exhibits far greater welfare costs of inflation. The rates of inflation observed under this policy are non-trivial and suggest that the model can comfortably generate the rates of inflation at which the problematic issues highlighted in the trend inflation literature emerge, as well as the movements in trend inflation emphasized in empirical studies of the evolution of inflation. Finally, we consider the response to cost push shocks across both models and find these can also be significantly different. The choice of which form of nominal inertia to adopt is not innocuous.

A new look at the Heston characteristic function

A new expression for the characteristic function of log-spot in Heston model is presented. This expression more clearly exhibits its properties as an analytic characteristic function and allows us to compute the exact domain of the moment generating function. This result is then applied to the volatility smile at extreme strikes and to the control of the moments of spot. We also give a factorization of the moment generating function as product of Bessel type factors, and an approximating sequence to the law of log-spot is deduced.

An algebraic operator approach to the analysis of Gerber-Shiu functions

We introduce an algebraic operator framework to study discounted penalty functions in renewal risk models. For inter-arrival and claim size distributions with rational Laplace transform, the usual integral equation is transformed into a boundary value problem, which is solved by symbolic techniques. The factorization of the differential operator can be lifted to the level of boundary value problems, amounting to iteratively solving first-order problems. This leads to an explicit expression for the Gerber-Shiu function in terms of the penalty function.