Resource allocation and scheduling of multiple composite web services in cloud computing using cooperative coevolution genetic algorithm

In cloud computing, resource allocation and scheduling of multiple composite web services is an important and challenging problem. This is especially so in a hybrid cloud where there may be some low-cost resources available from private clouds and some high-cost resources from public clouds. Meeting this challenge involves two classical computational problems: one is assigning resources to each of the tasks in the composite web services; the other is scheduling the allocated resources when each resource may be used by multiple tasks at different points of time. In addition, Quality-of-Service (QoS) issues, such as execution time and running costs, must be considered in the resource allocation and scheduling problem. Here we present a Cooperative Coevolutionary Genetic Algorithm (CCGA) to solve the deadline-constrained resource allocation and scheduling problem for multiple composite web services. Experimental results show that our CCGA is both efficient and scalable.

p53 prevents progression of nevi to melanoma predominantly through cell cycle regulation

p53 is the central member of a critical tumor suppressor pathway in virtually all tumor types, where it is silenced mainly by missense mutations. In melanoma, p53 predominantly remains wild type, thus its role has been neglected. To study the effect of p53 on melanocyte function and melanomagenesis, we crossed the 'high-p53'Mdm4+/- mouse to the well-established TP-ras0/+ murine melanoma progression model. After treatment with the carcinogen dimethylbenzanthracene (DMBA), TP-ras0/+ mice on the Mdm4+/- background developed fewer tumors with a delay in the age of onset of melanomas compared to TP-ras0/+ mice. Furthermore, we observed a dramatic decrease in tumor growth, lack of metastasis with increased survival of TP-ras0/+: Mdm4+/- mice. Thus, p53 effectively prevented the conversion of small benign tumors to malignant and metastatic melanoma. p53 activation in cultured primary melanocyte and melanoma cell lines using Nutlin-3, a specific Mdm2 antagonist, supported these findings. Moreover, global gene expression and network analysis of Nutlin-3-treated primary human melanocytes indicated that cell cycle regulation through the p21WAF1/CIP1 signaling network may be the key anti-melanomagenic activity of p53.

Computational approaches for modelling intrinsic noise and delays in genetic regulatory networks

This chapter focuses on the interactions and roles between delays and intrinsic noise effects within cellular pathways and regulatory networks. We address these aspects by focusing on genetic regulatory networks that share a common network motif, namely the negative feedback loop, leading to oscillatory gene expression and protein levels. In this context, we discuss computational simulation algorithms for addressing the interplay of delays and noise within the signaling pathways based on biological data. We address implementational issues associated with efficiency and robustness. In a molecular biology setting we present two case studies of temporal models for the Hes1 gene (Monk, 2003; Hirata et al., 2002), known to act as a molecular clock, and the Her1/Her7 regulatory system controlling the periodic somite segmentation in vertebrate embryos (Giudicelli and Lewis, 2004; Horikawa et al., 2006).

Evolving noisy oscillatory dynamics in genetic regulatory networks

We introduce a genetic programming (GP) approach for evolving genetic networks that demonstrate desired dynamics when simulated as a discrete stochastic process. Our representation of genetic networks is based on a biochemical reaction model including key elements such as transcription, translation and post-translational modifications. The stochastic, reaction-based GP system is similar but not identical with algorithmic chemistries. We evolved genetic networks with noisy oscillatory dynamics. The results show the practicality of evolving particular dynamics in gene regulatory networks when modelled with intrinsic noise.

Population genetic structure and patterns of dispersal in the Giant Long-Armed Prawn, Macrobrachium lar (Fabricius, 1798) (Decapoda : Palaemonidae)

The Giant Long-Armed Prawn, Macrobrachium lar is a freshwater species native to the Indo-Pacific. M. lar has a long-lived, passive, pelagic marine larval stage where larvae need to colonise freshwater within three months to complete their development. Dispersal is likely to be influenced by the extensive distances larvae must transit between small oceanic islands to find suitable freshwater habitat, and by prevailing east to west wind and ocean currents in the southern Pacific Ocean. Thus, both intrinsic and extrinsic factors are likely to influence wild population structure in this species. The present study sought to define the contemporary broad and fine-scale population genetic structure of Macrobrachium lar in the south-western Pacific Ocean. Three polymorphic microsatellite loci were used to assess patterns of genetic variation within and among 19 wild adult sample sites. Statistical procedures that partition variation implied that at both spatial scales, essentially all variation was present within sample sites and differentiation among sites was low. Any differentiation observed also was not correlated with geographical distance. Statistical approaches that measure genetic distance, at the broad-scale, showed that all south-western Pacific Islands were essentially homogeneous, with the exception of a well supported divergent Cook Islands group. These findings are likely the result of some combination of factors that may include the potential for allelic homoplasy, through to the effects of sampling regime. Based on the findings, there is most likely a divergent M. lar Cook Islands clade in the south-western Pacific Ocean, resulting from prevailing ocean currents. Confirmation of this pattern will require a more detailed analysis of nDNA variation using a larger number of loci and, where possible, use of larger population sizes.

A mathematical model for genetic regulation of the lactose operon

In this paper we construct a mathematical model for the genetic regulatory network of the lactose operon. This mathematical model contains transcription and translation of the lactose permease (LacY) and a reporter gene GFP. The probability of transcription of LacY is determined by 14 binding states out of all 50 possible binding states of the lactose operon based on the quasi-steady-state assumption for the binding reactions, while we calculate the probability of transcription for the reporter gene GFP based on 5 binding states out of 19 possible binding states because the binding site O2 is missing for this reporter gene. We have tested different mechanisms for the transport of thio-methylgalactoside (TMG) and the effect of different Hill coefficients on the simulated LacY expression levels. Using this mathematical model we have realized one of the experimental results with different LacY concentrations, which are induced by different concentrations of TMG.

Evolving genetic regulatory networks performing as stochastic switches

Recent studies have shown that small genetic regulatory networks (GRNs) can be evolved in silico displaying certain dynamics in the underlying mathematical model. It is expected that evolutionary approaches can help to gain a better understanding of biological design principles and assist in the engineering of genetic networks. To take the stochastic nature of GRNs into account, our evolutionary approach models GRNs as biochemical reaction networks based on simple enzyme kinetics and simulates them by using Gillespie’s stochastic simulation algorithm (SSA). We have already demonstrated the relevance of considering intrinsic stochasticity by evolving GRNs that show oscillatory dynamics in the SSA but not in the ODE regime. Here, we present and discuss first results in the evolution of GRNs performing as stochastic switches.

QoS-aware web service composition using genetic algorithms

Web service technology is increasingly being used to build various e-Applications, in domains such as e-Business and e-Science. Characteristic benefits of web service technology are its inter-operability, decoupling and just-in-time integration. Using web service technology, an e-Application can be implemented by web service composition — by composing existing individual web services in accordance with the business process of the application. This means the application is provided to customers in the form of a value-added composite web service. An important and challenging issue of web service composition, is how to meet Quality-of-Service (QoS) requirements. This includes customer focused elements such as response time, price, throughput and reliability as well as how to best provide QoS results for the composites. This in turn best fulfils customers’ expectations and achieves their satisfaction. Fulfilling these QoS requirements or addressing the QoS-aware web service composition problem is the focus of this project. From a computational point of view, QoS-aware web service composition can be transformed into diverse optimisation problems. These problems are characterised as complex, large-scale, highly constrained and multi-objective problems. We therefore use genetic algorithms (GAs) to address QoS-based service composition problems. More precisely, this study addresses three important subproblems of QoS-aware web service composition; QoS-based web service selection for a composite web service accommodating constraints on inter-service dependence and conflict, QoS-based resource allocation and scheduling for multiple composite services on hybrid clouds, and performance-driven composite service partitioning for decentralised execution. Based on operations research theory, we model the three problems as a constrained optimisation problem, a resource allocation and scheduling problem, and a graph partitioning problem, respectively. Then, we present novel GAs to address these problems. We also conduct experiments to evaluate the performance of the new GAs. Finally, verification experiments are performed to show the correctness of the GAs. The major outcomes from the first problem are three novel GAs: a penaltybased GA, a min-conflict hill-climbing repairing GA, and a hybrid GA. These GAs adopt different constraint handling strategies to handle constraints on interservice dependence and conflict. This is an important factor that has been largely ignored by existing algorithms that might lead to the generation of infeasible composite services. Experimental results demonstrate the effectiveness of our GAs for handling the QoS-based web service selection problem with constraints on inter-service dependence and conflict, as well as their better scalability than the existing integer programming-based method for large scale web service selection problems. The major outcomes from the second problem has resulted in two GAs; a random-key GA and a cooperative coevolutionary GA (CCGA). Experiments demonstrate the good scalability of the two algorithms. In particular, the CCGA scales well as the number of composite services involved in a problem increases, while no other algorithms demonstrate this ability. The findings from the third problem result in a novel GA for composite service partitioning for decentralised execution. Compared with existing heuristic algorithms, the new GA is more suitable for a large-scale composite web service program partitioning problems. In addition, the GA outperforms existing heuristic algorithms, generating a better deployment topology for a composite web service for decentralised execution. These effective and scalable GAs can be integrated into QoS-based management tools to facilitate the delivery of feasible, reliable and high quality composite web services.