A parallel genetic algorithm for the Steiner Problem in Networks

This paper presents a parallel genetic algorithm to the Steiner Problem in Networks. Several previous papers have proposed the adoption of GAs and others metaheuristics to solve the SPN demonstrating the validity of their approaches. This work differs from them for two main reasons: the dimension and the characteristics of the networks adopted in the experiments and the aim from which it has been originated. The reason that aimed this work was namely to build a comparison term for validating deterministic and computationally inexpensive algorithms which can be used in practical engineering applications, such as the multicast transmission in the Internet. On the other hand, the large dimensions of our sample networks require the adoption of a parallel implementation of the Steiner GA, which is able to deal with such large problem instances.

Synthesis of a systolic array genetic algorithm

The paper presents a design for a hardware genetic algorithm which uses a pipeline of systolic arrays. These arrays have been designed using systolic synthesis techniques which involve expressing the algorithm as a set of uniform recurrence relations. The final design divorces the fitness function evaluation from the hardware and can process chromosomes of different lengths, giving the design a generic quality. The paper demonstrates the design methodology by progressively re-writing a simple genetic algorithm, expressed in C code, into a form from which systolic structures can be deduced. This paper extends previous work by introducing a simplification to a previous systolic design for the genetic algorithm. The simplification results in the removal of 2N 2 + 4N cells and reduces the time complexity by 3N + 1 cycles.

The systolic array genetic algorithm, an example of systolic arrays as a reconfigurable design methodology

We advocate the use of systolic design techniques to create custom hardware for Custom Computing Machines. We have developed a hardware genetic algorithm based on systolic arrays to illustrate the feasibility of the approach. The architecture is independent of the lengths of chromosomes used and can be scaled in size to accommodate different population sizes. An FPGA prototype design can process 16 million genes per second.

Time patterns in UK demand for alcohol and tobacco: an application of the EM algorithm

Capturing the pattern of structural change is a relevant task in applied demand analysis, as consumer preferences may vary significantly over time. Filtering and smoothing techniques have recently played an increasingly relevant role. A dynamic Almost Ideal Demand System with random walk parameters is estimated in order to detect modifications in consumer habits and preferences, as well as changes in the behavioural response to prices and income. Systemwise estimation, consistent with the underlying constraints from economic theory, is achieved through the EM algorithm. The proposed model is applied to UK aggregate consumption of alcohol and tobacco, using quarterly data from 1963 to 2003. Increased alcohol consumption is explained by a preference shift, addictive behaviour and a lower price elasticity. The dynamic and time-varying specification is consistent with the theoretical requirements imposed at each sample point. (c) 2005 Elsevier B.V. All rights reserved.

Bayesian analysis of an inverse Gaussian correlated frailty model

In survival analysis frailty is often used to model heterogeneity between individuals or correlation within clusters. Typically frailty is taken to be a continuous random effect, yielding a continuous mixture distribution for survival times. A Bayesian analysis of a correlated frailty model is discussed in the context of inverse Gaussian frailty. An MCMC approach is adopted and the deviance information criterion is used to compare models. As an illustration of the approach a bivariate data set of corneal graft survival times is analysed. (C) 2006 Elsevier B.V. All rights reserved.

Numbers of antral follicles during follicular waves in cattle: Evidence for high variation among animals, very high repeatability in individuals, and an inverse association with serum follicle-stimulating hormone concentrations

The extent, causes, and physiological significance of the variation in number of follicles growing during ovarian follicular waves in human beings and cattle are unknown. Therefore, the present study examined the variability and repeatability in numbers of follicles 3 mm or greater in diameter during the follicular waves in bovine estrous cycles, and we determined if the variation in number of follicles during waves was associated with alterations in secretion of FSH, estradiol, inhibin, and insulin-like growth factor I (IGF-I). Dairy cattle were subjected to twice-daily ultrasound analysis to count total number of antral follicles 3 mm or greater in diameter throughout 138 different follicular waves. In another study, blood samples were taken at frequent intervals from cows that consistently had low or very high numbers of follicles during waves and were subjected to immunoassays. Results indicate the following: First, despite an approximately sevenfold variation in number of follicles during waves among animals and marked differences in age, stage of lactation, and season of the year, a very highly repeatable (0.95) number of follicles 3 mm or greater in diameter is maintained during the ovulatory and nonovulatory follicular waves of individuals. Second, variation in number of follicles 3 mm or greater in diameter during waves and the inverse association of number of follicles during waves with FSH are not directly explained by alterations in the patterns of secretion of estradiol, inhibin, or IGF-I. Third, ovarian ultrasound analysis can be used reliably by investigators to identify cattle that consistently have low or high numbers of follicles during waves, thus providing a novel experimental model to determine the causes and physiological significance of the high variation in antral follicle number during follicular waves among single-ovulating species, such as cattle or humans.

Mechanisms of inverse agonist action at D-2 dopamine receptors

1 Mechanisms of inverse agonist action at the D-2(short) dopamine receptor have been examined. 2 Discrimination of G-protein-coupled and -uncoupled forms of the receptor by inverse agonists was examined in competition ligand-binding studies versus the agonist [H-3]NPA at a concentration labelling both G-protein-coupled and -uncoupled receptors. 3 Competition of inverse agonists versus [H-3] NPA gave data that were fitted best by a two-binding site model in the absence of GTP but by a one-binding site model in the presence of GTP. K-i values were derived from the competition data for binding of the inverse agonists to G-protein-uncoupled and -coupled receptors. K-coupled and K-uncoupled were statistically different for the set of compounds tested ( ANOVA) but the individual values were different in a post hoc test only for (+)-butaclamol. 4 These observations were supported by simulations of these competition experiments according to the extended ternary complex model. 5 Inverse agonist efficacy of the ligands was assessed from their ability to reduce agonist-independent [S-35]GTPγ S binding to varying degrees in concentration-response curves. Inverse agonism by (+)-butaclamol and spiperone occurred at higher potency when GDP was added to assays, whereas the potency of (-)-sulpiride was unaffected. 6 These data show that some inverse agonists ((+)-butaclamol, spiperone) achieve inverse agonism by stabilising the uncoupled form of the receptor at the expense of the coupled form. For other compounds tested, we were unable to define the mechanism.