Synchronization of estrus and ovulation and associated endocrine changes in Bos indicus cows

The effects of 4 estrus synchronization treatments on intervals to and synchrony of estrus and ovulation, on timing of the preovulatory LH surge and associated changes in plasma progesterone, LH, FSH, and 17 beta-estradiol (E(2)) were investigated in 48 Bos indicus cows. Treatment 1 consisted of 2 injections of PGF(2 alpha) 14 d apart (n = 12); Treatment 2 of a subcutaneous 3-mg norgestomet implant and an intramuscular injection of 3 mg of norgestomet and 5 mg estradiol valerate, with the implant removed 10 d later (n = 12; norgestomet-estradiol); Treatment 3 of norgestomet-estradiol, with a subcutaneous injection of PMSG given at time of implant removal (Day 10; n = 12); and Treatment 4 of norgestomet implant (as for Treatments 2 and 3) inserted for 10 d, with an intramuscular injection of PGF(2 alpha) given at the time of implant removal (n = 12). The experiment was conducted in 2 replicates (24 cows/replicate, 6 cows/group). Estrus, ovulation and timing of the preovulatory surge of LH varied less in cows treated with norgestomet-estradiol and PMSG than in cows in Treatments 1 and 4 (P < 0.008). Treatment with PMSG;educed variation in ovulation times and timing of the LH surge in cows treated with norgestomet-estradiol (P < 0.02). Concentrations of E(2) were higher in cows in Treatments 2 and 3 on the final day of treatment and at about 6 h post ovulation compared with cows in Treatments 1 and 4 (P < 0.05). Different methods for synchronizing estrus did not alter sequential endocrine and behavioral changes in relation to the timing of the LH peak, and the results were consistent with current recommendations for insemination times in Bos taurus cattle. (C) 1997 by Elsevier Science Inc.

Robust algorithms for solving stochastic partial differential equations

A robust semi-implicit central partial difference algorithm for the numerical solution of coupled stochastic parabolic partial differential equations (PDEs) is described. This can be used for calculating correlation functions of systems of interacting stochastic fields. Such field equations can arise in the description of Hamiltonian and open systems in the physics of nonlinear processes, and may include multiplicative noise sources. The algorithm can be used for studying the properties of nonlinear quantum or classical field theories. The general approach is outlined and applied to a specific example, namely the quantum statistical fluctuations of ultra-short optical pulses in chi((2)) parametric waveguides. This example uses a non-diagonal coherent state representation, and correctly predicts the sub-shot noise level spectral fluctuations observed in homodyne detection measurements. It is expected that the methods used wilt be applicable for higher-order correlation functions and other physical problems as well. A stochastic differencing technique for reducing sampling errors is also introduced. This involves solving nonlinear stochastic parabolic PDEs in combination with a reference process, which uses the Wigner representation in the example presented here. A computer implementation on MIMD parallel architectures is discussed. (C) 1997 Academic Press.

Most of the patients presenting myocardial infarction would not be eligible for intensive lipid-lowering based on clinical algorithms or plasma C-reactive protein

Objective: The study we assessed how often patients who are manifesting a myocardial infarction (MI) would not be considered candidates for intensive lipid-lowering therapy based on the current guidelines. Methods: In 355 consecutive patients manifesting ST elevation MI (STEMI), admission plasma C-reactive protein (CRP) was measured and Framingham risk score (FRS), PROCAM risk score, Reynolds risk score, ASSIGN risk score, QRISK, and SCORE algorithms were applied. Cardiac computed tomography and carotid ultrasound were performed to assess the coronary artery calcium score (CAC), carotid intima-media thickness (cIMT) and the presence of carotid plaques. Results: Less than 50% of STEMI patients would be identified as having high risk before the event by any of these algorithms. With the exception of FRS (9%), all other algorithms would assign low risk to about half of the enrolled patients. Plasma CRP was <1.0 mg/L in 70% and >2 mg/L in 14% of the patients. The average cIMT was 0.8 +/- 0.2 mm and only in 24% of patients was >= 1.0 mm. Carotid plaques were found in 74% of patients. CAC > 100 was found in 66% of patients. Adding CAC >100 plus the presence of carotid plaque, a high-risk condition would be identified in 100% of the patients using any of the above mentioned algorithms. Conclusion: More than half of patients manifesting STEMI would not be considered as candidates for intensive preventive therapy by the current clinical algorithms. The addition of anatomical parameters such as CAC and the presence of carotid plaques can substantially reduce the CVD risk underestimation. (C) 2010 Elsevier Ireland Ltd. All rights reserved.

Synchronization of mutually coupled chaotic systems

We report on the experimental observation of both basic frequency locking synchronization and chaos synchronization between two mutually coupled chaotic subsystems. We show that these two kinds of synchronization are two stages of interaction between coupled chaotic systems. in particular the chaos synchronization could be understood as a state of phase locking between coupled chaotic oscillations.

Genetic algorithms for continuous optimization problems - a concept of parameter-space size adjustment

The concept of parameter-space size adjustment is pn,posed in order to enable successful application of genetic algorithms to continuous optimization problems. Performance of genetic algorithms with six different combinations of selection and reproduction mechanisms, with and without parameter-space size adjustment, were severely tested on eleven multiminima test functions. An algorithm with the best performance was employed for the determination of the model parameters of the optical constants of Pt, Ni and Cr.

Concurreny based transition refinement for the verification of distributed algorithms

We suggest a new notion of behaviour preserving transition refinement based on partial order semantics. This notion is called transition refinement. We introduced transition refinement for elementary (low-level) Petri Nets earlier. For modelling and verifying complex distributed algorithms, high-level (Algebraic) Petri nets are usually used. In this paper, we define transition refinement for Algebraic Petri Nets. This notion is more powerful than transition refinement for elementary Petri nets because it corresponds to the simultaneous refinement of several transitions in an elementary Petri net. Transition refinement is particularly suitable for refinement steps that increase the degree of distribution of an algorithm, e.g. when synchronous communication is replaced by asynchronous message passing. We study how to prove that a replacement of a transition is a transition refinement.

Serum Starvation and Full Confluency for Cell Cycle Synchronization of Domestic Cat (Felis catus) Foetal Fibroblasts

Nuclear transfer of domestic cat can be used as a tool to develop reproductive biotechnologies in wild felids. The importance of cell cycle phase during the nuclear transfer has been a matter of debate since the first mammalian clone was produced. The cell cycle phase of donor cells interferes on maintenance of correct ploidy and genetic reprogramming of the reconstructed embryo. The use of G0/G1 arrested donor cells has been shown to improve nuclear transfer efficiency. The present study was conducted to test the hypothesis that domestic cat foetal fibroblasts cultured up to the fifth passage and submitted to full confluency provide a higher percentage of cells at G0/G1 stage than fibroblasts cultured in serum starved media. Results demonstrated that serum starvation increased (p < 0.05) the percentage of G0/G1 fibroblasts when compared with control. Moreover, the combined protocol using confluency and serum starvation was more efficient (p < 0.05) synchronizing cells at G0/G1 stage than serum starvation or confluency alone for the first 3 days of treatment. In conclusion, serum starvation and full confluency act in a synergistic manner to improve domestic cat foetal fibroblast cell cycle synchronization at the G0/G1 stage.

Robust parameter settings of evolutionary algorithms for the optimisation of agricultural systems models

Numerical optimisation methods are being more commonly applied to agricultural systems models, to identify the most profitable management strategies. The available optimisation algorithms are reviewed and compared, with literature and our studies identifying evolutionary algorithms (including genetic algorithms) as superior in this regard to simulated annealing, tabu search, hill-climbing, and direct-search methods. Results of a complex beef property optimisation, using a real-value genetic algorithm, are presented. The relative contributions of the range of operational options and parameters of this method are discussed, and general recommendations listed to assist practitioners applying evolutionary algorithms to the solution of agricultural systems. (C) 2001 Elsevier Science Ltd. All rights reserved.

Using siting algorithms in the design of marine reserve networks

Using benthic habitat data from the Florida Keys (USA), we demonstrate how siting algorithms can help identify potential networks of marine reserves that comprehensively represent target habitat types. We applied a flexible optimization tool-simulated annealing-to represent a fixed proportion of different marine habitat types within a geographic area. We investigated the relative influence of spatial information, planning-unit size, detail of habitat classification, and magnitude of the overall conservation goal on the resulting network scenarios. With this method, we were able to identify many adequate reserve systems that met the conservation goals, e.g., representing at least 20% of each conservation target (i.e., habitat type) while fulfilling the overall aim of minimizing the system area and perimeter. One of the most useful types of information provided by this siting algorithm comes from an irreplaceability analysis, which is a count of the number of, times unique planning units were included in reserve system scenarios. This analysis indicated that many different combinations of sites produced networks that met the conservation goals. While individual 1-km(2) areas were fairly interchangeable, the irreplaceability analysis highlighted larger areas within the planning region that were chosen consistently to meet the goals incorporated into the algorithm. Additionally, we found that reserve systems designed with a high degree of spatial clustering tended to have considerably less perimeter and larger overall areas in reserve-a configuration that may be preferable particularly for sociopolitical reasons. This exercise illustrates the value of using the simulated annealing algorithm to help site marine reserves: the approach makes efficient use of;available resources, can be used interactively by conservation decision makers, and offers biologically suitable alternative networks from which an effective system of marine reserves can be crafted.