957 resultados para integral repair.
Resumo:
The effect of temperature on early vegetative growth, leaf chlorophyll fluorescence and chlorophyll content was examined on four genotypes of cacao (Amelonado, AMAZ 15–15, SCA 6 and SPEC 54/1). A controlled environment glasshouse was used to simulate the temperature conditions of three cacao-growing regions (Bahia, Brazil; Tafo, Ghana and Lower Perak, Malaysia) over the course of a year. Base temperatures calculated from increments in main stem growth varied from 18.6°C for AMAZ 15/15 to 20.8°C for SPEC 54/1. Temporal variation in Fv/Fm observed for two of the clones (SCA 6 and SPEC 54/1) in two of the compartments were correlated with temperature differences over time. Significant differences were also recorded between genotypes in leaf chlorophyll content. It was shown that variation over time in leaf chlorophyll content could be quantified accurately as a function of temperature and light integral. The results imply that genetic variability exists in cacao in response to temperature stress.
Resumo:
In mammalian cells, DNA ligase IIIalpha and DNA ligase I participate in the short- and long-patch base excision repair pathways, respectively. Using an in vitro repair assay employing DNA ligase-depleted cell extracts and DNA substrates containing a single lesion repaired either through short-patch (regular abasic site) or long-patch (reduced abasic site) base excision repair pathways, we addressed the question whether DNA ligases are specific to each pathway or if they are exchangeable. We find that immunodepletion of DNA ligase I did not affect the short-patch repair pathway but blocked long-patch repair, suggesting that DNA ligase IIIa is not able to substitute DNA ligase I during long-patch repair. In contrast, immunodepletion of DNA ligase IIIa did not significantly affect either pathway. Moreover, repair of normal abasic sites in wild-type and X-ray cross-complementing gene 1 (XRCC1)-DNA ligase IIIalpha-immunodepleted cell extracts involved similar proportions of short- and long-patch repair events. This suggests that DNA ligase I was able to efficiently substitute the XRCC1-DNA ligase IIIa complex during short-patch repair.
Resumo:
Repair of both normal and reduced AP sites is activated by AP endonuclease, which recognizes and cleaves a phosphodiester bond 5' to the AP site. For a short period of time an incised AP site is occupied by poly(ADP-ribose) polymerase and then DNA polymerase beta adds one nucleotide into the repair gap and simultaneously removes the 5'-sugar phosphate. Finally, the DNA ligase III/XRCC1 complex accomplishes repair by sealing disrupted DNA ends. However, long-patch BER pathway, which is involved in the removal of reduced abasic sites, requires further DNA synthesis resulting in strand displacement and the generation of a damage-containing flap that is later removed by the flap endonuclease. Strand-displacement DNA synthesis is accomplished by DNA polymerase delta/epsilon and DNA ligase I restores DNA integrity. DNA synthesis by DNA polymerase delta/epsilon is dependent on proliferating cell nuclear antigen, which also stimulates the DNA ligase I and flap endonuclease. These repair events are supported by multiple protein-protein interactions. (C) 2003 Elsevier B.V. All rights reserved.
Resumo:
Commonly used repair rate models for repairable systems in the reliability literature are renewal processes, generalised renewal processes or non-homogeneous Poisson processes. In addition to these models, geometric processes (GP) are studied occasionally. The GP, however, can only model systems with monotonously changing (increasing, decreasing or constant) failure intensities. This paper deals with the reliability modelling of failure processes for repairable systems where the failure intensity shows a bathtub-type non-monotonic behaviour. A new stochastic process, i.e. an extended Poisson process, is introduced in this paper. Reliability indices are presented, and the parameters of the new process are estimated. Experimental results on a data set demonstrate the validity of the new process.
Resumo:
The basic repair rate models for repairable systems may be homogeneous Poisson processes, renewal processes or nonhomogeneous Poisson processes. In addition to these models, geometric processes are studied occasionally. Geometric processes, however, can only model systems with monotonously changing (increasing, decreasing or constant) failure intensity. This paper deals with the reliability modelling of the failure process of repairable systems when the failure intensity shows a bathtub type non-monotonic behaviour. A new stochastic process, an extended Poisson process, is introduced. Reliability indices and parameter estimation are presented. A comparison of this model with other repair models based on a dataset is made.
Resumo:
Background: Children with cleft lip and palate are at risk for psychological problems. Difficulties in mother-child interactions may be relevant, and could be affected by the timing of lip repair. Method: We assessed cognitive development, behaviour problems, and attachment in 94 infants with cleft lip (with and without cleft palate) and 96 non-affected control infants at 18 months; mother-infant interactions were assessed at two, six and 12 months. Index infants received either 'early', neonatal, lip repair, or 'late' repair (3-4 months). Results: Index infants did not differ from controls on measures of behaviour problems or attachment, regardless of timing of lip repair; however, infants having late lip repair performed worse on the Bayley Scales of Mental Development; the cognitive development of early repair infants was not impaired. Difficulties in early mother-infant interactions mediated the effects of late lip repair on infant cognitive outcome. Conclusions: Early interaction difficulties between mothers and infants having late repair of cleft lip are associated with poor cognitive functioning at 18 months. Interventions to facilitate mother-infant interactions prior to surgical lip repair should be explored.
Resumo:
Objective: To determine whether attractiveness and success of surgical outcome differ according to the timing of cleft lip repair. Design: Three experiments were conducted: (1) surgeons rated postoperative medical photographs of infants having either neonatal or 3-month lip repair; (2) lay panelists rated the same photographs; (3) lay panelists rated dynamic video displays of the infants made at 12 months. Normal comparison infants were also rated. The order of stimuli was randomized, and panelists were blind to timing of lip repair and the purposes of the study. Setting: Four U.K. regional centers for cleft lip and palate. Participants: Infants with isolated clefts of the lip, with and without palate. Intervention: Early lip repair was conducted at median age 4 days (inter-quartile range [IQR] = 4), and late repair at 104 days (IQR = 57). Main Outcome Measures: Ratings of surgical outcome (Experiment 1 only) and attractiveness (all experiments) on 5-point Likert scales. Results: In Experiment 1 success of surgical outcome was comparable for early and late repair groups (difference = -0.08; 95% confidence interval [CI] = -0.43 to 0.28; p = .66). In all three experiments, attractiveness ratings were comparable for the two groups. Differences were, respectively, 0.10 (95% CI = -2.3 to 0.44, p = .54); -0.11 (95% CI = -0.42 to -0.19, p = .54); and 0.08 (95% CI = -0.11 to 0.28, p =.41). Normal infants were rated more attractive than index infants (difference = 0.38; 95% CI = 0.24 to 0.52; p < .001). Conclusion: Neonatal repair for cleft of the lip confers no advantage over repair at 3 months in terms of perceived infant attractiveness or success of surgical outcome.
Resumo:
In this work we study the computational complexity of a class of grid Monte Carlo algorithms for integral equations. The idea of the algorithms consists in an approximation of the integral equation by a system of algebraic equations. Then the Markov chain iterative Monte Carlo is used to solve the system. The assumption here is that the corresponding Neumann series for the iterative matrix does not necessarily converge or converges slowly. We use a special technique to accelerate the convergence. An estimate of the computational complexity of Monte Carlo algorithm using the considered approach is obtained. The estimate of the complexity is compared with the corresponding quantity for the complexity of the grid-free Monte Carlo algorithm. The conditions under which the class of grid Monte Carlo algorithms is more efficient are given.
Resumo:
In this study a minimum variance neuro self-tuning proportional-integral-derivative (PID) controller is designed for complex multiple input-multiple output (MIMO) dynamic systems. An approximation model is constructed, which consists of two functional blocks. The first block uses a linear submodel to approximate dominant system dynamics around a selected number of operating points. The second block is used as an error agent, implemented by a neural network, to accommodate the inaccuracy possibly introduced by the linear submodel approximation, various complexities/uncertainties, and complicated coupling effects frequently exhibited in non-linear MIMO dynamic systems. With the proposed model structure, controller design of an MIMO plant with n inputs and n outputs could be, for example, decomposed into n independent single input-single output (SISO) subsystem designs. The effectiveness of the controller design procedure is initially verified through simulations of industrial examples.
Resumo:
We consider the classical coupled, combined-field integral equation formulations for time-harmonic acoustic scattering by a sound soft bounded obstacle. In recent work, we have proved lower and upper bounds on the $L^2$ condition numbers for these formulations, and also on the norms of the classical acoustic single- and double-layer potential operators. These bounds to some extent make explicit the dependence of condition numbers on the wave number $k$, the geometry of the scatterer, and the coupling parameter. For example, with the usual choice of coupling parameter they show that, while the condition number grows like $k^{1/3}$ as $k\to\infty$, when the scatterer is a circle or sphere, it can grow as fast as $k^{7/5}$ for a class of `trapping' obstacles. In this paper we prove further bounds, sharpening and extending our previous results. In particular we show that there exist trapping obstacles for which the condition numbers grow as fast as $\exp(\gamma k)$, for some $\gamma>0$, as $k\to\infty$ through some sequence. This result depends on exponential localisation bounds on Laplace eigenfunctions in an ellipse that we prove in the appendix. We also clarify the correct choice of coupling parameter in 2D for low $k$. In the second part of the paper we focus on the boundary element discretisation of these operators. We discuss the extent to which the bounds on the continuous operators are also satisfied by their discrete counterparts and, via numerical experiments, we provide supporting evidence for some of the theoretical results, both quantitative and asymptotic, indicating further which of the upper and lower bounds may be sharper.