56 resultados para Key policies

em Indian Institute of Science - Bangalore - Índia


Relevância:

20.00% 20.00%

Publicador:

Resumo:

A public key cryptosystem is proposed, which is based on the assumption that finding the square root of an element in a large finite ring is computationally infeasible in the absence of a knowledge of the ring structure. The encryption and decryption operations are very fast, and the data expansion is 1:2.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The dimethoxytetralol gives on Vilsmeier reaction the dihydronaphthaldehyde (yield,92%), which on Grignard reaction with MeMgI affords the title compound (yield,�100%), the reactions constituting a high yield synthesis of this important anthracyclinone intermediate.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study sensor networks with energy harvesting nodes. The generated energy at a node can be stored in a buffer. A sensor node periodically senses a random field and generates a packet. These packets are stored in a queue and transmitted using the energy available at that time at the node. For such networks we develop efficient energy management policies. First, for a single node, we obtain policies that are throughput optimal, i.e., the data queue stays stable for the largest possible data rate. Next we obtain energy management policies which minimize the mean delay in the queue. We also compare performance of several easily implementable suboptimal policies. A greedy policy is identified which, in low SNR regime, is throughput optimal and also minimizes mean delay. Next using the results for a single node, we develop efficient MAC policies.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Mxr1p (methanol expression regulator 1) functions as a key regulator of methanol metabolism in the methylotrophic yeast Pichia pastoris. In this study, a recombinant Mxr1p protein containing the N-terminal zinc finger DNA binding domain was overexpressed and purified from E coli cells and its ability to bind to promoter sequences of AOXI encoding alcohol oxidase was examined. In the AOXI promoter, Mxr1p binds at six different regions. Deletions encompassing these regions result in a significant decrease in AOXI promoter activity in vivo. Based on the analysis of AOXI promoter sequences, a consensus sequence for Mxr1p binding consisting of a core 5' CYCC 3' motif was identified. When the core CYCC sequence is mutated to CYCA, CYCT or CYCM (M = 5-methylcytosine), Mxr1p binding is abolished. Though Mxr1p is the homologue of Saccharomyces cerevisiae Adr1p transcription factor, it does not bind to Adr1p binding site of S. cerevisiae alcohol dehydrogenase promoter (ADH2UAS1). However, two point mutations convert ADH2UAS1 into an Mxr1p binding site. The identification of key DNA elements involved in promoter recognition by Mxr1p is an important step in understanding its function as a master regulator of the methanol utilization pathway in P. pastoris.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The metabolism of phenylalanine by a strain of Aspergillus niger, isolated from the soil by enrichment culture has been studied. Analyses of the culture filtrates and replacement studies with various metabolites have revealed the operation of a degradative pathway involving p-hydroxymandelate as a key intermediate in this organism, p-Hydroxymandelate has been isolated from the cultural filtrates and its identity established by UV, IR and chromatographic techniques. A scheme for the degradation of phenylalanine in this organism has been proposed.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Receptor guanylyl cyclases are multidomain proteins, and ligand binding to the extracellular domain increases the levels of intracellular cGMP. The intracellular domain of these receptors is composed of a kinase homology domain (KHD), a linker of similar to 70 amino acids, followed by the C-terminal guanylyl cyclase domain. Mechanisms by which these receptors are allosterically regulated by ligand binding to the extracellular domain and ATP binding to the KHD are not completely understood. Here we examine the role of the linker region in receptor guanylyl cyclases by a series of point mutations in receptor guanylyl cyclase C. The linker region is predicted to adopt a coiled coil structure and aid in dimerization, but we find that the effects of mutations neither follow a pattern predicted for a coiled coil peptide nor abrogate dimerization. Importantly, this region is critical for repressing the guanylyl cyclase activity of the receptor in the absence of ligand and permitting ligand-mediated activation of the cyclase domain. Mutant receptors with high basal guanylyl cyclase activity show no further activation in the presence of non-ionic detergents, suggesting that hydrophobic interactions in the basal and inactive conformation of the guanylyl cyclase domain are disrupted by mutation. Equivalent mutations in the linker region of guanylyl cyclase A also elevated the basal activity and abolished ligand-and detergent-mediated activation. We, therefore, have defined a key regulatory role for the linker region of receptor guanylyl cyclases which serves as a transducer of information from the extracellular domain via the KHD to the catalytic domain.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we propose a new security metric for measuring resilience of a symmetric key distribution scheme in wireless sensor network. A polynomial-based and a novel complete connectivity schemes are proposed and an analytical comparison, in terms of security and connectivity, between the schemes is shown. Motivated by the schemes, we derive general expressions for security and connectivity. A number of conclusions are made using these general expressions.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Average-delay optimal scheduflng of messages arriving to the transmitter of a point-to-point channel is considered in this paper. We consider a discrete time batch-arrival batch-service queueing model for the communication scheme, with service time that may be a function of batch size. The question of delay optimality is addressed within the semi-Markov decision-theoretic framework. Approximations to the average-delay optimal policy are obtained.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The enzyme UDP-galactose-4-epimerase (GAL10) catalyzes a key step in galactose metabolism converting UDP-galactose to UDPglucose which then can get metabolized through glycolysis and TCA cycle thus allowing the cell to use galactose as a carbon and energy source. As in many fungi, a functional homolog of GAL10 exists in Candida albicans. The domainal organization of the homologs from Saccharomyces cerevisiae and C albicans show high degree of homology having both mutarotase and an epimerase domain. The former is responsible for the conversion of beta-D-galactose to alpha-D-galactose and the hitter for epimerization of UDP-galactose to UDP-glucose. Absence of C albicans GAL10 (CaGAL10) affects cell-wall organization, oxidative stress response, biofilm formation and filamentation. Cagal10 mutant cells tend to flocculate extensively as compared to the wild-type cells. The excessive filamentation in this mutant is reflected in its irregular and wrinkled colony morphology. Cagal10 strain is more susceptible to oxidative stress when tested in presence of H2O2. While the S. cerevsiae GAL10 (ScGAL10), essential for survival in the presence of galactose, has not been reported to have defects in the absence of galactose, the C albicans homolog shows these phenotypes during growth in the absence of galactose. Thus a functional CaGal10 is required not only for galactose metabolism but also for normal hyphal morphogenesis, colony morphology, maintenance of cell-wall integrity and for resistance to oxidative stress even in the absence of galactose. (c) 2006 Elsevier Inc. All rights reserved.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we study the behaviour of the slotted Aloha multiple access scheme with a finite number of users under different traffic loads and optimize the retransmission probability q(r) for various settings, cost objectives and policies. First, we formulate the problem as a parameter optimization problem and use certain efficient smoothed functional algorithms for finding the optimal retransmission probability parameter. Next, we propose two classes of multi-level closed-loop feedback policies (for finding in each case the retransmission probability qr that now depends on the current system state) and apply the above algorithms for finding an optimal policy within each class of policies. While one of the policy classes depends on the number of backlogged nodes in the system, the other depends on the number of time slots since the last successful transmission. The latter policies are more realistic as it is difficult to keep track of the number of backlogged nodes at each instant. We investigate the effect of increasing the number of levels in the feedback policies. Wen also investigate the effects of using different cost functions (withn and without penalization) in our algorithms and the corresponding change in the throughput and delay using these. Both of our algorithms use two-timescale stochastic approximation. One of the algorithms uses one simulation while the other uses two simulations of the system. The two-simulation algorithm is seen to perform better than the other algorithm. Optimal multi-level closed-loop policies are seen to perform better than optimal open-loop policies. The performance further improves when more levels are used in the feedback policies.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

The problem of admission control of packets in communication networks is studied in the continuous time queueing framework under different classes of service and delayed information feedback. We develop and use a variant of a simulation based two timescale simultaneous perturbation stochastic approximation (SPSA) algorithm for finding an optimal feedback policy within the class of threshold type policies. Even though SPSA has originally been designed for continuous parameter optimization, its variant for the discrete parameter case is seen to work well. We give a proof of the hypothesis needed to show convergence of the algorithm on our setting along with a sketch of the convergence analysis. Extensive numerical experiments with the algorithm are illustrated for different parameter specifications. In particular, we study the effect of feedback delays on the system performance.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

In this paper, we study the performance of client-Access Point (AP) association policies in IEEE 802.11 based WLANs. In many scenarios, clients have a choice of APs with whom they can associate. We are interested in finding association policies which lead to optimal system performance. More specifically, we study the stability of different association policies as a function of the spatial distribution of arriving clients. We find for each policy the range of client arrival rates for which the system is stable. For small networks, we use Lyapunov function methods to formally establish the stability or instability of certain policies in specific scenarios. The RAT heuristic policy introduced in our prior work is shown to have very good stability properties when compared to several other natural policies. We also validate our analytical results by detailed simulation employing the IEEE 802.11 MAC.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

We study a sensor node with an energy harvesting source. In any slot,the sensor node is in one of two modes: Wake or Sleep. The generated energy is stored in a buffer. The sensor node senses a random field and generates a packet when it is awake. These packets are stored in a queue and transmitted in the wake mode using the energy available in the energy buffer. We obtain energy management policies which minimize a linear combination of the mean queue length and the mean data loss rate. Then, we obtain two easily implementable suboptimal policies and compare their performance to that of the optimal policy. Next, we extend the Throughput Optimal policy developed in our previous work to sensors with two modes. Via this policy, we can increase the through put substantially and stabilize the data queue by allowing the node to sleep in some slots and to drop some generated packets. This policy requires minimal statistical knowledge of the system. We also modify this policy to decrease the switching costs.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

An enzyme which cleaves the benzene ring of 3,5-dichiorocatechol has been purified to homogeneity from Pseudomonas cepacia CSV90, grown with 2,4-dichlorophenoxyacetic acid (2,4-D) as the sole carbon source. The enzyme was a nonheme ferric dioxygenase and catalyzed the intradiol cleavage of all the examined catechol derivatives, 3,5-dichlorocatechol having the highest specificity constant of 7.3 μM−1 s−1 in an air-saturated buffer. No extradiol-cleaving activity was observed. Thus, the enzyme was designated as 3,5-dichlorocatechol 1,2-dioxygenase. The molecular weight of the native enzyme was ascertained to be 56,000 by light scattering method, while the Mr value of the enzyme denatured with 6 M guanidine-HCl or sodium dodecyl sulfate was 29,000 or 31,600, respectively, suggesting that the enzyme was a homodimer. The iron content was estimated to be 0.89 mol per mole of enzyme. The enzyme was deep red and exhibited a broad absorption spectrum with a maximum at around 425 nm, which was bleached by sodium dithionite, and shifted to 515 nm upon anaerobic 3,5-dichlorocatechol binding. The catalytic constant and the Km values for 3,5-dichlorocatechol and oxygen were 34.7 s−1 and 4.4 and 652 μM, respectively, at pH 8 and 25°C. Some heavy metal ions, chelating agents and sulfhydryl reagents inhibited the activity. The NH2-terminal sequence was determined up to 44 amino acid residues and compared with those of the other catechol dioxygenases previously reported.

Relevância:

20.00% 20.00%

Publicador:

Resumo:

Due to large scale afforestation programs and forest conservation legislations, India's total forest area seems to have stabilized or even increased. In spite of such efforts, forest fragmentation and degradation continues, with forests being subject to increased pressure due to anthropogenic factors. Such fragmentation and degradation is leading to the forest cover to change from very dense to moderately dense and open forest and 253 km(2) of very dense forest has been converted to moderately dense forest, open forest, scrub and non-forest (during 2005-2007). Similarly, there has been a degradation of 4,120 km(2) of moderately dense forest to open forest, scrub and non-forest resulting in a net loss of 936 km(2) of moderately dense forest. Additionally, 4,335 km(2) of open forest have degraded to scrub and non-forest. Coupled with pressure due to anthropogenic factors, climate change is likely to be an added stress on forests. Forest sector programs and policies are major factors that determine the status of forests and potentially resilience to projected impacts of climate change. An attempt is made to review the forest policies and programs and their implications for the status of forests and for vulnerability of forests to projected climate change. The study concludes that forest conservation and development policies and programs need to be oriented to incorporate climate change impacts, vulnerability and adaptation.