A 5GHz1.8V Low Power CMOS Low-Noise Amplifier

Wireless local-area networks (WLANs) have been deployed as office and home communications infrastructures worldwide. The diversification of the standards, such as IEEE 802.11 series demands the design of RF front-ends. Low power consumption is one of the most important design concerns in the application of those technologies. To maintain competitive hardware costs, CMOS has been used since it is the best solution for low cost and high integration processing, allowing analog circuits to be mixed with digital ones. In the receiver chain, the low noise amplifier (LNA) is one of the most critical blocks in a transceiver design. The sensitivity is mainly determined by the LNA noise figure and gain. It interfaces with the pre-select filter and the mixer. Furthermore, since it is the first gain stage, care must be taken to provide accurate input match, low-noise figure, good linearity and a sufficient gain over a wide band of operation. Several CMOS LNAs have been reported during the last decade, showing that the most research has been done at 802.11/b and GSM standards (900-2400MHz spectrum) and more recently at 802.11/a (5GHz band). One of the more significant disadvantages of 802.11/b is that the frequency band is crowded and subject to interference from other technologies, as is 2.4GHz cordless phones and Bluetooth. As the demand for radio-frequency integrated circuits, operating at higher frequency bands, increases, the IEEE 802.11/a standard becomes a very attractive option to wireless communication system developers. This paper presents the design and implementation of a low power, low noise amplifier aimed at IEEE 802.11a for WLAN applications. It was designed to be integrated with an active balun and mixer, representing the first step toward a fully integrated monolithic WLAN receiver. All the required circuits are integrated at the same die and are powered by 1.8V supply source. Preliminary experimental results (S-parameters) are shown and promise excellent results. The LNA circuit design details are illustrated in Section 2. Spectre simulation results focused at gain, noise figure (NF) and input/output matching are presented in Section 3. Finally, conclusions and comparison with other recently reported LNAs are made in Section 4, followed by future work.

The usefulness of ultrasound in the classification of chronic liver disease

Chronic Liver Disease is a progressive, most of the time asymptomatic, and potentially fatal disease. In this paper, a semi-automatic procedure to stage this disease is proposed based on ultrasound liver images, clinical and laboratorial data. In the core of the algorithm two classifiers are used: a k nearest neighbor and a Support Vector Machine, with different kernels. The classifiers were trained with the proposed multi-modal feature set and the results obtained were compared with the laboratorial and clinical feature set. The results showed that using ultrasound based features, in association with laboratorial and clinical features, improve the classification accuracy. The support vector machine, polynomial kernel, outperformed the others classifiers in every class studied. For the Normal class we achieved 100% accuracy, for the chronic hepatitis with cirrhosis 73.08%, for compensated cirrhosis 59.26% and for decompensated cirrhosis 91.67%.

Avaliação experimental do comportamento dinâmico de um edifício do século XIX: aplicação à calibração de modelos numéricos

Trabalho de Dissertação de natureza científica para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Estruturas

Estudo numérico e experimental sobre o comportamento dinâmico de um edifício

Dissertação para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Estruturas

Modelos de simulação em MATSim aplicados à análise de sistemas de transporte

Dissertação para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização de Vias de Comunicação e Transportes

e-Recruitment: descrição e inferência sobre oferta e procura

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Informática e de Computadores

Estratégias de comunicação interna

Dissertação apresentada ao Instituto Superior de Contabilidade e Administração do Porto para obtenção do Grau de Mestre em Assessoria de Administração Orientada pela professora Arminda Sá Sequeira

Cause-specific mortality and income inequality in São Paulo, Brazil

OBJECTIVE: To analyze cause-specific mortality rates according to the relative income hypothesis. METHODS: All 96 administrative areas of the city of São Paulo, southeastern Brazil, were divided into two groups based on the Gini coefficient of income inequality: high (>0.25) and low (<0.25). The propensity score matching method was applied to control for confounders associated with socioeconomic differences among areas. RESULTS: The difference between high and low income inequality areas was statistically significant for homicide (8.57 per 10,000; 95%CI: 2.60;14.53); ischemic heart disease (5.47 per 10,000 [95%CI 0.76;10.17]); HIV/AIDS (3.58 per 10,000 [95%CI 0.58;6.57]); and respiratory diseases (3.56 per 10,000 [95%CI 0.18;6.94]). The ten most common causes of death accounted for 72.30% of the mortality difference. Infant mortality also had significantly higher age-adjusted rates in high inequality areas (2.80 per 10,000 [95%CI 0.86;4.74]), as well as among males (27.37 per 10,000 [95%CI 6.19;48.55]) and females (15.07 per 10,000 [95%CI 3.65;26.48]). CONCLUSIONS: The study results support the relative income hypothesis. After propensity score matching cause-specific mortality rates was higher in more unequal areas. Studies on income inequality in smaller areas should take proper accounting of heterogeneity of social and demographic characteristics.

Reconhecimento de língua gestual

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Informática e Computadores

Seguimento de pessoas em sistemas multi-câmara

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia de Redes de Comunicação e Multimédia

Projeto de fundações e estrutura de colégio em Ponta Delgada utilizando os eurocódigos estruturais

Trabalho de Projeto para obtenção do grau de Mestre em Engenharia Civil na Área de Especialização em Estruturas

Relatório de estágio

I (Prática Pedagógica) - O estágio foi realizado na Academia de Música de Almada (AMA) com três alunos de níveis diferentes: Aluno x, Iniciação Musical; Aluna y, 2º grau; e Aluna z, 5º grau. A planificação do trabalho foi feita com a colaboração do professor Vasco Broco e sob a supervisão do professor Pedro Saglimbeni Muñoz, tendo por base o programa da AMA e procurando corresponder às necessidades individuais de cada aluno, bem como respeitar os diferentes ritmos de aprendizagem. Dadas as diferenças de idade e de nível, os objectivos que procurei atingir com cada aluno durante o ano lectivo são naturalmente díspares, bem como a perspectiva de cada um em relação ao próprio instrumento e ao ensino da música. Enquanto que os mais novos encaram a aprendizagem musical como uma actividade meramente recreativa, pelo menos por enquanto, a Aluna z ambiciona fazer uma carreira como instrumentista. Mesmo entre os mais novos há diferenças, pois apesar de o Aluno x ainda estar a frequentar a Iniciação Musical, já iniciou a sua aprendizagem há mais tempo do que a Aluna y, encarando o ensino com mais seriedade. A AMA tem a vantagem de ter um pianista acompanhador disponível para cada dia da semana, o que tornou possível desenvolver um trabalho consistente com os alunos em termos de ensaios e audições. As audições e momentos de avaliação foram marcados em reuniões de Departamento Curricular, à excepção da calendarização das Provas Globais que foi feita em reunião de Conselho Pedagógico. O aproveitamento foi positivo para os três alunos no final do estágio, tendo todos transitado para o nível de ensino seguinte.

Preemption-light multiprocessor scheduling of sporadic tasks with high utilisation bound

Known algorithms capable of scheduling implicit-deadline sporadic tasks over identical processors at up to 100% utilisation invariably involve numerous preemptions and migrations. To the challenge of devising a scheduling scheme with as few preemptions and migrations as possible, for a given guaranteed utilisation bound, we respond with the algorithm NPS-F. It is configurable with a parameter, trading off guaranteed schedulable utilisation (up to 100%) vs preemptions. For any possible configuration, NPS-F introduces fewer preemptions than any other known algorithm matching its utilisation bound. A clustered variant of the algorithm, for systems made of multicore chips, eliminates (costly) off-chip task migrations, by dividing processors into disjoint clusters, formed by cores on the same chip (with the cluster size being a parameter). Clusters are independently scheduled (each, using non-clustered NPS-F). The utilisation bound is only moderately affected. We also formulate an important extension (applicable to both clustered and non-clustered NPS-F) which optimises the supply of processing time to executing tasks and makes it more granular. This reduces processing capacity requirements for schedulability without increasing preemptions.

Caracterização dinâmica de um edifício existente de betão armado através de ensaios de vibração ambiental

Dissertação de natureza Científica para obtenção do grau de Mestre em Engenharia Civil

Inter-application redundancy elimination in sensor networks with compiler-assisted scheduling

Most current-generation Wireless Sensor Network (WSN) nodes are equipped with multiple sensors of various types, and therefore support for multi-tasking and multiple concurrent applications is becoming increasingly common. This trend has been fostering the design of WSNs allowing several concurrent users to deploy applications with dissimilar requirements. In this paper, we extend the advantages of a holistic programming scheme by designing a novel compiler-assisted scheduling approach (called REIS) able to identify and eliminate redundancies across applications. To achieve this useful high-level optimization, we model each user application as a linear sequence of executable instructions. We show how well-known string-matching algorithms such as the Longest Common Subsequence (LCS) and the Shortest Common Super-sequence (SCS) can be used to produce an optimal merged monolithic sequence of the deployed applications that takes into account embedded scheduling information. We show that our approach can help in achieving about 60% average energy savings in processor usage compared to the normal execution of concurrent applications.