On lattices from combinatorial game theory modularity and a representation theorem: finite case

We show that a self-generated set of combinatorial games, S. may not be hereditarily closed but, strong self-generation and hereditary closure are equivalent in the universe of short games. In [13], the question "Is there a set which will give a non-distributive but modular lattice?" appears. A useful necessary condition for the existence of a finite non-distributive modular L(S) is proved. We show the existence of S such that L(S) is modular and not distributive, exhibiting the first known example. More, we prove a Representation Theorem with Games that allows the generation of all finite lattices in game context. Finally, a computational tool for drawing lattices of games is presented. (C) 2014 Elsevier B.V. All rights reserved.

Some bounds of loss in classical semideterministic immunization

Since Samuelson, Redington and Fisher and Weil, duration and immunization are very important topics in bond portfolio analysis from both a theoretical and a practical point of view. Many results have been established, especially in semi-deterministic framework. As regards, however, the loss may be sustained, we do not think that the subject has been investigated enough, except for the results found in the wake of the theorem of Fong and Vasicek. In this paper we present some results relating to the limitation of the loss in the case of local immunization for multiple liabilities.

Subunits of the chaperonin CCT are associated with Tetrahymena microtubule structures and are involved in cilia biogenesis

The cytosolic chaperonin CCT is a heterooligomeric complex of about 900 kDa that mediates the folding of cytoskeletal proteins. We observed by indirect immunofluorescence that the Tetrahymena TpCCTalpha, TpCCTdelta, TpCCTepsilon, and TpCCTeta-subunits colocalize with tubulin in cilia, basal bodies, oral apparatus, and contractile vacuole pores. TpCCT-subunits localization was affected during reciliation. These findings combined with atomic force microscopy measurements in reciliating cells indicate that these proteins play a role during cilia biogenesis related to microtubule nucleation, tubulin transport, and/or axoneme assembly. The TpCCT-subunits were also found to be associated with cortex and cytoplasmic microtubules suggesting that they can act as microtubule-associated proteins. The TpCCTdelta being the only subunit found associated with the macronuclear envelope indicates that it has functions outside of the 900 kDa complex. Tetrahymena cytoplasm contains granular/globular-structures of TpCCT-subunits in close association with microtubule arrays. Studies of reciliation and with cycloheximide suggest that these structures may be sites of translation and folding. Combined biochemical techniques revealed that reciliation affects the oligomeric state of TpCCT-subunits being tubulin preferentially associated with smaller CCT oligomeric species in early stages of reciliation. Collectively, these findings indicate that the oligomeric state of CCT-subunits reflects the translation capacity of the cell and microtubules integrity.

Optimização do posicionamento de câmaras de vídeo-vigilância

Dissertação de Mestrado em Engenharia de Redes de Comunicação e Multimédia

Análise de ciclo de vida de duas soluções de ETICS

Dissertação de natureza científica para obtenção do grau de mestre em Engenharia Civil

Automatic diagnosis of liver steatosis by ultrasound using autoregressive tissue characterization

Liver steatosis is mainly a textural abnormality of the hepatic parenchyma due to fat accumulation on the hepatic vesicles. Today, the assessment is subjectively performed by visual inspection. Here a classifier based on features extracted from ultrasound (US) images is described for the automatic diagnostic of this phatology. The proposed algorithm estimates the original ultrasound radio-frequency (RF) envelope signal from which the noiseless anatomic information and the textural information encoded in the speckle noise is extracted. The features characterizing the textural information are the coefficients of the first order autoregressive model that describes the speckle field. A binary Bayesian classifier was implemented and the Bayes factor was calculated. The classification has revealed an overall accuracy of 100%. The Bayes factor could be helpful in the graphical display of the quantitative results for diagnosis purposes.

Projecto de verificação do comportamento térmico de um edifício de habitação: análise e comparação de resultados obtidos com recurso a duas ferramentas de cálculo

O trabalho de projecto desenvolvido tem por objectivo a análise dos resultados obtidos na verificação térmica de edifícios aquando da utilização de programas de cálculo automático. Para o efeito, foram escolhidos dois edifícios unifamiliares com características distintas, tentando que fossem abrangidas o máximo de situações diferentes. Neste projecto foram avaliados sobretudo dois aspectos: quantificação das áreas e desenvolvimentos dos elementos da envolvente dos edifícios em estudo e cálculo dos coeficientes de transmissão térmica superficial e linear dos elementos construtivos. Com base neste trabalho, pode-se promover uma melhoria dos programas de cálculo automático no mercado, de modo a assegurar uma maior qualidade dos projectos de edifícios e consequente reflexo na qualidade da construção civil futura. Por último, apresentam-se as conclusões e possibilidades de desenvolvimento de trabalhos futuros.

An efficient scalable RNS architecture for large dynamic ranges

This paper proposes an efficient scalable Residue Number System (RNS) architecture supporting moduli sets with an arbitrary number of channels, allowing to achieve larger dynamic range and a higher level of parallelism. The proposed architecture allows the forward and reverse RNS conversion, by reusing the arithmetic channel units. The arithmetic operations supported at the channel level include addition, subtraction, and multiplication with accumulation capability. For the reverse conversion two algorithms are considered, one based on the Chinese Remainder Theorem and the other one on Mixed-Radix-Conversion, leading to implementations optimized for delay and required circuit area. With the proposed architecture a complete and compact RNS platform is achieved. Experimental results suggest gains of 17 % in the delay in the arithmetic operations, with an area reduction of 23 % regarding the RNS state of the art. When compared with a binary system the proposed architecture allows to perform the same computation 20 times faster alongside with only 10 % of the circuit area resources.

Partial classification of Lorenz knots: Syllable permutations of torus knots words

We define families of aperiodic words associated to Lorenz knots that arise naturally as syllable permutations of symbolic words corresponding to torus knots. An algorithm to construct symbolic words of satellite Lorenz knots is defined. We prove, subject to the validity of a previous conjecture, that Lorenz knots coded by some of these families of words are hyperbolic, by showing that they are neither satellites nor torus knots and making use of Thurston's theorem. Infinite families of hyperbolic Lorenz knots are generated in this way, to our knowledge, for the first time. The techniques used can be generalized to study other families of Lorenz knots.