Tendência temporal e desigualdades na mortalidade por diarreias em

Objetivo: Analisar a tendência da mortalidade por diarreia entre menores de 5 anos, no município de Osasco (SP), entre 1980 e 2000. Métodos: Trata-se de estudo observacional com dois delineamentos. Um descritivo, que toma o indivíduo como unidade do estudo, e outro ecológico, analisando agregado populacional que incluiu análise de séries temporais. A fonte de dados foi o sistema de informação de mortalidade do Estado de São Paulo e censos de 1980, 1991 e 2000. Descreveu-se a variação sazonal e para a análise de tendência aplicaram-se modelos log lineares de regressão polinomiais, utilizando-se variáveis sociodemográficas da criança e da mãe. Foram analisadas a evolução de indicadores sociodemográficos do município de 1980 a 2000, as taxas médias de mortalidade por diarreia nos menores de 5 anos e seus diferenciais por distrito nos anos 90. Resultados: Dos 1.360 óbitos, 94,3 e 75,3% atingiram, respectivamente, menores de 1 ano e de 6 meses. O declínio da mortalidade foi de 98,3%, com deslocamento da sazonalidade do verão para o outono. A mediana da idade elevou-se de 2 meses nos primeiros períodos para 3 meses no último. O resíduo de óbitos manteve-se entre filhos de mães de 20 a 29 anos e escolaridade < 8 anos. O risco relativo entre o distrito mais atingido e a taxa média do município diminuiu de 3,4 para 1,3 do primeiro para o segundo quinquênio dos anos 90. Conclusão: Nossos resultados apontam uma elevação da idade mais vulnerável e a provável mudança do agente mais frequentemente associado ao óbito por diarreia

Computational adjustment technique for digital mammographic images based on the digitizer characteristic curve

We evaluated the performance of a novel procedure for segmenting mammograms and detecting clustered microcalcifications in two types of image sets obtained from digitization of mammograms using either a laser scanner, or a conventional ""optical"" scanner. Specific regions forming the digital mammograms were identified and selected, in which clustered microcalcifications appeared or not. A remarkable increase in image intensity was noticed in the images from the optical scanner compared with the original mammograms. A procedure based on a polynomial correction was developed to compensate the changes in the characteristic curves from the scanners, relative to the curves from the films. The processing scheme was applied to both sets, before and after the polynomial correction. The results indicated clearly the influence of the mammogram digitization on the performance of processing schemes intended to detect microcalcifications. The image processing techniques applied to mammograms digitized by both scanners, without the polynomial intensity correction, resulted in a better sensibility in detecting microcalcifications in the images from the laser scanner. However, when the polynomial correction was applied to the images from the optical scanner, no differences in performance were observed for both types of images. (C) 2008 SPIE and IS&T [DOI: 10.1117/1.3013544]

Cultivo da microalga marinha Chaetoceros calcitrans (BACILLARIOPHYCEAE) utilizando diferentes tipos de água marinha artificial

The use of microalgae as live food to a wide variety of organisms is one of the most important aspects in aquaculture. Several commercial formulations have been available in the marine aquarium market in order to prepare artificial sea water (ASW). The present study accounted microalgae Chaetoceros calcitrans performance cultured using different ASW in comparison to natural seawater(NSW). it was carried out using red Sea, Coralife and oceanic, three different ASW brands and NSW as control. nonaerated cultures were grew in 400 mL with Conwy culture medium with five replicates each under defined conditions. All cultures began with an algal inoculum of 208.000 cells/mL. a 5-mL aliquot was removed daily from each culture for cells counts. data obtained using polynomial regression test demonstrated that all ASW brands reached higher algal density rates than the one with NSW, though the three ASW brands were significantly heterogeneous. C. calcitrans raised with oceanic and red Sea brands showed similar growth rates and both were higher than Coralife brand. the results suggest that all three ASW brands studied can be used in the culture of this microalgae specie.

Urban air pollution and chronic obstructive pulmonary disease-related emergency department visits

Background: Patients with chronic obstructive pulmonary disease (COPD) can have recurrent disease exacerbations triggered by several factors, including air pollution. Visits to the emergency respiratory department can be a direct result of short-term exposure to air pollution. The aim of this study was to investigate the relationship between the daily number of COPD emergency department visits and the daily environmental air concentrations of PM(10), SO(2), NO(2), CO and O(3) in the City of Sao Paulo, Brazil. Methods: The sample data were collected between 2001 and 2003 and are categorised by gender and age. Generalised linear Poisson regression models were adopted to control for both short-and long-term seasonal changes as well as for temperature and relative humidity. The non-linear dependencies were controlled using a natural cubic spline function. Third-degree polynomial distributed lag models were adopted to estimate both lag structures and the cumulative effects of air pollutants. Results: PM(10) and SO(2) readings showed both acute and lagged effects on COPD emergency department visits. Interquartile range increases in their concentration (28.3 mg/m(3) and 7.8 mg/m(3), respectively) were associated with a cumulative 6-day increase of 19% and 16% in COPD admissions, respectively. An effect on women was observed at lag 0, and among the elderly the lag period was noted to be longer. Increases in CO concentration showed impacts in the female and elderly groups. NO(2) and O(3) presented mild effects on the elderly and in women, respectively. Conclusion: These results indicate that air pollution affects health in a gender-and age-specific manner and should be considered a relevant risk factor that exacerbates COPD in urban environments.

Multi-trait and random regression mature weight heritability and breeding value estimates in Nelore cattle

Mature weight breeding values were estimated using a multi-trait animal model (MM) and a random regression animal model (RRM). Data consisted of 82 064 weight records from 8 145 animals, recorded from birth to eight years of age. Weights at standard ages were considered in the MM. All models included contemporary groups as fixed effects, and age of dam (linear and quadratic effects) and animal age as covariates. In the RRM, mean trends were modelled through a cubic regression on orthogonal polynomials of animal age and genetic maternal and direct and maternal permanent environmental effects were also included as random. Legendre polynomials of orders 4, 3, 6 and 3 were used for animal and maternal genetic and permanent environmental effects, respectively, considering five classes of residual variances. Mature weight (five years) direct heritability estimates were 0.35 (MM) and 0.38 (RRM). Rank correlation between sires' breeding values estimated by MM and RRM was 0.82. However, selecting the top 2% (12) or 10% (62) of the young sires based on the MM predicted breeding values, respectively 71% and 80% of the same sires would be selected if RRM estimates were used instead. The RRM modelled the changes in the (co) variances with age adequately and larger breeding value accuracies can be expected using this model.

PARTIAL STABILITY FOR A CLASS OF NONLINEAR SYSTEMS

This paper studies a nonlinear, discrete-time matrix system arising in the stability analysis of Kalman filters. These systems present an internal coupling between the state components that gives rise to complex dynamic behavior. The problem of partial stability, which requires that a specific component of the state of the system converge exponentially, is studied and solved. The convergent state component is strongly linked with the behavior of Kalman filters, since it can be used to provide bounds for the error covariance matrix under uncertainties in the noise measurements. We exploit the special features of the system-mainly the connections with linear systems-to obtain an algebraic test for partial stability. Finally, motivated by applications in which polynomial divergence of the estimates is acceptable, we study and solve a partial semistability problem.

An algorithmic Friedman-Pippenger theorem on tree embeddings and applications

An (n, d)-expander is a graph G = (V, E) such that for every X subset of V with vertical bar X vertical bar <= 2n - 2 we have vertical bar Gamma(G)(X) vertical bar >= (d + 1) vertical bar X vertical bar. A tree T is small if it has at most n vertices and has maximum degree at most d. Friedman and Pippenger (1987) proved that any ( n; d)- expander contains every small tree. However, their elegant proof does not seem to yield an efficient algorithm for obtaining the tree. In this paper, we give an alternative result that does admit a polynomial time algorithm for finding the immersion of any small tree in subgraphs G of (N, D, lambda)-graphs Lambda, as long as G contains a positive fraction of the edges of Lambda and lambda/D is small enough. In several applications of the Friedman-Pippenger theorem, including the ones in the original paper of those authors, the (n, d)-expander G is a subgraph of an (N, D, lambda)-graph as above. Therefore, our result suffices to provide efficient algorithms for such previously non-constructive applications. As an example, we discuss a recent result of Alon, Krivelevich, and Sudakov (2007) concerning embedding nearly spanning bounded degree trees, the proof of which makes use of the Friedman-Pippenger theorem. We shall also show a construction inspired on Wigderson-Zuckerman expander graphs for which any sufficiently dense subgraph contains all trees of sizes and maximum degrees achieving essentially optimal parameters. Our algorithmic approach is based on a reduction of the tree embedding problem to a certain on-line matching problem for bipartite graphs, solved by Aggarwal et al. (1996).

On the resilience of long cycles in random graphs

In this paper we determine the local and global resilience of random graphs G(n,p) (p >> n(-1)) with respect to the property of containing a cycle of length at least (1 - alpha)n. Roughly speaking, given alpha > 0, we determine the smallest r(g) (G, alpha) with the property that almost surely every subgraph of G = G(n,p) having more than r(g) (G, alpha)vertical bar E(G)vertical bar edges contains a cycle of length at least (1 - alpha)n (global resilience). We also obtain, for alpha < 1/2, the smallest r(l) (G, alpha) such that any H subset of G having deg(H) (v) larger than r(l) (G, alpha) deg(G) (v) for all v is an element of V(G) contains a cycle of length at least (1 - alpha)n (local resilience). The results above are in fact proved in the more general setting of pseudorandom graphs.

TESTING STATISTICAL HYPOTHESIS ON RANDOM TREES AND APPLICATIONS TO THE PROTEIN CLASSIFICATION PROBLEM

Efficient automatic protein classification is of central importance in genomic annotation. As an independent way to check the reliability of the classification, we propose a statistical approach to test if two sets of protein domain sequences coming from two families of the Pfam database are significantly different. We model protein sequences as realizations of Variable Length Markov Chains (VLMC) and we use the context trees as a signature of each protein family. Our approach is based on a Kolmogorov-Smirnov-type goodness-of-fit test proposed by Balding et at. [Limit theorems for sequences of random trees (2008), DOI: 10.1007/s11749-008-0092-z]. The test statistic is a supremum over the space of trees of a function of the two samples; its computation grows, in principle, exponentially fast with the maximal number of nodes of the potential trees. We show how to transform this problem into a max-flow over a related graph which can be solved using a Ford-Fulkerson algorithm in polynomial time on that number. We apply the test to 10 randomly chosen protein domain families from the seed of Pfam-A database (high quality, manually curated families). The test shows that the distributions of context trees coming from different families are significantly different. We emphasize that this is a novel mathematical approach to validate the automatic clustering of sequences in any context. We also study the performance of the test via simulations on Galton-Watson related processes.

LIPSCHITZ CLASSIFICATION OF FUNCTIONS ON A HOLDER TRIANGLE

The problem of semialgebraic Lipschitz classification of quasihomogeneous polynomials on a Holder triangle is studied. For this problem, the ""moduli"" are described completely in certain combinatorial terms.

GLOBALIZATION OF TWISTED PARTIAL ACTIONS

Let A be a unital ring which is a product of possibly infinitely many indecomposable rings. We establish a criteria for the existence of a globalization for a given twisted partial action of a group on A. If the globalization exists, it is unique up to a certain equivalence relation and, moreover, the crossed product corresponding to the twisted partial action is Morita equivalent to that corresponding to its globalization. For arbitrary unital rings the globalization problem is reduced to an extendibility property of the multipliers involved in the twisted partial action.

Mechanism and model of the oscillatory electro-oxidation of methanol

A mechanism for the kinetic instabilities observed in the galvanostatic electro-oxidation of methanol is suggested and a model developed. The model is investigated using stoichiometric network analysis as well as concepts from algebraic geometry (polynomial rings and ideal theory) revealing the occurrence of a Hopf and a saddle-node bifurcation. These analytical solutions are confirmed by numerical integration of the system of differential equations. (C) 2010 American Institute of Physics

Xylooligosaccharides Production from Alkali-Pretreated Sugarcane Bagasse Using Xylanases from Thermoascus aurantiacus

Sugarcane bagasse hemicellulose was isolated in a one-step chemical extraction using hydrogen peroxide in alkaline media. The polysaccharide containing 80.9% xylose and small amounts of L-arabinose, 4-O-methyl-D-glucuronic acid and glucose, was hydrolyzed by crude enzymatic extracts from Thermoascus aurantiacus at 50 degrees C. Conditions of enzymatic hydrolysis leading to the best yields of xylose and xylooligosaccharides (DP 2-5) were investigated using substrate concentration in the range 0.5-3.5% (w/v), enzyme load 40-80 U/g of the substrate, and reaction time from 3 to 96 h, applying a 22 factorial design. The maximum conversion to xylooligosaccharides (37.1%) was obtained with 2.6% of substrate and xylanase load of 60 U/g. The predicted maximum yield of xylobiose by a polynomial model was 41.6%. Crude enzymatic extract of T. aurantiacus generate from sugarcane bagasse hemicellulose 39% of xylose, 59% of xylobiose, and 2% of other xylooligosaccharides.

An efficient heuristic for total flowtime minimisation in no-wait flowshops

In this paper, we address the problem of scheduling jobs in a no-wait flowshop with the objective of minimising the total completion time. This problem is well-known for being nondeterministic polynomial-time hard, and therefore, most contributions to the topic focus on developing algorithms able to obtain good approximate solutions for the problem in a short CPU time. More specifically, there are various constructive heuristics available for the problem [such as the ones by Rajendran and Chaudhuri (Nav Res Logist 37: 695-705, 1990); Bertolissi (J Mater Process Technol 107: 459-465, 2000), Aldowaisan and Allahverdi (Omega 32: 345-352, 2004) and the Chins heuristic by Fink and Voa (Eur J Operat Res 151: 400-414, 2003)], as well as a successful local search procedure (Pilot-1-Chins). We propose a new constructive heuristic based on an analogy with the two-machine problem in order to select the candidate to be appended in the partial schedule. The myopic behaviour of the heuristic is tempered by exploring the neighbourhood of the so-obtained partial schedules. The computational results indicate that the proposed heuristic outperforms existing ones in terms of quality of the solution obtained and equals the performance of the time-consuming Pilot-1-Chins.

Chaos-Galerkin solution of stochastic Timoshenko bending problems

This paper presents an accurate and efficient solution for the random transverse and angular displacement fields of uncertain Timoshenko beams. Approximate, numerical solutions are obtained using the Galerkin method and chaos polynomials. The Chaos-Galerkin scheme is constructed by respecting the theoretical conditions for existence and uniqueness of the solution. Numerical results show fast convergence to the exact solution, at excellent accuracies. The developed Chaos-Galerkin scheme accurately approximates the complete cumulative distribution function of the displacement responses. The Chaos-Galerkin scheme developed herein is a theoretically sound and efficient method for the solution of stochastic problems in engineering. (C) 2011 Elsevier Ltd. All rights reserved.