Trehalose Toxicity in Cuscuta reflexa - Sucrose Content Decreases In Shoot Tips Upon Trehalose Feeding

Trehalose, an alpha,alpha-diglucoside, induced a rapid blackening and death of shoot tips of Cuscuta reflexa (dodder) cultured in vitro. The onset of toxic symptom was delayed if any of the several sugars which support the in vitro growth of Cuscuta was supplied with trehalose. The rate of trehalose uptake or its accumulation in the tissue was not affected by sugar cofeeding. The levels of total and reducing sugars declined appreciably in the trehalose-fed shoot tip explants compared to control tissue cultured in absence of a carbon source. This was not due to an increased rate of respiration of the trehalose-treated tissue. In shoot tips cultured in presence of both trehalose and sucrose, the decline in total and reducing sugars was curtailed. There was a marked fall in the level of sucrose; and invertase activity was higher in trehalose-fed shoot tips. The incorporation of label from [14C]glucose into sucrose in the shoot tip explant was reduced as early as 12 h of trehalose feeding. The results suggest that increased utilization of sucrose as well as an inhibition of its synthesis contribute to the drastic fall in the sucrose content upon trehalose feeding.

Trehalose toxicity in cuscuta-reflexa - cell-wall synthesis is inhibited upon trehalose feeding

a,a-Trehalose induced a rapid blackening of the terminal 2.5-centimete region of excised Cuscuta relexa Roxb. vine. The incorporation of radioactivite from [I'C]glucose into alkali-insoluble fraction of shoot tip was markedly inhibited by 12 hours of trehalose feeding to an excised vine. This inhibition was confied to the apical segment of the vine in which cell elongation occurred. The rate of blackening of shoot tip explants was hastened by the addition of gibberellic acid A3, which promoted elongationgrowth of isolated Cuscuta shoot tips. The symptom of trehalose toxicity was duplicated by 2-deoxygucose, which has been shown to ba potent inhibitor of ceD wall synthesis in yeast. The observations suggest that trehalose interferes with the synthesis of ceDl wail polysaccharides, the chief component of which was presumed to be cellulose.

Toxicity in Cuscuta reflexa Sucrose Content Decreases In Shoot Tips Upon Trehalose Feeding Trehalose

Trehalose, an {alpha},{alpha}-diglucoside, induced a rapid blackening and death of shoot tips of Cuscuta reflexa (dodder) cultured in vitro. The onset of toxic symptom was delayed if any of the several sugars which support the in vitro growth of Cuscuta was supplied with trehalose. The rate of trehalose uptake or its accumulation in the tissue was not affected by sugar cofeeding. The levels of total and reducing sugars declined appreciably in the trehalose-fed shoot tip explants compared to control tissue cultured in absence of a carbon source. This was not due to an increased rate of respiration of the trehalose-treated tissue. In shoot tips cultured in presence of both trehalose and sucrose, the decline in total and reducing sugars was curtailed. There was a marked fall in the level of sucrose; and invertase activity was higher in trehalose-fed shoot tips. The incorporation of label from [14C]glucose into sucrose in the shoot tip explant was reduced as early as 12 h of trehalose feeding. The results suggest that increased utilization of sucrose as well as an inhibition of its synthesis contribute to the drastic fall in the sucrose content upon trehalose feeding

Characterization of mitochondrial neutral protease activity and the response of lysosomal enzymes to clofibrate feeding in rat liver

The phosphate-inhibitable neutral protease activity of the heavy mitochondrial fraction of rat liver is of lysosomal origin. The activity is essentially due to the thiol proteinases of the lysosomes. Digitonin treatment of the mitochondrial fraction results in the release of about 85 per cent of the neutral protease activity and the residual activity has an alkaline pH optimum and is not inhibited by phosphate. Clofibrate feeding at 0.5 per cent level in the diet results in enhanced levels of lysosomal enzymes. The increase is however restricted to the lysosome-rich fraction such that the activities associated with the heavy mitochondrial fraction show a significant decrease. It is suggested that clofibrate inhibits engulfment of mitochondria by lysosomes and this results in enhanced mitochondrial protein content.

A Five-Level Inverter Scheme for a Four-Pole Induction Motor Drive by Feeding the Identical Voltage-Profile Windings From Both Sides

This paper presents a five-level inverter scheme with four two-level inverters for a four-pole induction motor (IM) drive. In a conventional three-phase four-pole IM, there exists two identical voltage-profile winding coil groups per phase around the armature, which are connected in series and spatially apart by two pole pitches. In this paper, these two identical voltage-profile pole-pair winding coils in each phase of the IM are disconnected and fed from four two-level inverters from four sides of the windings with one-fourth dc-link voltage as compared to a conventional five-level neutral-point-clamped inverter. The scheme presented in this paper does not require any special design modification for the induction machine. For this paper, a four-pole IM drive is used, and the scheme can be easily extended to IMs with more than four poles. The proposed scheme is experimentally verified on a four-pole 5-hp IM drive.

Ecology of the Asian Elephant in Southern India. II. Feeding Habits and Crop Raiding Patterns

The Asian elephant's foraging strategy in its natural habitat and in cultivation was studied in southern India during 1981-83. Though elephants consumed at least 112 plant species in the study area, about 85% of their diet consisted of only 25 species from the order Malvales and the families Leguminosae, Palmae, Cyperaceae and Gramineae. Alteration between a predominantly browse diet during the dry season with a grass diet during the early wet season was related to the seasonally changing protein content of grasses. Crop raiding, which was sporadic during the dry season, gradually increased with more area being cultivated with the onset of rains. Raiding frequency reached a peak during October-December, with some villages being raided almost every night, when finger millet (Eleusine coracana) was cultivated by most farmers. The monthly frequency of raiding was related to the seasonal movement of elephant herds and to the size of the enclave. Of their total annual food requirement, adult bull elephants derived an estimated 9.3% and family herds 1.7% in quantity from cultivated land. Cultivated cereal and millet crops provided significantly more protein, calcium and sodium than the wild grasses. Ultimately, crop raiding can be thought of as an extension of the elephant's optimal foraging strategy.

OPSM - Opportunistic Power Save mode for Infrastructure IEEE 802.11 WLAN

We focus on the energy spent in radio communication by the stations (STAs) in an IEEE 802.11 infrastructure WLAN. All the STAs are engaged in web browsing, which is characterized by a short file downloads over TCP, with short duration of inactivity or think time in between two file downloads. Under this traffic, Static PSM (SPSM) performs better than CAM, since the STAs in SPSM can switch to low power state (sleep) during think times while in CAM they have to be in the active state all the time. In spite of this gain, performance of SPSM degrades due to congestion, as the number of STAs associated with the access point (AP) increases. To address this problem, we propose an algorithm, which we call opportunistic PSM (OPSM). We show through simulations that OPSM performs better than SPSM under the aforementioned TCP traffic. The performance gain achieved by OPSM over SPSM increases as the mean file size requested by the STAs or the number of STAs associated with the AP increases. We implemented OPSM in NS-2.33, and to compare the performance of OPSM and SPSM, we evaluate the number of file downloads that can be completed with a given battery capacity and the average time taken to download a file.

Providing quality of service via opportunistic splitting using stochastic approximation

We consider the problem of wireless channel allocation to multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. Each metric sequence can be Markov. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic splitting for scheduling via stochastic approximation

We consider the problem of scheduling a wireless channel among multiple users. A slot is given to a user with a highest metric (e.g., channel gain) in that slot. The scheduler may not know the channel states of all the users at the beginning of each slot. In this scenario opportunistic splitting is an attractive solution. However this algorithm requires that the metrics of different users form independent, identically distributed (iid) sequences with same distribution and that their distribution and number be known to the scheduler. This limits the usefulness of opportunistic splitting. In this paper we develop a parametric version of this algorithm. The optimal parameters of the algorithm are learnt online through a stochastic approximation scheme. Our algorithm does not require the metrics of different users to have the same distribution. The statistics of these metrics and the number of users can be unknown and also vary with time. We prove the convergence of the algorithm and show its utility by scheduling the channel to maximize its throughput while satisfying some fairness and/or quality of service constraints.

Opportunistic scheduling of wireless links

We consider the problem of scheduling of a wireless channel (server) to several queues. Each queue has its own link (transmission) rate. The link rate of a queue can vary randomly from slot to slot. The queue lengths and channel states of all users are known at the beginning of each slot. We show the existence of an optimal policy that minimizes the long term (discounted) average sum of queue lengths. The optimal policy, in general needs to be computed numerically. Then we identify a greedy (one step optimal) policy, MAX-TRANS which is easy to implement and does not require the channel and traffic statistics. The cost of this policy is close to optimal and better than other well-known policies (when stable) although it is not throughput optimal for asymmetric systems. We (approximately) identify its stability region and obtain approximations for its mean queue lengths and mean delays. We also modify this policy to make it throughput optimal while retaining good performance.

Opportunistic Scheduling in Cellular Systems in the Presence of Noncooperative Mobiles

A central scheduling problem in wireless communications is that of allocating resources to one of many mobile stations that have a common radio channel. Much attention has been given to the design of efficient and fair scheduling schemes that are centrally controlled by a base station (BS) whose decisions depend on the channel conditions reported by each mobile. The BS is the only entity taking decisions in this framework. The decisions are based on the reports of mobiles on their radio channel conditions. In this paper, we study the scheduling problem from a game-theoretic perspective in which some of the mobiles may be noncooperative or strategic, and may not necessarily report their true channel conditions. We model this situation as a signaling game and study its equilibria. We demonstrate that the only Perfect Bayesian Equilibria (PBE) of the signaling game are of the babbling type: the noncooperative mobiles send signals independent of their channel states, the BS simply ignores them, and allocates channels based only on the prior information on the channel statistics. We then propose various approaches to enforce truthful signaling of the radio channel conditions: a pricing approach, an approach based on some knowledge of the mobiles' policies, and an approach that replaces this knowledge by a stochastic approximations approach that combines estimation and control. We further identify other equilibria that involve non-truthful signaling.

An Opportunistic, Fast, and Distributed Subchannel and User-Pairing Algorithm for OFDMA

Channel-aware assignment of subchannels to users in the downlink of an OFDMA system requires extensive feedback of channel state information (CSI) to the base station. Since bandwidth is scarce, schemes that limit feedback are necessary. We develop a novel, low feedback, distributed splitting-based algorithm called SplitSelect to opportunistically assign each subchannel to its most suitable user. SplitSelect explicitly handles multiple access control aspects associated with CSI feedback, and scales well with the number of users. In it, according to a scheduling criterion, each user locally maintains a scheduling metric for each subchannel. The goal is to select, for each subchannel, the user with the highest scheduling metric. At any time, each user contends for the subchannel for which it has the largest scheduling metric among the unallocated subchannels. A tractable asymptotic analysis of a system with many users is central to SplitSelect's simple design. Extensive simulation results demonstrate the speed with which subchannels and users are paired. The net data throughput, when the time overhead of selection is accounted for, is shown to be substantially better than several schemes proposed in the literature. We also show how fairness and user prioritization can be ensured by suitably defining the scheduling metric.

Accurate performance analysis of single and opportunistic AF relay cooperation with imperfect cascaded channel estimates

Given the significant gains that relay-based cooperation promises, the practical problems of acquisition of channel state information (CSI) and the characterization and optimization of performance with imperfect CSI are receiving increasing attention. We develop novel and accurate expressions for the symbol error probability (SEP) for fixed-gain amplify-and-forward relaying when the destination acquires CSI using the time-efficient cascaded channel estimation (CCE) protocol. The CCE protocol saves time by making the destination directly estimate the product of the source-relay and relay-destination channel gains. For a single relay system, we first develop a novel SEP expression and a tight SEP upper bound. We then similarly analyze an opportunistic multi-relay system, in which both selection and coherent demodulation use imperfect estimates. A distinctive aspect of our approach is the use of as few simplifying approximations as possible, which results in new results that are accurate at signal-to-noise-ratios as low as 1 dB for single and multi-relay systems. Using insights gleaned from an asymptotic analysis, we also present a simple, closed-form, nearly-optimal solution for allocation of energy between pilot and data symbols at the source and relay(s).