49 resultados para PLC and SCADA programming

em Biblioteca Digital da Produção Intelectual da Universidade de São Paulo (BDPI/USP)


Relevância:

100.00% 100.00%

Publicador:

Resumo:

Neospora caninum is an apicomplexan parasite responsible for major economic losses due to abortions in cattle. Toll-like receptors (TLRs) sense specific microbial products and direct downstream signaling pathways in immune cells, linking innate, and adaptive immunity. Here, we analyze the role of TLR2 on innate and adaptive immune responses during N. caninum infection. Inflammatory peritoneal macrophages and bone marrow-derived dendritic cells exposed to N. caninum-soluble antigens presented an upregulated expression of TLR2. Increased receptor expression was correlated to TLR2/MyD88-dependent antigen-presenting cell maturation and pro-inflammatory cytokine production after stimulation by antigens. Impaired innate responses observed after infection of mice genetically deficient for TLR2((-/-)) was followed by downregulation of adaptive T helper 1 (Th1) immunity, represented by diminished parasite-specific CD4(+) and CD8(+) T-cell proliferation, IFN-gamma:interleukin (IL)-10 ratio, and IgG subclass synthesis. In parallel, TLR2(-/-) mice presented higher parasite burden than wild-type (WT) mice at acute and chronic stages of infection. These results show that initial recognition of N. caninum by TLR2 participates in the generation of effector immune responses against N. caninum and imply that the receptor may be a target for future prophylactic strategies against neosporosis. Immunology and Cell Biology (2010) 88, 825-833; doi:10.1038/icb.2010.52; published online 20 April 2010

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The economic occupation of an area of 500 ha for Piracicaba was studied with the irrigated cultures of maize, tomato, sugarcane and beans, having used models of deterministic linear programming and linear programming including risk for the Target-Motad model, where two situations had been analyzed. In the deterministic model the area was the restrictive factor and the water was not restrictive for none of the tested situations. For the first situation the gotten maximum income was of R$ 1,883,372.87 and for the second situation it was of R$ 1,821,772.40. In the model including risk a producer that accepts risk can in the first situation get the maximum income of R$ 1,883,372. 87 with a minimum risk of R$ 350 year(-1), and in the second situation R$ 1,821,772.40 with a minimum risk of R$ 40 year(-1). Already a producer averse to the risk can get in the first situation a maximum income of R$ 1,775,974.81 with null risk and for the second situation R$ 1.707.706, 26 with null risk, both without water restriction. These results stand out the importance of the inclusion of the risk in supplying alternative occupations to the producer, allowing to a producer taking of decision considered the risk aversion and the pretension of income.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

The effects of PLC and Pkc inhibitors on Aspergillus nidulans depend on the carbon source. PLC inhibitors Spm and C48/80 delayed the first nuclear division in cultures growing on glucose, but stimulated it in media supplemented with pectin. Less intense were these effects on the mutant transformed with PLC-A gene rupture (AP27). Neomycin also delayed the germination in cultures growing on glucose or pectin; however, on glucose, the nuclear division was inhibited whereas in pectin it was stimulated. These effects were minor in AP27. The effects of Ro-31-8425 and BIM (both Pkc inhibitors) were also opposite for cultures growing on glucose or pectin. On glucose cultures of both strains BIM delayed germination and the first nuclear division, whereas on pectin both parameters were stimulated. Opposite effects were also detected when the cultures were growing on glucose or pectin in the presence of Ro-31-8425.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Nos últimos 20 anos, houve uma melhoria de praticamente todos os indicadores da saúde materna no Brasil, assim como grande ampliação do acesso aos serviços de saúde. Paradoxalmente, não há qualquer evidência de melhoria na mortalidade materna. Este texto tem como objetivo trazer elementos para a compreensão deste paradoxo, através do exame dos modelos típicos de assistência ao parto, no SUS e no setor privado. Analisaremos as propostas de mudança para uma assistência mais baseada em evidências sobre a segurança destes modelos, sua relação com os direitos das mulheres, e com os conflitos de interesse e resistências à mudança dos modelos. Examinamos os pressupostos de gênero que modulam a assistência e os vieses de gênero na pesquisa neste campo, expressos na superestimação dos benefícios da tecnologia, e na subestimação ou na negação dos desconfortos e efeitos adversos das intervenções. Crenças da cultura sexual não raro são tidas como explicações 'científicas' sobre o corpo, a parturição e a sexualidade, e se refletem na imposição de sofrimentos e riscos desnecessários, nas intervenções danosas à integridade genital, e na negação do direito a acompanhantes. Esta 'pessimização do parto' é instrumental para favorecer, por comparação, o modelo da cesárea de rotina. Por fim, discutimos como o uso da categoria gênero pode contribuir para promover direitos e mudanças institucionais, como no caso dos acompanhantes no parto

Relevância:

100.00% 100.00%

Publicador:

Resumo:

In this paper we use the Hermite-Biehler theorem to establish results on the design of proportional plus integral plus derivative (PID) controllers for a class of time delay systems. Using the property of interlacing at high frequencies of the class of systems considered and linear programming we obtain the set of all stabilizing PID controllers. As far as we know, previous results on the synthesis of PID controllers rely on the solution of transcendental equations. This paper also extends previous results on the synthesis of proportional controllers for a class of delay systems Of retarded type to a larger class of delay systems. (C) 2009 Elsevier Ltd. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

We examine the representation of judgements of stochastic independence in probabilistic logics. We focus on a relational logic where (i) judgements of stochastic independence are encoded by directed acyclic graphs, and (ii) probabilistic assessments are flexible in the sense that they are not required to specify a single probability measure. We discuss issues of knowledge representation and inference that arise from our particular combination of graphs, stochastic independence, logical formulas and probabilistic assessments. (C) 2007 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper investigates probabilistic logics endowed with independence relations. We review propositional probabilistic languages without and with independence. We then consider graph-theoretic representations for propositional probabilistic logic with independence; complexity is analyzed, algorithms are derived, and examples are discussed. Finally, we examine a restricted first-order probabilistic logic that generalizes relational Bayesian networks. (c) 2007 Elsevier Inc. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper presents new insights and novel algorithms for strategy selection in sequential decision making with partially ordered preferences; that is, where some strategies may be incomparable with respect to expected utility. We assume that incomparability amongst strategies is caused by indeterminacy/imprecision in probability values. We investigate six criteria for consequentialist strategy selection: Gamma-Maximin, Gamma-Maximax, Gamma-Maximix, Interval Dominance, Maximality and E-admissibility. We focus on the popular decision tree and influence diagram representations. Algorithms resort to linear/multilinear programming; we describe implementation and experiments. (C) 2010 Elsevier B.V. All rights reserved.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

This paper proposes the use of the q-Gaussian mutation with self-adaptation of the shape of the mutation distribution in evolutionary algorithms. The shape of the q-Gaussian mutation distribution is controlled by a real parameter q. In the proposed method, the real parameter q of the q-Gaussian mutation is encoded in the chromosome of individuals and hence is allowed to evolve during the evolutionary process. In order to test the new mutation operator, evolution strategy and evolutionary programming algorithms with self-adapted q-Gaussian mutation generated from anisotropic and isotropic distributions are presented. The theoretical analysis of the q-Gaussian mutation is also provided. In the experimental study, the q-Gaussian mutation is compared to Gaussian and Cauchy mutations in the optimization of a set of test functions. Experimental results show the efficiency of the proposed method of self-adapting the mutation distribution in evolutionary algorithms.

Relevância:

100.00% 100.00%

Publicador:

Resumo:

Mutation testing has been used to assess the quality of test case suites by analyzing the ability in distinguishing the artifact under testing from a set of alternative artifacts, the so-called mutants. The mutants are generated from the artifact under testing by applying a set of mutant operators, which produce artifacts with simple syntactical differences. The mutant operators are usually based on typical errors that occur during the software development and can be related to a fault model. In this paper, we propose a language-named MuDeL (MUtant DEfinition Language)-for the definition of mutant operators, aiming not only at automating the mutant generation, but also at providing precision and formality to the operator definition. The proposed language is based on concepts from transformational and logical programming paradigms, as well as from context-free grammar theory. Denotational semantics formal framework is employed to define the semantics of the MuDeL language. We also describe a system-named mudelgen-developed to support the use of this language. An executable representation of the denotational semantics of the language is used to check the correctness of the implementation of mudelgen. At the very end, a mutant generator module is produced, which can be incorporated into a specific mutant tool/environment. (C) 2008 Elsevier Ltd. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Even though the involvement of intracellular Ca(2+) (Ca(i)(2+)) in hematopoiesis has been previously demonstrated, the relationship between Ca(i)(2+) signaling and cytokine-induced intracellular pathways remains poorly understood. Herein, the molecular mechanisms integrating Ca(2+) signaling with the extracellular signal-regulated kinase 1/2 (ERK1/2) pathway in primary murine and human hematopoietic stem/progenitor cells stimulated by IL-3 and GM-CSF were studied. Our results demonstrated that IL-3 and GM-CSF stimulation induced increased inositol 1,4,5-trisphosphate (IP(3)) levels and Ca(i)(2+) release in murine and human hematopoietic stem/ progenitor cells. In addition, Ca(i)(2+) signaling inhibitors, such as inositol 1,4,5-trisphosphate receptor antagonist (2-APB), PKC inhibitor (GF109203), and CaMKII inhibitor (KN-62), blocked phosphorylation of MEK activated by IL-3 and GM-CSF, suggesting the participation of Ca(2+)-dependent kinases in MEK activation. In addition, we identify phospholipase C gamma 2 (PLC gamma 2) as a PLC gamma responsible for the induction of Ca(2+) release by IL-3 and GM-CSF in hematopoietic stem/progenitor cells. Furthermore, the PLCg inhibitor U73122 significantly reduced the numbers of granulocyte-macrophage colony-forming units after cytokine stimulation. Similar results were obtained in both murine and human hematopoietic stem/progenitor cells. Taken together, these data indicate a role for PLC gamma 2 and Ca(2+) signaling through the modulation of MEK in both murine and human hematopoietic stem/ progenitor cells. J. Cell. Physiol. 226: 1780-1792, 2011. (C) 2010 Wiley-Liss, Inc.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

Substance-dependence is highly associated with executive cognitive function (ECF) impairments. However. considering that it is difficult to assess ECF clinically, the aim of the present study was to examine the feasibility of a brief neuropsychological tool (the Frontal Assessment Battery FAB) to detect specific ECF impairments in a sample of substance-dependent individuals (SDI). Sixty-two subjects participated in this study. Thirty DSM-IV-diagnosed SDI, after 2 weeks of abstinence, and 32 healthy individuals (control group) were evaluated with FAD and other ECF-related tasks: digits forward (DF), digits backward (DB), Stroop Color Word Test (SCWT), and Wisconsin Card Sorting Test (WCST). SDI did not differ from the control group on sociodemographic variables or IQ. However, SDI performed below the controls in OF, DB, and FAB. The SDI were cognitively impaired in 3 of the 6 cognitive domains assessed by the FAB: abstract reasoning, motor programming, and cognitive flexibility. The FAB correlated with DF, SCWT, and WCST. In addition, some neuropsychological measures were correlated with the amount of alcohol, cannabis, and cocaine use. In conclusion, SDI performed more poorly than the comparison group on the FAB and the FAB`s results were associated with other ECF-related tasks. The results suggested a negative impact of alcohol, cannabis, and cocaine use on the ECF. The FAB may be useful in assisting professionals as an instrument to screen for ECF-related deficits in SDI. (C) 2010 Elsevier Ltd. All rights reserved.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

This paper describes the first phase of a project attempting to construct an efficient general-purpose nonlinear optimizer using an augmented Lagrangian outer loop with a relative error criterion, and an inner loop employing a state-of-the art conjugate gradient solver. The outer loop can also employ double regularized proximal kernels, a fairly recent theoretical development that leads to fully smooth subproblems. We first enhance the existing theory to show that our approach is globally convergent in both the primal and dual spaces when applied to convex problems. We then present an extensive computational evaluation using the CUTE test set, showing that some aspects of our approach are promising, but some are not. These conclusions in turn lead to additional computational experiments suggesting where to next focus our theoretical and computational efforts.

Relevância:

40.00% 40.00%

Publicador:

Resumo:

We investigate several two-dimensional guillotine cutting stock problems and their variants in which orthogonal rotations are allowed. We first present two dynamic programming based algorithms for the Rectangular Knapsack (RK) problem and its variants in which the patterns must be staged. The first algorithm solves the recurrence formula proposed by Beasley; the second algorithm - for staged patterns - also uses a recurrence formula. We show that if the items are not so small compared to the dimensions of the bin, then these algorithms require polynomial time. Using these algorithms we solved all instances of the RK problem found at the OR-LIBRARY, including one for which no optimal solution was known. We also consider the Two-dimensional Cutting Stock problem. We present a column generation based algorithm for this problem that uses the first algorithm above mentioned to generate the columns. We propose two strategies to tackle the residual instances. We also investigate a variant of this problem where the bins have different sizes. At last, we study the Two-dimensional Strip Packing problem. We also present a column generation based algorithm for this problem that uses the second algorithm above mentioned where staged patterns are imposed. In this case we solve instances for two-, three- and four-staged patterns. We report on some computational experiments with the various algorithms we propose in this paper. The results indicate that these algorithms seem to be suitable for solving real-world instances. We give a detailed description (a pseudo-code) of all the algorithms presented here, so that the reader may easily implement these algorithms. (c) 2007 Elsevier B.V. All rights reserved.