104 resultados para mutation load
Resumo:
Load-deflection curves for a notched beam under three-point load are determined using the Fictitious Crack Model (FCM) and Blunt Crack Model (BCM). Two values of fracture energy GF are used in this analysis: (i) GF obtained from the size effect law and (ii) GF obtained independently of the size effect. The predicted load-deflection diagrams are compared with the experimental ones obtained for the beams tested by Jenq and Shah. In addition, the values of maximum load (Pmax) obtained by the analyses are compared with the experimental ones for beams tested by Jenq and Shah and by Bažant and Pfeiffer. The results indicate that the descending portion of the load-deflection curve is very sensitive to the GF value used.
Resumo:
Reduction of the execution time of a job through equitable distribution of work load among the processors in a distributed system is the goal of load balancing. Performance of static and dynamic load balancing algorithms for the extended hypercube, is discussed. Threshold algorithms are very well-known algorithms for dynamic load balancing in distributed systems. An extension of the threshold algorithm, called the multilevel threshold algorithm, has been proposed. The hierarchical interconnection network of the extended hypercube is suitable for implementing the proposed algorithm. The new algorithm has been implemented on a transputer-based system and the performance of the algorithm for an extended hypercube is compared with those for mesh and binary hypercube networks
Resumo:
Two fragments of pancreatic ribonuclease A, a truncated version of S-peptide (residues 1-15) and S-protein (residues 21-124), combine to give a catalytically active complex. We have substituted the wild-type residue at position 13, methionine (Met), with norleucine (Nle), where the only covalent change is the replacement of the sulfur atom with a methylene group. The thermodynamic parameters associated with the binding of this variant to S-protein, determined by titration calorimetry in the temperature range 10-40 degrees C, are reported and compared to values previously reported [Varadarajan, R., Connelly, P. R., Sturtevant, J. M., & Richards, F. M. (1992) Biochemistry 31, 1421-1426] for other position 13 analogs. The differences in the free energy and enthalpy of binding between the Met and Nle peptides are 0.6 and 7.9 kcal/mol at 25 degrees C, respectively. These differences are slightly larger than, but comparable to, the differences in the values for the Met/Ile and Met/Leu pairs. The structure of the mutant complex was determined to 1.85 Angstrom resolution and refined to an R-factor of 17.4% The structures of mutant and wild-type complexes are practically identical although the Nle side chain has a significantly higher average B-factor than the corresponding Met side chain. In contrast, the B-factors of the atoms of the cage of residues surrounding position 13 are all somewhat lower in the Nle variant than in the Met wild-type. Thus, the large differences in the binding enthalpy appear to reside entirely in the difference in chemical properties or dynamic behavior of the -S- and -CH2- groups and not in differences in the geometry of the side chains or the internal cavity surface. In addition, a novel method of obtaining protein stability data by means of isothermal titration calorimetry is introduced.
Resumo:
This study concerns the effect of duration of load increment (up to 24 h) on the consolidation properties of expansive black cotton soil (liquid limit = 81%) and nonexpansive kaolinite (liquid limit = 49%). It indicates that the amount and rate of compression are not noticeably affected by the duration of loading for a standard sample of 25 mm in height and 76.2 mm in diameter with double drainage. Hence, the compression index and coefficient of consolidation can be obtained with reasonable accuracy even if the duration of each load increment is as short as 4 h. The secondary compression coefficient (C-alpha epsilon) for kaolinite can be obtained for any pressure range with 1/2 h of loading, which, however, requires 4 h for black cotton soil. This is because primary consolidation is completed early in the case of kaolinite. The paper proves that the conventional consolidation test can be carried out with much shorter duration of loading (less than 4 h) than the standard specification of 24 h or more even for remolded fine-grained soils.
Resumo:
In this paper, we look at the problem of scheduling expression trees with reusable registers on delayed load architectures. Reusable registers come into the picture when the compiler has a data-flow analyzer which is able to estimate the extent of use of the registers. Earlier work considered the same problem without allowing for register variables. Subsequently, Venugopal considered non-reusable registers in the tree. We further extend these efforts to consider a much more general form of the tree. We describe an approximate algorithm for the problem. We formally prove that the code schedule produced by this algorithm will, in the worst case, generate one interlock and use just one more register than that used by the optimal schedule. Spilling is minimized. The approximate algorithm is simple and has linear complexity.
Resumo:
This paper presents a new strategy for load distribution in a single-level tree network equipped with or without front-ends. The load is distributed in more than one installment in an optimal manner to minimize the processing time. This is a deviation and an improvement over earlier studies in which the load distribution is done in only one installment. Recursive equations for the general case, and their closed form solutions for a special case in which the network has identical processors and identical links, are derived. An asymptotic analysis of the network performance with respect to the number of processors and the number of installments is carried out. Discussions of the results in terms of some practical issues like the tradeoff relationship between the number of processors and the number of installments are also presented.
Resumo:
Ultra low-load-dynamic microhardness testing facilitates the hardness measurements in a very low volume of the material and thus is suited for characterization of the interfaces in MMC's. This paper details the studies on age-hardening behavior of the interfaces in Al-Cu-5SiC(p) composites characterized using this technique. Results of hardness studies have been further substantiated by TEM observations. In the solution-treated condition, hardness is maximum at the particle/matrix interface and decreases with increasing distance from the interface. This could be attributed to the presence of maximum dislocation density at the interface which decreases with increasing distance from the interface. In the case of composites subjected to high temperature aging, hardening at the interface is found to be faster than the bulk matrix and the aging kinetics becomes progressively slower with increasing distance from the interface. This is attributed to the dislocation density gradient at the interface, leading to enhanced nucleation and growth of precipitates at the interface compared to the bulk matrix. TEM observations reveal that the sizes of the precipitates decrease with increasing distance from the interface and thus confirms the retardation in aging kinetics with increasing distance from the interface.
Resumo:
Models for electricity planning require inclusion of demand. Depending on the type of planning, the demand is usually represented as an annual demand for electricity (GWh), a peak demand (MW) or in the form of annual load-duration curves. The demand for electricity varies with the seasons, economic activities, etc. Existing schemes do not capture the dynamics of demand variations that are important for planning. For this purpose, we introduce the concept of representative load curves (RLCs). Advantages of RLCs are demonstrated in a case study for the state of Karnataka in India. Multiple discriminant analysis is used to cluster the 365 daily load curves for 1993-94 into nine RLCs. Further analyses of these RLCs help to identify important factors, namely, seasonal, industrial, agricultural, and residential (water heating and air-cooling) demand variations besides rationing by the utility. (C) 1999 Elsevier Science Ltd. All rights reserved.
Resumo:
In this paper, power management algorithms for energy harvesting sensors (EHS) that operate purely based on energy harvested from the environment are proposed. To maintain energy neutrality, EHS nodes schedule their utilization of the harvested power so as to save/draw energy into/from an inefficient battery during peak/low energy harvesting periods, respectively. Under this constraint, one of the key system design goals is to transmit as much data as possible given the energy harvesting profile. For implementational simplicity, it is assumed that the EHS transmits at a constant data rate with power control, when the channel is sufficiently good. By converting the data rate maximization problem into a convex optimization problem, the optimal load scheduling (power management) algorithm that maximizes the average data rate subject to energy neutrality is derived. Also, the energy storage requirements on the battery for implementing the proposed algorithm are calculated. Further, robust schemes that account for the insufficiency of battery storage capacity, or errors in the prediction of the harvested power are proposed. The superior performance of the proposed algorithms over conventional scheduling schemes are demonstrated through computations using numerical data from solar energy harvesting databases.
Resumo:
Relay selection combined with buffering of packets of relays can substantially increase the throughput of a cooperative network that uses rateless codes. However, buffering also increases the end-to-end delays due to the additional queuing delays at the relay nodes. In this paper we propose a novel method that exploits a unique property of rateless codes that enables a receiver to decode a packet from non-contiguous and unordered portions of the received signal. In it, each relay, depending on its queue length, ignores its received coded bits with a given probability. We show that this substantially reduces the end-to-end delays while retaining almost all of the throughput gain achieved by buffering. In effect, the method increases the odds that the packet is first decoded by a relay with a smaller queue. Thus, the queuing load is balanced across the relays and traded off with transmission times. We derive explicit necessary and sufficient conditions for the stability of this system when the various channels undergo fading. Despite encountering analytically intractable G/GI/1 queues in our system, we also gain insights about the method by analyzing a similar system with a simpler model for the relay-to-destination transmission times.
Resumo:
Several endogenous and exogenous chemical species, particularly the so-called reactive oxygen species (ROS) and reactive nitrogen oxide species (RNOS), attack deoxyribonucleic acid (DNA) in biological systems producing DNA lesions which hamper normal cell functioning and cause various diseases including mutation and cancer. The guanine (G) base of DNA among all the bases is most susceptible and certain modified guanines get involved in mispairing with other bases during DNA replication. The biological system repairs the abnormal base pairs, but those that are still left cause mutation and cancer. Anti-oxidants present in biological systems can scavenge the ROS and RNOS. Thus three types of molecular events occur in biological media: (i) DNA damage, (ii) DNA repair, and (iii) prevention of DNA damage by scavenging ROS and RNOS. Quantum mechanical methods may be used to unravel molecular mechanisms of such phenomena. Some recent quantum theoretical results obtained on these problems are reviewed here.
Resumo:
Most of the predisposition to hereditary breast and ovarian cancer has been attributed to inherited defects in two tumor suppressor genes BRCA1 and BRCA2. To explore the contribution of BRCA1 mutations to hereditary breast cancer among Indian women, we examined the coding sequence of the BRCA1 gene in 14 breast cancer patients with a positive family history of breast and/or ovarian cancer. Mutation analysis was carried out using conformation sensitive gel electrophoresis (CSGE) followed by sequencing. Three mutations (21%) in the BRCA1 gene were identified. Two of them are novel mutations of which one is a missense mutation in exon 7 near the RING finger domain, while the other is a one base pair deletion in exon 11 which results in protein truncation. The third mutation, 185delAG, has been previously described in Ashkenazi Jewish families. To our knowledge this is the first report of a study of germline BRCA1 mutation analysis in familial breast cancer in India. Our data from 14 different families suggests a lower prevalence but definite involvement of germline mutations in the BRCA1 gene among Indian women with breast cancer and a family history of breast cancer.
Resumo:
In this paper we consider the problem of scheduling expression trees on delayed-load architectures. The problem tackled here takes root from the one considered in [Proceedings of the ACM SIGPLAN '91 Conf. on Programming Language Design and Implementation, 1991. p. 256] in which the leaves of the expression trees all refer to memory locations. A generalization of this involves the situation in which the trees may contain register variables, with the registers being used only at the leaves. Solutions to this generalization are given in [ACM Trans. Prog. Lang. Syst. 17 (1995) 740, Microproc. Microprog. 40 (1994) 577]. This paper considers the most general case in which the registers are reusable. This problem is tackled in [Comput. Lang, 21 (1995) 49] which gives an approximate solution to the problem under certain assumptions about the contiguity of the evaluation order: Here we propose an optimal solution (which may involve even a non-contiguous evaluation of the tree). The schedule generated by the algorithm given in this paper is optimal in the sense that it is an interlock-free schedule which uses the minimum number of registers required. An extension to the algorithm incorporates spilling. The problem as stated in this paper is an instruction scheduling problem. However, the problem could also be rephrased as an operations research problem with a difference in terminology. (C) 2002 Elsevier Science B.V. All rights reserved.
Resumo:
In this paper, a finite-element model is developed in which the nonlinear soil behavior is represented by a hyperbolic relation for static load condition and modified hyperbolic relation, which includes both degradation and gap for a cyclic load condition. Although batter piles are subjected to lateral load, the soil resistance is also governed by axial load, which is incorporated by considering the P-Δ moment and geometric stiffness matrix. By adopting the developed numerical model, static and cyclic load analyses are performed adopting an incremental-iterative procedure where the pile is idealized as beam elements and the soil as elastoplastic spring elements. The proposed numerical model is validated with published laboratory and field pile test results under both static and cyclic load conditions. This paper highlights the importance of the degradation factor and its influence on the soil resistance-displacement (p-y) curve, number of cycles of loading, and cyclic load response.