Multi-resistance states in the electrical switching behavior of amorphous Si15Te75Ge10 thin films: Possibility of multi-bit storage

Electrical switching studies on amorphous Si15Te75Ge10 thin film devices reveal the existence of two distinct, stable low-resistance, SET states, achieved by varying the electrical input to the device. The multiple resistance levels can be attributed to multi-stage crystallization, as observed from temperature dependant resistance studies. The devices are tested for their ability to be RESET with minimal resistance degradation; further, they exhibit a minimal drift in the SET resistance value even after several months of switching. (c) 2013 Elsevier B.V. All rights reserved.

On the sphere decoding complexity of high-rate multigroup decodable STBCs in asymmetric MIMO systems

A space-time block code (STBC) is said to be multigroup decodable if the information symbols encoded by it can be partitioned into two or more groups such that each group of symbols can be maximum-likelihood (ML) decoded independently of the other symbol groups. In this paper, we show that the upper triangular matrix encountered during the sphere decoding of a linear dispersion STBC can be rank-deficient even when the rate of the code is less than the minimum of the number of transmit and receive antennas. We then show that all known families of high-rate (rate greater than 1) multigroup decodable codes have rank-deficient matrix even when the rate is less than the number of transmit and receive antennas, and this rank-deficiency problem arises only in asymmetric MIMO systems when the number of receive antennas is strictly less than the number of transmit antennas. Unlike the codes with full-rank matrix, the complexity of the sphere decoding-based ML decoder for STBCs with rank-deficient matrix is polynomial in the constellation size, and hence is high. We derive the ML sphere decoding complexity of most of the known high-rate multigroup decodable codes, and show that for each code, the complexity is a decreasing function of the number of receive antennas.

Temperature dependence of resistance and crystallization in amorphous Si15Te85-xGex thin films

Amorphous thin chalcogenide Si15Te85-xGex films (x: 5, 9, 10, 11, 12) are prepared by flash evaporation and the temperature dependence of resistance of these films has been studied in the temperature range 25-250 degrees C. All the compositions show a linear variation of resistance in this temperature range. Apart from the linear variation, a sharp reduction in resistance at one or at two distinct temperatures (T-TR1/T-TR2) is seen. Thin films annealed at these temperatures, when subjected to X-ray diffraction studies suggest that the dominant crystalline phase at T-TR1 and at T-TR2 is the same and the two dips are associated with varying levels of crystallization. This is also reflected in the atomic force microscopic (AFM) study. Further, the resistance of these two phases shows no drift when the films are annealed for varying lengths of time (10 min to 120 min) suggesting the stability of the phases.

Optimization of HfO2 films for high transconductance back gated graphene transistors

Hafnium dioxide (HfO2) films, deposited using electron beam evaporation, are optimized for high performance back-gated graphene transistors. Bilayer graphene is identified on HfO2/Si substrate using optical microscope and subsequently confirmed with Raman spectroscopy. Back-gated graphene transistor, with 32 nm thick HfO2 gate dielectric, has been fabricated with very high transconductance value of 60 mu S. From the hysteresis of the current-voltage characteristics, we estimate the trap density in HfO2 to be in the mid 10(11)/cm(2) range, comparable to SiO2.

Electrical switching in amorphous Si-Te-Ge thin films: Impact of input energy on crystallization process and switching parameters

Electrical switching studies on amorphous Si15Te74Ge11 thin film devices show interesting changes in the switching behavior with changes in the input energy supplied; the input energy determines the extent of crystallization in the active volume, which is reflected in the value of SET resistances. This in turn, determines the trend exhibited by switching voltage (V-t) for different input conditions. The results obtained are analyzed on the basis of the amount of Joule heat generated, which determines the temperature of the active volume. Depending on the final temperature, devices are rendered either in the intermediate state with a resistance of 5*10(2) Omega or the ON state with a resistance of 5*10(1) Omega. (C) 2013 Elsevier B.V. All rights reserved.

A strategy-proof and budget-balanced mechanism for carbon footprint reduction by global companies

The problem addressed in this paper is concerned with an important issue faced by any green aware global company to keep its emissions within a prescribed cap. The specific problem is to allocate carbon reductions to its different divisions and supply chain partners in achieving a required target of reductions in its carbon reduction program. The problem becomes a challenging one since the divisions and supply chain partners, being autonomous, may exhibit strategic behavior. We use a standard mechanism design approach to solve this problem. While designing a mechanism for the emission reduction allocation problem, the key properties that need to be satisfied are dominant strategy incentive compatibility (DSIC) (also called strategy-proofness), strict budget balance (SBB), and allocative efficiency (AE). Mechanism design theory has shown that it is not possible to achieve the above three properties simultaneously. In the literature, a mechanism that satisfies DSIC and AE has recently been proposed in this context, keeping the budget imbalance minimal. Motivated by the observation that SBB is an important requirement, in this paper, we propose a mechanism that satisfies DSIC and SBB with slight compromise in allocative efficiency. Our experimentation with a stylized case study shows that the proposed mechanism performs satisfactorily and provides an attractive alternative mechanism for carbon footprint reduction by global companies.

Mechanism design for green, truthful procurement auctions

Auction based mechanisms have become popular in industrial procurement settings. These mechanisms minimize the cost of procurement and at the same time achieve desirable properties such as truthful bidding by the suppliers. In this paper, we investigate the design of truthful procurement auctions taking into account an additional important issue namely carbon emissions. In particular, we focus on the following procurement problem: A buyer wishes to source multiple units of a homogeneous item from several competing suppliers who offer volume discount bids and who also provide emission curves that specify the cost of emissions as a function of volume of supply. We assume that emission curves are reported truthfully since that information is easily verifiable through standard sources. First we formulate the volume discount procurement auction problem with emission constraints under the assumption that the suppliers are honest (that is they report production costs truthfully). Next we describe a mechanism design formulation for green procurement with strategic suppliers. Our numerical experimentation shows that emission constraints can significantly alter sourcing decisions and affect the procurement costs dramatically. To the best of our knowledge, this is the first effort in explicitly taking into account carbon emissions in planning procurement auctions.

Packet flow analysis in IP networks using data-flow analysis

Static analysis (aka offline analysis) of a model of an IP network is useful for understanding, debugging, and verifying packet flow properties of the network. Data-flow analysis is a method that has typically been applied to static analysis of programs. We propose a new, data-flow based approach for static analysis of packet flows in networks. We also investigate an application of our analysis to the problem of inferring a high-level policy from the network, which has been addressed in the past only for a single router.

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.

Generalized distributive law for ML decoding of STBCs: further results

The problem of designing good Space-Time Block Codes (STBCs) with low maximum-likelihood (ML) decoding complexity has gathered much attention in the literature. All the known low ML decoding complexity techniques utilize the same approach of exploiting either the multigroup decodable or the fast-decodable (conditionally multigroup decodable) structure of a code. We refer to this well known technique of decoding STBCs as Conditional ML (CML) decoding. In [1], we introduced a framework to construct ML decoders for STBCs based on the Generalized Distributive Law (GDL) and the Factor-graph based Sum-Product Algorithm, and showed that for two specific families of STBCs, the Toepltiz codes and the Overlapped Alamouti Codes (OACs), the GDL based ML decoders have strictly less complexity than the CML decoders. In this paper, we introduce a `traceback' step to the GDL decoding algorithm of STBCs, which enables roughly 4 times reduction in the complexity of the GDL decoders proposed in [1]. Utilizing this complexity reduction from `traceback', we then show that for any STBC (not just the Toeplitz and Overlapped Alamouti Codes), the GDL decoding complexity is strictly less than the CML decoding complexity. For instance, for any STBC obtained from Cyclic Division Algebras that is not multigroup or conditionally multigroup decodable, the GDL decoder provides approximately 12 times reduction in complexity compared to the CML decoder. Similarly, for the Golden code, which is conditionally multigroup decodable, the GDL decoder is only about half as complex as the CML decoder.

Full-rate full-diversity finite feedback space-time schemes with minimum feedback and transmission duration

A Finite Feedback Scheme (FFS) for a quasi-static MIMO block fading channel with finite N-ary delay-free noise-free feedback consists of N Space-Time Block Codes (STBCs) at the transmitter, one corresponding to each possible value of feedback, and a function at the receiver that generates N-ary feedback. A number of FFSs are available in the literature that provably attain full-diversity. However, there is no known full-diversity criterion that universally applies to all FFSs. In this paper a universal necessary condition for any FFS to achieve full-diversity is given, and based on this criterion the notion of Feedback-Transmission duration optimal (FT-optimal) FFSs is introduced, which are schemes that use minimum amount of feedback N for the given transmission duration T, and minimum T for the given N to achieve full-diversity. When there is no feedback (N = 1) an FT-optimal scheme consists of a single STBC, and the proposed condition reduces to the well known necessary and sufficient condition for an STBC to achieve full-diversity. Also, a sufficient criterion for full-diversity is given for FFSs in which the component STBC yielding the largest minimum Euclidean distance is chosen, using which full-rate (N-t complex symbols per channel use) full-diversity FT-optimal schemes are constructed for all N-t > 1. These are the first full-rate full-diversity FFSs reported in the literature for T < N-t. Simulation results show that the new schemes have the best error performance among all known FFSs.

Asymptotically-good, multigroup decodable space-time block codes

For a family of Space-Time Block Codes (STBCs) C-1, C-2,..., with increasing number of transmit antennas N-i, with rates R-i complex symbols per channel use, i = 1, 2,..., we introduce the notion of asymptotic normalized rate which we define as lim(i ->infinity) R-i/N-i, and we say that a family of STBCs is asymptotically-good if its asymptotic normalized rate is non-zero, i. e., when the rate scales as a non-zero fraction of the number of transmit antennas. An STBC C is said to be g-group decodable, g >= 2, if the information symbols encoded by it can be partitioned into g groups, such that each group of symbols can be ML decoded independently of the others. In this paper we construct full-diversity g-group decodable codes with rates greater than one complex symbol per channel use for all g >= 2. Specifically, we construct delay-optimal, g-group decodable codes for number of transmit antennas N-t that are a multiple of g2left perpendicular(g-1/2)right perpendicular with rate N-t/g2(g-1) + g(2)-g/2N(t). Using these new codes as building blocks, we then construct non-delay-optimal g-group decodable codes with rate roughly g times that of the delay-optimal codes, for number of antennas N-t that are a multiple of 2left perpendicular(g-1/2)right perpendicular, with delay gN(t) and rate Nt/2(g-1) + g-1/2N(t). For each g >= 2, the new delay-optimal and non-delay- optimal families of STBCs are both asymptotically-good, with the latter family having the largest asymptotic normalized rates among all known families of multigroup decodable codes with delay T <= gN(t). Also, for g >= 3, these are the first instances of g-group decodable codes with rates greater than 1 reported in the literature.

Cu(In,Al)Se-2 thin films by one-step electrodeposition for photovoltaics

Chalcopyrite Cu(In,Al)Se-2 (CIAS) thin films are grown on stainless steel substrate through one-step electrodeposition at room temperature. Indium is partially replaced with aluminum to increase the band gap of CuInSe2 without creating significant change in the original structure. The deposition potential is optimized at -0.8 V (vs. SCE) and annealing of the films is performed in vacuum to remove binary phases present in the as-deposited films. In/Al ratio is varied from 1/9 to 8/2, to find the suitability for solar cell fabrication. For In/Al ratio of less than 8/2, CuAlSe2 phase is formed in the film in addition to the CIAS phase. Depth profile X-ray photoelectron spectroscopy analysis of the CIAS sample prepared with In/Al ratio of 8/2 in the precursor solution confirmed the existence of single phase CIAS throughout the film. This film showed p-type conductivity while the rest of the samples with In/Al ratio less than 8/2 showed n-type conductivity. The band gap of the film varied from 1.06 to 1.45 eV, with variation in deposition potential. Structural, optical, morphological, compositional and electrical characterizations are carried out to establish the suitability of this film for solar cell fabrication. (C) 2013 Elsevier B.V. All rights reserved.

Investigations of Ramachandran disallowed conformations in protein domain families

In peptide and protein structures, occurrence of (phi,psi.) angles in the disallowed region of the Ramachandran map almost always suggests local regions of error or poor accuracy. However, very rarely genuine disallowed conformations occur as noted in the current study in proteins of known structure available at ultra-high resolution (<= 1.2 (A) over circle). In the current work, extent of conservation of genuine disallowed conformations in homologous proteins of known structures has been analyzed. From a dataset of 124 protein domain families, with structure of at least one constituent member in each family available at a resolution of 1.2 (A) over circle or better, we have analyzed the conservation of 221 disallowed conformations. It is observed that the disallowed conformation is only moderately conservedin protein domain families. In the gross dataset no particular residue type adopting disallowed conformation elicit high conservation of residue type though there are alignment positions in the dataset with complete conservation of both the residue type and the disallowed conformation. Conserved disallowed conformation in protein domain families play biologically significant role in roughly 50% of the cases. The residues with the disallowed conformation or its flanking residues are often located within or around the functional site of the protein. (C) 2013 Elsevier B.V. All rights reserved.

Evaluation of chitosan nanoformulations as potent anti-HIV therapeutic systems

Background: Antiretroviral Therapy (ART) is currently the major therapeutic intervention in the treatment of AIDS. ART, however, is severely limited due to poor availability, high cytotoxicity, and enhanced metabolism and clearance of the drug molecules by the renal system. The use of nanocarriers encapsulating the antiretroviral drugs may provide a solution to the aforementioned problems. Importantly, the application of mildly immunogenic polymeric carrier confers the advantage of making the nanoparticles more visible to the immune system leading to their efficient uptake by the phagocytes. Methods: The saquinavir-loaded chitosan nanopartides were characterized by transmission electron microscopy and differential scanning calorimetry and analyzed for the encapsulation efficiency, swelling characteristics, particle size properties, and the zeta potential. Furthermore, cellular uptake of the chitosan nanocarriers was evaluated using confocal microscopy and Flow cytometry. The antiviral efficacy was quantified using viral infection of the target cells. Results: Using novel chitosan carriers loaded with saquinavir, a protease inhibitor, we demonstrate a drug encapsulation efficiency of 75% and cell targeting efficiency greater than 92%. As compared to the soluble drug control, the saquinavir-loaded chitosan carriers caused superior control of the viral proliferation as measured by using two different viral strains, NL4-3 and Indie-C1, and two different target T-cells, Jurkat and CEM-CCR5. Conclusion: Chitosan nanoparticles loaded with saquinavir were characterized and they demonstrated superior drug loading potential with greater cell targeting efficiency leading to efficient control of the viral proliferation in target T-cells. General significance: Our data ascertain the potential of chitosan nanocarriers as novel vehicles for HIV-1 therapeutics. (C) 2013 Elsevier B.V. All rights reserved.