Mercury, cadmium, lead and arsenic levels in three pelagic fish species from the Atlantic Ocean: intra- and inter-specific variability and human health risks for consumption

Three commonly consumed and commercially valuable fish species (sardine, chub and horse mackerel) were collected from the Northeast and Eastern Central Atlantic Ocean in Portuguese waters during one year. Mercury, cadmium, lead and arsenic amounts were determined in muscles using graphite furnace and cold vapour atomic absorption spectrometry. Maximum mean levels of mercury (0.1715 ± 0.0857 mg/kg, ww) and arsenic (1.139 ± 0.350 mg/kg, ww) were detected in horse mackerel. The higher mean amounts of cadmium (0.0084 ± 0.0036 mg/kg, ww) and lead (0.0379 ± 0.0303 mg/kg, ww) were determined in chub mackerel and in sardine, respectively. Intra- and inter-specific variability of metals bioaccumulation was statistically assessed and species and length revealed to be the major influencing biometric factors, in particular for mercury and arsenic. Muscles present metal concentrations below the tolerable limits considered by European Commission Regulation and Food and Agriculture Organization of the United Nations/World Health Organization (FAO/WHO). However, estimation of non-carcinogenic and carcinogenic health risks by the target hazard quotient and target carcinogenic risk, established by the US Environmental Protection Agency, suggests that these species must be eaten in moderation due to possible hazard and carcinogenic risks derived from arsenic (in all analyzed species) and mercury ingestion (in horse and chub mackerel species).

Real-time scheduling of parallel tasks in the Linux Kernel

This paper proposes a global multiprocessor scheduling algorithm for the Linux kernel that combines the global EDF scheduler with a priority-aware work-stealing load balancing scheme, enabling parallel real-time tasks to be executed on more than one processor at a given time instant. We state that some priority inversion may actually be acceptable, provided it helps reduce contention, communication, synchronisation and coordination between parallel threads, while still guaranteeing the expected system’s predictability. Experimental results demonstrate the low scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Dynamic global scheduling of parallel real-time tasks

High-level parallel languages offer a simple way for application programmers to specify parallelism in a form that easily scales with problem size, leaving the scheduling of the tasks onto processors to be performed at runtime. Therefore, if the underlying system cannot efficiently execute those applications on the available cores, the benefits will be lost. In this paper, we consider how to schedule highly heterogenous parallel applications that require real-time performance guarantees on multicore processors. The paper proposes a novel scheduling approach that combines the global Earliest Deadline First (EDF) scheduler with a priority-aware work-stealing load balancing scheme, which enables parallel realtime tasks to be executed on more than one processor at a given time instant. Experimental results demonstrate the better scalability and lower scheduling overhead of the proposed approach comparatively to an existing real-time deadline-oriented scheduling class for the Linux kernel.

Server-based scheduling of parallel real-time tasks

Multicore platforms have transformed parallelism into a main concern. Parallel programming models are being put forward to provide a better approach for application programmers to expose the opportunities for parallelism by pointing out potentially parallel regions within tasks, leaving the actual and dynamic scheduling of these regions onto processors to be performed at runtime, exploiting the maximum amount of parallelism. It is in this context that this paper proposes a scheduling approach that combines the constant-bandwidth server abstraction with a priority-aware work-stealing load balancing scheme which, while ensuring isolation among tasks, enables parallel tasks to be executed on more than one processor at a given time instant.

Supporting parallelism in server-based multiprocessor systems

Developing an efficient server-based real-time scheduling solution that supports dynamic task-level parallelism is now relevant to even the desktop and embedded domains and no longer only to the high performance computing market niche. This paper proposes a novel approach that combines the constantbandwidth server abstraction with a work-stealing load balancing scheme which, while ensuring isolation among tasks, enables a task to be executed on more than one processor at a given time instant.

Handling shared resources and precedence constraints in open systems

There is an increasing demand for highly dynamic realtime systems where several independently developed applications with different timing requirements can coexist. This paper proposes a protocol to integrate shared resources and precedence constraints among tasks in such systems assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among needed tasks, minimising the cost of blocking.

The capacity exchange protocol

This paper proposes a new strategy to integrate shared resources and precedence constraints among real-time tasks, assuming no precise information on critical sections and computation times is available. The concept of bandwidth inheritance is combined with a capacity sharing and stealing mechanism to efficiently exchange bandwidth among tasks to minimise the degree of deviation from the ideal system’s behaviour caused by inter-application blocking. The proposed Capacity Exchange Protocol (CXP) is simpler than other proposed solutions for sharing resources in open real-time systems since it does not attempt to return the inherited capacity in the same exact amount to blocked servers. This loss of optimality is worth the reduced complexity as the protocol’s behaviour nevertheless tends to be fair and outperforms the previous solutions in highly dynamic scenarios as demonstrated by extensive simulations. A formal analysis of CXP is presented and the conditions under which it is possible to guarantee hard real-time tasks are discussed.

Task-based occupational exposure assessment and particle number concentration: two important data resources to perform risk assessment for occupational exposure to particles

Environment monitoring has an important role in occupational exposure assessment. However, due to several factors is done with insufficient frequency and normally don´t give the necessary information to choose the most adequate safety measures to avoid or control exposure. Identifying all the tasks developed in each workplace and conducting a task-based exposure assessment help to refine the exposure characterization and reduce assessment errors. A task-based assessment can provide also a better evaluation of exposure variability, instead of assessing personal exposures using continuous 8-hour time weighted average measurements. Health effects related with exposure to particles have mainly been investigated with mass-measuring instruments or gravimetric analysis. However, more recently, there are some studies that support that size distribution and particle number concentration may have advantages over particle mass concentration for assessing the health effects of airborne particles. Several exposure assessments were performed in different occupational settings (bakery, grill house, cork industry and horse stable) and were applied these two resources: task-based exposure assessment and particle number concentration by size. The results showed interesting results: task-based approach applied permitted to identify the tasks with higher exposure to the smaller particles (0.3 μm) in the different occupational settings. The data obtained allow more concrete and effective risk assessment and the identification of priorities for safety investments.

Circulation of Eastern equine encephalitis, Western equine encephalitis, Ilhéus, Maguari and Tacaiuma viruses in equines of the Brazilian Pantanal, South America

Neutralizing antibodies to EEE (6.7%), WEE (1.2%), ILH (26.6%), MAG (28.2%) and TCM (15.7%) viruses were found in sera of 432 equines of the Brazilian Pantanal, area where undiagnosed horse deaths are frequently observed. A 4-fold rise in CF titer to EEE virus was detected in acute and convalescent sera of an encephalitis horse sacrified in 1992. Antibodies to EEE, ILH, MAG and TCM viruses were detected in horses less than 2 years old indicating recent circulation of these viruses in the Pantanal. The evidence of recent equine encephalitis associated with rising CF titer to EEE warrants a more intensive study with attempts to isolate virus from horses with clinical manifestations of encephalitis.

Standardization of an enzyme linked immunosorbent assay (ELISA) for detecting circulating toxic venom antigens in patients stung by the scorpion Tityus serrulatus

The sensitivity and specificity of an enzyme-linked immunosorbent assay (ELISA) for the detection of circulating antigens from toxic components of Tityus serrulatus scorpion venom was determined in patients stung by T. serrulatus before antivenom administration. Thirty-seven patients were classified as mild cases and 19 as moderate or severe cases. The control absorbance in the venom assay was provided by serum samples from 100 individuals of same socioeconomic group and geographical area who had never been stung by scorpions or treated with horse antisera. The negative cutoff value (mean + 2 SD) corresponded to a venom concentration of 4.8 ng/ml. Three out of the 100 normal sera were positive, resulting in a specificity of 97%. The sensitivity of the ELISA when all cases of scorpion sting were included was 39.3%. When mild cases were excluded, the sensitivity increased to 94.7%. This study showed that this ELISA can be used for the detection of circulating venom toxic antigens in patients with systemic manifestations following. T. serrulatus sting but cannot be used for clinical studies in mild cases of envenoming since the test does not discriminate mild cases from control patients.

Epidemiological aspects of the Brazilian spotted fever: serological survey of dogs and horses in an endemic area in the State of São Paulo, Brazil

In order to obtain information on Brazilian spotted fever, a study in domestic animals was performed in the County of Pedreira, State of São Paulo, Brazil, where 17 human cases had been notified. Serum samples obtained from animals were tested by indirect immunofluorescence for detectable antibodies to spotted fever-group rickettsiae. Seropositivity was revealed in 12 (36.4%) of 33 dogs and seven (77.8%) of nine horses from the endemic area. For comparison, blood samples from dogs and horses from non endemic area were tested and four (12.9%) of 31 dogs and three (27.3%) of 11 horses were positive. The highest titers of antibodies by IFA (IgG > 1:1024) were found only in three dogs and six horses from endemic area. The results suggest that dogs as horses may serve as environmental sentinels for estabilishing the prevalence of foci of spotted fever in Brazil.

Preliminary investigation of Culicidae species in South Pantanal, Brazil and their potential importance in arbovirus transmission

In view of the high circulation of migratory birds and the environmental and climatic conditions which favor the proliferation of arthropods, the Brazilian Pantanal is susceptible to circulation of arboviruses. However, the amount of data concerning arbovirus vectors in this area is scarce; therefore the aim of this study was to conduct a preliminary investigation of Culicidae species in the Nhecolândia Sub-region of South Pantanal, Brazil and their potential importance in the arbovirus transmission. A total of 3684 specimens of mosquitoes were captured, 1689 of which caught in the rainy season of 2007, were divided into 78 pools and submitted to viral isolation, Semi-Nested RT-PCR and Nested RT-PCR, with a view to identifying the most important arboviruses in Brazil. Simultaneously, 70 specimens of ticks found blood-feeding on horses were also submitted to the same virological assays. No virus was isolated and viral nucleic-acid detection by RT-PCR was also negative. Nevertheless, a total of 22 Culicidae species were identified, ten of which had previously been reported as vectors of important arboviruses. The diversity of species found blood-feeding on human and horse hosts together with the arboviruses circulation previously reported suggest that the Nhecolândia Sub-region of South Pantanal is an important area for arbovirus surveillance in Brazil.

IDENTIFICATION OF Pseudomonas spp. AS AMOEBA-RESISTANT MICROORGANISMS IN ISOLATES OF Acanthamoeba

Acanthamoeba is a “Trojan horse” of the microbial world. The aim of this study was to identify the presence of Pseudomonas as an amoeba-resistant microorganism in 12 isolates of Acanthamoeba. All isolates showed the genus Pseudomonas spp. as amoeba-resistant microorganisms. Thus, one can see that the Acanthamoeba isolates studied are hosts of Pseudomonas.

Multicore Scheduling of Real-Time Irregular Parallel Algorithms in Linux

Face à estagnação da tecnologia uniprocessador registada na passada década, aos principais fabricantes de microprocessadores encontraram na tecnologia multi-core a resposta `as crescentes necessidades de processamento do mercado. Durante anos, os desenvolvedores de software viram as suas aplicações acompanhar os ganhos de performance conferidos por cada nova geração de processadores sequenciais, mas `a medida que a capacidade de processamento escala em função do número de processadores, a computação sequencial tem de ser decomposta em várias partes concorrentes que possam executar em paralelo, para que possam utilizar as unidades de processamento adicionais e completar mais rapidamente. A programação paralela implica um paradigma completamente distinto da programação sequencial. Ao contrário dos computadores sequenciais tipificados no modelo de Von Neumann, a heterogeneidade de arquiteturas paralelas requer modelos de programação paralela que abstraiam os programadores dos detalhes da arquitectura e simplifiquem o desenvolvimento de aplicações concorrentes. Os modelos de programação paralela mais populares incitam os programadores a identificar instruções concorrentes na sua lógica de programação, e a especificá-las sob a forma de tarefas que possam ser atribuídas a processadores distintos para executarem em simultâneo. Estas tarefas são tipicamente lançadas durante a execução, e atribuídas aos processadores pelo motor de execução subjacente. Como os requisitos de processamento costumam ser variáveis, e não são conhecidos a priori, o mapeamento de tarefas para processadores tem de ser determinado dinamicamente, em resposta a alterações imprevisíveis dos requisitos de execução. `A medida que o volume da computação cresce, torna-se cada vez menos viável garantir as suas restrições temporais em plataformas uniprocessador. Enquanto os sistemas de tempo real se começam a adaptar ao paradigma de computação paralela, há uma crescente aposta em integrar execuções de tempo real com aplicações interativas no mesmo hardware, num mundo em que a tecnologia se torna cada vez mais pequena, leve, ubíqua, e portável. Esta integração requer soluções de escalonamento que simultaneamente garantam os requisitos temporais das tarefas de tempo real e mantenham um nível aceitável de QoS para as restantes execuções. Para tal, torna-se imperativo que as aplicações de tempo real paralelizem, de forma a minimizar os seus tempos de resposta e maximizar a utilização dos recursos de processamento. Isto introduz uma nova dimensão ao problema do escalonamento, que tem de responder de forma correcta a novos requisitos de execução imprevisíveis e rapidamente conjeturar o mapeamento de tarefas que melhor beneficie os critérios de performance do sistema. A técnica de escalonamento baseado em servidores permite reservar uma fração da capacidade de processamento para a execução de tarefas de tempo real, e assegurar que os efeitos de latência na sua execução não afectam as reservas estipuladas para outras execuções. No caso de tarefas escalonadas pelo tempo de execução máximo, ou tarefas com tempos de execução variáveis, torna-se provável que a largura de banda estipulada não seja consumida por completo. Para melhorar a utilização do sistema, os algoritmos de partilha de largura de banda (capacity-sharing) doam a capacidade não utilizada para a execução de outras tarefas, mantendo as garantias de isolamento entre servidores. Com eficiência comprovada em termos de espaço, tempo, e comunicação, o mecanismo de work-stealing tem vindo a ganhar popularidade como metodologia para o escalonamento de tarefas com paralelismo dinâmico e irregular. O algoritmo p-CSWS combina escalonamento baseado em servidores com capacity-sharing e work-stealing para cobrir as necessidades de escalonamento dos sistemas abertos de tempo real. Enquanto o escalonamento em servidores permite partilhar os recursos de processamento sem interferências a nível dos atrasos, uma nova política de work-stealing que opera sobre o mecanismo de capacity-sharing aplica uma exploração de paralelismo que melhora os tempos de resposta das aplicações e melhora a utilização do sistema. Esta tese propõe uma implementação do algoritmo p-CSWS para o Linux. Em concordância com a estrutura modular do escalonador do Linux, ´e definida uma nova classe de escalonamento que visa avaliar a aplicabilidade da heurística p-CSWS em circunstâncias reais. Ultrapassados os obstáculos intrínsecos `a programação da kernel do Linux, os extensos testes experimentais provam que o p-CSWS ´e mais do que um conceito teórico atrativo, e que a exploração heurística de paralelismo proposta pelo algoritmo beneficia os tempos de resposta das aplicações de tempo real, bem como a performance e eficiência da plataforma multiprocessador.

MOLECULAR INVESTIGATION OF HEMOTROPIC MYCOPLASMAS IN HUMAN BEINGS, DOGS AND HORSES IN A RURAL SETTLEMENT IN SOUTHERN BRAZIL

SUMMARY The aims of this study were to determine the prevalence of hemoplasmas in a rural Brazilian settlement's population of human beings, their dogs and horses, highly exposed to tick bites; to identify the tick species parasitizing dogs and horses, and analyze factors associated with their infection. Blood samples from 132 dogs, 16 horses and 100 humans were screened using a pan-hemoplasma SYBR green real-time PCR assay followed by a species-specific TaqMan real-time PCR. A total of 59/132 (44.7%) dog samples were positive for hemoplasmas (21 Mycoplasma haemocanisalone, 12 ' Candidatus Mycoplasma haematoparvum' alone and 21 both). Only 1/100 (1.0%) human sample was positive by qPCR SYBR green, with no successful amplification of 16S rRNA or 23 rRNA genes despite multiple attempts. All horse samples were negative. Dogs >1 year of age were more likely to be positive for hemoplasmas ( p= 0.0014). In conclusion, although canine hemoplasma infection was highly prevalent, cross-species hemoplasma transmission was not observed, and therefore may not frequently occur despite overexposure of agents and vectors.