990 resultados para Allocation factor
Resumo:
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.
Resumo:
We study the problem of allocating stocks to dark pools. We propose and analyze an optimal approach for allocations, if continuous-valued allocations are allowed. We also propose a modification for the case when only integer-valued allocations are possible. We extend the previous work on this problem to adversarial scenarios, while also improving on their results in the iid setup. The resulting algorithms are efficient, and perform well in simulations under stochastic and adversarial inputs.
Resumo:
In dynamic and uncertain environments, where the needs of security and information availability are difficult to balance, an access control approach based on a static policy will be suboptimal regardless of how comprehensive it is. Risk-based approaches to access control attempt to address this problem by allocating a limited budget to users, through which they pay for the exceptions deemed necessary. So far the primary focus has been on how to incorporate the notion of budget into access control rather than what or if there is an optimal amount of budget to allocate to users. In this paper we discuss the problems that arise from a sub-optimal allocation of budget and introduce a generalised characterisation of an optimal budget allocation function that maximises organisations expected benefit in the presence of self-interested employees and costly audit.
Resumo:
This paper describes the cloning and characterization of a new member of the vascular endothelial growth factor (VEGF) gene family, which we have designated VRF for VEGF-related-factor. Sequencing of cDNAs from a human fetal brain library and RT-PCR products from normal and tumor tissue cDNA pools indicate two alternatively spliced messages with open reading frames of 621 and 564 bp, respectively. The predicted proteins differ at their carboxyl ends resulting from a shift in the open reading frame. Both isoforms show strong homology to VEGF at their amino termini, but only the shorter isoform maintains homology to VEGF at its carboxyl terminus and conserves all 16 cysteine residues of VEGF165. Similarity comparisons of this isoform revealed overall protein identity of 48% and conservative substitution of 69% with VEGF189. VRF is predicted to contain a signal peptide, suggesting that it may be a secreted factor. The VRF gene maps to the D11S750 locus at chromosome band 11q13, and the protein coding region, spanning approximately 5 kb, is comprised of 8 exons that range in size from 36 to 431 bp. Exons 6 and 7 are contiguous and the two isoforms of VRF arise through alternate splicing of exon 6. VRF appears to be ubiquitously expressed as two transcripts of 2.0 and 5.5 kb; the level of expression is similar among normal and malignant tissues.
Resumo:
Fibroblast growth factor receptors (FGFRs) play diverse roles in the control of cell proliferation, cell differentiation, angiogenesis and development. Activating the mutations of FGFRs in the germline has long been known to cause a variety of skeletal developmental disorders, but it is only recently that a similar spectrum of somatic FGFR mutations has been associated with human cancers. Many of these somatic mutations are gain-of-function and oncogenic and create dependencies in tumor cell lines harboring such mutations. A combination of knockdown studies and pharmaceutical inhibition in preclinical models has further substantiated genomically altered FGFR as a therapeutic target in cancer, and the oncology community is responding with clinical trials evaluating multikinase inhibitors with anti-FGFR activity and a new generation of specific pan-FGFR inhibitors.
Resumo:
We have previously reported that novel vitronectin:growth factor (VN:GF) complexes significantly increase re-epithelialization in a porcine deep dermal partial-thickness burn model. However, the potential exists to further enhance the healing response through combination with an appropriate delivery vehicle which facilitates sustained local release and reduced doses of VN:GF complexes. Hyaluronic acid (HA), an abundant constituent of the interstitium, is known to function as a reservoir for growth factors and other bioactive species. The physicochemical properties of HA confer it with an ability to sustain elevated pericellular concentrations of these species. This has been proposed to arise via HA prolonging interactions of the bioactive species with cell surface receptors and/or protecting them from degradation. In view of this, the potential of HA to facilitate the topical delivery of VN:GF complexes was evaluated. Two-dimensional (2D) monolayer cell cultures and 3D de-epidermised dermis (DED) human skin equivalent (HSE) models were used to test skin cell responses to HA and VN:GF complexes. Our 2D studies revealed that VN:GF complexes and HA stimulate the proliferation of human fibroblasts but not keratinocytes. Experiments in our 3D DED-HSE models showed that VN:GF complexes, both alone and in conjunction with HA, led to enhanced development of both the proliferative and differentiating layers in the DED-HSE models. However, there was no significant difference between the thicknesses of the epidermis treated with VN:GF complexes alone and VN:GF complexes together with HA. While the addition of HA did not enhance all the cellular responses to VN:GF complexes examined, it was not inhibitory, and may confer other advantages related to enhanced absorption and transport that could be beneficial in delivery of the VN:GF complexes to wounds.
Resumo:
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.
Resumo:
Determination of the placement and rating of transformers and feeders are the main objective of the basic distribution network planning. The bus voltage and the feeder current are two constraints which should be maintained within their standard range. The distribution network planning is hardened when the planning area is located far from the sources of power generation and the infrastructure. This is mainly as a consequence of the voltage drop, line loss and system reliability. Long distance to supply loads causes a significant amount of voltage drop across the distribution lines. Capacitors and Voltage Regulators (VRs) can be installed to decrease the voltage drop. This long distance also increases the probability of occurrence of a failure. This high probability leads the network reliability to be low. Cross-Connections (CC) and Distributed Generators (DGs) are devices which can be employed for improving system reliability. Another main factor which should be considered in planning of distribution networks (in both rural and urban areas) is load growth. For supporting this factor, transformers and feeders are conventionally upgraded which applies a large cost. Installation of DGs and capacitors in a distribution network can alleviate this issue while the other benefits are gained. In this research, a comprehensive planning is presented for the distribution networks. Since the distribution network is composed of low and medium voltage networks, both are included in this procedure. However, the main focus of this research is on the medium voltage network planning. The main objective is to minimize the investment cost, the line loss, and the reliability indices for a study timeframe and to support load growth. The investment cost is related to the distribution network elements such as the transformers, feeders, capacitors, VRs, CCs, and DGs. The voltage drop and the feeder current as the constraints are maintained within their standard range. In addition to minimizing the reliability and line loss costs, the planned network should support a continual growth of loads, which is an essential concern in planning distribution networks. In this thesis, a novel segmentation-based strategy is proposed for including this factor. Using this strategy, the computation time is significantly reduced compared with the exhaustive search method as the accuracy is still acceptable. In addition to being applicable for considering the load growth, this strategy is appropriate for inclusion of practical load characteristic (dynamic), as demonstrated in this thesis. The allocation and sizing problem has a discrete nature with several local minima. This highlights the importance of selecting a proper optimization method. Modified discrete particle swarm optimization as a heuristic method is introduced in this research to solve this complex planning problem. Discrete nonlinear programming and genetic algorithm as an analytical and a heuristic method respectively are also applied to this problem to evaluate the proposed optimization method.
Resumo:
Caveats as protection for unregistered interests - lapsing and non-lapsing caveats - caveator - use only in appropriate circumstances
Resumo:
The potential of distributed reactive power control to improve the voltage profile of radial distribution feeders has been reported in literature by few authors. However, the multiple inverters injecting or absorbing reactive power across a distribution feeder may introduce control interactions and/or voltage instability. Such controller interactions can be alleviated if the inverters are allowed to operate on voltage droop. First, the paper demonstrates that a linear shallow droop line can maintain the steady state voltage profile close to reference, up to a certain level of loading. Then, impacts of the shallow droop line control on line losses and line power factors are examined. Finally, a piecewise linear droop line which can achieve reduced line losses and close to unity power factor at the feeder source is proposed.