An Integrated Assessment Of The Suitability Of Domestic Solar Still As A Viable Safe Water Technology For India

Improving access to safe drinking water can result in multi-dimensional impacts on people's livelihood. This has been aptly reflected in the Millennium Development Goals (MDG) as one of the major objectives. Despite the availability of diverse and complex set of technologies for water purification, pragmatic and cost-effective use of the same is impeding the use of available sources of water. Hence, in country like India simple low-energy technologies such as solar still are likely to succeed. Solar stills would suffice the basic minimum drinking water requirements of man. Solar stills use sunlight, to kill or inactivate many, if not all, of the pathogens found in water. This paper provides an integrated assessment of the suitability of domestic solar still as a viable safe water technology for India. Also an attempt has been made to critically assess the operational feasibility and costs incurred for using this technology in rural India.

Evaluation of Charges for Power Transmission and Losses in Bilateral Power Contracts

The paper presents a method for transmission loss charge allocation in deregulated power systems based on Relative Electrical Distance (RED) concept. Based on RED between the generator and load nodes and the predefined bilateral power contracts, charge evaluation is carried out. Generally through some power exchange mechanism a set of bilateral contracts are determined that facilitate bilateral agreements between the generation and distribution entities. In this paper the possible charges incurred in meeting loads like generation charge, transmission charge and charge due to losses are evaluated. Case studies have been carried out on a few practical equivalent systems. Due to space limitation results for a sample 5 bus system are presented considering ideal load/generation power contracts and deviated load/generation power contracts. Extensive numerical testing indicates that the proposed allocation scheme produces loss allocations that are appropriate and that behave in a physically reasonable manner.

Uniformly valid analytical solution to the problem of a decaying shock wave

An explicit representation of an analytical solution to the problem of decay of a plane shock wave of arbitrary strength is proposed. The solution satisfies the basic equations exactly. The approximation lies in the (approximate) satisfaction of two of the Rankine-Hugoniot conditions. The error incurred is shown to be very small even for strong shocks. This solution analyses the interaction of a shock of arbitrary strength with a centred simple wave overtaking it, and describes a complete history of decay with a remarkable accuracy even for strong shocks. For a weak shock, the limiting law of motion obtained from the solution is shown to be in complete agreement with the Friedrichs theory. The propagation law of the non-uniform shock wave is determined, and the equations for shock and particle paths in the (x, t)-plane are obtained. The analytic solution presented here is uniformly valid for the entire flow field behind the decaying shock wave.

Code design casing deterministic annealing

We address the problem of designing codes for specific applications using deterministic annealing. Designing a block code over any finite dimensional space may be thought of as forming the corresponding number of clusters over the particular dimensional space. We have shown that the total distortion incurred in encoding a training set is related to the probability of correct reception over a symmetric channel. While conventional deterministic annealing make use of the Euclidean squared error distance measure, we have developed an algorithm that can be used for clustering with Hamming distance as the distance measure, which is required in the error correcting, scenario.

Small Ubiquitin-related Modifier Ligase Activity of Mms21 Is Required for Maintenance of Chromosome Integrity during the Unperturbed Mitotic Cell Division Cycle in Saccharomyces cerevisiae

The SUMO ligase activity of Mms21/Nse2, a conserved member of the Smc5/6 complex, is required for resisting extrinsically induced genotoxic stress. We report that the Mms21 SUMO ligase activity is also required during the unchallenged mitotic cell cycle in Saccharomyces cerevisiae. SUMO ligase-defective cells were slow growing and spontaneously incurred DNA damage. These cells required caffeine-sensitive Mec1 kinase-dependent checkpoint signaling for survival even in the absence of extrinsically induced genotoxic stress. SUMO ligase-defective cells were sensitive to replication stress and displayed synthetic growth defects with DNA damage checkpoint-defective mutants such as mec1, rad9, and rad24. MMS21 SUMO ligase and mediator of replication checkpoint 1 gene (MRC1) were epistatic with respect to hydroxyurea-induced replication stress or methyl methanesulfonate-induced DNA damage sensitivity. Subjecting Mms21 SUMO ligase-deficient cells to transient replication stress resulted in enhancement of cell cycle progression defects such as mitotic delay and accumulation of hyperploid cells. Consistent with the spontaneous activation of the DNA damage checkpoint pathway observed in the Mms21-mediated sumoylation-deficient cells, enhanced frequency of chromosome breakage and loss was detected in these mutant cells. A mutation in the conserved cysteine 221 that is engaged in coordination of the zinc ion in Loop 2 of the Mms21 SPL-RING E3 ligase catalytic domain resulted in strong replication stress sensitivity and also conferred slow growth and Mec1 dependence to unchallenged mitotically dividing cells. Our findings establish Mms21-mediated sumoylation as a determinant of cell cycle progression and maintenance of chromosome integrity during the unperturbed mitotic cell division cycle in budding yeast.

The effect of traffic shaping in efficiently providing end-to-end performance guarantees

This paper reports new results concerning the capabilities of a family of service disciplines aimed at providing per-connection end-to-end delay (and throughput) guarantees in high-speed networks. This family consists of the class of rate-controlled service disciplines, in which traffic from a connection is reshaped to conform to specific traffic characteristics, at every hop on its path. When used together with a scheduling policy at each node, this reshaping enables the network to provide end-to-end delay guarantees to individual connections. The main advantages of this family of service disciplines are their implementation simplicity and flexibility. On the other hand, because the delay guarantees provided are based on summing worst case delays at each node, it has also been argued that the resulting bounds are very conservative which may more than offset the benefits. In particular, other service disciplines such as those based on Fair Queueing or Generalized Processor Sharing (GPS), have been shown to provide much tighter delay bounds. As a result, these disciplines, although more complex from an implementation point-of-view, have been considered for the purpose of providing end-to-end guarantees in high-speed networks. In this paper, we show that through ''proper'' selection of the reshaping to which we subject the traffic of a connection, the penalty incurred by computing end-to-end delay bounds based on worst cases at each node can be alleviated. Specifically, we show how rate-controlled service disciplines can be designed to outperform the Rate Proportional Processor Sharing (RPPS) service discipline. Based on these findings, we believe that rate-controlled service disciplines provide a very powerful and practical solution to the problem of providing end-to-end guarantees in high-speed networks.

On the optimality of exhaustive service policies in multiclass queueing systems with modulated arrivals and switchovers

Consider a single-server multiclass queueing system with K classes where the individual queues are fed by K-correlated interrupted Poisson streams generated in the states of a K-state stationary modulating Markov chain. The service times for all the classes are drawn independently from the same distribution. There is a setup time (and/or a setup cost) incurred whenever the server switches from one queue to another. It is required to minimize the sum of discounted inventory and setup costs over an infinite horizon. We provide sufficient conditions under which exhaustive service policies are optimal. We then present some simulation results for a two-class queueing system to show that exhaustive, threshold policies outperform non-exhaustive policies.

Velocity distribution function for a dilute granular material in shear flow

The velocity distribution function for the steady shear flow of disks (in two dimensions) and spheres (in three dimensions) in a channel is determined in the limit where the frequency of particle-wall collisions is large compared to particle-particle collisions. An asymptotic analysis is used in the small parameter epsilon, which is naL in two dimensions and na(2)L in three dimensions, where; n is the number density of particles (per unit area in two dimensions and per unit volume in three dimensions), L is the separation of the walls of the channel and a is the particle diameter. The particle-wall collisions are inelastic, and are described by simple relations which involve coefficients of restitution e(t) and e(n) in the tangential and normal directions, and both elastic and inelastic binary collisions between particles are considered. In the absence of binary collisions between particles, it is found that the particle velocities converge to two constant values (u(x), u(y)) = (+/-V, O) after repeated collisions with the wall, where u(x) and u(y) are the velocities tangential and normal to the wall, V = (1 - e(t))V-w/(1 + e(t)), and V-w and -V-w, are the tangential velocities of the walls of the channel. The effect of binary collisions is included using a self-consistent calculation, and the distribution function is determined using the condition that the net collisional flux of particles at any point in velocity space is zero at steady state. Certain approximations are made regarding the velocities of particles undergoing binary collisions :in order to obtain analytical results for the distribution function, and these approximations are justified analytically by showing that the error incurred decreases proportional to epsilon(1/2) in the limit epsilon --> 0. A numerical calculation of the mean square of the difference between the exact flux and the approximate flux confirms that the error decreases proportional to epsilon(1/2) in the limit epsilon --> 0. The moments of the velocity distribution function are evaluated, and it is found that [u(x)(2)] --> V-2, [u(y)(2)] similar to V-2 epsilon and -[u(x)u(y)] similar to V-2 epsilon log(epsilon(-1)) in the limit epsilon --> 0. It is found that the distribution function and the scaling laws for the velocity moments are similar for both two- and three-dimensional systems.

Neighbor oblivious link reversal over duty-cycled WSNs

We propose partial and full link reversal algorithms to bypass voids during geographic routing over duty-cycled wireless sensor networks. We propose a distributed approach that is oblivious to one-hop neighbor information. Upon termination of the algorithm, the resulting network is guaranteed to be destination-oriented. Further, to reduce the delays incurred under reactive link reversal, we propose the use of `pseudo-events', a preemptive link reversal strategy, that renders the network destination-oriented before the onset of a real event. A simulation study of the effectiveness of pseudo-events is also provided.

CUSUM Based Distributed Detection in WSNs

We are concerned with the situation in which a wireless sensor network is deployed in a region, for the purpose of detecting an event occurring at a random time and at a random location. The sensor nodes periodically sample their environment (e.g., for acoustic energy),process the observations (in our case, using a CUSUM-based algorithm) and send a local decision (which is binary in nature) to the fusion centre. The fusion centre collects these local decisions and uses a fusion rule to process the sensors’ local decisions and infer the state of nature, i.e., if an event has occurred or not. Our main contribution is in analyzing two local detection rules in combination with a simple fusion rule. The local detection algorithms are based on the nonparametric CUSUMprocedure from sequential statistics. We also propose two ways to operate the local detectors after an alarm. These alternatives when combined in various ways yield several approaches. Our contribution is to provide analytical techniques to calculate false alarm measures, by the use of which the local detector thresholds can be set. Simulation results are provided to evaluate the accuracy of our analysis. As an illustration we provide a design example. We also use simulations to compare the detection delays incurred in these algorithms.

Efficiently Approximating Query Optimizer Plan Diagrams

Given a parametrized n-dimensional SQL query template and a choice of query optimizer, a plan diagram is a color-coded pictorial enumeration of the execution plan choices of the optimizer over the query parameter space. These diagrams have proved to be a powerful metaphor for the analysis and redesign of modern optimizers, and are gaining currency in diverse industrial and academic institutions. However, their utility is adversely impacted by the impractically large computational overheads incurred when standard brute-force exhaustive approaches are used for producing fine-grained diagrams on high-dimensional query templates. In this paper, we investigate strategies for efficiently producing close approximations to complex plan diagrams. Our techniques are customized to the features available in the optimizer's API, ranging from the generic optimizers that provide only the optimal plan for a query, to those that also support costing of sub-optimal plans and enumerating rank-ordered lists of plans. The techniques collectively feature both random and grid sampling, as well as inference techniques based on nearest-neighbor classifiers, parametric query optimization and plan cost monotonicity. Extensive experimentation with a representative set of TPC-H and TPC-DS-based query templates on industrial-strength optimizers indicates that our techniques are capable of delivering 90% accurate diagrams while incurring less than 15% of the computational overheads of the exhaustive approach. In fact, for full-featured optimizers, we can guarantee zero error with less than 10% overheads. These approximation techniques have been implemented in the publicly available Picasso optimizer visualization tool.

On the Implementation of a Streaming Video over Peer to Peer network using Middleware Components

Video streaming applications have hitherto been supported by single server systems. A major drawback of such a solution is that it increases the server load. The server restricts the number of clients that can be simultaneously supported due to limitation in bandwidth. The constraints of a single server system can be overcome in video streaming if we exploit the endless resources available in a distributed and networked system. We explore a P2P system for streaming video applications. In this paper we build a P2P streaming video (SVP2P) service in which multiple peers co-operate to serve video segments for new requests, thereby reducing server load and bandwidth used. Our simulation shows the playback latency using SVP2P is roughly 1/4th of the latency incurred when the server directly streams the video. Bandwidth consumed for control messages (overhead) is as low as 1.5% of the total data transfered. The most important observation is that the capacity of the SVP2P grows dynamically.

Farmers' vulnerability to climate variability in Dimapur district of Nagaland, India

Certain parts of the State of Nagaland situated in the northeastern region of India have been experiencing rainfall deficit over the past few years leading to severe drought-like conditions, which is likely to be aggravated under a climate change scenario. The state has already incurred considerable losses in the agricultural sector. Regional vulnerability assessments need to be carried out in order to help policy makers and planners formulate and implement effective drought management strategies. The present study uses an 'index-based approach' to quantify the climate variability-induced vulnerability of farmers in five villages of Dimapur district, Nagaland. Indicators, which are reflective of the exposure, sensitivity and adaptive capacity of the farmers to drought, were quantified on the basis of primary data generated through household surveys and participatory rural appraisal supplemented by secondary data in order to calculate a composite vulnerability index. The composite vulnerability index of village New Showba was found to be the least, while Zutovi, the highest. The overall results reveal that biophysical characteristics contribute the most to overall vulnerability. Some potential adaptation strategies were also identified based on observations and discussions with the villagers.

Resource usage monitoring for KVM based virtual machines

Realization of cloud computing has been possible due to availability of virtualization technologies on commodity platforms. Measuring resource usage on the virtualized servers is difficult because of the fact that the performance counters used for resource accounting are not virtualized. Hence, many of the prevalent virtualization technologies like Xen, VMware, KVM etc., use host specific CPU usage monitoring, which is coarse grained. In this paper, we present a performance monitoring tool for KVM based virtualized machines, which measures the CPU overhead incurred by the hypervisor on behalf of the virtual machine along-with the CPU usage of virtual machine itself. This fine-grained resource usage information, provided by the above tool, can be used for diverse situations like resource provisioning to support performance associated QoS requirements, identification of bottlenecks during VM placements, resource profiling of applications in cloud environments, etc. We demonstrate a use case of this tool by measuring the performance of web-servers hosted on a KVM based virtualized server.

Lattice Reduction Aided Detection in Large-MIMO Systems

Lattice reduction (LR) aided detection algorithms are known to achieve the same diversity order as that of maximum-likelihood (ML) detection at low complexity. However, they suffer SNR loss compared to ML performance. The SNR loss is mainly due to imperfect orthogonalization and imperfect nearest neighbor quantization. In this paper, we propose an improved LR-aided (ILR) detection algorithm, where we specifically target to reduce the effects of both imperfect orthogonalization and imperfect nearest neighbor quantization. The proposed ILR detection algorithm is shown to achieve near-ML performance in large-MIMO systems and outperform other LR-aided detection algorithms in the literature. Specifically, the SNR loss incurred by the proposed ILR algorithm compared to ML performance is just 0.1 dB for 4-QAM and < 0.5 dB for 16-QAM in 16 x 16 V-BLAST MIMO system. This performance is superior compared to those of other LR-aided detection algorithms, whose SNR losses are in the 2 dB to 9 dB range.