976 resultados para Linear quadratic regulator controllers
Resumo:
Electron microscopy was used to monitor the fate of reconstituted nucleosome cores during in vitro transcription of long linear and supercoiled multinucleosomic templates by the prokaryotic T7 RNA polymerase and the eukaryotic RNA polymerase II. Transcription by T7 RNA polymerase disrupted the nucleosomal configuration in the transcribed region, while nucleosomes were preserved upstream of the transcription initiation site and in front of the polymerase. Nucleosome disruption was independent of the topology of the template, linear or supercoiled, and of the presence or absence of nucleosome positioning sequences in the transcribed region. In contrast, the nucleosomal configuration was preserved during transcription from the vitellogenin B1 promoter with RNA polymerase II in a rat liver total nuclear extract. However, the persistence of nucleosomes on the template was not RNA polymerase II-specific, but was dependent on another activity present in the nuclear extract. This was demonstrated by addition of the extract to the T7 RNA polymerase transcription reaction, which resulted in retention of the nucleosomal configuration. This nuclear activity, also found in HeLa cell nuclei, is heat sensitive and could not be substituted by nucleoplasmin, chromatin assembly factor (CAF-I) or a combination thereof. Altogether, these results identify a novel nuclear activity, called herein transcription-dependent chromatin stabilizing activity I or TCSA-I, which may be involved in a nucleosome transfer mechanism during transcription.
Resumo:
Intraspecific genetic variation for morphological traits is observed in many organisms. In Arabidopsis thaliana, alleles responsible for intraspecific morphological variation are increasingly being identified. However, the fitness consequences remain unclear in most cases. Here, the fitness effects of alleles of the BRX gene are investigated. A brx loss-of-function allele, which was found in a natural accession, results in a highly branched but poorly elongated root system. Comparison between the control accession Sav-0 and an introgression of brx into this background (brxS) indicated that, surprisingly, brx loss of function did not negatively affect fitness in pure stands. However, in mixed, well-watered stands brxS performance and reproductive output decreased significantly, as the proportion of Sav-0 neighbors increased. Additional comparisons between brxS and a brxS line that was complemented by a BRX transgene confirmed a direct effect of the loss-of-function allele on plant performance, as indicated by restored competitive ability of the transgenic genotype. Further, because plant height was very similar across genotypes and because the experimental setup largely excluded shading effects, the impaired competitiveness of the brx loss-of-function genotype likely reflects below-ground competition. In summary, these data reveal conditional fitness effects of a single gene polymorphism in response to intraspecific competition in Arabidopsis.
Resumo:
In this article two aims are pursued: on the one hand, to present arapidly converging algorithm for the approximation of square roots; on theother hand and based on the previous algorithm, to find the Pierce expansionsof a certain class of quadratic irrationals as an alternative way to themethod presented in 1984 by J.O. Shallit; we extend the method to findalso the Pierce expansions of quadratic irrationals of the form $2 (p-1)(p - \sqrt{p^2 - 1})$ which are not covered in Shallit's work.
Resumo:
O problema de otimização de mínimos quadrados e apresentado como uma classe importante de problemas de minimização sem restrições. A importância dessa classe de problemas deriva das bem conhecidas aplicações a estimação de parâmetros no contexto das analises de regressão e de resolução de sistemas de equações não lineares. Apresenta-se uma revisão dos métodos de otimização de mínimos quadrados lineares e de algumas técnicas conhecidas de linearização. Faz-se um estudo dos principais métodos de gradiente usados para problemas não lineares gerais: Métodos de Newton e suas modificações incluindo os métodos Quasi-Newton mais usados (DFP e BFGS). Introduzem-se depois métodos específicos de gradiente para problemas de mínimos quadrados: Gauss-Newton e Levenberg-Larquardt. Apresenta-se uma variedade de exemplos selecionados na literatura para testar os diferentes métodos usando rotinas MATLAB. Faz-se uma an alise comparativa dos algoritmos baseados nesses ensaios computacionais que exibem as vantagens e desvantagens dos diferentes métodos.
Resumo:
Mutation of the Schizosaccharomyces pombe cdc7 gene prevents formation of the division septum and cytokinesis. We have cloned the cdc7 gene and show that it encodes a protein kinase which is essential for cell division. In the absence of cdc7 function, spore germination, DNA synthesis and mitosis are unaffected, but cells are unable to initiate formation of the division septum. Overexpression of p120cdc7 causes cell cycle arrest; cells complete mitosis and then undergo multiple rounds of septum formation without cell cleavage. This phenotype, which is similar to that resulting from inactivation of cdc16 protein, requires the kinase activity of p120cdc7. Mutations inactivating the early septation gene, cdc11, suppress the formation of multiple septa and allow cells to proliferate normally. If formation of the division septum is prevented by inactivation of either cdc14 or cdc15, p120cdc7 overproduction does not interfere with other events in the mitotic cell cycle. Septation is not induced by overexpression of p120cdc7 in G2 arrested cells, indicating that it does not bypass the normal dependency of septation upon initiation of mitosis. These findings indicate that the p120cdc7 protein kinase plays a key role in initiation of septum formation and cytokinesis in fission yeast and suggest that p120cdc7 interacts with the cdc11 protein in the control of septation.
Resumo:
We present a new unifying framework for investigating throughput-WIP(Work-in-Process) optimal control problems in queueing systems,based on reformulating them as linear programming (LP) problems withspecial structure: We show that if a throughput-WIP performance pairin a stochastic system satisfies the Threshold Property we introducein this paper, then we can reformulate the problem of optimizing alinear objective of throughput-WIP performance as a (semi-infinite)LP problem over a polygon with special structure (a thresholdpolygon). The strong structural properties of such polygones explainthe optimality of threshold policies for optimizing linearperformance objectives: their vertices correspond to the performancepairs of threshold policies. We analyze in this framework theversatile input-output queueing intensity control model introduced byChen and Yao (1990), obtaining a variety of new results, including (a)an exact reformulation of the control problem as an LP problem over athreshold polygon; (b) an analytical characterization of the Min WIPfunction (giving the minimum WIP level required to attain a targetthroughput level); (c) an LP Value Decomposition Theorem that relatesthe objective value under an arbitrary policy with that of a giventhreshold policy (thus revealing the LP interpretation of Chen andYao's optimality conditions); (d) diminishing returns and invarianceproperties of throughput-WIP performance, which underlie thresholdoptimality; (e) a unified treatment of the time-discounted andtime-average cases.
Resumo:
We present an exact test for whether two random variables that have known bounds on their support are negatively correlated. The alternative hypothesis is that they are not negatively correlated. No assumptions are made on the underlying distributions. We show by example that the Spearman rank correlation test as the competing exact test of correlation in nonparametric settings rests on an additional assumption on the data generating process without which it is not valid as a test for correlation.We then show how to test for the significance of the slope in a linear regression analysis that invovles a single independent variable and where outcomes of the dependent variable belong to a known bounded set.
Resumo:
This paper presents a test of the predictive validity of various classes ofQALY models (i.e., linear, power and exponential models). We first estimatedTTO utilities for 43 EQ-5D chronic health states and next these states wereembedded in health profiles. The chronic TTO utilities were then used topredict the responses to TTO questions with health profiles. We find that thepower QALY model clearly outperforms linear and exponential QALY models.Optimal power coefficient is 0.65. Our results suggest that TTO-based QALYcalculations may be biased. This bias can be avoided using a power QALY model.
Resumo:
This paper considers a general and informationally efficient approach to determine the optimal access pricing rule for interconnected networks. It shows that there exists a simple rule that achieves the Ramsey outcome as the unique equilibrium when networks compete in linear prices without network-based price discrimination. The approach is informationally efficient in the sense that the regulator is required to know only the marginal cost structure, i.e. the marginal cost of making and terminating a call. The approach is general in that access prices can depend not only on the marginal costs but also on the retail prices, which can be observed by consumers and therefore by the regulator as well. In particular, I consider the set of linear access pricing rules which includes any fixed access price, the Efficient Component Pricing Rule (ECPR) and the Modified ECPR as special cases. I show that in this set, there is a unique rule that implements the Ramsey outcome as the unique equilibrium independently of the underlying demand conditions.
Resumo:
This paper introduces the approach of using Total Unduplicated Reach and Frequency analysis (TURF) to design a product line through a binary linear programming model. This improves the efficiency of the search for the solution to the problem compared to the algorithms that have been used to date. The results obtained through our exact algorithm are presented, and this method shows to be extremely efficient both in obtaining optimal solutions and in computing time for very large instances of the problem at hand. Furthermore, the proposed technique enables the model to be improved in order to overcome the main drawbacks presented by TURF analysis in practice.
Resumo:
IGF2 is an autocrine ligand for the beta cell IGF1R receptor and GLP-1 increases the activity of this autocrine loop by enhancing IGF1R expression, a mechanism that mediates the trophic effects of GLP-1 on beta cell mass and function. Here, we investigated the regulation of IGF2 biosynthesis and secretion. We showed that glutamine rapidly and strongly induced IGF2 mRNA translation using reporter constructs transduced in MIN6 cells and primary islet cells. This was followed by rapid secretion of IGF2 via the regulated pathway, as revealed by the presence of mature IGF2 in insulin granule fractions and by inhibition of secretion by nimodipine and diazoxide. When maximally stimulated by glutamine, the amount of secreted IGF2 rapidly exceeded its initial intracellular pool and tolbutamide, and high K(+) increased IGF2 secretion only marginally. This indicates that the intracellular pool of IGF2 is small and that sustained secretion requires de novo synthesis. The stimulatory effect of glutamine necessitates its metabolism but not mTOR activation. Finally, exposure of insulinomas or beta cells to glutamine induced Akt phosphorylation, an effect that was dependent on IGF2 secretion, and reduced cytokine-induced apoptosis. Thus, glutamine controls the activity of the beta cell IGF2/IGF1R autocrine loop by increasing the biosynthesis and secretion of IGF2. This autocrine loop can thus integrate changes in feeding and metabolic state to adapt beta cell mass and function.
Resumo:
We develop a mathematical programming approach for the classicalPSPACE - hard restless bandit problem in stochastic optimization.We introduce a hierarchy of n (where n is the number of bandits)increasingly stronger linear programming relaxations, the lastof which is exact and corresponds to the (exponential size)formulation of the problem as a Markov decision chain, while theother relaxations provide bounds and are efficiently computed. Wealso propose a priority-index heuristic scheduling policy fromthe solution to the first-order relaxation, where the indices aredefined in terms of optimal dual variables. In this way wepropose a policy and a suboptimality guarantee. We report resultsof computational experiments that suggest that the proposedheuristic policy is nearly optimal. Moreover, the second-orderrelaxation is found to provide strong bounds on the optimalvalue.
Resumo:
Ants live in organized societies with a marked division of labor among workers, but little is known about how this division of labor is generated. We used a tracking system to continuously monitor individually tagged workers in six colonies of the ant Camponotus fellah over 41 days. Network analyses of more than 9 million interactions revealed three distinct groups that differ in behavioral repertoires. Each group represents a functional behavioral unit with workers moving from one group to the next as they age. The rate of interactions was much higher within groups than between groups. The precise information on spatial and temporal distribution of all individuals allowed us to calculate the expected rates of within- and between-group interactions. These values suggest that the network of interaction within colonies is primarily mediated by age-induced changes in the spatial location of workers.