999 resultados para polymerisation cycle
Resumo:
Scan circuit is widely practiced DFT technology. The scan testing procedure consist of state initialization, test application, response capture and observation process. During the state initialization process the scan vectors are shifted into the scan cells and simultaneously the responses captured in last cycle are shifted out. During this shift operation the transitions that arise in the scan cells are propagated to the combinational circuit, which inturn create many more toggling activities in the combinational block and hence increases the dynamic power consumption. The dynamic power consumed during scan shift operation is much more higher than that of normal mode operation.
Resumo:
We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.
Resumo:
In the present study, we have tested the cytotoxic and DNA damage activity of two novel bis-1,2,4 triazole derivatives, namely 1,4-bis[5-(5-mercapto-1,3,4-oxadiazol-2-yl-methyl)-thio4-(p-tolyl)-1,2 ,4-triazol-3-yl]-butane (MNP-14) and 1,4-bis[5-(carbethoxy-methyl)-thio-4-(p-ethoxy phenyl) -1,2,4-triazol-3-yl]-butane (MNP-16). The effect of these molecules on cellular apoptosis was also determined. The in-vitro cytotoxicity was evaluated by a 3-(4,5-dimethylthiazol-2-yl)-2,5-diphenyl tetrazolium bromide (MTT) assay as well as Trypan blue dye exclusion methods against human acute lymphoblastic leukemia (MOLT4) and lung cancer cells (A549). Our results showed that MNP-16 induced significant cytotoxicity (IC50 of 3-5 mu M) compared with MNP-14. The cytotoxicity induced by MNP-16 was time and concentration dependent. The cell cycle analysis by flow cytometry (fluorescence-activated cell sorting [FACS]) revealed that though there was a significant increase in the apoptotic population (sub-G1 phase) with an increased concentration of MNP-14 and 16, there was no cell cycle arrest. Further, the comet assay results indicated considerable DNA
Resumo:
We present two online algorithms for maintaining a topological order of a directed n-vertex acyclic graph as arcs are added, and detecting a cycle when one is created. Our first algorithm handles m arc additions in O(m(3/2)) time. For sparse graphs (m/n = O(1)), this bound improves the best previous bound by a logarithmic factor, and is tight to within a constant factor among algorithms satisfying a natural locality property. Our second algorithm handles an arbitrary sequence of arc additions in O(n(5/2)) time. For sufficiently dense graphs, this bound improves the best previous bound by a polynomial factor. Our bound may be far from tight: we show that the algorithm can take Omega(n(2)2 root(2lgn)) time by relating its performance to a generalization of the k-levels problem of combinatorial geometry. A completely different algorithm running in Theta (n(2) log n) time was given recently by Bender, Fineman, and Gilbert. We extend both of our algorithms to the maintenance of strong components, without affecting the asymptotic time bounds.
Resumo:
A recent modelling study has shown that precipitation and runoff over land would increase when the reflectivity of marine clouds is increased to counter global warming. This implies that large scale albedo enhancement over land could lead to a decrease in runoff over land. In this study, we perform simulations using NCAR CAM3.1 that have implications for Solar Radiation Management geoengineering schemes that increase the albedo over land. We find that an increase in reflectivity over land that mitigates the global mean warming from a doubling of CO2 leads to a large residual warming in the southern hemisphere and cooling in the northern hemisphere since most of the land is located in northern hemisphere. Precipitation and runoff over land decrease by 13.4 and 22.3%, respectively, because of a large residual sinking motion over land triggered by albedo enhancement over land. Soil water content also declines when albedo over land is enhanced. The simulated magnitude of hydrological changes over land are much larger when compared to changes over oceans in the recent marine cloud albedo enhancement study since the radiative forcing over land needed (-8.2 W m(-2)) to counter global mean radiative forcing from a doubling of CO2 (3.3 W m(-2)) is approximately twice the forcing needed over the oceans (-4.2 W m(-2)). Our results imply that albedo enhancement over oceans produce climates closer to the unperturbed climate state than do albedo changes on land when the consequences on land hydrology are considered. Our study also has important implications for any intentional or unintentional large scale changes in land surface albedo such as deforestation/afforestation/reforestation, air pollution, and desert and urban albedo modification.