Exergetic analysis of carbon dioxide vapour compression refrigeration cycle using the new fundamental equation of state

The purpose of this paper is to present exergy charts for carbon dioxide (CO2) based on the new fundamental equation of state and the results of a thermodynamic analysis of conventional and trans-critical vapour compression refrigeration cycles using the data thereof. The calculation scheme is anchored on the Mathematica platform. There exist upper and lower bounds for the high cycle pressure for a given set of evaporating and pre-throttling temperatures. The maximum possible exergetic efficiency for each case was determined. Empirical correlations for exergetic efficiency and COP, valid in the range of temperatures studied here, are obtained. The exergy losses have been quantified. (C) 2003 Elsevier Ltd. All rights reserved.

Albedo enhancement of marine clouds to counteract global warming: impacts on the hydrological cycle

Recent studies have shown that changes in solar radiation affect the hydrological cycle more strongly than equivalent CO(2) changes for the same change in global mean surface temperature. Thus, solar radiation management ``geoengineering'' proposals to completely offset global mean temperature increases by reducing the amount of absorbed sunlight might be expected to slow the global water cycle and reduce runoff over land. However, proposed countering of global warming by increasing the albedo of marine clouds would reduce surface solar radiation only over the oceans. Here, for an idealized scenario, we analyze the response of temperature and the hydrological cycle to increased reflection by clouds over the ocean using an atmospheric general circulation model coupled to a mixed layer ocean model. When cloud droplets are reduced in size over all oceans uniformly to offset the temperature increase from a doubling of atmospheric CO(2), the global-mean precipitation and evaporation decreases by about 1.3% but runoff over land increases by 7.5% primarily due to increases over tropical land. In the model, more reflective marine clouds cool the atmospheric column over ocean. The result is a sinking motion over oceans and upward motion over land. We attribute the increased runoff over land to this increased upward motion over land when marine clouds are made more reflective. Our results suggest that, in contrast to other proposals to increase planetary albedo, offsetting mean global warming by reducing marine cloud droplet size does not necessarily lead to a drying, on average, of the continents. However, we note that the changes in precipitation, evaporation and P-E are dominated by small but significant areas, and given the highly idealized nature of this study, a more thorough and broader assessment would be required for proposals of altering marine cloud properties on a large scale.

Scan cell reordering to minimize peak power during test cycle: A graph theoretic approach

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.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

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.