Air pollution and its impacts on health in Vitoria, Espirito Santo, Brazil

ABSTRACT OBJECTIVE To analyze the impact of air pollution on respiratory and cardiovascular morbidity of children and adults in the city of Vitoria, state of Espirito Santo. METHODS A study was carried out using time-series models via Poisson regression from hospitalization and pollutant data in Vitoria, ES, Southeastern Brazil, from 2001 to 2006. Fine particulate matter (PM10), sulfur dioxide (SO2), and ozone (O3) were tested as independent variables in simple and cumulative lags of up to five days. Temperature, humidity and variables indicating weekdays and city holidays were added as control variables in the models. RESULTS For each increment of 10 µg/m3 of the pollutants PM10, SO2, and O3, the percentage of relative risk (%RR) for hospitalizations due to total respiratory diseases increased 9.67 (95%CI 11.84-7.54), 6.98 (95%CI 9.98-4.17) and 1.93 (95%CI 2.95-0.93), respectively. We found %RR = 6.60 (95%CI 9.53-3.75), %RR = 5.19 (95%CI 9.01-1.5), and %RR = 3.68 (95%CI 5.07-2.31) for respiratory diseases in children under the age of five years for PM10, SO2, and O3, respectively. Cardiovascular diseases showed a significant relationship with O3, with %RR = 2.11 (95%CI 3.18-1.06). CONCLUSIONS Respiratory diseases presented a stronger and more consistent relationship with the pollutants researched in Vitoria. A better dose-response relationship was observed when using cumulative lags in polynomial distributed lag models.

Fractional derivatives: probability interpretation and frequency response of rational approximations

The theory of fractional calculus (FC) is a useful mathematical tool in many applied sciences. Nevertheless, only in the last decades researchers were motivated for the adoption of the FC concepts. There are several reasons for this state of affairs, namely the co-existence of different definitions and interpretations, and the necessity of approximation methods for the real time calculation of fractional derivatives (FDs). In a first part, this paper introduces a probabilistic interpretation of the fractional derivative based on the Grünwald-Letnikov definition. In a second part, the calculation of fractional derivatives through Padé fraction approximations is analyzed. It is observed that the probabilistic interpretation and the frequency response of fraction approximations of FDs reveal a clear correlation between both concepts.

Densities and refractive indices for the ternary mixture methanol/propan-1-Ol/acetonitrile

Refractive indices, n(D), and densities, rho, at 298.15 K were measured for the ternary mixture methanol (MeOH)/propan-1-ol (1-PrOH)/acetonitrile (MeCN) for a total of 22 mole fractions, along with 18 mole fractions of each of the corresponding binary mixtures, methanol/propan-1-ol, propan-1-ol/acetonitrile and methanol/acetonitrile. The variation of excess refractive indices and excess molar volumes with composition was modeled by the Redlich-Kister polynomial function in the case of binary mixtures and by the Cibulka equation for the ternary mixture. A thermodynamic approach to excess refractive indices, recently proposed by other authors, was applied for the first time to ternary liquid mixtures. Structural effects were identified and interpreted both in the binary and ternary systems. A complex relationship between excess refractive indices and excess molar volumes was identified, revealing all four possible sign combinations between these two properties. Structuring of the mixtures was also discussed on the basis of partial molar volumes of the binary and ternary mixtures.

Using fractional derivatives for the joint ontrol of hexapod robots

This article studies several Fractional Order Control algorithms used for joint control of a hexapod robot. Both Padé and series approximations to the fractional derivative are considered for the control algorithm. The walking performance is evaluated through two indices: The mean absolute density of energy used per unit distance travelled, and the control effort. A set of simulation experiments reveals the influence of the different approximations upon the proposed indices. The results show that the fractional proportional and derivative algorithm, implemented using the Padé approximation with a small number of terms, gives the best results.

Fractional order electromagnetics

The Maxwell equations constitute a formalism for the development of models describing electromagnetic phenomena. The four Maxwell laws have been adopted successfully in many applications and involve only the integer order differential calculus. Recently, a closer look for the cases of transmission lines, electrical motors and transformers, that reveal the so-called skin effect, motivated a new perspective towards the replacement of classical models by fractional-order mathematical descriptions. Bearing these facts in mind this paper addresses the concept of static fractional electric potential. The fractional potential was suggested some years ago. However, the idea was not fully explored and practical methods of implementation were not proposed. In this line of thought, this paper develops a new approximation algorithm for establishing the fractional order electrical potential and analyzes its characteristics.

Contributos da utilização de mapas de conceitos para a aprendizagem de ciências naturais no 4º ano de escolaridade

Relatório de Estágio apresentado à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Ensino do 1º e 2º Ciclos do Ensino Básico

O papel e as áreas de intervenção do Diretor: influências dos novos regimes de administração escolar

Dissertação apresentada à Escola Superior de Educação de Lisboa para obtenção de grau de mestre em Administração Escolar

Avaliação do potencial eólico para geração de energia eléctrica

Trabalho Final de Mestrado para a obtenção do grau de Mestre em Engenharia Mecânica /Energia

Desenvolvimento de modelo de primeiros princípios para simulação dinâmica de uma coluna de destilação contínua

Trabalho Final de Mestrado para obtenção do grau de Mestre em Engenharia Química e Biológica

Laboratório de criação a partir de Macbeth de William Shakespeare: relatório de estágio

Relatório de Estágio submetido à Escola Superior de Teatro e Cinema para cumprimento dos requisitos necessários à obtenção do grau de Mestre em Teatro - especialização em Encenação.

Task assignment algorithms for two-type heterogeneous multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising two different types of processors—such a platform is referred to as two-type platform. We present two low degree polynomial time-complexity algorithms, SA and SA-P, each providing the following guarantee. For a given two-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then (i) using SA, it is guaranteed to find such an assignment where the same restriction on task migration applies but given a platform in which processors are 1+α/2 times faster and (ii) SA-P succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which processors are 1+α times faster. The parameter 0<α≤1 is a property of the task set; it is the maximum of all the task utilizations that are no greater than 1. We evaluate average-case performance of both the algorithms by generating task sets randomly and measuring how much faster processors the algorithms need (which is upper bounded by 1+α/2 for SA and 1+α for SA-P) in order to output a feasible task assignment (intra-migrative for SA and non-migrative for SA-P). In our evaluations, for the vast majority of task sets, these algorithms require significantly smaller processor speedup than indicated by their theoretical bounds. Finally, we consider a special case where no task utilization in the given task set can exceed one and for this case, we (re-)prove the performance guarantees of SA and SA-P. We show, for both of the algorithms, that changing the adversary from intra-migrative to a more powerful one, namely fully-migrative, in which tasks can migrate between processors of any type, does not deteriorate the performance guarantees. For this special case, we compare the average-case performance of SA-P and a state-of-the-art algorithm by generating task sets randomly. In our evaluations, SA-P outperforms the state-of-the-art by requiring much smaller processor speedup and by running orders of magnitude faster.

Provably Good Task Assignment for Two-Type Heterogeneous Multiprocessors Using Cutting Planes

Consider scheduling of real-time tasks on a multiprocessor where migration is forbidden. Specifically, consider the problem of determining a task-to-processor assignment for a given collection of implicit-deadline sporadic tasks upon a multiprocessor platform in which there are two distinct types of processors. For this problem, we propose a new algorithm, LPC (task assignment based on solving a Linear Program with Cutting planes). The algorithm offers the following guarantee: for a given task set and a platform, if there exists a feasible task-to-processor assignment, then LPC succeeds in finding such a feasible task-to-processor assignment as well but on a platform in which each processor is 1.5 × faster and has three additional processors. For systems with a large number of processors, LPC has a better approximation ratio than state-of-the-art algorithms. To the best of our knowledge, this is the first work that develops a provably good real-time task assignment algorithm using cutting planes.

Efficient schedulability tests for real-time embedded systems with urgent routines

Task scheduling is one of the key mechanisms to ensure timeliness in embedded real-time systems. Such systems have often the need to execute not only application tasks but also some urgent routines (e.g. error-detection actions, consistency checkers, interrupt handlers) with minimum latency. Although fixed-priority schedulers such as Rate-Monotonic (RM) are in line with this need, they usually make a low processor utilization available to the system. Moreover, this availability usually decreases with the number of considered tasks. If dynamic-priority schedulers such as Earliest Deadline First (EDF) are applied instead, high system utilization can be guaranteed but the minimum latency for executing urgent routines may not be ensured. In this paper we describe a scheduling model according to which urgent routines are executed at the highest priority level and all other system tasks are scheduled by EDF. We show that the guaranteed processor utilization for the assumed scheduling model is at least as high as the one provided by RM for two tasks, namely 2(2√−1). Seven polynomial time tests for checking the system timeliness are derived and proved correct. The proposed tests are compared against each other and to an exact but exponential running time test.

The development of the N1 and N2 components in auditory oddball paradigms: a systematic review with narrative analysis and suggested normative values

Auditory event-related potentials (AERPs) are widely used in diverse fields of today’s neuroscience, concerning auditory processing, speech perception, language acquisition, neurodevelopment, attention and cognition in normal aging, gender, developmental, neurologic and psychiatric disorders. However, its transposition to clinical practice has remained minimal. Mainly due to scarce literature on normative data across age, wide spectrumof results, variety of auditory stimuli used and to different neuropsychological meanings of AERPs components between authors. One of the most prominent AERP components studied in last decades was N1, which reflects auditory detection and discrimination. Subsequently, N2 indicates attention allocation and phonological analysis. The simultaneous analysis of N1 and N2 elicited by feasible novelty experimental paradigms, such as auditory oddball, seems an objective method to assess central auditory processing. The aim of this systematic review was to bring forward normative values for auditory oddball N1 and N2 components across age. EBSCO, PubMed, Web of Knowledge and Google Scholarwere systematically searched for studies that elicited N1 and/or N2 by auditory oddball paradigm. A total of 2,764 papers were initially identified in the database, of which 19 resulted from hand search and additional references, between 1988 and 2013, last 25 years. A final total of 68 studiesmet the eligibility criteria with a total of 2,406 participants from control groups for N1 (age range 6.6–85 years; mean 34.42) and 1,507 for N2 (age range 9–85 years; mean 36.13). Polynomial regression analysis revealed thatN1latency decreases with aging at Fz and Cz,N1 amplitude at Cz decreases from childhood to adolescence and stabilizes after 30–40 years and at Fz the decrement finishes by 60 years and highly increases after this age. Regarding N2, latency did not covary with age but amplitude showed a significant decrement for both Cz and Fz. Results suggested reliable normative values for Cz and Fz electrode locations; however, changes in brain development and components topography over age should be considered in clinical practice.

Time-domain optimization of amplifiers based on distributed genetic algorithms

Thesis presented in partial fulfillment of the requirements for the degree of Doctor of Philosophy in the subject of Electrical and Computer Engineering