On the Chern number of I-admissible filtrations of ideals

Let I be an m-primary ideal of a Noetherian local ring (R, m) of positive dimension. The coefficient e(1)(I) of the Hilbert polynomial of an I-admissible filtration I is called the Chern number of I. A formula for the Chern number has been derived involving the Euler characteristic of subcomplexes of a Koszul complex. Specific formulas for the Chern number have been given in local rings of dimension at most two. These have been used to provide new and unified proofs of several results about e(1)(I).

Constant weight codes based on ideals of commutative rings

We present a construction of constant weight codes based on the prime ideals of a Noetherian commutative ring. The coding scheme is based on the uniqueness of the primary decomposition of ideals in Noetherian rings. The source alphabet consists of a set of radical ideals constructed from a chosen subset of the prime spectrum of the ring. The distance function between two radical ideals is taken to be the Hamming metric based on the symmetric distance between sets. As an application we construct codes for random networks employing SAF routing.

On the Conversion of Hensel Codes to Farey Rationals

Three different algorithms are described for the conversion of Hensel codes to Farey rationals. The first algorithm is based on the trial and error factorization of the weight of a Hensel code, inversion and range test. The second algorithm is deterministic and uses a pair of different p-adic systems for simultaneous computation; from the resulting weights of the two different Hensel codes of the same rational, two equivalence classes of rationals are generated using the respective primitive roots. The intersection of these two equivalence classes uniquely identifies the rational. Both the above algorithms are exponential (in time and/or space).

Effect of antiserum to luteinizing hormone (LHAS) on the physiology of the epididymis and accessory glands in the albino rat

Rabbit antiserum specific to ovine luteinizing hormone free of contaminating antibodies to nonspecific proteins and FSH was administered to adult, intact rats at a dose of 0.1 and 0.2 ml/day for five days. LHAS had no effect on the weights of the epididymis but decreased their secretory activity to castrate level. Administration of 0.2 ml of LHAS or castration resulted in a marked and comparable reduction in the weights and secretory activity of the accessory glands. LHAS, even at a lower dose (0.1 ml/day), caused a significant reduction in the content of sialic acid in the vas deferons and Cowper's glands. These results are discussed in relation to the factors that regulate the functions of the epididymis and accessory glands.

Effect of rabbit antiserum to ovine LH on reproductive organs in male hamsters and guinea-pigs

Administration of rabbit antiserum to ovine luteinizing hormone to immature hamsters and guinea-pigs resulted in a significant decrease in the weights of testes, seminal vesicle and ventral prostate. The author wishes to thank Prof. N.R. Moudgal for his interest and Family Planning Foundation for financial assistance.

Transport of retinol in the duck plasma

Retinol-binding protein and prealbumin were isolated from duck plasma by chromatography on DEAE-cellulose-and DEAE-Sephadex A-50, gel filtration on Sephadex G- 100 and preparative Polyacrylamide gel electrophoresis. The molecular weights of the retinolbinding protein-prealbumin complex, prealbumin and retinol-binding protein were found to be 75,000, 55,0000 and 20,000, respectively. On sodium dodecyl sulphate Polyacrylamide gel electrophoresis, prealbumin dissociated into identical subunits exhibiting a molecular weight of 13,500. Retinol-binding protein exhibited microheterogeneity on electrophoresis, whereas prealbumin moved as a single band unlike the multiple bands observed in chicken and rat.The ultraviolet and fluorescence spectra of the two proteins were similar to those isolated from other species. No carbohydrate moiety was detected in either retinol-binding protein or prealbumin. Duck retinol-binding protein and prealbumin showed cross-reactivity with their counterparts in chicken but differed immunologically from those of goat and man. Retinolbinding protein and prealbumin could be dissociated at low ionic strength, in 2M urea, by CMsephadex chromatography or on preparative electrophoresis. Although the transport of retinol in duck plasma is mediated by carrier proteins as in other species, it is distinguished by the absence of microheterogeneity in prealbumin and of an apo-retinol-binding protein form that could be transported in the plasma.

The purification and properties of peroxidase in Mycobacterium tuberculosis H37Rv and its possible role in the mechanism of action of isonicotinic acid hydrazide

Peroxidase from Mycobacterium tuberculosis H37Rv was purified to homogeneity. The homogeneous protein exhibits catalase and Y (Youatt's)-enzyme activities in addition to peroxidase activity. Further confirmation that the three activities are due to a single enzyme was accomplished by other criteria, such as differential thermal inactivation, sensitivity to different inhibitors, and co-purification. The Y enzyme (peroxidase) was separated from NADase (NAD+ glycohydrolase) inhibitor by gel filtration on Sephadex G-200. The molecular weights of peroxidase and NADase inhibitor, as determined by gel filtration, are 240000 and 98000 respectively. The Y enzyme shows two Km values for both isoniazid (isonicotinic acid hydrazide) and NAD at low and high concentrations. Analysis of the data by Hill plots revealed that the enzyme has one binding site at lower substrate concentrations and more than one at higher substrate concentration. The enzyme contains 6g-atoms of iron/mol. Highly purified preparations of peroxidases from different sources catalyse the Y-enzyme reaction, suggesting that the nature of the reaction may be a peroxidatic oxidation of isoniazid. Moreover, the Y-enzyme reaction is enhanced by O2. Isoniazid-resistant mutants do not exhibit Y-enzyme, peroxidase or catalase activities, and do not take up isoniazid. The Y-enzyme reaction is therefore implicated in the uptake of the drug.

New approximation algorithms for minimum cycle bases of graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time 0(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time 0(n(3+2/k)), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega)) bound. We also present a 2-approximation algorithm with O(m(omega) root n log n) expected running time, a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Purification and characterization of two cellobiohydrolases from Chaetomium thermophile var. coprophile

Cellobiohydrolases I and II were purified to homogeneity from culture filtrates of a thermophilic fungus, Chaetomium thermophile var. coprophile, by using a combination of ion-exchange and gel filtration chromatographic procedures. The molecular weights of cellobiohydrolase I and II were estimated to be 60000 and 40000 and the enzymes were found to be glycoproteins containing 17 and 22.8% carbohydrate, respectively. The two forms differed in their amino-acid composition mainly with respect to threonine, alanine, methionine and arginine. Antibodies produced against either form of cellobiohydrolases failed to cross-react with the other. The tryptic maps of the two enzymes were found to be different. The temperature optima for cellobiohydrolase I and II were 75 and 70°C, and they were optimally active at pH 5.8 and 6.4, respectively. Both enzymes were stable at higher temperatures and were able to degrade crystalline cellulosic materals.

Thermal gap conductance at low contact pressures (<1 MPa): Effect of gold plating and plating thickness

Thermal contact conductance (TCC) measurements are made on bare and gold plated (<= 0.5 mu m) oxygen free high conductivity (OFHC) Cu and brass contacts in vacuum, nitrogen, and argon environments. It is observed that the TCC in gaseous environment is significantly higher than that in vacuum due to the enhanced thermal gap conductance. It is found that for a given contact load and gas pressure, the thermal gap conductance for bare OFHC Cu contacts is higher than that for gold plated contacts. It is due to the difference in the molecular weights of copper and gold, which influences the exchange of kinetic energy between the gas molecules and contact surfaces. Furthermore, the gap conductance is found to increase with increasing thickness of gold plating. Topography measurements and scanning electron microscopy (SEM) analysis of contact surfaces revealed that surfaces become smoother with increasing gold plating thickness, thus resulting in smaller gaps and consequently higher gap conductance. (C) 2010 Elsevier Ltd. All rights reserved.

Entropy and dynamics of water in hydration layers of a bilayer

We compute the entropy and transport properties of water in the hydration layer of dipalmitoylphosphatidylcholine bilayer by using a recently developed theoretical scheme two-phase thermodynamic model, termed as 2PT method; S.-T. Lin et al., J. Chem. Phys. 119, 11792 (2003)] based on the translational and rotational velocity autocorrelation functions and their power spectra. The weights of translational and rotational power spectra shift from higher to lower frequency as one goes from the bilayer interface to the bulk. Water molecules near the bilayer head groups have substantially lower entropy (48.36 J/mol/K) than water molecules in the intermediate region (51.36 J/mol/K), which have again lower entropy than the molecules (60.52 J/mol/K) in bulk. Thus, the entropic contribution to the free energy change (T Delta S) of transferring an interface water molecule to the bulk is 3.65 kJ/mol and of transferring intermediate water to the bulk is 2.75 kJ/mol at 300 K, which is to be compared with 6.03 kJ/mol for melting of ice at 273 K. The translational diffusion of water in the vicinity of the head groups is found to be in a subdiffusive regime and the rotational diffusion constant increases going away from the interface. This behavior is supported by the slower reorientational relaxation of the dipole vector and OH bond vector of interfacial water. The ratio of reorientational relaxation time for Legendre polynomials of order 1 and 2 is approximately 2 for interface, intermediate, and bulk water, indicating the presence of jump dynamics in these water molecules. (C) 2010 American Institute of Physics. doi:10.1063/1.3494115]

New Approximation Algorithms for Minimum Cycle Bases of Graphs

We consider the problem of computing an approximate minimum cycle basis of an undirected non-negative edge-weighted graph G with m edges and n vertices; the extension to directed graphs is also discussed. In this problem, a {0,1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of the weights of the cycles is minimum is called a minimum cycle basis of G. Cycle bases of low weight are useful in a number of contexts, e.g. the analysis of electrical networks, structural engineering, chemistry, and surface reconstruction. Although in most such applications any cycle basis can be used, a low weight cycle basis often translates to better performance and/or numerical stability. Despite the fact that the problem can be solved exactly in polynomial time, we design approximation algorithms since the performance of the exact algorithms may be too expensive for some practical applications. We present two new algorithms to compute an approximate minimum cycle basis. For any integer k >= 1, we give (2k - 1)-approximation algorithms with expected running time O(kmn(1+2/k) + mn((1+1/k)(omega-1))) and deterministic running time O(n(3+2/k) ), respectively. Here omega is the best exponent of matrix multiplication. It is presently known that omega < 2.376. Both algorithms are o(m(omega)) for dense graphs. This is the first time that any algorithm which computes sparse cycle bases with a guarantee drops below the Theta(m(omega) ) bound. We also present a 2-approximation algorithm with expected running time O(M-omega root n log n), a linear time 2-approximation algorithm for planar graphs and an O(n(3)) time 2.42-approximation algorithm for the complete Euclidean graph in the plane.

Vitellins and vitellogenins of Dysdercus koenigii (Heteroptera : Pyrrhocoridae) - identification, purification and temporal pattern

Two vitellins, VtA and VtB, were purified from the eggs of Dysdercus koenigii by gel filtration and ion exchange chromatography. VtA and VtB have molecular weights of 290 and 260 kDa, respectively. Both Vts are glycolipoproteinaceous in nature. VtA is composed of three polypeptides of M-r 116, 92 and 62 kDa while VtB contained an additional subunit of M-r 40 kDa. All subunits except the 116-kDa subunit are glycolipopolypeptides. Polyclonal antibody raised against VtA (anti-VtA antibody) cross-reacted with VtB and also with vitellogenic haemolymph and ovaries and pre-vitellogenic fat bodies, but not with haemolymph from either adult male, fifth instar female, or pre-vitellogenic females demonstrating sex and stage specificity of the Vts. Immunoblots in the presence of anti-VtA revealed two proteins (of 290 and 260 kDa) in both vitellogenic haemolymph and pre-vitellogenic fat bodies that are recognised as D. koenigii Vgs. In newly emerged females, Vgs appeared on day 1 in fat bodies and on day 3 in haemolymph and ovaries. Vg concentration was maximum on day 2 in fat body, day 4 in haemolymph and day 7 in ovary. Although the biochemical and temporal characteristics of these proteins show similarity to some hemipterans, they are strikingly dissimilar with those of a very closely related species. (C) 1999 Elsevier Science Inc. All rights reserved.

An (O)over-bar(m(2)n) randomized algorithm to compute a minimum cycle basis of a directed graph

We consider the problem of computing a minimum cycle basis in a directed graph G. The input to this problem is a directed graph whose arcs have positive weights. In this problem a {- 1, 0, 1} incidence vector is associated with each cycle and the vector space over Q generated by these vectors is the cycle space of G. A set of cycles is called a cycle basis of G if it forms a basis for its cycle space. A cycle basis where the sum of weights of the cycles is minimum is called a minimum cycle basis of G. The current fastest algorithm for computing a minimum cycle basis in a directed graph with m arcs and n vertices runs in O(m(w+1)n) time (where w < 2.376 is the exponent of matrix multiplication). If one allows randomization, then an (O) over tilde (m(3)n) algorithm is known for this problem. In this paper we present a simple (O) over tilde (m(2)n) randomized algorithm for this problem. The problem of computing a minimum cycle basis in an undirected graph has been well-studied. In this problem a {0, 1} incidence vector is associated with each cycle and the vector space over F-2 generated by these vectors is the cycle space of the graph. The fastest known algorithm for computing a minimum cycle basis in an undirected graph runs in O(m(2)n + mn(2) logn) time and our randomized algorithm for directed graphs almost matches this running time.

Identification of Active Sources in Single-Channel Convolutive Mixtures Using Known Source Models

We address the problem of identifying the constituent sources in a single-sensor mixture signal consisting of contributions from multiple simultaneously active sources. We propose a generic framework for mixture signal analysis based on a latent variable approach. The basic idea of the approach is to detect known sources represented as stochastic models, in a single-channel mixture signal without performing signal separation. A given mixture signal is modeled as a convex combination of known source models and the weights of the models are estimated using the mixture signal. We show experimentally that these weights indicate the presence/absence of the respective sources. The performance of the proposed approach is illustrated through mixture speech data in a reverberant enclosure. For the task of identifying the constituent speakers using data from a single microphone, the proposed approach is able to identify the dominant source with up to 8 simultaneously active background sources in a room with RT60 = 250 ms, using models obtained from clean speech data for a Source to Interference Ratio (SIR) greater than 2 dB.