Relay Selection for Geographical Forwarding in Sleep-Wake Cycling Wireless Sensor Networks

Our work is motivated by geographical forwarding of sporadic alarm packets to a base station in a wireless sensor network (WSN), where the nodes are sleep-wake cycling periodically and asynchronously. We seek to develop local forwarding algorithms that can be tuned so as to tradeoff the end-to-end delay against a total cost, such as the hop count or total energy. Our approach is to solve, at each forwarding node enroute to the sink, the local forwarding problem of minimizing one-hop waiting delay subject to a lower bound constraint on a suitable reward offered by the next-hop relay; the constraint serves to tune the tradeoff. The reward metric used for the local problem is based on the end-to-end total cost objective (for instance, when the total cost is hop count, we choose to use the progress toward sink made by a relay as the reward). The forwarding node, to begin with, is uncertain about the number of relays, their wake-up times, and the reward values, but knows the probability distributions of these quantities. At each relay wake-up instant, when a relay reveals its reward value, the forwarding node's problem is to forward the packet or to wait for further relays to wake-up. In terms of the operations research literature, our work can be considered as a variant of the asset selling problem. We formulate our local forwarding problem as a partially observable Markov decision process (POMDP) and obtain inner and outer bounds for the optimal policy. Motivated by the computational complexity involved in the policies derived out of these bounds, we formulate an alternate simplified model, the optimal policy for which is a simple threshold rule. We provide simulation results to compare the performance of the inner and outer bound policies against the simple policy, and also against the optimal policy when the source knows the exact number of relays. Observing the good performance and the ease of implementation of the simple policy, we apply it to our motivating problem, i.e., local geographical routing of sporadic alarm packets in a large WSN. We compare the end-to-end performance (i.e., average total delay and average total cost) obtained by the simple policy, when used for local geographical forwarding, against that obtained by the globally optimal forwarding algorithm proposed by Kim et al. 1].

Experimental investigation on switching characteristics of IGBTs for traction application

In traction application, inverters need to have high reliability on account of wide variation in operating conditions, extreme ambient conditions, thermal cycling and varying DC link voltage. Hence it is important to have a good knowledge of switching characteristics of the devices used. The focus of this paper is to investigate and compare switching characteristics and losses of IGBT modules for traction application. Dependence of device transition times and switching energy losses on dc link voltage, device current and operating temperature is studied experimentally.

Sliding mode control based guidance law with impact time constraints

In this paper, the sliding mode control based guidance laws to intercept stationary targets at a desired impact time are proposed. Then, it is extended to constant velocity targets using the notion of predicted interception. The desired impact time is achieved by selecting the interceptor's lateral acceleration to enforce a sliding mode on a switching surface designed using non-linear engagement dynamics. Numerical simulation results are presented to validate the proposed guidance law for different initial engagement geometries, impact times and salvo attack scenarios

Features in visual search combine linearly

Single features such as line orientation and length are known to guide visual search, but relatively little is known about how multiple features combine in search. To address this question, we investigated how search for targets differing in multiple features ( intensity, length, orientation) from the distracters is related to searches for targets differing in each of the individual features. We tested race models (based on reaction times) and coactivation models ( based on reciprocal of reaction times) for their ability to predict multiple feature searches. Multiple feature searches were best accounted for by a co-activation model in which feature information combined linearly (r = 0.95). This result agrees with the classic finding that these features are separable i.e., subjective dissimilarity ratings sum linearly. We then replicated the classical finding that the length and width of a rectangle are integral features-in other words, they combine nonlinearly in visual search. However, to our surprise, upon including aspect ratio as an additional feature, length and width combined linearly and this model outperformed all other models. Thus, length and width of a rectangle became separable when considered together with aspect ratio. This finding predicts that searches involving shapes with identical aspect ratio should be more difficult than searches where shapes differ in aspect ratio. We confirmed this prediction on a variety of shapes. We conclude that features in visual search co-activate linearly and demonstrate for the first time that aspect ratio is a novel feature that guides visual search.

Avoiding acidic region streaking in two-dimensional gel electrophoresis: Case study with two bacterial whole cell protein extracts

Acidic region streaking (ARS) is one of the lacunae in two-dimensional gel electrophoresis (2DE) of bacterial proteome. This streaking is primarily caused by nucleic acid (NuA) contamination and poses major problem in the downstream processes like image analysis and protein identification. Although cleanup and nuclease digestion are practiced as remedial options, these strategies may incur loss in protein recovery and perform incomplete removal of NuA. As a result, ARS has remained a common observation across publications, including the recent ones. In this work, we demonstrate how ultrasound wave can be used to shear NuA in plain ice-cooled water, facilitating the elimination of ARS in the 2DE gels without the need for any additional sample cleanup tasks. In combination with a suitable buffer recipe, IEF program and frequent paper-wick changing approach, we are able to reproducibly demonstrate the production of clean 2DE gels with improved protein recovery and negligible or no ARS. We illustrate our procedure using whole cell protein extracts from two diverse organisms, Escherichia coli and Mycobacterium smegmatis. Our designed protocols are straightforward and expected to provide good 2DE gels without ARS, with comparable times and significantly lower cost.

Engineering a Water-Dispersible, Conducting, Photoreduced Graphene Oxide

A critical limitation that has hampered widespread application of the electrically conducting reduced graphene oxide (r-GO) is its poor aqueous dispersibility. Here we outline a strategy to obtain water-dispersible conducting r-GO sheets, free of any stabilizing agents, by exploiting the fact that the kinetics of the photoreduction of the insulating GO is heterogeneous. We show that by controlling UV exposure times and pH, we can obtain r-GO sheets with the conducting sp(2)-graphitic domains restored but with the more acidic carboxylic groups, responsible for aqueous dispersibility, intact. The resultant photoreduced r-GO sheets are both conducting and water-dispersible.

All Inorganic Spin-Coated Nanoparticle-Based Capacitive Memory Devices

We demonstrate all inorganic, robust, cost-effective, spin-coated, two-terminal capacitive memory metal-oxide nanoparticle-oxide-semiconductor devices with cadmium telluride nanoparticles sandwiched between aluminum oxide phosphate layers to form the dielectric memory stack. Using a novel high-speed circuit to decouple reading and writing, experimentally measured memory windows, programming voltages, retention times, and endurance are comparable with or better than the two-terminal memory devices realized using other fabrication techniques.