A non-orthogonal cooperative multiple access (NCMA) protocol and low ML decoding complexity codes

A half-duplex constrained non-orthogonal cooperative multiple access (NCMA) protocol suitable for transmission of information from N users to a single destination in a wireless fading channel is proposed. Transmission in this protocol comprises of a broadcast phase and a cooperation phase. In the broadcast phase, each user takes turn broadcasting its data to all other users and the destination in an orthogonal fashion in time. In the cooperation phase, each user transmits a linear function of what it received from all other users as well as its own data. In contrast to the orthogonal extension of cooperative relay protocols to the cooperative multiple access channels wherein at any point of time, only one user is considered as a source and all the other users behave as relays and do not transmit their own data, the NCMA protocol relaxes the orthogonality built into the protocols and hence allows for a more spectrally efficient usage of resources. Code design criteria for achieving full diversity of N in the NCMA protocol is derived using pair wise error probability (PEP) analysis and it is shown that this can be achieved with a minimum total time duration of 2N - 1 channel uses. Explicit construction of full diversity codes is then provided for arbitrary number of users. Since the Maximum Likelihood decoding complexity grows exponentially with the number of users, the notion of g-group decodable codes is introduced for our setup and a set of necesary and sufficient conditions is also obtained.

Stereochemical Analysis of Higher α,α-Dialkylglycine Containing Peptides. Characterization of Local Helical Conformations at Dipropylglycine Residues and Observation of a Novel Hydrated Multiple β-Turn Structure in Crystals of a Glycine Rich Peptide

The peptide Boc-Gly-Dpg-Gly-Gly-Dpg-Gly-NHMe (1) has been synthesized to examine the conformational preferences of Dpg residues in the context of a poor helix promoting sequence. Single crystals of 1 were obtained in the space group P21/c with a = 13.716(2) Å, b = 12.960(2) Å, c = 22.266(4) Å, and β = 98.05(1)°; R = 6.3% for 3660 data with |Fo| > 4σ. The molecular conformation in crystals revealed that the Gly(1)-Dpg(2) segment adopts φ, ψ values distorted from those expected for an ideal type II‘ β-turn (φGly(1) = +72.0°, ψGly(1) = −166.0°; φDpg(2) = −54.0°, ψDpg(2) = −46.0°) with an inserted water molecule between Boc-CO and Gly(3)NH. The Gly(3)-Gly(4) segment adopts φ, ψ values which lie broadly in the right handed helical region (φGly(3) = −78.0°, ψGly(3) = −9.0°; φGly(4) = −80.0°, ψGly(4) = −18.0°). There is a chiral reversal at Dpg(5) which takes up φ, ψ values in the left handed helical region. The Dpg(5)-Gly(6) segment closely resembles an ideal type I‘ β-turn (φDpg(5) = +56.0°, ψDpg(5) = +32.0°; φGly(6) = +85.0°, ψGly(6) = −3.0°). Molecules of both chiral senses are found in the centrosymmetric crystal. The C-terminus forms a hydrated Schellman motif, with water insertion into the potential 6 → 1 hydrogen bond between Gly(1)CO and Gly(6)NH. NMR studies in CDCl3 suggest substantial retention of the multiple turn conformation observed in crystals. In solution the observed NOEs support local helical conformation at the two Dpg residues.

Medium access control schemes for local area networks with multiple priority function

This paper deals with the development and performance evaluation of three modified versions of a scheme proposed for medium access control in local area networks. The original scheme implements a collision-free and fair medium arbitration by using a control wire in conjunction with a data bus. The modifications suggested in this paper are intended to realize the multiple priority function in local area networks.

Relation-Aware Isosurface Extraction in Multifield Data

We introduce a variation density function that profiles the relationship between multiple scalar fields over isosurfaces of a given scalar field. This profile serves as a valuable tool for multifield data exploration because it provides the user with cues to identify interesting isovalues of scalar fields. Existing isosurface-based techniques for scalar data exploration like Reeb graphs, contour spectra, isosurface statistics, etc., study a scalar field in isolation. We argue that the identification of interesting isovalues in a multifield data set should necessarily be based on the interaction between the different fields. We demonstrate the effectiveness of our approach by applying it to explore data from a wide variety of applications.

Modelling multiple disulphide loop containing polypeptides by random conformation generation. The test cases of α-conotoxin GI and edothelin I

A general procedure for arriving at 3-D models of disulphiderich olypeptide systems based on the covalent cross-link constraints has been developed. The procedure, which has been coded as a computer program, RANMOD, assigns a large number of random, permitted backbone conformations to the polypeptide and identifies stereochemically acceptable structures as plausible models based on strainless disulphide bridge modelling. Disulphide bond modelling is performed using the procedure MODIP developed earlier, in connection with the choice of suitable sites where disulphide bonds could be engineered in proteins (Sowdhamini,R., Srinivasan,N., Shoichet,B., Santi,D.V., Ramakrishnan,C. and Balaram,P. (1989) Protein Engng, 3, 95-103). The method RANMOD has been tested on small disulphide loops and the structures compared against preferred backbone conformations derived from an analysis of putative disulphide subdatabase and model calculations. RANMOD has been applied to disulphiderich peptides and found to give rise to several stereochemically acceptable structures. The results obtained on the modelling of two test cases, a-conotoxin GI and endothelin I, are presented. Available NMR data suggest that such small systems exhibit conformational heterogeneity in solution. Hence, this approach for obtaining several distinct models is particularly attractive for the study of conformational excursions.

Taking Multiple Infections of Cells and Recombination into Account Leads to Small Within-Host Effective-Population-Size Estimates of HIV-1

Whether HIV-1 evolution in infected individuals is dominated by deterministic or stochastic effects remains unclear because current estimates of the effective population size of HIV-1 in vivo, N-e, are widely varying. Models assuming HIV-1 evolution to be neutral estimate N-e similar to 10(2)-10(4), smaller than the inverse mutation rate of HIV-1 (similar to 10(5)), implying the predominance of stochastic forces. In contrast, a model that includes selection estimates N-e>10(5), suggesting that deterministic forces would hold sway. The consequent uncertainty in the nature of HIV-1 evolution compromises our ability to describe disease progression and outcomes of therapy. We perform detailed bit-string simulations of viral evolution that consider large genome lengths and incorporate the key evolutionary processes underlying the genomic diversification of HIV-1 in infected individuals, namely, mutation, multiple infections of cells, recombination, selection, and epistatic interactions between multiple loci. Our simulations describe quantitatively the evolution of HIV-1 diversity and divergence in patients. From comparisons of our simulations with patient data, we estimate N-e similar to 10(3)-10(4), implying predominantly stochastic evolution. Interestingly, we find that N-e and the viral generation time are correlated with the disease progression time, presenting a route to a priori prediction of disease progression in patients. Further, we show that the previous estimate of N-e>10(5) reduces as the frequencies of multiple infections of cells and recombination assumed increase. Our simulations with N-e similar to 10(3)-10(4) may be employed to estimate markers of disease progression and outcomes of therapy that depend on the evolution of viral diversity and divergence.

Distributed Coding for Multiple Access Communication with Side Information

In a typical sensor network scenario a goal is to monitor a spatio-temporal process through a number of inexpensive sensing nodes, the key parameter being the fidelity at which the process has to be estimated at distant locations. We study such a scenario in which multiple encoders transmit their correlated data at finite rates to a distant, common decoder over a discrete time multiple access channel under various side information assumptions. In particular, we derive an achievable rate region for this communication problem.

A Study on the Success Potential of Multiple Mobile Payment Technologies

Payment systems all over the world have grown into a complicated web of solutions. This is more challenging in the case of mobile based payment systems. Mobile based payment systems are many and consist of different technologies providing different services. The diffusion of these various technologies in a market is uncertain. Diffusion theorists, for example Rogers, and Davis suggest how innovation is accepted in markets. In the case of electronic payment systems, the tale of Mondex vs Octopus throws interesting insights on diffusion. Our paper attempts to understand the success potential of various mobile payment technologies. We illustrate what we describe as technology breadth in mobile payment systems using data from payment systems all over the world (n=62). Our data shows an unexpected superiority of SMS technology, over other technologies like NFC, WAP and others. We also used a Delphi based survey (n=5) with experts to address the possibility that SMS will gain superiority in market diffusion. The economic conditions of a country, particularly in developing countries, the services availed and characteristics of the user (for example number of un-banked users in large populated countries) may put SMS in the forefront. This may be true more for micro payments using the mobile.

Evidence for the involvement of multiple pathways in the biodegradation of 1- and 2-methylnaphthalene by pseudomonas putida CSV86

Pseudomonas putida CSV86, a soil bacterium, grows on 1- and 2-methylnaphthalene as the sole source of carbon and energy. In order to deduce the pathways for the biodegradation of 1- and 2-methylnaphthalene, metabolites were isolated from the spent medium and purified by thin layer chromatography. Emphasis has been placed on the structural characterisation of isolated intermediates by CC-MS, demonstration of enzyme activities in the cell free extracts and measurement of oxygen uptake by whole cells in the presence of various probable metabolic intermediates. The data obtained from such a study suggest the possibility of occurrence of multiple pathways in the degradation of 1- and 2-methylnaphthalene. We propose that, in one of the pathways, the aromatic ring adjacent to the one bearing the methyl moiety is oxidized leading to the formation of methylsalicylates and methylcatechols. In another pathway the methyl side chain is hydroxylated to -CH2-OH which is further converted to -CHO and -COOH resulting in the formation of naphthoic acid as the end product. In addition to this, 2-hydroxymethylnaphthalene formed by the hydroxylation of the methyl group of 2-methylnaphthalene undergoes aromatic ring hydroxylation. The resultant dihydrodiol is further oxidised by a series of enzyme catalysed reactions to form 4-hydroxymethyl catechol as the end product of the pathway.

Finite data performance of MUSIC and minimum norm methods

In the direction of arrival (DOA) estimation problem, we encounter both finite data and insufficient knowledge of array characterization. It is therefore important to study how subspace-based methods perform in such conditions. We analyze the finite data performance of the multiple signal classification (MUSIC) and minimum norm (min. norm) methods in the presence of sensor gain and phase errors, and derive expressions for the mean square error (MSE) in the DOA estimates. These expressions are first derived assuming an arbitrary array and then simplified for the special case of an uniform linear array with isotropic sensors. When they are further simplified for the case of finite data only and sensor errors only, they reduce to the recent results given in [9-12]. Computer simulations are used to verify the closeness between the predicted and simulated values of the MSE.

Blind separation of multiple co-channel BPSK signals arriving at an antenna array

In this letter, we propose a method for blind separation of d co-channel BPSK signals arriving at an antenna array. Our method involves two steps. In the first step, the received data vectors at the output of the array is grouped into 2d clusters. In the second step, we assign the 2d d-tuples with ±1 elements to these clusters in a consistent fashion. From the knowledge of the cluster to which a data vector belongs, we estimate the bits transmitted at that instant. Computer simulations are used to study the performance of our method

The Folding Mechanism of Barstar: Evidence for Multiple Pathways and Multiple Intermediates

The mechanism of folding of the small protein barstar in the pre-transition zone at pH 7, 25 degrees C has been characterized using rapid mixing techniques. Earlier studies had established the validity of the three-state U-S reversible arrow U-F reversible arrow N mechanism for folding and unfolding in the presence of guanidine hydrochloride (GdnHCl) at concentrations greater than 2.0 M, where U-S and U-F are the slow-refolding and fast-refolding unfolded forms, respectively, and N is the fully folded form. It is now shown that early intermediates, I-S1 and I-S2 as well as a late native-like intermediate, I-N, are present on the folding pathways of U-S, and an early intermediate I-F1 on the folding pathway of U-F, when bars tar is refolded in concentrations of GdnHCl below 2.0 M. The rates of formation and disappearance of I-N, and the rates of formation of N at three different concentrations of GdnHCl in the pre-transition zone have been measured. The data indicate that in 1.5 M GdnHCl, I-N is not fully populated on the U-S --> I-S1 --> I-N --> N pathway because the rate of its formation is so slow that the U-S reversible arrow U-F reversible arrow N pathway can effectively compete with that pathway. In 1.0 M GdnHCl, the U-S --> I-S1 --> I-N transition is so fast that I-N is fully populated. In 0.6 M GdnHCl, I-N appears not to be fully populated because an alternative folding pathway, U-S --> I-S2 --> N, becomes available for the folding of U-S, in addition to the U-S --> I-S1 --> I-N --> N pathway Measurement of the binding of the hydrophobic dye 1-anilino-8-naphthalenesulphonate (ANS) during folding indicates that ANS binds to two distinct intermediates, I-M1 and I-M2, that form within 2 ms on the U-S --> I-M1 --> I-S1 --> I-N --> N and U-S --> I-M2 --> I-S2 --> N pathways. There is no evidence for the accumulation of intermediates that can bind ANS on the folding pathway of U-F.

Novel subspace methods for blind estimation of multiple CFOs in MIMO-OFDM systems

The problem of estimating multiple Carrier Frequency Offsets (CFOs) in the uplink of MIMO-OFDM systems with Co-Channel (CC) and OFDMA based carrier allocation is considered. The tri-linear data model for generalized, multiuser OFDM system is formulated. Novel blind subspace based estimation of multiple CFOs in the case of arbitrary carrier allocation scheme in OFDMA systems and CC users in OFDM systems based on the Khatri-Rao product is proposed. The method works where the conventional subspace method fails. The performance of the proposed methods is compared with pilot based Least-Squares method.

Efficient algorithms for learning kernels from multiple similarity matrices with general convex loss functions

In this paper we consider the problem of learning an n × n kernel matrix from m(1) similarity matrices under general convex loss. Past research have extensively studied the m = 1 case and have derived several algorithms which require sophisticated techniques like ACCP, SOCP, etc. The existing algorithms do not apply if one uses arbitrary losses and often can not handle m > 1 case. We present several provably convergent iterative algorithms, where each iteration requires either an SVM or a Multiple Kernel Learning (MKL) solver for m > 1 case. One of the major contributions of the paper is to extend the well knownMirror Descent(MD) framework to handle Cartesian product of psd matrices. This novel extension leads to an algorithm, called EMKL, which solves the problem in O(m2 log n 2) iterations; in each iteration one solves an MKL involving m kernels and m eigen-decomposition of n × n matrices. By suitably defining a restriction on the objective function, a faster version of EMKL is proposed, called REKL,which avoids the eigen-decomposition. An alternative to both EMKL and REKL is also suggested which requires only an SVMsolver. Experimental results on real world protein data set involving several similarity matrices illustrate the efficacy of the proposed algorithms.

Stream-Close: Fast mining of Closed Frequent Itemsets in high speed data streams

With the emergence of large-volume and high-speed streaming data, the recent techniques for stream mining of CFIpsilas (closed frequent itemsets) will become inefficient. When concept drift occurs at a slow rate in high speed data streams, the rate of change of information across different sliding windows will be negligible. So, the user wonpsilat be devoid of change in information if we slide window by multiple transactions at a time. Therefore, we propose a novel approach for mining CFIpsilas cumulatively by making sliding width(ges1) over high speed data streams. However, it is nontrivial to mine CFIpsilas cumulatively over stream, because such growth may lead to the generation of exponential number of candidates for closure checking. In this study, we develop an efficient algorithm, stream-close, for mining CFIpsilas over stream by exploring some interesting properties. Our performance study reveals that stream-close achieves good scalability and has promising results.