Chaotic Synchronization in Discrete-Time Systems Connected by Bandlimited Channels

Due to the broadband characteristic of chaotic signals, many of the methods that have been proposed for synchronizing chaotic systems do not usually present a satisfactory performance when applied to bandlimited communication channels. Here, the effects of bandwidth limitations imposed by the channel on the synchronous solution of a discrete-time chaotic master-slave network are investigated. The discrete-time system considered in this study is the Henon map. It is analytically shown that synchronism can be achieved in such a network by introducing a digital filter in the feedback loop responsible for generating the chaotic signal that will be sent to the slave node. Numerical simulations relating the filter parameters, such as its order and cut-off frequency, to the maximum Lyapunov exponent of the master node, which determines if the transmitted signal is chaotic or not, are also presented. These results can be useful for practical communication schemes based on chaos.

Some heuristic algorithms for total tardiness minimization in a flowshop with blocking

The flowshop scheduling problem with blocking in-process is addressed in this paper. In this environment, there are no buffers between successive machines: therefore intermediate queues of jobs waiting in the system for their next operations are not allowed. Heuristic approaches are proposed to minimize the total tardiness criterion. A constructive heuristic that explores specific characteristics of the problem is presented. Moreover, a GRASP-based heuristic is proposed and Coupled with a path relinking strategy to search for better outcomes. Computational tests are presented and the comparisons made with an adaptation of the NEH algorithm and with a branch-and-bound algorithm indicate that the new approaches are promising. (c) 2007 Elsevier Ltd. All rights reserved.

Evaluation of algorithms used to order markers on genetic maps

When building genetic maps, it is necessary to choose from several marker ordering algorithms and criteria, and the choice is not always simple. In this study, we evaluate the efficiency of algorithms try (TRY), seriation (SER), rapid chain delineation (RCD), recombination counting and ordering (RECORD) and unidirectional growth (UG), as well as the criteria PARF (product of adjacent recombination fractions), SARF (sum of adjacent recombination fractions), SALOD (sum of adjacent LOD scores) and LHMC (likelihood through hidden Markov chains), used with the RIPPLE algorithm for error verification, in the construction of genetic linkage maps. A linkage map of a hypothetical diploid and monoecious plant species was simulated containing one linkage group and 21 markers with fixed distance of 3 cM between them. In all, 700 F(2) populations were randomly simulated with and 400 individuals with different combinations of dominant and co-dominant markers, as well as 10 and 20% of missing data. The simulations showed that, in the presence of co-dominant markers only, any combination of algorithm and criteria may be used, even for a reduced population size. In the case of a smaller proportion of dominant markers, any of the algorithms and criteria (except SALOD) investigated may be used. In the presence of high proportions of dominant markers and smaller samples (around 100), the probability of repulsion linkage increases between them and, in this case, use of the algorithms TRY and SER associated to RIPPLE with criterion LHMC would provide better results. Heredity (2009) 103, 494-502; doi:10.1038/hdy.2009.96; published online 29 July 2009

Effect of follicular wave synchronization on in vitro embryo production in heifers

Aiming to achieve the ideal time of ovum pick-up (OPU) for in vitro embryo production (IVP) in crossbred heifers, two Latin square design studies investigated the effect of ovarian follicular wave synchronization with estradiol benzoate (EB) and progestins. For each experiment, crossbred heifers stage of estrous cycle was synchronized either with a norgestomet ear implant (Experiment 1) or a progesterone intravaginal device (Experiment 2) for 7d, followed by the administration of 150 mu g D-cloprostenol. On Day 7, all follicles >3 mm in diameter were aspirated and implants/devices were replaced by new ones. Afterwards, implant/device replacement was conducted every 14 d. Each experiment had three treatment groups. In Experiment I (n = 12), heifers in Group 2X had their follicles aspirated twice a week and those in Groups 1X and 1X-EB were submitted to OPU once a week for a period of 28 d. Heifers from Group 1X-EB also received 2 mg EB i.m. immediately after each OPU session. In Experiment 2 (n = 11), animals from Group 0EB did not receive EB while heifers in Groups 2EB and 5EB received 2 and 5 mg of EB respectively, immediately after OPU. The OPU sessions were performed once weekly for 28 d. Therefore, in both experiments, four OPU sessions were performed in heifers aspirated once a week and in Experiment 1, eight OPU sessions were done in heifers aspirated twice a week. Additionally, during the 7-d period following follicular aspiration, ovarian ultrasonography examinations were conducted to measure diameter of the largest follicle and blood samples were collected for FSH quantification by RIA. In Experiment 1, all viable oocytes recovered were in vitro matured and fertilized. Results indicated that while progestin and EB altered follicular wave patterns, this treatment did not prevent establishment of follicular dominance on the ovaries of heifers during OPU at 7-d intervals. Furthermore, the proposed stage of follicular wave synchronization strategies did not improve the number and quality of the recovered oocytes, or the number of in vitro produced embryos. (C) 2009 Elsevier B.V. All rights reserved.

Algorithms for sequence analysis via mutagenesis

Despite many successes of conventional DNA sequencing methods, some DNAs remain difficult or impossible to sequence. Unsequenceable regions occur in the genomes of many biologically important organisms, including the human genome. Such regions range in length from tens to millions of bases, and may contain valuable information such as the sequences of important genes. The authors have recently developed a technique that renders a wide range of problematic DNAs amenable to sequencing. The technique is known as sequence analysis via mutagenesis (SAM). This paper presents a number of algorithms for analysing and interpreting data generated by this technique.

Comparison of BR and QR Eigenvalue Algorithms for Power System Small Signal Stability Analysis

The BR algorithm is a novel and efficient method to find all eigenvalues of upper Hessenberg matrices and has never been applied to eigenanalysis for power system small signal stability. This paper analyzes differences between the BR and the QR algorithms with performance comparison in terms of CPU time based on stopping criteria and storage requirement. The BR algorithm utilizes accelerating strategies to improve its performance when computing eigenvalues of narrowly banded, nearly tridiagonal upper Hessenberg matrices. These strategies significantly reduce the computation time at a reasonable level of precision. Compared with the QR algorithm, the BR algorithm requires fewer iteration steps and less storage space without depriving of appropriate precision in solving eigenvalue problems of large-scale power systems. Numerical examples demonstrate the efficiency of the BR algorithm in pursuing eigenanalysis tasks of 39-, 68-, 115-, 300-, and 600-bus systems. Experiment results suggest that the BR algorithm is a more efficient algorithm for large-scale power system small signal stability eigenanalysis.

A study of the stability of subcycling algorithms in structural dynamics

Algorithms for explicit integration of structural dynamics problems with multiple time steps (subcycling) are investigated. Only one such algorithm, due to Smolinski and Sleith has proved to be stable in a classical sense. A simplified version of this algorithm that retains its stability is presented. However, as with the original version, it can be shown to sacrifice accuracy to achieve stability. Another algorithm in use is shown to be only statistically stable, in that a probability of stability can be assigned if appropriate time step limits are observed. This probability improves rapidly with the number of degrees of freedom in a finite element model. The stability problems are shown to be a property of the central difference method itself, which is modified to give the subcycling algorithm. A related problem is shown to arise when a constraint equation in time is introduced into a time-continuous space-time finite element model. (C) 1998 Elsevier Science S.A.

Observation of generalized synchronization of chaos in a driven chaotic system

We report on the experimental observation of the generalized synchronization of chaos in a real physical system. We show that under a nonlinear resonant interaction, the chaotic dynamics of a single mode laser can become functionally related to that of a chaotic driving signal and furthermore as the coupling strength is further increased, the chaotic dynamics of the laser approaches that of the driving signal.

Extended GCD and Hermite normal form algorithms via lattice basis reduction

Extended gcd calculation has a long history and plays an important role in computational number theory and linear algebra. Recent results have shown that finding optimal multipliers in extended gcd calculations is difficult. We present an algorithm which uses lattice basis reduction to produce small integer multipliers x(1), ..., x(m) for the equation s = gcd (s(1), ..., s(m)) = x(1)s(1) + ... + x(m)s(m), where s1, ... , s(m) are given integers. The method generalises to produce small unimodular transformation matrices for computing the Hermite normal form of an integer matrix.

Stages of chaotic synchronization

In an experimental investigation of the response of a chaotic system to a chaotic driving force, we have observed synchronization of chaos of the response system in the forms of generalized synchronization, phase synchronization, and lag synchronization to the driving signal. In this paper we compare the features of these forms of synchronized chaos and study their relations and physical origins. We found that different forms of chaotic synchronization could be interpreted as different stages of nonlinear interaction between the coupled chaotic systems. (C) 1998 American Institute of Physics.

Synchronization of estrus and fertility in zebu beef heifers treated with three estrus synchronization protocols

The effects on estrus and fertility of 3 estrus synchronization protocols were studied in Brahman beef heifers. In Treatment 1 (PGF protocol; n=234), heifers received 7.5 mg, im prostianol on Day 0 and were inseminated after observed estrus until Day 5. Treatment 2 (10-d NOR protocol; n=220) consisted of norgestomet (NOR; 3 mg, sc implant and 3 mg, im) and estradiol valerate (5 mg, im) treatment on Day -10, NOR implant removal and 400 IU, im PMSG on Day 0, and AI after observed estrus through to Day 5. Treatment 3 (14-d NOR+PGF protocol; n=168) constituted a NOR implant (3 mg, sc) on Day -14, NOR implant removal on Day 0, PGF on Day 16, and AI after observed estrus through to Day 21. All heifers were examined for return to estrus at the next cycle and inseminated after observed estrus. The heifers were then exposed to bulls for at least 21 d. During the period of estrus observation (5 d) after treatment, those heifers treated with the PGF protocol had a lower (P

Effects of data characteristics on the results of reserve selection algorithms

We tested the effects of four data characteristics on the results of reserve selection algorithms. The data characteristics were nestedness of features (land types in this case), rarity of features, size variation of sites (potential reserves) and size of data sets (numbers of sites and features). We manipulated data sets to produce three levels, with replication, of each of these data characteristics while holding the other three characteristics constant. We then used an optimizing algorithm and three heuristic algorithms to select sites to solve several reservation problems. We measured efficiency as the number or total area of selected sites, indicating the relative cost of a reserve system. Higher nestedness increased the efficiency of all algorithms (reduced the total cost of new reserves). Higher rarity reduced the efficiency of all algorithms (increased the total cost of new reserves). More variation in site size increased the efficiency of all algorithms expressed in terms of total area of selected sites. We measured the suboptimality of heuristic algorithms as the percentage increase of their results over optimal (minimum possible) results. Suboptimality is a measure of the reliability of heuristics as indicative costing analyses. Higher rarity reduced the suboptimality of heuristics (increased their reliability) and there is some evidence that more size variation did the same for the total area of selected sites. We discuss the implications of these results for the use of reserve selection algorithms as indicative and real-world planning tools.

Genetic algorithms for design of liquid retaining structure

In this paper, genetic algorithm (GA) is applied to the optimum design of reinforced concrete liquid retaining structures, which comprise three discrete design variables, including slab thickness, reinforcement diameter and reinforcement spacing. GA, being a search technique based on the mechanics of natural genetics, couples a Darwinian survival-of-the-fittest principle with a random yet structured information exchange amongst a population of artificial chromosomes. As a first step, a penalty-based strategy is entailed to transform the constrained design problem into an unconstrained problem, which is appropriate for GA application. A numerical example is then used to demonstrate strength and capability of the GA in this domain problem. It is shown that, only after the exploration of a minute portion of the search space, near-optimal solutions are obtained at an extremely converging speed. The method can be extended to application of even more complex optimization problems in other domains.

Use of the q-Gaussian mutation in evolutionary algorithms

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.