Non-venomous snake bite and snake bite without envenoming in a brazilian teaching hospital: analysis of 91 cases

A retrospective survey of 473 cases of snake bite admitted to a Brazilian teaching hospital from 1984 to 1990 revealed 91 cases of bite without envenoming and/or caused by non-venomous snakes. In 17 of these cases the snake was identified, and one patient was bitten by a snake-like reptile (Amphisbaena mertensii). In 43 cases diagnosis was made on clinical grounds (fang marks in the absence of signs of envenoming). The other 30 cases were of patients who complained of being bitten but who did not show any sign of envenoming or fang mark. Most cases occurred in men (66;73%), in the 10-19 years age group (26;29%), in the lower limbs (51/74;69%), between 6 A. M. and 2 P.M. (49;61%) and in the month of April (16; 18%). One patient bitten by Philodryas olfersii developed severe local pain, swelling and redness at the site of the bite, with normal clotting time. The patient bitten by Drymarcon corais was misdiagnosed as being bitten by a snake of the genus Bothrops, was given the specific antivenom, and developed anaphylaxis. One patient bitten by Sibynomorphus mikanii presented prolonged clotting time, and was also given antivenom as a case of Bothrops bite. Correct identification of venomous snakes by physicians is necessary to provide correct treatment to victims of snake bite, avoiding unnecessary distress to the patient, and overprescription of antivenom, which may eventually cause severe untoward effects.

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.

Task Assignment Algorithms for Heterogeneous Multiprocessors

Consider the problem of assigning implicit-deadline sporadic tasks on a heterogeneous multiprocessor platform comprising a constant number (denoted by t) of distinct types of processors—such a platform is referred to as a t-type platform. We present two algorithms, LPGIM and LPGNM, each providing the following guarantee. For a given t-type platform and a task set, if there exists a task assignment such that tasks can be scheduled to meet their deadlines by allowing them to migrate only between processors of the same type (intra-migrative), then: (i) LPGIM succeeds in finding such an assignment where the same restriction on task migration applies (intra-migrative) but given a platform in which only one processor of each type is 1 + α × t-1/t times faster and (ii) LPGNM succeeds in finding a task assignment where tasks are not allowed to migrate between processors (non-migrative) but given a platform in which every processor is 1 + α times faster. The parameter α is a property of the task set; it is the maximum of all the task utilizations that are no greater than one. To the best of our knowledge, for t-type heterogeneous multiprocessors: (i) for the problem of intra-migrative task assignment, no previous algorithm exists with a proven bound and hence our algorithm, LPGIM, is the first of its kind and (ii) for the problem of non-migrative task assignment, our algorithm, LPGNM, has superior performance compared to state-of-the-art.

Characterization of the non-apparent clinical form in the initial phase of schistosomiasis mansoni

In this paper the history of 115 recruits that had bathed simultaneously in streams contaminated with Schistosoma mansoni, during military maneuvers, is reported. Thirty four of the infected patients presented the initial phase of the infection diagnosed through epidemiologic, clinical and laboratorial parameters. Three out of the 34 patients did not reveal the clinical picture of the infection, thus being considered representatives of the non-apparent form of the disease. Differences between the intensity of blood eosinophilia, the area of immediate cutaneous reaction and the number of Schistosoma eggs eliminated in the stools proved not to be statistically significant (p>0.05) when the non-apparent and acute cases of schistosomiasis were compared. These cases actually may be considered evidences of the non-apparent form hitherto merely taken for granted in the literature.

An optimal boundary fair scheduling

Nowadays, many real-time operating systems discretize the time relying on a system time unit. To take this behavior into account, real-time scheduling algorithms must adopt a discrete-time model in which both timing requirements of tasks and their time allocations have to be integer multiples of the system time unit. That is, tasks cannot be executed for less than one time unit, which implies that they always have to achieve a minimum amount of work before they can be preempted. Assuming such a discrete-time model, the authors of Zhu et al. (Proceedings of the 24th IEEE international real-time systems symposium (RTSS 2003), 2003, J Parallel Distrib Comput 71(10):1411–1425, 2011) proposed an efficient “boundary fair” algorithm (named BF) and proved its optimality for the scheduling of periodic tasks while achieving full system utilization. However, BF cannot handle sporadic tasks due to their inherent irregular and unpredictable job release patterns. In this paper, we propose an optimal boundary-fair scheduling algorithm for sporadic tasks (named BF TeX ), which follows the same principle as BF by making scheduling decisions only at the job arrival times and (expected) task deadlines. This new algorithm was implemented in Linux and we show through experiments conducted upon a multicore machine that BF TeX outperforms the state-of-the-art discrete-time optimal scheduler (PD TeX ), benefiting from much less scheduling overheads. Furthermore, it appears from these experimental results that BF TeX is barely dependent on the length of the system time unit while PD TeX —the only other existing solution for the scheduling of sporadic tasks in discrete-time systems—sees its number of preemptions, migrations and the time spent to take scheduling decisions increasing linearly when improving the time resolution of the system.

Dynamic cluster scheduling for cluster-tree WSNs

While Cluster-Tree network topologies look promising for WSN applications with timeliness and energy-efficiency requirements, we are yet to witness its adoption in commercial and academic solutions. One of the arguments that hinder the use of these topologies concerns the lack of flexibility in adapting to changes in the network, such as in traffic flows. This paper presents a solution to enable these networks with the ability to self-adapt their clusters’ duty-cycle and scheduling, to provide increased quality of service to multiple traffic flows. Importantly, our approach enables a network to change its cluster scheduling without requiring long inaccessibility times or the re-association of the nodes. We show how to apply our methodology to the case of IEEE 802.15.4/ZigBee cluster-tree WSNs without significant changes to the protocol. Finally, we analyze and demonstrate the validity of our methodology through a comprehensive simulation and experimental validation using commercially available technology on a Structural Health Monitoring application scenario.

Compositional multiprocessor scheduling: the GMPR interface

Composition is a practice of key importance in software engineering. When real-time applications are composed, it is necessary that their timing properties (such as meeting the deadlines) are guaranteed. The composition is performed by establishing an interface between the application and the physical platform. Such an interface typically contains information about the amount of computing capacity needed by the application. For multiprocessor platforms, the interface should also present information about the degree of parallelism. Several interface proposals have recently been put forward in various research works. However, those interfaces are either too complex to be handled or too pessimistic. In this paper we propose the generalized multiprocessor periodic resource model (GMPR) that is strictly superior to the MPR model without requiring a too detailed description. We then derive a method to compute the interface from the application specification. This method has been implemented in Matlab routines that are publicly available.

Real-time scheduling with resource sharing on heterogeneous multiprocessors

Consider the problem of scheduling a task set τ of implicit-deadline sporadic tasks to meet all deadlines on a t-type heterogeneous multiprocessor platform where tasks may access multiple shared resources. The multiprocessor platform has m k processors of type-k, where k∈{1,2,…,t}. The execution time of a task depends on the type of processor on which it executes. The set of shared resources is denoted by R. For each task τ i , there is a resource set R i ⊆R such that for each job of τ i , during one phase of its execution, the job requests to hold the resource set R i exclusively with the interpretation that (i) the job makes a single request to hold all the resources in the resource set R i and (ii) at all times, when a job of τ i holds R i , no other job holds any resource in R i . Each job of task τ i may request the resource set R i at most once during its execution. A job is allowed to migrate when it requests a resource set and when it releases the resource set but a job is not allowed to migrate at other times. Our goal is to design a scheduling algorithm for this problem and prove its performance. We propose an algorithm, LP-EE-vpr, which offers the guarantee that if an implicit-deadline sporadic task set is schedulable on a t-type heterogeneous multiprocessor platform by an optimal scheduling algorithm that allows a job to migrate only when it requests or releases a resource set, then our algorithm also meets the deadlines with the same restriction on job migration, if given processors 4×(1+MAXP×⌈|P|×MAXPmin{m1,m2,…,mt}⌉) times as fast. (Here MAXP and |P| are computed based on the resource sets that tasks request.) For the special case that each task requests at most one resource, the bound of LP-EE-vpr collapses to 4×(1+⌈|R|min{m1,m2,…,mt}⌉). To the best of our knowledge, LP-EE-vpr is the first algorithm with proven performance guarantee for real-time scheduling of sporadic tasks with resource sharing on t-type heterogeneous multiprocessors.

Generalized synchronization in a system of several non-autonomous oscillators coupled by a medium

An abstract theory on general synchronization of a system of several oscillators coupled by a medium is given. By generalized synchronization we mean the existence of an invariant manifold that allows a reduction in dimension. The case of a concrete system modeling the dynamics of a chemical solution on two containers connected to a third container is studied from the basics to arbitrary perturbations. Conditions under which synchronization occurs are given. Our theoretical results are complemented with a numerical study.

Antibodies against non-structural c100/3 and structural core antigen of hepatitis C virus (HCV) in hemodialysis patients

Two groups of patients undergoing hemodialysis (HD) maintenance were evaluated for their antibody response to non-structural c100/3 protein and structural core protein of hepatitis C virus (HCV). Forty-six patients (Group 1) never presented liver abnormalities during HD treatment, while 52 patients (Group 2) had either current or prior liver enzyme elevations. Prevalence rates of 32.6% and 41.3% were found for anti-c100/3 and anti-HCV core antibodies, respectively, in patients with silent infections (Group 1). The rate of anti-c100/3 in patients of Group 2 was 71.15% and reached 86.5% for anti-HCV core antibodies. The recognition of anti-c100/3 and anti-core antibodies was significantly higher in Group 2 than in Group 1. A line immunoassay composed of structural and non-structural peptides was used as a confirmation assay. HBV infection, measured by the presence of anti-HBc antibodies, was observed in 39.8% of the patients. Six were HBsAg chronic carriers and 13 had naturally acquired anti-HBs antibodies. The duration of HD treatment was correlated with anti-HCV positivity. A high prevalence of 96.7% (Group 2) was found in patients who underwent more than 5 years of treatment. Our results suggest that anti-HCV core ELISA is more accurate for detecting HCV infection than anti-c100/3. Although the risk associated with the duration of HD treatment and blood transfusion was high, additional factors such as a significant non-transfusional spread of HCV seems to play a role as well. The identification of infective patients by more sensitive methods for HCV genome detection should help to control the transmission of HCV in the unit under study.

Non-uniform printed antenna array for wireless communications in sports arenas

Wireless communications had a great development in the last years and nowadays they are present everywhere, public and private, being increasingly used for different applications. Their application in the business of sports events as a means to improve the experience of the fans at the games is becoming essential, such as sharing messages and multimedia material on social networks. In the stadiums, given the high density of people, the wireless networks require very large data capacity. Hence radio coverage employing many small sized sectors is unavoidable. In this paper, an antenna is designed to operate in the Wi-Fi 5GHz frequency band, with a directive radiation pattern suitable to this kind of applications. Furthermore, despite the large bandwidth and low losses, this antenna has been developed using low cost, off-the-shelf materials without sacrificing quality or performance, essential to mass production. © 2015 EurAAP.

The key role of coligands in novel ruthenium(II)-cyclopentadienyl bipyridine derivatives: ranging from non-cytotoxic to highly cytotoxic compounds

A new family of eight ruthenium(II)-cyclopentadienyl bipyridine derivatives, bearing nitrogen, sulfur, phosphorous and carbonyl sigma bonded coligands, has been synthesized. Compounds bearing nitrogen bonded coligands were found to be unstable in aqueous solution, while the others presented appropriate stabilities for the biologic assays and pursued for determination of IC50 values in ovarian (A2780) and breast (MCF7 and MDAMB231) human cancer cell lines. These studies were also carried out for the [5: HSA] and [6: HSA] adducts (HSA=human serum albumin) and a better performance was found for the first case. Spectroscopic, electrochemical studies by cyclic voltammetry and density functional theory calculations allowed us to get some understanding on the electronic flow directions within the molecules and to find a possible clue concerning the structural features of coligands that can activate bipyridyl ligands toward an increased cytotoxic effect. X-ray structure analysis of compound [Ru(η(5)-C5H5)(bipy)(PPh3)][PF6] (7; bipy=bipyridine) showed crystallization on C2/c space group with two enantiomers of the [Ru(η(5)-C5H5)(bipy)(PPh3)](+) cation complex in the racemic crystal packing.

Prevalence of rubella antibodies in a non-immunized urban population, São Paulo, Brazil

The prevalence of rubella antibodies was evaluated through a ramdom Seroepidemiological survey in 1400 blood samples of 2-14 year old children and in 329 samples of umbilical cord serum. Rubella IgG antibodies were detected by ELISA, and the sera were collected in 1987, five years before the mass vaccination campaign with measles-mumps-rubella vaccine carried out in the city of São Paulo in 1992. A significant increase in prevalence of rubella infection was observed after 6 years of age, and 77% of the individuals aged from 15 to 19 years had detectable rubella antibodies. However, the seroprevalence rose to 90.5% (171/189) in cord serum samples from children whose mothers were 20 to 29 years old, and reached 95.6% in newborns of mothers who were 30 to 34 years old, indicating that a large number of women are infected during childbearing years. This study confirms that rubella infection represents an important Public Health problem in São Paulo city. The data on the seroprevalence of rubella antibodies before the mass vaccination campaign reflects the baseline immunological status of this population before any intervention and should be used to design an adequate vaccination strategy and to assess the Seroepidemiological impact of this intervention.

O papel dos sistemas de Non-Intrusive Load Monitoring para a eficiência energética do setor residencial

A sustentabilidade energética do planeta é uma preocupação corrente e, neste sentido, a eficiência energética afigura-se como sendo essencial para a redução do consumo em todos os setores de atividade. No que diz respeito ao setor residencial, o indevido comportamento dos utilizadores aliado ao desconhecimento do consumo dos diversos aparelhos, são factores impeditivos para a redução do consumo energético. Uma ferramenta importante, neste sentido, é a monitorização de consumos nomeadamente a monitorização não intrusiva, que apresenta vantagens económicas relativamente à monitorização intrusiva, embora levante alguns desafios na desagregação de cargas. Abordou-se então, neste documento, a temática da monitorização não intrusiva onde se desenvolveu uma ferramenta de desagregação de cargas residenciais, sobretudo de aparelhos que apresentavam elevados consumos. Para isso, monitorizaram-se os consumos agregados de energia elétrica, água e gás de seis habitações do município de Vila Nova de Gaia. Através da incorporação dos vetores de água e gás, a acrescentar ao da energia elétrica, provou-se que a performance do algoritmo de desagregação de aparelhos poderá aumentar, no caso de aparelhos que utilizem simultaneamente energia elétrica e água ou energia elétrica e gás. A eficiência energética é também parte constituinte deste trabalho e, para tal, implementaram-se medidas de eficiência energética para uma das habitações em estudo, de forma a concluir as que exibiam maior potencial de poupança, assim como rápidos períodos de retorno de investimento. De um modo geral, os objetivos propostos foram alcançados e espera-se que num futuro próximo, a monitorização de consumos não intrusiva se apresente como uma solução de referência no que respeita à sustentabilidade energética do setor residencial.

Characterization of a Trypanosoma cruzi strain isolated from a non-endemic area in Northeast Brazil

A cepa WSL (Wild São Lorenço) de T. cruzi, isolada de um cobaio proveniente de São Lorenço da Mata (Nordeste do Brasil) foi caracterizada através da análise do seu comportamento morfobiológico e perfil isoenzimático. Para o estudo do comportamento morfobiológico, tripomastigotas sanguíneos (1 x 10 5) da cepa WSL foram inoculados por via intraperitonal em camundongos albinos Swiss. Como controle a cepa Y (Tipo I) foi usada. Durante o curso da infecção os seguintes parâmetros foram analisados: parasitemia, mortalidade, morfologia dos parasitas no sangue periférico e tropismo tissular. O perfil isoenzimático foi analisado em relação às enzimas ALAT, GPI e PGM usando como controle de referência as cepas Peruana (Tipo I), 21SF (Tipo II) e Colombiana (Tipo III). A cepa WSL apresentou as seguintes características biológicas: 1) multiplicação lenta e pico parasitêmico entre 21 - 25 dias pós-infecção; 2) mortalidade de 3,3% 40 dias pós-infecção; 3) predominância de formas largas no sangue periférico e 4) miotropismo com predominante envolvimento cardíaco. A análise isoenzimática mostrou um padrão de zimodema 2 (Z2) que corresponde às cepas biológicas Tipo II. Os resultados mostram que a cepa WSL apresenta baixa virulência e patogenicidade.