Pricing a Shared Access Link for Fair and Efficient Operation with Variable User Data Rates

The literature on pricing implicitly assumes an "infinite data" model, in which sources can sustain any data rate indefinitely. We assume a more realistic "finite data" model, in which sources occasionally run out of data; this leads to variable user data rates. Further, we assume that users have contracts with the service provider, specifying the rates at which they can inject traffic into the network. Our objective is to study how prices can be set such that a single link can be shared efficiently and fairly among users in a dynamically changing scenario where a subset of users occasionally has little data to send. User preferences are modelled by concave increasing utility functions. Further, we introduce two additional elements: a convex increasing disutility function and a convex increasing multiplicative congestion-penally function. The disutility function takes the shortfall (contracted rate minus present rate) as its argument, and essentially encourages users to send traffic at their contracted rates, while the congestion-penalty function discourages heavy users from sending excess data when the link is congested. We obtain simple necessary and sufficient conditions on prices for fair and efficient link sharing; moreover, we show that a single price for all users achieves this. We illustrate the ideas using a simple experiment.

Interference Alignment Algorithms for the K User Constant MIMO Interference Channel

This paper considers the degrees of freedom (DOF) for a K user multiple-input multiple-output (MIMO) M x N interference channel using interference alignment (IA). A new performance metric for evaluating the efficacy of IA algorithms is proposed, which measures the extent to which the desired signal dimensionality is preserved after zero-forcing the interference at the receiver. Inspired by the metric, two algorithms are proposed for designing the linear precoders and receive filters for IA in the constant MIMO interference channel with a finite number of symbol extensions. The first algorithm uses an eigenbeamforming method to align sub-streams of the interference to reduce the dimensionality of the interference at all the receivers. The second algorithm is iterative, and is based on minimizing the interference leakage power while preserving the dimensionality of the desired signal space at the intended receivers. The improved performance of the algorithms is illustrated by comparing them with existing algorithms for IA using Monte Carlo simulations.

A power scalable receiver front-end at 2.4 GHz

We propose a Low Noise Amplifier (LNA) architecture for power scalable receiver front end (FE) for Zigbee. The motivation for power scalable receiver is to enable minimum power operation while meeting the run-time performance needed. We use simple models to find empirical relations between the available signal and interference levels to come up with required Noise Figure (NF) and 3rd order Intermodulation Product (IIP3) numbers. The architecture has two independent digital knobs to control the NF and IIP3. Acceptable input match while using adaptation has been achieved by using an Active Inductor configuration for the source degeneration inductor of the LNA. The low IF receiver front end (LNA with I and Q mixers) was fabricated in 130nm RFCMOS process and tested.

Fast Direct Torque Control of an Open-End Induction Motor Drive Using 12-Sided Polygonal Voltage Space Vectors

A torque control scheme, based on a direct torque control (DTC) algorithm using a 12-sided polygonal voltage space vector, is proposed for a variable speed control of an open-end induction motor drive. The conventional DTC scheme uses a stator flux vector for the sector identification and then the switching vector to control stator flux and torque. However, the proposed DTC scheme selects switching vectors based on the sector information of the estimated fundamental stator voltage vector and its relative position with respect to the stator flux vector. The fundamental stator voltage estimation is based on the steady-state model of IM and the synchronous frequency of operation is derived from the computed stator flux using a low-pass filter technique. The proposed DTC scheme utilizes the exact positions of the fundamental stator voltage vector and stator flux vector to select the optimal switching vector for fast control of torque with small variation of stator flux within the hysteresis band. The present DTC scheme allows full load torque control with fast transient response to very low speeds of operation, with reduced switching frequency variation. Extensive experimental results are presented to show the fast torque control for speed of operation from zero to rated.

Growth and consumption rates of the phase layers during interdiffusion in a diffusion couple with finite end member

The relations for the growth and consumption rates of a layer with finite thickness as an end member and the product phases in the interdiffusion zone are developed. We have used two different methodologies, the diffusion based and the physico-chemical approach to develop the same relations. We have shown that the diffusion based approach is rather straightforward; however, the physico-chemical approach is much more versatile than the other method. It was found that the position of the marker plane becomes vague in the second stage of the interdiffusion process in pure A thin layer/B couple, where two phases grow simultaneously.

Five-level inverter voltage-space phasor generation for an open-end winding induction motor drive

A topology for voltage-space phasor generation equivalent to a five-level inverter for an open-end winding induction motor is presented. The open-end winding induction motor is fed from both ends by two three-level inverters. The three-level inverters are realised by cascading two two-level inverters. This inverter scheme does not experience neutral-point fluctuations. Of the two three-level inverters only one will be switching at any instant in the lower speed ranges. In the multilevel carrier-based SPWM used for the proposed drive, a progressive discrete DC bias depending on the speed range is given to the reference wave to reduce the inverter switchings. The drive is implemented and tested with a 1 HP open-end winding induction motor and experimental results are presented.

DMT of Multihop Networks: End Points and Computational Tools

In this paper, the diversity-multiplexing gain tradeoff (DMT) of single-source, single-sink (ss-ss), multihop relay networks having slow-fading links is studied. In particular, the two end-points of the DMT of ss-ss full-duplex networks are determined, by showing that the maximum achievable diversity gain is equal to the min-cut and that the maximum multiplexing gain is equal to the min-cut rank, the latter by using an operational connection to a deterministic network. Also included in the paper, are several results that aid in the computation of the DMT of networks operating under amplify-and-forward (AF) protocols. In particular, it is shown that the colored noise encountered in amplify-and-forward protocols can be treated as white for the purpose of DMT computation, lower bounds on the DMT of lower-triangular channel matrices are derived and the DMT of parallel MIMO channels is computed. All protocols appearing in the paper are explicit and rely only upon AF relaying. Half-duplex networks and explicit coding schemes are studied in a companion paper.

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.

3-D acoustic analysis of elliptical chamber mufflers having an end-inlet and a side-outlet: An impedance matrix approach

The acoustical behavior of an elliptical chamber muffler having an end-inlet and side-outlet port is analyzed semi-analytically. A uniform piston source is assumed to model the 3-D acoustic field in the elliptical chamber cavity. Towards this end, we consider the modal expansion of acoustic pressure field in the elliptical cavity in terms of angular and radial Mathieu functions, subjected to rigid wall condition, whereupon under the assumption of a point source, Green's function is obtained. On integrating this function over piston area of the side or end port and dividing it by piston area, one obtains the acoustic field, whence one can find the impedance matrix parameters characterizing the 2-port system. The acoustic performance of these configurations is evaluated in terms of transmission loss (TL). The analytical results thus obtained are compared with 3-D HA carried on a commercial software for certain muffler configurations. These show excellent agreement, thereby validating the 3-D semi-analytical piston driven model. The influence of the chamber length as well as the angular and axial location of the end and side ports on TL performance is also discussed, thus providing useful guidelines to the muffler designer. (c) 2011 Elsevier B.V. All rights reserved.

Time-Dependent Predominance of Nonhomologous DNA End-Joining Pathways during Embryonic Development in Mice

Repair of DNA double-strand breaks (DSBs) is crucial for maintaining genomic integrity during the successful development of a fertilized egg into a whole organism. To date, the mechanism of DSB repair in postimplantation embryos has been largely unknown. In the present study, using a cell-free repair system derived from the different embryonic stages of mice, we find that canonical nonhomologous end joining (NHEJ), one of the major DSB repair pathways in mammals, is predominant at 14.5 day of embryonic development. Interestingly, all four types of DSBs tested were repaired by ligase IV/XRCC4 and Ku-dependent classical NHEJ. Characterization of end-joined junctions and expression studies further showed evidences for canonical NHEJ. Strikingly, in contrast to the above, we observed noncanonical end joining accompanied by DSB resection, dependent on microhomology and ligase III in 18.5-day embryos. Interestingly, we observed an elevated expression of CtIP, MRE11, and NBS1 at this stage, suggesting that it could act as a switch between classical end joining and microhomology-mediated end joining at later stages of embryonic development. Thus, our results establish for the first time the existence of both canonical and alternative NHEJ pathways during the postimplantation stages of mammalian embryonic development. (C) 2012 Elsevier Ltd. All rights reserved.

Sesbania Mosaic Virus (SeMV) Infectious Clone: Possible Mechanism of 3 ` and 5 ` End Repair and Role of Polyprotein Processing in Viral Replication

Sesbania mosaic virus (SeMV) is a positive stranded RNA virus belonging to the genus Sobemovirus. Construction of an infectious clone is an essential step for deciphering the virus gene functions in vivo. Using Agrobacterium based transient expression system we show that SeMV icDNA is infectious on Sesbania grandiflora and Cyamopsis tetragonoloba plants. The efficiency of icDNA infection was found to be significantly high on Cyamopsis plants when compared to that on Sesbania grandiflora. The coat protein could be detected within 6 days post infiltration in the infiltrated leaves. Different species of viral RNA (double stranded and single stranded genomic and subgenomic RNA) could be detected upon northern analysis, suggesting that complete replication had taken place. Based on the analysis of the sequences at the genomic termini of progeny RNA from SeMV icDNA infiltrated leaves and those of its 3' and 5' terminal deletion mutants, we propose a possible mechanism for 3' and 5' end repair in vivo. Mutation of the cleavage sites in the polyproteins encoded by ORF 2 resulted in complete loss of infection by the icDNA, suggesting the importance of correct polyprotein processing at all the four cleavage sites for viral replication. Complementation analysis suggested that ORF 2 gene products can act in trans. However, the trans acting ability of ORF 2 gene products was abolished upon deletion of the N-terminal hydrophobic domain of polyprotein 2a and 2ab, suggesting that these products necessarily function at the replication site, where they are anchored to membranes.

Dynamics of end-to-end loop formation: A flexible chain in the presence of hydrodynamic interaction

Based on the Wilemski-Fixman approach G. Wilemski, M. Fixman, J. Chem. Phys. 60 (1974) 866], we show that, for a flexible chain in theta solvent, hydrodynamic interaction treated with a pre-averaging approximation makes ring closing faster if the chain is not very short. We also show that the ring closing time for a long chain with hydrodynamic interaction in theta solvent scales with the chain length (N) as N-1.5, in agreement with the previous renormalization group calculation based prediction by Freidman and O'Shaughnessy B. Friedman, B. O'Shaughnessy, Phys. Rev. A 40 (1989) 5950]. (C) 2012 Elsevier B.V. All rights reserved.