Carbohydrate binding specificity of the B-cell maturation mitogen from Artocarpus integrifolia seeds

Artocarpin, a mannose-specific lectin, is a homotetrameric protein (M(r) 65,000) devoid of covalently attached carbohydrates and consists of four isolectins with pI in the range 5-6.5. Investigations of its carbohydrate binding specificity reveal that among monosaccharides, mannose is preferred over glucose. Among mannooligosaccharides, mannotriose (Man alpha 1-3[Man alpha 1-6]Man) and mannopentaose are the strongest ligands followed by Man alpha 1-3Man. Extension of these ligands by GlcNAc at the reducing ends of mannooligosaccharides tested remarkably improves their inhibitory potencies, while substitution of both the alpha 1-3 and alpha 1-6 mannosyl residues of mannotriose and the core pentasaccharide of N-linked glycans (Man alpha 1-3[Man alpha 1-6]Man beta 1-4GlcNAc beta 1-4GlcNAc) by GlcNAc or N-acetyllactosamine in beta 1-2 linkage diminishes their inhibitory potencies. Sialylated oligosaccharides are non-inhibitory. Moreover, the substitution of either alpha 1-3 or alpha 1-6 linked mannosyl residues of M5Gn or both by mannose in alpha 1-2 linkage leads to a considerable reduction of their inhibitory power. Addition of a xylose residue in beta 1-2 linkage to the core pentasaccharide improves the inhibitory activity. Considering the fact that artocarpin has the strongest affinity for the xylose containing hepasaccharide from horseradish peroxidase, which differs significantly from all the mannose/glucose-specific lectins, it should prove a useful tool for the isolation and characterization of glycoproteins displaying such structure.

Search for the rare decays B+→μ+μ-K+, B0→μ+μ-K*(892)0, and Bs0→μ+μ-ϕ at CDF

We search for b to s\mu^+\mu^- transitions in B meson (B^+, B^0, or B^0_s) decays with 924pb^{-1} of p pbar collisions at sqrt(s)=1.96 TeV collected with the CDF II detector at the Fermilab Tevatron. We find excesses with significances of 4.5, 2.9, and 2.4 standard deviations in the B^+ to \mu^+\mu^-K^+, B^0 to \mu^+\mu^-K^*(892)^0, and B_s^0 to \mu^+\mu^-\phi decay modes, respectively. Using B to J/psi h (h = K^+, K^*(892)^0, phi) decays as normalization channels, we report branching fractions for the previously observed B^+ and B^0 decays, BR(B^+ to \mu^+\mu^-K^+)=(0.59\pm0.15\pm0.04) x 10^{-6}, and BR(B^0 to \mu^+\mu^-K^*(892)^0)=(0.81\pm0.30\pm0.10) x 10^{-6}, where the first uncertainty is statistical, and the second is systematic. These measurements are consistent with the world average results, and are competitive with the best available measurements. We set an upper limit on the relative branching fraction BR(B_s^0 to \mu^+\mu^-\phi)/BR(B_s^0 to J/\psi\phi)

Search for the rare decays B+→μ+μ-K+, B0→μ+μ-K*(892)0, and Bs0→μ+μ-ϕ at CDF

We search for b→sμ+μ- transitions in B meson (B+, B0, or Bs0) decays with 924  pb-1 of pp̅ collisions at √s=1.96  TeV collected with the CDF II detector at the Fermilab Tevatron. We find excesses with significances of 4.5, 2.9, and 2.4 standard deviations in the B+→μ+μ-K+, B0→μ+μ-K*(892)0, and Bs0→μ+μ-ϕ decay modes, respectively. Using B→J/ψh (h=K+, K*(892)0, ϕ) decays as normalization channels, we report branching fractions for the previously observed B+ and B0 decays, B(B+→μ+μ-K+)=(0.59±0.15±0.04)×10-6, and B(B0→μ+μ-K*(892)0)=(0.81±0.30±0.10)×10-6, where the first uncertainty is statistical, and the second is systematic. We set an upper limit on the relative branching fraction B(Bs0→μ+μ-ϕ)/B(Bs0→J/ψϕ)<2.6(2.3)×10-3 at the 95(90)% confidence level, which is the most stringent to date.

A non-orthogonal distributed space-time coded protocol - Part 1:Signal model and design criteria

In this two-part series of papers, a generalized non-orthogonal amplify and forward (GNAF) protocol which generalizes several known cooperative diversity protocols is proposed. Transmission in the GNAF protocol comprises of two phases - the broadcast phase and the cooperation phase. In the broadcast phase, the source broadcasts its information to the relays as well as the destination. In the cooperation phase, the source and the relays together transmit a space-time code in a distributed fashion. The GNAF protocol relaxes the constraints imposed by the protocol of Jing and Hassibi on the code structure. In Part-I of this paper, a code design criteria is obtained and it is shown that the GNAF protocol is delay efficient and coding gain efficient as well. Moreover GNAF protocol enables the use of sphere decoders at the destination with a non-exponential Maximum likelihood (ML) decoding complexity. In Part-II, several low decoding complexity code constructions are studied and a lower bound on the Diversity-Multiplexing Gain tradeoff of the GNAF protocol is obtained.

Thermodynamic measurements of b.c.c. Cr-Mn solid solutions at 1373 K

Thermodynamics of Cr-Mn alloys have been studied by Eremenko et al (l) using a fused salt e.m.f.technique. Their results indicate positive deviations from ideality at 1023 K. Kaufman (2) has independently estimated negative enthaipy and excess entropy for the b.c.c. Cr-Mn alloys, such that at high temperatures, the entropy term predominates over the enthalpy term giving positive deviations from ideality. Recently the thermodynamic properties of the alloys have been measured by 3acob (3) using a Knudsen cell technique in the temperature range of 1200 to 1500 K. The results indicate mild negative deviations from ideality over the entire composition range. Because of the differences in the reported results and Mn being a volatile component in the alloys which leads to surface depletion under a dynamic set up, an isopiestic technique is used to measure the properties of the alloys.

Structural features of B-DNA dodecamer crystal structures: Influence of crystal packing versus base sequence

We have analyzed the set of inter and intra base pair parameters for each dinucleotide step in single crystal structures of dodecamers, solved at high and medium resolution and all crystallized in P2(1)2(1)2(1) space group. The objective was to identify whether all the structures which have either the Drew-Dickerson (DD) sequence d[CGCGAATTCGCG] with some base modification or related sequence (non-DD), would display the same sequence dependent structural variability about its palindromic sequence, despite the molecule being bent at one end because of similar crystal lattice packing effect. Most of the local doublet parameters for base pairs steps G2-C3 and G10-C11 positions, symmetrically situated about the lateral twofold, were significantly correlated between themselves. In non-DD sequences, significant correlations between these positional parameters were absent. The different range of local step parameter values at each sequence position contributed to the gross feature of smooth helix axis bending in all structures. The base pair parameters in some of the positions, for medium resolution DD sequence, were quite unlike the high-resolution set and encompassed a higher range of values. Twist and slide are the two main parameters that show wider conformational range for the middle region of non-DD sequence structures in comparison to DD sequence structures. On the contrary, the minor and major groove features bear good resemblance between DD and non-DD sequence crystal structure datasets. The sugar-phosphate backbone torsion angles are similar in all structures, in sharp contrast to base pair parameter variation for high and low resolution DD and non-DD sequence structures, consisting of unusual (epsilon =g(-), xi =t) B-II conformation at the 10(th) position of the dodecamer sequence. Thus examining DD and non-DD sequence structures packed in the same crystal lattice arrangement, we infer that inter and intra base pair parameters are as symmetrically equivalent in its value as the symmetry related step for the palindromic DD sequence about lateral two-fold axis. This feature would lead us to agree with the conclusion that DNA conformation is not substantially affected by end-to-end or lateral inter-molecular interaction due to crystal lattice packing effect. Non-DD sequence structures acquire step parameter values which reflect the altered sequence at each of the dodecamer sequence position in the orthorhombic lattice while showing similar gross features of DD sequence structures

Popular matchings with variable item copies

We consider the problem of matching people to items, where each person ranks a subset of items in an order of preference, possibly involving ties. There are several notions of optimality about how to best match a person to an item; in particular, popularity is a natural and appealing notion of optimality. A matching M* is popular if there is no matching M such that the number of people who prefer M to M* exceeds the number who prefer M* to M. However, popular matchings do not always provide an answer to the problem of determining an optimal matching since there are simple instances that do not admit popular matchings. This motivates the following extension of the popular matchings problem: Given a graph G = (A U 3, E) where A is the set of people and 2 is the set of items, and a list < c(1),...., c(vertical bar B vertical bar)> denoting upper bounds on the number of copies of each item, does there exist < x(1),...., x(vertical bar B vertical bar)> such that for each i, having x(i) copies of the i-th item, where 1 <= xi <= c(i), enables the resulting graph to admit a popular matching? In this paper we show that the above problem is NP-hard. We show that the problem is NP-hard even when each c(i) is 1 or 2. We show a polynomial time algorithm for a variant of the above problem where the total increase in copies is bounded by an integer k. (C) 2011 Elsevier B.V. All rights reserved.

High-Rate Space-Time Coded Large MIMO Systems: Low-Complexity Detection and Performance

Large MIMO systems with tens of antennas in each communication terminal using full-rate non-orthogonal space-time block codes (STBC) from Cyclic Division Algebras (CDA) can achieve the benefits of both transmit diversity as well as high spectral efficiencies. Maximum-likelihood (ML) or near-ML decoding of these large-sized STBCs at low complexities, however, has been a challenge. In this paper, we establish that near-ML decoding of these large STBCs is possible at practically affordable low complexities. We show that the likelihood ascent search (LAS) detector, reported earlier by us for V-BLAST, is able to achieve near-ML uncoded BER performance in decoding a 32x32 STBC from CDA, which employs 32 transmit antennas and sends 32(2) = 1024 complex data symbols in 32 time slots in one STBC matrix (i.e., 32 data symbols sent per channel use). In terms of coded BER, with a 16x16 STBC, rate-3/4 turbo code and 4-QAM (i.e., 24 bps/Hz), the LAS detector performs close to within just about 4 dB from the theoretical MIMO capacity. Our results further show that, with LAS detection, information lossless (ILL) STBCs perform almost as good as full-diversity ILL (FD-ILL) STBCs. Such low-complexity detectors can potentially enable implementation of high spectral efficiency large MIMO systems that could be considered in wireless standards.

Basis set dependence of the molecular electrostatic potential topography. A case study of substituted benzenes

The basis set dependence of the topographical structure of the molecular electrostatic potential (MESP), as well as the effect of substituents on the MESP distribution, has been investigated with substituted benzenes as test cases. The molecules are studied at HF-SCF 3�21G and 6�31G** levels, with a further MESP topographical investigation at the 3�21G, double-zeta, 6�31G*, 6�31G**, double-zeta polarized and triple-zeta polarized levels. The MESP critical points for a 3�21G optimized/6�31G** basis are similar to the corresponding 6�31G** optimized/6�31G** ones. More generally, the qualitative features of the MESP topography computed at the polarized level are independent of the level at which optimization is carried out. For a proper representation of oxygen lone pairs, however, optimization using a polarized basis set is required. The nature of the substituent drastically changes the MESP distribution over the phenyl ring. The values and positions of MESP minima indicate the most active site for electrophilic attack. This point is strengthened by a study of disubstituted benzenes.

J. B. S. Haldane, Ernst Mayr and the Beanbag Genetics Dispute

Starting from the early decades of the twentieth century, evolutionary biology began to acquire mathematical overtones. This took place via the development of a set of models in which the Darwinian picture of evolution was shown to be consistent with the laws of heredity discovered by Mendel. The models, which came to be elaborated over the years, define a field of study known as population genetics. Population genetics is generally looked upon as an essential component of modern evolutionary theory. This article deals with a famous dispute between J. B. S. Haldane, one of the founders of population genetics, and Ernst Mayr, a major contributor to the way we understand evolution. The philosophical undercurrents of the dispute remain relevant today. Mayr and Haldane agreed that genetics provided a broad explanatory framework for explaining how evolution took place but differed over the relevance of the mathematical models that sought to underpin that framework. The dispute began with a fundamental issue raised by Mayr in 1959: in terms of understanding evolution, did population genetics contribute anything beyond the obvious? Haldane's response came just before his death in 1964. It contained a spirited defense, not just of population genetics, but also of the motivations that lie behind mathematical modelling in biology. While the difference of opinion persisted and was not glossed over, the two continued to maintain cordial personal relations.

On the utility of an instrumented impact set-up to characterise the response of discontinuous buffer strips in carbon–epoxy systems in dry and wet conditions

The use of an instrumented impact test set-up to evaluate the influence of water ingress on the impact response of a carbon–epoxy (C–E) laminated composite system containing discontinuous buffer strips (BS) has been examined. The data on the BS-free C–E sample in dry conditions are used as reference to compare with the data derived from those immersed in water. The work demonstrated the utility of an instrumented impact test set-up in characterising the response, first owing to the architectural difference due to introduction of buffer strips and then due to the presence of an additional phase in the form of water ingressed into the sample. The presence of water was found to enhance the energy absorption characteristics of the C–E system with BS insertions. It was also noticed that with an increasing number of BS layer insertions, the load–time plots displayed characteristic changes. The ductility indices (DI) were found to display a lower value for the water immersed samples compared to the dry ones.

A lower bound for the hitting set size for combinatorial rectangles and an application

We prove a lower bound of Omega(1/epsilon (m + log(d - a)) where a = [log(m) (1/4epsilon)] for the hitting set size for combinatorial rectangles of volume at least epsilon in [m](d) space, for epsilon is an element of [m(-(d-2)), 2/9] and d > 2. (C) 2002 Elsevier Science B.V. All rights reserved.

Two Dimensional Principal Component Analysis for Online Tamil Character Recognition

This paper presents a new application of two dimensional Principal Component Analysis (2DPCA) to the problem of online character recognition in Tamil Script. A novel set of features employing polynomial fits and quartiles in combination with conventional features are derived for each sample point of the Tamil character obtained after smoothing and resampling. These are stacked to form a matrix, using which a covariance matrix is constructed. A subset of the eigenvectors of the covariance matrix is employed to get the features in the reduced sub space. Each character is modeled as a separate subspace and a modified form of the Mahalanobis distance is derived to classify a given test character. Results indicate that the recognition accuracy using the 2DPCA scheme shows an approximate 3% improvement over the conventional PCA technique.

Finite Signal-set Capacity of Two-user Gaussian Multiple Access Channel

The capacity region of a two-user Gaussian Multiple Access Channel (GMAC) with complex finite input alphabets and continuous output alphabet is studied. When both the users are equipped with the same code alphabet, it is shown that, rotation of one of the user’s alphabets by an appropriate angle can make the new pair of alphabets not only uniquely decodable, but will result in enlargement of the capacity region. For this set-up, we identify the primary problem to be finding appropriate angle(s) of rotation between the alphabets such that the capacity region is maximally enlarged. It is shown that the angle of rotation which provides maximum enlargement of the capacity region also minimizes the union bound on the probability of error of the sumalphabet and vice-verse. The optimum angle(s) of rotation varies with the SNR. Through simulations, optimal angle(s) of rotation that gives maximum enlargement of the capacity region of GMAC with some well known alphabets such as M-QAM and M-PSK for some M are presented for several values of SNR. It is shown that for large number of points in the alphabets, capacity gains due to rotations progressively reduce. As the number of points N tends to infinity, our results match the results in the literature wherein the capacity region of the Gaussian code alphabet doesn’t change with rotation for any SNR.

Comparison of HMM and SDTW for Tamil handwritten character recognition

In this paper, we compare the experimental results for Tamil online handwritten character recognition using HMM and Statistical Dynamic Time Warping (SDTW) as classifiers. HMM was used for a 156-class problem. Different feature sets and values for the HMM states & mixtures were tried and the best combination was found to be 16 states & 14 mixtures, giving an accuracy of 85%. The features used in this combination were retained and a SDTW model with 20 states and single Gaussian was used as classifier. Also, the symbol set was increased to include numerals, punctuation marks and special symbols like $, & and #, taking the number of classes to 188. It was found that, with a small addition to the feature set, this simple SDTW classifier performed on par with the more complicated HMM model, giving an accuracy of 84%. Mixture density estimation computations was reduced by 11 times. The recognition is writer independent, as the dataset used is quite large, with a variety of handwriting styles.