Performance limits of transition metal dichalcogenide (MX2) nanotube surround gate ballistic field effect transistors

We theoretically analyze the performance of transition metal dichalcogenide (MX2) single wall nanotube (SWNT) surround gate MOSFET, in the 10 nm technology node. We consider semiconducting armchair (n, n) SWNT of MoS2, MoSe2, WS2, and WSe2 for our study. The material properties of the nanotubes are evaluated from the density functional theory, and the ballistic device characteristics are obtained by self-consistently solving the Poisson-Schrodinger equation under the non-equilibrium Green's function formalism. Simulated ON currents are in the range of 61-76 mu A for 4.5 nm diameter MX2 tubes, with peak transconductance similar to 175-218 mu S and ON/OFF ratio similar to 0.6 x 10(5)-0.8 x 10(5). The subthreshold slope is similar to 62.22 mV/decade and a nominal drain induced barrier lowering of similar to 12-15 mV/V is observed for the devices. The tungsten dichalcogenide nanotubes offer superior device output characteristics compared to the molybdenum dichalcogenide nanotubes, with WSe2 showing the best performance. Studying SWNT diameters of 2.5-5 nm, it is found that increase in diameter provides smaller carrier effective mass and 4%-6% higher ON currents. Using mean free path calculation to project the quasi-ballistic currents, 62%-75% reduction from ballistic values in drain current in long channel lengths of 100, 200 nm is observed.

Optimal design of timer-based, distributed selection with unknown number of nodes

The timer-based selection scheme is a popular, simple, and distributed scheme that is used to select the best node from a set of available nodes. In it, each node sets a timer as a function of a local preference number called a metric, and transmits a packet when its timer expires. The scheme ensures that the timer of the best node, which has the highest metric, expires first. However, it fails to select the best node if another node transmits a packet within Delta s of the transmission by the best node. We derive the optimal timer mapping that maximizes the average success probability for the practical scenario in which the number of nodes in the system is unknown but only its probability distribution is known. We show that it has a special discrete structure, and present a recursive characterization to determine it. We benchmark its performance with ad hoc approaches proposed in the literature, and show that it delivers significant gains. New insights about the optimality of some ad hoc approaches are also developed.

Codes with local regeneration

Regenerating codes and codes with locality are schemes recently proposed for a distributed storage network. While regenerating codes minimize the data downloaded for node repair, codes with locality minimize the number of nodes accessed during repair. In this paper, we provide some constructions of codes with locality, in which the local codes are regenerating codes, thereby combining the advantages of both classes of codes. The proposed constructions achieve an upper bound on minimum distance and are hence optimal. The constructions include both the cases when the local regenerating codes correspond to the MSR point as well as the MBR point on the storage repair-bandwidth tradeoff curve.

Miniaturized Defected Ground High Isolation Crossovers

This letter relates to the design of crossovers for carrying criss crossing signals. Two types of crossovers are proposed in this letter. Both the crossovers are designed using a two layer printed circuit board. An unbroken continuous transmission line is routed in the top layer for carrying signal 1 from one node to another node. Transmission line used for carrying a signal 2 consists of three physically discontinuous, but electrically connected segments. Two end segments of these are located in the top layer while the middle segment is placed in the bottom layer. While Type I crossover offers an isolation of 25 dB, Type II crossover offers isolation better than 35 dB from dc to 10 GHz. These crossovers are compact and measure an actual size of 10 x 10 x 0.78 mm(3).

Design and Analysis of an Acknowledgment-Aware Asynchronous MPR MAC Protocol for Distributed WLANs

Multi-packet reception (MPR) promises significant throughput gains in wireless local area networks (WLANs) by allowing nodes to transmit even in the presence of ongoing transmissions in the medium. However, the medium access control (MAC) layer must now be redesigned to facilitate rather than discourage - these overlapping transmissions. We investigate asynchronous MPR MAC protocols, which successfully accomplish this by controlling the node behavior based on the number of ongoing transmissions in the channel. The protocols use the backoff timer mechanism of the distributed coordination function, which makes them practically appealing. We first highlight a unique problem of acknowledgment delays, which arises in asynchronous MPR, and investigate a solution that modifies the medium access rules to reduce these delays and increase system throughput in the single receiver scenario. We develop a general renewal-theoretic fixed-point analysis that leads to expressions for the saturation throughput, packet dropping probability, and average head-of-line packet delay. We also model and analyze the practical scenario in which nodes may incorrectly estimate the number of ongoing transmissions.

Physical Layer Network Coding for the K-User Multiple Access Relay Channel

We propose a Physical layer Network Coding (PNC) scheme for the K-user wireless Multiple Access Relay Channel, in which K source nodes want to transmit messages to a destination node D with the help of a relay node R. The proposed scheme involves (i) Phase 1 during which the source nodes alone transmit and (ii) Phase 2 during which the source nodes and the relay node transmit. At the end of Phase 1, the relay node decodes the messages of the source nodes and during Phase 2 transmits a many-to-one function of the decoded messages. To counter the error propagation from the relay node, we propose a novel decoder which takes into account the possibility of error events at R. It is shown that if certain parameters are chosen properly and if the network coding map used at R forms a Latin Hypercube, the proposed decoder offers the maximum diversity order of two. Also, it is shown that for a proper choice of the parameters, the proposed decoder admits fast decoding, with the same decoding complexity order as that of the reference scheme based on Complex Field Network Coding (CFNC). Simulation results indicate that the proposed PNC scheme offers a large gain over the CFNC scheme.

Interplay Between Optimal Selection Scheme, Selection Criterion, and Discrete Rate Adaptation in Opportunistic Wireless Systems

An opportunistic, rate-adaptive system exploits multi-user diversity by selecting the best node, which has the highest channel power gain, and adapting the data rate to selected node's channel gain. Since channel knowledge is local to a node, we propose using a distributed, low-feedback timer backoff scheme to select the best node. It uses a mapping that maps the channel gain, or, in general, a real-valued metric, to a timer value. The mapping is such that timers of nodes with higher metrics expire earlier. Our goal is to maximize the system throughput when rate adaptation is discrete, as is the case in practice. To improve throughput, we use a pragmatic selection policy, in which even a node other than the best node can be selected. We derive several novel, insightful results about the optimal mapping and develop an algorithm to compute it. These results bring out the inter-relationship between the discrete rate adaptation rule, optimal mapping, and selection policy. We also extensively benchmark the performance of the optimal mapping with several timer and opportunistic multiple access schemes considered in the literature, and demonstrate that the developed scheme is effective in many regimes of interest.

Wireless Network Coding for MIMO Two-Way Relaying

The design of modulation schemes for the physical layer network-coded two-way MIMO relaying scenario is considered, with the denoise-and-forward protocol which employs two phases: Multiple Access phase and Broadcast phase. It is shown that for MIMO two-way relaying, the minimum distance of the effective constellation at the relay becomes zero when all the rows of the channel fade coefficient matrix belong to a finite number of vector subspaces referred to as the singular fade subspaces. The singular fade subspaces can be classified into two kinds based on whether their harmful effects can be removed or not: (i) the removable and (ii) the non-removable singular fade subspaces. It is shown that network coding maps obtained by the completion of appropriate partially filled Latin Rectangles can remove the harmful effects of all the removable singular fade subspaces. For 2(lambda)-PSK signal set, the removable and non-removable singular fade subspaces are characterized and, it is shown that the number of non-removable singular fade subspaces is a small fraction of the total number of singular fade subspaces and this fraction tends to zero as the constellation size tends to infinity. The Latin Rectangles for the case when the end nodes use different number of antennas are shown to be obtainable from the Latin Squares for the case when they use the same number of antennas. Also, the network coding maps which remove all the removable singular singular fade subspaces are shown to be obtainable from a small set of Latin Squares. The removal of all the singular fade subspaces by properly choosing the network coding map, provides a gain of 5.5 dB over the conventional Exclusive-OR network coding, in a Rayleigh fading scenario with 2 antennas at the end nodes and one antenna at the relay node, for 4-PSK signal set.

Forming Networks of Strategic Agents with Desired Topologies

Many networks such as social networks and organizational networks in global companies consist of self-interested agents. The topology of these networks often plays a crucial role in important tasks such as information diffusion and information extraction. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a stable network having that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation and a utility model that captures many key features. Based on this model, we analyze relevant network topologies and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks, wherein no node wants to delete any of its links and no two nodes would want to create a link between them.

The Modified Selenenyl Amide, M-hydroxy Ebselen, Attenuates Diabetic Nephropathy and Diabetes-Associated Atherosclerosis in ApoE/GPx1 Double Knockout Mice

Seleno-organic glutathione peroxidase (GPx) mimetics, including ebselen (Eb), have been tested in in vitro studies for their ability to scavenge reactive oxygen and nitrogen species, including hydrogen peroxide and peroxynitrite. In this study, we investigated the efficacies of two Eb analogues, m-hydroxy ebselen (ME) and ethanol-ebselen (EtE) and compared these with Eb in cell based assays. We found that ME is superior in attenuating the activation of hydrogen peroxide-induced pro-inflammatory mediators, ERK and P38 in human aortic endothelial cells. Consequently, we investigated the effects of ME in an in vivo model of diabetes, the ApoE/GPx1 double knockout (dKO) mouse. We found that ME attenuates plaque formation in the aorta and lesion deposition within the aortic sinus of diabetic dKO mice. Oxidative stress as assessed by 8-OHdG in urine and nitrotyrosine immunostaining in the aortic sinus and kidney tubules, was reduced by ME in diabetic dKO mice. ME also attenuated diabetes-associated renal injury which included tubulointerstitial fibrosis and glomerulosclerosis. Furthermore, the bioactivity of the pro-fibrotic cytokine transforming growth factor-beta (TGF-beta) as assessed by phospho-Smad2/3 immunostaining was attenuated after treatment with ME. TGF-beta-stimulated increases in collagen I and IV gene expression and protein levels were attenuated by ME in rat kidney tubular cells. However, in contrast to the superior activity of ME in in vitro and cell based assays, ME did not further augment the attenuation of diabetes-associated atherosclerosis and renal injury in our in vivo model when compared with Eb. In conclusion, this study strengthens the notion that bolstering GPx-like activity using synthetic mimetics may be a useful therapeutic strategy in lessening the burden of diabetic complications. However, these studies highlight the importance of in vivo analyses to test the efficacies of novel Eb analogues, as in vitro and cell based assays are only partly predictive of the in vivo situation.

Did southern Western Ghats of peninsular India serve as refugia for its endemic biota during the Cretaceous volcanism?

The Western Ghats (WG) of south India, a global biodiversity hotspot, has experienced complex geological history being part of Gondwana landmass and encountered extensive volcanic activity at the end of Cretaceous epoch. It also has a climatically and topographically heterogeneous landscape. Thus, the WG offer a unique setting to explore the influence of ecological and geological processes on the current diversity and distribution of its biota. To this end, three explicit biogeographical scenarios were hypothesized to evaluate the distribution and diversification of wet evergreen species of the WG - (1) southern WG was a refuge for the wet evergreen species during the Cretaceous volcanism, (2) phylogenetic breaks in the species phylogeny would correspond to geographic breaks (i.e., the Palghat gap) in the WG, and (3) species from each of the biogeographic subdivisions within the WG would form distinct clades. These hypotheses were tested on the centipede genus Digitipes from the WG which is known to be an ancient, endemic, and monophyletic group. The Digitipes molecular phylogeny was subjected to divergence date estimation using Bayesian approach, and ancestral areas were reconstructed using parsimony approach for each node in the phylogeny. Ancestral-area reconstruction suggested 13 independent dispersal events to explain the current distribution of the Digitipes species in the WG. Among these 13 dispersals, two dispersal events were at higher level in the Digitipes phylogeny and were from the southern WG to the central and northern WG independently in the Early Paleocene, after the Cretaceous Volcanism. The remaining 11 dispersal events explained the species' range expansions of which nine dispersals were from the southern WG to other biogeographic subdivisions in the Eocene-Miocene in the post-volcanic periods where species-level diversifications occurred. Taken together, these results suggest that southern WG might have served as a refuge for Digitipes species during Cretaceous volcanism.

Game theoretic, decentralized, local information based algorithm for community detection in social graphs

Motivated by the observation that communities in real world social networks form due to actions of rational individuals in networks, we propose a novel game theory inspired algorithm to determine communities in networks. The algorithm is decentralized and only uses local information at each node. We show the efficacy of the proposed algorithm through extensive experimentation on several real world social network data sets.

Sufficient conditions for formation of a network topology by self-interested agents

Networks such as organizational network of a global company play an important role in a variety of knowledge management and information diffusion tasks. The nodes in these networks correspond to individuals who are self-interested. The topology of these networks often plays a crucial role in deciding the ease and speed with which certain tasks can be accomplished using these networks. Consequently, growing a stable network having a certain topology is of interest. Motivated by this, we study the following important problem: given a certain desired network topology, under what conditions would best response (link addition/deletion) strategies played by self-interested agents lead to formation of a pairwise stable network with only that topology. We study this interesting reverse engineering problem by proposing a natural model of recursive network formation. In this model, nodes enter the network sequentially and the utility of a node captures principal determinants of network formation, namely (1) benefits from immediate neighbors, (2) costs of maintaining links with immediate neighbors, (3) benefits from indirect neighbors, (4) bridging benefits, and (5) network entry fee. Based on this model, we analyze relevant network topologies such as star graph, complete graph, bipartite Turan graph, and multiple stars with interconnected centers, and derive a set of sufficient conditions under which these topologies emerge as pairwise stable networks. We also study the social welfare properties of the above topologies.

Partial delamination modeling in composite beams using a finite element method

A new method of modeling partial delamination in composite beams is proposed and implemented using the finite element method. Homogenized cross-sectional stiffness of the delaminated beam is obtained by the proposed analytical technique, including extension-bending, extension-twist and torsion-bending coupling terms, and hence can be used with an existing finite element method. A two noded C1 type Timoshenko beam element with 4 degrees of freedom per node for dynamic analysis of beams is implemented. The results for different delamination scenarios and beams subjected to different boundary conditions are validated with available experimental results in the literature and/or with the 3D finite element simulation using COMSOL. Results of the first torsional mode frequency for the partially delaminated beam are validated with the COMSOL results. The key point of the proposed model is that partial delamination in beams can be analyzed using a beam model, rather than using 3D or plate models. (c) 2013 Elsevier B.V. All rights reserved.

Joint Routing, Scheduling and Power Control in Multihop MIMO Networks with MAC and Broadcast Links

We consider the problem of joint routing, scheduling and power control in a multihop wireless network when the nodes have multiple antennas. We focus on exploiting the multiple degrees-of-freedom available at each transmitter and receiver due to multiple antennas. Specifically we use multiple antennas at each node to form multiple access and broadcast links in the network rather than just point to point links. We show that such a generic transmission model improves the system performance significantly. Since the complexity of the resulting optimization problem is very high, we also develop efficient suboptimal solutions for joint routing, scheduling and power control in this setup.